From aac562093153670afa6f13c95fe6e3eff52c6da4 Mon Sep 17 00:00:00 2001 From: Aiden Woodruff Date: Tue, 4 Feb 2025 11:19:34 -0500 Subject: [PATCH 001/319] add aniso_ma_test2 - test/aniso_ma_test2.cc: copy from aniso_ma_test but create a uniform anisotropic sizefield with runtime parameters. - test/CMakeLists.txt: add aniso_ma_test2. - test/testing.cmake: add aniso_ma2 to run aniso_ma_test2. Signed-off-by: Aiden Woodruff --- test/CMakeLists.txt | 1 + test/aniso_ma_test2.cc | 62 ++++++++++++++++++++++++++++++++++++++++++ test/testing.cmake | 10 +++++++ 3 files changed, 73 insertions(+) create mode 100644 test/aniso_ma_test2.cc diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index e0c303870..1b332701c 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -168,6 +168,7 @@ test_exe_func(xgc_split xgc_split.cc) test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) +test_exe_func(aniso_ma_test2 aniso_ma_test2.cc) test_exe_func(torus_ma_test torus_ma_test.cc) test_exe_func(dg_ma_test dg_ma_test.cc) test_exe_func(prismCodeMatch ../ma/prismCodeMatch.cc) diff --git a/test/aniso_ma_test2.cc b/test/aniso_ma_test2.cc new file mode 100644 index 000000000..fe99cf8a9 --- /dev/null +++ b/test/aniso_ma_test2.cc @@ -0,0 +1,62 @@ +#include +#include + +#include +#include +#include +#include +#include +#include + +class AnIso : public ma::AnisotropicFunction +{ + public: + AnIso(ma::Mesh* m, double sf1, double sf2) : + mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) + { + average = ma::getAverageEdgeLength(m); + ma::getBoundingBox(m, lower, upper); + } + virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) + { + double h = average/sizeFactor1; + H = ma::Vector(h, h, h/sizeFactor2); + R = ma::Matrix( + 1.0, 0.0, 0.0, + 0.0, 1.0, 0.0, + 0.0, 0.0, 1.0 + ); + } + private: + ma::Mesh* mesh; + double sizeFactor1, sizeFactor2, average; + ma::Vector lower, upper; +}; + +int main(int argc, char* argv[]) { + if (argc != 5) { + std::cerr << "Usage: " << argv[0] << + " " << std::endl; + return 1; + } + const char* modelFile = argv[1]; + const char* meshFile = argv[2]; + double sizeFactor1 = std::atof(argv[3]), sizeFactor2 = std::atof(argv[4]); + MPI_Init(&argc, &argv); + pcu::PCU *PCUObj = new pcu::PCU(MPI_COMM_WORLD); + lion_set_verbosity(1); + gmi_register_mesh(); + ma::Mesh* m = apf::loadMdsMesh(modelFile, meshFile, PCUObj); + m->verify(); + apf::writeVtkFiles("aniso_ma_test2_before",m); + AnIso sf(m, sizeFactor1, sizeFactor2); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + ma::adapt(in); + m->verify(); + apf::writeVtkFiles("aniso_ma_test2_after",m); + m->destroyNative(); + apf::destroyMesh(m); + delete PCUObj; + MPI_Finalize(); +} + diff --git a/test/testing.cmake b/test/testing.cmake index 084bbb309..47507bdd8 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -328,6 +328,11 @@ if(ENABLE_ZOLTAN) "${MESHES}/cube/cube.dmg" "${MESHES}/cube/pumi670/cube.smb" "0") + mpi_test(aniso_ma2 1 + ./aniso_ma_test + "${MESHES}/cube/cube.dmg" + "${MESHES}/cube/pumi670/cube.smb" + "1" "8") mpi_test(aniso_ma_serial_log_interpolation 1 ./aniso_ma_test "${MESHES}/cube/cube.dmg" @@ -345,6 +350,11 @@ if(ENABLE_ZOLTAN) set_tests_properties(ma_2dLayersOff PROPERTIES PASS_REGULAR_EXPRESSION "number of triangle 18698") endif() +mpi_test(aniso_ma2 1 + ./aniso_ma_test2 + "${MESHES}/cube/cube.dmg" + "${MESHES}/cube/pumi670/cube.smb" + "1" "8") mpi_test(tet_serial 1 ./tetrahedronize "${MDIR}/pipe.${GXT}" From 3eebeb4d82d520be3e886afb16594d9e3f6cad31 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 13 Mar 2025 16:04:29 -0400 Subject: [PATCH 002/319] aniso ma test 2 changes --- test/aniso_ma_test2.cc | 10 ++++++++-- test/testing.cmake | 5 ----- 2 files changed, 8 insertions(+), 7 deletions(-) diff --git a/test/aniso_ma_test2.cc b/test/aniso_ma_test2.cc index fe99cf8a9..3fc4df947 100644 --- a/test/aniso_ma_test2.cc +++ b/test/aniso_ma_test2.cc @@ -1,5 +1,6 @@ #include #include +#include #include #include @@ -34,9 +35,9 @@ class AnIso : public ma::AnisotropicFunction }; int main(int argc, char* argv[]) { - if (argc != 5) { + if (argc != 6) { std::cerr << "Usage: " << argv[0] << - " " << std::endl; + " " << std::endl; return 1; } const char* modelFile = argv[1]; @@ -51,9 +52,14 @@ int main(int argc, char* argv[]) { apf::writeVtkFiles("aniso_ma_test2_before",m); AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + // in->shouldFixShape = false; + // in->shouldCoarsen = false; + // in->shouldSnap = false; + // in->shouldCleanupLayer = false; ma::adapt(in); m->verify(); apf::writeVtkFiles("aniso_ma_test2_after",m); + m->writeNative(argv[5]); m->destroyNative(); apf::destroyMesh(m); delete PCUObj; diff --git a/test/testing.cmake b/test/testing.cmake index 47507bdd8..721b3ba61 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -350,11 +350,6 @@ if(ENABLE_ZOLTAN) set_tests_properties(ma_2dLayersOff PROPERTIES PASS_REGULAR_EXPRESSION "number of triangle 18698") endif() -mpi_test(aniso_ma2 1 - ./aniso_ma_test2 - "${MESHES}/cube/cube.dmg" - "${MESHES}/cube/pumi670/cube.smb" - "1" "8") mpi_test(tet_serial 1 ./tetrahedronize "${MDIR}/pipe.${GXT}" From e9ca0db9149b478b7a5eddec677940bdf27e2e83 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 19 Mar 2025 21:16:38 -0400 Subject: [PATCH 003/319] coarsen test --- ma/maCoarsen.cc | 66 ++++++++++++++++++++++++++ ma/maCoarsen.h | 1 + test/CMakeLists.txt | 1 + test/aniso_ma_test2.cc | 7 +++ test/coarsen.cc | 103 +++++++++++++++++++++++++++++++++++++++++ test/testing.cmake | 1 + 6 files changed, 179 insertions(+) create mode 100644 test/coarsen.cc diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 35089e344..96872af5d 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -13,6 +13,7 @@ #include "maMatchedCollapse.h" #include "maOperator.h" #include +#include "apfShape.h" namespace ma { @@ -253,4 +254,69 @@ bool coarsen(Adapt* a) return true; } +void printFields(Adapt* a, Mesh* m, std::string name) +{ + apf::Field* f = m->findField("collapse_edges"); + if (!f) + f = apf::createField(m, "collapse_edges", apf::SCALAR, apf::getConstant(1)); + apf::MeshIterator* it = m->begin(1); + apf::MeshEntity* e; + while ((e = m->iterate(it))) { + if (getFlag(a, e, COLLAPSE)) + apf::setScalar(f, e, 0, 1); + else + apf::setScalar(f, e, 0, 0); + } + m->end(it); + + f = m->findField("collapse_verts"); + if (!f) + f = apf::createFieldOn(m, "collapse_verts", apf::SCALAR); + it = m->begin(0); + while ((e = m->iterate(it))) { + if (getFlag(a, e, COLLAPSE)) + apf::setScalar(f, e, 0, 1); + else + apf::setScalar(f, e, 0, 0); + } + m->end(it); + + apf::writeVtkFiles(name.c_str(), m, 1); +} + +bool coarsenAndPrint(Adapt* a) +{ + if (!a->input->shouldCoarsen) + return false; + double t0 = pcu::Time(); + --(a->coarsensLeft); + long count = markEdgesToCollapse(a); + if ( ! count) + return false; + Mesh* m = a->mesh; + int maxDimension = m->getDimension(); + PCU_ALWAYS_ASSERT(checkFlagConsistency(a,1,COLLAPSE)); + long successCount = 0; + + printFields(a, m, "flag_edges"); + + for (int modelDimension=1; modelDimension <= maxDimension; ++modelDimension) + { + checkAllEdgeCollapses(a,modelDimension); + std::string dim = std::to_string(modelDimension); + printFields(a, m, "flag_verts"+dim); + findIndependentSet(a); + printFields(a, m, "independent_set"+dim); + if (m->hasMatching()) + successCount += collapseMatchedEdges(a, modelDimension); + else + successCount += collapseAllEdges(a, modelDimension); + apf::writeVtkFiles(("after_collapse"+dim).c_str(), m, 1); + } + successCount = m->getPCU()->Add(successCount); + double t1 = pcu::Time(); + print(m->getPCU(), "coarsened %li edges in %f seconds", successCount,t1-t0); + return true; +} + } diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index bf83b1e54..b0ebc435e 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -16,6 +16,7 @@ class Adapt; bool coarsen(Adapt* a); bool coarsenLayer(Adapt* a); +bool coarsenAndPrint(Adapt* a); void checkAllEdgeCollapses(Adapt* a, int modelDimension); void findIndependentSet(Adapt* a); diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 1b332701c..2d75b7eaf 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -177,6 +177,7 @@ test_exe_func(newdim newdim.cc) test_exe_func(construct construct.cc) test_exe_func(constructThenGhost constructThenGhost.cc) test_exe_func(construct_bottom_up construct_bottom_up.cc) +test_exe_func(coarsen coarsen.cc) test_exe_func(embedded_edges embedded_edges.cc) test_exe_func(test_scaling test_scaling.cc) test_exe_func(mixedNumbering mixedNumbering.cc) diff --git a/test/aniso_ma_test2.cc b/test/aniso_ma_test2.cc index 3fc4df947..6a892a6ce 100644 --- a/test/aniso_ma_test2.cc +++ b/test/aniso_ma_test2.cc @@ -8,6 +8,8 @@ #include #include #include +#include "maCoarsen.h" +#include "maAdapt.h" class AnIso : public ma::AnisotropicFunction { @@ -40,6 +42,7 @@ int main(int argc, char* argv[]) { " " << std::endl; return 1; } + //Load Mesh const char* modelFile = argv[1]; const char* meshFile = argv[2]; double sizeFactor1 = std::atof(argv[3]), sizeFactor2 = std::atof(argv[4]); @@ -50,6 +53,8 @@ int main(int argc, char* argv[]) { ma::Mesh* m = apf::loadMdsMesh(modelFile, meshFile, PCUObj); m->verify(); apf::writeVtkFiles("aniso_ma_test2_before",m); + + //Adapt AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); // in->shouldFixShape = false; @@ -60,6 +65,8 @@ int main(int argc, char* argv[]) { m->verify(); apf::writeVtkFiles("aniso_ma_test2_after",m); m->writeNative(argv[5]); + + //Clean up m->destroyNative(); apf::destroyMesh(m); delete PCUObj; diff --git a/test/coarsen.cc b/test/coarsen.cc new file mode 100644 index 000000000..6f6da4294 --- /dev/null +++ b/test/coarsen.cc @@ -0,0 +1,103 @@ +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include "maAdapt.h" +#include "maCoarsen.h" +#include "apfShape.h" + +double vtx_coords[6][3] = { + {1.0, 0.0, 0.0}, + {1.0, 0.5, 0.0}, + {1.0, 1.0, 0.0}, + {0.5, 0.5, 0.0}, + {0.0, 0.0, 0.0}, + {0.0, 1.0, 0.0} +}; + +apf::Gid triangles[5][3] = { + {0, 1, 3}, + {1, 2, 3}, + {0, 3, 4}, + {3, 2, 5}, + {3, 5, 4}, +}; + +class AnIso : public ma::AnisotropicFunction +{ + public: + AnIso(ma::Mesh* m, double sf1, double sf2) : + mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) + { + average = ma::getAverageEdgeLength(m); + ma::getBoundingBox(m, lower, upper); + } + virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) + { + double h = average/sizeFactor1; + H = ma::Vector(h, h, h/sizeFactor2); + R = ma::Matrix( + 1.0, 0.0, 0.0, + 0.0, 1.0, 0.0, + 0.0, 0.0, 1.0 + ); + } + private: + ma::Mesh* mesh; + double sizeFactor1, sizeFactor2, average; + ma::Vector lower, upper; +}; + + +int main(int argc, char** argv) +{ + MPI_Init(&argc,&argv); + { + pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); + lion_set_verbosity(1); + gmi_register_mesh(); + gmi_register_null(); + + apf::Gid* conn = &triangles[0][0]; + double* coords = &vtx_coords[0][0]; + + int nelem=5; + int etype=2; + int nverts=6; + int dim=2; + + //Create mesh + gmi_model* model = gmi_load(".null"); + apf::Mesh2* m = apf::makeEmptyMdsMesh(model, dim, false, &PCUObj); + apf::GlobalToVert outMap; + apf::construct(m, conn, nelem, etype, outMap); + apf::alignMdsRemotes(m); + apf::deriveMdsModel(m); + apf::setCoords(m, coords, nverts, outMap); + outMap.clear(); + m->verify(); + apf::writeVtkFiles("before_coarsen", m); + + //Coarsen + AnIso sf(m, 0.7, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + in->maximumIterations = 1; + in->shouldCoarsen = true; + validateInput(in); + ma::Adapt* a = new ma::Adapt(in); + coarsenAndPrint(a); + m->verify(); + + apf::writeVtkFiles("after_coarsen", m, 1); + + m->destroyNative(); + apf::destroyMesh(m); + } + MPI_Finalize(); +} + diff --git a/test/testing.cmake b/test/testing.cmake index 721b3ba61..0db7f5e71 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -629,6 +629,7 @@ mpi_test(construct_bottom_up 1 ./construct_bottom_up "${MDIR}/bottom_up_constructed_cube.smb" "${MDIR}/cube.dmg") +mpi_test(coarsen 1 ./coarsen) set(MDIR ${MESHES}/embeddedEdges) mpi_test(embedded_edges 1 ./embedded_edges From 3c2faa9804152aeb44a08edf77fa1898520a764f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 26 Mar 2025 23:17:02 -0400 Subject: [PATCH 004/319] simple snap --- ma/maRefine.cc | 12 ++++++++++++ ma/maRefine.h | 2 ++ ma/maSnap.cc | 48 ++++++++++++++++++++++++++++++++++++++++++++++++ test/cap2vtk.cc | 42 ++++++++++++++++++++++++++++++++++++++++-- 4 files changed, 102 insertions(+), 2 deletions(-) diff --git a/ma/maRefine.cc b/ma/maRefine.cc index 915d8481a..78cedee10 100644 --- a/ma/maRefine.cc +++ b/ma/maRefine.cc @@ -126,6 +126,17 @@ Refine::~Refine() m->destroyTag(numberTag); } +void AddVertexToSnap(Refine* r, Entity* vert) +{ + Adapt* a = r->adapt; + Mesh* m = a->mesh; + int dim = m->getDimension(); + int md = m->getModelType(m->toModel(vert)); + if (dim == md) return; + r->vtxToSnap.push(vert); + setFlag(a, vert, SNAP); +} + Entity* makeSplitVert(Refine* r, Entity* edge) { Adapt* a = r->adapt; @@ -144,6 +155,7 @@ Entity* makeSplitVert(Refine* r, Entity* edge) if (a->input->shouldTransferToClosestPoint) transferToClosestPointOnEdgeSplit(m,edge,0.5,param); Entity* vert = buildVertex(a,c,point,param); + AddVertexToSnap(r, vert); st->onVertex(me,xi,vert); sf->interpolate(me,xi,vert); apf::destroyMeshElement(me); diff --git a/ma/maRefine.h b/ma/maRefine.h index 88efd8275..acca94c8f 100644 --- a/ma/maRefine.h +++ b/ma/maRefine.h @@ -12,6 +12,7 @@ #include "maMesh.h" #include "maTables.h" +#include namespace ma { @@ -26,6 +27,7 @@ class Refine Tag* numberTag; EntityArray toSplit[4]; apf::DynamicArray newEntities[4]; + std::queue vtxToSnap; bool shouldCollect[4]; }; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index e754af553..6a5b8d140 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -11,6 +11,7 @@ #include "maAdapt.h" #include "maOperator.h" #include "maSnapper.h" +#include "maRefine.h" #include "maMatchedSnapper.h" #include "maLayer.h" #include "maMatch.h" @@ -903,7 +904,54 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } +void trySnapping(Adapt* a) { + Mesh* mesh = a->mesh; + Refine* refine = a->refine; + while (!refine->vtxToSnap.empty()) { + Entity* vertex = refine->vtxToSnap.front(); + refine->vtxToSnap.pop(); + Vector target; + Vector prev = getPosition(mesh, vertex); + + getSnapPoint(mesh, vertex, target); + + Upward adjacentElements; + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + mesh->setPoint(vertex, 0, target); + + if(!areTetsValid(mesh, adjacentElements)) + mesh->setPoint(vertex, 0, prev); + } +} + +void printSnapFields(Adapt* a, Mesh* m, std::string name) +{ + apf::Field* f = m->findField("vtx_to_snap"); + if (!f) + f = apf::createFieldOn(m, "vtx_to_snap", apf::SCALAR); + apf::MeshIterator* it = m->begin(0); + apf::MeshEntity* e; + while ((e = m->iterate(it))) { + if (getFlag(a, e, SNAP)) + apf::setScalar(f, e, 0, 1); + else + apf::setScalar(f, e, 0, 0); + } + m->end(it); + + apf::writeVtkFiles(name.c_str(), m, 1); +} + void snap(Adapt* a) +{ + if ( ! a->input->shouldSnap) + return; + printSnapFields(a, a->mesh, "snap_flag"); + trySnapping(a); + clearFlagFromDimension(a, SNAP, 0); +} + +void prevSnap(Adapt* a) { if ( ! a->input->shouldSnap) return; diff --git a/test/cap2vtk.cc b/test/cap2vtk.cc index a2891e4ec..67d675daa 100644 --- a/test/cap2vtk.cc +++ b/test/cap2vtk.cc @@ -21,6 +21,10 @@ #include #include #include +#include "maAdapt.h" +#include "maCoarsen.h" +#include "maRefine.h" +#include "maSnap.h" #include "CapstoneModule.h" @@ -37,6 +41,30 @@ using namespace CreateMG::Attribution; using namespace CreateMG::Mesh; using namespace CreateMG::Geometry; +class AnIso : public ma::AnisotropicFunction +{ + public: + AnIso(ma::Mesh* m, double sf1, double sf2) : + mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) + { + average = ma::getAverageEdgeLength(m); + ma::getBoundingBox(m, lower, upper); + } + virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) + { + double h = average/sizeFactor1; + H = ma::Vector(h, h, h/sizeFactor2); + R = ma::Matrix( + 1.0, 0.0, 0.0, + 0.0, 1.0, 0.0, + 0.0, 0.0, 1.0 + ); + } + private: + ma::Mesh* mesh; + double sizeFactor1, sizeFactor2, average; + ma::Vector lower, upper; +}; int main(int argc, char** argv) { @@ -134,8 +162,18 @@ int main(int argc, char** argv) // convert the mesh to apf/mds mesh apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); - - apf::writeVtkFiles(folderName, mesh); + mesh->verify(); + apf::writeVtkFiles("before_snap",mesh); + + //Adapt + AnIso sf(mesh, 2, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(mesh, &sf)); + in->maximumIterations = 1; + ma::Adapt* a = new ma::Adapt(in); + ma::refine(a); + ma::snap(a); + mesh->verify(); + apf::writeVtkFiles("after_snap",mesh); gmi_cap_stop(); } From 604c6a55e739fccf440a1ccff06238feac04778d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 28 Mar 2025 10:00:37 -0400 Subject: [PATCH 005/319] check snap --- ma/maSnap.cc | 49 ++++++++++++++++++++++++++++++++++++++----------- test/cap2vtk.cc | 10 +++++++--- 2 files changed, 45 insertions(+), 14 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 6a5b8d140..ed26552b3 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -904,34 +904,59 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -void trySnapping(Adapt* a) { +void trySnapping(Adapt* a) +{ Mesh* mesh = a->mesh; Refine* refine = a->refine; - while (!refine->vtxToSnap.empty()) { - Entity* vertex = refine->vtxToSnap.front(); - refine->vtxToSnap.pop(); - Vector target; - Vector prev = getPosition(mesh, vertex); + auto vtxToSnap = refine->vtxToSnap; + int notProcessed = vtxToSnap.size(); + print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", notProcessed); + while (notProcessed > 0) + { + notProcessed--; + Entity* vertex = vtxToSnap.front(); + vtxToSnap.pop(); + if (!getFlag(a, vertex, SNAP)) + { + print(a->mesh->getPCU(), "Error: Vertex incorrectly flagged to snap\n"); + continue; + } + + Vector prev = getPosition(mesh, vertex); + Vector target; getSnapPoint(mesh, vertex, target); + if (apf::areClose(prev, target, 1e-12)) + { + clearFlag(a, vertex, SNAP); + continue; + } Upward adjacentElements; mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); mesh->setPoint(vertex, 0, target); - if(!areTetsValid(mesh, adjacentElements)) + if (!areTetsValid(mesh, adjacentElements)) + { mesh->setPoint(vertex, 0, prev); + vtxToSnap.push(vertex); + } + else + clearFlag(a, vertex, SNAP); } + + print(a->mesh->getPCU(), "Number of vertices failed %d\n", vtxToSnap.size()); } void printSnapFields(Adapt* a, Mesh* m, std::string name) { - apf::Field* f = m->findField("vtx_to_snap"); + apf::Field* f = m->findField("SNAP"); if (!f) - f = apf::createFieldOn(m, "vtx_to_snap", apf::SCALAR); + f = apf::createFieldOn(m, "SNAP", apf::SCALAR); apf::MeshIterator* it = m->begin(0); apf::MeshEntity* e; - while ((e = m->iterate(it))) { + while ((e = m->iterate(it))) + { if (getFlag(a, e, SNAP)) apf::setScalar(f, e, 0, 1); else @@ -946,9 +971,11 @@ void snap(Adapt* a) { if ( ! a->input->shouldSnap) return; - printSnapFields(a, a->mesh, "snap_flag"); + printSnapFields(a, a->mesh, "vtx_to_snap"); trySnapping(a); + printSnapFields(a, a->mesh, "vtx_snap_failed"); clearFlagFromDimension(a, SNAP, 0); + a->refine->vtxToSnap = {}; } void prevSnap(Adapt* a) diff --git a/test/cap2vtk.cc b/test/cap2vtk.cc index 67d675daa..bc7f672ad 100644 --- a/test/cap2vtk.cc +++ b/test/cap2vtk.cc @@ -25,6 +25,7 @@ #include "maCoarsen.h" #include "maRefine.h" #include "maSnap.h" +#include "lionPrint.h" #include "CapstoneModule.h" @@ -166,12 +167,15 @@ int main(int argc, char** argv) apf::writeVtkFiles("before_snap",mesh); //Adapt + lion_set_verbosity(1); AnIso sf(mesh, 2, 1); ma::Input* in = ma::makeAdvanced(ma::configure(mesh, &sf)); - in->maximumIterations = 1; ma::Adapt* a = new ma::Adapt(in); - ma::refine(a); - ma::snap(a); + for (int i = 0; i < in->maximumIterations; ++i) + { + ma::refine(a); + ma::snap(a); + } mesh->verify(); apf::writeVtkFiles("after_snap",mesh); From 9801f04d7607f0bfabb03f395e26ee0dd2adcb83 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 11:18:00 -0400 Subject: [PATCH 006/319] refineSnap test --- gmi_cap/gmi_cap.cc | 2 + ma/maRefine.cc | 7 ++ test/CMakeLists.txt | 1 + test/refineSnap.cc | 186 ++++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 196 insertions(+) create mode 100644 test/refineSnap.cc diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index 64b23e26a..67111c6f9 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -197,6 +197,8 @@ static int periodic(struct gmi_model* m, struct gmi_ent* e, int dim) /* PARAM_COMPOSITE=4, //!< parametrization of a composite edge or face */ /* PARAM_UNBOUNDED=8 //!< infinite parametrization */ /* }; */ + if (paramType & 1) return 0; + return paramType & (1<<1); } diff --git a/ma/maRefine.cc b/ma/maRefine.cc index 78cedee10..1fb055fc7 100644 --- a/ma/maRefine.cc +++ b/ma/maRefine.cc @@ -19,6 +19,7 @@ #include "maLayer.h" #include #include +#include namespace ma { @@ -149,6 +150,12 @@ Entity* makeSplitVert(Refine* r, Entity* edge) apf::MeshElement* me = apf::createMeshElement(m,edge); Vector point; apf::mapLocalToGlobal(me,xi,point); + + // Vector failed(-0.279880, -0.093306, 0.132892); + // if (apf::areClose(point, failed, 1e-5)){ + // printf("===FAILED FOUND\n"); + // } + Vector param(0,0,0); //prevents uninitialized values if (a->input->shouldTransferParametric) transferParametricOnEdgeSplit(m,edge,0.5,param); diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 2d75b7eaf..25eb083e3 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -169,6 +169,7 @@ test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) test_exe_func(aniso_ma_test2 aniso_ma_test2.cc) +test_exe_func(refineSnap refineSnap.cc) test_exe_func(torus_ma_test torus_ma_test.cc) test_exe_func(dg_ma_test dg_ma_test.cc) test_exe_func(prismCodeMatch ../ma/prismCodeMatch.cc) diff --git a/test/refineSnap.cc b/test/refineSnap.cc new file mode 100644 index 000000000..26947386a --- /dev/null +++ b/test/refineSnap.cc @@ -0,0 +1,186 @@ +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include "maAdapt.h" +#include "maCoarsen.h" +#include "maRefine.h" +#include "maSnap.h" +#include "lionPrint.h" + + +#include "CapstoneModule.h" +#include "CreateMG_Framework_Core.h" +#include "CreateMG_Framework_Analysis.h" +#include "CreateMG_Framework_Application.h" +#include "CreateMG_Framework_Attributes.h" +#include "CreateMG_Framework_Core.h" +#include "CreateMG_Framework_Geometry.h" +#include "CreateMG_Framework_Mesh.h" + +using namespace CreateMG; +using namespace CreateMG::Attribution; +using namespace CreateMG::Mesh; +using namespace CreateMG::Geometry; + +class AnIso : public ma::AnisotropicFunction +{ + public: + AnIso(ma::Mesh* m, double sf1, double sf2) : + mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) + { + average = ma::getAverageEdgeLength(m); + ma::getBoundingBox(m, lower, upper); + } + virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) + { + double h = average/sizeFactor1; + H = ma::Vector(h, h, h/sizeFactor2); + R = ma::Matrix( + 1.0, 0.0, 0.0, + 0.0, 1.0, 0.0, + 0.0, 0.0, 1.0 + ); + } + private: + ma::Mesh* mesh; + double sizeFactor1, sizeFactor2, average; + ma::Vector lower, upper; +}; + +int main(int argc, char** argv) +{ + MPI_Init(&argc, &argv); + { + pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); + + if (argc != 3) { + if(0==PCUObj.Self()) + std::cerr << "usage: " << argv[0] + << " \n"; + return EXIT_FAILURE; + } + + + gmi_register_mesh(); + gmi_register_null(); + + const char* creFileName = argv[1]; + const char* folderName = argv[2]; + + // load capstone mesh + // create an instance of the Capstone Module activating CREATE/CREATE/CREATE + // for the Geometry/Mesh/Attribution databases + /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ + const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD + const std::string mdbName("Mesh Database : Create"); + const std::string adbName("Attribution Database : Create"); + + CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); + + GeometryDatabaseInterface *g = cs.get_geometry(); + MeshDatabaseInterface *m = cs.get_mesh(); + AppContext *c = cs.get_context(); + + + PCU_ALWAYS_ASSERT(g); + PCU_ALWAYS_ASSERT(m); + PCU_ALWAYS_ASSERT(c); + + v_string filenames; + filenames.push_back(creFileName); + + M_GModel gmodel = cs.load_files(filenames); + + int numbreps = 0; + MG_CALL(g->get_num_breps(numbreps)); + std::cout << "number of b reps is " << numbreps << std::endl; + if(numbreps == 0) + error(HERE, ERR_INVALID_INPUT, "Model is empty"); + + M_MModel mmodel; + // Pick the volume mesh model from associated mesh models to this geom model + std::vector mmodels; + MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); + for(std::size_t i = 0; i < mmodels.size(); ++i) + { + M_MModel ammodel = mmodels[i]; + std::size_t numregs = 0; + std::size_t numfaces = 0; + std::size_t numedges = 0; + std::size_t numverts = 0; + MG_API_CALL(m, set_current_model(ammodel)); + MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); + MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); + MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); + MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); + std::cout << "num regions is " << numregs << std::endl; + std::cout << "num faces is " << numfaces << std::endl; + std::cout << "num edges is " << numedges << std::endl; + std::cout << "num verts is " << numverts << std::endl; + std::cout << "-----------" << std::endl; + if(numregs > 0) + { + mmodel = ammodel; + break; + } + } + + /* SET THE ADJACENCIES */ + MG_API_CALL(m, set_adjacency_state(REGION2FACE| + REGION2EDGE| + REGION2VERTEX| + FACE2EDGE| + FACE2VERTEX)); + MG_API_CALL(m, set_reverse_states()); + MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); + MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); + MG_API_CALL(m, compute_adjacency()); + + + gmi_cap_start(); + gmi_register_cap(); + + // convert the mesh to apf/mds mesh + + apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); + mesh->verify(); + apf::writeVtkFiles("before_snap",mesh); + + //Adapt + lion_set_verbosity(1); + AnIso sf(mesh, 2, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(mesh, &sf)); + in->maximumIterations = 1; + ma::Adapt* a = new ma::Adapt(in); + for (int i = 0; i < in->maximumIterations; ++i) + { + ma::refine(a); + ma::snap(a); + } + mesh->verify(); + apf::writeVtkFiles("after_snap",mesh); + + gmi_cap_stop(); + } + MPI_Finalize(); +} From 3f5899451bb5e4534cc33c10f48058b16ea470b2 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 11:26:17 -0400 Subject: [PATCH 007/319] revert cap2vtk changes --- test/cap2vtk.cc | 47 ++--------------------------------------------- 1 file changed, 2 insertions(+), 45 deletions(-) diff --git a/test/cap2vtk.cc b/test/cap2vtk.cc index bc7f672ad..c6a8656c1 100644 --- a/test/cap2vtk.cc +++ b/test/cap2vtk.cc @@ -21,11 +21,6 @@ #include #include #include -#include "maAdapt.h" -#include "maCoarsen.h" -#include "maRefine.h" -#include "maSnap.h" -#include "lionPrint.h" #include "CapstoneModule.h" @@ -42,30 +37,6 @@ using namespace CreateMG::Attribution; using namespace CreateMG::Mesh; using namespace CreateMG::Geometry; -class AnIso : public ma::AnisotropicFunction -{ - public: - AnIso(ma::Mesh* m, double sf1, double sf2) : - mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) - { - average = ma::getAverageEdgeLength(m); - ma::getBoundingBox(m, lower, upper); - } - virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) - { - double h = average/sizeFactor1; - H = ma::Vector(h, h, h/sizeFactor2); - R = ma::Matrix( - 1.0, 0.0, 0.0, - 0.0, 1.0, 0.0, - 0.0, 0.0, 1.0 - ); - } - private: - ma::Mesh* mesh; - double sizeFactor1, sizeFactor2, average; - ma::Vector lower, upper; -}; int main(int argc, char** argv) { @@ -161,23 +132,9 @@ int main(int argc, char** argv) gmi_register_cap(); // convert the mesh to apf/mds mesh - apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); - mesh->verify(); - apf::writeVtkFiles("before_snap",mesh); - - //Adapt - lion_set_verbosity(1); - AnIso sf(mesh, 2, 1); - ma::Input* in = ma::makeAdvanced(ma::configure(mesh, &sf)); - ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < in->maximumIterations; ++i) - { - ma::refine(a); - ma::snap(a); - } - mesh->verify(); - apf::writeVtkFiles("after_snap",mesh); + + apf::writeVtkFiles(folderName, mesh); gmi_cap_stop(); } From 03c286986e999c3bef513aeecbee5a854f602933 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 11:34:07 -0400 Subject: [PATCH 008/319] remove white space --- gmi_cap/gmi_cap.cc | 1 - test/cap2vtk.cc | 1 + 2 files changed, 1 insertion(+), 1 deletion(-) diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index 67111c6f9..b51498a71 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -198,7 +198,6 @@ static int periodic(struct gmi_model* m, struct gmi_ent* e, int dim) /* PARAM_UNBOUNDED=8 //!< infinite parametrization */ /* }; */ if (paramType & 1) return 0; - return paramType & (1<<1); } diff --git a/test/cap2vtk.cc b/test/cap2vtk.cc index c6a8656c1..a2891e4ec 100644 --- a/test/cap2vtk.cc +++ b/test/cap2vtk.cc @@ -132,6 +132,7 @@ int main(int argc, char** argv) gmi_register_cap(); // convert the mesh to apf/mds mesh + apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); apf::writeVtkFiles(folderName, mesh); From fe63fd1ee59d9f624456dc15f5269f0734c01828 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 15:18:29 -0400 Subject: [PATCH 009/319] added .smb option --- test/refineSnap.cc | 167 ++++++++++++++++++++++++--------------------- 1 file changed, 91 insertions(+), 76 deletions(-) diff --git a/test/refineSnap.cc b/test/refineSnap.cc index 26947386a..e7903fce1 100644 --- a/test/refineSnap.cc +++ b/test/refineSnap.cc @@ -26,6 +26,7 @@ #include "maRefine.h" #include "maSnap.h" #include "lionPrint.h" +#include #include "CapstoneModule.h" @@ -73,10 +74,11 @@ int main(int argc, char** argv) { pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); - if (argc != 3) { - if(0==PCUObj.Self()) + if (argc < 2) { + if(PCUObj.Self()==0) std::cerr << "usage: " << argv[0] - << " \n"; + << " <.cre file> or\n" + << " <.smb file> \n"; return EXIT_FAILURE; } @@ -84,85 +86,98 @@ int main(int argc, char** argv) gmi_register_mesh(); gmi_register_null(); - const char* creFileName = argv[1]; - const char* folderName = argv[2]; - - // load capstone mesh - // create an instance of the Capstone Module activating CREATE/CREATE/CREATE - // for the Geometry/Mesh/Attribution databases - /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ - const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD - const std::string mdbName("Mesh Database : Create"); - const std::string adbName("Attribution Database : Create"); - - CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); - - GeometryDatabaseInterface *g = cs.get_geometry(); - MeshDatabaseInterface *m = cs.get_mesh(); - AppContext *c = cs.get_context(); - - - PCU_ALWAYS_ASSERT(g); - PCU_ALWAYS_ASSERT(m); - PCU_ALWAYS_ASSERT(c); - - v_string filenames; - filenames.push_back(creFileName); - - M_GModel gmodel = cs.load_files(filenames); - - int numbreps = 0; - MG_CALL(g->get_num_breps(numbreps)); - std::cout << "number of b reps is " << numbreps << std::endl; - if(numbreps == 0) - error(HERE, ERR_INVALID_INPUT, "Model is empty"); - - M_MModel mmodel; - // Pick the volume mesh model from associated mesh models to this geom model - std::vector mmodels; - MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); - for(std::size_t i = 0; i < mmodels.size(); ++i) + std::string meshFile(argv[1]); + apf::Mesh2* mesh; + if (meshFile.substr(meshFile.find_last_of(".") + 1) == ".smb") { - M_MModel ammodel = mmodels[i]; - std::size_t numregs = 0; - std::size_t numfaces = 0; - std::size_t numedges = 0; - std::size_t numverts = 0; - MG_API_CALL(m, set_current_model(ammodel)); - MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); - MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); - MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); - MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); - std::cout << "num regions is " << numregs << std::endl; - std::cout << "num faces is " << numfaces << std::endl; - std::cout << "num edges is " << numedges << std::endl; - std::cout << "num verts is " << numverts << std::endl; - std::cout << "-----------" << std::endl; - if(numregs > 0) - { - mmodel = ammodel; - break; - } + if (argc < 3) { + if(PCUObj.Self()==0) std::cerr << "usage: "<< argv[0] << " <.smb file> \n"; + return EXIT_FAILURE; + } + const char* modelFile = argv[2]; + mesh = apf::loadMdsMesh(modelFile, meshFile.c_str(), &PCUObj); } + else if (meshFile.substr(meshFile.find_last_of(".") + 1) == ".cre") + { + // load capstone mesh + // create an instance of the Capstone Module activating CREATE/CREATE/CREATE + // for the Geometry/Mesh/Attribution databases + /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ + const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD + const std::string mdbName("Mesh Database : Create"); + const std::string adbName("Attribution Database : Create"); + + CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); + + GeometryDatabaseInterface *g = cs.get_geometry(); + MeshDatabaseInterface *m = cs.get_mesh(); + AppContext *c = cs.get_context(); + + PCU_ALWAYS_ASSERT(g); + PCU_ALWAYS_ASSERT(m); + PCU_ALWAYS_ASSERT(c); + + v_string filenames; + filenames.push_back(meshFile); + + M_GModel gmodel = cs.load_files(filenames); + + int numbreps = 0; + MG_CALL(g->get_num_breps(numbreps)); + std::cout << "number of b reps is " << numbreps << std::endl; + if(numbreps == 0) + error(HERE, ERR_INVALID_INPUT, "Model is empty"); + + M_MModel mmodel; + // Pick the volume mesh model from associated mesh models to this geom model + std::vector mmodels; + MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); + for(std::size_t i = 0; i < mmodels.size(); ++i) + { + M_MModel ammodel = mmodels[i]; + std::size_t numregs = 0; + std::size_t numfaces = 0; + std::size_t numedges = 0; + std::size_t numverts = 0; + MG_API_CALL(m, set_current_model(ammodel)); + MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); + MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); + MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); + MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); + std::cout << "num regions is " << numregs << std::endl; + std::cout << "num faces is " << numfaces << std::endl; + std::cout << "num edges is " << numedges << std::endl; + std::cout << "num verts is " << numverts << std::endl; + std::cout << "-----------" << std::endl; + if(numregs > 0) + { + mmodel = ammodel; + break; + } + } - /* SET THE ADJACENCIES */ - MG_API_CALL(m, set_adjacency_state(REGION2FACE| - REGION2EDGE| - REGION2VERTEX| - FACE2EDGE| - FACE2VERTEX)); - MG_API_CALL(m, set_reverse_states()); - MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); - MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); - MG_API_CALL(m, compute_adjacency()); - + /* SET THE ADJACENCIES */ + MG_API_CALL(m, set_adjacency_state(REGION2FACE| + REGION2EDGE| + REGION2VERTEX| + FACE2EDGE| + FACE2VERTEX)); + MG_API_CALL(m, set_reverse_states()); + MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); + MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); + MG_API_CALL(m, compute_adjacency()); - gmi_cap_start(); - gmi_register_cap(); + gmi_cap_start(); + gmi_register_cap(); - // convert the mesh to apf/mds mesh + // convert the mesh to apf/mds mesh - apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); + mesh = apf::createMesh(m,g,&PCUObj); + } + else { + std::cerr << "unsupported file type\n"; + return EXIT_FAILURE; + } mesh->verify(); apf::writeVtkFiles("before_snap",mesh); From 5624760b1003b0a19e6661a655c3e4e078e209aa Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 16:22:32 -0400 Subject: [PATCH 010/319] fixed test --- test/refineSnap.cc | 155 ++++++++++++++++++++------------------------- 1 file changed, 69 insertions(+), 86 deletions(-) diff --git a/test/refineSnap.cc b/test/refineSnap.cc index e7903fce1..94a510599 100644 --- a/test/refineSnap.cc +++ b/test/refineSnap.cc @@ -86,98 +86,81 @@ int main(int argc, char** argv) gmi_register_mesh(); gmi_register_null(); - std::string meshFile(argv[1]); - apf::Mesh2* mesh; - if (meshFile.substr(meshFile.find_last_of(".") + 1) == ".smb") + const char* meshFile = argv[1]; + // load capstone mesh + // create an instance of the Capstone Module activating CREATE/CREATE/CREATE + // for the Geometry/Mesh/Attribution databases + /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ + const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD + const std::string mdbName("Mesh Database : Create"); + const std::string adbName("Attribution Database : Create"); + + CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); + + GeometryDatabaseInterface *g = cs.get_geometry(); + MeshDatabaseInterface *m = cs.get_mesh(); + AppContext *c = cs.get_context(); + + PCU_ALWAYS_ASSERT(g); + PCU_ALWAYS_ASSERT(m); + PCU_ALWAYS_ASSERT(c); + + v_string filenames; + filenames.push_back(meshFile); + + M_GModel gmodel = cs.load_files(filenames); + + int numbreps = 0; + MG_CALL(g->get_num_breps(numbreps)); + std::cout << "number of b reps is " << numbreps << std::endl; + if(numbreps == 0) + error(HERE, ERR_INVALID_INPUT, "Model is empty"); + + M_MModel mmodel; + // Pick the volume mesh model from associated mesh models to this geom model + std::vector mmodels; + MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); + for(std::size_t i = 0; i < mmodels.size(); ++i) { - if (argc < 3) { - if(PCUObj.Self()==0) std::cerr << "usage: "<< argv[0] << " <.smb file> \n"; - return EXIT_FAILURE; - } - const char* modelFile = argv[2]; - mesh = apf::loadMdsMesh(modelFile, meshFile.c_str(), &PCUObj); + M_MModel ammodel = mmodels[i]; + std::size_t numregs = 0; + std::size_t numfaces = 0; + std::size_t numedges = 0; + std::size_t numverts = 0; + MG_API_CALL(m, set_current_model(ammodel)); + MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); + MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); + MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); + MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); + std::cout << "num regions is " << numregs << std::endl; + std::cout << "num faces is " << numfaces << std::endl; + std::cout << "num edges is " << numedges << std::endl; + std::cout << "num verts is " << numverts << std::endl; + std::cout << "-----------" << std::endl; + if(numregs > 0) + { + mmodel = ammodel; + break; + } } - else if (meshFile.substr(meshFile.find_last_of(".") + 1) == ".cre") - { - // load capstone mesh - // create an instance of the Capstone Module activating CREATE/CREATE/CREATE - // for the Geometry/Mesh/Attribution databases - /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ - const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD - const std::string mdbName("Mesh Database : Create"); - const std::string adbName("Attribution Database : Create"); - - CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); - - GeometryDatabaseInterface *g = cs.get_geometry(); - MeshDatabaseInterface *m = cs.get_mesh(); - AppContext *c = cs.get_context(); - - PCU_ALWAYS_ASSERT(g); - PCU_ALWAYS_ASSERT(m); - PCU_ALWAYS_ASSERT(c); - - v_string filenames; - filenames.push_back(meshFile); - - M_GModel gmodel = cs.load_files(filenames); - - int numbreps = 0; - MG_CALL(g->get_num_breps(numbreps)); - std::cout << "number of b reps is " << numbreps << std::endl; - if(numbreps == 0) - error(HERE, ERR_INVALID_INPUT, "Model is empty"); - - M_MModel mmodel; - // Pick the volume mesh model from associated mesh models to this geom model - std::vector mmodels; - MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); - for(std::size_t i = 0; i < mmodels.size(); ++i) - { - M_MModel ammodel = mmodels[i]; - std::size_t numregs = 0; - std::size_t numfaces = 0; - std::size_t numedges = 0; - std::size_t numverts = 0; - MG_API_CALL(m, set_current_model(ammodel)); - MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); - MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); - MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); - MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); - std::cout << "num regions is " << numregs << std::endl; - std::cout << "num faces is " << numfaces << std::endl; - std::cout << "num edges is " << numedges << std::endl; - std::cout << "num verts is " << numverts << std::endl; - std::cout << "-----------" << std::endl; - if(numregs > 0) - { - mmodel = ammodel; - break; - } - } - /* SET THE ADJACENCIES */ - MG_API_CALL(m, set_adjacency_state(REGION2FACE| - REGION2EDGE| - REGION2VERTEX| - FACE2EDGE| - FACE2VERTEX)); - MG_API_CALL(m, set_reverse_states()); - MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); - MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); - MG_API_CALL(m, compute_adjacency()); + /* SET THE ADJACENCIES */ + MG_API_CALL(m, set_adjacency_state(REGION2FACE| + REGION2EDGE| + REGION2VERTEX| + FACE2EDGE| + FACE2VERTEX)); + MG_API_CALL(m, set_reverse_states()); + MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); + MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); + MG_API_CALL(m, compute_adjacency()); - gmi_cap_start(); - gmi_register_cap(); + gmi_cap_start(); + gmi_register_cap(); - // convert the mesh to apf/mds mesh + // convert the mesh to apf/mds mesh - mesh = apf::createMesh(m,g,&PCUObj); - } - else { - std::cerr << "unsupported file type\n"; - return EXIT_FAILURE; - } + apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); mesh->verify(); apf::writeVtkFiles("before_snap",mesh); From e27bc6392aaf455fe315fe83efa7d87423687bd9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 16:25:14 -0400 Subject: [PATCH 011/319] rename file --- test/CMakeLists.txt | 2 +- test/{refineSnap.cc => adaptCap.cc} | 2 -- 2 files changed, 1 insertion(+), 3 deletions(-) rename test/{refineSnap.cc => adaptCap.cc} (99%) diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 25eb083e3..ee42c7921 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -169,7 +169,7 @@ test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) test_exe_func(aniso_ma_test2 aniso_ma_test2.cc) -test_exe_func(refineSnap refineSnap.cc) +test_exe_func(adaptCap adaptCap.cc) test_exe_func(torus_ma_test torus_ma_test.cc) test_exe_func(dg_ma_test dg_ma_test.cc) test_exe_func(prismCodeMatch ../ma/prismCodeMatch.cc) diff --git a/test/refineSnap.cc b/test/adaptCap.cc similarity index 99% rename from test/refineSnap.cc rename to test/adaptCap.cc index 94a510599..4a2c286e6 100644 --- a/test/refineSnap.cc +++ b/test/adaptCap.cc @@ -26,8 +26,6 @@ #include "maRefine.h" #include "maSnap.h" #include "lionPrint.h" -#include - #include "CapstoneModule.h" #include "CreateMG_Framework_Core.h" From 493a2bf4e6974f914f421bf7122147a070d91971 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 20:42:56 -0400 Subject: [PATCH 012/319] aniso adapt test --- test/aniso_adapt.h | 56 ++++++++++++++++++++++++++++++++++++++++++ test/aniso_ma_test2.cc | 41 +++---------------------------- 2 files changed, 59 insertions(+), 38 deletions(-) create mode 100644 test/aniso_adapt.h diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h new file mode 100644 index 000000000..1f7f3f13b --- /dev/null +++ b/test/aniso_adapt.h @@ -0,0 +1,56 @@ +#include +#include +#include + +#include +#include +#include +#include +#include +#include +#include "maCoarsen.h" +#include "maAdapt.h" +#include "maRefine.h" +#include "maSnap.h" + +class AnIso : public ma::AnisotropicFunction +{ + public: + AnIso(ma::Mesh* m, double sf1, double sf2) : + mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) + { + average = ma::getAverageEdgeLength(m); + ma::getBoundingBox(m, lower, upper); + } + virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) + { + double h = average/sizeFactor1; + H = ma::Vector(h, h, h/sizeFactor2); + R = ma::Matrix( + 1.0, 0.0, 0.0, + 0.0, 1.0, 0.0, + 0.0, 0.0, 1.0 + ); + } + private: + ma::Mesh* mesh; + double sizeFactor1, sizeFactor2, average; + ma::Vector lower, upper; +}; + +void refineSnapTest(ma::Mesh* m) +{ + m->verify(); + apf::writeVtkFiles("before_refine_snap_test",m); + AnIso sf(m, 2, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + ma::Adapt* a = new ma::Adapt(in); + in->maximumIterations = 1; + for (int i = 0; i < in->maximumIterations; ++i) + { + ma::refine(a); + ma::snap(a); + } + m->verify(); + apf::writeVtkFiles("after_refine_snap_test",m); +} \ No newline at end of file diff --git a/test/aniso_ma_test2.cc b/test/aniso_ma_test2.cc index 6a892a6ce..b75baf01d 100644 --- a/test/aniso_ma_test2.cc +++ b/test/aniso_ma_test2.cc @@ -8,33 +8,7 @@ #include #include #include -#include "maCoarsen.h" -#include "maAdapt.h" - -class AnIso : public ma::AnisotropicFunction -{ - public: - AnIso(ma::Mesh* m, double sf1, double sf2) : - mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) - { - average = ma::getAverageEdgeLength(m); - ma::getBoundingBox(m, lower, upper); - } - virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) - { - double h = average/sizeFactor1; - H = ma::Vector(h, h, h/sizeFactor2); - R = ma::Matrix( - 1.0, 0.0, 0.0, - 0.0, 1.0, 0.0, - 0.0, 0.0, 1.0 - ); - } - private: - ma::Mesh* mesh; - double sizeFactor1, sizeFactor2, average; - ma::Vector lower, upper; -}; +#include "aniso_adapt.h" int main(int argc, char* argv[]) { if (argc != 6) { @@ -51,19 +25,10 @@ int main(int argc, char* argv[]) { lion_set_verbosity(1); gmi_register_mesh(); ma::Mesh* m = apf::loadMdsMesh(modelFile, meshFile, PCUObj); - m->verify(); - apf::writeVtkFiles("aniso_ma_test2_before",m); //Adapt - AnIso sf(m, sizeFactor1, sizeFactor2); - ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); - // in->shouldFixShape = false; - // in->shouldCoarsen = false; - // in->shouldSnap = false; - // in->shouldCleanupLayer = false; - ma::adapt(in); - m->verify(); - apf::writeVtkFiles("aniso_ma_test2_after",m); + refineSnapTest(m); + m->writeNative(argv[5]); //Clean up From 5fdc1b69999be90634d0ec1718e0897e71c64099 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 9 Apr 2025 21:02:46 -0400 Subject: [PATCH 013/319] rename cap and sim test --- test/CMakeLists.txt | 4 ++-- test/{adaptCap.cc => aniso_adapt_cap.cc} | 0 test/{aniso_ma_test2.cc => aniso_adapt_sim.cc} | 0 3 files changed, 2 insertions(+), 2 deletions(-) rename test/{adaptCap.cc => aniso_adapt_cap.cc} (100%) rename test/{aniso_ma_test2.cc => aniso_adapt_sim.cc} (100%) diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index ee42c7921..1603c597d 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -168,8 +168,8 @@ test_exe_func(xgc_split xgc_split.cc) test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) -test_exe_func(aniso_ma_test2 aniso_ma_test2.cc) -test_exe_func(adaptCap adaptCap.cc) +test_exe_func(aniso_adapt_sim aniso_adapt_sim.cc) +test_exe_func(aniso_adapt_cap aniso_adapt_cap.cc) test_exe_func(torus_ma_test torus_ma_test.cc) test_exe_func(dg_ma_test dg_ma_test.cc) test_exe_func(prismCodeMatch ../ma/prismCodeMatch.cc) diff --git a/test/adaptCap.cc b/test/aniso_adapt_cap.cc similarity index 100% rename from test/adaptCap.cc rename to test/aniso_adapt_cap.cc diff --git a/test/aniso_ma_test2.cc b/test/aniso_adapt_sim.cc similarity index 100% rename from test/aniso_ma_test2.cc rename to test/aniso_adapt_sim.cc From b2bdb77b294c3ecde479e02cd409f0eab9f27acd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 10 Apr 2025 15:49:32 -0400 Subject: [PATCH 014/319] fixed sim test --- test/aniso_adapt.h | 5 ++--- test/aniso_adapt_sim.cc | 46 ++++++++++++++++++++++++++++++++++------- 2 files changed, 41 insertions(+), 10 deletions(-) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 1f7f3f13b..c67687af1 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -38,14 +38,13 @@ class AnIso : public ma::AnisotropicFunction ma::Vector lower, upper; }; -void refineSnapTest(ma::Mesh* m) +void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) { m->verify(); apf::writeVtkFiles("before_refine_snap_test",m); - AnIso sf(m, 2, 1); + AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - in->maximumIterations = 1; for (int i = 0; i < in->maximumIterations; ++i) { ma::refine(a); diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index b75baf01d..47b2b1d36 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -10,26 +10,58 @@ #include #include "aniso_adapt.h" +#include +#include +#include +#include +#include +#include + +#include "SimParasolidKrnl.h" +#include "MeshSimAdapt.h" +#include "SimDiscrete.h" +#include "SimAdvMeshing.h" +#include "SimMeshTools.h" + int main(int argc, char* argv[]) { - if (argc != 6) { + if (argc != 4) { std::cerr << "Usage: " << argv[0] << - " " << std::endl; + " " << std::endl; return 1; } //Load Mesh const char* modelFile = argv[1]; const char* meshFile = argv[2]; - double sizeFactor1 = std::atof(argv[3]), sizeFactor2 = std::atof(argv[4]); MPI_Init(&argc, &argv); pcu::PCU *PCUObj = new pcu::PCU(MPI_COMM_WORLD); lion_set_verbosity(1); gmi_register_mesh(); - ma::Mesh* m = apf::loadMdsMesh(modelFile, meshFile, PCUObj); + + Sim_logOn("anisoadapt.log"); + MS_init(); + SimAdvMeshing_start(); + SimModel_start(); + Sim_readLicenseFile(NULL); + SimPartitionedMesh_start(&argc,&argv); + + gmi_sim_start(); + gmi_register_sim(); + pProgress progress = Progress_new(); + Progress_setDefaultCallback(progress); + + pGModel model = 0; + pParMesh mesh = 0; + gmi_model* mdl_ref; + ma::Mesh* mesh_ref; + + mdl_ref = gmi_sim_load(argv[1], argv[2]); + model = gmi_export_sim(mdl_ref); + mesh = PM_load(argv[3], model, progress); + mesh_ref = apf::createMesh(mesh, PCUObj); + apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); //Adapt - refineSnapTest(m); - - m->writeNative(argv[5]); + refineSnapTest(m, 3, 1); //Clean up m->destroyNative(); From 7d1394ccfed0ab09abc34fb23bf16631af362919 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 10 Apr 2025 15:51:13 -0400 Subject: [PATCH 015/319] simplify sim test --- test/aniso_adapt_sim.cc | 13 ++++--------- 1 file changed, 4 insertions(+), 9 deletions(-) diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 47b2b1d36..cfe91a37b 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -49,15 +49,10 @@ int main(int argc, char* argv[]) { pProgress progress = Progress_new(); Progress_setDefaultCallback(progress); - pGModel model = 0; - pParMesh mesh = 0; - gmi_model* mdl_ref; - ma::Mesh* mesh_ref; - - mdl_ref = gmi_sim_load(argv[1], argv[2]); - model = gmi_export_sim(mdl_ref); - mesh = PM_load(argv[3], model, progress); - mesh_ref = apf::createMesh(mesh, PCUObj); + gmi_model* mdl_ref = gmi_sim_load(argv[1], argv[2]); + pGModel model = gmi_export_sim(mdl_ref); + pParMesh mesh = PM_load(argv[3], model, progress); + ma::Mesh* mesh_ref = apf::createMesh(mesh, PCUObj); apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); //Adapt From ecf7b681d04874f9ab47244c280a8a0b26c1a57c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 10 Apr 2025 17:37:31 -0400 Subject: [PATCH 016/319] rename vtk file --- test/aniso_adapt.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index c67687af1..71da1c9d4 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -41,7 +41,7 @@ class AnIso : public ma::AnisotropicFunction void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) { m->verify(); - apf::writeVtkFiles("before_refine_snap_test",m); + apf::writeVtkFiles("before_refine_snap",m); AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); @@ -51,5 +51,5 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) ma::snap(a); } m->verify(); - apf::writeVtkFiles("after_refine_snap_test",m); + apf::writeVtkFiles("after_refine_snap",m); } \ No newline at end of file From 4e70f29b4a7f60184d9ba8f61fb8e59cbec63e9c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 10 Apr 2025 20:58:31 -0400 Subject: [PATCH 017/319] wrong copy --- ma/maSnap.cc | 11 +++++------ 1 file changed, 5 insertions(+), 6 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index ed26552b3..c968c3e79 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -908,14 +908,13 @@ void trySnapping(Adapt* a) { Mesh* mesh = a->mesh; Refine* refine = a->refine; - auto vtxToSnap = refine->vtxToSnap; - int notProcessed = vtxToSnap.size(); + int notProcessed = refine->vtxToSnap.size(); print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", notProcessed); while (notProcessed > 0) { notProcessed--; - Entity* vertex = vtxToSnap.front(); - vtxToSnap.pop(); + Entity* vertex = refine->vtxToSnap.front(); + refine->vtxToSnap.pop(); if (!getFlag(a, vertex, SNAP)) { @@ -939,13 +938,13 @@ void trySnapping(Adapt* a) if (!areTetsValid(mesh, adjacentElements)) { mesh->setPoint(vertex, 0, prev); - vtxToSnap.push(vertex); + refine->vtxToSnap.push(vertex); } else clearFlag(a, vertex, SNAP); } - print(a->mesh->getPCU(), "Number of vertices failed %d\n", vtxToSnap.size()); + print(a->mesh->getPCU(), "Number of vertices failed %d\n", refine->vtxToSnap.size()); } void printSnapFields(Adapt* a, Mesh* m, std::string name) From e01cd2e0eafe6c4f414d6fb15921a98ec43ffef9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 10 Apr 2025 22:39:21 -0400 Subject: [PATCH 018/319] get fpp --- ma/maSnap.cc | 27 ++++++++++++++++++++++++--- 1 file changed, 24 insertions(+), 3 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index c968c3e79..8aa48d096 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -904,7 +904,23 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -void trySnapping(Adapt* a) +void tryCollapseToVtx(Adapt* a, Entity* vertex, Tag* snapTag, Upward& adjacentElements) +{ + FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); + FPP->setVertex(vertex); + apf::Up bad; + bad.n = 0; + for (size_t i = 0; i < adjacentElements.getSize(); ++i) { + bad.e[bad.n++] = adjacentElements[i]; + } + + FPP->setBadElements(bad); + std::vector edgesFromFPP; + FPP->getCandidateEdges(edgesFromFPP); + printf("NUM EDGES FPP %d\n", edgesFromFPP.size()); +} + +void trySnapping(Adapt* a, Tag* snapTag) { Mesh* mesh = a->mesh; Refine* refine = a->refine; @@ -938,7 +954,10 @@ void trySnapping(Adapt* a) if (!areTetsValid(mesh, adjacentElements)) { mesh->setPoint(vertex, 0, prev); + mesh->setDoubleTag(vertex, snapTag, &target[0]); + tryCollapseToVtx(a, vertex, snapTag, adjacentElements); refine->vtxToSnap.push(vertex); + mesh->removeTag(vertex,snapTag); } else clearFlag(a, vertex, SNAP); @@ -968,12 +987,14 @@ void printSnapFields(Adapt* a, Mesh* m, std::string name) void snap(Adapt* a) { - if ( ! a->input->shouldSnap) + if (!a->input->shouldSnap) return; printSnapFields(a, a->mesh, "vtx_to_snap"); - trySnapping(a); + Tag* snapTag = a->mesh->createDoubleTag("ma_snap", 3); + trySnapping(a, snapTag); printSnapFields(a, a->mesh, "vtx_snap_failed"); clearFlagFromDimension(a, SNAP, 0); + a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; } From 3ad34c05f5cfce4747152e033270d6927ef0aa13 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 10 Apr 2025 23:18:25 -0400 Subject: [PATCH 019/319] refactor invalid --- ma/maSnap.cc | 30 +++++++++++++++++++----------- 1 file changed, 19 insertions(+), 11 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 8aa48d096..f0d7dd79b 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -904,20 +904,25 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -void tryCollapseToVtx(Adapt* a, Entity* vertex, Tag* snapTag, Upward& adjacentElements) +void tryCollapseToVtx(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) { FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); FPP->setVertex(vertex); - apf::Up bad; - bad.n = 0; - for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - bad.e[bad.n++] = adjacentElements[i]; - } - - FPP->setBadElements(bad); + FPP->setBadElements(invalid); std::vector edgesFromFPP; FPP->getCandidateEdges(edgesFromFPP); - printf("NUM EDGES FPP %d\n", edgesFromFPP.size()); + printf("INVALID %d FPP %d\n", invalid.n, edgesFromFPP.size()); +} + +void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) +{ + invalid.n = 0; + Vector v[4]; + for (size_t i = 0; i < adjacentElements.getSize(); ++i) { + ma::getVertPoints(mesh,adjacentElements[i],v); + if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) + invalid.e[invalid.n++] = adjacentElements[i]; + } } void trySnapping(Adapt* a, Tag* snapTag) @@ -951,11 +956,14 @@ void trySnapping(Adapt* a, Tag* snapTag) mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); mesh->setPoint(vertex, 0, target); - if (!areTetsValid(mesh, adjacentElements)) + apf::Up invalid; + getInvalidTets(mesh, adjacentElements, invalid); + + if (invalid.n > 0) { mesh->setPoint(vertex, 0, prev); mesh->setDoubleTag(vertex, snapTag, &target[0]); - tryCollapseToVtx(a, vertex, snapTag, adjacentElements); + tryCollapseToVtx(a, vertex, snapTag, invalid); refine->vtxToSnap.push(vertex); mesh->removeTag(vertex,snapTag); } From 4dfe5ac8a10dab06f1611cf46430b69ff4a7855c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 11 Apr 2025 13:49:10 -0400 Subject: [PATCH 020/319] fixed tabs --- ma/maSnap.cc | 1 + ma/maSnapper.cc | 10 +++++----- 2 files changed, 6 insertions(+), 5 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index f0d7dd79b..94d95ebd6 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -912,6 +912,7 @@ void tryCollapseToVtx(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) std::vector edgesFromFPP; FPP->getCandidateEdges(edgesFromFPP); printf("INVALID %d FPP %d\n", invalid.n, edgesFromFPP.size()); + delete FPP; } void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 14c9a1651..ebb072a08 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -345,7 +345,7 @@ bool FirstProblemPlane::find() lion_oprint(1, "Info: Found Infinitely Many Intersection Points!\n"); Vector newDirection = intersect - ray.start; if (newDirection.getLength() < minDist) { - dists.push_back(newDirection.getLength()); + dists.push_back(newDirection.getLength()); minDist = dists.back(); problemFace = face; problemRegion = elem; @@ -374,8 +374,8 @@ bool FirstProblemPlane::find() minDist += tol; for (int i = 0; i < n; i++) { if (dists[i] < minDist) { - coplanarProblemRegions.e[coplanarProblemRegions.n] = problemRegions.e[i]; - coplanarProblemRegions.n++; + coplanarProblemRegions.e[coplanarProblemRegions.n] = problemRegions.e[i]; + coplanarProblemRegions.n++; } } } @@ -477,8 +477,8 @@ void FirstProblemPlane::findCommonEdges(apf::Up& cpRegions) int nDownEdges = mesh->getDownward(cpRegions.e[0], 1, edges); for (int i = 0; i < nDownEdges; i++) { if (isLowInHigh(mesh, edges[i], vert)) { - commEdges.e[commEdges.n] = edges[i]; - commEdges.n++; + commEdges.e[commEdges.n] = edges[i]; + commEdges.n++; } } return; From 9437c742a8d22d59c906811f68b8b7b6d820f136 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 11 Apr 2025 17:21:07 -0400 Subject: [PATCH 021/319] assert cap not discontinuous and periodic --- gmi_cap/gmi_cap.cc | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index b51498a71..4bf6ba53c 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -198,7 +198,9 @@ static int periodic(struct gmi_model* m, struct gmi_ent* e, int dim) /* PARAM_UNBOUNDED=8 //!< infinite parametrization */ /* }; */ if (paramType & 1) return 0; - return paramType & (1<<1); + int isPeriodic = paramType & (1<<1); + PCU_ALWAYS_ASSERT(isPeriodic == false); //TODO: for now cannot handle periodic geometric entity (with discontinuity in parametric coords) + return isPeriodic; } static void range(struct gmi_model* m, struct gmi_ent* e, int dim, From 5a95b70137f4a36b65deb4a10d23ca608f6c01ea Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 11 Apr 2025 19:01:07 -0400 Subject: [PATCH 022/319] update aniso adapt cap --- gmi_cap/gmi_cap.cc | 2 +- test/aniso_adapt_cap.cc | 44 ++++------------------------------------- 2 files changed, 5 insertions(+), 41 deletions(-) diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index 4bf6ba53c..e21769311 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -199,7 +199,7 @@ static int periodic(struct gmi_model* m, struct gmi_ent* e, int dim) /* }; */ if (paramType & 1) return 0; int isPeriodic = paramType & (1<<1); - PCU_ALWAYS_ASSERT(isPeriodic == false); //TODO: for now cannot handle periodic geometric entity (with discontinuity in parametric coords) + PCU_ALWAYS_ASSERT_VERBOSE(isPeriodic == false, "for now cannot handle periodic geometric entity (with discontinuity in parametric coords)"); return isPeriodic; } diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 4a2c286e6..d034d7b37 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -26,6 +26,7 @@ #include "maRefine.h" #include "maSnap.h" #include "lionPrint.h" +#include "aniso_adapt.h" #include "CapstoneModule.h" #include "CreateMG_Framework_Core.h" @@ -41,31 +42,6 @@ using namespace CreateMG::Attribution; using namespace CreateMG::Mesh; using namespace CreateMG::Geometry; -class AnIso : public ma::AnisotropicFunction -{ - public: - AnIso(ma::Mesh* m, double sf1, double sf2) : - mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) - { - average = ma::getAverageEdgeLength(m); - ma::getBoundingBox(m, lower, upper); - } - virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) - { - double h = average/sizeFactor1; - H = ma::Vector(h, h, h/sizeFactor2); - R = ma::Matrix( - 1.0, 0.0, 0.0, - 0.0, 1.0, 0.0, - 0.0, 0.0, 1.0 - ); - } - private: - ma::Mesh* mesh; - double sizeFactor1, sizeFactor2, average; - ma::Vector lower, upper; -}; - int main(int argc, char** argv) { MPI_Init(&argc, &argv); @@ -159,22 +135,10 @@ int main(int argc, char** argv) // convert the mesh to apf/mds mesh apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); - mesh->verify(); - apf::writeVtkFiles("before_snap",mesh); - - //Adapt lion_set_verbosity(1); - AnIso sf(mesh, 2, 1); - ma::Input* in = ma::makeAdvanced(ma::configure(mesh, &sf)); - in->maximumIterations = 1; - ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < in->maximumIterations; ++i) - { - ma::refine(a); - ma::snap(a); - } - mesh->verify(); - apf::writeVtkFiles("after_snap",mesh); + + //Adapt + refineSnapTest(mesh, 3, 1); gmi_cap_stop(); } From a06d243ee9b443d8084c47dfc1480a2a45e5a37b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 12 Apr 2025 22:04:48 -0400 Subject: [PATCH 023/319] moved tag vtx --- ma/maSnap.cc | 59 ++++++++++++++++++++++--------------------------- ma/maSnapper.cc | 10 ++++----- 2 files changed, 32 insertions(+), 37 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 94d95ebd6..4829c0fb4 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -841,29 +841,35 @@ bool snapMatchedVerts(Adapt* a, Tag* t, bool isSimple, long& successCount) return a->mesh->getPCU()->Or(op.didAnything); } -long tagVertsToSnap(Adapt* a, Tag*& t) +long tagVertsToSnap(Adapt* a, Tag*& tag) { Mesh* m = a->mesh; + Refine* refine = a->refine; int dim = m->getDimension(); - t = m->createDoubleTag("ma_snap", 3); - Entity* v; - long n = 0; - Iterator* it = m->begin(0); - while ((v = m->iterate(it))) { - int md = m->getModelType(m->toModel(v)); - if (dim == 3 && md == 3) - continue; - Vector s; - getSnapPoint(m, v, s); - Vector x = getPosition(m, v); - if (apf::areClose(s, x, 1e-12)) + tag = m->createDoubleTag("ma_snap", 3); + int notProcessed = refine->vtxToSnap.size(); + int owned = 0; + while (notProcessed > 0) + { + notProcessed--; + Entity* vertex = refine->vtxToSnap.front(); + refine->vtxToSnap.pop(); + PCU_ALWAYS_ASSERT(getFlag(a, vertex, SNAP)); + + Vector target; + getSnapPoint(m, vertex, target); + Vector prev = getPosition(m, vertex); + if (apf::areClose(prev, target, 1e-12)) + { + clearFlag(a, vertex, SNAP); continue; - m->setDoubleTag(v, t, &s[0]); - if (m->isOwned(v)) - ++n; + } + m->setDoubleTag(vertex, tag, &target[0]); + if (m->isOwned(vertex)) + ++owned; + refine->vtxToSnap.push(vertex); } - m->end(it); - return m->getPCU()->Add(n); + return m->getPCU()->Add(owned); } static void markVertsToSnap(Adapt* a, Tag* t) @@ -938,20 +944,9 @@ void trySnapping(Adapt* a, Tag* snapTag) Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); - if (!getFlag(a, vertex, SNAP)) - { - print(a->mesh->getPCU(), "Error: Vertex incorrectly flagged to snap\n"); - continue; - } - Vector prev = getPosition(mesh, vertex); Vector target; - getSnapPoint(mesh, vertex, target); - if (apf::areClose(prev, target, 1e-12)) - { - clearFlag(a, vertex, SNAP); - continue; - } + mesh->getDoubleTag(vertex, snapTag, &target[0]); Upward adjacentElements; mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); @@ -963,7 +958,6 @@ void trySnapping(Adapt* a, Tag* snapTag) if (invalid.n > 0) { mesh->setPoint(vertex, 0, prev); - mesh->setDoubleTag(vertex, snapTag, &target[0]); tryCollapseToVtx(a, vertex, snapTag, invalid); refine->vtxToSnap.push(vertex); mesh->removeTag(vertex,snapTag); @@ -999,7 +993,8 @@ void snap(Adapt* a) if (!a->input->shouldSnap) return; printSnapFields(a, a->mesh, "vtx_to_snap"); - Tag* snapTag = a->mesh->createDoubleTag("ma_snap", 3); + Tag* snapTag; + tagVertsToSnap(a, snapTag); trySnapping(a, snapTag); printSnapFields(a, a->mesh, "vtx_snap_failed"); clearFlagFromDimension(a, SNAP, 0); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index ebb072a08..c2c8b5a5e 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -517,11 +517,11 @@ void FirstProblemPlane::findCommonEdges(apf::Up& cpRegions) if (!isLowInHigh(mesh, region, edges[i])) { flag = 0; break; - } - if (flag) { - commEdges.e[commEdges.n] = edges[i]; - commEdges.n++; - } + } + if (flag) { + commEdges.e[commEdges.n] = edges[i]; + commEdges.n++; + } } } } From d486034bef4f1ef746139833dc4077e5bf205c20 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 12 Apr 2025 22:18:20 -0400 Subject: [PATCH 024/319] moved try reposition --- ma/maSnap.cc | 38 ++++++++++++++++++++++---------------- 1 file changed, 22 insertions(+), 16 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 4829c0fb4..a839221fc 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -910,7 +910,7 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -void tryCollapseToVtx(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) +bool tryCollapseToVertex(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) { FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); FPP->setVertex(vertex); @@ -919,6 +919,7 @@ void tryCollapseToVtx(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) FPP->getCandidateEdges(edgesFromFPP); printf("INVALID %d FPP %d\n", invalid.n, edgesFromFPP.size()); delete FPP; + return false; } void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) @@ -932,6 +933,19 @@ void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) } } +bool tryReposition(Mesh* mesh, Entity* vertex, Tag* snapTag, apf::Up& invalid) +{ + Vector prev = getPosition(mesh, vertex); + Vector target; + mesh->getDoubleTag(vertex, snapTag, &target[0]); + Upward adjacentElements; + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + mesh->setPoint(vertex, 0, target); + getInvalidTets(mesh, adjacentElements, invalid); + if (invalid.n == 0) return true; + mesh->setPoint(vertex, 0, prev); +} + void trySnapping(Adapt* a, Tag* snapTag) { Mesh* mesh = a->mesh; @@ -944,26 +958,18 @@ void trySnapping(Adapt* a, Tag* snapTag) Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); - Vector prev = getPosition(mesh, vertex); - Vector target; - mesh->getDoubleTag(vertex, snapTag, &target[0]); + apf::Up invalid; + bool success = tryReposition(mesh, vertex, snapTag, invalid); - Upward adjacentElements; - mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - mesh->setPoint(vertex, 0, target); + if (!success) + success = tryCollapseToVertex(a, vertex, snapTag, invalid); - apf::Up invalid; - getInvalidTets(mesh, adjacentElements, invalid); - - if (invalid.n > 0) - { - mesh->setPoint(vertex, 0, prev); - tryCollapseToVtx(a, vertex, snapTag, invalid); - refine->vtxToSnap.push(vertex); + if (success) { mesh->removeTag(vertex,snapTag); + clearFlag(a, vertex, SNAP); } else - clearFlag(a, vertex, SNAP); + refine->vtxToSnap.push(vertex); } print(a->mesh->getPCU(), "Number of vertices failed %d\n", refine->vtxToSnap.size()); From ec767eba21d3a2fc67c76ceecdb7def1a5b5861c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 12 Apr 2025 23:39:09 -0400 Subject: [PATCH 025/319] collapse to vtx done --- ma/maSnap.cc | 31 ++++++++++++++++++++++++++----- 1 file changed, 26 insertions(+), 5 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index a839221fc..9ee968f68 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -910,14 +910,33 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -bool tryCollapseToVertex(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) +bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, Tag* snapTag, apf::Up& invalid) { FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); FPP->setVertex(vertex); FPP->setBadElements(invalid); - std::vector edgesFromFPP; - FPP->getCandidateEdges(edgesFromFPP); - printf("INVALID %d FPP %d\n", invalid.n, edgesFromFPP.size()); + std::vector collapseOptions; + FPP->getCandidateEdges(collapseOptions); + setFlagMatched(a,vertex,DONT_COLLAPSE); + double q = a->input->validQuality; + for (size_t i = 0; i < collapseOptions.size(); ++i) { + Entity* edge = collapseOptions[i]; + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + if (!collapse.setEdge(edge)) + continue; + if (!collapse.checkClass()) + continue; + if (!collapse.checkTopo()) + continue; + bool oldForce = a->input->shouldForceAdaptation; + a->input->shouldForceAdaptation = true; + if (!collapse.tryBothDirections(q)) + continue; + a->input->shouldForceAdaptation = oldForce; + collapse.destroyOldElements(); + clearFlagMatched(a,vertex,DONT_COLLAPSE); + return true; //TODO: select from best quality instead of first + } delete FPP; return false; } @@ -950,6 +969,8 @@ void trySnapping(Adapt* a, Tag* snapTag) { Mesh* mesh = a->mesh; Refine* refine = a->refine; + Collapse collapse; + collapse.Init(a); int notProcessed = refine->vtxToSnap.size(); print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", notProcessed); while (notProcessed > 0) @@ -962,7 +983,7 @@ void trySnapping(Adapt* a, Tag* snapTag) bool success = tryReposition(mesh, vertex, snapTag, invalid); if (!success) - success = tryCollapseToVertex(a, vertex, snapTag, invalid); + success = tryCollapseToVertex(a, collapse, vertex, snapTag, invalid); if (success) { mesh->removeTag(vertex,snapTag); From 8f6578d4d85d11bdfd9ec397b006dca0e6a3385d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 16 Apr 2025 21:41:27 -0400 Subject: [PATCH 026/319] using ma_dbg --- ma/maSnap.cc | 36 +++++++++++++----------------------- test/aniso_adapt.h | 2 +- 2 files changed, 14 insertions(+), 24 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 9ee968f68..9c955a7dc 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -915,12 +915,12 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, Tag* snap FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); FPP->setVertex(vertex); FPP->setBadElements(invalid); - std::vector collapseOptions; - FPP->getCandidateEdges(collapseOptions); + std::vector commEdges; + FPP->getCandidateEdges(commEdges); setFlagMatched(a,vertex,DONT_COLLAPSE); double q = a->input->validQuality; - for (size_t i = 0; i < collapseOptions.size(); ++i) { - Entity* edge = collapseOptions[i]; + for (size_t i = 0; i < commEdges.size(); ++i) { + Entity* edge = commEdges[i]; PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); if (!collapse.setEdge(edge)) continue; @@ -952,8 +952,9 @@ void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) } } -bool tryReposition(Mesh* mesh, Entity* vertex, Tag* snapTag, apf::Up& invalid) +bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) { + Mesh* mesh = adapt->mesh; Vector prev = getPosition(mesh, vertex); Vector target; mesh->getDoubleTag(vertex, snapTag, &target[0]); @@ -963,6 +964,7 @@ bool tryReposition(Mesh* mesh, Entity* vertex, Tag* snapTag, apf::Up& invalid) getInvalidTets(mesh, adjacentElements, invalid); if (invalid.n == 0) return true; mesh->setPoint(vertex, 0, prev); + return false; } void trySnapping(Adapt* a, Tag* snapTag) @@ -980,7 +982,7 @@ void trySnapping(Adapt* a, Tag* snapTag) refine->vtxToSnap.pop(); apf::Up invalid; - bool success = tryReposition(mesh, vertex, snapTag, invalid); + bool success = tryReposition(a, vertex, snapTag, invalid); if (!success) success = tryCollapseToVertex(a, collapse, vertex, snapTag, invalid); @@ -998,32 +1000,20 @@ void trySnapping(Adapt* a, Tag* snapTag) void printSnapFields(Adapt* a, Mesh* m, std::string name) { - apf::Field* f = m->findField("SNAP"); - if (!f) - f = apf::createFieldOn(m, "SNAP", apf::SCALAR); - apf::MeshIterator* it = m->begin(0); - apf::MeshEntity* e; - while ((e = m->iterate(it))) - { - if (getFlag(a, e, SNAP)) - apf::setScalar(f, e, 0, 1); - else - apf::setScalar(f, e, 0, 0); - } - m->end(it); - - apf::writeVtkFiles(name.c_str(), m, 1); + apf::writeVtkFiles(name.c_str(), m); + ma_dbg::addTargetLocation(a, "snap_target"); + apf::writeVtkFiles((name+"_fields").c_str(), m, 1); } void snap(Adapt* a) { if (!a->input->shouldSnap) return; - printSnapFields(a, a->mesh, "vtx_to_snap"); Tag* snapTag; tagVertsToSnap(a, snapTag); + printSnapFields(a, a->mesh, "before_last_snap"); trySnapping(a, snapTag); - printSnapFields(a, a->mesh, "vtx_snap_failed"); + printSnapFields(a, a->mesh, "after_last_snap"); clearFlagFromDimension(a, SNAP, 0); a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 71da1c9d4..d514149a9 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -45,7 +45,7 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < in->maximumIterations; ++i) + for (int i = 0; i < 2; ++i) { ma::refine(a); ma::snap(a); From 89175a40d45c64a56e08d69aea8697f5ef4ae956 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 16 Apr 2025 22:55:33 -0400 Subject: [PATCH 027/319] collapse tet edges --- ma/maSnap.cc | 58 ++++++++++++++++++++++++++++++++++++++++++-------- ma/maSnapper.h | 6 +++--- 2 files changed, 52 insertions(+), 12 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 9c955a7dc..238969b0e 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -910,13 +910,40 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, Tag* snapTag, apf::Up& invalid) +bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityToBeat) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + if (!collapse.setEdge(edge)) + return false; + if (!collapse.checkClass()) + return false; + if (!collapse.checkTopo()) + return false; + if (!collapse.tryBothDirections(qualityToBeat)) + return false; + collapse.destroyOldElements(); + return true; +} + +bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, Entity* vertex, std::vector &commEdges) +{ + //TODO: handle edge cases + for (int i=0; imesh, edge, vertex); + apf::Up adjEdges; + a->mesh->getUp(vertexFPP, adjEdges); + for (int j=0; jinput->validQuality)) return true; + } + } + return false; +} + +bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, std::vector &commEdges) { - FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); - FPP->setVertex(vertex); - FPP->setBadElements(invalid); - std::vector commEdges; - FPP->getCandidateEdges(commEdges); setFlagMatched(a,vertex,DONT_COLLAPSE); double q = a->input->validQuality; for (size_t i = 0; i < commEdges.size(); ++i) { @@ -937,10 +964,19 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, Tag* snap clearFlagMatched(a,vertex,DONT_COLLAPSE); return true; //TODO: select from best quality instead of first } - delete FPP; return false; } +std::vector getCommEdgesFromFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) +{ + FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); + FPP->setVertex(vertex); + FPP->setBadElements(invalid); + std::vector commEdges; + FPP->getCandidateEdges(commEdges); + return commEdges; +} + void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) { invalid.n = 0; @@ -984,8 +1020,10 @@ void trySnapping(Adapt* a, Tag* snapTag) apf::Up invalid; bool success = tryReposition(a, vertex, snapTag, invalid); - if (!success) - success = tryCollapseToVertex(a, collapse, vertex, snapTag, invalid); + std::vector commEdges; + if (!success) commEdges = getCommEdgesFromFPP(a, vertex, snapTag, invalid); + if (!success) success = tryCollapseToVertex(a, collapse, vertex, commEdges); + if (!success) success = tryCollapseTetEdges(a, collapse, vertex, commEdges); if (success) { mesh->removeTag(vertex,snapTag); @@ -993,6 +1031,8 @@ void trySnapping(Adapt* a, Tag* snapTag) } else refine->vtxToSnap.push(vertex); + + // delete FPP; } print(a->mesh->getPCU(), "Number of vertices failed %d\n", refine->vtxToSnap.size()); diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 9711d5e65..0de81e277 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -55,15 +55,15 @@ class FirstProblemPlane void setVertex(Entity* v); void setBadElements(apf::Up& badElements); void getCandidateEdges(std::vector &edges); + Entity* vert; + Entity* problemFace; + apf::Up commEdges; private: Adapt* adapter; Tag* snapTag; - Entity* vert; apf::Up problemRegions; - Entity* problemFace; Entity* problemRegion; Vector intersection; - apf::Up commEdges; double tol; bool find(); void findCandidateEdges(std::vector &edges); From 24f8d4dbb5e7a06fa3c62c4af77e4f41adf105f8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Apr 2025 17:12:33 -0400 Subject: [PATCH 028/319] simplify try collpase --- ma/maSnap.cc | 29 ++++++++++++----------------- 1 file changed, 12 insertions(+), 17 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 238969b0e..2a12a729e 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -944,27 +944,22 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, Entity* vertex, std::vect bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, std::vector &commEdges) { - setFlagMatched(a,vertex,DONT_COLLAPSE); + bool flag = getFlag(a,vertex,DONT_COLLAPSE); + if (!flag) setFlag(a,vertex,DONT_COLLAPSE); + bool oldForce = a->input->shouldForceAdaptation; + a->input->shouldForceAdaptation = true; double q = a->input->validQuality; + bool success = false; for (size_t i = 0; i < commEdges.size(); ++i) { Entity* edge = commEdges[i]; - PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - if (!collapse.setEdge(edge)) - continue; - if (!collapse.checkClass()) - continue; - if (!collapse.checkTopo()) - continue; - bool oldForce = a->input->shouldForceAdaptation; - a->input->shouldForceAdaptation = true; - if (!collapse.tryBothDirections(q)) - continue; - a->input->shouldForceAdaptation = oldForce; - collapse.destroyOldElements(); - clearFlagMatched(a,vertex,DONT_COLLAPSE); - return true; //TODO: select from best quality instead of first + success = tryCollapseEdge(a, commEdges[i], collapse, q); + if (success) break; //TODO: select from best quality instead of first } - return false; + + a->input->shouldForceAdaptation = oldForce; + if (!flag) clearFlag(a,vertex,DONT_COLLAPSE); + + return success; } std::vector getCommEdgesFromFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) From 9da25961051dc856747180e1bca43acaff390b3f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Apr 2025 17:20:10 -0400 Subject: [PATCH 029/319] rename --- ma/maSnap.cc | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 2a12a729e..9ef94a8a6 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -946,9 +946,10 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, std::vect { bool flag = getFlag(a,vertex,DONT_COLLAPSE); if (!flag) setFlag(a,vertex,DONT_COLLAPSE); - bool oldForce = a->input->shouldForceAdaptation; + bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; double q = a->input->validQuality; + bool success = false; for (size_t i = 0; i < commEdges.size(); ++i) { Entity* edge = commEdges[i]; @@ -956,7 +957,7 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, std::vect if (success) break; //TODO: select from best quality instead of first } - a->input->shouldForceAdaptation = oldForce; + a->input->shouldForceAdaptation = shouldForce; if (!flag) clearFlag(a,vertex,DONT_COLLAPSE); return success; From 9e812e3a3b89a8a6d900b0b96f4a49596cd9c02f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Apr 2025 18:14:58 -0400 Subject: [PATCH 030/319] using FPP --- ma/maSnap.cc | 36 +++++++++++++++++++++++------------- ma/maSnapper.cc | 2 +- 2 files changed, 24 insertions(+), 14 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 9ef94a8a6..ad0171f42 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -942,35 +942,45 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, Entity* vertex, std::vect return false; } -bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Entity* vertex, std::vector &commEdges) +bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProblemPlane* FPP) { - bool flag = getFlag(a,vertex,DONT_COLLAPSE); - if (!flag) setFlag(a,vertex,DONT_COLLAPSE); + bool flag = getFlag(a,FPP->vert,DONT_COLLAPSE); + if (!flag) setFlag(a,FPP->vert,DONT_COLLAPSE); bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; double q = a->input->validQuality; + Vector position = getPosition(a->mesh, FPP->vert); + Vector target; + a->mesh->getDoubleTag(FPP->vert, snapTag, &target[0]); + double distTarget = (position - target).getLength(); + bool success = false; - for (size_t i = 0; i < commEdges.size(); ++i) { - Entity* edge = commEdges[i]; - success = tryCollapseEdge(a, commEdges[i], collapse, q); + for (size_t i = 0; i < FPP->commEdges.n; ++i) { + Entity* edge = FPP->commEdges.e[i]; + Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); + Vector vFPPCoord = getPosition(a->mesh, vertexOnFPP); + double vertFPPdist = (vFPPCoord - target).getLength(); + if (vertFPPdist > distTarget) continue; + + success = tryCollapseEdge(a, edge, collapse, q); if (success) break; //TODO: select from best quality instead of first } a->input->shouldForceAdaptation = shouldForce; - if (!flag) clearFlag(a,vertex,DONT_COLLAPSE); + if (!flag) clearFlag(a,FPP->vert,DONT_COLLAPSE); return success; } -std::vector getCommEdgesFromFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) +FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) { FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); FPP->setVertex(vertex); FPP->setBadElements(invalid); std::vector commEdges; FPP->getCandidateEdges(commEdges); - return commEdges; + return FPP; } void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) @@ -1016,10 +1026,10 @@ void trySnapping(Adapt* a, Tag* snapTag) apf::Up invalid; bool success = tryReposition(a, vertex, snapTag, invalid); - std::vector commEdges; - if (!success) commEdges = getCommEdgesFromFPP(a, vertex, snapTag, invalid); - if (!success) success = tryCollapseToVertex(a, collapse, vertex, commEdges); - if (!success) success = tryCollapseTetEdges(a, collapse, vertex, commEdges); + FirstProblemPlane* FPP; + if (!success) FPP = getFPP(a, vertex, snapTag, invalid); + if (!success) success = tryCollapseToVertex(a, collapse, snapTag, FPP); + // if (!success) success = tryCollapseTetEdges(a, collapse, vertex, commEdges); if (success) { mesh->removeTag(vertex,snapTag); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index c2c8b5a5e..6c2ee6669 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -171,7 +171,7 @@ static bool tryDigging2(Adapt* a, Collapse& c, apf::Up& badElements, nedges = m->getDownward(elem, 1, edges); for (int j = 0; j < nedges; ++j){ if (tryDiggingEdge(a, c, edges[j])) - return true; + return true; } } return false; From 5237926805671bff9644d7a702e52578ccddba00 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Apr 2025 22:52:36 -0400 Subject: [PATCH 031/319] trying to collapse tet edges --- ma/maSnap.cc | 58 +++++++++++++++++++++++++++++++++++++++------------- 1 file changed, 44 insertions(+), 14 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index ad0171f42..edf5235d5 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -925,20 +925,48 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityT return true; } -bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, Entity* vertex, std::vector &commEdges) +bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { - //TODO: handle edge cases - for (int i=0; imesh, edge, vertex); - apf::Up adjEdges; - a->mesh->getUp(vertexFPP, adjEdges); - for (int j=0; jinput->validQuality)) return true; + apf::Up& commEdges = FPP->commEdges; + double qual = a->input->validQuality; + + //Try to reduce num common edges to one + Entity* pbEdges[3]; + a->mesh->getDownward(FPP->problemFace, 1, pbEdges); + + switch(commEdges.n) { + case 2: { + Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); + Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); + + for (int i=0; i<3; i++) { + Entity* pbVert[2]; + a->mesh->getDownward(pbEdges[i], 0, pbVert); + if (pbVert[0] == v1 && pbVert[1] == v2) break; + if (pbVert[1] == v1 && pbVert[0] == v2) break; + if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; + } + break; } + // case 3: { + // for (int i=0; i<3; i++) + // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; + // break; + // } } + + // for (int i=0; imesh, edge, FPP->vert); + // apf::Up adjEdges; + // a->mesh->getUp(vertexFPP, adjEdges); + // for (int j=0; jmesh, FPP->problemFace, edgeDel)) continue; + // if (tryCollapseEdge(a, edgeDel, collapse, qual)) return true; + // } + // } return false; } @@ -960,6 +988,7 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble Entity* edge = FPP->commEdges.e[i]; Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); Vector vFPPCoord = getPosition(a->mesh, vertexOnFPP); + //TODO: add logic for boundary layers double vertFPPdist = (vFPPCoord - target).getLength(); if (vertFPPdist > distTarget) continue; @@ -997,6 +1026,7 @@ void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) { Mesh* mesh = adapt->mesh; + if (!mesh->hasTag(vertex, snapTag)) return true; Vector prev = getPosition(mesh, vertex); Vector target; mesh->getDoubleTag(vertex, snapTag, &target[0]); @@ -1026,10 +1056,10 @@ void trySnapping(Adapt* a, Tag* snapTag) apf::Up invalid; bool success = tryReposition(a, vertex, snapTag, invalid); - FirstProblemPlane* FPP; + FirstProblemPlane* FPP = 0; if (!success) FPP = getFPP(a, vertex, snapTag, invalid); if (!success) success = tryCollapseToVertex(a, collapse, snapTag, FPP); - // if (!success) success = tryCollapseTetEdges(a, collapse, vertex, commEdges); + if (!success) success = tryCollapseTetEdges(a, collapse, FPP); if (success) { mesh->removeTag(vertex,snapTag); @@ -1038,7 +1068,7 @@ void trySnapping(Adapt* a, Tag* snapTag) else refine->vtxToSnap.push(vertex); - // delete FPP; + if (FPP) delete FPP; } print(a->mesh->getPCU(), "Number of vertices failed %d\n", refine->vtxToSnap.size()); From 81eb05ce781fb0517463851ba021bc12fb8a816e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Mon, 21 Apr 2025 13:25:27 -0400 Subject: [PATCH 032/319] print cavity --- ma/maDBG.cc | 11 +++++++---- ma/maSnap.cc | 52 +++++++++++++++++++++++++++++++++++--------------- ma/maSnapper.h | 4 ++-- 3 files changed, 46 insertions(+), 21 deletions(-) diff --git a/ma/maDBG.cc b/ma/maDBG.cc index 2460ec809..2b4321f43 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -33,7 +33,8 @@ namespace ma_dbg { void writeMesh(ma::Mesh* m, const char* prefix, - const char* suffix) + const char* suffix, + int dim=-1) { std::stringstream ss; if (std::string(suffix) != "") @@ -42,7 +43,7 @@ void writeMesh(ma::Mesh* m, ss << prefix; std::string tmp = ss.str(); const char* fileName = tmp.c_str(); - apf::writeVtkFiles(fileName, m); + apf::writeVtkFiles(fileName, m, dim); } void addTargetLocation(ma::Adapt* a, @@ -208,7 +209,7 @@ void dumpMeshWithFlag(ma::Adapt* a, } ss << prefix << "_" << std::setfill('0') << std::setw(3) << iter; - writeMesh(a->mesh, ss.str().c_str(), ""); + writeMesh(a->mesh, ss.str().c_str(), "", dim); apf::Field* colorField; colorField = a->mesh->findField(flagName); @@ -240,7 +241,9 @@ void createCavityMesh(ma::Adapt* a, cavityMesh->acceptChanges(); std::stringstream ss; - ss << a->input->debugFolder << "/"; + if (a->input->debugFolder) { + ss << a->input->debugFolder << "/"; + } ss << prefix; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index edf5235d5..5b2fa6285 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -910,6 +910,30 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } +void printFPP(Adapt* a, FirstProblemPlane* FPP) +{ + ma_dbg::addTargetLocation(a, "snap_target"); + EntityArray invalid; + for (int i=0; iproblemRegions.n; i++){ + invalid.append(FPP->problemRegions.e[i]); + } + ma_dbg::createCavityMesh(a, invalid, "invalid"); + + EntityArray pbFace; + pbFace.append(FPP->problemFace); + ma_dbg::createCavityMesh(a, pbFace, "pbFace"); + + EntityArray pbRegion; + pbRegion.append(FPP->problemRegion); + ma_dbg::createCavityMesh(a, pbRegion, "pbRegion"); + + for (int i=0; icommEdges.n; i++) + setFlag(a, FPP->commEdges.e[i], CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "commEdges", "commEdges"); + for (int i=0; icommEdges.n; i++) + clearFlag(a, FPP->commEdges.e[i], CHECKED); +} + bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityToBeat) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); @@ -927,6 +951,7 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityT bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { + printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; double qual = a->input->validQuality; @@ -935,19 +960,19 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) a->mesh->getDownward(FPP->problemFace, 1, pbEdges); switch(commEdges.n) { - case 2: { - Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); - Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); + // case 2: { + // Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); + // Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); - for (int i=0; i<3; i++) { - Entity* pbVert[2]; - a->mesh->getDownward(pbEdges[i], 0, pbVert); - if (pbVert[0] == v1 && pbVert[1] == v2) break; - if (pbVert[1] == v1 && pbVert[0] == v2) break; - if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; - } - break; - } + // for (int i=0; i<3; i++) { + // Entity* pbVert[2]; + // a->mesh->getDownward(pbEdges[i], 0, pbVert); + // if (pbVert[0] == v1 && pbVert[1] == v2) break; + // if (pbVert[1] == v1 && pbVert[0] == v2) break; + // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; + // } + // break; + // } // case 3: { // for (int i=0; i<3; i++) // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; @@ -972,8 +997,6 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProblemPlane* FPP) { - bool flag = getFlag(a,FPP->vert,DONT_COLLAPSE); - if (!flag) setFlag(a,FPP->vert,DONT_COLLAPSE); bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; double q = a->input->validQuality; @@ -997,7 +1020,6 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble } a->input->shouldForceAdaptation = shouldForce; - if (!flag) clearFlag(a,FPP->vert,DONT_COLLAPSE); return success; } diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 0de81e277..a2923866c 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -58,11 +58,11 @@ class FirstProblemPlane Entity* vert; Entity* problemFace; apf::Up commEdges; + apf::Up problemRegions; + Entity* problemRegion; private: Adapt* adapter; Tag* snapTag; - apf::Up problemRegions; - Entity* problemRegion; Vector intersection; double tol; bool find(); From 0375093e4696bb681a0b9353af03339ff6c19c25 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 24 Apr 2025 14:32:41 -0400 Subject: [PATCH 033/319] more FPP info --- ma/maDBG.cc | 2 +- ma/maSnap.cc | 63 +++++++++++++++++++++++++---------------- ma/maSnapper.h | 2 +- pumi-meshes | 2 +- test/aniso_adapt_cap.cc | 2 +- 5 files changed, 43 insertions(+), 28 deletions(-) diff --git a/ma/maDBG.cc b/ma/maDBG.cc index 2b4321f43..d16336195 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -169,7 +169,7 @@ void dumpMeshWithQualities(ma::Adapt* a, ss << std::setfill('0') << std::setw(3) << iter << "_"; ss << prefix; - writeMesh(a->mesh, ss.str().c_str(), ""); + writeMesh(a->mesh, ss.str().c_str(), "", -1); apf::Field* colorField; colorField = a->mesh->findField("qual_metric"); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 5b2fa6285..d9d0ffd5e 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -21,6 +21,8 @@ #include #include #include +#include +#include namespace ma { @@ -912,26 +914,31 @@ long snapTaggedVerts(Adapt* a, Tag* tag) void printFPP(Adapt* a, FirstProblemPlane* FPP) { - ma_dbg::addTargetLocation(a, "snap_target"); + apf::writeVtkFiles("FPP_mesh", a->mesh); + ma_dbg::addTargetLocation(a, "FPP_snap_target"); EntityArray invalid; for (int i=0; iproblemRegions.n; i++){ invalid.append(FPP->problemRegions.e[i]); } - ma_dbg::createCavityMesh(a, invalid, "invalid"); + ma_dbg::createCavityMesh(a, invalid, "FPP_invalid"); EntityArray pbFace; pbFace.append(FPP->problemFace); - ma_dbg::createCavityMesh(a, pbFace, "pbFace"); + ma_dbg::createCavityMesh(a, pbFace, "FPP_pbFace"); EntityArray pbRegion; pbRegion.append(FPP->problemRegion); - ma_dbg::createCavityMesh(a, pbRegion, "pbRegion"); + ma_dbg::createCavityMesh(a, pbRegion, "FPP_pbRegion"); for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "commEdges", "commEdges"); + ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_commEdges", "FPP_commEdges"); for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); + + setFlag(a, FPP->vert, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_vertex", "FPP_vertex"); + clearFlag(a, FPP->vert, CHECKED); } bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityToBeat) @@ -949,8 +956,12 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityT return true; } +static int numReached=1; + bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { + if (numReached++ != 1) return false; + printf("commEdges %d\n", FPP->commEdges.n); printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; double qual = a->input->validQuality; @@ -959,26 +970,30 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) Entity* pbEdges[3]; a->mesh->getDownward(FPP->problemFace, 1, pbEdges); - switch(commEdges.n) { - // case 2: { - // Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); - // Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); + // switch(commEdges.n) { + // case 2: { + // Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); + // Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); - // for (int i=0; i<3; i++) { - // Entity* pbVert[2]; - // a->mesh->getDownward(pbEdges[i], 0, pbVert); - // if (pbVert[0] == v1 && pbVert[1] == v2) break; - // if (pbVert[1] == v1 && pbVert[0] == v2) break; - // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; - // } - // break; - // } - // case 3: { - // for (int i=0; i<3; i++) - // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; - // break; - // } - } + // for (int i=0; i<3; i++) { + // Entity* pbVert[2]; + // a->mesh->getDownward(pbEdges[i], 0, pbVert); + // if (pbVert[0] == v1 && pbVert[1] == v2) break; + // if (pbVert[1] == v1 && pbVert[0] == v2) break; + // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; + // } + // break; + // } + // case 3: { + // for (int i=0; i<3; i++) + // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; + // break; + // } + // } + + // for (int i=0; i Date: Thu, 24 Apr 2025 17:49:39 -0400 Subject: [PATCH 034/319] fixed FPP --- ma/maSnap.cc | 5 ++--- ma/maSnapper.cc | 10 +++++----- 2 files changed, 7 insertions(+), 8 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index d9d0ffd5e..98b58bd24 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -960,7 +960,7 @@ static int numReached=1; bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { - if (numReached++ != 1) return false; + if (numReached++ != 8) return false; printf("commEdges %d\n", FPP->commEdges.n); printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; @@ -1014,7 +1014,6 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble { bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; - double q = a->input->validQuality; Vector position = getPosition(a->mesh, FPP->vert); Vector target; @@ -1030,7 +1029,7 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble double vertFPPdist = (vFPPCoord - target).getLength(); if (vertFPPdist > distTarget) continue; - success = tryCollapseEdge(a, edge, collapse, q); + success = tryCollapseEdge(a, edge, collapse, 0); if (success) break; //TODO: select from best quality instead of first } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 6c2ee6669..ac18e44b5 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -354,7 +354,7 @@ bool FirstProblemPlane::find() // ones should have been taken care of by this point } else - dists.push_back(minDist + 1.0 + tol); + dists.push_back(newDirection.getLength()); } } @@ -518,10 +518,10 @@ void FirstProblemPlane::findCommonEdges(apf::Up& cpRegions) flag = 0; break; } - if (flag) { - commEdges.e[commEdges.n] = edges[i]; - commEdges.n++; - } + } + if (flag) { + commEdges.e[commEdges.n] = edges[i]; + commEdges.n++; } } } From 7747e2a7d2c4968ed05b835f329234a5876eb921 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 25 Apr 2025 12:24:28 -0400 Subject: [PATCH 035/319] add classification --- ma/maDBG.cc | 21 +++++++++++++++++++++ ma/maDBG.h | 3 +++ ma/maSnap.cc | 16 ++++++++-------- 3 files changed, 32 insertions(+), 8 deletions(-) diff --git a/ma/maDBG.cc b/ma/maDBG.cc index d16336195..f766a296c 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -46,6 +46,27 @@ void writeMesh(ma::Mesh* m, apf::writeVtkFiles(fileName, m, dim); } +void addClassification(ma::Adapt* a, + const char* fieldName) +{ + ma::Mesh* m = a->mesh; + apf::Field* field; + field = m->findField(fieldName); + if (field) + apf::destroyField(field); + + field = apf::createFieldOn(m, fieldName, apf::SCALAR); + ma::Entity* ent; + ma::Iterator* it; + it = m->begin(0); + while ( (ent = m->iterate(it)) ){ + ma::Model* g = m->toModel(ent); + double modelDimension = (double)m->getModelType(g); + apf::setComponents(field, ent, 0, &modelDimension); + } + m->end(it); +} + void addTargetLocation(ma::Adapt* a, const char* fieldName) { diff --git a/ma/maDBG.h b/ma/maDBG.h index 027a245fd..2d7ed62f9 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -25,6 +25,9 @@ void writeMesh(ma::Mesh* m, const char* prefix, const char* suffix); +void addClassification(ma::Adapt* a, + const char* fieldName); + void addTargetLocation(ma::Adapt* a, const char* fieldName); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 98b58bd24..af7741317 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -914,30 +914,29 @@ long snapTaggedVerts(Adapt* a, Tag* tag) void printFPP(Adapt* a, FirstProblemPlane* FPP) { - apf::writeVtkFiles("FPP_mesh", a->mesh); - ma_dbg::addTargetLocation(a, "FPP_snap_target"); + apf::writeVtkFiles("FPP_Mesh", a->mesh); EntityArray invalid; for (int i=0; iproblemRegions.n; i++){ invalid.append(FPP->problemRegions.e[i]); } - ma_dbg::createCavityMesh(a, invalid, "FPP_invalid"); + ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); EntityArray pbFace; pbFace.append(FPP->problemFace); - ma_dbg::createCavityMesh(a, pbFace, "FPP_pbFace"); + ma_dbg::createCavityMesh(a, pbFace, "FPP_Face"); EntityArray pbRegion; pbRegion.append(FPP->problemRegion); - ma_dbg::createCavityMesh(a, pbRegion, "FPP_pbRegion"); + ma_dbg::createCavityMesh(a, pbRegion, "FPP_Region"); for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_commEdges", "FPP_commEdges"); + ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); setFlag(a, FPP->vert, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_vertex", "FPP_vertex"); + ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_Vertex", "FPP_Vertex"); clearFlag(a, FPP->vert, CHECKED); } @@ -960,7 +959,7 @@ static int numReached=1; bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { - if (numReached++ != 8) return false; + if (numReached++ != 1) return false; printf("commEdges %d\n", FPP->commEdges.n); printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; @@ -1114,6 +1113,7 @@ void printSnapFields(Adapt* a, Mesh* m, std::string name) { apf::writeVtkFiles(name.c_str(), m); ma_dbg::addTargetLocation(a, "snap_target"); + ma_dbg::addClassification(a, "classification"); apf::writeVtkFiles((name+"_fields").c_str(), m, 1); } From 5fc7efab21cdc5708c0a7d19c2dfac37a15f4aa8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 26 Apr 2025 15:57:08 -0400 Subject: [PATCH 036/319] fixed writing FPP face --- ma/maSnap.cc | 24 +++++++++++------------- 1 file changed, 11 insertions(+), 13 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index af7741317..295aa785c 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -921,23 +921,21 @@ void printFPP(Adapt* a, FirstProblemPlane* FPP) } ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); - EntityArray pbFace; - pbFace.append(FPP->problemFace); - ma_dbg::createCavityMesh(a, pbFace, "FPP_Face"); - - EntityArray pbRegion; - pbRegion.append(FPP->problemRegion); - ma_dbg::createCavityMesh(a, pbRegion, "FPP_Region"); - - for (int i=0; icommEdges.n; i++) - setFlag(a, FPP->commEdges.e[i], CHECKED); + for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); - for (int i=0; icommEdges.n; i++) - clearFlag(a, FPP->commEdges.e[i], CHECKED); + for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); setFlag(a, FPP->vert, CHECKED); ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_Vertex", "FPP_Vertex"); clearFlag(a, FPP->vert, CHECKED); + + setFlag(a, FPP->problemFace, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "FPP_Face", "FPP_Face"); + clearFlag(a, FPP->problemFace, CHECKED); + + setFlag(a, FPP->problemRegion, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "FPP_Region", "FPP_Region"); + clearFlag(a, FPP->problemRegion, CHECKED); } bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityToBeat) @@ -963,7 +961,7 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) printf("commEdges %d\n", FPP->commEdges.n); printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; - double qual = a->input->validQuality; + double qual = a->input->goodQuality; //Try to reduce num common edges to one Entity* pbEdges[3]; From 6a460aa30bc4c39ba87db3bc6c29fd7d16f52f79 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 26 Apr 2025 22:12:21 -0400 Subject: [PATCH 037/319] collapse best quality --- ma/maCollapse.cc | 39 ++++++++++++++++++++++++++++++++++++++- ma/maCollapse.h | 2 ++ ma/maSnap.cc | 45 +++++++++++++++++++++++++++++++++++++++------ 3 files changed, 79 insertions(+), 7 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 184e7e2be..faa8b4147 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -55,6 +55,25 @@ bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) return true; } +double Collapse::getQualityThisDirection() { + PCU_ALWAYS_ASSERT( ! adapt->mesh->isShared(vertToCollapse)); + rebuildElements(); + // check quality of linear t before fitting + if ((adapt->mesh->getDimension()==2) + &&( ! isGood2DMesh())) + return -1; + // check the linear quality of tets before fitting + // reject if one is negative + if(adapt->mesh->getDimension()==3 && cavity.shouldFit + && !areTetsValid(adapt->mesh,newElements)) + return -1; + // since they are okay in a linear sense, now fit and do a quality assessment + fitElements(); + double q = getWorstQuality(adapt, newElements); + destroyNewElements(); + return q; +} + bool Collapse::tryThisDirection(double qualityToBeat) { if (!tryThisDirectionNoCancel(qualityToBeat)) { @@ -64,6 +83,7 @@ bool Collapse::tryThisDirection(double qualityToBeat) return true; } +//TODO: Test this change bool Collapse::tryBothDirections(double qualityToBeat) { computeElementSets(); @@ -74,8 +94,11 @@ bool Collapse::tryBothDirections(double qualityToBeat) qualityToBeat = std::min(adapt->input->goodQuality, std::max(getOldQuality(),adapt->input->validQuality)); - if (tryThisDirection(qualityToBeat)) + if (tryThisDirectionNoCancel(qualityToBeat)) return true; + else + destroyNewElements(); + if ( ! getFlag(adapt,vertToKeep,COLLAPSE)) return false; std::swap(vertToKeep,vertToCollapse); @@ -87,6 +110,20 @@ bool Collapse::tryBothDirections(double qualityToBeat) return tryThisDirection(qualityToBeat); } +double Collapse::getQualityFromCollapse() { + computeElementSets(); + double q = getQualityThisDirection(); + if (q == -1) { + if (!getFlag(adapt,vertToKeep,COLLAPSE)) + return false; + std::swap(vertToKeep,vertToCollapse); + computeElementSets(); + q = std::max(q, getQualityThisDirection()); + } + unmark(); + return q; +} + bool Collapse::setEdge(Entity* e) { if (getFlag(adapt,e,DONT_COLLAPSE)) diff --git a/ma/maCollapse.h b/ma/maCollapse.h index bf70c50a3..636f2139f 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -41,6 +41,8 @@ class Collapse bool tryThisDirectionNoCancel(double qualityToBeat); bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); + double getQualityThisDirection(); + double getQualityFromCollapse(); double getOldQuality(); Adapt* adapt; Entity* edge; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 295aa785c..1e03c0661 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -938,21 +938,46 @@ void printFPP(Adapt* a, FirstProblemPlane* FPP) clearFlag(a, FPP->problemRegion, CHECKED); } -bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse, double qualityToBeat) +bool matchingClassification(Adapt* a, Entity* edge) +{ + Entity* vertex[2]; + a->mesh->getDownward(edge,0,vertex); + int md1 = a->mesh->getModelType(a->mesh->toModel(vertex[0])); + int md2 = a->mesh->getModelType(a->mesh->toModel(vertex[1])); + return md1 == md2; +} + +bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + // if (matchingClassification(a, edge)) + // return false; if (!collapse.setEdge(edge)) return false; if (!collapse.checkClass()) return false; if (!collapse.checkTopo()) return false; - if (!collapse.tryBothDirections(qualityToBeat)) + if (!collapse.tryBothDirections(0)) return false; collapse.destroyOldElements(); return true; } +double getQualityFromCollapse(Adapt* a, Entity* edge, Collapse& collapse) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + // if (matchingClassification(a, edge)) + // return -1; + if (!collapse.setEdge(edge)) + return -1; + if (!collapse.checkClass()) + return -1; + if (!collapse.checkTopo()) + return -1; + return collapse.getQualityFromCollapse(); +} + static int numReached=1; bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) @@ -1017,7 +1042,9 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble a->mesh->getDoubleTag(FPP->vert, snapTag, &target[0]); double distTarget = (position - target).getLength(); - bool success = false; + double bestQuality = -1; + Entity* bestEdge; + for (size_t i = 0; i < FPP->commEdges.n; ++i) { Entity* edge = FPP->commEdges.e[i]; Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); @@ -1026,12 +1053,18 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble double vertFPPdist = (vFPPCoord - target).getLength(); if (vertFPPdist > distTarget) continue; - success = tryCollapseEdge(a, edge, collapse, 0); - if (success) break; //TODO: select from best quality instead of first + double quality = getQualityFromCollapse(a, edge, collapse); + if (quality > bestQuality) { + bestQuality = quality; + bestEdge = edge; + } } - a->input->shouldForceAdaptation = shouldForce; + bool success = false; + if (bestQuality > -1) + success = tryCollapseEdge(a, bestEdge, collapse); + a->input->shouldForceAdaptation = shouldForce; return success; } From 766549a5f36357e9e6e0f7a652bdfa7f83fbefba Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 26 Apr 2025 22:45:11 -0400 Subject: [PATCH 038/319] collapsing all edges step one --- ma/maSnap.cc | 66 +++++++++++++++++++++++++++++++++------------------- 1 file changed, 42 insertions(+), 24 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 1e03c0661..892946d76 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -950,8 +950,8 @@ bool matchingClassification(Adapt* a, Entity* edge) bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - // if (matchingClassification(a, edge)) - // return false; + if (matchingClassification(a, edge)) + return false; if (!collapse.setEdge(edge)) return false; if (!collapse.checkClass()) @@ -967,8 +967,8 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) double getQualityFromCollapse(Adapt* a, Entity* edge, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - // if (matchingClassification(a, edge)) - // return -1; + if (matchingClassification(a, edge)) + return -1; if (!collapse.setEdge(edge)) return -1; if (!collapse.checkClass()) @@ -982,11 +982,12 @@ static int numReached=1; bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { - if (numReached++ != 1) return false; - printf("commEdges %d\n", FPP->commEdges.n); - printFPP(a, FPP); + // if (numReached++ != 1) return false; + // printf("commEdges %d\n", FPP->commEdges.n); + // printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; - double qual = a->input->goodQuality; + bool shouldForce = a->input->shouldForceAdaptation; + a->input->shouldForceAdaptation = true; //Try to reduce num common edges to one Entity* pbEdges[3]; @@ -1013,23 +1014,40 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) // } // } - // for (int i=0; imesh, edge, FPP->vert); - // apf::Up adjEdges; - // a->mesh->getUp(vertexFPP, adjEdges); - // for (int j=0; jmesh, FPP->problemFace, edgeDel)) continue; - // if (tryCollapseEdge(a, edgeDel, collapse, qual)) return true; - // } - // } - return false; + for (int i=0; i bestQuality) { + bestQuality = quality; + bestEdge = commEdges.e[i]; + } + } + + for (int i=0; imesh, edge, FPP->vert); + apf::Up adjEdges; + a->mesh->getUp(vertexFPP, adjEdges); + for (int j=0; jmesh, FPP->problemFace, edgeDel)) continue; + double quality = getQualityFromCollapse(a, edgeDel, collapse); + if (quality > bestQuality) { + bestQuality = quality; + bestEdge = edgeDel; + } + } + } + + bool success = false; + if (bestQuality > -1) + success = tryCollapseEdge(a, bestEdge, collapse); + + a->input->shouldForceAdaptation = shouldForce; + return success; } bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProblemPlane* FPP) From 2824a714519d89147c62183a4c1d84081b8d9b0d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 26 Apr 2025 23:08:09 -0400 Subject: [PATCH 039/319] seperated reduce common edges --- ma/maSnap.cc | 84 ++++++++++++++++++++++++++-------------------------- 1 file changed, 42 insertions(+), 42 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 892946d76..148eb2528 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -978,41 +978,14 @@ double getQualityFromCollapse(Adapt* a, Entity* edge, Collapse& collapse) return collapse.getQualityFromCollapse(); } +//TODO: remove static int numReached=1; bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { // if (numReached++ != 1) return false; - // printf("commEdges %d\n", FPP->commEdges.n); // printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; - bool shouldForce = a->input->shouldForceAdaptation; - a->input->shouldForceAdaptation = true; - - //Try to reduce num common edges to one - Entity* pbEdges[3]; - a->mesh->getDownward(FPP->problemFace, 1, pbEdges); - - // switch(commEdges.n) { - // case 2: { - // Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); - // Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); - - // for (int i=0; i<3; i++) { - // Entity* pbVert[2]; - // a->mesh->getDownward(pbEdges[i], 0, pbVert); - // if (pbVert[0] == v1 && pbVert[1] == v2) break; - // if (pbVert[1] == v1 && pbVert[0] == v2) break; - // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; - // } - // break; - // } - // case 3: { - // for (int i=0; i<3; i++) - // if (tryCollapseEdge(a, pbEdges[i], collapse, qual)) return true; - // break; - // } - // } double bestQuality = -1; Entity* bestEdge; @@ -1042,19 +1015,44 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) } } - bool success = false; - if (bestQuality > -1) - success = tryCollapseEdge(a, bestEdge, collapse); + if (bestQuality > -1) + return tryCollapseEdge(a, bestEdge, collapse); + else return false; +} - a->input->shouldForceAdaptation = shouldForce; - return success; +bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +{ + apf::Up& commEdges = FPP->commEdges; + if (commEdges.n > 0) + printf("===MAKE SURE TO TEST===\n"); + + Entity* pbEdges[3]; + a->mesh->getDownward(FPP->problemFace, 1, pbEdges); + switch(commEdges.n) { + case 2: { + Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); + Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); + + for (int i=0; i<3; i++) { + Entity* pbVert[2]; + a->mesh->getDownward(pbEdges[i], 0, pbVert); + if (pbVert[0] == v1 && pbVert[1] == v2) break; + if (pbVert[1] == v1 && pbVert[0] == v2) break; + if (tryCollapseEdge(a, pbEdges[i], collapse)) return true; + } + break; + } + case 3: { + for (int i=0; i<3; i++) + if (tryCollapseEdge(a, pbEdges[i], collapse)) return true; + break; + } + } + return false; } bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProblemPlane* FPP) { - bool shouldForce = a->input->shouldForceAdaptation; - a->input->shouldForceAdaptation = true; - Vector position = getPosition(a->mesh, FPP->vert); Vector target; a->mesh->getDoubleTag(FPP->vert, snapTag, &target[0]); @@ -1078,12 +1076,9 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble } } - bool success = false; - if (bestQuality > -1) - success = tryCollapseEdge(a, bestEdge, collapse); - - a->input->shouldForceAdaptation = shouldForce; - return success; + if (bestQuality > -1) + return tryCollapseEdge(a, bestEdge, collapse); + else return false; } FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) @@ -1131,6 +1126,9 @@ void trySnapping(Adapt* a, Tag* snapTag) collapse.Init(a); int notProcessed = refine->vtxToSnap.size(); print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", notProcessed); + bool shouldForce = a->input->shouldForceAdaptation; + a->input->shouldForceAdaptation = true; + while (notProcessed > 0) { notProcessed--; @@ -1143,6 +1141,7 @@ void trySnapping(Adapt* a, Tag* snapTag) FirstProblemPlane* FPP = 0; if (!success) FPP = getFPP(a, vertex, snapTag, invalid); if (!success) success = tryCollapseToVertex(a, collapse, snapTag, FPP); + if (!success) success = tryReduceCommonEdges(a, collapse, FPP); if (!success) success = tryCollapseTetEdges(a, collapse, FPP); if (success) { @@ -1155,6 +1154,7 @@ void trySnapping(Adapt* a, Tag* snapTag) if (FPP) delete FPP; } + a->input->shouldForceAdaptation = shouldForce; print(a->mesh->getPCU(), "Number of vertices failed %d\n", refine->vtxToSnap.size()); } From 974584a3c3089a9ba11e885188ce43665b377740 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Apr 2025 18:14:50 -0400 Subject: [PATCH 040/319] get best quality collapse --- ma/maSnap.cc | 63 ++++++++++++++++++++++++---------------------------- 1 file changed, 29 insertions(+), 34 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 148eb2528..eb26fb521 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -964,18 +964,27 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) return true; } -double getQualityFromCollapse(Adapt* a, Entity* edge, Collapse& collapse) +struct BestCollapse +{ + double quality=-1; + Entity* edge; +}; + +void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestCollapse& best) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); if (matchingClassification(a, edge)) - return -1; + return; if (!collapse.setEdge(edge)) - return -1; + return; if (!collapse.checkClass()) - return -1; + return; if (!collapse.checkTopo()) - return -1; - return collapse.getQualityFromCollapse(); + return; + double quality = collapse.getQualityFromCollapse(); + if (quality < best.quality) return; + best.quality = quality; + best.edge = edge; } //TODO: remove @@ -987,15 +996,10 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) // printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; - double bestQuality = -1; - Entity* bestEdge; + BestCollapse best; for (int i=0; i bestQuality) { - bestQuality = quality; - bestEdge = commEdges.e[i]; - } + getBestQualityCollapse(a, commEdges.e[i], collapse, best); } for (int i=0; imesh, FPP->problemFace, edgeDel)) continue; - double quality = getQualityFromCollapse(a, edgeDel, collapse); - if (quality > bestQuality) { - bestQuality = quality; - bestEdge = edgeDel; - } + //TODO: MISSING CONDITION FROM OLD CODE + getBestQualityCollapse(a, edgeDel, collapse, best); } } - if (bestQuality > -1) - return tryCollapseEdge(a, bestEdge, collapse); + if (best.quality > -1) + return tryCollapseEdge(a, best.edge, collapse); else return false; } @@ -1051,15 +1052,14 @@ bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) return false; } -bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProblemPlane* FPP) +bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { Vector position = getPosition(a->mesh, FPP->vert); Vector target; - a->mesh->getDoubleTag(FPP->vert, snapTag, &target[0]); + a->mesh->getDoubleTag(FPP->vert, FPP->snapTag, &target[0]); double distTarget = (position - target).getLength(); - double bestQuality = -1; - Entity* bestEdge; + BestCollapse best; for (size_t i = 0; i < FPP->commEdges.n; ++i) { Entity* edge = FPP->commEdges.e[i]; @@ -1068,16 +1068,11 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, Tag* snapTag, FirstProble //TODO: add logic for boundary layers double vertFPPdist = (vFPPCoord - target).getLength(); if (vertFPPdist > distTarget) continue; - - double quality = getQualityFromCollapse(a, edge, collapse); - if (quality > bestQuality) { - bestQuality = quality; - bestEdge = edge; - } + getBestQualityCollapse(a, edge, collapse, best); } - if (bestQuality > -1) - return tryCollapseEdge(a, bestEdge, collapse); + if (best.quality > -1) + return tryCollapseEdge(a, best.edge, collapse); else return false; } @@ -1140,8 +1135,8 @@ void trySnapping(Adapt* a, Tag* snapTag) FirstProblemPlane* FPP = 0; if (!success) FPP = getFPP(a, vertex, snapTag, invalid); - if (!success) success = tryCollapseToVertex(a, collapse, snapTag, FPP); - if (!success) success = tryReduceCommonEdges(a, collapse, FPP); + if (!success) success = tryCollapseToVertex(a, collapse, FPP); + // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); if (!success) success = tryCollapseTetEdges(a, collapse, FPP); if (success) { From ddd67b3a2b307da70d1dc4abf6631aee5a0ed15c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Apr 2025 18:19:11 -0400 Subject: [PATCH 041/319] reduce common edges --- ma/maSnap.cc | 13 +++++++------ 1 file changed, 7 insertions(+), 6 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index eb26fb521..fcc386bfc 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -1024,8 +1024,7 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { apf::Up& commEdges = FPP->commEdges; - if (commEdges.n > 0) - printf("===MAKE SURE TO TEST===\n"); + BestCollapse best; Entity* pbEdges[3]; a->mesh->getDownward(FPP->problemFace, 1, pbEdges); @@ -1039,17 +1038,19 @@ bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) a->mesh->getDownward(pbEdges[i], 0, pbVert); if (pbVert[0] == v1 && pbVert[1] == v2) break; if (pbVert[1] == v1 && pbVert[0] == v2) break; - if (tryCollapseEdge(a, pbEdges[i], collapse)) return true; + getBestQualityCollapse(a, pbEdges[i], collapse, best); } break; } case 3: { for (int i=0; i<3; i++) - if (tryCollapseEdge(a, pbEdges[i], collapse)) return true; + getBestQualityCollapse(a, pbEdges[i], collapse, best); break; } } - return false; + if (best.quality > -1) + return tryCollapseEdge(a, best.edge, collapse); + else return false; } bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) @@ -1136,7 +1137,7 @@ void trySnapping(Adapt* a, Tag* snapTag) FirstProblemPlane* FPP = 0; if (!success) FPP = getFPP(a, vertex, snapTag, invalid); if (!success) success = tryCollapseToVertex(a, collapse, FPP); - // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); + if (!success) success = tryReduceCommonEdges(a, collapse, FPP); if (!success) success = tryCollapseTetEdges(a, collapse, FPP); if (success) { From 22834732775f6d68547888cc876a68e67a68435f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Apr 2025 23:48:37 -0400 Subject: [PATCH 042/319] print first failed fpp --- ma/maSnap.cc | 11 +++++------ 1 file changed, 5 insertions(+), 6 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index fcc386bfc..25ee72203 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -987,15 +987,9 @@ void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestColl best.edge = edge; } -//TODO: remove -static int numReached=1; - bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { - // if (numReached++ != 1) return false; - // printFPP(a, FPP); apf::Up& commEdges = FPP->commEdges; - BestCollapse best; for (int i=0; imesh; @@ -1140,6 +1137,8 @@ void trySnapping(Adapt* a, Tag* snapTag) if (!success) success = tryReduceCommonEdges(a, collapse, FPP); if (!success) success = tryCollapseTetEdges(a, collapse, FPP); + if (!success && numReached++ == 1) printFPP(a, FPP); + if (success) { mesh->removeTag(vertex,snapTag); clearFlag(a, vertex, SNAP); From e6475c31299519ed85739b4d6da5bf503a1d144b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 1 May 2025 17:05:32 -0400 Subject: [PATCH 043/319] make sure snap flag isn't lost --- ma/maSnap.cc | 18 ++++++++++++++---- 1 file changed, 14 insertions(+), 4 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 25ee72203..161e37e6d 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -950,6 +950,10 @@ bool matchingClassification(Adapt* a, Entity* edge) bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + + Entity* vertex[2]; + a->mesh->getDownward(edge,0,vertex); + if (matchingClassification(a, edge)) return false; if (!collapse.setEdge(edge)) @@ -961,6 +965,13 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) if (!collapse.tryBothDirections(0)) return false; collapse.destroyOldElements(); + + Entity* collapsed = vertex[0]; + Entity* kept = vertex[1]; + if (a->mesh->hasUp(collapsed)) + std::swap(collapsed, kept); + PCU_ALWAYS_ASSERT(a->mesh->hasUp(kept)); + PCU_ALWAYS_ASSERT(!getFlag(a, collapsed, SNAP)); //TODO REMOVE return true; } @@ -1108,9 +1119,6 @@ bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) return false; } -//TODO: remove -static int numReached=1; - void trySnapping(Adapt* a, Tag* snapTag) { Mesh* mesh = a->mesh; @@ -1121,6 +1129,7 @@ void trySnapping(Adapt* a, Tag* snapTag) print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", notProcessed); bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; + int numFailed = 0; while (notProcessed > 0) { @@ -1137,7 +1146,8 @@ void trySnapping(Adapt* a, Tag* snapTag) if (!success) success = tryReduceCommonEdges(a, collapse, FPP); if (!success) success = tryCollapseTetEdges(a, collapse, FPP); - if (!success && numReached++ == 1) printFPP(a, FPP); + if (!success) numFailed++; + if (numFailed == 1) printFPP(a, FPP); if (success) { mesh->removeTag(vertex,snapTag); From 31737b4c6aca16cbea379cfe34f4874de4df65a5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 1 May 2025 18:46:33 -0400 Subject: [PATCH 044/319] try collapse multiple times --- ma/maSnap.cc | 45 ++++++++++++++++++--------------------------- 1 file changed, 18 insertions(+), 27 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 161e37e6d..c095f8706 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -934,7 +934,7 @@ void printFPP(Adapt* a, FirstProblemPlane* FPP) clearFlag(a, FPP->problemFace, CHECKED); setFlag(a, FPP->problemRegion, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "FPP_Region", "FPP_Region"); + ma_dbg::dumpMeshWithFlag(a, 0, 3, CHECKED, "FPP_Region", "FPP_Region"); clearFlag(a, FPP->problemRegion, CHECKED); } @@ -951,10 +951,8 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - Entity* vertex[2]; - a->mesh->getDownward(edge,0,vertex); - - if (matchingClassification(a, edge)) + int md = a->mesh->getModelType(a->mesh->toModel(edge)); + if (md < 3) return false; if (!collapse.setEdge(edge)) return false; @@ -965,13 +963,6 @@ bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) if (!collapse.tryBothDirections(0)) return false; collapse.destroyOldElements(); - - Entity* collapsed = vertex[0]; - Entity* kept = vertex[1]; - if (a->mesh->hasUp(collapsed)) - std::swap(collapsed, kept); - PCU_ALWAYS_ASSERT(a->mesh->hasUp(kept)); - PCU_ALWAYS_ASSERT(!getFlag(a, collapsed, SNAP)); //TODO REMOVE return true; } @@ -984,7 +975,9 @@ struct BestCollapse void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestCollapse& best) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - if (matchingClassification(a, edge)) + + int md = a->mesh->getModelType(a->mesh->toModel(edge)); + if (md < 3) return; if (!collapse.setEdge(edge)) return; @@ -1121,27 +1114,30 @@ bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) void trySnapping(Adapt* a, Tag* snapTag) { - Mesh* mesh = a->mesh; Refine* refine = a->refine; Collapse collapse; collapse.Init(a); - int notProcessed = refine->vtxToSnap.size(); - print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", notProcessed); + print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", refine->vtxToSnap.size()); bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; int numFailed = 0; - while (notProcessed > 0) + while (refine->vtxToSnap.size() > 0) { - notProcessed--; Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); apf::Up invalid; bool success = tryReposition(a, vertex, snapTag, invalid); - FirstProblemPlane* FPP = 0; - if (!success) FPP = getFPP(a, vertex, snapTag, invalid); + if (success) { + a->mesh->removeTag(vertex,snapTag); + clearFlag(a, vertex, SNAP); + continue; + } + + FirstProblemPlane* FPP = getFPP(a, vertex, snapTag, invalid); + if (!success) success = tryCollapseToVertex(a, collapse, FPP); if (!success) success = tryReduceCommonEdges(a, collapse, FPP); if (!success) success = tryCollapseTetEdges(a, collapse, FPP); @@ -1149,18 +1145,13 @@ void trySnapping(Adapt* a, Tag* snapTag) if (!success) numFailed++; if (numFailed == 1) printFPP(a, FPP); - if (success) { - mesh->removeTag(vertex,snapTag); - clearFlag(a, vertex, SNAP); - } - else - refine->vtxToSnap.push(vertex); + if (success) refine->vtxToSnap.push(vertex); if (FPP) delete FPP; } a->input->shouldForceAdaptation = shouldForce; - print(a->mesh->getPCU(), "Number of vertices failed %d\n", refine->vtxToSnap.size()); + print(a->mesh->getPCU(), "Number of vertices failed %d\n", numFailed); } void printSnapFields(Adapt* a, Mesh* m, std::string name) From 7cbd69ed1a7e5d0e7ee9d131eb31713a50b43742 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 3 May 2025 15:32:24 -0400 Subject: [PATCH 045/319] same side --- ma/maSnap.cc | 40 +++++++++++++++++++++++++--------------- 1 file changed, 25 insertions(+), 15 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index c095f8706..859e53f1d 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -938,22 +938,10 @@ void printFPP(Adapt* a, FirstProblemPlane* FPP) clearFlag(a, FPP->problemRegion, CHECKED); } -bool matchingClassification(Adapt* a, Entity* edge) -{ - Entity* vertex[2]; - a->mesh->getDownward(edge,0,vertex); - int md1 = a->mesh->getModelType(a->mesh->toModel(vertex[0])); - int md2 = a->mesh->getModelType(a->mesh->toModel(vertex[1])); - return md1 == md2; -} - bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - int md = a->mesh->getModelType(a->mesh->toModel(edge)); - if (md < 3) - return false; if (!collapse.setEdge(edge)) return false; if (!collapse.checkClass()) @@ -976,8 +964,7 @@ void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestColl { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - int md = a->mesh->getModelType(a->mesh->toModel(edge)); - if (md < 3) + if (!a->sizeField->shouldCollapse(edge)) return; if (!collapse.setEdge(edge)) return; @@ -991,6 +978,26 @@ void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestColl best.edge = edge; } +bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) +{ + Entity* faceVert[3]; + a->mesh->getDownward(face, 0, faceVert); + Vector facePos[3]; + for (int i=0; i < 3; ++i) + facePos[i] = getPosition(a->mesh,faceVert[i]); + + Vector normal = apf::cross((facePos[1]-facePos[0]),(facePos[2]-facePos[0])); + Vector testPos = getPosition(a->mesh, testVert); + Vector refPos = getPosition(a->mesh, refVert); + const double tol=1e-12; + + double dr = (testPos - facePos[0]) * normal; + if (dr*dr < tol) return false; //testVert is on the face + double ds = (refPos - facePos[0]) * normal; + if (dr*ds < 0.0) return false; //different sides of face + return true; //same side of face +} + bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) { apf::Up& commEdges = FPP->commEdges; @@ -1009,7 +1016,8 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) Entity* edgeDel = adjEdges.e[j]; if (edgeDel==edge) continue; if (isLowInHigh(a->mesh, FPP->problemFace, edgeDel)) continue; - //TODO: MISSING CONDITION FROM OLD CODE + Entity* vertDel = getEdgeVertOppositeVert(a->mesh, edgeDel, vertexFPP); + if (sameSide(a, vertDel, FPP->vert, FPP->problemFace)) continue; getBestQualityCollapse(a, edgeDel, collapse, best); } } @@ -1121,9 +1129,11 @@ void trySnapping(Adapt* a, Tag* snapTag) bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; int numFailed = 0; + int startSize = refine->vtxToSnap.size(); while (refine->vtxToSnap.size() > 0) { + if (startSize-- == 0) break; //Stop after one move Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); From f3393b48351b0fafe43bc8cb5082812f5b6b020f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 8 May 2025 15:57:11 -0400 Subject: [PATCH 046/319] added size check --- ma/maCollapse.cc | 32 +++++++++++++++++++++++++++++--- ma/maCollapse.h | 1 + ma/maSnap.cc | 8 +++----- 3 files changed, 33 insertions(+), 8 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index faa8b4147..d3b90203f 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -55,6 +55,32 @@ bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) return true; } +bool Collapse::edgesGoodSize() { + PCU_ALWAYS_ASSERT(elementsToKeep.size()); + PCU_ALWAYS_ASSERT(elementsToKeep.size() == newElements.size()); + size_t i=0; + double maxSize=0; + double ratioAtMaxSize=0; + APF_ITERATE(EntitySet,elementsToKeep,it) { + Entity* edgesBefore[6]; + adapt->mesh->getDownward(*it,1,edgesBefore); + Entity* edgesAfter[6]; + adapt->mesh->getDownward(newElements[i++],1,edgesAfter); + for (int j=0; j<6; j++) { + double sizeBefore = adapt->sizeField->measure(edgesBefore[j]); + double sizeAfter = adapt->sizeField->measure(edgesAfter[j]); + double ratio = sizeAfter/sizeBefore; + if (sizeAfter > maxSize) { + maxSize = sizeAfter; + ratioAtMaxSize = ratio; + } + } + } + // printf("maxSize %f Ratio %f\n", maxSize, ratioAtMaxSize); + if (maxSize > 1.5 && ratioAtMaxSize > 1.44 ) return false; + return true; +} + double Collapse::getQualityThisDirection() { PCU_ALWAYS_ASSERT( ! adapt->mesh->isShared(vertToCollapse)); rebuildElements(); @@ -69,9 +95,7 @@ double Collapse::getQualityThisDirection() { return -1; // since they are okay in a linear sense, now fit and do a quality assessment fitElements(); - double q = getWorstQuality(adapt, newElements); - destroyNewElements(); - return q; + return getWorstQuality(adapt, newElements); } bool Collapse::tryThisDirection(double qualityToBeat) @@ -113,12 +137,14 @@ bool Collapse::tryBothDirections(double qualityToBeat) double Collapse::getQualityFromCollapse() { computeElementSets(); double q = getQualityThisDirection(); + destroyNewElements(); if (q == -1) { if (!getFlag(adapt,vertToKeep,COLLAPSE)) return false; std::swap(vertToKeep,vertToCollapse); computeElementSets(); q = std::max(q, getQualityThisDirection()); + destroyNewElements(); } unmark(); return q; diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 636f2139f..2500e9b6f 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -41,6 +41,7 @@ class Collapse bool tryThisDirectionNoCancel(double qualityToBeat); bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); + bool edgesGoodSize(); double getQualityThisDirection(); double getQualityFromCollapse(); double getOldQuality(); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 859e53f1d..c026669a8 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -964,8 +964,6 @@ void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestColl { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - if (!a->sizeField->shouldCollapse(edge)) - return; if (!collapse.setEdge(edge)) return; if (!collapse.checkClass()) @@ -1149,11 +1147,11 @@ void trySnapping(Adapt* a, Tag* snapTag) FirstProblemPlane* FPP = getFPP(a, vertex, snapTag, invalid); if (!success) success = tryCollapseToVertex(a, collapse, FPP); - if (!success) success = tryReduceCommonEdges(a, collapse, FPP); - if (!success) success = tryCollapseTetEdges(a, collapse, FPP); + // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); + // if (!success) success = tryCollapseTetEdges(a, collapse, FPP); if (!success) numFailed++; - if (numFailed == 1) printFPP(a, FPP); + if (!success && numFailed == 1) printFPP(a, FPP); if (success) refine->vtxToSnap.push(vertex); From f1542389d8daba6db08b3d997c866941423e4abc Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 8 May 2025 23:44:30 -0400 Subject: [PATCH 047/319] collapse one direction --- ma/maSnap.cc | 83 ++++++++++++++++++++++++++++------------------------ 1 file changed, 45 insertions(+), 38 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index c026669a8..336384ada 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -938,42 +938,49 @@ void printFPP(Adapt* a, FirstProblemPlane* FPP) clearFlag(a, FPP->problemRegion, CHECKED); } -bool tryCollapseEdge(Adapt* a, Entity* edge, Collapse& collapse) +bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - - if (!collapse.setEdge(edge)) - return false; - if (!collapse.checkClass()) - return false; - if (!collapse.checkTopo()) - return false; - if (!collapse.tryBothDirections(0)) - return false; - collapse.destroyOldElements(); - return true; + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + + bool result = false; + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(0)) { + collapse.destroyOldElements(); + result = true; + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + return result; } struct BestCollapse { double quality=-1; Entity* edge; + Entity* keep; }; -void getBestQualityCollapse(Adapt* a, Entity* edge, Collapse& collapse, BestCollapse& best) +void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, BestCollapse& best) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - - if (!collapse.setEdge(edge)) - return; - if (!collapse.checkClass()) - return; - if (!collapse.checkTopo()) - return; - double quality = collapse.getQualityFromCollapse(); - if (quality < best.quality) return; - best.quality = quality; - best.edge = edge; + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo()) { + double quality = collapse.getQualityFromCollapse(); + if (quality > 0 && quality > best.quality) { + best.quality = quality; + best.edge = edge; + best.keep = keep; + } + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); } bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) @@ -1002,7 +1009,7 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) BestCollapse best; for (int i=0; imesh, FPP->problemFace, edgeDel)) continue; - Entity* vertDel = getEdgeVertOppositeVert(a->mesh, edgeDel, vertexFPP); - if (sameSide(a, vertDel, FPP->vert, FPP->problemFace)) continue; - getBestQualityCollapse(a, edgeDel, collapse, best); + Entity* vertKeep = getEdgeVertOppositeVert(a->mesh, edgeDel, vertexFPP); + if (sameSide(a, vertKeep, FPP->vert, FPP->problemFace)) continue; + getBestQualityCollapse(a, edgeDel, vertKeep, collapse, best); } } if (best.quality > -1) - return tryCollapseEdge(a, best.edge, collapse); + return tryCollapseEdge(a, best.edge, best.keep, collapse); else return false; } @@ -1042,18 +1049,18 @@ bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) a->mesh->getDownward(pbEdges[i], 0, pbVert); if (pbVert[0] == v1 && pbVert[1] == v2) break; if (pbVert[1] == v1 && pbVert[0] == v2) break; - getBestQualityCollapse(a, pbEdges[i], collapse, best); + getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); } break; } case 3: { for (int i=0; i<3; i++) - getBestQualityCollapse(a, pbEdges[i], collapse, best); + getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); break; } } if (best.quality > -1) - return tryCollapseEdge(a, best.edge, collapse); + return tryCollapseEdge(a, best.edge, best.keep, collapse); else return false; } @@ -1071,13 +1078,13 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); Vector vFPPCoord = getPosition(a->mesh, vertexOnFPP); //TODO: add logic for boundary layers - double vertFPPdist = (vFPPCoord - target).getLength(); - if (vertFPPdist > distTarget) continue; - getBestQualityCollapse(a, edge, collapse, best); + double distToFPPVert = (vFPPCoord - target).getLength(); + if (distToFPPVert > distTarget) continue; + getBestQualityCollapse(a, edge, FPP->vert, collapse, best); } if (best.quality > -1) - return tryCollapseEdge(a, best.edge, collapse); + return tryCollapseEdge(a, best.edge, best.keep, collapse); else return false; } @@ -1131,7 +1138,7 @@ void trySnapping(Adapt* a, Tag* snapTag) while (refine->vtxToSnap.size() > 0) { - if (startSize-- == 0) break; //Stop after one move + if (startSize-- == 0) break; //TEMP: Stop after one move Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); @@ -1148,7 +1155,7 @@ void trySnapping(Adapt* a, Tag* snapTag) if (!success) success = tryCollapseToVertex(a, collapse, FPP); // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); - // if (!success) success = tryCollapseTetEdges(a, collapse, FPP); + if (!success) success = tryCollapseTetEdges(a, collapse, FPP); if (!success) numFailed++; if (!success && numFailed == 1) printFPP(a, FPP); From e4dbbef9b4462861698cc704477f7ca5cdd773c6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 10 May 2025 14:46:28 -0400 Subject: [PATCH 048/319] quality greater than zero --- ma/maSnap.cc | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 336384ada..c57127033 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -974,7 +974,7 @@ void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collapse& coll collapse.checkClass() && collapse.checkTopo()) { double quality = collapse.getQualityFromCollapse(); - if (quality > 0 && quality > best.quality) { + if (quality > best.quality) { best.quality = quality; best.edge = edge; best.keep = keep; @@ -1027,7 +1027,7 @@ bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) } } - if (best.quality > -1) + if (best.quality > 0) return tryCollapseEdge(a, best.edge, best.keep, collapse); else return false; } @@ -1059,7 +1059,7 @@ bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) break; } } - if (best.quality > -1) + if (best.quality > 0) return tryCollapseEdge(a, best.edge, best.keep, collapse); else return false; } @@ -1083,7 +1083,7 @@ bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) getBestQualityCollapse(a, edge, FPP->vert, collapse, best); } - if (best.quality > -1) + if (best.quality > 0) return tryCollapseEdge(a, best.edge, best.keep, collapse); else return false; } From 776b8ff2e8522b56800b9690813312adc898338b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 10 May 2025 15:46:24 -0400 Subject: [PATCH 049/319] moved snap code --- ma/maSnap.cc | 239 +----------------------------- ma/maSnapper.cc | 386 +++++++++++++++++++++++++++++------------------- 2 files changed, 237 insertions(+), 388 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index c57127033..3ccd7305a 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -912,221 +912,9 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -void printFPP(Adapt* a, FirstProblemPlane* FPP) -{ - apf::writeVtkFiles("FPP_Mesh", a->mesh); - EntityArray invalid; - for (int i=0; iproblemRegions.n; i++){ - invalid.append(FPP->problemRegions.e[i]); - } - ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); - - for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); - for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); - - setFlag(a, FPP->vert, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_Vertex", "FPP_Vertex"); - clearFlag(a, FPP->vert, CHECKED); - - setFlag(a, FPP->problemFace, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "FPP_Face", "FPP_Face"); - clearFlag(a, FPP->problemFace, CHECKED); - - setFlag(a, FPP->problemRegion, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 3, CHECKED, "FPP_Region", "FPP_Region"); - clearFlag(a, FPP->problemRegion, CHECKED); -} - -bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) -{ - PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - bool alreadyFlagged = true; - if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); - if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); - - bool result = false; - if (collapse.setEdge(edge) && - collapse.checkClass() && - collapse.checkTopo() && - collapse.tryBothDirections(0)) { - collapse.destroyOldElements(); - result = true; - } - if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); - return result; -} - -struct BestCollapse -{ - double quality=-1; - Entity* edge; - Entity* keep; -}; - -void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, BestCollapse& best) -{ - PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - bool alreadyFlagged = true; - if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); - if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); - if (collapse.setEdge(edge) && - collapse.checkClass() && - collapse.checkTopo()) { - double quality = collapse.getQualityFromCollapse(); - if (quality > best.quality) { - best.quality = quality; - best.edge = edge; - best.keep = keep; - } - } - if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); -} - -bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) -{ - Entity* faceVert[3]; - a->mesh->getDownward(face, 0, faceVert); - Vector facePos[3]; - for (int i=0; i < 3; ++i) - facePos[i] = getPosition(a->mesh,faceVert[i]); - - Vector normal = apf::cross((facePos[1]-facePos[0]),(facePos[2]-facePos[0])); - Vector testPos = getPosition(a->mesh, testVert); - Vector refPos = getPosition(a->mesh, refVert); - const double tol=1e-12; - - double dr = (testPos - facePos[0]) * normal; - if (dr*dr < tol) return false; //testVert is on the face - double ds = (refPos - facePos[0]) * normal; - if (dr*ds < 0.0) return false; //different sides of face - return true; //same side of face -} - -bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) -{ - apf::Up& commEdges = FPP->commEdges; - BestCollapse best; - - for (int i=0; imesh, edge, FPP->vert); - apf::Up adjEdges; - a->mesh->getUp(vertexFPP, adjEdges); - for (int j=0; jmesh, FPP->problemFace, edgeDel)) continue; - Entity* vertKeep = getEdgeVertOppositeVert(a->mesh, edgeDel, vertexFPP); - if (sameSide(a, vertKeep, FPP->vert, FPP->problemFace)) continue; - getBestQualityCollapse(a, edgeDel, vertKeep, collapse, best); - } - } - - if (best.quality > 0) - return tryCollapseEdge(a, best.edge, best.keep, collapse); - else return false; -} - -bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) -{ - apf::Up& commEdges = FPP->commEdges; - BestCollapse best; - - Entity* pbEdges[3]; - a->mesh->getDownward(FPP->problemFace, 1, pbEdges); - switch(commEdges.n) { - case 2: { - Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); - Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); - - for (int i=0; i<3; i++) { - Entity* pbVert[2]; - a->mesh->getDownward(pbEdges[i], 0, pbVert); - if (pbVert[0] == v1 && pbVert[1] == v2) break; - if (pbVert[1] == v1 && pbVert[0] == v2) break; - getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); - } - break; - } - case 3: { - for (int i=0; i<3; i++) - getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); - break; - } - } - if (best.quality > 0) - return tryCollapseEdge(a, best.edge, best.keep, collapse); - else return false; -} - -bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) -{ - Vector position = getPosition(a->mesh, FPP->vert); - Vector target; - a->mesh->getDoubleTag(FPP->vert, FPP->snapTag, &target[0]); - double distTarget = (position - target).getLength(); - - BestCollapse best; - - for (size_t i = 0; i < FPP->commEdges.n; ++i) { - Entity* edge = FPP->commEdges.e[i]; - Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); - Vector vFPPCoord = getPosition(a->mesh, vertexOnFPP); - //TODO: add logic for boundary layers - double distToFPPVert = (vFPPCoord - target).getLength(); - if (distToFPPVert > distTarget) continue; - getBestQualityCollapse(a, edge, FPP->vert, collapse, best); - } - - if (best.quality > 0) - return tryCollapseEdge(a, best.edge, best.keep, collapse); - else return false; -} - -FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) -{ - FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); - FPP->setVertex(vertex); - FPP->setBadElements(invalid); - std::vector commEdges; - FPP->getCandidateEdges(commEdges); - return FPP; -} - -void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) -{ - invalid.n = 0; - Vector v[4]; - for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - ma::getVertPoints(mesh,adjacentElements[i],v); - if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) - invalid.e[invalid.n++] = adjacentElements[i]; - } -} - -bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) -{ - Mesh* mesh = adapt->mesh; - if (!mesh->hasTag(vertex, snapTag)) return true; - Vector prev = getPosition(mesh, vertex); - Vector target; - mesh->getDoubleTag(vertex, snapTag, &target[0]); - Upward adjacentElements; - mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - mesh->setPoint(vertex, 0, target); - getInvalidTets(mesh, adjacentElements, invalid); - if (invalid.n == 0) return true; - mesh->setPoint(vertex, 0, prev); - return false; -} - void trySnapping(Adapt* a, Tag* snapTag) { + Snapper snapper(a, snapTag, false); Refine* refine = a->refine; Collapse collapse; collapse.Init(a); @@ -1141,28 +929,11 @@ void trySnapping(Adapt* a, Tag* snapTag) if (startSize-- == 0) break; //TEMP: Stop after one move Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); - - apf::Up invalid; - bool success = tryReposition(a, vertex, snapTag, invalid); - - if (success) { - a->mesh->removeTag(vertex,snapTag); - clearFlag(a, vertex, SNAP); - continue; + snapper.setVert(vertex); + if (!snapper.run()) { + refine->vtxToSnap.push(vertex); + numFailed++; } - - FirstProblemPlane* FPP = getFPP(a, vertex, snapTag, invalid); - - if (!success) success = tryCollapseToVertex(a, collapse, FPP); - // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); - if (!success) success = tryCollapseTetEdges(a, collapse, FPP); - - if (!success) numFailed++; - if (!success && numFailed == 1) printFPP(a, FPP); - - if (success) refine->vtxToSnap.push(vertex); - - if (FPP) delete FPP; } a->input->shouldForceAdaptation = shouldForce; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index ac18e44b5..df1fd84ca 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -11,6 +11,7 @@ #include "maAdapt.h" #include "maShapeHandler.h" #include "maSnap.h" +#include "maDBG.h" #include #include #include @@ -42,8 +43,6 @@ bool Snapper::requestLocality(apf::CavityOp* o) { if (!o->requestLocality(&vert, 1)) return false; - if (isSimple) - return true; /* in order to try an edge collapse (we don't yet know which edge), bring in a cavity such that all adjacent edges have both vertices local. @@ -71,112 +70,6 @@ static bool didInvert(Mesh* m, Vector& oldNormal, Entity* tri) return (oldNormal * getTriNormal(m, tri)) < 0; } -static void collectBadElements(Adapt* a, Upward& es, - apf::NewArray& normals, apf::Up& bad) -{ - Mesh* m = a->mesh; - bad.n = 0; - for (size_t i = 0; i < es.getSize(); ++i) { -/* for now, when snapping a vertex on the boundary - layer, ignore the quality of layer elements. - not only do we not have metrics for this, but the - algorithm that moves curves would need to change */ - if (getFlag(a, es[i], LAYER)) - continue; - double quality = a->shape->getQuality(es[i]); - if (quality < a->input->validQuality) - bad.e[bad.n++] = es[i]; -/* check for triangles whose normals have changed by - more than 90 degrees when the vertex was snapped */ - else if ((m->getDimension() == 2) && - didInvert(m, normals[i], es[i])) - bad.e[bad.n++] = es[i]; - } - PCU_ALWAYS_ASSERT(bad.n < (int)(sizeof(bad.e) / sizeof(Entity*))); -} - -static bool trySnapping(Adapt* adapter, Tag* tag, Entity* vert, - apf::Up& badElements) -{ - Mesh* mesh = adapter->mesh; - Vector x = getPosition(mesh, vert); - Vector s; - mesh->getDoubleTag(vert, tag, &s[0]); -/* gather the adjacent elements */ - Upward elements; - mesh->getAdjacent(vert, mesh->getDimension(), elements); -/* in 2D, get the old triangle normals */ - apf::NewArray normals; - computeNormals(mesh, elements, normals); -/* move the vertex to the desired point */ - mesh->setPoint(vert, 0, s); -/* check resulting cavity */ - collectBadElements(adapter, elements, normals, badElements); - if (badElements.n) { - /* not ok, put the vertex back where it was */ - mesh->setPoint(vert, 0, x); - return false; - } else { - /* ok, take off the snap tag */ - mesh->removeTag(vert, tag); - return true; - } -} - -static bool tryDiggingEdge(Adapt* adapter, Collapse& collapse, Entity* e) -{ - Mesh* mesh = adapter->mesh; - PCU_ALWAYS_ASSERT(mesh->getType(e) == apf::Mesh::EDGE); - if ( ! collapse.setEdge(e)) - return false; - if ( ! collapse.checkClass()) - return false; - if ( ! collapse.checkTopo()) - return false; - double q = adapter->input->validQuality; - bool oldShouldForce = adapter->input->shouldForceAdaptation; - adapter->input->shouldForceAdaptation = true; - if ( ! collapse.tryBothDirections(q)) - return false; - adapter->input->shouldForceAdaptation = oldShouldForce; - collapse.destroyOldElements(); - return true; -} - -static bool tryDigging2(Adapt* a, Collapse& c, apf::Up& badElements, - FirstProblemPlane* FPP) -{ - - Mesh* m = a->mesh; - int dim = m->getDimension(); - - // first go through the candidate edges found by the first problem plane - // (if any) - std::vector edgesFromFPP; - edgesFromFPP.clear(); - if (FPP && dim == 3) { - FPP->setBadElements(badElements); - FPP->getCandidateEdges(edgesFromFPP); - } - for (size_t i = 0; i < edgesFromFPP.size(); ++i) { - if (tryDiggingEdge(a, c, edgesFromFPP[i])) - return true; - } - - // next try all the edges - for (int i = 0; i < badElements.n; ++i) { - Entity* elem = badElements.e[i]; - Downward edges; - int nedges; - nedges = m->getDownward(elem, 1, edges); - for (int j = 0; j < nedges; ++j){ - if (tryDiggingEdge(a, c, edges[j])) - return true; - } - } - return false; -} - static void updateVertexParametricCoords( Mesh* m, Entity* vert, @@ -219,64 +112,249 @@ static void updateVertexParametricCoords( m->setParam(vert, pBar); } -static bool tryMoving(Adapt* adapter, Entity* v, Tag* tag) +static void printFPP(Adapt* a, FirstProblemPlane* FPP) { - Mesh* m = adapter->mesh; - PCU_ALWAYS_ASSERT_VERBOSE(m->hasTag(v, tag), - "expecting the vertex to have a tag!"); - bool hadItBefore = getFlag(adapter, v, DONT_MOVE); - setFlag(adapter, v, DONT_MOVE); - Vector newTarget; - m->getDoubleTag(v, tag, &newTarget[0]); // default - updateVertexParametricCoords(m, v, newTarget); - m->setDoubleTag(v, tag, &newTarget[0]); - if (!hadItBefore) - clearFlag(adapter, v, DONT_MOVE); - return true; + apf::writeVtkFiles("FPP_Mesh", a->mesh); + EntityArray invalid; + for (int i=0; iproblemRegions.n; i++){ + invalid.append(FPP->problemRegions.e[i]); + } + ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); + + for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); + for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); + + setFlag(a, FPP->vert, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_Vertex", "FPP_Vertex"); + clearFlag(a, FPP->vert, CHECKED); + + setFlag(a, FPP->problemFace, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "FPP_Face", "FPP_Face"); + clearFlag(a, FPP->problemFace, CHECKED); + + setFlag(a, FPP->problemRegion, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 3, CHECKED, "FPP_Region", "FPP_Region"); + clearFlag(a, FPP->problemRegion, CHECKED); +} + +static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + + bool result = false; + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(0)) { + collapse.destroyOldElements(); + result = true; + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + return result; } -static bool tryDigging(Adapt* a, Collapse& c, Entity* v, - apf::Up& badElements, FirstProblemPlane* FPP = 0) +struct BestCollapse { - bool hadItBefore = getFlag(a, v, DONT_COLLAPSE); - setFlag(a, v, DONT_COLLAPSE); - bool ok = tryDigging2(a, c, badElements, FPP); - if (!hadItBefore) - clearFlag(a, v, DONT_COLLAPSE); - return ok; + double quality=-1; + Entity* edge; + Entity* keep; +}; + +static void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, BestCollapse& best) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo()) { + double quality = collapse.getQualityFromCollapse(); + if (quality > best.quality) { + best.quality = quality; + best.edge = edge; + best.keep = keep; + } + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); +} + +static bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) +{ + Entity* faceVert[3]; + a->mesh->getDownward(face, 0, faceVert); + Vector facePos[3]; + for (int i=0; i < 3; ++i) + facePos[i] = getPosition(a->mesh,faceVert[i]); + + Vector normal = apf::cross((facePos[1]-facePos[0]),(facePos[2]-facePos[0])); + Vector testPos = getPosition(a->mesh, testVert); + Vector refPos = getPosition(a->mesh, refVert); + const double tol=1e-12; + + double dr = (testPos - facePos[0]) * normal; + if (dr*dr < tol) return false; //testVert is on the face + double ds = (refPos - facePos[0]) * normal; + if (dr*ds < 0.0) return false; //different sides of face + return true; //same side of face +} + +static bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +{ + apf::Up& commEdges = FPP->commEdges; + BestCollapse best; + + for (int i=0; imesh, edge, FPP->vert); + apf::Up adjEdges; + a->mesh->getUp(vertexFPP, adjEdges); + for (int j=0; jmesh, FPP->problemFace, edgeDel)) continue; + Entity* vertKeep = getEdgeVertOppositeVert(a->mesh, edgeDel, vertexFPP); + if (sameSide(a, vertKeep, FPP->vert, FPP->problemFace)) continue; + getBestQualityCollapse(a, edgeDel, vertKeep, collapse, best); + } + } + + if (best.quality > 0) + return tryCollapseEdge(a, best.edge, best.keep, collapse); + else return false; +} + +static bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +{ + apf::Up& commEdges = FPP->commEdges; + BestCollapse best; + + Entity* pbEdges[3]; + a->mesh->getDownward(FPP->problemFace, 1, pbEdges); + switch(commEdges.n) { + case 2: { + Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); + Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); + + for (int i=0; i<3; i++) { + Entity* pbVert[2]; + a->mesh->getDownward(pbEdges[i], 0, pbVert); + if (pbVert[0] == v1 && pbVert[1] == v2) break; + if (pbVert[1] == v1 && pbVert[0] == v2) break; + getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); + } + break; + } + case 3: { + for (int i=0; i<3; i++) + getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); + break; + } + } + if (best.quality > 0) + return tryCollapseEdge(a, best.edge, best.keep, collapse); + else return false; +} + +static bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +{ + Vector position = getPosition(a->mesh, FPP->vert); + Vector target; + a->mesh->getDoubleTag(FPP->vert, FPP->snapTag, &target[0]); + double distTarget = (position - target).getLength(); + + BestCollapse best; + + for (size_t i = 0; i < FPP->commEdges.n; ++i) { + Entity* edge = FPP->commEdges.e[i]; + Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); + Vector vFPPCoord = getPosition(a->mesh, vertexOnFPP); + //TODO: add logic for boundary layers + double distToFPPVert = (vFPPCoord - target).getLength(); + if (distToFPPVert > distTarget) continue; + getBestQualityCollapse(a, edge, FPP->vert, collapse, best); + } + + if (best.quality > 0) + return tryCollapseEdge(a, best.edge, best.keep, collapse); + else return false; +} + +static FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up& invalid) +{ + FirstProblemPlane* FPP = new FirstProblemPlane(a, snapTag); + FPP->setVertex(vertex); + FPP->setBadElements(invalid); + std::vector commEdges; + FPP->getCandidateEdges(commEdges); + return FPP; +} + +static void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) +{ + invalid.n = 0; + Vector v[4]; + for (size_t i = 0; i < adjacentElements.getSize(); ++i) { + ma::getVertPoints(mesh,adjacentElements[i],v); + if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) + invalid.e[invalid.n++] = adjacentElements[i]; + } +} + +static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) +{ + Mesh* mesh = adapt->mesh; + if (!mesh->hasTag(vertex, snapTag)) return true; + Vector prev = getPosition(mesh, vertex); + Vector target; + mesh->getDoubleTag(vertex, snapTag, &target[0]); + Upward adjacentElements; + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + mesh->setPoint(vertex, 0, target); + getInvalidTets(mesh, adjacentElements, invalid); + if (invalid.n == 0) return true; + mesh->setPoint(vertex, 0, prev); + return false; } bool Snapper::trySimpleSnap() { - apf::Up badElements; - return trySnapping(adapter, snapTag, vert, badElements); + apf::Up invalid; + return tryReposition(adapter, vert, snapTag, invalid); } +static int numFailed = 0; + bool Snapper::run() { - dug = false; - moved = false; - apf::Up badElements; - bool ok = trySnapping(adapter, snapTag, vert, badElements); - if (isSimple) - return ok; - // there is no need for the following if there exists no bad elements - if (badElements.n == 0) return true; - FirstProblemPlane* FPP; -#ifdef DO_FPP - FPP = new FirstProblemPlane(adapter, snapTag); - FPP->setVertex(vert); -#else - FPP = 0; -#endif - if (adapter->mesh->getDimension() == 2) - moved = tryMoving(adapter, vert, snapTag); - else - dug = tryDigging(adapter, collapse, vert, badElements, FPP); - delete FPP; - if (!dug && !moved) - return false; - return trySnapping(adapter, snapTag, vert, badElements); + apf::Up invalid; + bool success = tryReposition(adapter, vert, snapTag, invalid); + + if (success) { + adapter->mesh->removeTag(vert,snapTag); + clearFlag(adapter, vert, SNAP); + return true; + } + + FirstProblemPlane* FPP = getFPP(adapter, vert, snapTag, invalid); + + if (!success) success = tryCollapseToVertex(adapter, collapse, FPP); + // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); + // if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); + + if (!success) numFailed++; + if (!success && numFailed == 1) printFPP(adapter, FPP); + + if (FPP) delete FPP; + return !success; } FirstProblemPlane::FirstProblemPlane(Adapt* a, Tag* st) From 1ba989dd42b2691c3bf24c8c17020f0e2f788789 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 10 May 2025 16:38:50 -0400 Subject: [PATCH 050/319] using size check --- ma/maCollapse.cc | 3 +++ ma/maSnap.cc | 6 +++--- ma/maSnapper.cc | 2 +- 3 files changed, 7 insertions(+), 4 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index d3b90203f..0128a3529 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -93,6 +93,9 @@ double Collapse::getQualityThisDirection() { if(adapt->mesh->getDimension()==3 && cavity.shouldFit && !areTetsValid(adapt->mesh,newElements)) return -1; + // make sure we aren't undoing refinement + if(!edgesGoodSize()) + return -1; // since they are okay in a linear sense, now fit and do a quality assessment fitElements(); return getWorstQuality(adapt, newElements); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 3ccd7305a..bde664e36 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -930,10 +930,10 @@ void trySnapping(Adapt* a, Tag* snapTag) Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); snapper.setVert(vertex); - if (!snapper.run()) { - refine->vtxToSnap.push(vertex); + if (!snapper.run()) numFailed++; - } + else if (getFlag(a, vertex, SNAP)) + refine->vtxToSnap.push(vertex); } a->input->shouldForceAdaptation = shouldForce; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index df1fd84ca..28ad8c236 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -354,7 +354,7 @@ bool Snapper::run() if (!success && numFailed == 1) printFPP(adapter, FPP); if (FPP) delete FPP; - return !success; + return success; } FirstProblemPlane::FirstProblemPlane(Adapt* a, Tag* st) From 05cb90fe3a7abc56c270f9f23c7c4457413571da Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 10 May 2025 17:14:13 -0400 Subject: [PATCH 051/319] remove unused --- ma/maSnap.cc | 66 +++++++------------------------------------------ ma/maSnapper.cc | 5 ++-- 2 files changed, 11 insertions(+), 60 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index bde664e36..2b4e45161 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -916,8 +916,6 @@ void trySnapping(Adapt* a, Tag* snapTag) { Snapper snapper(a, snapTag, false); Refine* refine = a->refine; - Collapse collapse; - collapse.Init(a); print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", refine->vtxToSnap.size()); bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; @@ -940,23 +938,22 @@ void trySnapping(Adapt* a, Tag* snapTag) print(a->mesh->getPCU(), "Number of vertices failed %d\n", numFailed); } -void printSnapFields(Adapt* a, Mesh* m, std::string name) -{ - apf::writeVtkFiles(name.c_str(), m); - ma_dbg::addTargetLocation(a, "snap_target"); - ma_dbg::addClassification(a, "classification"); - apf::writeVtkFiles((name+"_fields").c_str(), m, 1); -} - void snap(Adapt* a) { if (!a->input->shouldSnap) return; Tag* snapTag; tagVertsToSnap(a, snapTag); - printSnapFields(a, a->mesh, "before_last_snap"); + + ma_dbg::addTargetLocation(a, "snap_target"); + ma_dbg::addClassification(a, "classification"); + apf::writeVtkFiles("before_last_snap", a->mesh); + trySnapping(a, snapTag); - printSnapFields(a, a->mesh, "after_last_snap"); + + apf::writeVtkFiles("after_last_snap", a->mesh); + ma_dbg::dumpMeshWithFlag(a, 0, 0, SNAP, "snap_tag", "after_last_snap_tag"); + clearFlagFromDimension(a, SNAP, 0); a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; @@ -983,49 +980,4 @@ void prevSnap(Adapt* a) if (a->hasLayer) checkLayerShape(a->mesh, "after snapping"); } - -void visualizeGeometricInfo(Mesh* m, const char* name) -{ - Tag* dimensionTag = m->createIntTag("ma_geom_dim",1); - Tag* idTag = m->createIntTag("ma_geom_id",1); - apf::Field* field = apf::createLagrangeField(m,"ma_param",apf::VECTOR,1); - apf::Field* targetField = apf::createLagrangeField(m,"ma_target",apf::VECTOR,1); - Iterator* it = m->begin(0); - Entity* v; - while ((v = m->iterate(it))) - { - Model* c = m->toModel(v); - int dimension = m->getModelType(c); - m->setIntTag(v,dimensionTag,&dimension); - int id = m->getModelTag(c); - m->setIntTag(v,idTag,&id); - Vector p; - Vector xp = getPosition(m, v); - m->getParam(v,p); - if (dimension == 2 || dimension == 1) { - Vector x; - m->isParamPointInsideModel(c, &p[0], x); - apf::setVector(targetField, v, 0, x - xp); - } - else { - Vector x(0., 0., 0.); - apf::setVector(targetField, v, 0, x); - } - apf::setVector(field,v,0,p); - } - m->end(it); - apf::writeVtkFiles(name,m); - it = m->begin(0); - while ((v = m->iterate(it))) - { - m->removeTag(v,dimensionTag); - m->removeTag(v,idTag); - } - m->end(it); - m->destroyTag(dimensionTag); - m->destroyTag(idTag); - apf::destroyField(field); - apf::destroyField(targetField); -} - } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 28ad8c236..093677205 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -347,11 +347,10 @@ bool Snapper::run() FirstProblemPlane* FPP = getFPP(adapter, vert, snapTag, invalid); if (!success) success = tryCollapseToVertex(adapter, collapse, FPP); - // if (!success) success = tryReduceCommonEdges(a, collapse, FPP); + // if (!success) success = tryReduceCommonEdges(adapter, collapse, FPP); // if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); - if (!success) numFailed++; - if (!success && numFailed == 1) printFPP(adapter, FPP); + if (!success && numFailed++ == 1) printFPP(adapter, FPP); if (FPP) delete FPP; return success; From c102b32869a1dc107f0b7e0d180305f35b4fb128 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Mon, 12 May 2025 13:33:09 -0400 Subject: [PATCH 052/319] good results from collapse --- ma/maCollapse.cc | 2 +- ma/maSnap.cc | 2 +- ma/maSnapper.cc | 25 ++++++++++++++++++------- test/aniso_adapt.h | 1 + 4 files changed, 21 insertions(+), 9 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 0128a3529..495c6ee5e 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -77,7 +77,7 @@ bool Collapse::edgesGoodSize() { } } // printf("maxSize %f Ratio %f\n", maxSize, ratioAtMaxSize); - if (maxSize > 1.5 && ratioAtMaxSize > 1.44 ) return false; + if (maxSize > 1.6 && ratioAtMaxSize > 1.44 ) return false; return true; } diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 2b4e45161..065849a37 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -924,7 +924,7 @@ void trySnapping(Adapt* a, Tag* snapTag) while (refine->vtxToSnap.size() > 0) { - if (startSize-- == 0) break; //TEMP: Stop after one move + // if (startSize-- == 0) break; //TEMP: Stop after one move Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); snapper.setVert(vertex); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 093677205..9954c8a7d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -121,6 +121,9 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) } ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); + ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_Collapse", "FPP_Collapse"); + clearFlagFromDimension(a, CHECKED, 1); + for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); @@ -209,7 +212,10 @@ static bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* BestCollapse best; for (int i=0; imesh->getDownward(commEdges.e[i], 0, vertex); + for (int j=0; j<2; j++) + getBestQualityCollapse(a, commEdges.e[i], vertex[j], collapse, best); } for (int i=0; imesh->getDownward(pbEdges[i], 0, pbVert); if (pbVert[0] == v1 && pbVert[1] == v2) break; if (pbVert[1] == v1 && pbVert[0] == v2) break; - getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); + for (int j=0; j<2; j++) + getBestQualityCollapse(a, pbEdges[i], pbVert[j], collapse, best); } break; } case 3: { - for (int i=0; i<3; i++) - getBestQualityCollapse(a, pbEdges[i], 0, collapse, best); + for (int i=0; i<3; i++) { + Entity* pbVert[2]; + a->mesh->getDownward(pbEdges[i], 0, pbVert); + for (int j=0; j<2; j++) + getBestQualityCollapse(a, pbEdges[i], pbVert[j], collapse, best); + } break; } } @@ -331,7 +342,7 @@ bool Snapper::trySimpleSnap() return tryReposition(adapter, vert, snapTag, invalid); } -static int numFailed = 0; +static int numFailed = 0; //TODO: REMOVE bool Snapper::run() { @@ -348,9 +359,9 @@ bool Snapper::run() if (!success) success = tryCollapseToVertex(adapter, collapse, FPP); // if (!success) success = tryReduceCommonEdges(adapter, collapse, FPP); - // if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); + if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); - if (!success && numFailed++ == 1) printFPP(adapter, FPP); + if (!success && ++numFailed == 1) printFPP(adapter, FPP); if (FPP) delete FPP; return success; diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index d514149a9..25d632906 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -47,6 +47,7 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) ma::Adapt* a = new ma::Adapt(in); for (int i = 0; i < 2; ++i) { + // ma::coarsen(a); ma::refine(a); ma::snap(a); } From 79538f790632fae2014486ee6ff17da57720443c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 15 May 2025 22:27:30 -0400 Subject: [PATCH 053/319] split in progress --- ma/maSnapper.cc | 85 ++++++++++++++++++++++++++++++++++++++++++++++++- ma/maSnapper.h | 6 ++++ 2 files changed, 90 insertions(+), 1 deletion(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 9954c8a7d..d41730166 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -19,7 +19,7 @@ namespace ma { -Snapper::Snapper(Adapt* a, Tag* st, bool is) +Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a) { adapter = a; snapTag = st; @@ -141,6 +141,88 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) clearFlag(a, FPP->problemRegion, CHECKED); } +static Vector projOnTriPlane(Adapt* a, Entity* face, Entity* vert) +{ + Entity* faceVert[3]; + a->mesh->getDownward(face, 0, faceVert); + Vector facePos[3]; + for (int i=0; i < 3; ++i) + facePos[i] = getPosition(a->mesh,faceVert[i]); + + Vector normal = apf::cross((facePos[1]-facePos[0]),(facePos[2]-facePos[0])); + double magN = normal*normal; + Vector vertPos = getPosition(a->mesh, vert); + double magCP = (vertPos-facePos[0]) * normal; + double ratio=magCP/magN; + + Vector result; + for (int i=0; i<3; ++i) + result[i]=vertPos[i]-ratio*normal[i]; + + return result; +} + +static void GetTetStats(Adapt* a, FirstProblemPlane* FPP) +{ + Entity* faceEdges[3]; + a->mesh->getDownward(FPP->problemFace, 1, faceEdges); + + Entity* verts[3]; + a->mesh->getDownward(FPP->problemFace, 0, verts); + + Vector facePos[3]; + Entity* edges[6]; + for (int i=0; i<3; i++) { + edges[i]=faceEdges[i]; + facePos[i]=getPosition(a->mesh, verts[i]); + } + + Entity* faces[4]; + faces[0]=FPP->problemFace; + + Entity* problemFaces[4]; + a->mesh->getDownward(FPP->problemRegion, 2, problemFaces); + for (int i=0; i<4; i++) { + if (problemFaces[i] == FPP->problemFace ) continue; + else if (isLowInHigh(a->mesh, problemFaces[i], edges[0])) faces[1] = problemFaces[i]; + else if (isLowInHigh(a->mesh, problemFaces[i], edges[1])) faces[2] = problemFaces[i]; + else if (isLowInHigh(a->mesh, problemFaces[i], edges[2])) faces[3] = problemFaces[i]; + } + + for (int i=1; i<3; i++) { + Entity* problemEdges[3]; + a->mesh->getDownward(faces[i], 1, problemEdges); + for (int j=0; j<3; j++) { + if (problemEdges[j]==edges[i-1] ) continue; + else if (isLowInHigh(a->mesh, problemEdges[j], verts[0])) edges[3] = problemEdges[j]; + else if (isLowInHigh(a->mesh, problemEdges[j], verts[1])) edges[4] = problemEdges[j]; + else if (isLowInHigh(a->mesh, problemEdges[j], verts[2])) edges[5] = problemEdges[j]; + } + } +} + +bool Snapper::trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP) +{ + if (FPP->commEdges.n < 2) return false; + printf("SPLIT\n"); + double baseArea = apf::measure(a->mesh, FPP->problemFace); + double smallest = baseArea; + Entity* faces[4]; + a->mesh->getDownward(FPP->problemRegion, 2, faces); + for (int i=0; i<4; i++) { + double area = apf::measure(a->mesh, faces[i]); + if (area < smallest) + smallest = area; + } + + if (smallest == baseArea) { + PCU_ALWAYS_ASSERT(false); + } + + + return false; +} + static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); @@ -360,6 +442,7 @@ bool Snapper::run() if (!success) success = tryCollapseToVertex(adapter, collapse, FPP); // if (!success) success = tryReduceCommonEdges(adapter, collapse, FPP); if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); + // if (!success) success = trySwapOrSplit(adapter, FPP); if (!success && ++numFailed == 1) printFPP(adapter, FPP); diff --git a/ma/maSnapper.h b/ma/maSnapper.h index c3da4c778..52610fe4d 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -11,6 +11,8 @@ #define MA_SNAPPER_H #include "maCollapse.h" +#include "maSingleSplitCollapse.h" +#include "maEdgeSwap.h" namespace apf { class CavityOp; @@ -40,7 +42,11 @@ class Snapper Tag* snapTag; Entity* vert; Collapse collapse; + SingleSplitCollapse splitCollapse; + EdgeSwap edgeSwap; bool isSimple; + + bool trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP); }; struct Ray{ From 875da60daeedf1ab4388a25de0dfcd2b8fe4836d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 16 May 2025 10:02:13 -0400 Subject: [PATCH 054/319] fixed compile error --- ma/maSnap.cc | 3 ++- ma/maSnapper.h | 2 +- 2 files changed, 3 insertions(+), 2 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 065849a37..f5067105f 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -953,7 +953,8 @@ void snap(Adapt* a) apf::writeVtkFiles("after_last_snap", a->mesh); ma_dbg::dumpMeshWithFlag(a, 0, 0, SNAP, "snap_tag", "after_last_snap_tag"); - + + clearFlagFromDimension(a, COLLAPSE, 1); //TODO: Figure out what is making this neccessary clearFlagFromDimension(a, SNAP, 0); a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 52610fe4d..352c42b0d 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -43,7 +43,7 @@ class Snapper Entity* vert; Collapse collapse; SingleSplitCollapse splitCollapse; - EdgeSwap edgeSwap; + // EdgeSwap edgeSwap; bool isSimple; bool trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP); From 0e3073f3de7c73a505bfaf9ab4fc025ecd2136fb Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 16 May 2025 19:31:47 -0400 Subject: [PATCH 055/319] split collapse skeleton --- ma/maSnap.cc | 2 +- ma/maSnapper.cc | 199 +++++++++++++++++++++++++++++++++++++++++++++--- ma/maSnapper.h | 3 +- 3 files changed, 191 insertions(+), 13 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index f5067105f..0dd0ab108 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -954,7 +954,7 @@ void snap(Adapt* a) apf::writeVtkFiles("after_last_snap", a->mesh); ma_dbg::dumpMeshWithFlag(a, 0, 0, SNAP, "snap_tag", "after_last_snap_tag"); - clearFlagFromDimension(a, COLLAPSE, 1); //TODO: Figure out what is making this neccessary + // clearFlagFromDimension(a, COLLAPSE, 1); //TODO: Figure out what is making this neccessary clearFlagFromDimension(a, SNAP, 0); a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index d41730166..b7549bc63 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -24,11 +24,17 @@ Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a) adapter = a; snapTag = st; collapse.Init(a); + edgeSwap = makeEdgeSwap(a); isSimple = is; dug = false; vert = 0; } +Snapper::~Snapper() +{ + delete edgeSwap; +} + void Snapper::setVert(Entity* v) { vert = v; @@ -141,6 +147,17 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) clearFlag(a, FPP->problemRegion, CHECKED); } +static int indexOfMin(double a0, double a1, double a2) +{ + int k; + double buf; + if( a0mesh->getDownward(FPP->problemFace, 1, faceEdges); @@ -199,26 +226,176 @@ static void GetTetStats(Adapt* a, FirstProblemPlane* FPP) else if (isLowInHigh(a->mesh, problemEdges[j], verts[2])) edges[5] = problemEdges[j]; } } + + Vector projection = projOnTriPlane(a, FPP->problemFace, FPP->vert); + //TODO: ERROR if projection = any point on problem face + + /* find normal to the plane */ + Vector v01 = facePos[1] - facePos[0]; + Vector v02 = facePos[2] - facePos[0]; + Vector norm = apf::cross(v01, v02); + + Vector ri = projection - facePos[0]; + Vector rj = projection - facePos[1]; + Vector rk = projection - facePos[2]; + + /* determine which side of the edges does the point R lie. + First get normal vectors */ + Vector normi = apf::cross(v01, ri); + Vector normj = apf::cross(facePos[2]-facePos[1], rj); + Vector normk = apf::cross(facePos[0]-facePos[2], rk); + + Vector mag; + mag[0]=normi*norm; + mag[1]=normj*norm; + mag[2]=normk*norm; + + area[0]=norm*norm; + area[1]=normi*normi; + area[2]=normj*normj; + area[3]=normk*normk; + + int filter[]={1,2,4}; + int bit=0; + /* examine signs of mag[0], mag[1] and mag[2] */ + for(int i=0; i<3; i++) + if(mag[i]>0.0) + bit = bit | filter[i]; + + /* + 010=2 | 011=3 / 001=1 + | / + ------------+--e2--+----------- + v0| /v2 + | 7 / + 110=6 e0 e1 + | / + | / 101=5 + |/ + v1+ + /| + / | + 4 + */ + + switch( bit ) { + case 1:{ + int Emap[]={0,4,3}; + int Fmap[]={0,2,3}; + ents[0]=faces[1]; + int i=indexOfMin(area[0],area[2],area[3]); + ents[1]=edges[Emap[i]]; + ents[2]=faces[Fmap[i]]; + break; + } + case 2: { + int Emap[]={1,4,5}; + int Fmap[]={0,1,3}; + ents[0]=faces[2]; + int i=indexOfMin(area[0],area[1],area[3]); + ents[1]=edges[Emap[i]]; + ents[2]=faces[Fmap[i]]; + break; + } + case 3: { + // double L1_xyz[2][3], L2_xyz[2][3]; + ents[0]=edges[2]; + ents[1]=edges[4]; + ents[2]=((area[0]commEdges.n < 2) return false; printf("SPLIT\n"); - double baseArea = apf::measure(a->mesh, FPP->problemFace); - double smallest = baseArea; - Entity* faces[4]; - a->mesh->getDownward(FPP->problemRegion, 2, faces); - for (int i=0; i<4; i++) { - double area = apf::measure(a->mesh, faces[i]); - if (area < smallest) - smallest = area; - } + Entity* ents[4]; + double area[4]; + int bit = getTetStats(a, FPP, ents, area); - if (smallest == baseArea) { + double min=area[0]; + for(int i=1; i<4; i++) + if( area[i] key problem: two mesh edges + if (bit==3 || bit==5 || bit==6) { + // // check edge swapping + // for (int i=0; i<2; i++) + // if (edgeSwap->run(ents[i])) //TODO: Select best + // return true; + + // // check split+collapse + // for (int i=0; i<2; i++) + // if (splitCollapse.run(ents[i], ents[i+2])) //TODO: Select best + // return true; + } + return false; } diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 352c42b0d..f660c84aa 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -30,6 +30,7 @@ class Snapper { public: Snapper(Adapt* a, Tag* st, bool is); + ~Snapper(); void setVert(Entity* v); Entity* getVert(); bool requestLocality(apf::CavityOp* o); @@ -43,7 +44,7 @@ class Snapper Entity* vert; Collapse collapse; SingleSplitCollapse splitCollapse; - // EdgeSwap edgeSwap; + EdgeSwap* edgeSwap; bool isSimple; bool trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP); From 101e49539a181cd622172b24a67e680b180c813d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Tue, 20 May 2025 23:51:21 -0400 Subject: [PATCH 056/319] split collapse working --- ma/maCollapse.cc | 2 +- ma/maSnapper.cc | 67 ++++++++++++++++++++++++++++------------------ test/aniso_adapt.h | 4 +-- 3 files changed, 44 insertions(+), 29 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 495c6ee5e..246600750 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -77,7 +77,7 @@ bool Collapse::edgesGoodSize() { } } // printf("maxSize %f Ratio %f\n", maxSize, ratioAtMaxSize); - if (maxSize > 1.6 && ratioAtMaxSize > 1.44 ) return false; + if (maxSize > 1.52 && ratioAtMaxSize > 1.2 ) return false; return true; } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b7549bc63..e735f433d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -118,6 +118,13 @@ static void updateVertexParametricCoords( m->setParam(vert, pBar); } +static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) +{ + setFlag(a, ent, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, dim, CHECKED, name, name); + clearFlag(a, ent, CHECKED); +} + static void printFPP(Adapt* a, FirstProblemPlane* FPP) { apf::writeVtkFiles("FPP_Mesh", a->mesh); @@ -127,24 +134,13 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) } ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); - ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_Collapse", "FPP_Collapse"); - clearFlagFromDimension(a, CHECKED, 1); - for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); - setFlag(a, FPP->vert, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "FPP_Vertex", "FPP_Vertex"); - clearFlag(a, FPP->vert, CHECKED); - - setFlag(a, FPP->problemFace, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "FPP_Face", "FPP_Face"); - clearFlag(a, FPP->problemFace, CHECKED); - - setFlag(a, FPP->problemRegion, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 3, CHECKED, "FPP_Region", "FPP_Region"); - clearFlag(a, FPP->problemRegion, CHECKED); + flagAndPrint(a, FPP->vert, 0, "FPP_Vertex"); + flagAndPrint(a, FPP->problemFace, 2, "FPP_Face"); + flagAndPrint(a, FPP->problemRegion, 3, "FPP_Region"); } static int indexOfMin(double a0, double a1, double a2) @@ -369,7 +365,6 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double bool Snapper::trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP) { if (FPP->commEdges.n < 2) return false; - printf("SPLIT\n"); Entity* ents[4]; double area[4]; int bit = getTetStats(a, FPP, ents, area); @@ -382,18 +377,38 @@ bool Snapper::trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP) PCU_ALWAYS_ASSERT(false); } - printf("BIT %d\n", bit); // two large dihedral angles -> key problem: two mesh edges if (bit==3 || bit==5 || bit==6) { - // // check edge swapping - // for (int i=0; i<2; i++) - // if (edgeSwap->run(ents[i])) //TODO: Select best - // return true; - - // // check split+collapse - // for (int i=0; i<2; i++) - // if (splitCollapse.run(ents[i], ents[i+2])) //TODO: Select best - // return true; + // if (++reachedSwap == 1) { + // flagAndPrint(a, ents[2], 2, "FPP_SwapFace"); + // } + // check edge swapping + for (int i=0; i<2; i++) + if (edgeSwap->run(ents[i])) //TODO: Select best + return true; + + // check split+collapse + for (int i=0; i<2; i++) + if (splitCollapse.run(ents[i], FPP->vert)) //TODO: Select best + return true; + } + // three large dihedral angles -> key entity: a mesh face + else { + + // check edge swaps + Entity* edges[3]; + a->mesh->getDownward(ents[0], 1, edges); + for (int i=0; i<3; i++) { + if (edgeSwap->run(edges[i])) //TODO: Select best + return true; + } + + //TODO: IMPLEMENT FACE SWAP + + if (splitCollapse.run(ents[1], FPP->vert)); + return true; + + //TODO: USE DOUBLE SPLIT COLLAPSE } @@ -619,7 +634,7 @@ bool Snapper::run() if (!success) success = tryCollapseToVertex(adapter, collapse, FPP); // if (!success) success = tryReduceCommonEdges(adapter, collapse, FPP); if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); - // if (!success) success = trySwapOrSplit(adapter, FPP); + if (!success) success = trySwapOrSplit(adapter, FPP); if (!success && ++numFailed == 1) printFPP(adapter, FPP); diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 25d632906..8d2bc63e7 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -45,9 +45,9 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < 2; ++i) + for (int i = 0; i < in->maximumIterations; ++i) { - // ma::coarsen(a); + ma::coarsen(a); ma::refine(a); ma::snap(a); } From 289170c0683e5081b1c7c759be25bdb50f3220bf Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 23 May 2025 15:17:33 -0400 Subject: [PATCH 057/319] clean up code --- ma/maMatch.cc | 3 +++ ma/maSnap.cc | 21 +++++++++++++-------- ma/maSnapper.cc | 11 ++++------- 3 files changed, 20 insertions(+), 15 deletions(-) diff --git a/ma/maMatch.cc b/ma/maMatch.cc index c17ecdda5..7309f5c5c 100644 --- a/ma/maMatch.cc +++ b/ma/maMatch.cc @@ -75,6 +75,9 @@ void matchNewElements(Refine* r) print(m->getPCU(), "updated matching for %li faces", face_count); } +/* we are starting to support a few operations on matched +meshes, sincluding snapping+UR. this should prevent snapping +from modifying any matched entities */ void preventMatchedCavityMods(Adapt* a) { Mesh* m = a->mesh; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 0dd0ab108..4dc5a0cd7 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -920,11 +920,9 @@ void trySnapping(Adapt* a, Tag* snapTag) bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; int numFailed = 0; - int startSize = refine->vtxToSnap.size(); while (refine->vtxToSnap.size() > 0) { - // if (startSize-- == 0) break; //TEMP: Stop after one move Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); snapper.setVert(vertex); @@ -942,22 +940,29 @@ void snap(Adapt* a) { if (!a->input->shouldSnap) return; + double t0 = pcu::Time(); Tag* snapTag; + // preventMatchedCavityMods(a); tagVertsToSnap(a, snapTag); - ma_dbg::addTargetLocation(a, "snap_target"); - ma_dbg::addClassification(a, "classification"); - apf::writeVtkFiles("before_last_snap", a->mesh); + // ma_dbg::addTargetLocation(a, "snap_target"); + // ma_dbg::addClassification(a, "classification"); + // apf::writeVtkFiles("before_last_snap", a->mesh); trySnapping(a, snapTag); + // snapLayer(a, tag); - apf::writeVtkFiles("after_last_snap", a->mesh); - ma_dbg::dumpMeshWithFlag(a, 0, 0, SNAP, "snap_tag", "after_last_snap_tag"); + // apf::writeVtkFiles("after_last_snap", a->mesh); // clearFlagFromDimension(a, COLLAPSE, 1); //TODO: Figure out what is making this neccessary - clearFlagFromDimension(a, SNAP, 0); + clearFlagFromDimension(a, SNAP, 0); //TODO: should not be neccessary a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; + + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "snapped in %f seconds\n", t1 - t0); + // if (a->hasLayer) + // checkLayerShape(a->mesh, "after snapping"); } void prevSnap(Adapt* a) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index e735f433d..fb030e913 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -305,7 +305,7 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double // L2_xyz[0][0]=fxyz[1][0]; L2_xyz[1][0]=pxyz[0]; // L2_xyz[0][1]=fxyz[1][1]; L2_xyz[1][1]=pxyz[1]; // L2_xyz[0][2]=fxyz[1][2]; L2_xyz[1][2]=pxyz[2]; - // fromMeshTools::MT_intLineLine2(L1_xyz,L2_xyz,&i,intXYZ); + // fromMeshTools::MT_intLineLine2(L1_xyz,L2_xyz,&i,intXYZ); //TODO: This logic is used for double split collapse break; } case 4: { @@ -329,7 +329,7 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double // L2_xyz[0][0]=fxyz[0][0]; L2_xyz[1][0]=pxyz[0]; // L2_xyz[0][1]=fxyz[0][1]; L2_xyz[1][1]=pxyz[1]; // L2_xyz[0][2]=fxyz[0][2]; L2_xyz[1][2]=pxyz[2]; - // fromMeshTools::MT_intLineLine2(L1_xyz,L2_xyz,&i,intXYZ); + // fromMeshTools::MT_intLineLine2(L1_xyz,L2_xyz,&i,intXYZ); //TODO: This logic is used for double split collapse break; } case 6: { @@ -344,7 +344,7 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double // L2_xyz[0][0]=fxyz[2][0]; L2_xyz[1][0]=pxyz[0]; // L2_xyz[0][1]=fxyz[2][1]; L2_xyz[1][1]=pxyz[1]; // L2_xyz[0][2]=fxyz[2][2]; L2_xyz[1][2]=pxyz[2]; - // fromMeshTools::MT_intLineLine2(L1_xyz,L2_xyz,&i,intXYZ); + // fromMeshTools::MT_intLineLine2(L1_xyz,L2_xyz,&i,intXYZ); //TODO: This logic is used for double split collapse break; } case 7: { @@ -379,9 +379,6 @@ bool Snapper::trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP) // two large dihedral angles -> key problem: two mesh edges if (bit==3 || bit==5 || bit==6) { - // if (++reachedSwap == 1) { - // flagAndPrint(a, ents[2], 2, "FPP_SwapFace"); - // } // check edge swapping for (int i=0; i<2; i++) if (edgeSwap->run(ents[i])) //TODO: Select best @@ -636,7 +633,7 @@ bool Snapper::run() if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); if (!success) success = trySwapOrSplit(adapter, FPP); - if (!success && ++numFailed == 1) printFPP(adapter, FPP); + // if (!success && ++numFailed == 1) printFPP(adapter, FPP); if (FPP) delete FPP; return success; From 5f2bce85247f72a96183f3dca7f26cb2c67d4ab0 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 23 May 2025 16:34:53 -0400 Subject: [PATCH 058/319] simplify trySwapOrSplt --- ma/maSnapper.cc | 33 +++++++++++++++++---------------- ma/maSnapper.h | 5 +++-- 2 files changed, 20 insertions(+), 18 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index fb030e913..b73fe8263 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -21,7 +21,8 @@ namespace ma { Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a) { - adapter = a; + adapt = a; + mesh = a->mesh; snapTag = st; collapse.Init(a); edgeSwap = makeEdgeSwap(a); @@ -54,11 +55,11 @@ bool Snapper::requestLocality(apf::CavityOp* o) edges have both vertices local. This is basically two layers of elements around the vertex */ apf::Up edges; - adapter->mesh->getUp(vert,edges); + mesh->getUp(vert,edges); apf::Up ovs; ovs.n = edges.n; for (int i = 0; i < edges.n; ++i) - ovs.e[i] = apf::getEdgeVertOppositeVert(adapter->mesh, edges.e[i], vert); + ovs.e[i] = apf::getEdgeVertOppositeVert(mesh, edges.e[i], vert); return o->requestLocality(&ovs.e[0], ovs.n); } @@ -362,12 +363,12 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double return bit; } -bool Snapper::trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP) +bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) { if (FPP->commEdges.n < 2) return false; Entity* ents[4]; double area[4]; - int bit = getTetStats(a, FPP, ents, area); + int bit = getTetStats(adapt, FPP, ents, area); double min=area[0]; for(int i=1; i<4; i++) @@ -394,7 +395,7 @@ bool Snapper::trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP) // check edge swaps Entity* edges[3]; - a->mesh->getDownward(ents[0], 1, edges); + mesh->getDownward(ents[0], 1, edges); for (int i=0; i<3; i++) { if (edgeSwap->run(edges[i])) //TODO: Select best return true; @@ -610,7 +611,7 @@ static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& i bool Snapper::trySimpleSnap() { apf::Up invalid; - return tryReposition(adapter, vert, snapTag, invalid); + return tryReposition(adapt, vert, snapTag, invalid); } static int numFailed = 0; //TODO: REMOVE @@ -618,22 +619,22 @@ static int numFailed = 0; //TODO: REMOVE bool Snapper::run() { apf::Up invalid; - bool success = tryReposition(adapter, vert, snapTag, invalid); + bool success = tryReposition(adapt, vert, snapTag, invalid); if (success) { - adapter->mesh->removeTag(vert,snapTag); - clearFlag(adapter, vert, SNAP); + mesh->removeTag(vert,snapTag); + clearFlag(adapt, vert, SNAP); return true; } - FirstProblemPlane* FPP = getFPP(adapter, vert, snapTag, invalid); + FirstProblemPlane* FPP = getFPP(adapt, vert, snapTag, invalid); - if (!success) success = tryCollapseToVertex(adapter, collapse, FPP); - // if (!success) success = tryReduceCommonEdges(adapter, collapse, FPP); - if (!success) success = tryCollapseTetEdges(adapter, collapse, FPP); - if (!success) success = trySwapOrSplit(adapter, FPP); + if (!success) success = tryCollapseToVertex(adapt, collapse, FPP); + // if (!success) success = tryReduceCommonEdges(adapt, collapse, FPP); + if (!success) success = tryCollapseTetEdges(adapt, collapse, FPP); + if (!success) success = trySwapOrSplit(FPP); - // if (!success && ++numFailed == 1) printFPP(adapter, FPP); + // if (!success && ++numFailed == 1) printFPP(adapt, FPP); if (FPP) delete FPP; return success; diff --git a/ma/maSnapper.h b/ma/maSnapper.h index f660c84aa..0ae860bb6 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -39,7 +39,8 @@ class Snapper bool dug; bool moved; private: - Adapt* adapter; + Adapt* adapt; + Mesh* mesh; Tag* snapTag; Entity* vert; Collapse collapse; @@ -47,7 +48,7 @@ class Snapper EdgeSwap* edgeSwap; bool isSimple; - bool trySwapOrSplit(Adapt* a, FirstProblemPlane* FPP); + bool trySwapOrSplit(FirstProblemPlane* FPP); }; struct Ray{ From 0d588dfbc23306b5af57aef18ba28654723fd694 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 23 May 2025 16:46:52 -0400 Subject: [PATCH 059/319] moved snap operations to snap class --- ma/maSnapper.cc | 58 ++++++++++++++++++++++++------------------------- ma/maSnapper.h | 3 +++ 2 files changed, 32 insertions(+), 29 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b73fe8263..f3c2dd559 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -478,96 +478,96 @@ static bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) return true; //same side of face } -static bool tryCollapseTetEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) { apf::Up& commEdges = FPP->commEdges; BestCollapse best; for (int i=0; imesh->getDownward(commEdges.e[i], 0, vertex); + mesh->getDownward(commEdges.e[i], 0, vertex); for (int j=0; j<2; j++) - getBestQualityCollapse(a, commEdges.e[i], vertex[j], collapse, best); + getBestQualityCollapse(adapt, commEdges.e[i], vertex[j], collapse, best); } for (int i=0; imesh, edge, FPP->vert); + Entity* vertexFPP = getEdgeVertOppositeVert(mesh, edge, vert); apf::Up adjEdges; - a->mesh->getUp(vertexFPP, adjEdges); + mesh->getUp(vertexFPP, adjEdges); for (int j=0; jmesh, FPP->problemFace, edgeDel)) continue; - Entity* vertKeep = getEdgeVertOppositeVert(a->mesh, edgeDel, vertexFPP); - if (sameSide(a, vertKeep, FPP->vert, FPP->problemFace)) continue; - getBestQualityCollapse(a, edgeDel, vertKeep, collapse, best); + if (isLowInHigh(mesh, FPP->problemFace, edgeDel)) continue; + Entity* vertKeep = getEdgeVertOppositeVert(mesh, edgeDel, vertexFPP); + if (sameSide(adapt, vertKeep, vert, FPP->problemFace)) continue; + getBestQualityCollapse(adapt, edgeDel, vertKeep, collapse, best); } } if (best.quality > 0) - return tryCollapseEdge(a, best.edge, best.keep, collapse); + return tryCollapseEdge(adapt, best.edge, best.keep, collapse); else return false; } -static bool tryReduceCommonEdges(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +bool Snapper::tryReduceCommonEdges(FirstProblemPlane* FPP) { apf::Up& commEdges = FPP->commEdges; BestCollapse best; Entity* pbEdges[3]; - a->mesh->getDownward(FPP->problemFace, 1, pbEdges); + mesh->getDownward(FPP->problemFace, 1, pbEdges); switch(commEdges.n) { case 2: { - Entity* v1 = getEdgeVertOppositeVert(a->mesh, commEdges.e[0], FPP->vert); - Entity* v2 = getEdgeVertOppositeVert(a->mesh, commEdges.e[1], FPP->vert); + Entity* v1 = getEdgeVertOppositeVert(mesh, commEdges.e[0], vert); + Entity* v2 = getEdgeVertOppositeVert(mesh, commEdges.e[1], vert); for (int i=0; i<3; i++) { Entity* pbVert[2]; - a->mesh->getDownward(pbEdges[i], 0, pbVert); + mesh->getDownward(pbEdges[i], 0, pbVert); if (pbVert[0] == v1 && pbVert[1] == v2) break; if (pbVert[1] == v1 && pbVert[0] == v2) break; for (int j=0; j<2; j++) - getBestQualityCollapse(a, pbEdges[i], pbVert[j], collapse, best); + getBestQualityCollapse(adapt, pbEdges[i], pbVert[j], collapse, best); } break; } case 3: { for (int i=0; i<3; i++) { Entity* pbVert[2]; - a->mesh->getDownward(pbEdges[i], 0, pbVert); + mesh->getDownward(pbEdges[i], 0, pbVert); for (int j=0; j<2; j++) - getBestQualityCollapse(a, pbEdges[i], pbVert[j], collapse, best); + getBestQualityCollapse(adapt, pbEdges[i], pbVert[j], collapse, best); } break; } } if (best.quality > 0) - return tryCollapseEdge(a, best.edge, best.keep, collapse); + return tryCollapseEdge(adapt, best.edge, best.keep, collapse); else return false; } -static bool tryCollapseToVertex(Adapt* a, Collapse& collapse, FirstProblemPlane* FPP) +bool Snapper::tryCollapseToVertex(FirstProblemPlane* FPP) { - Vector position = getPosition(a->mesh, FPP->vert); + Vector position = getPosition(mesh, vert); Vector target; - a->mesh->getDoubleTag(FPP->vert, FPP->snapTag, &target[0]); + mesh->getDoubleTag(vert, snapTag, &target[0]); double distTarget = (position - target).getLength(); BestCollapse best; for (size_t i = 0; i < FPP->commEdges.n; ++i) { Entity* edge = FPP->commEdges.e[i]; - Entity* vertexOnFPP = getEdgeVertOppositeVert(a->mesh, edge, FPP->vert); - Vector vFPPCoord = getPosition(a->mesh, vertexOnFPP); + Entity* vertexOnFPP = getEdgeVertOppositeVert(mesh, edge, vert); + Vector vFPPCoord = getPosition(mesh, vertexOnFPP); //TODO: add logic for boundary layers double distToFPPVert = (vFPPCoord - target).getLength(); if (distToFPPVert > distTarget) continue; - getBestQualityCollapse(a, edge, FPP->vert, collapse, best); + getBestQualityCollapse(adapt, edge, vert, collapse, best); } if (best.quality > 0) - return tryCollapseEdge(a, best.edge, best.keep, collapse); + return tryCollapseEdge(adapt, best.edge, best.keep, collapse); else return false; } @@ -629,9 +629,9 @@ bool Snapper::run() FirstProblemPlane* FPP = getFPP(adapt, vert, snapTag, invalid); - if (!success) success = tryCollapseToVertex(adapt, collapse, FPP); - // if (!success) success = tryReduceCommonEdges(adapt, collapse, FPP); - if (!success) success = tryCollapseTetEdges(adapt, collapse, FPP); + if (!success) success = tryCollapseToVertex(FPP); + // if (!success) success = tryReduceCommonEdges(FPP); + if (!success) success = tryCollapseTetEdges(FPP); if (!success) success = trySwapOrSplit(FPP); // if (!success && ++numFailed == 1) printFPP(adapt, FPP); diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 0ae860bb6..e2897f8af 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -48,6 +48,9 @@ class Snapper EdgeSwap* edgeSwap; bool isSimple; + bool tryCollapseToVertex(FirstProblemPlane* FPP); + bool tryCollapseTetEdges(FirstProblemPlane* FPP); + bool tryReduceCommonEdges(FirstProblemPlane* FPP); bool trySwapOrSplit(FirstProblemPlane* FPP); }; From 0843609691ee1c05037a8abbb14c4263c1bec2ae Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 24 May 2025 14:53:47 -0400 Subject: [PATCH 060/319] remove unused --- ma/maSnap.cc | 2 +- ma/maSnapper.cc | 2 -- ma/maSnapper.h | 3 --- 3 files changed, 1 insertion(+), 6 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 4dc5a0cd7..8c5114c81 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -770,7 +770,7 @@ class SnapAll : public Operator void apply() { bool snapped = snapper.run(); - didAnything = didAnything || snapped || snapper.dug; + didAnything = didAnything || snapped; if (snapped) ++successCount; clearFlag(adapter, vert, SNAP); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index f3c2dd559..481a9c3d9 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -26,8 +26,6 @@ Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a) snapTag = st; collapse.Init(a); edgeSwap = makeEdgeSwap(a); - isSimple = is; - dug = false; vert = 0; } diff --git a/ma/maSnapper.h b/ma/maSnapper.h index e2897f8af..f67861f4c 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -36,8 +36,6 @@ class Snapper bool requestLocality(apf::CavityOp* o); bool trySimpleSnap(); bool run(); - bool dug; - bool moved; private: Adapt* adapt; Mesh* mesh; @@ -46,7 +44,6 @@ class Snapper Collapse collapse; SingleSplitCollapse splitCollapse; EdgeSwap* edgeSwap; - bool isSimple; bool tryCollapseToVertex(FirstProblemPlane* FPP); bool tryCollapseTetEdges(FirstProblemPlane* FPP); From be2c1e60721c1c99975d0cd8a8e008465826462b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 24 May 2025 17:54:31 -0400 Subject: [PATCH 061/319] print values --- ma/maSnap.cc | 18 +++++++----------- ma/maSnapper.cc | 30 +++++++++++++++++++++--------- ma/maSnapper.h | 7 +++++++ 3 files changed, 35 insertions(+), 20 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 8c5114c81..2aecdfad6 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -912,28 +912,22 @@ long snapTaggedVerts(Adapt* a, Tag* tag) return successCount; } -void trySnapping(Adapt* a, Tag* snapTag) +void trySnapping(Adapt* a, Snapper& snapper) { - Snapper snapper(a, snapTag, false); Refine* refine = a->refine; - print(a->mesh->getPCU(), "Number of vertices be snapped %d\n", refine->vtxToSnap.size()); bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; - int numFailed = 0; while (refine->vtxToSnap.size() > 0) { Entity* vertex = refine->vtxToSnap.front(); refine->vtxToSnap.pop(); snapper.setVert(vertex); - if (!snapper.run()) - numFailed++; - else if (getFlag(a, vertex, SNAP)) + if (snapper.run() && getFlag(a, vertex, SNAP)) refine->vtxToSnap.push(vertex); } a->input->shouldForceAdaptation = shouldForce; - print(a->mesh->getPCU(), "Number of vertices failed %d\n", numFailed); } void snap(Adapt* a) @@ -943,13 +937,14 @@ void snap(Adapt* a) double t0 = pcu::Time(); Tag* snapTag; // preventMatchedCavityMods(a); - tagVertsToSnap(a, snapTag); + int toSnap = tagVertsToSnap(a, snapTag); // ma_dbg::addTargetLocation(a, "snap_target"); // ma_dbg::addClassification(a, "classification"); // apf::writeVtkFiles("before_last_snap", a->mesh); - trySnapping(a, snapTag); + Snapper snapper(a, snapTag, false); + trySnapping(a, snapper); // snapLayer(a, tag); // apf::writeVtkFiles("after_last_snap", a->mesh); @@ -960,7 +955,8 @@ void snap(Adapt* a) a->refine->vtxToSnap = {}; double t1 = pcu::Time(); - print(a->mesh->getPCU(), "snapped in %f seconds\n", t1 - t0); + print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds\n", + toSnap, snapper.numSnapped, snapper.numFailed, snapper.numCollapseToVtx, snapper.numCollapse, snapper.numSwap, snapper.numSplitCollapse, t1 - t0); // if (a->hasLayer) // checkLayerShape(a->mesh, "after snapping"); } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 481a9c3d9..7e2b19c7d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -380,13 +380,17 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) if (bit==3 || bit==5 || bit==6) { // check edge swapping for (int i=0; i<2; i++) - if (edgeSwap->run(ents[i])) //TODO: Select best + if (edgeSwap->run(ents[i])) { //TODO: Select best + numSwap++; return true; + } // check split+collapse for (int i=0; i<2; i++) - if (splitCollapse.run(ents[i], FPP->vert)) //TODO: Select best + if (splitCollapse.run(ents[i], FPP->vert)) { //TODO: Select best + numSplitCollapse++; return true; + } } // three large dihedral angles -> key entity: a mesh face else { @@ -395,14 +399,18 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); for (int i=0; i<3; i++) { - if (edgeSwap->run(edges[i])) //TODO: Select best + if (edgeSwap->run(edges[i])) { //TODO: Select best + numSwap++; return true; + } } //TODO: IMPLEMENT FACE SWAP - if (splitCollapse.run(ents[1], FPP->vert)); + if (splitCollapse.run(ents[1], FPP->vert)) { + numSplitCollapse++; return true; + } //TODO: USE DOUBLE SPLIT COLLAPSE } @@ -503,8 +511,10 @@ bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) } } - if (best.quality > 0) + if (best.quality > 0) { + numCollapse++; return tryCollapseEdge(adapt, best.edge, best.keep, collapse); + } else return false; } @@ -564,8 +574,10 @@ bool Snapper::tryCollapseToVertex(FirstProblemPlane* FPP) getBestQualityCollapse(adapt, edge, vert, collapse, best); } - if (best.quality > 0) + if (best.quality > 0) { + numCollapseToVtx++; return tryCollapseEdge(adapt, best.edge, best.keep, collapse); + } else return false; } @@ -612,14 +624,13 @@ bool Snapper::trySimpleSnap() return tryReposition(adapt, vert, snapTag, invalid); } -static int numFailed = 0; //TODO: REMOVE - bool Snapper::run() { apf::Up invalid; bool success = tryReposition(adapt, vert, snapTag, invalid); if (success) { + numSnapped++; mesh->removeTag(vert,snapTag); clearFlag(adapt, vert, SNAP); return true; @@ -632,7 +643,8 @@ bool Snapper::run() if (!success) success = tryCollapseTetEdges(FPP); if (!success) success = trySwapOrSplit(FPP); - // if (!success && ++numFailed == 1) printFPP(adapt, FPP); + if (!success) numFailed++; + // if (!success && numFailed == 1) printFPP(adapt, FPP); if (FPP) delete FPP; return success; diff --git a/ma/maSnapper.h b/ma/maSnapper.h index f67861f4c..469a2abcc 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -29,6 +29,13 @@ class FirstProblemPlane; class Snapper { public: + int numFailed = 0; + int numSnapped = 0; + int numCollapseToVtx = 0; + int numCollapse = 0; + int numSwap = 0; + int numSplitCollapse = 0; + Snapper(Adapt* a, Tag* st, bool is); ~Snapper(); void setVert(Entity* v); From fd8ba386ef5b56d34036841b95aa5eb186c2bb19 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sun, 25 May 2025 12:26:20 -0400 Subject: [PATCH 062/319] fixed collapse bug --- ma/maCollapse.cc | 53 ++++++++---------------------------------------- ma/maCollapse.h | 2 -- ma/maSnap.cc | 4 ---- ma/maSnapper.cc | 22 +++++++++++--------- 4 files changed, 21 insertions(+), 60 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 246600750..d12b4613d 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -77,30 +77,10 @@ bool Collapse::edgesGoodSize() { } } // printf("maxSize %f Ratio %f\n", maxSize, ratioAtMaxSize); - if (maxSize > 1.52 && ratioAtMaxSize > 1.2 ) return false; + if (maxSize > 1.5 && ratioAtMaxSize > 1.2 ) return false; return true; } -double Collapse::getQualityThisDirection() { - PCU_ALWAYS_ASSERT( ! adapt->mesh->isShared(vertToCollapse)); - rebuildElements(); - // check quality of linear t before fitting - if ((adapt->mesh->getDimension()==2) - &&( ! isGood2DMesh())) - return -1; - // check the linear quality of tets before fitting - // reject if one is negative - if(adapt->mesh->getDimension()==3 && cavity.shouldFit - && !areTetsValid(adapt->mesh,newElements)) - return -1; - // make sure we aren't undoing refinement - if(!edgesGoodSize()) - return -1; - // since they are okay in a linear sense, now fit and do a quality assessment - fitElements(); - return getWorstQuality(adapt, newElements); -} - bool Collapse::tryThisDirection(double qualityToBeat) { if (!tryThisDirectionNoCancel(qualityToBeat)) { @@ -123,34 +103,19 @@ bool Collapse::tryBothDirections(double qualityToBeat) if (tryThisDirectionNoCancel(qualityToBeat)) return true; - else - destroyNewElements(); - - if ( ! getFlag(adapt,vertToKeep,COLLAPSE)) - return false; - std::swap(vertToKeep,vertToCollapse); - computeElementSets(); - if (!adapt->input->shouldForceAdaptation) - qualityToBeat = std::min(adapt->input->goodQuality, - std::max(getOldQuality(),adapt->input->validQuality)); - - return tryThisDirection(qualityToBeat); -} - -double Collapse::getQualityFromCollapse() { - computeElementSets(); - double q = getQualityThisDirection(); + destroyNewElements(); - if (q == -1) { - if (!getFlag(adapt,vertToKeep,COLLAPSE)) - return false; + + if (getFlag(adapt,vertToKeep,COLLAPSE)) { std::swap(vertToKeep,vertToCollapse); computeElementSets(); - q = std::max(q, getQualityThisDirection()); - destroyNewElements(); + if (tryThisDirectionNoCancel(qualityToBeat)) + return true; } + + destroyNewElements(); unmark(); - return q; + return false; } bool Collapse::setEdge(Entity* e) diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 2500e9b6f..d9a449adf 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,8 +42,6 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); - double getQualityThisDirection(); - double getQualityFromCollapse(); double getOldQuality(); Adapt* adapt; Entity* edge; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 2aecdfad6..d8033b1ac 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -941,15 +941,11 @@ void snap(Adapt* a) // ma_dbg::addTargetLocation(a, "snap_target"); // ma_dbg::addClassification(a, "classification"); - // apf::writeVtkFiles("before_last_snap", a->mesh); Snapper snapper(a, snapTag, false); trySnapping(a, snapper); // snapLayer(a, tag); - // apf::writeVtkFiles("after_last_snap", a->mesh); - - // clearFlagFromDimension(a, COLLAPSE, 1); //TODO: Figure out what is making this neccessary clearFlagFromDimension(a, SNAP, 0); //TODO: should not be neccessary a->mesh->destroyTag(snapTag); a->refine->vtxToSnap = {}; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 7e2b19c7d..b1e35f810 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -372,7 +372,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) for(int i=1; i<4; i++) if( area[i] best.quality) { - best.quality = quality; - best.edge = edge; - best.keep = keep; - } + if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo()) { + collapse.computeElementSets(); + if (collapse.tryThisDirectionNoCancel(0) && collapse.edgesGoodSize()) { + double quality = getWorstQuality(a, collapse.newElements); + if (quality > best.quality) { + best.quality = quality; + best.edge = edge; + best.keep = keep; + } + } + collapse.cancel(); } if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); } From c2b3a30758d09fd0b43d0568f8692677217e53aa Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sun, 25 May 2025 13:25:58 -0400 Subject: [PATCH 063/319] max length --- ma/ma.cc | 2 +- ma/maCollapse.cc | 8 +++----- ma/maSize.cc | 4 ++-- ma/maSize.h | 2 ++ ma/maSnap.cc | 12 ++++++------ 5 files changed, 14 insertions(+), 14 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 24c5100ce..b1aa8c3f9 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -100,7 +100,7 @@ void adaptVerbose(Input* in, bool verbose) int count = 0; double lMax = ma::getMaximumEdgeLength(a->mesh, a->sizeField); print(a->mesh->getPCU(), "Maximum (metric) edge length in the mesh is %f", lMax); - while (lMax > 1.5) { + while (lMax > MAXLENGTH) { print(a->mesh->getPCU(), "%dth additional refine-snap call", count); refine(a); snap(a); diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index d12b4613d..2eb9e3fcf 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -76,8 +76,7 @@ bool Collapse::edgesGoodSize() { } } } - // printf("maxSize %f Ratio %f\n", maxSize, ratioAtMaxSize); - if (maxSize > 1.5 && ratioAtMaxSize > 1.2 ) return false; + if (maxSize > MAXLENGTH && ratioAtMaxSize > 1.2 ) return false; return true; } @@ -103,17 +102,16 @@ bool Collapse::tryBothDirections(double qualityToBeat) if (tryThisDirectionNoCancel(qualityToBeat)) return true; - - destroyNewElements(); + else destroyNewElements(); if (getFlag(adapt,vertToKeep,COLLAPSE)) { std::swap(vertToKeep,vertToCollapse); computeElementSets(); if (tryThisDirectionNoCancel(qualityToBeat)) return true; + else destroyNewElements(); } - destroyNewElements(); unmark(); return false; } diff --git a/ma/maSize.cc b/ma/maSize.cc index 7f097d2eb..e596d0788 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -216,11 +216,11 @@ struct MetricSizeField : public SizeField } bool shouldSplit(Entity* edge) { - return this->measure(edge) > 1.5; + return this->measure(edge) > MAXLENGTH; } bool shouldCollapse(Entity* edge) { - return this->measure(edge) < 0.5; + return this->measure(edge) < MINLENGTH; } double getWeight(Entity* e) { diff --git a/ma/maSize.h b/ma/maSize.h index dd88dc643..da3c8b9a2 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -19,6 +19,8 @@ namespace ma { typedef apf::Matrix3x3 Matrix; +const double MAXLENGTH = 1.5; +const double MINLENGTH = 0.5; class SizeField { diff --git a/ma/maSnap.cc b/ma/maSnap.cc index d8033b1ac..9d72d6e37 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -914,17 +914,17 @@ long snapTaggedVerts(Adapt* a, Tag* tag) void trySnapping(Adapt* a, Snapper& snapper) { - Refine* refine = a->refine; + std::queue* vtxToSnap = &a->refine->vtxToSnap; bool shouldForce = a->input->shouldForceAdaptation; - a->input->shouldForceAdaptation = true; + a->input->shouldForceAdaptation = true; //Allows quality to decrease from snapping - while (refine->vtxToSnap.size() > 0) + while (vtxToSnap->size() > 0) { - Entity* vertex = refine->vtxToSnap.front(); - refine->vtxToSnap.pop(); + Entity* vertex = vtxToSnap->front(); + vtxToSnap->pop(); snapper.setVert(vertex); if (snapper.run() && getFlag(a, vertex, SNAP)) - refine->vtxToSnap.push(vertex); + vtxToSnap->push(vertex); } a->input->shouldForceAdaptation = shouldForce; From c283fe4a9ac6ea55e190c6205a8274514d4a5664 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sun, 25 May 2025 15:47:45 -0400 Subject: [PATCH 064/319] simplify code --- ma/maCollapse.cc | 1 - ma/maSnap.cc | 9 +++------ ma/maSnapper.cc | 6 +++++- 3 files changed, 8 insertions(+), 8 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 2eb9e3fcf..05ee1b873 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -89,7 +89,6 @@ bool Collapse::tryThisDirection(double qualityToBeat) return true; } -//TODO: Test this change bool Collapse::tryBothDirections(double qualityToBeat) { computeElementSets(); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 9d72d6e37..ccd1262a5 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -848,7 +848,6 @@ long tagVertsToSnap(Adapt* a, Tag*& tag) Mesh* m = a->mesh; Refine* refine = a->refine; int dim = m->getDimension(); - tag = m->createDoubleTag("ma_snap", 3); int notProcessed = refine->vtxToSnap.size(); int owned = 0; while (notProcessed > 0) @@ -928,6 +927,7 @@ void trySnapping(Adapt* a, Snapper& snapper) } a->input->shouldForceAdaptation = shouldForce; + a->refine->vtxToSnap = {}; } void snap(Adapt* a) @@ -935,7 +935,7 @@ void snap(Adapt* a) if (!a->input->shouldSnap) return; double t0 = pcu::Time(); - Tag* snapTag; + Tag* snapTag = a->mesh->createDoubleTag("ma_snap", 3); // preventMatchedCavityMods(a); int toSnap = tagVertsToSnap(a, snapTag); @@ -946,15 +946,12 @@ void snap(Adapt* a) trySnapping(a, snapper); // snapLayer(a, tag); - clearFlagFromDimension(a, SNAP, 0); //TODO: should not be neccessary - a->mesh->destroyTag(snapTag); - a->refine->vtxToSnap = {}; - double t1 = pcu::Time(); print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds\n", toSnap, snapper.numSnapped, snapper.numFailed, snapper.numCollapseToVtx, snapper.numCollapse, snapper.numSwap, snapper.numSplitCollapse, t1 - t0); // if (a->hasLayer) // checkLayerShape(a->mesh, "after snapping"); + a->mesh->destroyTag(snapTag); } void prevSnap(Adapt* a) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b1e35f810..e5e583070 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -645,7 +645,11 @@ bool Snapper::run() if (!success) success = tryCollapseTetEdges(FPP); if (!success) success = trySwapOrSplit(FPP); - if (!success) numFailed++; + if (!success) { + numFailed++; + mesh->removeTag(vert,snapTag); + clearFlag(adapt, vert, SNAP); + } // if (!success && numFailed == 1) printFPP(adapt, FPP); if (FPP) delete FPP; From 4cd294538e6056d2c3675585ca9d0c0c43e303e9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 29 May 2025 20:50:24 -0400 Subject: [PATCH 065/319] fixed split collapse bug --- ma/maCoarsen.cc | 63 ------------------------------------- ma/maSingleSplitCollapse.cc | 4 +-- ma/maSingleSplitCollapse.h | 2 +- ma/maSnapper.cc | 23 +++++++++----- ma/maSnapper.h | 2 ++ test/coarsen.cc | 2 +- 6 files changed, 22 insertions(+), 74 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 96872af5d..0014b1f90 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -254,69 +254,6 @@ bool coarsen(Adapt* a) return true; } -void printFields(Adapt* a, Mesh* m, std::string name) -{ - apf::Field* f = m->findField("collapse_edges"); - if (!f) - f = apf::createField(m, "collapse_edges", apf::SCALAR, apf::getConstant(1)); - apf::MeshIterator* it = m->begin(1); - apf::MeshEntity* e; - while ((e = m->iterate(it))) { - if (getFlag(a, e, COLLAPSE)) - apf::setScalar(f, e, 0, 1); - else - apf::setScalar(f, e, 0, 0); - } - m->end(it); - - f = m->findField("collapse_verts"); - if (!f) - f = apf::createFieldOn(m, "collapse_verts", apf::SCALAR); - it = m->begin(0); - while ((e = m->iterate(it))) { - if (getFlag(a, e, COLLAPSE)) - apf::setScalar(f, e, 0, 1); - else - apf::setScalar(f, e, 0, 0); - } - m->end(it); - - apf::writeVtkFiles(name.c_str(), m, 1); -} - -bool coarsenAndPrint(Adapt* a) -{ - if (!a->input->shouldCoarsen) - return false; - double t0 = pcu::Time(); - --(a->coarsensLeft); - long count = markEdgesToCollapse(a); - if ( ! count) - return false; - Mesh* m = a->mesh; - int maxDimension = m->getDimension(); - PCU_ALWAYS_ASSERT(checkFlagConsistency(a,1,COLLAPSE)); - long successCount = 0; - printFields(a, m, "flag_edges"); - - for (int modelDimension=1; modelDimension <= maxDimension; ++modelDimension) - { - checkAllEdgeCollapses(a,modelDimension); - std::string dim = std::to_string(modelDimension); - printFields(a, m, "flag_verts"+dim); - findIndependentSet(a); - printFields(a, m, "independent_set"+dim); - if (m->hasMatching()) - successCount += collapseMatchedEdges(a, modelDimension); - else - successCount += collapseAllEdges(a, modelDimension); - apf::writeVtkFiles(("after_collapse"+dim).c_str(), m, 1); - } - successCount = m->getPCU()->Add(successCount); - double t1 = pcu::Time(); - print(m->getPCU(), "coarsened %li edges in %f seconds", successCount,t1-t0); - return true; -} } diff --git a/ma/maSingleSplitCollapse.cc b/ma/maSingleSplitCollapse.cc index 824816d42..afc83e1cd 100644 --- a/ma/maSingleSplitCollapse.cc +++ b/ma/maSingleSplitCollapse.cc @@ -59,7 +59,7 @@ void SingleSplitCollapse::accept() collapse.destroyOldElements(); } -bool SingleSplitCollapse::run(Entity* edge, Entity* vert) +bool SingleSplitCollapse::run(Entity* edge, Entity* vert, double quality) { oldEdge = edge; oldVert = vert; @@ -67,7 +67,7 @@ bool SingleSplitCollapse::run(Entity* edge, Entity* vert) Mesh* m = a->mesh; if ( ! splits.setEdges(&edge,1)) return false; - oldQuality = getWorstQuality(a,splits.getTets()); + oldQuality = (quality == -1) ? getWorstQuality(a,splits.getTets()) : 0; splits.makeNewElements(); splits.transfer(); Entity* collVerts[2]; diff --git a/ma/maSingleSplitCollapse.h b/ma/maSingleSplitCollapse.h index a0dd30620..712e412ed 100644 --- a/ma/maSingleSplitCollapse.h +++ b/ma/maSingleSplitCollapse.h @@ -32,7 +32,7 @@ class SingleSplitCollapse bool tryThisCollapse(); bool tryBothCollapses(Entity* e); void accept(); - bool run(Entity* edge, Entity* vert); + bool run(Entity* edge, Entity* vert, double quality=-1); Adapt* getAdapt(); private: Entity *oldVert, *oldEdge; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index e5e583070..3c3a50d1d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -19,7 +19,7 @@ namespace ma { -Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a) +Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a), doubleSplitCollapse(a) { adapt = a; mesh = a->mesh; @@ -363,7 +363,10 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) { - if (FPP->commEdges.n < 2) return false; + if (FPP->commEdges.n < 2) { + print(mesh->getPCU(), "Swap failed: consider more collapses before swap"); + return false; + } Entity* ents[4]; double area[4]; int bit = getTetStats(adapt, FPP, ents, area); @@ -373,7 +376,8 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) if( area[i]getPCU(), "Swap failed: small base area case not implemented"); + return false; } // two large dihedral angles -> key problem: two mesh edges @@ -407,15 +411,18 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) //TODO: IMPLEMENT FACE SWAP - if (splitCollapse.run(ents[1], FPP->vert)) { + if (splitCollapse.run(ents[1], FPP->vert, 0)) { numSplitCollapse++; return true; } - //TODO: USE DOUBLE SPLIT COLLAPSE + // if (doubleSplitCollapse.run(ents)) { //TODO: TEST DOUBLE SPLIT COLLAPSE + // numSplitCollapse++; + // return true; + // } } - + print(mesh->getPCU(), "Swap failed: face swap and double split collapse not implemented"); return false; } @@ -552,8 +559,10 @@ bool Snapper::tryReduceCommonEdges(FirstProblemPlane* FPP) break; } } - if (best.quality > 0) + if (best.quality > 0) { + numCollapse++; return tryCollapseEdge(adapt, best.edge, best.keep, collapse); + } else return false; } diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 469a2abcc..3d6c0d6b3 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -12,6 +12,7 @@ #include "maCollapse.h" #include "maSingleSplitCollapse.h" +#include "maDoubleSplitCollapse.h" #include "maEdgeSwap.h" namespace apf { @@ -50,6 +51,7 @@ class Snapper Entity* vert; Collapse collapse; SingleSplitCollapse splitCollapse; + DoubleSplitCollapse doubleSplitCollapse; EdgeSwap* edgeSwap; bool tryCollapseToVertex(FirstProblemPlane* FPP); diff --git a/test/coarsen.cc b/test/coarsen.cc index 6f6da4294..be359f83a 100644 --- a/test/coarsen.cc +++ b/test/coarsen.cc @@ -90,7 +90,7 @@ int main(int argc, char** argv) in->shouldCoarsen = true; validateInput(in); ma::Adapt* a = new ma::Adapt(in); - coarsenAndPrint(a); + coarsen(a); m->verify(); apf::writeVtkFiles("after_coarsen", m, 1); From c524541e0947b46420e63cc4bd78d6f02c7ba0e0 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 29 May 2025 23:07:57 -0400 Subject: [PATCH 066/319] fixed split collapse bug --- ma/maCoarsen.cc | 108 ++++++++++++++++++++++++++++++++++++ ma/maDoubleSplitCollapse.cc | 4 +- ma/maDoubleSplitCollapse.h | 2 +- ma/maSingleSplitCollapse.cc | 2 +- ma/maSnapper.cc | 4 +- 5 files changed, 114 insertions(+), 6 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 0014b1f90..0a0cd4e87 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -14,6 +14,7 @@ #include "maOperator.h" #include #include "apfShape.h" +#include namespace ma { @@ -255,5 +256,112 @@ bool coarsen(Adapt* a) } +static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + + bool result = false; + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(0)) { + result = true; + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + return result; +} + + +Entity* getAdjacentShortestEdge(Adapt* a, Entity* vertex) +{ + apf::Up edges; + a->mesh->getUp(vertex,edges); + double minLength = 999999; + Entity* minEdge; + for (int i=0; i < edges.n; i++) { + double length = a->sizeField->measure(edges.e[i]); + if (length < minLength) { + minLength = length; + minEdge = edges.e[i]; + } + } + return minEdge; +} + +void markAdjacentVerts(Adapt* a, Entity* vertex) +{ + apf::Up edges; + a->mesh->getUp(vertex,edges); + for (int i=0; i < edges.n; i++) { + Entity* opposite = getEdgeVertOppositeVert(a->mesh, edges.e[i], vertex); + setFlag(a, opposite, CHECKED); + } +} + +bool isIndependent(Adapt* a, Entity* vertex) +{ + if (getFlag(a, vertex, CHECKED)) return false; + apf::Up edges; + a->mesh->getUp(vertex,edges); + for (int i=0; i < edges.n; i++) { + Entity* opposite = getEdgeVertOppositeVert(a->mesh, edges.e[i], vertex); + if (getFlag(a, opposite, CHECKED)) return true; + } + return false; +} + + +bool newCoarsen(Adapt* a) +{ + std::queue shortEdgeVerts; + Iterator* it = a->mesh->begin(1); + Entity* edge; + while ((edge = a->mesh->iterate(it))) + { + if (!a->sizeField->shouldCollapse(edge)) continue; + Entity* vertices[2]; + a->mesh->getDownward(edge,0,vertices); + for (int i = 0; i < 2; i++) { + setFlag(a, vertices[i], COLLAPSE); + shortEdgeVerts.push(vertices[i]); + } + } + + Collapse collapse; + collapse.Init(a); + int success = 0; + int failed = 0; + bool independentSetStarted = false; + int proccessed = 0; + while (shortEdgeVerts.size() > 0) + { + Entity* vertex = shortEdgeVerts.front(); + shortEdgeVerts.pop(); + + if (independentSetStarted && !isIndependent(a, vertex)) { + shortEdgeVerts.push(vertex); + if (++processed == shortEdgeVerts.size()) + ma::clearFlagFromDimension(a, CHECKED, 0); + continue; + } + + Entity* shortEdge = getAdjacentShortestEdge(a, vertex); + if (!a->sizeField->shouldCollapse(shortEdge)) continue; + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); + if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { + markAdjacentVerts(a, vertex); + collapse.destroyOldElements(); + independentSetStarted = true; + success++; + } + else failed++; + } + + return true; +} + } diff --git a/ma/maDoubleSplitCollapse.cc b/ma/maDoubleSplitCollapse.cc index d0457e54c..dfd69f9c1 100644 --- a/ma/maDoubleSplitCollapse.cc +++ b/ma/maDoubleSplitCollapse.cc @@ -55,13 +55,13 @@ void DoubleSplitCollapse::accept() collapse.destroyOldElements(); } -bool DoubleSplitCollapse::run(Entity** edges) +bool DoubleSplitCollapse::run(Entity** edges, double quality) { Adapt* a = getAdapt(); Mesh* m = a->mesh; if ( ! splits.setEdges(edges,2)) return false; - oldQuality = getWorstQuality(a,splits.getTets()); + oldQuality = (quality >= 0) ? quality : getWorstQuality(a,splits.getTets()); splits.makeNewElements(); splits.transfer(); Entity* splitVerts[2]; diff --git a/ma/maDoubleSplitCollapse.h b/ma/maDoubleSplitCollapse.h index 52124378b..42c8a9f06 100644 --- a/ma/maDoubleSplitCollapse.h +++ b/ma/maDoubleSplitCollapse.h @@ -24,7 +24,7 @@ class DoubleSplitCollapse bool tryThisCollapse(); bool tryBothCollapses(Entity* e); void accept(); - bool run(Entity** edges); + bool run(Entity** edges, double quality = -1); Adapt* getAdapt(); private: Splits splits; diff --git a/ma/maSingleSplitCollapse.cc b/ma/maSingleSplitCollapse.cc index afc83e1cd..1c326db85 100644 --- a/ma/maSingleSplitCollapse.cc +++ b/ma/maSingleSplitCollapse.cc @@ -67,7 +67,7 @@ bool SingleSplitCollapse::run(Entity* edge, Entity* vert, double quality) Mesh* m = a->mesh; if ( ! splits.setEdges(&edge,1)) return false; - oldQuality = (quality == -1) ? getWorstQuality(a,splits.getTets()) : 0; + oldQuality = (quality >= 0 ) ? quality : getWorstQuality(a,splits.getTets()); splits.makeNewElements(); splits.transfer(); Entity* collVerts[2]; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 3c3a50d1d..e9eb8ced1 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -391,7 +391,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) // check split+collapse for (int i=0; i<2; i++) - if (splitCollapse.run(ents[i], FPP->vert)) { //TODO: Select best + if (splitCollapse.run(ents[i], FPP->vert, 0)) { //TODO: Select best numSplitCollapse++; return true; } @@ -416,7 +416,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) return true; } - // if (doubleSplitCollapse.run(ents)) { //TODO: TEST DOUBLE SPLIT COLLAPSE + // if (doubleSplitCollapse.run(ents, 0)) { //TODO: TEST DOUBLE SPLIT COLLAPSE // numSplitCollapse++; // return true; // } From c472fccd6879eb0ec05250784d0014cab93cdf25 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 30 May 2025 09:00:14 -0400 Subject: [PATCH 067/319] refactor aniso ma test --- test/aniso_ma_test.cc | 35 ----------------------------------- 1 file changed, 35 deletions(-) diff --git a/test/aniso_ma_test.cc b/test/aniso_ma_test.cc index f1d99a360..9fc9d6d19 100644 --- a/test/aniso_ma_test.cc +++ b/test/aniso_ma_test.cc @@ -8,42 +8,11 @@ #include -class AnIso : public ma::AnisotropicFunction -{ - public: - AnIso(ma::Mesh* m) - { - mesh = m; - average = ma::getAverageEdgeLength(m); - ma::getBoundingBox(m,lower,upper); - } - virtual void getValue(ma::Entity* v, ma::Matrix& R, ma::Vector& H) - { - ma::Vector p = ma::getPosition(mesh,v); - double x = (p[0] - lower[0])/(upper[0] - lower[0]); - double sizeFactor = 2.; - if (x < 0.5) - sizeFactor = 3.; - ma::Vector h(average, average/sizeFactor, average/sizeFactor); - ma::Matrix r(1.0, 0.0, 0.0, - 0.0, 1.0, 0.0, - 0.0, 0.0, 1.0); - H = h; - R = r; - } - private: - ma::Mesh* mesh; - double average; - ma::Vector lower; - ma::Vector upper; -}; - int main(int argc, char** argv) { PCU_ALWAYS_ASSERT(argc==4); const char* modelFile = argv[1]; const char* meshFile = argv[2]; - bool logInterpolation = atoi(argv[3]) > 0 ? true : false; pcu::Init(&argc,&argv); { pcu::PCU PCUObj; @@ -54,10 +23,6 @@ int main(int argc, char** argv) apf::writeVtkFiles("aniso_before",m); AnIso sf(m); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf, 0, logInterpolation)); - in->shouldRunPreZoltan = true; - in->shouldRunMidParma = true; - in->shouldRunPostParma = true; - in->shouldRefineLayer = true; in->goodQuality = 0.2; ma::adapt(in); m->verify(); From 1e72aa9791eea598e67d1f466483801527cdf3bc Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 30 May 2025 13:07:14 -0400 Subject: [PATCH 068/319] prepare to test coarsen --- ma/maCoarsen.cc | 6 +++--- test/aniso_adapt.h | 10 +++++----- test/aniso_ma_test.cc | 16 +++------------- 3 files changed, 11 insertions(+), 21 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 0a0cd4e87..66dc0a2f5 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -227,7 +227,7 @@ long markEdgesToCollapse(Adapt* a) DONT_COLLAPSE | NEED_NOT_COLLAPSE); } -bool coarsen(Adapt* a) +bool oldCoarsen(Adapt* a) { if (!a->input->shouldCoarsen) return false; @@ -314,7 +314,7 @@ bool isIndependent(Adapt* a, Entity* vertex) } -bool newCoarsen(Adapt* a) +bool coarsen(Adapt* a) { std::queue shortEdgeVerts; Iterator* it = a->mesh->begin(1); @@ -343,7 +343,7 @@ bool newCoarsen(Adapt* a) if (independentSetStarted && !isIndependent(a, vertex)) { shortEdgeVerts.push(vertex); - if (++processed == shortEdgeVerts.size()) + if (++proccessed == shortEdgeVerts.size()) ma::clearFlagFromDimension(a, CHECKED, 0); continue; } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 8d2bc63e7..9645376e0 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -41,16 +41,16 @@ class AnIso : public ma::AnisotropicFunction void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) { m->verify(); - apf::writeVtkFiles("before_refine_snap",m); + apf::writeVtkFiles("before_adapt",m); AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < in->maximumIterations; ++i) + for (int i = 0; i < 1; ++i) { ma::coarsen(a); - ma::refine(a); - ma::snap(a); + // ma::refine(a); + // ma::snap(a); } m->verify(); - apf::writeVtkFiles("after_refine_snap",m); + apf::writeVtkFiles("after_adapt",m); } \ No newline at end of file diff --git a/test/aniso_ma_test.cc b/test/aniso_ma_test.cc index 9fc9d6d19..fab5aca87 100644 --- a/test/aniso_ma_test.cc +++ b/test/aniso_ma_test.cc @@ -5,12 +5,12 @@ #include #include #include - #include +#include "aniso_adapt.h" int main(int argc, char** argv) { - PCU_ALWAYS_ASSERT(argc==4); + PCU_ALWAYS_ASSERT(argc==3); const char* modelFile = argv[1]; const char* meshFile = argv[2]; pcu::Init(&argc,&argv); @@ -19,17 +19,7 @@ int main(int argc, char** argv) lion_set_verbosity(1); gmi_register_mesh(); ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); - m->verify(); - apf::writeVtkFiles("aniso_before",m); - AnIso sf(m); - ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf, 0, logInterpolation)); - in->goodQuality = 0.2; - ma::adapt(in); - m->verify(); - if (logInterpolation) - apf::writeVtkFiles("aniso_log_interpolation_after",m); - else - apf::writeVtkFiles("aniso_after",m); + refineSnapTest(m, 0.5, 1); m->destroyNative(); apf::destroyMesh(m); } From 1b8991c94c4773059eb504ff28b02e19945d8404 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 30 May 2025 16:39:00 -0400 Subject: [PATCH 069/319] extract adjacent edges --- ma/maCoarsen.cc | 31 +++++++++++++++++-------------- 1 file changed, 17 insertions(+), 14 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 66dc0a2f5..74e89548c 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -12,6 +12,7 @@ #include "maCollapse.h" #include "maMatchedCollapse.h" #include "maOperator.h" +#include "maDBG.h" #include #include "apfShape.h" #include @@ -255,6 +256,11 @@ bool oldCoarsen(Adapt* a) return true; } +void printIndependentSet(Adapt* a) { + apf::writeVtkFiles("independentMesh", a->mesh); + ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "independentVerts", "independentVerts"); + exit(0); +} static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) { @@ -275,10 +281,8 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll } -Entity* getAdjacentShortestEdge(Adapt* a, Entity* vertex) +Entity* getAdjacentShortestEdge(Adapt* a, apf::Up& edges) { - apf::Up edges; - a->mesh->getUp(vertex,edges); double minLength = 999999; Entity* minEdge; for (int i=0; i < edges.n; i++) { @@ -291,13 +295,13 @@ Entity* getAdjacentShortestEdge(Adapt* a, Entity* vertex) return minEdge; } -void markAdjacentVerts(Adapt* a, Entity* vertex) +void markDependent(Adapt* a, apf::Up& edges) { - apf::Up edges; - a->mesh->getUp(vertex,edges); for (int i=0; i < edges.n; i++) { - Entity* opposite = getEdgeVertOppositeVert(a->mesh, edges.e[i], vertex); - setFlag(a, opposite, CHECKED); + Entity* vertices[2]; + a->mesh->getDownward(edges.e[i],0, vertices); + setFlag(a, vertices[0], CHECKED); + setFlag(a, vertices[1], CHECKED); } } @@ -305,7 +309,7 @@ bool isIndependent(Adapt* a, Entity* vertex) { if (getFlag(a, vertex, CHECKED)) return false; apf::Up edges; - a->mesh->getUp(vertex,edges); + a->mesh->getUp(vertex, edges); for (int i=0; i < edges.n; i++) { Entity* opposite = getEdgeVertOppositeVert(a->mesh, edges.e[i], vertex); if (getFlag(a, opposite, CHECKED)) return true; @@ -313,7 +317,6 @@ bool isIndependent(Adapt* a, Entity* vertex) return false; } - bool coarsen(Adapt* a) { std::queue shortEdgeVerts; @@ -333,7 +336,6 @@ bool coarsen(Adapt* a) Collapse collapse; collapse.Init(a); int success = 0; - int failed = 0; bool independentSetStarted = false; int proccessed = 0; while (shortEdgeVerts.size() > 0) @@ -348,16 +350,17 @@ bool coarsen(Adapt* a) continue; } - Entity* shortEdge = getAdjacentShortestEdge(a, vertex); + apf::Up edges; + a->mesh->getUp(vertex, edges); + Entity* shortEdge = getAdjacentShortestEdge(a, edges); if (!a->sizeField->shouldCollapse(shortEdge)) continue; Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { - markAdjacentVerts(a, vertex); + markDependent(a, edges); collapse.destroyOldElements(); independentSetStarted = true; success++; } - else failed++; } return true; From ad8615a435e8124000be091fadb505c37c2f25f4 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 30 May 2025 17:47:15 -0400 Subject: [PATCH 070/319] new coarsen passing --- ma/maCoarsen.cc | 17 +++++++++++++---- 1 file changed, 13 insertions(+), 4 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 74e89548c..d57c1deb6 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -319,6 +319,8 @@ bool isIndependent(Adapt* a, Entity* vertex) bool coarsen(Adapt* a) { + //Assert that there arent any vertices marked CHECKED + ma::clearFlagFromDimension(a, CHECKED, 0); std::queue shortEdgeVerts; Iterator* it = a->mesh->begin(1); Entity* edge; @@ -328,25 +330,32 @@ bool coarsen(Adapt* a) Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { - setFlag(a, vertices[i], COLLAPSE); + if (getFlag(a, vertices[i], CHECKED)) continue; + setFlag(a, vertices[i], CHECKED); shortEdgeVerts.push(vertices[i]); } } + ma::clearFlagFromDimension(a, CHECKED, 0); Collapse collapse; collapse.Init(a); int success = 0; bool independentSetStarted = false; - int proccessed = 0; + int numChecked = 0; while (shortEdgeVerts.size() > 0) { Entity* vertex = shortEdgeVerts.front(); shortEdgeVerts.pop(); + if (getFlag(a, vertex, CHECKED)) ++numChecked; + if (numChecked == shortEdgeVerts.size()) { + numChecked = 0; + independentSetStarted = false; + ma::clearFlagFromDimension(a, CHECKED, 0); //TODO: maybe only has to be cleared from list + } + if (independentSetStarted && !isIndependent(a, vertex)) { shortEdgeVerts.push(vertex); - if (++proccessed == shortEdgeVerts.size()) - ma::clearFlagFromDimension(a, CHECKED, 0); continue; } From f300a532baa036f7ff9a9357a837483950a92d05 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 30 May 2025 23:27:42 -0400 Subject: [PATCH 071/319] coarsen running --- ma/maCoarsen.cc | 56 ++++++++++++++++++++++--------------------------- 1 file changed, 25 insertions(+), 31 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index d57c1deb6..e70dd1315 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -15,7 +15,7 @@ #include "maDBG.h" #include #include "apfShape.h" -#include +#include namespace ma { @@ -273,7 +273,7 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo() && - collapse.tryBothDirections(0)) { + collapse.tryBothDirections(a->input->validQuality)) { result = true; } if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); @@ -319,9 +319,8 @@ bool isIndependent(Adapt* a, Entity* vertex) bool coarsen(Adapt* a) { - //Assert that there arent any vertices marked CHECKED ma::clearFlagFromDimension(a, CHECKED, 0); - std::queue shortEdgeVerts; + std::list shortEdgeVerts; Iterator* it = a->mesh->begin(1); Entity* edge; while ((edge = a->mesh->iterate(it))) @@ -332,43 +331,38 @@ bool coarsen(Adapt* a) for (int i = 0; i < 2; i++) { if (getFlag(a, vertices[i], CHECKED)) continue; setFlag(a, vertices[i], CHECKED); - shortEdgeVerts.push(vertices[i]); + shortEdgeVerts.push_back(vertices[i]); } } - ma::clearFlagFromDimension(a, CHECKED, 0); Collapse collapse; collapse.Init(a); int success = 0; - bool independentSetStarted = false; - int numChecked = 0; while (shortEdgeVerts.size() > 0) { - Entity* vertex = shortEdgeVerts.front(); - shortEdgeVerts.pop(); - - if (getFlag(a, vertex, CHECKED)) ++numChecked; - if (numChecked == shortEdgeVerts.size()) { - numChecked = 0; - independentSetStarted = false; - ma::clearFlagFromDimension(a, CHECKED, 0); //TODO: maybe only has to be cleared from list - } + ma::clearFlagFromDimension(a, CHECKED, 0); //TODO: maybe only has to be cleared from list + std::list::iterator i = shortEdgeVerts.begin(); + bool independentSetStarted = false; + while (i != shortEdgeVerts.end()) + { + Entity* vertex = *i++; + if (independentSetStarted && !isIndependent(a, vertex)) + continue; - if (independentSetStarted && !isIndependent(a, vertex)) { - shortEdgeVerts.push(vertex); - continue; - } + apf::Up edges; + a->mesh->getUp(vertex, edges); + Entity* shortEdge = getAdjacentShortestEdge(a, edges); + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - apf::Up edges; - a->mesh->getUp(vertex, edges); - Entity* shortEdge = getAdjacentShortestEdge(a, edges); - if (!a->sizeField->shouldCollapse(shortEdge)) continue; - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { - markDependent(a, edges); - collapse.destroyOldElements(); - independentSetStarted = true; - success++; + if (a->sizeField->shouldCollapse(shortEdge) && + tryCollapseEdge(a, shortEdge, keepVertex, collapse)) //add short edge check + { + markDependent(a, edges); + collapse.destroyOldElements(); + independentSetStarted = true; + success++; + } + i = shortEdgeVerts.erase(--i); } } From 47b3c9729e8db51156e4a35b39e9a863dd4fbf1e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 31 May 2025 02:04:10 -0400 Subject: [PATCH 072/319] print time --- ma/maCoarsen.cc | 16 ++++++++++++++-- 1 file changed, 14 insertions(+), 2 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index e70dd1315..07e773754 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -317,8 +317,18 @@ bool isIndependent(Adapt* a, Entity* vertex) return false; } +void clearListFlag(Adapt* a, std::list list, int flag) +{ + auto i = list.begin(); + while (i != list.end()) + clearFlag(a, *i++, flag); +} + bool coarsen(Adapt* a) { + if (!a->input->shouldCoarsen) + return false; + double t0 = pcu::Time(); ma::clearFlagFromDimension(a, CHECKED, 0); std::list shortEdgeVerts; Iterator* it = a->mesh->begin(1); @@ -340,7 +350,7 @@ bool coarsen(Adapt* a) int success = 0; while (shortEdgeVerts.size() > 0) { - ma::clearFlagFromDimension(a, CHECKED, 0); //TODO: maybe only has to be cleared from list + clearListFlag(a, shortEdgeVerts, CHECKED); std::list::iterator i = shortEdgeVerts.begin(); bool independentSetStarted = false; while (i != shortEdgeVerts.end()) @@ -365,7 +375,9 @@ bool coarsen(Adapt* a) i = shortEdgeVerts.erase(--i); } } - + ma::clearFlagFromDimension(a, CHECKED, 0); + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; } From 9bf9bcc34a483602d9d65bc7c05ae19dee8c63dc Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 31 May 2025 17:17:02 -0400 Subject: [PATCH 073/319] small coarsen speedup --- ma/maCoarsen.cc | 15 +++++++++++---- ma/maSnapper.cc | 30 +----------------------------- 2 files changed, 12 insertions(+), 33 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 07e773754..3a37ae113 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -284,8 +284,9 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll Entity* getAdjacentShortestEdge(Adapt* a, apf::Up& edges) { double minLength = 999999; - Entity* minEdge; + Entity* minEdge = 0; for (int i=0; i < edges.n; i++) { + if (!getFlag(a, edges.e[i], CHECKED)) continue; //Used to reduce calls to measure double length = a->sizeField->measure(edges.e[i]); if (length < minLength) { minLength = length; @@ -335,7 +336,8 @@ bool coarsen(Adapt* a) Entity* edge; while ((edge = a->mesh->iterate(it))) { - if (!a->sizeField->shouldCollapse(edge)) continue; + if (!a->sizeField->shouldCollapse(edge)) continue; //TODO: speedup + setFlag(a, edge, CHECKED); //Used to reduce measure calls Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { @@ -362,10 +364,14 @@ bool coarsen(Adapt* a) apf::Up edges; a->mesh->getUp(vertex, edges); Entity* shortEdge = getAdjacentShortestEdge(a, edges); - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); + if (shortEdge == 0) { + i = shortEdgeVerts.erase(--i); + continue; + } + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); if (a->sizeField->shouldCollapse(shortEdge) && - tryCollapseEdge(a, shortEdge, keepVertex, collapse)) //add short edge check + tryCollapseEdge(a, shortEdge, keepVertex, collapse)) //TODO: add short edge check { markDependent(a, edges); collapse.destroyOldElements(); @@ -376,6 +382,7 @@ bool coarsen(Adapt* a) } } ma::clearFlagFromDimension(a, CHECKED, 0); + ma::clearFlagFromDimension(a, CHECKED, 1); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index e9eb8ced1..b012b50fc 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -293,18 +293,10 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double break; } case 3: { - // double L1_xyz[2][3], L2_xyz[2][3]; ents[0]=edges[2]; ents[1]=edges[4]; ents[2]=((area[0] key problem: two mesh edges if (bit==3 || bit==5 || bit==6) { - // check edge swapping for (int i=0; i<2; i++) if (edgeSwap->run(ents[i])) { //TODO: Select best numSwap++; return true; } - // check split+collapse for (int i=0; i<2; i++) if (splitCollapse.run(ents[i], FPP->vert, 0)) { //TODO: Select best numSplitCollapse++; return true; } } - // three large dihedral angles -> key entity: a mesh face + // three large dihedral angles -> key entity: a mesh face else { - - // check edge swaps Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); for (int i=0; i<3; i++) { From c9e14974bb9cfe68a5777b174e42b3370154797c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 4 Jun 2025 18:37:00 -0400 Subject: [PATCH 074/319] get short edge verts --- ma/maCoarsen.cc | 15 ++++++++++----- test/aniso_ma_test.cc | 2 +- 2 files changed, 11 insertions(+), 6 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 3a37ae113..bcd2ca46f 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -325,12 +325,8 @@ void clearListFlag(Adapt* a, std::list list, int flag) clearFlag(a, *i++, flag); } -bool coarsen(Adapt* a) +std::list getShortEdgeVerts(Adapt* a) { - if (!a->input->shouldCoarsen) - return false; - double t0 = pcu::Time(); - ma::clearFlagFromDimension(a, CHECKED, 0); std::list shortEdgeVerts; Iterator* it = a->mesh->begin(1); Entity* edge; @@ -346,6 +342,15 @@ bool coarsen(Adapt* a) shortEdgeVerts.push_back(vertices[i]); } } + return shortEdgeVerts; +} + +bool coarsen(Adapt* a) +{ + if (!a->input->shouldCoarsen) + return false; + double t0 = pcu::Time(); + std::list shortEdgeVerts = getShortEdgeVerts(a); Collapse collapse; collapse.Init(a); diff --git a/test/aniso_ma_test.cc b/test/aniso_ma_test.cc index fab5aca87..77f820712 100644 --- a/test/aniso_ma_test.cc +++ b/test/aniso_ma_test.cc @@ -19,7 +19,7 @@ int main(int argc, char** argv) lion_set_verbosity(1); gmi_register_mesh(); ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); - refineSnapTest(m, 0.5, 1); + refineSnapTest(m, 0.4, 1); m->destroyNative(); apf::destroyMesh(m); } From 0b1a03506c2c1de8076ff9d19e1385ef3adf6aea Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 4 Jun 2025 22:49:58 -0400 Subject: [PATCH 075/319] new coarsen algo --- ma/maAdapt.h | 3 +- ma/maCoarsen.cc | 113 +++++++++++++++++++++++++++++------------------- 2 files changed, 70 insertions(+), 46 deletions(-) diff --git a/ma/maAdapt.h b/ma/maAdapt.h index 0b7a0324d..15d6a48d2 100644 --- a/ma/maAdapt.h +++ b/ma/maAdapt.h @@ -33,7 +33,8 @@ enum { LAYER_UNSNAP = (1<<15), DONT_MOVE = (1<<16), NEED_NOT_SPLIT = (1<<17), - NEED_NOT_COLLAPSE = (1<<18) + NEED_NOT_COLLAPSE = (1<<18), + COARSEN = (1<<19), }; class DeleteCallback; diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index bcd2ca46f..a8537c471 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -256,7 +256,8 @@ bool oldCoarsen(Adapt* a) return true; } -void printIndependentSet(Adapt* a) { +void printIndependentSet(Adapt* a) +{ apf::writeVtkFiles("independentMesh", a->mesh); ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "independentVerts", "independentVerts"); exit(0); @@ -284,9 +285,9 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll Entity* getAdjacentShortestEdge(Adapt* a, apf::Up& edges) { double minLength = 999999; - Entity* minEdge = 0; + Entity* minEdge = edges.e[0]; for (int i=0; i < edges.n; i++) { - if (!getFlag(a, edges.e[i], CHECKED)) continue; //Used to reduce calls to measure + if (!getFlag(a, edges.e[i], COARSEN)) continue; double length = a->sizeField->measure(edges.e[i]); if (length < minLength) { minLength = length; @@ -296,33 +297,54 @@ Entity* getAdjacentShortestEdge(Adapt* a, apf::Up& edges) return minEdge; } -void markDependent(Adapt* a, apf::Up& edges) +void flagAdjacent(Adapt* a, apf::Up& edges, int& checked) { for (int i=0; i < edges.n; i++) { Entity* vertices[2]; a->mesh->getDownward(edges.e[i],0, vertices); - setFlag(a, vertices[0], CHECKED); - setFlag(a, vertices[1], CHECKED); + for (int i = 0; i < 2; i++) { + setFlag(a, vertices[i], NEED_NOT_COLLAPSE); + if (getFlag(a, vertices[i], COARSEN) && getFlag(a, vertices[i], CHECKED)){ + clearFlag(a, vertices[i], CHECKED); + checked--; + } + } } } +void clearListFlag(Adapt* a, std::list list, int flag) +{ + auto i = list.begin(); + while (i != list.end()) + clearFlag(a, *i++, flag); +} + bool isIndependent(Adapt* a, Entity* vertex) { - if (getFlag(a, vertex, CHECKED)) return false; + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) return false; apf::Up edges; a->mesh->getUp(vertex, edges); for (int i=0; i < edges.n; i++) { Entity* opposite = getEdgeVertOppositeVert(a->mesh, edges.e[i], vertex); - if (getFlag(a, opposite, CHECKED)) return true; + if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return true; } return false; } -void clearListFlag(Adapt* a, std::list list, int flag) +Entity* getNextIndependentVert(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted) { - auto i = list.begin(); - while (i != list.end()) - clearFlag(a, *i++, flag); + while (i != shortEdgeVerts.end()) + { + Entity* vertex = *i; + if (getFlag(a, vertex, CHECKED)) {i++; continue;} + if (!independentSetStarted || isIndependent(a, vertex)) + return vertex; + i++; + } + clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); + independentSetStarted = false; + i = shortEdgeVerts.begin(); + return 0; } std::list getShortEdgeVerts(Adapt* a) @@ -333,15 +355,16 @@ std::list getShortEdgeVerts(Adapt* a) while ((edge = a->mesh->iterate(it))) { if (!a->sizeField->shouldCollapse(edge)) continue; //TODO: speedup - setFlag(a, edge, CHECKED); //Used to reduce measure calls + setFlag(a, edge, COARSEN); Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { - if (getFlag(a, vertices[i], CHECKED)) continue; - setFlag(a, vertices[i], CHECKED); + if (getFlag(a, vertices[i], COARSEN)) continue; + setFlag(a, vertices[i], COARSEN); shortEdgeVerts.push_back(vertices[i]); } } + // ma_dbg::dumpMeshWithFlag(a, 0, 1, COARSEN, "shortEdges", "shortEdges"); return shortEdgeVerts; } @@ -355,39 +378,39 @@ bool coarsen(Adapt* a) Collapse collapse; collapse.Init(a); int success = 0; - while (shortEdgeVerts.size() > 0) + int checked = 0; + bool independentSetStarted = false; + std::list::iterator i = shortEdgeVerts.begin(); + while (checked < shortEdgeVerts.size()) { - clearListFlag(a, shortEdgeVerts, CHECKED); - std::list::iterator i = shortEdgeVerts.begin(); - bool independentSetStarted = false; - while (i != shortEdgeVerts.end()) - { - Entity* vertex = *i++; - if (independentSetStarted && !isIndependent(a, vertex)) - continue; - - apf::Up edges; - a->mesh->getUp(vertex, edges); - Entity* shortEdge = getAdjacentShortestEdge(a, edges); - if (shortEdge == 0) { - i = shortEdgeVerts.erase(--i); - continue; - } - - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - if (a->sizeField->shouldCollapse(shortEdge) && - tryCollapseEdge(a, shortEdge, keepVertex, collapse)) //TODO: add short edge check - { - markDependent(a, edges); - collapse.destroyOldElements(); - independentSetStarted = true; - success++; - } - i = shortEdgeVerts.erase(--i); + Entity* vertex = getNextIndependentVert(a, shortEdgeVerts, i, independentSetStarted); + if (vertex == 0) continue; + // printf("%d of %d\n", std::distance(shortEdgeVerts.begin(), i), shortEdgeVerts.size()); + apf::Up edges; + a->mesh->getUp(vertex, edges); + Entity* shortEdge = getAdjacentShortestEdge(a, edges); + if (!a->sizeField->shouldCollapse(shortEdge)) { + if (getFlag(a, vertex, CHECKED)) checked--; + i = shortEdgeVerts.erase(i); + continue; + } + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); + if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { //TODO: add short edge check + flagAdjacent(a, edges, checked); + i = shortEdgeVerts.erase(i); + if (getFlag(a, vertex, CHECKED)) checked--; + independentSetStarted = true; + success++; + collapse.destroyOldElements(); + } + else { + setFlag(a, vertex, CHECKED); + checked++; } } - ma::clearFlagFromDimension(a, CHECKED, 0); - ma::clearFlagFromDimension(a, CHECKED, 1); + // printIndependentSet(a); + // ma::clearFlagFromDimension(a, CHECKED, 0); + // ma::clearFlagFromDimension(a, COARSEN, 1); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; From 0443dcc136c16526ebd321c7ebf2c20eaeed0400 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 15:12:14 -0400 Subject: [PATCH 076/319] clear flags once done --- ma/maCoarsen.cc | 21 +++++++++++++++------ test/aniso_adapt.h | 2 +- 2 files changed, 16 insertions(+), 7 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index a8537c471..b16c2e89d 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -304,7 +304,7 @@ void flagAdjacent(Adapt* a, apf::Up& edges, int& checked) a->mesh->getDownward(edges.e[i],0, vertices); for (int i = 0; i < 2; i++) { setFlag(a, vertices[i], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[i], COARSEN) && getFlag(a, vertices[i], CHECKED)){ + if (getFlag(a, vertices[i], CHECKED)){ clearFlag(a, vertices[i], CHECKED); checked--; } @@ -365,16 +365,25 @@ std::list getShortEdgeVerts(Adapt* a) } } // ma_dbg::dumpMeshWithFlag(a, 0, 1, COARSEN, "shortEdges", "shortEdges"); + clearListFlag(a, shortEdgeVerts, COARSEN); return shortEdgeVerts; } +void assertChecked(Adapt* a, std::list& shortEdgeVerts, const int currChecked) +{ + int realChecked = 0; + std::list::iterator i = shortEdgeVerts.begin(); + while (i != shortEdgeVerts.end()) + if (getFlag(a, *i++, CHECKED)) realChecked++; + PCU_ALWAYS_ASSERT(realChecked == currChecked); +} + bool coarsen(Adapt* a) { if (!a->input->shouldCoarsen) return false; double t0 = pcu::Time(); std::list shortEdgeVerts = getShortEdgeVerts(a); - Collapse collapse; collapse.Init(a); int success = 0; @@ -383,9 +392,9 @@ bool coarsen(Adapt* a) std::list::iterator i = shortEdgeVerts.begin(); while (checked < shortEdgeVerts.size()) { + // assertChecked(a, shortEdgeVerts, checked); Entity* vertex = getNextIndependentVert(a, shortEdgeVerts, i, independentSetStarted); if (vertex == 0) continue; - // printf("%d of %d\n", std::distance(shortEdgeVerts.begin(), i), shortEdgeVerts.size()); apf::Up edges; a->mesh->getUp(vertex, edges); Entity* shortEdge = getAdjacentShortestEdge(a, edges); @@ -408,9 +417,9 @@ bool coarsen(Adapt* a) checked++; } } - // printIndependentSet(a); - // ma::clearFlagFromDimension(a, CHECKED, 0); - // ma::clearFlagFromDimension(a, COARSEN, 1); + clearListFlag(a, shortEdgeVerts, CHECKED); + ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + ma::clearFlagFromDimension(a, COARSEN, 1); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 9645376e0..37862d272 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -45,7 +45,7 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < 1; ++i) + for (int i = 0; i < 2; ++i) { ma::coarsen(a); // ma::refine(a); From 7c2abc64b03ee72a877e8bc0fe1606759822377a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 16:04:26 -0400 Subject: [PATCH 077/319] max length check --- ma/maCoarsen.cc | 11 +++++++---- ma/maCollapse.cc | 19 +++++++++++++++++++ ma/maCollapse.h | 1 + test/aniso_adapt.h | 2 +- 4 files changed, 28 insertions(+), 5 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index b16c2e89d..d058cac53 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -274,8 +274,12 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo() && - collapse.tryBothDirections(a->input->validQuality)) { - result = true; + collapse.tryBothDirections(a->input->goodQuality)) { + if (collapse.edgeGrewPastMaxLength()) { + result = false; + collapse.cancel(); + } + else result = true; } if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); return result; @@ -404,10 +408,9 @@ bool coarsen(Adapt* a) continue; } Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { //TODO: add short edge check + if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { flagAdjacent(a, edges, checked); i = shortEdgeVerts.erase(i); - if (getFlag(a, vertex, CHECKED)) checked--; independentSetStarted = true; success++; collapse.destroyOldElements(); diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 05ee1b873..68303dc87 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -80,6 +80,25 @@ bool Collapse::edgesGoodSize() { return true; } +bool Collapse::edgeGrewPastMaxLength() { + PCU_ALWAYS_ASSERT(elementsToKeep.size()); + PCU_ALWAYS_ASSERT(elementsToKeep.size() == newElements.size()); + size_t i=0; + APF_ITERATE(EntitySet,elementsToKeep,it) { + Entity* edgesBefore[6]; + adapt->mesh->getDownward(*it,1,edgesBefore); + Entity* edgesAfter[6]; + adapt->mesh->getDownward(newElements[i++],1,edgesAfter); + for (int j=0; j<6; j++) { + double sizeBefore = adapt->sizeField->measure(edgesBefore[j]); + double sizeAfter = adapt->sizeField->measure(edgesAfter[j]); + if (sizeAfter > sizeBefore && sizeAfter > MAXLENGTH) + return true; + } + } + return false; +} + bool Collapse::tryThisDirection(double qualityToBeat) { if (!tryThisDirectionNoCancel(qualityToBeat)) { diff --git a/ma/maCollapse.h b/ma/maCollapse.h index d9a449adf..096bdea8d 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,6 +42,7 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); + bool edgeGrewPastMaxLength(); double getOldQuality(); Adapt* adapt; Entity* edge; diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 37862d272..e8e94ae47 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -48,7 +48,7 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) for (int i = 0; i < 2; ++i) { ma::coarsen(a); - // ma::refine(a); + ma::refine(a); // ma::snap(a); } m->verify(); From 89f6c034b5edf5ef018a85c9486c909adb2ab47f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 16:10:31 -0400 Subject: [PATCH 078/319] rename adjacent edges --- ma/maCoarsen.cc | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index d058cac53..ba4797b86 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -286,7 +286,7 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll } -Entity* getAdjacentShortestEdge(Adapt* a, apf::Up& edges) +Entity* getShortestEdge(Adapt* a, apf::Up& edges) { double minLength = 999999; Entity* minEdge = edges.e[0]; @@ -301,7 +301,7 @@ Entity* getAdjacentShortestEdge(Adapt* a, apf::Up& edges) return minEdge; } -void flagAdjacent(Adapt* a, apf::Up& edges, int& checked) +void flagIndependent(Adapt* a, apf::Up& edges, int& checked) { for (int i=0; i < edges.n; i++) { Entity* vertices[2]; @@ -399,9 +399,9 @@ bool coarsen(Adapt* a) // assertChecked(a, shortEdgeVerts, checked); Entity* vertex = getNextIndependentVert(a, shortEdgeVerts, i, independentSetStarted); if (vertex == 0) continue; - apf::Up edges; - a->mesh->getUp(vertex, edges); - Entity* shortEdge = getAdjacentShortestEdge(a, edges); + apf::Up adjacent; + a->mesh->getUp(vertex, adjacent); + Entity* shortEdge = getShortestEdge(a, adjacent); if (!a->sizeField->shouldCollapse(shortEdge)) { if (getFlag(a, vertex, CHECKED)) checked--; i = shortEdgeVerts.erase(i); @@ -409,7 +409,7 @@ bool coarsen(Adapt* a) } Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { - flagAdjacent(a, edges, checked); + flagIndependent(a, adjacent, checked); i = shortEdgeVerts.erase(i); independentSetStarted = true; success++; From 0c5d2a1ede71c07468316527e4779a5cb7cfeb30 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 16:15:20 -0400 Subject: [PATCH 079/319] simplify code --- ma/maCoarsen.cc | 10 ++++------ 1 file changed, 4 insertions(+), 6 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index ba4797b86..dc0dc3404 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -335,7 +335,7 @@ bool isIndependent(Adapt* a, Entity* vertex) return false; } -Entity* getNextIndependentVert(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted) +Entity* getClosestIndependentVert(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted) { while (i != shortEdgeVerts.end()) { @@ -397,18 +397,16 @@ bool coarsen(Adapt* a) while (checked < shortEdgeVerts.size()) { // assertChecked(a, shortEdgeVerts, checked); - Entity* vertex = getNextIndependentVert(a, shortEdgeVerts, i, independentSetStarted); + Entity* vertex = getClosestIndependentVert(a, shortEdgeVerts, i, independentSetStarted); if (vertex == 0) continue; apf::Up adjacent; a->mesh->getUp(vertex, adjacent); Entity* shortEdge = getShortestEdge(a, adjacent); + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); if (!a->sizeField->shouldCollapse(shortEdge)) { - if (getFlag(a, vertex, CHECKED)) checked--; i = shortEdgeVerts.erase(i); - continue; } - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { + else if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { flagIndependent(a, adjacent, checked); i = shortEdgeVerts.erase(i); independentSetStarted = true; From e6904550403de2a47e0abd3a1f94b0ec5abc6f41 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 16:19:57 -0400 Subject: [PATCH 080/319] rename flag independent set --- ma/maCoarsen.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index dc0dc3404..860ae1f16 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -301,7 +301,7 @@ Entity* getShortestEdge(Adapt* a, apf::Up& edges) return minEdge; } -void flagIndependent(Adapt* a, apf::Up& edges, int& checked) +void flagIndependentSet(Adapt* a, apf::Up& edges, int& checked) { for (int i=0; i < edges.n; i++) { Entity* vertices[2]; @@ -407,7 +407,7 @@ bool coarsen(Adapt* a) i = shortEdgeVerts.erase(i); } else if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { - flagIndependent(a, adjacent, checked); + flagIndependentSet(a, adjacent, checked); i = shortEdgeVerts.erase(i); independentSetStarted = true; success++; From 42d2ed19fce02d765161d5c6ed6737bb660916cb Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 17:11:43 -0400 Subject: [PATCH 081/319] independent set goes through full list --- ma/maCoarsen.cc | 27 +++++++++++++++------------ 1 file changed, 15 insertions(+), 12 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 860ae1f16..1109d89cb 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -228,7 +228,7 @@ long markEdgesToCollapse(Adapt* a) DONT_COLLAPSE | NEED_NOT_COLLAPSE); } -bool oldCoarsen(Adapt* a) +bool oldcoarsen(Adapt* a) { if (!a->input->shouldCoarsen) return false; @@ -335,19 +335,22 @@ bool isIndependent(Adapt* a, Entity* vertex) return false; } -Entity* getClosestIndependentVert(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted) +Entity* getClosestIndependentVert(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked) { - while (i != shortEdgeVerts.end()) + while (checked < shortEdgeVerts.size()) { - Entity* vertex = *i; - if (getFlag(a, vertex, CHECKED)) {i++; continue;} - if (!independentSetStarted || isIndependent(a, vertex)) - return vertex; - i++; + i = shortEdgeVerts.begin(); + while (i != shortEdgeVerts.end()) + { + Entity* vertex = *i; + if (getFlag(a, vertex, CHECKED)) {i++; continue;} + if (!independentSetStarted || isIndependent(a, vertex)) + return vertex; + i++; + } + clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); + independentSetStarted = false; } - clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); - independentSetStarted = false; - i = shortEdgeVerts.begin(); return 0; } @@ -397,7 +400,7 @@ bool coarsen(Adapt* a) while (checked < shortEdgeVerts.size()) { // assertChecked(a, shortEdgeVerts, checked); - Entity* vertex = getClosestIndependentVert(a, shortEdgeVerts, i, independentSetStarted); + Entity* vertex = getClosestIndependentVert(a, shortEdgeVerts, i, independentSetStarted, checked); if (vertex == 0) continue; apf::Up adjacent; a->mesh->getUp(vertex, adjacent); From 965629af485af5f0890a94579d0a01575a12a2d5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 5 Jun 2025 21:29:48 -0400 Subject: [PATCH 082/319] new min length --- ma/maSize.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maSize.h b/ma/maSize.h index da3c8b9a2..f1358cb51 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -20,7 +20,7 @@ namespace ma { typedef apf::Matrix3x3 Matrix; const double MAXLENGTH = 1.5; -const double MINLENGTH = 0.5; +const double MINLENGTH = .75; class SizeField { From 846f72765aa1becef7554f0e85dd0467b7408189 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 16:57:57 -0400 Subject: [PATCH 083/319] rename get touching independent set --- ma/maCoarsen.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 1109d89cb..cd4fa4732 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -335,7 +335,7 @@ bool isIndependent(Adapt* a, Entity* vertex) return false; } -Entity* getClosestIndependentVert(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked) +Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked) { while (checked < shortEdgeVerts.size()) { @@ -400,7 +400,7 @@ bool coarsen(Adapt* a) while (checked < shortEdgeVerts.size()) { // assertChecked(a, shortEdgeVerts, checked); - Entity* vertex = getClosestIndependentVert(a, shortEdgeVerts, i, independentSetStarted, checked); + Entity* vertex = getTouchingIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked); if (vertex == 0) continue; apf::Up adjacent; a->mesh->getUp(vertex, adjacent); From bdef2387385eb64027297185a21c324dcd491262 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 17:35:12 -0400 Subject: [PATCH 084/319] combined touching independent set --- ma/maCoarsen.cc | 31 ++++++++++++------------------- 1 file changed, 12 insertions(+), 19 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index cd4fa4732..d481c781e 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -323,19 +323,7 @@ void clearListFlag(Adapt* a, std::list list, int flag) clearFlag(a, *i++, flag); } -bool isIndependent(Adapt* a, Entity* vertex) -{ - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) return false; - apf::Up edges; - a->mesh->getUp(vertex, edges); - for (int i=0; i < edges.n; i++) { - Entity* opposite = getEdgeVertOppositeVert(a->mesh, edges.e[i], vertex); - if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return true; - } - return false; -} - -Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked) +Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked, apf::Up& adjacent) { while (checked < shortEdgeVerts.size()) { @@ -343,9 +331,15 @@ Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, while (i != shortEdgeVerts.end()) { Entity* vertex = *i; - if (getFlag(a, vertex, CHECKED)) {i++; continue;} - if (!independentSetStarted || isIndependent(a, vertex)) - return vertex; + if (getFlag(a, vertex, CHECKED)) {i++; continue;} //Already tried to collapse + a->mesh->getUp(vertex, adjacent); + if (!independentSetStarted) return vertex; + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {i++; continue;} //Too close to last collapse + for (int i=0; i < adjacent.n; i++) + { + Entity* opposite = getEdgeVertOppositeVert(a->mesh, adjacent.e[i], vertex); + if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return vertex; //Touching independent set + } i++; } clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); @@ -400,10 +394,9 @@ bool coarsen(Adapt* a) while (checked < shortEdgeVerts.size()) { // assertChecked(a, shortEdgeVerts, checked); - Entity* vertex = getTouchingIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked); - if (vertex == 0) continue; apf::Up adjacent; - a->mesh->getUp(vertex, adjacent); + Entity* vertex = getTouchingIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked, adjacent); + if (vertex == 0) continue; Entity* shortEdge = getShortestEdge(a, adjacent); Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); if (!a->sizeField->shouldCollapse(shortEdge)) { From 9f0be1e9a7183c60d79aa64fd7cb57d9e5d305a5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 17:57:54 -0400 Subject: [PATCH 085/319] fixed get length --- ma/maAdapt.h | 3 +-- ma/maCoarsen.cc | 17 +++++++++-------- 2 files changed, 10 insertions(+), 10 deletions(-) diff --git a/ma/maAdapt.h b/ma/maAdapt.h index 15d6a48d2..0b7a0324d 100644 --- a/ma/maAdapt.h +++ b/ma/maAdapt.h @@ -33,8 +33,7 @@ enum { LAYER_UNSNAP = (1<<15), DONT_MOVE = (1<<16), NEED_NOT_SPLIT = (1<<17), - NEED_NOT_COLLAPSE = (1<<18), - COARSEN = (1<<19), + NEED_NOT_COLLAPSE = (1<<18) }; class DeleteCallback; diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index d481c781e..2c0a7179d 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -291,8 +291,11 @@ Entity* getShortestEdge(Adapt* a, apf::Up& edges) double minLength = 999999; Entity* minEdge = edges.e[0]; for (int i=0; i < edges.n; i++) { - if (!getFlag(a, edges.e[i], COARSEN)) continue; - double length = a->sizeField->measure(edges.e[i]); + Entity* vertices[2]; + a->mesh->getDownward(edges.e[i], 0, vertices); + Vector x = getPosition(a->mesh, vertices[0]); + Vector y = getPosition(a->mesh, vertices[1]); + double length = (x-y).getLength(); if (length < minLength) { minLength = length; minEdge = edges.e[i]; @@ -356,17 +359,16 @@ std::list getShortEdgeVerts(Adapt* a) while ((edge = a->mesh->iterate(it))) { if (!a->sizeField->shouldCollapse(edge)) continue; //TODO: speedup - setFlag(a, edge, COARSEN); Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { - if (getFlag(a, vertices[i], COARSEN)) continue; - setFlag(a, vertices[i], COARSEN); + if (getFlag(a, vertices[i], CHECKED)) continue; + setFlag(a, vertices[i], CHECKED); shortEdgeVerts.push_back(vertices[i]); } } - // ma_dbg::dumpMeshWithFlag(a, 0, 1, COARSEN, "shortEdges", "shortEdges"); - clearListFlag(a, shortEdgeVerts, COARSEN); + // ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "shortEdges", "shortEdges"); + clearListFlag(a, shortEdgeVerts, CHECKED); return shortEdgeVerts; } @@ -416,7 +418,6 @@ bool coarsen(Adapt* a) } clearListFlag(a, shortEdgeVerts, CHECKED); ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); - ma::clearFlagFromDimension(a, COARSEN, 1); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; From dc62761a343f29d65d0386f6a6db81bb911d93b5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 20:46:45 -0400 Subject: [PATCH 086/319] fixed typo --- ma/maCoarsen.cc | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 2c0a7179d..bcdcbad06 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -309,10 +309,10 @@ void flagIndependentSet(Adapt* a, apf::Up& edges, int& checked) for (int i=0; i < edges.n; i++) { Entity* vertices[2]; a->mesh->getDownward(edges.e[i],0, vertices); - for (int i = 0; i < 2; i++) { - setFlag(a, vertices[i], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[i], CHECKED)){ - clearFlag(a, vertices[i], CHECKED); + for (int k = 0; k < 2; k++) { + setFlag(a, vertices[k], NEED_NOT_COLLAPSE); + if (getFlag(a, vertices[k], CHECKED)){ + clearFlag(a, vertices[k], CHECKED); checked--; } } From e21ead2f12d64d386cfa3c7d1e39d879384e1dd6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 20:59:58 -0400 Subject: [PATCH 087/319] simplify touching independent set --- ma/maCoarsen.cc | 29 +++++++++++++---------------- 1 file changed, 13 insertions(+), 16 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index bcdcbad06..b9bb0df24 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -328,26 +328,23 @@ void clearListFlag(Adapt* a, std::list list, int flag) Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked, apf::Up& adjacent) { - while (checked < shortEdgeVerts.size()) + i = shortEdgeVerts.begin(); + while (i != shortEdgeVerts.end()) { - i = shortEdgeVerts.begin(); - while (i != shortEdgeVerts.end()) + Entity* vertex = *i; + if (getFlag(a, vertex, CHECKED)) {i++; continue;} //Already tried to collapse + a->mesh->getUp(vertex, adjacent); + if (!independentSetStarted) return vertex; + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {i++; continue;} //Too close to last collapse + for (int i=0; i < adjacent.n; i++) { - Entity* vertex = *i; - if (getFlag(a, vertex, CHECKED)) {i++; continue;} //Already tried to collapse - a->mesh->getUp(vertex, adjacent); - if (!independentSetStarted) return vertex; - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {i++; continue;} //Too close to last collapse - for (int i=0; i < adjacent.n; i++) - { - Entity* opposite = getEdgeVertOppositeVert(a->mesh, adjacent.e[i], vertex); - if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return vertex; //Touching independent set - } - i++; + Entity* opposite = getEdgeVertOppositeVert(a->mesh, adjacent.e[i], vertex); + if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return vertex; //Touching independent set } - clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); - independentSetStarted = false; + i++; } + clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); + independentSetStarted = false; return 0; } From 02158f99aad2cf826a6590a12c5a7f7f0847163e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 21:03:11 -0400 Subject: [PATCH 088/319] rename variable and comment --- ma/maCoarsen.cc | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index b9bb0df24..a33f65210 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -304,15 +304,16 @@ Entity* getShortestEdge(Adapt* a, apf::Up& edges) return minEdge; } -void flagIndependentSet(Adapt* a, apf::Up& edges, int& checked) +//Prevent adjacent vertices from collapsing to create indepedent set +void flagIndependentSet(Adapt* a, apf::Up& adjacent, int& checked) { - for (int i=0; i < edges.n; i++) { + for (int a=0; a < adjacent.n; a++) { Entity* vertices[2]; - a->mesh->getDownward(edges.e[i],0, vertices); - for (int k = 0; k < 2; k++) { - setFlag(a, vertices[k], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[k], CHECKED)){ - clearFlag(a, vertices[k], CHECKED); + a->mesh->getDownward(adjacent.e[a],0, vertices); + for (int v = 0; v < 2; v++) { + setFlag(a, vertices[v], NEED_NOT_COLLAPSE); + if (getFlag(a, vertices[v], CHECKED)){ + clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set checked--; } } From 35a0b0e60f041986bb4806b06e1696cedd279844 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 21:08:46 -0400 Subject: [PATCH 089/319] calculate edge length --- ma/maCoarsen.cc | 20 ++++++++++++-------- 1 file changed, 12 insertions(+), 8 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index a33f65210..49cedcdc3 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -285,17 +285,21 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll return result; } +double calcLength(Adapt* a, Entity* edge) +{ + Entity* vertices[2]; + a->mesh->getDownward(edge, 0, vertices); + Vector x = getPosition(a->mesh, vertices[0]); + Vector y = getPosition(a->mesh, vertices[1]); + return (x - y).getLength(); +} Entity* getShortestEdge(Adapt* a, apf::Up& edges) { - double minLength = 999999; Entity* minEdge = edges.e[0]; + double minLength = calcLength(a, minEdge); for (int i=0; i < edges.n; i++) { - Entity* vertices[2]; - a->mesh->getDownward(edges.e[i], 0, vertices); - Vector x = getPosition(a->mesh, vertices[0]); - Vector y = getPosition(a->mesh, vertices[1]); - double length = (x-y).getLength(); + double length = calcLength(a, edges.e[i]); if (length < minLength) { minLength = length; minEdge = edges.e[i]; @@ -307,9 +311,9 @@ Entity* getShortestEdge(Adapt* a, apf::Up& edges) //Prevent adjacent vertices from collapsing to create indepedent set void flagIndependentSet(Adapt* a, apf::Up& adjacent, int& checked) { - for (int a=0; a < adjacent.n; a++) { + for (int adj=0; adj < adjacent.n; adj++) { Entity* vertices[2]; - a->mesh->getDownward(adjacent.e[a],0, vertices); + a->mesh->getDownward(adjacent.e[adj],0, vertices); for (int v = 0; v < 2; v++) { setFlag(a, vertices[v], NEED_NOT_COLLAPSE); if (getFlag(a, vertices[v], CHECKED)){ From 001decc09f8d1d10de9044e49a040846419823f5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 22:33:55 -0400 Subject: [PATCH 090/319] check shortest collapsable edge --- ma/maCoarsen.cc | 33 +++++++++++++++++++-------------- 1 file changed, 19 insertions(+), 14 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 49cedcdc3..9cdfb3fae 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -294,16 +294,19 @@ double calcLength(Adapt* a, Entity* edge) return (x - y).getLength(); } -Entity* getShortestEdge(Adapt* a, apf::Up& edges) +Entity* getShortestCollapsable(Adapt* a, Collapse& collapse, apf::Up& adjacent, Entity* vertex) { - Entity* minEdge = edges.e[0]; - double minLength = calcLength(a, minEdge); - for (int i=0; i < edges.n; i++) { - double length = calcLength(a, edges.e[i]); - if (length < minLength) { - minLength = length; - minEdge = edges.e[i]; - } + Entity* minEdge = 0; + double minLength = 99999; + for (int i=0; i < adjacent.n; i++) { + Entity* edge = adjacent.e[i]; + double length = calcLength(a, edge); + if (length >= minLength) continue; + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, edge, vertex); + if (!tryCollapseEdge(a, edge, keepVertex, collapse)) continue; + minLength = length; + minEdge = adjacent.e[i]; + collapse.cancel();//TODO: reuse collapse } return minEdge; } @@ -401,12 +404,14 @@ bool coarsen(Adapt* a) apf::Up adjacent; Entity* vertex = getTouchingIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked, adjacent); if (vertex == 0) continue; - Entity* shortEdge = getShortestEdge(a, adjacent); - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - if (!a->sizeField->shouldCollapse(shortEdge)) { - i = shortEdgeVerts.erase(i); + Entity* shortEdge = getShortestCollapsable(a, collapse, adjacent, vertex); + if (shortEdge == 0) { + setFlag(a, vertex, CHECKED); + checked++; + continue; } - else if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); + if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { flagIndependentSet(a, adjacent, checked); i = shortEdgeVerts.erase(i); independentSetStarted = true; From f65350a41114fcce1414c448aa8f2507fe051577 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 6 Jun 2025 23:59:30 -0400 Subject: [PATCH 091/319] smaller factor --- test/aniso_ma_test.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/test/aniso_ma_test.cc b/test/aniso_ma_test.cc index 77f820712..fab5aca87 100644 --- a/test/aniso_ma_test.cc +++ b/test/aniso_ma_test.cc @@ -19,7 +19,7 @@ int main(int argc, char** argv) lion_set_verbosity(1); gmi_register_mesh(); ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); - refineSnapTest(m, 0.4, 1); + refineSnapTest(m, 0.5, 1); m->destroyNative(); apf::destroyMesh(m); } From 2a5f0f96e94367e51e306d23048618efd984a728 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 11 Jun 2025 14:47:31 -0400 Subject: [PATCH 092/319] collapse only shortest edges --- ma/maCoarsen.cc | 35 ++++++++++++++++++++++++++--------- 1 file changed, 26 insertions(+), 9 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 9cdfb3fae..aed6eafe5 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -15,6 +15,7 @@ #include "maDBG.h" #include #include "apfShape.h" +#include #include namespace ma { @@ -294,21 +295,37 @@ double calcLength(Adapt* a, Entity* edge) return (x - y).getLength(); } +struct EdgeLength +{ + Entity* edge; + double length; + + bool operator<(const EdgeLength& other) const { + return length < other.length; // Descending order + } +}; + +bool compareLength(const EdgeLength& a, const EdgeLength& b) +{ + return a.length > b.length; +} + Entity* getShortestCollapsable(Adapt* a, Collapse& collapse, apf::Up& adjacent, Entity* vertex) { - Entity* minEdge = 0; - double minLength = 99999; + std::vector sorted; for (int i=0; i < adjacent.n; i++) { - Entity* edge = adjacent.e[i]; - double length = calcLength(a, edge); - if (length >= minLength) continue; + EdgeLength measured{adjacent.e[i], a->sizeField->measure(adjacent.e[i])}; + auto pos = std::lower_bound(sorted.begin(), sorted.end(), measured); + sorted.insert(pos, measured); + } + for (int i=0; i < sorted.size(); i++) { + Entity* edge = sorted[i].edge; Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, edge, vertex); if (!tryCollapseEdge(a, edge, keepVertex, collapse)) continue; - minLength = length; - minEdge = adjacent.e[i]; - collapse.cancel();//TODO: reuse collapse + collapse.cancel(); + return edge; } - return minEdge; + return 0; } //Prevent adjacent vertices from collapsing to create indepedent set From ea5fcb8c142a1bc2263d6e81efbe1f3765890873 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 11 Jun 2025 15:00:51 -0400 Subject: [PATCH 093/319] only collapse once --- ma/maCoarsen.cc | 53 ++++++------------------------------------------- 1 file changed, 6 insertions(+), 47 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index aed6eafe5..eb5c00957 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -257,13 +257,6 @@ bool oldcoarsen(Adapt* a) return true; } -void printIndependentSet(Adapt* a) -{ - apf::writeVtkFiles("independentMesh", a->mesh); - ma_dbg::dumpMeshWithFlag(a, 0, 0, CHECKED, "independentVerts", "independentVerts"); - exit(0); -} - static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); @@ -286,31 +279,16 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll return result; } -double calcLength(Adapt* a, Entity* edge) -{ - Entity* vertices[2]; - a->mesh->getDownward(edge, 0, vertices); - Vector x = getPosition(a->mesh, vertices[0]); - Vector y = getPosition(a->mesh, vertices[1]); - return (x - y).getLength(); -} - struct EdgeLength { Entity* edge; double length; - bool operator<(const EdgeLength& other) const { - return length < other.length; // Descending order + return length < other.length; } }; -bool compareLength(const EdgeLength& a, const EdgeLength& b) -{ - return a.length > b.length; -} - -Entity* getShortestCollapsable(Adapt* a, Collapse& collapse, apf::Up& adjacent, Entity* vertex) +bool collapseShortest(Adapt* a, Collapse& collapse, apf::Up& adjacent, Entity* vertex) { std::vector sorted; for (int i=0; i < adjacent.n; i++) { @@ -321,11 +299,9 @@ Entity* getShortestCollapsable(Adapt* a, Collapse& collapse, apf::Up& adjacent, for (int i=0; i < sorted.size(); i++) { Entity* edge = sorted[i].edge; Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, edge, vertex); - if (!tryCollapseEdge(a, edge, keepVertex, collapse)) continue; - collapse.cancel(); - return edge; + if (tryCollapseEdge(a, edge, keepVertex, collapse)) return true; } - return 0; + return false; } //Prevent adjacent vertices from collapsing to create indepedent set @@ -394,15 +370,6 @@ std::list getShortEdgeVerts(Adapt* a) return shortEdgeVerts; } -void assertChecked(Adapt* a, std::list& shortEdgeVerts, const int currChecked) -{ - int realChecked = 0; - std::list::iterator i = shortEdgeVerts.begin(); - while (i != shortEdgeVerts.end()) - if (getFlag(a, *i++, CHECKED)) realChecked++; - PCU_ALWAYS_ASSERT(realChecked == currChecked); -} - bool coarsen(Adapt* a) { if (!a->input->shouldCoarsen) @@ -417,23 +384,15 @@ bool coarsen(Adapt* a) std::list::iterator i = shortEdgeVerts.begin(); while (checked < shortEdgeVerts.size()) { - // assertChecked(a, shortEdgeVerts, checked); apf::Up adjacent; Entity* vertex = getTouchingIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked, adjacent); if (vertex == 0) continue; - Entity* shortEdge = getShortestCollapsable(a, collapse, adjacent, vertex); - if (shortEdge == 0) { - setFlag(a, vertex, CHECKED); - checked++; - continue; - } - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, shortEdge, vertex); - if (tryCollapseEdge(a, shortEdge, keepVertex, collapse)) { + if (collapseShortest(a, collapse, adjacent, vertex)) { flagIndependentSet(a, adjacent, checked); i = shortEdgeVerts.erase(i); independentSetStarted = true; - success++; collapse.destroyOldElements(); + success++; } else { setFlag(a, vertex, CHECKED); From b7ac7a422443b3bc6c27b1671ea00aadc63a698c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 11 Jun 2025 15:51:46 -0400 Subject: [PATCH 094/319] don't try to collapse long edges --- ma/maCoarsen.cc | 1 + 1 file changed, 1 insertion(+) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index eb5c00957..1a1419db8 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -298,6 +298,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, apf::Up& adjacent, Entity* v } for (int i=0; i < sorted.size(); i++) { Entity* edge = sorted[i].edge; + if (!a->sizeField->shouldCollapse(edge)) return false; Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, edge, vertex); if (tryCollapseEdge(a, edge, keepVertex, collapse)) return true; } From 931ab03ce1a8af6ae75f208cda72f59491c6ca4d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 11 Jun 2025 17:33:33 -0400 Subject: [PATCH 095/319] iterate from current position --- ma/maCoarsen.cc | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 1a1419db8..a152e6411 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -328,11 +328,12 @@ void clearListFlag(Adapt* a, std::list list, int flag) clearFlag(a, *i++, flag); } -Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked, apf::Up& adjacent) +//Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an independent set +Entity* getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked, apf::Up& adjacent) { - i = shortEdgeVerts.begin(); - while (i != shortEdgeVerts.end()) - { + auto start = i; + do { + if (i == shortEdgeVerts.end()) i = shortEdgeVerts.begin(); Entity* vertex = *i; if (getFlag(a, vertex, CHECKED)) {i++; continue;} //Already tried to collapse a->mesh->getUp(vertex, adjacent); @@ -344,7 +345,7 @@ Entity* getTouchingIndependentSet(Adapt* a, std::list& shortEdgeVerts, if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return vertex; //Touching independent set } i++; - } + } while (i != start); clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); independentSetStarted = false; return 0; @@ -357,7 +358,7 @@ std::list getShortEdgeVerts(Adapt* a) Entity* edge; while ((edge = a->mesh->iterate(it))) { - if (!a->sizeField->shouldCollapse(edge)) continue; //TODO: speedup + if (!a->sizeField->shouldCollapse(edge)) continue; Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { @@ -366,7 +367,6 @@ std::list getShortEdgeVerts(Adapt* a) shortEdgeVerts.push_back(vertices[i]); } } - // ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "shortEdges", "shortEdges"); clearListFlag(a, shortEdgeVerts, CHECKED); return shortEdgeVerts; } @@ -386,7 +386,7 @@ bool coarsen(Adapt* a) while (checked < shortEdgeVerts.size()) { apf::Up adjacent; - Entity* vertex = getTouchingIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked, adjacent); + Entity* vertex = getAdjIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked, adjacent); if (vertex == 0) continue; if (collapseShortest(a, collapse, adjacent, vertex)) { flagIndependentSet(a, adjacent, checked); From 98b6f45d4ffd3134d548805cf2ef04f0c1b8b225 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 12 Jun 2025 16:05:22 -0400 Subject: [PATCH 096/319] small base area case --- ma/maSnapper.cc | 24 +++++++++++++++++------- test/aniso_adapt.h | 6 ++++-- 2 files changed, 21 insertions(+), 9 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b012b50fc..28b7ce35d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -339,10 +339,6 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) { - if (FPP->commEdges.n < 2) { - print(mesh->getPCU(), "Swap failed: consider more collapses before swap"); - return false; - } Entity* ents[4]; double area[4]; int bit = getTetStats(adapt, FPP, ents, area); @@ -351,9 +347,23 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) for(int i=1; i<4; i++) if( area[i]getPCU(), "Swap failed: small base area case not implemented"); - return false; + if (area[0]==min) { + Entity* edges[3]; + mesh->getDownward(FPP->problemFace, 1, edges); + Entity* longest = edges[0]; + for (int i=1; i<3; i++) + if (adapt->sizeField->measure(edges[i]) > adapt->sizeField->measure(longest)) + longest = edges[i]; + + if (edgeSwap->run(longest)) { + numSwap++; + return true; + } + + if (splitCollapse.run(longest, FPP->vert, 0)) { + numSplitCollapse++; + return true; + } } // two large dihedral angles -> key problem: two mesh edges diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index e8e94ae47..3505e0340 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -11,6 +11,7 @@ #include "maCoarsen.h" #include "maAdapt.h" #include "maRefine.h" +#include "maShape.h" #include "maSnap.h" class AnIso : public ma::AnisotropicFunction @@ -45,12 +46,13 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - for (int i = 0; i < 2; ++i) + for (int i = 0; i < in->maximumIterations; ++i) { ma::coarsen(a); ma::refine(a); - // ma::snap(a); + ma::snap(a); } + // ma::fixElementShapes(a); m->verify(); apf::writeVtkFiles("after_adapt",m); } \ No newline at end of file From 136b423a0ed329af3bd27d68c1c94b1f568316ad Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 12 Jun 2025 22:17:29 -0400 Subject: [PATCH 097/319] enable split collapse --- ma/maSnapper.cc | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 28b7ce35d..91c7775dc 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -398,10 +398,10 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) return true; } - // if (doubleSplitCollapse.run(ents, 0)) { //TODO: TEST DOUBLE SPLIT COLLAPSE - // numSplitCollapse++; - // return true; - // } + if (doubleSplitCollapse.run(ents, 0)) { + numSplitCollapse++; + return true; + } } print(mesh->getPCU(), "Swap failed: face swap and double split collapse not implemented"); From 49cef8a1472fd84426b41168d83336936671f3b6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 12 Jun 2025 23:20:21 -0400 Subject: [PATCH 098/319] aggressive coarsen --- ma/maCoarsen.cc | 7 ++++++- ma/maCoarsen.h | 2 +- test/aniso_adapt.h | 4 +++- 3 files changed, 10 insertions(+), 3 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index a152e6411..41e65c142 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -371,12 +371,16 @@ std::list getShortEdgeVerts(Adapt* a) return shortEdgeVerts; } -bool coarsen(Adapt* a) +bool coarsen(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; double t0 = pcu::Time(); std::list shortEdgeVerts = getShortEdgeVerts(a); + bool oldShouldForce = a->input->shouldForceAdaptation; + if (aggressive) + a->input->shouldForceAdaptation = true; + Collapse collapse; collapse.Init(a); int success = 0; @@ -402,6 +406,7 @@ bool coarsen(Adapt* a) } clearListFlag(a, shortEdgeVerts, CHECKED); ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + a->input->shouldForceAdaptation = oldShouldForce; double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index b0ebc435e..c8bc5b5f4 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -14,7 +14,7 @@ namespace ma { class Adapt; -bool coarsen(Adapt* a); +bool coarsen(Adapt* a, bool aggressive=false); bool coarsenLayer(Adapt* a); bool coarsenAndPrint(Adapt* a); diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 3505e0340..6ba07ed59 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -46,11 +46,13 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) AnIso sf(m, sizeFactor1, sizeFactor2); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); + + ma::coarsen(a, true); for (int i = 0; i < in->maximumIterations; ++i) { - ma::coarsen(a); ma::refine(a); ma::snap(a); + ma::coarsen(a); } // ma::fixElementShapes(a); m->verify(); From 9aa4b878c5d7dd51e26a9526e2cc18821e7caad6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 13 Jun 2025 21:38:49 -0400 Subject: [PATCH 099/319] fixed base condition --- ma/maCoarsen.cc | 34 +++++++++++++++++----------------- 1 file changed, 17 insertions(+), 17 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 41e65c142..d3846424d 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -329,26 +329,27 @@ void clearListFlag(Adapt* a, std::list list, int flag) } //Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an independent set -Entity* getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& i, bool& independentSetStarted, const int checked, apf::Up& adjacent) +bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& itr, bool& independentSetStarted, const int checked, apf::Up& adjacent) { - auto start = i; + int numItr=0; do { - if (i == shortEdgeVerts.end()) i = shortEdgeVerts.begin(); - Entity* vertex = *i; - if (getFlag(a, vertex, CHECKED)) {i++; continue;} //Already tried to collapse + numItr++; + if (itr == shortEdgeVerts.end()) itr = shortEdgeVerts.begin(); + Entity* vertex = *itr; + if (getFlag(a, vertex, CHECKED)) {itr++; continue;} //Already tried to collapse a->mesh->getUp(vertex, adjacent); - if (!independentSetStarted) return vertex; - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {i++; continue;} //Too close to last collapse + if (!independentSetStarted) return true; + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {itr++; continue;} //Too close to last collapse for (int i=0; i < adjacent.n; i++) { Entity* opposite = getEdgeVertOppositeVert(a->mesh, adjacent.e[i], vertex); - if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return vertex; //Touching independent set + if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return true; //Touching independent set } - i++; - } while (i != start); + itr++; + } while (numItr < shortEdgeVerts.size()); clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); independentSetStarted = false; - return 0; + return false; } std::list getShortEdgeVerts(Adapt* a) @@ -386,21 +387,20 @@ bool coarsen(Adapt* a, bool aggressive) int success = 0; int checked = 0; bool independentSetStarted = false; - std::list::iterator i = shortEdgeVerts.begin(); + std::list::iterator itr = shortEdgeVerts.begin(); while (checked < shortEdgeVerts.size()) { apf::Up adjacent; - Entity* vertex = getAdjIndependentSet(a, shortEdgeVerts, i, independentSetStarted, checked, adjacent); - if (vertex == 0) continue; - if (collapseShortest(a, collapse, adjacent, vertex)) { + if (!getAdjIndependentSet(a, shortEdgeVerts, itr, independentSetStarted, checked, adjacent)) continue; + if (collapseShortest(a, collapse, adjacent, *itr)) { flagIndependentSet(a, adjacent, checked); - i = shortEdgeVerts.erase(i); + itr = shortEdgeVerts.erase(itr); independentSetStarted = true; collapse.destroyOldElements(); success++; } else { - setFlag(a, vertex, CHECKED); + setFlag(a, *itr, CHECKED); checked++; } } From 9a8d56e00fed382b0bd4388671ff06b27721a8fa Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 14 Jun 2025 11:53:11 -0400 Subject: [PATCH 100/319] fix snap bug --- ma/maSnapper.cc | 19 +++++++------------ 1 file changed, 7 insertions(+), 12 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 91c7775dc..aac18179a 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -354,12 +354,11 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) for (int i=1; i<3; i++) if (adapt->sizeField->measure(edges[i]) > adapt->sizeField->measure(longest)) longest = edges[i]; - + if (edgeSwap->run(longest)) { numSwap++; return true; } - if (splitCollapse.run(longest, FPP->vert, 0)) { numSplitCollapse++; return true; @@ -373,12 +372,15 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSwap++; return true; } - for (int i=0; i<2; i++) if (splitCollapse.run(ents[i], FPP->vert, 0)) { //TODO: Select best numSplitCollapse++; return true; } + if (doubleSplitCollapse.run(ents, 0)) { + numSplitCollapse++; + return true; + } } // three large dihedral angles -> key entity: a mesh face else { @@ -390,18 +392,11 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) return true; } } - //TODO: IMPLEMENT FACE SWAP - if (splitCollapse.run(ents[1], FPP->vert, 0)) { numSplitCollapse++; return true; } - - if (doubleSplitCollapse.run(ents, 0)) { - numSplitCollapse++; - return true; - } } print(mesh->getPCU(), "Swap failed: face swap and double split collapse not implemented"); @@ -524,8 +519,8 @@ bool Snapper::tryReduceCommonEdges(FirstProblemPlane* FPP) for (int i=0; i<3; i++) { Entity* pbVert[2]; mesh->getDownward(pbEdges[i], 0, pbVert); - if (pbVert[0] == v1 && pbVert[1] == v2) break; - if (pbVert[1] == v1 && pbVert[0] == v2) break; + if (pbVert[0] == v1 && pbVert[1] == v2) continue; + if (pbVert[1] == v1 && pbVert[0] == v2) continue; for (int j=0; j<2; j++) getBestQualityCollapse(adapt, pbEdges[i], pbVert[j], collapse, best); } From 9f33614648b968c0aa34cde08ecade00919270ac Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 14 Jun 2025 15:52:46 -0400 Subject: [PATCH 101/319] moved snap queue to adapt --- ma/maAdapt.h | 2 ++ ma/maRefine.cc | 2 +- ma/maRefine.h | 1 - ma/maSnap.cc | 21 ++++++++++----------- ma/maSnapper.cc | 6 +++--- 5 files changed, 16 insertions(+), 16 deletions(-) diff --git a/ma/maAdapt.h b/ma/maAdapt.h index 0b7a0324d..335ee79e4 100644 --- a/ma/maAdapt.h +++ b/ma/maAdapt.h @@ -11,6 +11,7 @@ #define MA_ADAPT_H #include "maInput.h" +#include namespace ma { @@ -54,6 +55,7 @@ class Adapt apf::BuildCallback* buildCallback; SizeField* sizeField; SolutionTransfer* solutionTransfer; + std::queue vtxToSnap; Refine* refine; ShapeHandler* shape; int coarsensLeft; diff --git a/ma/maRefine.cc b/ma/maRefine.cc index 1fb055fc7..03e7151d6 100644 --- a/ma/maRefine.cc +++ b/ma/maRefine.cc @@ -134,7 +134,7 @@ void AddVertexToSnap(Refine* r, Entity* vert) int dim = m->getDimension(); int md = m->getModelType(m->toModel(vert)); if (dim == md) return; - r->vtxToSnap.push(vert); + a->vtxToSnap.push(vert); setFlag(a, vert, SNAP); } diff --git a/ma/maRefine.h b/ma/maRefine.h index acca94c8f..7553b9551 100644 --- a/ma/maRefine.h +++ b/ma/maRefine.h @@ -27,7 +27,6 @@ class Refine Tag* numberTag; EntityArray toSplit[4]; apf::DynamicArray newEntities[4]; - std::queue vtxToSnap; bool shouldCollect[4]; }; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index ccd1262a5..90d821cd5 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -846,15 +846,15 @@ bool snapMatchedVerts(Adapt* a, Tag* t, bool isSimple, long& successCount) long tagVertsToSnap(Adapt* a, Tag*& tag) { Mesh* m = a->mesh; - Refine* refine = a->refine; int dim = m->getDimension(); - int notProcessed = refine->vtxToSnap.size(); + int notProcessed = a->vtxToSnap.size(); int owned = 0; + printf("size %d\n", notProcessed); while (notProcessed > 0) { notProcessed--; - Entity* vertex = refine->vtxToSnap.front(); - refine->vtxToSnap.pop(); + Entity* vertex = a->vtxToSnap.front(); + a->vtxToSnap.pop(); PCU_ALWAYS_ASSERT(getFlag(a, vertex, SNAP)); Vector target; @@ -868,7 +868,7 @@ long tagVertsToSnap(Adapt* a, Tag*& tag) m->setDoubleTag(vertex, tag, &target[0]); if (m->isOwned(vertex)) ++owned; - refine->vtxToSnap.push(vertex); + a->vtxToSnap.push(vertex); } return m->getPCU()->Add(owned); } @@ -913,21 +913,20 @@ long snapTaggedVerts(Adapt* a, Tag* tag) void trySnapping(Adapt* a, Snapper& snapper) { - std::queue* vtxToSnap = &a->refine->vtxToSnap; bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; //Allows quality to decrease from snapping - while (vtxToSnap->size() > 0) + while (a->vtxToSnap.size() > 0) { - Entity* vertex = vtxToSnap->front(); - vtxToSnap->pop(); + Entity* vertex = a->vtxToSnap.front(); + a->vtxToSnap.pop(); snapper.setVert(vertex); if (snapper.run() && getFlag(a, vertex, SNAP)) - vtxToSnap->push(vertex); + a->vtxToSnap.push(vertex); } a->input->shouldForceAdaptation = shouldForce; - a->refine->vtxToSnap = {}; + a->vtxToSnap = {}; } void snap(Adapt* a) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index aac18179a..337e19d79 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -381,6 +381,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSplitCollapse++; return true; } + print(mesh->getPCU(), "Swap failed: Consider better swap/spltClps"); } // three large dihedral angles -> key entity: a mesh face else { @@ -397,9 +398,8 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSplitCollapse++; return true; } + print(mesh->getPCU(), "Swap failed: face swap not implemented"); } - - print(mesh->getPCU(), "Swap failed: face swap and double split collapse not implemented"); return false; } @@ -627,7 +627,7 @@ bool Snapper::run() FirstProblemPlane* FPP = getFPP(adapt, vert, snapTag, invalid); if (!success) success = tryCollapseToVertex(FPP); - // if (!success) success = tryReduceCommonEdges(FPP); + if (!success) success = tryReduceCommonEdges(FPP); if (!success) success = tryCollapseTetEdges(FPP); if (!success) success = trySwapOrSplit(FPP); From 50df0263fb89b222d751bf80d311dcf35db080f5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 14 Jun 2025 16:25:47 -0400 Subject: [PATCH 102/319] fixed splt-collapse snap bug --- ma/maRefine.cc | 13 +++---------- ma/maSnap.cc | 8 +++----- 2 files changed, 6 insertions(+), 15 deletions(-) diff --git a/ma/maRefine.cc b/ma/maRefine.cc index 03e7151d6..4e2b72a94 100644 --- a/ma/maRefine.cc +++ b/ma/maRefine.cc @@ -129,13 +129,12 @@ Refine::~Refine() void AddVertexToSnap(Refine* r, Entity* vert) { - Adapt* a = r->adapt; - Mesh* m = a->mesh; + Mesh* m = r->adapt->mesh; int dim = m->getDimension(); int md = m->getModelType(m->toModel(vert)); if (dim == md) return; - a->vtxToSnap.push(vert); - setFlag(a, vert, SNAP); + r->adapt->vtxToSnap.push(vert); + setFlag(r->adapt, vert, SNAP); } Entity* makeSplitVert(Refine* r, Entity* edge) @@ -150,12 +149,6 @@ Entity* makeSplitVert(Refine* r, Entity* edge) apf::MeshElement* me = apf::createMeshElement(m,edge); Vector point; apf::mapLocalToGlobal(me,xi,point); - - // Vector failed(-0.279880, -0.093306, 0.132892); - // if (apf::areClose(point, failed, 1e-5)){ - // printf("===FAILED FOUND\n"); - // } - Vector param(0,0,0); //prevents uninitialized values if (a->input->shouldTransferParametric) transferParametricOnEdgeSplit(m,edge,0.5,param); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 90d821cd5..dbfd58590 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -849,19 +849,17 @@ long tagVertsToSnap(Adapt* a, Tag*& tag) int dim = m->getDimension(); int notProcessed = a->vtxToSnap.size(); int owned = 0; - printf("size %d\n", notProcessed); while (notProcessed > 0) { notProcessed--; Entity* vertex = a->vtxToSnap.front(); a->vtxToSnap.pop(); - PCU_ALWAYS_ASSERT(getFlag(a, vertex, SNAP)); - + if (!getFlag(a, vertex, SNAP)) //This means the vertex was deleted + continue; Vector target; getSnapPoint(m, vertex, target); Vector prev = getPosition(m, vertex); - if (apf::areClose(prev, target, 1e-12)) - { + if (apf::areClose(prev, target, 1e-12)) { clearFlag(a, vertex, SNAP); continue; } From 4e8b0f8ecd9895a683246682e79b61dc3349da97 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Mon, 16 Jun 2025 19:06:32 -0400 Subject: [PATCH 103/319] better snap warnings --- ma/maSnapper.cc | 21 ++++++++++++--------- 1 file changed, 12 insertions(+), 9 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 337e19d79..938823964 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -332,14 +332,14 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double break; } default: - PCU_ALWAYS_ASSERT(false); //TODO: ADD ERROR + print(a->mesh->getPCU(), "Swap warning: This swap/splt may not work consider more collapses"); } return bit; } bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) { - Entity* ents[4]; + Entity* ents[4] = {0}; double area[4]; int bit = getTetStats(adapt, FPP, ents, area); @@ -365,15 +365,18 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) } } + if (ents[0] == 0) + return false; + // two large dihedral angles -> key problem: two mesh edges if (bit==3 || bit==5 || bit==6) { for (int i=0; i<2; i++) - if (edgeSwap->run(ents[i])) { //TODO: Select best + if (edgeSwap->run(ents[i])) { numSwap++; return true; } for (int i=0; i<2; i++) - if (splitCollapse.run(ents[i], FPP->vert, 0)) { //TODO: Select best + if (splitCollapse.run(ents[i], FPP->vert, 0)) { numSplitCollapse++; return true; } @@ -381,19 +384,19 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSplitCollapse++; return true; } - print(mesh->getPCU(), "Swap failed: Consider better swap/spltClps"); + print(mesh->getPCU(), "Swap failed: Consider more collapses"); } // three large dihedral angles -> key entity: a mesh face else { Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); for (int i=0; i<3; i++) { - if (edgeSwap->run(edges[i])) { //TODO: Select best + if (edgeSwap->run(edges[i])) { numSwap++; return true; } } - //TODO: IMPLEMENT FACE SWAP + //TODO: RUN FACE SWAP HERE if (splitCollapse.run(ents[1], FPP->vert, 0)) { numSplitCollapse++; return true; @@ -414,7 +417,7 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo() && - collapse.tryBothDirections(0)) { + collapse.tryBothDirections(a->input->validQuality)) { collapse.destroyOldElements(); result = true; } @@ -437,7 +440,7 @@ static void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collaps if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo()) { collapse.computeElementSets(); - if (collapse.tryThisDirectionNoCancel(0) && collapse.edgesGoodSize()) { + if (collapse.tryThisDirectionNoCancel(a->input->validQuality) && collapse.edgesGoodSize()) { double quality = getWorstQuality(a, collapse.newElements); if (quality > best.quality) { best.quality = quality; From 995290a3acd8964626374aa4c29b0a76b1879b80 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 18 Jun 2025 13:50:59 -0400 Subject: [PATCH 104/319] using old coarsen --- ma/maCoarsen.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index d3846424d..3a1dc0475 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -229,7 +229,7 @@ long markEdgesToCollapse(Adapt* a) DONT_COLLAPSE | NEED_NOT_COLLAPSE); } -bool oldcoarsen(Adapt* a) +bool coarsen(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; @@ -372,7 +372,7 @@ std::list getShortEdgeVerts(Adapt* a) return shortEdgeVerts; } -bool coarsen(Adapt* a, bool aggressive) +bool newcoarsen(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; From ba9dba12735ed6215b1bd3d9bc3316a3036bba4a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 19 Jun 2025 12:03:44 -0400 Subject: [PATCH 105/319] fixed coarsen bug --- ma/maCoarsen.cc | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 3a1dc0475..65c4389ac 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -229,7 +229,7 @@ long markEdgesToCollapse(Adapt* a) DONT_COLLAPSE | NEED_NOT_COLLAPSE); } -bool coarsen(Adapt* a, bool aggressive) +bool oldcoarsen(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; @@ -264,11 +264,14 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + double quality = a->input->shouldForceAdaptation ? a->input->validQuality + : a->input->goodQuality; + bool result = false; if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo() && - collapse.tryBothDirections(a->input->goodQuality)) { + collapse.tryBothDirections(quality)) { if (collapse.edgeGrewPastMaxLength()) { result = false; collapse.cancel(); @@ -372,7 +375,7 @@ std::list getShortEdgeVerts(Adapt* a) return shortEdgeVerts; } -bool newcoarsen(Adapt* a, bool aggressive) +bool coarsen(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; From 45672e388f2c27dc4459cddb9e96c5bfd2c55a6c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 19 Jun 2025 15:10:51 -0400 Subject: [PATCH 106/319] combined collapse shortest --- ma/maCoarsen.cc | 55 ++++++++++++++++++++++++++----------------------- 1 file changed, 29 insertions(+), 26 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 65c4389ac..8fd562425 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -282,6 +282,22 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll return result; } +//Prevent adjacent vertices from collapsing to create indepedent set +void flagIndependentSet(Adapt* a, apf::Up& adjacent, int& checked) +{ + for (int adj=0; adj < adjacent.n; adj++) { + Entity* vertices[2]; + a->mesh->getDownward(adjacent.e[adj],0, vertices); + for (int v = 0; v < 2; v++) { + setFlag(a, vertices[v], NEED_NOT_COLLAPSE); + if (getFlag(a, vertices[v], CHECKED)){ + clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set + checked--; + } + } + } +} + struct EdgeLength { Entity* edge; @@ -291,37 +307,28 @@ struct EdgeLength } }; -bool collapseShortest(Adapt* a, Collapse& collapse, apf::Up& adjacent, Entity* vertex) +bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, int& checked, apf::Up& adjacent) { + Entity* vertex = *itr; std::vector sorted; for (int i=0; i < adjacent.n; i++) { EdgeLength measured{adjacent.e[i], a->sizeField->measure(adjacent.e[i])}; auto pos = std::lower_bound(sorted.begin(), sorted.end(), measured); sorted.insert(pos, measured); } + bool collapsed = false; for (int i=0; i < sorted.size(); i++) { Entity* edge = sorted[i].edge; - if (!a->sizeField->shouldCollapse(edge)) return false; + if (!a->sizeField->shouldCollapse(edge)) break; Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, edge, vertex); - if (tryCollapseEdge(a, edge, keepVertex, collapse)) return true; + if (tryCollapseEdge(a, edge, keepVertex, collapse)) { collapsed = true; break; } } - return false; -} - -//Prevent adjacent vertices from collapsing to create indepedent set -void flagIndependentSet(Adapt* a, apf::Up& adjacent, int& checked) -{ - for (int adj=0; adj < adjacent.n; adj++) { - Entity* vertices[2]; - a->mesh->getDownward(adjacent.e[adj],0, vertices); - for (int v = 0; v < 2; v++) { - setFlag(a, vertices[v], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[v], CHECKED)){ - clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set - checked--; - } - } + if (collapsed) { + flagIndependentSet(a, adjacent, checked); + itr = shortEdgeVerts.erase(itr); + collapse.destroyOldElements(); } + return collapsed; } void clearListFlag(Adapt* a, std::list list, int flag) @@ -395,11 +402,8 @@ bool coarsen(Adapt* a, bool aggressive) { apf::Up adjacent; if (!getAdjIndependentSet(a, shortEdgeVerts, itr, independentSetStarted, checked, adjacent)) continue; - if (collapseShortest(a, collapse, adjacent, *itr)) { - flagIndependentSet(a, adjacent, checked); - itr = shortEdgeVerts.erase(itr); - independentSetStarted = true; - collapse.destroyOldElements(); + if (collapseShortest(a, collapse, shortEdgeVerts, itr, checked, adjacent)) { + independentSetStarted=true; success++; } else { @@ -407,8 +411,7 @@ bool coarsen(Adapt* a, bool aggressive) checked++; } } - clearListFlag(a, shortEdgeVerts, CHECKED); - ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE | CHECKED, 0); a->input->shouldForceAdaptation = oldShouldForce; double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); From bf420a97823b204a2956db5deacc45a22465e454 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 19 Jun 2025 19:53:58 -0400 Subject: [PATCH 107/319] small performance fix --- ma/maCoarsen.cc | 23 +++++++++++------------ 1 file changed, 11 insertions(+), 12 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 8fd562425..6667e3897 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -313,22 +313,25 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg std::vector sorted; for (int i=0; i < adjacent.n; i++) { EdgeLength measured{adjacent.e[i], a->sizeField->measure(adjacent.e[i])}; + if (measured.length > MINLENGTH) continue; auto pos = std::lower_bound(sorted.begin(), sorted.end(), measured); sorted.insert(pos, measured); } - bool collapsed = false; - for (int i=0; i < sorted.size(); i++) { - Entity* edge = sorted[i].edge; - if (!a->sizeField->shouldCollapse(edge)) break; - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, edge, vertex); - if (tryCollapseEdge(a, edge, keepVertex, collapse)) { collapsed = true; break; } + if (sorted.size() == 0) { //performance optimization, will rarely result in a missed edge + itr = shortEdgeVerts.erase(itr); + return false; } - if (collapsed) { + for (int i=0; i < sorted.size(); i++) { + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); + if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse)) continue; flagIndependentSet(a, adjacent, checked); itr = shortEdgeVerts.erase(itr); collapse.destroyOldElements(); + return true; } - return collapsed; + setFlag(a, vertex, CHECKED); + checked++; + return false; } void clearListFlag(Adapt* a, std::list list, int flag) @@ -406,10 +409,6 @@ bool coarsen(Adapt* a, bool aggressive) independentSetStarted=true; success++; } - else { - setFlag(a, *itr, CHECKED); - checked++; - } } ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE | CHECKED, 0); a->input->shouldForceAdaptation = oldShouldForce; From 5132e3479bed5597e2b7d05b691fad175e0462c7 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 25 Jun 2025 19:08:41 -0400 Subject: [PATCH 108/319] run multiple coarsen once --- ma/ma.cc | 5 ++- ma/maCoarsen.cc | 4 +- ma/maCoarsen.h | 1 + ma/maSnapper.cc | 12 +++--- test/CMakeLists.txt | 1 - test/aniso_adapt.h | 4 +- test/coarsen.cc | 103 -------------------------------------------- 7 files changed, 14 insertions(+), 116 deletions(-) delete mode 100644 test/coarsen.cc diff --git a/ma/ma.cc b/ma/ma.cc index b1aa8c3f9..c770478f7 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,14 +27,15 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); + coarsenMultiple(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); - coarsen(a); - coarsenLayer(a); midBalance(a); refine(a); snap(a); + coarsen(a); + coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); fixElementShapes(a); diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 6667e3897..54c554ae4 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -229,7 +229,7 @@ long markEdgesToCollapse(Adapt* a) DONT_COLLAPSE | NEED_NOT_COLLAPSE); } -bool oldcoarsen(Adapt* a, bool aggressive) +bool coarsen(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; @@ -385,7 +385,7 @@ std::list getShortEdgeVerts(Adapt* a) return shortEdgeVerts; } -bool coarsen(Adapt* a, bool aggressive) +bool coarsenMultiple(Adapt* a, bool aggressive) { if (!a->input->shouldCoarsen) return false; diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index c8bc5b5f4..8af51122c 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -14,6 +14,7 @@ namespace ma { class Adapt; +bool coarsenMultiple(Adapt* a, bool aggressive=false); bool coarsen(Adapt* a, bool aggressive=false); bool coarsenLayer(Adapt* a); bool coarsenAndPrint(Adapt* a); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 938823964..9da6cbec4 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -390,12 +390,12 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) else { Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); - for (int i=0; i<3; i++) { - if (edgeSwap->run(edges[i])) { - numSwap++; - return true; - } - } + // for (int i=0; i<3; i++) { + // if (edgeSwap->run(edges[i])) { + // numSwap++; + // return true; + // } + // } //TODO: RUN FACE SWAP HERE if (splitCollapse.run(ents[1], FPP->vert, 0)) { numSplitCollapse++; diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 99823a016..d5a12a86a 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -178,7 +178,6 @@ test_exe_func(newdim newdim.cc) test_exe_func(construct construct.cc) test_exe_func(constructThenGhost constructThenGhost.cc) test_exe_func(construct_bottom_up construct_bottom_up.cc) -test_exe_func(coarsen coarsen.cc) test_exe_func(embedded_edges embedded_edges.cc) test_exe_func(test_scaling test_scaling.cc) test_exe_func(mixedNumbering mixedNumbering.cc) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 6ba07ed59..fef6dc755 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -47,12 +47,12 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - ma::coarsen(a, true); + ma::coarsenMultiple(a, true); for (int i = 0; i < in->maximumIterations; ++i) { ma::refine(a); ma::snap(a); - ma::coarsen(a); + ma::coarsenMultiple(a); } // ma::fixElementShapes(a); m->verify(); diff --git a/test/coarsen.cc b/test/coarsen.cc deleted file mode 100644 index be359f83a..000000000 --- a/test/coarsen.cc +++ /dev/null @@ -1,103 +0,0 @@ -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include "maAdapt.h" -#include "maCoarsen.h" -#include "apfShape.h" - -double vtx_coords[6][3] = { - {1.0, 0.0, 0.0}, - {1.0, 0.5, 0.0}, - {1.0, 1.0, 0.0}, - {0.5, 0.5, 0.0}, - {0.0, 0.0, 0.0}, - {0.0, 1.0, 0.0} -}; - -apf::Gid triangles[5][3] = { - {0, 1, 3}, - {1, 2, 3}, - {0, 3, 4}, - {3, 2, 5}, - {3, 5, 4}, -}; - -class AnIso : public ma::AnisotropicFunction -{ - public: - AnIso(ma::Mesh* m, double sf1, double sf2) : - mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) - { - average = ma::getAverageEdgeLength(m); - ma::getBoundingBox(m, lower, upper); - } - virtual void getValue(ma::Entity*, ma::Matrix& R, ma::Vector& H) - { - double h = average/sizeFactor1; - H = ma::Vector(h, h, h/sizeFactor2); - R = ma::Matrix( - 1.0, 0.0, 0.0, - 0.0, 1.0, 0.0, - 0.0, 0.0, 1.0 - ); - } - private: - ma::Mesh* mesh; - double sizeFactor1, sizeFactor2, average; - ma::Vector lower, upper; -}; - - -int main(int argc, char** argv) -{ - MPI_Init(&argc,&argv); - { - pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); - lion_set_verbosity(1); - gmi_register_mesh(); - gmi_register_null(); - - apf::Gid* conn = &triangles[0][0]; - double* coords = &vtx_coords[0][0]; - - int nelem=5; - int etype=2; - int nverts=6; - int dim=2; - - //Create mesh - gmi_model* model = gmi_load(".null"); - apf::Mesh2* m = apf::makeEmptyMdsMesh(model, dim, false, &PCUObj); - apf::GlobalToVert outMap; - apf::construct(m, conn, nelem, etype, outMap); - apf::alignMdsRemotes(m); - apf::deriveMdsModel(m); - apf::setCoords(m, coords, nverts, outMap); - outMap.clear(); - m->verify(); - apf::writeVtkFiles("before_coarsen", m); - - //Coarsen - AnIso sf(m, 0.7, 1); - ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); - in->maximumIterations = 1; - in->shouldCoarsen = true; - validateInput(in); - ma::Adapt* a = new ma::Adapt(in); - coarsen(a); - m->verify(); - - apf::writeVtkFiles("after_coarsen", m, 1); - - m->destroyNative(); - apf::destroyMesh(m); - } - MPI_Finalize(); -} - From ef38ec5cace424a056d5b0aa60e968496de03b2e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 26 Jun 2025 12:17:05 -0400 Subject: [PATCH 109/319] reduced min size --- ma/maSize.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maSize.h b/ma/maSize.h index f1358cb51..f83021a30 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -20,7 +20,7 @@ namespace ma { typedef apf::Matrix3x3 Matrix; const double MAXLENGTH = 1.5; -const double MINLENGTH = .75; +const double MINLENGTH = .5; class SizeField { From 08c63d47a2286e5f18825c45157a395dacdaf1f7 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 27 Jun 2025 13:15:11 -0400 Subject: [PATCH 110/319] single step coarsen --- ma/ma.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/ma.cc b/ma/ma.cc index c770478f7..b831237db 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,7 +27,7 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsenMultiple(a); + // coarsenMultiple(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); From 7d9b960048bd2c68c33e6b6a3d777814a274cdcf Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 27 Jun 2025 13:29:44 -0400 Subject: [PATCH 111/319] multiple step coarsen --- ma/ma.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/ma.cc b/ma/ma.cc index b831237db..f751b2d5b 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -34,7 +34,7 @@ void adapt(Input* in) midBalance(a); refine(a); snap(a); - coarsen(a); + coarsenMultiple(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); From ff096dc45aeb9307de8b92e02804c0cb85b51718 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 27 Jun 2025 13:34:24 -0400 Subject: [PATCH 112/319] coarsen multiple --- ma/ma.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/ma.cc b/ma/ma.cc index f751b2d5b..4b8102136 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,7 +27,7 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - // coarsenMultiple(a); + coarsenMultiple(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); From 25aa8b2b6748d5971ee70dd29629ce24fd7f946b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 27 Jun 2025 13:35:52 -0400 Subject: [PATCH 113/319] single step coarsen --- ma/ma.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 4b8102136..97c80456e 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,14 +27,14 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsenMultiple(a); + coarsen(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); midBalance(a); refine(a); snap(a); - coarsenMultiple(a); + coarsen(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); From 541e88048a6c264189decf4cbf4d0e99cef6fabd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 27 Jun 2025 17:48:37 -0400 Subject: [PATCH 114/319] cache length --- ma/ma.cc | 4 ++-- ma/maCoarsen.cc | 30 ++++++++++++++++++++++++------ 2 files changed, 26 insertions(+), 8 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 97c80456e..4b8102136 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,14 +27,14 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsen(a); + coarsenMultiple(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); midBalance(a); refine(a); snap(a); - coarsen(a); + coarsenMultiple(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 54c554ae4..529900d86 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -257,6 +257,20 @@ bool coarsen(Adapt* a, bool aggressive) return true; } +static double getLength(Adapt* a, Tag* lengthTag, Entity* edge) +{ + double length = 0; + length = a->sizeField->measure(edge); + if (a->mesh->hasTag(edge, lengthTag)) + a->mesh->getDoubleTag(edge, lengthTag, &length); + else { + length = a->sizeField->measure(edge); + a->mesh->setDoubleTag(edge, lengthTag, &length); + } + return length; + +} + static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); @@ -307,12 +321,13 @@ struct EdgeLength } }; -bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, int& checked, apf::Up& adjacent) +bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, int& checked, apf::Up& adjacent, Tag* lengthTag) { Entity* vertex = *itr; std::vector sorted; for (int i=0; i < adjacent.n; i++) { - EdgeLength measured{adjacent.e[i], a->sizeField->measure(adjacent.e[i])}; + double length = getLength(a, lengthTag, adjacent.e[i]); + EdgeLength measured{adjacent.e[i], length}; if (measured.length > MINLENGTH) continue; auto pos = std::lower_bound(sorted.begin(), sorted.end(), measured); sorted.insert(pos, measured); @@ -365,14 +380,15 @@ bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::lis return false; } -std::list getShortEdgeVerts(Adapt* a) +std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) { std::list shortEdgeVerts; Iterator* it = a->mesh->begin(1); Entity* edge; while ((edge = a->mesh->iterate(it))) { - if (!a->sizeField->shouldCollapse(edge)) continue; + double length = getLength(a, lengthTag, edge); + if (length > MINLENGTH) continue; Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { @@ -390,7 +406,8 @@ bool coarsenMultiple(Adapt* a, bool aggressive) if (!a->input->shouldCoarsen) return false; double t0 = pcu::Time(); - std::list shortEdgeVerts = getShortEdgeVerts(a); + Tag* lengthTag = a->mesh->createDoubleTag("edge_length", 1); + std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); bool oldShouldForce = a->input->shouldForceAdaptation; if (aggressive) a->input->shouldForceAdaptation = true; @@ -405,13 +422,14 @@ bool coarsenMultiple(Adapt* a, bool aggressive) { apf::Up adjacent; if (!getAdjIndependentSet(a, shortEdgeVerts, itr, independentSetStarted, checked, adjacent)) continue; - if (collapseShortest(a, collapse, shortEdgeVerts, itr, checked, adjacent)) { + if (collapseShortest(a, collapse, shortEdgeVerts, itr, checked, adjacent, lengthTag)) { independentSetStarted=true; success++; } } ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE | CHECKED, 0); a->input->shouldForceAdaptation = oldShouldForce; + a->mesh->destroyTag(lengthTag); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); return true; From a4efa3ad59272b02ae7cd95efc6e9d709eb19806 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Tue, 1 Jul 2025 09:56:53 -0400 Subject: [PATCH 115/319] check collapse size check --- ma/maCoarsen.cc | 24 +++++++++++++++++------- 1 file changed, 17 insertions(+), 7 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 529900d86..475d79c42 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -271,7 +271,20 @@ static double getLength(Adapt* a, Tag* lengthTag, Entity* edge) } -static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse) +bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent) +{ + Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vertex); + for (int i=0; imesh, adjacent.e[i], vCollapse)}; + Entity* newEdge = a->mesh->createEntity(apf::Mesh::EDGE, 0, newEdgeVerts); + double length = a->sizeField->measure(newEdge); + destroyElement(a, newEdge); + if (length > MAXLENGTH) return false; + } + return true; +} + +static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); bool alreadyFlagged = true; @@ -285,12 +298,9 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll if (collapse.setEdge(edge) && collapse.checkClass() && collapse.checkTopo() && + collapseSizeCheck(a, keep, edge, adjacent) && collapse.tryBothDirections(quality)) { - if (collapse.edgeGrewPastMaxLength()) { - result = false; - collapse.cancel(); - } - else result = true; + result = true; } if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); return result; @@ -338,7 +348,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg } for (int i=0; i < sorted.size(); i++) { Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); - if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse)) continue; + if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; flagIndependentSet(a, adjacent, checked); itr = shortEdgeVerts.erase(itr); collapse.destroyOldElements(); From 13b8cc0229ef765ddd0f7197bc80c225ce7f7b60 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 2 Jul 2025 16:23:44 -0400 Subject: [PATCH 116/319] remove cap adapt --- ma/ma.cc | 2 +- test/aniso_adapt_cap.cc | 146 ---------------------------------------- 2 files changed, 1 insertion(+), 147 deletions(-) delete mode 100644 test/aniso_adapt_cap.cc diff --git a/ma/ma.cc b/ma/ma.cc index 4b8102136..c770478f7 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -34,7 +34,7 @@ void adapt(Input* in) midBalance(a); refine(a); snap(a); - coarsenMultiple(a); + coarsen(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc deleted file mode 100644 index f20c811a5..000000000 --- a/test/aniso_adapt_cap.cc +++ /dev/null @@ -1,146 +0,0 @@ -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include "maAdapt.h" -#include "maCoarsen.h" -#include "maRefine.h" -#include "maSnap.h" -#include "lionPrint.h" -#include "aniso_adapt.h" - -#include "CapstoneModule.h" -#include "CreateMG_Framework_Core.h" -#include "CreateMG_Framework_Analysis.h" -#include "CreateMG_Framework_Application.h" -#include "CreateMG_Framework_Attributes.h" -#include "CreateMG_Framework_Core.h" -#include "CreateMG_Framework_Geometry.h" -#include "CreateMG_Framework_Mesh.h" - -using namespace CreateMG; -using namespace CreateMG::Attribution; -using namespace CreateMG::Mesh; -using namespace CreateMG::Geometry; - -int main(int argc, char** argv) -{ - MPI_Init(&argc, &argv); - { - pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); - - if (argc < 2) { - if(PCUObj.Self()==0) - std::cerr << "usage: " << argv[0] - << " <.cre file> or\n" - << " <.smb file> \n"; - return EXIT_FAILURE; - } - - - gmi_register_mesh(); - gmi_register_null(); - - const char* meshFile = argv[1]; - // load capstone mesh - // create an instance of the Capstone Module activating CREATE/CREATE/CREATE - // for the Geometry/Mesh/Attribution databases - /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ - const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD - const std::string mdbName("Mesh Database : Create"); - const std::string adbName("Attribution Database : Create"); - - CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); - - GeometryDatabaseInterface *g = cs.get_geometry(); - MeshDatabaseInterface *m = cs.get_mesh(); - AppContext *c = cs.get_context(); - - PCU_ALWAYS_ASSERT(g); - PCU_ALWAYS_ASSERT(m); - PCU_ALWAYS_ASSERT(c); - - v_string filenames; - filenames.push_back(meshFile); - - M_GModel gmodel = cs.load_files(filenames); - - int numbreps = 0; - MG_CALL(g->get_num_breps(numbreps)); - std::cout << "number of b reps is " << numbreps << std::endl; - if(numbreps == 0) - error(HERE, ERR_INVALID_INPUT, "Model is empty"); - - M_MModel mmodel; - // Pick the volume mesh model from associated mesh models to this geom model - std::vector mmodels; - MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); - for(std::size_t i = 0; i < mmodels.size(); ++i) - { - M_MModel ammodel = mmodels[i]; - std::size_t numregs = 0; - std::size_t numfaces = 0; - std::size_t numedges = 0; - std::size_t numverts = 0; - MG_API_CALL(m, set_current_model(ammodel)); - MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); - MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); - MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); - MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); - std::cout << "num regions is " << numregs << std::endl; - std::cout << "num faces is " << numfaces << std::endl; - std::cout << "num edges is " << numedges << std::endl; - std::cout << "num verts is " << numverts << std::endl; - std::cout << "-----------" << std::endl; - if(numregs > 0) - { - mmodel = ammodel; - break; - } - } - - /* SET THE ADJACENCIES */ - MG_API_CALL(m, set_adjacency_state(REGION2FACE| - REGION2EDGE| - REGION2VERTEX| - FACE2EDGE| - FACE2VERTEX)); - MG_API_CALL(m, set_reverse_states()); - MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); - MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); - MG_API_CALL(m, compute_adjacency()); - - gmi_cap_start(); - gmi_register_cap(); - - // convert the mesh to apf/mds mesh - - apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); - lion_set_verbosity(1); - - //Adapt - refineSnapTest(mesh, 2, 1); - - gmi_cap_stop(); - } - MPI_Finalize(); -} From 9b8244482301fac24f27184f542731646156dcfe Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 2 Jul 2025 16:47:19 -0400 Subject: [PATCH 117/319] fix compile error --- test/CMakeLists.txt | 1 - 1 file changed, 1 deletion(-) diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 72034e2be..d2630398c 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -176,7 +176,6 @@ test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) test_exe_func(aniso_adapt_sim aniso_adapt_sim.cc) -test_exe_func(aniso_adapt_cap aniso_adapt_cap.cc) test_exe_func(torus_ma_test torus_ma_test.cc) test_exe_func(dg_ma_test dg_ma_test.cc) test_exe_func(prismCodeMatch ../ma/prismCodeMatch.cc) From 19aee8ea24f56f4f3b380afa26b5e7bea615415d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 2 Jul 2025 19:58:13 -0400 Subject: [PATCH 118/319] single coarsen --- ma/ma.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/ma.cc b/ma/ma.cc index c770478f7..97c80456e 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,7 +27,7 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsenMultiple(a); + coarsen(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); From 827e7bda8f45de028b74cd26f257275ee805dee2 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 3 Jul 2025 15:29:44 -0400 Subject: [PATCH 119/319] fixed snap bug --- ma/maAdapt.h | 1 - ma/maRefine.cc | 11 ---- ma/maSnap.cc | 143 +++++++++++++----------------------------------- ma/maSnapper.cc | 8 +-- 4 files changed, 42 insertions(+), 121 deletions(-) diff --git a/ma/maAdapt.h b/ma/maAdapt.h index 335ee79e4..e4daa9246 100644 --- a/ma/maAdapt.h +++ b/ma/maAdapt.h @@ -55,7 +55,6 @@ class Adapt apf::BuildCallback* buildCallback; SizeField* sizeField; SolutionTransfer* solutionTransfer; - std::queue vtxToSnap; Refine* refine; ShapeHandler* shape; int coarsensLeft; diff --git a/ma/maRefine.cc b/ma/maRefine.cc index 4e2b72a94..10dea7d95 100644 --- a/ma/maRefine.cc +++ b/ma/maRefine.cc @@ -127,16 +127,6 @@ Refine::~Refine() m->destroyTag(numberTag); } -void AddVertexToSnap(Refine* r, Entity* vert) -{ - Mesh* m = r->adapt->mesh; - int dim = m->getDimension(); - int md = m->getModelType(m->toModel(vert)); - if (dim == md) return; - r->adapt->vtxToSnap.push(vert); - setFlag(r->adapt, vert, SNAP); -} - Entity* makeSplitVert(Refine* r, Entity* edge) { Adapt* a = r->adapt; @@ -155,7 +145,6 @@ Entity* makeSplitVert(Refine* r, Entity* edge) if (a->input->shouldTransferToClosestPoint) transferToClosestPointOnEdgeSplit(m,edge,0.5,param); Entity* vert = buildVertex(a,c,point,param); - AddVertexToSnap(r, vert); st->onVertex(me,xi,vert); sf->interpolate(me,xi,vert); apf::destroyMeshElement(me); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index dbfd58590..42108c260 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -745,12 +745,11 @@ static void getSnapPoint(Mesh* m, Entity* v, Vector& x) class SnapAll : public Operator { public: - SnapAll(Adapt* a, Tag* t, bool simple): - snapper(a, t, simple) + SnapAll(Adapt* a, Tag* t, Snapper& snapperIn) { adapter = a; tag = t; - successCount = 0; + snapper = &snapperIn; didAnything = false; vert = 0; } @@ -760,20 +759,17 @@ class SnapAll : public Operator if ( ! getFlag(adapter, e, SNAP)) return false; vert = e; - snapper.setVert(e); + snapper->setVert(e); return true; } bool requestLocality(apf::CavityOp* o) { - return snapper.requestLocality(o); + return snapper->requestLocality(o); } void apply() { - bool snapped = snapper.run(); + bool snapped = snapper->run(); didAnything = didAnything || snapped; - if (snapped) - ++successCount; - clearFlag(adapter, vert, SNAP); } int successCount; bool didAnything; @@ -781,14 +777,13 @@ class SnapAll : public Operator Adapt* adapter; Tag* tag; Entity* vert; - Snapper snapper; + Snapper* snapper; }; -bool snapAllVerts(Adapt* a, Tag* t, bool isSimple, long& successCount) +bool snapAllVerts(Adapt* a, Tag* t, Snapper& snapper) { - SnapAll op(a, t, isSimple); + SnapAll op(a, t, snapper); applyOperator(a, &op); - successCount += a->mesh->getPCU()->Add(op.successCount); return a->mesh->getPCU()->Or(op.didAnything); } @@ -847,84 +842,44 @@ long tagVertsToSnap(Adapt* a, Tag*& tag) { Mesh* m = a->mesh; int dim = m->getDimension(); - int notProcessed = a->vtxToSnap.size(); - int owned = 0; - while (notProcessed > 0) - { - notProcessed--; - Entity* vertex = a->vtxToSnap.front(); - a->vtxToSnap.pop(); - if (!getFlag(a, vertex, SNAP)) //This means the vertex was deleted + Entity* v; + long n = 0; + Iterator* it = m->begin(0); + while ((v = m->iterate(it))) { + int md = m->getModelType(m->toModel(v)); + if (dim == 3 && md == 3) continue; - Vector target; - getSnapPoint(m, vertex, target); - Vector prev = getPosition(m, vertex); - if (apf::areClose(prev, target, 1e-12)) { - clearFlag(a, vertex, SNAP); + Vector s; + getSnapPoint(m, v, s); + Vector x = getPosition(m, v); + if (apf::areClose(s, x, 1e-12)) continue; - } - m->setDoubleTag(vertex, tag, &target[0]); - if (m->isOwned(vertex)) - ++owned; - a->vtxToSnap.push(vertex); + m->setDoubleTag(v, tag, &s[0]); + setFlag(a, v, SNAP); + if (m->isOwned(v)) + ++n; } - return m->getPCU()->Add(owned); + m->end(it); + return m->getPCU()->Add(n); } -static void markVertsToSnap(Adapt* a, Tag* t) -{ - HasTag p(a->mesh, t); - markEntities(a, 0, p, SNAP, DONT_SNAP); -} - -bool snapOneRound(Adapt* a, Tag* t, bool isSimple, long& successCount) -{ - markVertsToSnap(a, t); - if (a->mesh->hasMatching()) - return snapMatchedVerts(a, t, isSimple, successCount); - else - return snapAllVerts(a, t, isSimple, successCount); -} - -long snapTaggedVerts(Adapt* a, Tag* tag) -{ - long successCount = 0; - /* there are two approaches possible here: - * 1- first snap all the vertices we can without any additional - * operation such as digging (simple snap). And then try snapping - * the remaining vertices that will need extra modifications (non- - * simple snap). - * 2- first do the non-simple snaps and then the simple snaps. - * - * Here we choose approach 2 for the following reasons - * (a) approach 2 is approximately as fast as approach 1 - * (b) the problematic snaps will be attempted as soon as possible. - * This is extremely helpful because if we wait until later on - * bringing the vert to-be-snapped to the boundary might become more - * difficult due to the change in location of neighboring verticies - * that will be snapped before the problematic vert to-be-snapped. - */ - while (snapOneRound(a, tag, false, successCount)); - while (snapOneRound(a, tag, true, successCount)); - return successCount; -} - -void trySnapping(Adapt* a, Snapper& snapper) +long snapTaggedVerts(Adapt* a, Tag* tag, Snapper& snapper) { bool shouldForce = a->input->shouldForceAdaptation; a->input->shouldForceAdaptation = true; //Allows quality to decrease from snapping - while (a->vtxToSnap.size() > 0) - { - Entity* vertex = a->vtxToSnap.front(); - a->vtxToSnap.pop(); - snapper.setVert(vertex); - if (snapper.run() && getFlag(a, vertex, SNAP)) - a->vtxToSnap.push(vertex); + long successCount = 0; + bool snapped = true; + while (snapped) { + tagVertsToSnap(a, tag); + if (a->mesh->hasMatching()) + snapped = snapMatchedVerts(a, tag, false, successCount); + else + snapped = snapAllVerts(a, tag, snapper); } a->input->shouldForceAdaptation = shouldForce; - a->vtxToSnap = {}; + return successCount; } void snap(Adapt* a) @@ -933,43 +888,21 @@ void snap(Adapt* a) return; double t0 = pcu::Time(); Tag* snapTag = a->mesh->createDoubleTag("ma_snap", 3); - // preventMatchedCavityMods(a); + preventMatchedCavityMods(a); int toSnap = tagVertsToSnap(a, snapTag); // ma_dbg::addTargetLocation(a, "snap_target"); // ma_dbg::addClassification(a, "classification"); Snapper snapper(a, snapTag, false); - trySnapping(a, snapper); - // snapLayer(a, tag); + snapTaggedVerts(a, snapTag, snapper); + snapLayer(a, snapTag); double t1 = pcu::Time(); print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds\n", toSnap, snapper.numSnapped, snapper.numFailed, snapper.numCollapseToVtx, snapper.numCollapse, snapper.numSwap, snapper.numSplitCollapse, t1 - t0); - // if (a->hasLayer) - // checkLayerShape(a->mesh, "after snapping"); - a->mesh->destroyTag(snapTag); -} - -void prevSnap(Adapt* a) -{ - if ( ! a->input->shouldSnap) - return; - double t0 = pcu::Time(); - Tag* tag; - /* we are starting to support a few operations on matched - meshes, including snapping+UR. this should prevent snapping - from modifying any matched entities */ - preventMatchedCavityMods(a); - long targets = tagVertsToSnap(a, tag); - long success = snapTaggedVerts(a, tag); - snapLayer(a, tag); - apf::removeTagFromDimension(a->mesh, tag, 0); - a->mesh->destroyTag(tag); - double t1 = pcu::Time(); - print(a->mesh->getPCU(), "snapped in %f seconds: %ld targets, %ld non-layer snaps", - t1 - t0, targets, success); if (a->hasLayer) checkLayerShape(a->mesh, "after snapping"); + a->mesh->destroyTag(snapTag); } } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 9da6cbec4..7a7dfbbe4 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -397,10 +397,10 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) // } // } //TODO: RUN FACE SWAP HERE - if (splitCollapse.run(ents[1], FPP->vert, 0)) { - numSplitCollapse++; - return true; - } + // if (splitCollapse.run(ents[1], FPP->vert, 0)) { + // numSplitCollapse++; + // return true; + // } print(mesh->getPCU(), "Swap failed: face swap not implemented"); } return false; From d27737f33424407176e50278a863d217d10c28b8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 3 Jul 2025 17:15:27 -0400 Subject: [PATCH 120/319] add up snap values --- ma/maSnap.cc | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 42108c260..6f7b19c3d 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -882,6 +882,10 @@ long snapTaggedVerts(Adapt* a, Tag* tag, Snapper& snapper) return successCount; } +int collect(Adapt* a, int val) { + return a->mesh->getPCU()->Add(val); +} + void snap(Adapt* a) { if (!a->input->shouldSnap) @@ -900,7 +904,7 @@ void snap(Adapt* a) double t1 = pcu::Time(); print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds\n", - toSnap, snapper.numSnapped, snapper.numFailed, snapper.numCollapseToVtx, snapper.numCollapse, snapper.numSwap, snapper.numSplitCollapse, t1 - t0); + toSnap, collect(a,snapper.numSnapped), collect(a,snapper.numFailed), collect(a,snapper.numCollapseToVtx), collect(a,snapper.numCollapse), collect(a,snapper.numSwap), collect(a,snapper.numSplitCollapse), t1 - t0); if (a->hasLayer) checkLayerShape(a->mesh, "after snapping"); a->mesh->destroyTag(snapTag); From b15f7e204a98a50ec719c8ca40aff99ea8337d5d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 3 Jul 2025 19:21:25 -0400 Subject: [PATCH 121/319] fixed bug caused by shared edge verts --- ma/maCollapse.cc | 4 ++-- ma/maSnapper.cc | 1 + test/aniso_adapt.h | 2 +- 3 files changed, 4 insertions(+), 3 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 68303dc87..cf492249b 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -174,8 +174,8 @@ bool checkEdgeCollapseEdgeRings(Adapt* a, Entity* edge) Mesh* m = a->mesh; Entity* v[2]; m->getDownward(edge,0,v); - PCU_ALWAYS_ASSERT( ! m->isShared(v[0])); - PCU_ALWAYS_ASSERT( ! m->isShared(v[1])); + if (!getFlag(a, v[0], DONT_COLLAPSE)) PCU_ALWAYS_ASSERT( ! m->isShared(v[0])); + if (!getFlag(a, v[1], DONT_COLLAPSE)) PCU_ALWAYS_ASSERT( ! m->isShared(v[1])); apf::Up ve[2]; m->getUp(v[0],ve[0]); m->getUp(v[1],ve[1]); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 7a7dfbbe4..d7a215370 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -390,6 +390,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) else { Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); + // Commented until faceswap, other wise can run into infinite loop // for (int i=0; i<3; i++) { // if (edgeSwap->run(edges[i])) { // numSwap++; diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index fef6dc755..42cf39d8e 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -54,7 +54,7 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) ma::snap(a); ma::coarsenMultiple(a); } - // ma::fixElementShapes(a); + ma::fixElementShapes(a); m->verify(); apf::writeVtkFiles("after_adapt",m); } \ No newline at end of file From 4a2c1caf09e2d58079ce29d131a71c6a9abc1d7e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 16 Jul 2025 19:22:54 -0400 Subject: [PATCH 122/319] prevent infinite loop --- ma/maSnap.cc | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 6f7b19c3d..90cd87c70 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -870,8 +870,11 @@ long snapTaggedVerts(Adapt* a, Tag* tag, Snapper& snapper) long successCount = 0; bool snapped = true; + int prevTagged = 0; while (snapped) { - tagVertsToSnap(a, tag); + int tagged = tagVertsToSnap(a, tag); + if (tagged == prevTagged) break; + prevTagged = tagged; if (a->mesh->hasMatching()) snapped = snapMatchedVerts(a, tag, false, successCount); else From 235ddfa04605f19fab01fa7ff3737a2be59f4e04 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Jul 2025 13:31:42 -0400 Subject: [PATCH 123/319] bring back eswap spltclps --- ma/maSnapper.cc | 21 ++++++++++----------- 1 file changed, 10 insertions(+), 11 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index d7a215370..938823964 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -390,18 +390,17 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) else { Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); - // Commented until faceswap, other wise can run into infinite loop - // for (int i=0; i<3; i++) { - // if (edgeSwap->run(edges[i])) { - // numSwap++; - // return true; - // } - // } + for (int i=0; i<3; i++) { + if (edgeSwap->run(edges[i])) { + numSwap++; + return true; + } + } //TODO: RUN FACE SWAP HERE - // if (splitCollapse.run(ents[1], FPP->vert, 0)) { - // numSplitCollapse++; - // return true; - // } + if (splitCollapse.run(ents[1], FPP->vert, 0)) { + numSplitCollapse++; + return true; + } print(mesh->getPCU(), "Swap failed: face swap not implemented"); } return false; From 6cf04550be9b5ef58f0f41856c7738d61b0482da Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Jul 2025 14:10:24 -0400 Subject: [PATCH 124/319] generalize getTetStats --- ma/maSnapper.cc | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 938823964..a2511f845 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -184,13 +184,13 @@ static Vector projOnTriPlane(Adapt* a, Entity* face, Entity* vert) return 0 : if an edge is degenerated 1-7 : the index indicating the location of projection point */ -static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double area[4]) +static int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* ents[4], double area[4]) { Entity* faceEdges[3]; - a->mesh->getDownward(FPP->problemFace, 1, faceEdges); + a->mesh->getDownward(face, 1, faceEdges); Entity* verts[3]; - a->mesh->getDownward(FPP->problemFace, 0, verts); + a->mesh->getDownward(face, 0, verts); Vector facePos[3]; Entity* edges[6]; @@ -200,12 +200,12 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double } Entity* faces[4]; - faces[0]=FPP->problemFace; + faces[0]=face; Entity* problemFaces[4]; - a->mesh->getDownward(FPP->problemRegion, 2, problemFaces); + a->mesh->getDownward(region, 2, problemFaces); for (int i=0; i<4; i++) { - if (problemFaces[i] == FPP->problemFace ) continue; + if (problemFaces[i] == face ) continue; else if (isLowInHigh(a->mesh, problemFaces[i], edges[0])) faces[1] = problemFaces[i]; else if (isLowInHigh(a->mesh, problemFaces[i], edges[1])) faces[2] = problemFaces[i]; else if (isLowInHigh(a->mesh, problemFaces[i], edges[2])) faces[3] = problemFaces[i]; @@ -222,7 +222,7 @@ static int getTetStats(Adapt* a, FirstProblemPlane* FPP, Entity* ents[4], double } } - Vector projection = projOnTriPlane(a, FPP->problemFace, FPP->vert); + Vector projection = projOnTriPlane(a, face, vert); //TODO: ERROR if projection = any point on problem face /* find normal to the plane */ @@ -341,7 +341,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) { Entity* ents[4] = {0}; double area[4]; - int bit = getTetStats(adapt, FPP, ents, area); + int bit = getTetStats(adapt, FPP->vert, FPP->problemFace, FPP->problemRegion, ents, area); double min=area[0]; for(int i=1; i<4; i++) From 9104ce1c362e2e92e2618f26e4510bc5eda8c8d7 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 17 Jul 2025 20:20:49 -0400 Subject: [PATCH 125/319] new fixed shape --- ma/ma.cc | 3 +- ma/maShape.cc | 650 +++--------------------------------------------- ma/maSnap.cc | 2 +- ma/maSnapper.cc | 2 +- ma/maSnapper.h | 1 + 5 files changed, 44 insertions(+), 614 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 97c80456e..e27809368 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -28,6 +28,7 @@ void adapt(Input* in) Adapt* a = new Adapt(in); preBalance(a); coarsen(a); + fixElementShapes(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); @@ -36,9 +37,9 @@ void adapt(Input* in) snap(a); coarsen(a); coarsenLayer(a); + fixElementShapes(a); } allowSplitCollapseOutsideLayer(a); - fixElementShapes(a); cleanupLayer(a); tetrahedronize(a); printQuality(a); diff --git a/ma/maShape.cc b/ma/maShape.cc index f34ebcc29..40a8d52fe 100644 --- a/ma/maShape.cc +++ b/ma/maShape.cc @@ -12,6 +12,7 @@ #include "maSize.h" #include "maAdapt.h" #include "maSnap.h" +#include "maSnapper.h" #include "maOperator.h" #include "maEdgeSwap.h" #include "maDoubleSplitCollapse.h" @@ -25,100 +26,6 @@ namespace ma { -/* projects vertex 3 onto the plane - of the bottom triangle and returns - the zone in which it lands as a bit code. - Each bit indicates whether the area coordinate - of that vertex is positive. -*/ - -int getSliverCode( - Adapt* a, - Entity* tet) -{ - SizeField* sf = a->sizeField; - Mesh* m = a->mesh; - Matrix J,Q; - apf::MeshElement* me = apf::createMeshElement(m,tet); - Vector center(.25,.25,.25); - apf::getJacobian(me,center,J); - sf->getTransform(me,center,Q); - J = J*Q; //Jacobian in metric space - apf::destroyMeshElement(me); - int code = 0; - // check first face - Entity* fs[4]; - m->getDownward(tet, 2, fs); - double f0Qual = a->shape->getQuality(fs[0]); - if ((f0Qual*f0Qual*f0Qual > a->input->goodQuality*a->input->goodQuality)) { - // if its okay, use it for projection - Vector v03 = J[2]; - J[2] = apf::cross(J[0],J[1]); //face normal towards v[3] - Vector projected = v03 - apf::project(v03,J[2]); //v[3] projected to face - Matrix inverseMap = apf::invert(apf::transpose(J)); - Vector basisPoint = inverseMap * projected; - Vector areaPoint(1-basisPoint[0]-basisPoint[1], - basisPoint[0], - basisPoint[1]); - for (int i=0; i < 3; ++i) - if (areaPoint[i] > 0) - code |= (1< -0.10 && areaPoint[i] < 0.10) - code |= ((1< 0) - code |= ((1< -0.20 && areaPoint[i] < 0.20) - code |= ((1<> 6) & 1) - return table2d[(code >> 7) & 3][(code >> 9) & 3]; - else - return table[code & 7][(code >> 3) & 7]; -} - struct IsBadQuality : public Predicate { IsBadQuality(Adapt* a_):a(a_) {} @@ -168,459 +75,6 @@ double getMinQuality(Adapt* a) return m->getPCU()->Min(minqual); } -class ShortEdgeFixer : public Operator -{ - public: - ShortEdgeFixer(Adapt* a): - remover(a) - { - adapter = a; - mesh = a->mesh; - sizeField = a->sizeField; - shortEdgeRatio = a->input->maximumEdgeRatio; - nr = nf = 0; - element = 0; - } - virtual ~ShortEdgeFixer() - { - } - virtual int getTargetDimension() {return mesh->getDimension();} - virtual bool shouldApply(Entity* e) - { - if ( ! getFlag(adapter,e,BAD_QUALITY)) - return false; - element = e; - Downward edges; - int n = mesh->getDownward(element,1,edges); - double l[6] = {}; - for (int i=0; i < n; ++i) - l[i] = sizeField->measure(edges[i]); - double maxLength; - double minLength; - Entity* shortEdge; - maxLength = minLength = l[0]; - shortEdge = edges[0]; - for (int i=1; i < n; ++i) - { - if (l[i] > maxLength) maxLength = l[i]; - if (l[i] < minLength) - { - minLength = l[i]; - shortEdge = edges[i]; - } - } - if ((maxLength/minLength) < shortEdgeRatio) - { - clearFlag(adapter,element,BAD_QUALITY); - return false; - } - remover.setEdge(shortEdge); - return true; - } - virtual bool requestLocality(apf::CavityOp* o) - { - return remover.requestLocality(o); - } - virtual void apply() - { - if (remover.run()) - ++nr; - else - { - ++nf; - clearFlag(adapter,element,BAD_QUALITY); - } - } - private: - Adapt* adapter; - Mesh* mesh; - Entity* element; - SizeField* sizeField; - ShortEdgeRemover remover; - double shortEdgeRatio; - public: - int nr; - int nf; -}; - -class TetFixerBase -{ - public: - virtual void setTet(Entity** v) = 0; - virtual bool requestLocality(apf::CavityOp* o) = 0; - virtual bool run() = 0; -}; - -class FixBySwap : public TetFixerBase -{ - public: - FixBySwap(Adapt* a): - adapter(a) - { - mesh = a->mesh; - edgeSwap = makeEdgeSwap(a); - nes = nf = numToTry = 0; - edges[0] = 0; - edges[1] = 0; - edges[2] = 0; - } - ~FixBySwap() - { - delete edgeSwap; - } - virtual void setTet(Entity** v) - { - Entity* tet = apf::findElement(mesh, apf::Mesh::TET, v); - PCU_ALWAYS_ASSERT(tet); - match = matchSliver(adapter, tet); - Entity* dv[4]; - mesh->getDownward(tet, 0, dv); - Entity* rv[4]; - rotateTet(dv,match.rotation,rv); - - enum { EDGE_EDGE, FACE_VERT }; - if (match.code_index==EDGE_EDGE) { - Entity* ev[2]; - ev[0] = rv[0]; ev[1] = rv[2]; - edges[0] = findUpward(mesh, apf::Mesh::EDGE, ev); - ev[0] = rv[1]; ev[1] = rv[3]; - edges[1] = findUpward(mesh, apf::Mesh::EDGE, ev); - numToTry = 2; - } - else - { - PCU_ALWAYS_ASSERT(match.code_index==FACE_VERT); - apf::findTriDown(mesh,rv,edges); - numToTry = 3; - } - } - virtual bool requestLocality(apf::CavityOp* o) - { - return o->requestLocality(edges, numToTry); - } - virtual bool run() - { - for (int i=0; i < numToTry; ++i) - if (edgeSwap->run(edges[i])) - { - ++nes; - return true; - } - ++nf; - return false; - } - private: - Adapt* adapter; - Mesh* mesh; - Entity* edges[3]; - EdgeSwap* edgeSwap; - CodeMatch match; - int numToTry; - int nes; - int nf; -}; - -class EdgeVertFixer : public TetFixerBase -{ -public: - EdgeVertFixer(Adapt* a): - singleSplitCollapse(a) - { - mesh = a->mesh; - edgeSwap = makeEdgeSwap(a); - nes = nssc = nf = 0; - edge = 0; - oppVert = 0; - } - ~EdgeVertFixer() - { - delete edgeSwap; - } - virtual void setTet(Entity** v) - { - /* In this template, the edge v[0]--v[1] and vert v[3] - are too close*/ - edge = apf::findElement(mesh, apf::Mesh::EDGE, v); - oppVert = v[3]; - verts[0] = v[0]; - verts[1] = v[1]; - verts[2] = v[3]; - } - virtual bool requestLocality(apf::CavityOp* o) - { - /* by requesting locality for all the verts we can be sure - * that all the desired entities for this operator are local */ - return o->requestLocality(verts,3); - } - virtual bool run() { - if (edgeSwap->run(edge)) { - ++nes; - return true; - } - if (singleSplitCollapse.run(edge, oppVert)) - { - ++nssc; - return true; - } - ++nf; - return false; - } -private: - Mesh* mesh; - Entity* verts[3]; - Entity *edge, *oppVert; - SingleSplitCollapse singleSplitCollapse; - EdgeSwap* edgeSwap; -public: - int nes; /* number of edge swaps done */ - int nssc; /* number of SSCs done */ - int nf; /* number of failures */ -}; - -class FaceVertFixer : public TetFixerBase -{ - public: - FaceVertFixer(Adapt* a): - faceSplitCollapse(a) - { - mesh = a->mesh; - edgeSwap = makeEdgeSwap(a); - nes = nf = nfsc = 0; - edges[0] = 0; - edges[1] = 0; - edges[2] = 0; - verts[0] = 0; - verts[1] = 0; - verts[2] = 0; - verts[3] = 0; - face = 0; - oppVert = 0; - tet = 0; - } - ~FaceVertFixer() - { - delete edgeSwap; - } - virtual void setTet(Entity** v) - { -/* in this template, the bottom face and v[3] - are too close, the key edges are those that bound - face v(0,1,2) */ - apf::findTriDown(mesh,v,edges); - tet = apf::findElement(mesh, apf::Mesh::TET, v); - oppVert = v[3]; - verts[0] = v[0]; - verts[1] = v[1]; - verts[2] = v[2]; - verts[3] = v[3]; - } - virtual bool requestLocality(apf::CavityOp* o) - { - /* by requesting locality for all the verts we can be sure - * that all the desired entities for this operator are local */ - return o->requestLocality(verts,4); - } - virtual bool run() - { - for (int i=0; i < 3; ++i) - if (edgeSwap->run(edges[i])) - { - ++nes; - return true; - } - face = apf::findUpward(mesh, apf::Mesh::TRIANGLE, edges); - if (faceSplitCollapse.run(face, tet)) - { - ++nfsc; - return true; - } - ++nf; - return false; - } - private: - Mesh* mesh; - Entity* edges[3]; - Entity* verts[4]; - Entity *face, *oppVert; - Entity* tet; - FaceSplitCollapse faceSplitCollapse; - EdgeSwap* edgeSwap; - public: - int nes; /* number of edge swaps done */ - int nfsc; /* number of FSCs done */ - int nf; /* number of failures */ -}; - -class EdgeEdgeFixer : public TetFixerBase -{ - public: - EdgeEdgeFixer(Adapt* a): - doubleSplitCollapse(a) - { - mesh = a->mesh; - edgeSwap = makeEdgeSwap(a); - nes = ndsc = nf = 0; - sf = a->sizeField; - edges[0] = 0; - edges[1] = 0; - } - ~EdgeEdgeFixer() - { - delete edgeSwap; - } - virtual void setTet(Entity** v) - { -/* in this template, the v[0]-v[2] amd v[1]-v[3] - edges are too close. */ - Entity* ev[2]; - ev[0] = v[0]; ev[1] = v[2]; - edges[0] = findUpward(mesh, apf::Mesh::EDGE, ev); - ev[0] = v[1]; ev[1] = v[3]; - edges[1] = findUpward(mesh, apf::Mesh::EDGE, ev); - } - virtual bool requestLocality(apf::CavityOp* o) - { - return o->requestLocality(edges,2); - } - virtual bool run() - { - for (int i=0; i < 2; ++i) - if (edgeSwap->run(edges[i])) - { - ++nes; - return true; - } - if (doubleSplitCollapse.run(edges)) - { - ++ndsc; - return true; - } - ++nf; - return false; - } - private: - Mesh* mesh; - Entity* edges[2]; - EdgeSwap* edgeSwap; - DoubleSplitCollapse doubleSplitCollapse; - SizeField* sf; - public: - int nes; - int ndsc; - int nf; -}; - -class LargeAngleTetFixer : public Operator -{ - public: - LargeAngleTetFixer(Adapt* a): - edgeEdgeFixer(a), - edgeVertFixer(a), - faceVertFixer(a) - { - adapter = a; - mesh = a->mesh; - tet = 0; - fixer = 0; - } - virtual ~LargeAngleTetFixer() - { - } - virtual int getTargetDimension() {return 3;} - enum { EDGE_EDGE, FACE_VERT, EDGE_VERT, VERT_VERT }; - virtual bool shouldApply(Entity* e) - { - if ( ! getFlag(adapter,e,BAD_QUALITY)) - return false; - tet = e; - CodeMatch match = matchSliver(adapter,e); - if (match.code_index==EDGE_EDGE) { - fixer = &edgeEdgeFixer; - } else if (match.code_index==FACE_VERT) { - fixer = &faceVertFixer; - } else if (match.code_index==EDGE_VERT) { - fixer = &edgeVertFixer; - } else if (match.code_index==VERT_VERT) { - fixer = &faceVertFixer; - } - Entity* v[4]; - mesh->getDownward(e,0,v); - Entity* rv[4]; - rotateTet(v,match.rotation,rv); - fixer->setTet(rv); - return true; - } - virtual bool requestLocality(apf::CavityOp* o) - { - return fixer->requestLocality(o); - } - virtual void apply() - { - if ( ! fixer->run()) - clearFlag(adapter,tet,BAD_QUALITY); - } - private: - Adapt* adapter; - Mesh* mesh; - Entity* tet; - TetFixerBase* fixer; - public: - EdgeEdgeFixer edgeEdgeFixer; - EdgeVertFixer edgeVertFixer; - FaceVertFixer faceVertFixer; -}; - -class LargeAngleTetAligner : public Operator -{ - public: - LargeAngleTetAligner(Adapt* a): - fixer(a) - { - adapter = a; - mesh = a->mesh; - tet = 0; - } - virtual ~LargeAngleTetAligner() - { - } - virtual int getTargetDimension() {return 3;} - virtual bool shouldApply(Entity* e) - { - if ( ! getFlag(adapter,e,BAD_QUALITY)) - return false; - tet = e; - /* PCU_ALWAYS_ASSERT(mesh->getType(e) == apf::Mesh::TET); */ - enum { EDGE_EDGE, FACE_VERT }; - CodeMatch match = matchSliver(adapter,e); - if (match.code_index==EDGE_EDGE) { - clearFlag(adapter,tet,BAD_QUALITY); - return false; - } - /* else */ - /* { PCU_ALWAYS_ASSERT(match.code_index==FACE_VERT); */ - /* fixer = &faceVertFixer; */ - /* } */ - Entity* v[4]; - mesh->getDownward(e,0,v); - fixer.setTet(v); - return true; - } - virtual bool requestLocality(apf::CavityOp* o) - { - return fixer.requestLocality(o); - } - virtual void apply() - { - if ( ! fixer.run()) - clearFlag(adapter,tet,BAD_QUALITY); - } - private: - Adapt* adapter; - Mesh* mesh; - Entity* tet; - FixBySwap fixer; -}; - class LargeAngleTriFixer : public Operator { public: @@ -737,19 +191,45 @@ class QualityImprover2D : public Operator int nf; }; -static double fixShortEdgeElements(Adapt* a) -{ - double t0 = pcu::Time(); - ShortEdgeFixer fixer(a); - applyOperator(a,&fixer); - double t1 = pcu::Time(); - return t1 - t0; -} - static void fixLargeAngleTets(Adapt* a) { - LargeAngleTetFixer fixer(a); - applyOperator(a,&fixer); + FaceSplitCollapse faceSplitCollapse(a); + SingleSplitCollapse splitCollapse(a); + DoubleSplitCollapse doubleSplitCollapse(a); + EdgeSwap* edgeSwap = makeEdgeSwap(a); + + Entity* tet; + Iterator* it = a->mesh->begin(3); + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + clearFlag(a, tet, BAD_QUALITY); + Entity* verts[4]; + a->mesh->getDownward(tet, 0, verts); + Entity* vert = verts[0]; + Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); + Entity* ents[4]; + double area[4]; + int bit = getTetStats(a, vert, face, tet, ents, area); + + // two large dihedral angles -> key problem: two mesh edges + if (bit==3 || bit==5 || bit==6) { + if (edgeSwap->run(ents[0])) continue; + if (edgeSwap->run(ents[1])) continue; + if (splitCollapse.run(ents[0], vert)) continue; + if (splitCollapse.run(ents[1], vert)) continue; + if (doubleSplitCollapse.run(ents)) continue; + } + // three large dihedral angles -> key entity: a mesh face + else { + Entity* edges[3]; + a->mesh->getDownward(ents[0], 1, edges); + if (edgeSwap->run(edges[0])) continue; + if (edgeSwap->run(edges[1])) continue; + if (edgeSwap->run(edges[2])) continue; + //TODO: RUN FACE SWAP HERE + if (faceSplitCollapse.run(ents[0], tet)) continue; + } + } } static void fixLargeAngleTris(Adapt* a) @@ -758,18 +238,6 @@ static void fixLargeAngleTris(Adapt* a) applyOperator(a,&fixer); } -static void alignLargeAngleTets(Adapt* a) -{ - LargeAngleTetAligner aligner(a); - applyOperator(a,&aligner); -} - -static void alignLargeAngleTris(Adapt* a) -{ - LargeAngleTriFixer aligner(a); - applyOperator(a,&aligner); -} - static void improveQualities2D(Adapt* a) { QualityImprover2D improver(a); @@ -787,14 +255,6 @@ static double fixLargeAngles(Adapt* a) return t1 - t0; } -static void alignLargeAngles(Adapt* a) -{ - if (a->mesh->getDimension()==3) - alignLargeAngleTets(a); - else - alignLargeAngleTris(a); -} - double improveQualities(Adapt* a) { double t0 = pcu::Time(); @@ -812,6 +272,7 @@ void fixElementShapes(Adapt* a) return; double t0 = pcu::Time(); int count = markBadQuality(a); + print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", 0, count); int originalCount = count; int prev_count; double time; @@ -820,7 +281,6 @@ void fixElementShapes(Adapt* a) if ( ! count) break; prev_count = count; - print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", iter, count); time = fixLargeAngles(a); /* We need to snap the new verts as soon as they are * created (to avoid future problems). At the moment @@ -830,16 +290,10 @@ void fixElementShapes(Adapt* a) if (a->mesh->getDimension() == 3) snap(a); count = markBadQuality(a); - print(a->mesh->getPCU(), "--fixLargeAngles in %f seconds: #bad elements %d", time,count); - time = fixShortEdgeElements(a); - count = markBadQuality(a); - print(a->mesh->getPCU(), "--fixShortEdgeElements in %f seconds: #bad elements %d", time,count); if (count >= prev_count) unMarkBadQuality(a); // to make sure markEntities does not complain! // balance the mesh to avoid empty parts midBalance(a); - print(a->mesh->getPCU(), "--percent change in number of bad elements %f", - ((double) prev_count - (double) count) / (double) prev_count); iter++; } while(count < prev_count); double t1 = pcu::Time(); @@ -847,32 +301,6 @@ void fixElementShapes(Adapt* a) originalCount,count,t1-t0); } -void alignElements(Adapt* a) -{ - int max_iter = 5; - if ( ! a->input->shouldFixShape) - return; - double t0 = pcu::Time(); - int count = markBadQuality(a); - int originalCount = count; - int prev_count; - int i = 0; - do { - if ( ! count) - break; - prev_count = count; - alignLargeAngles(a); - count = markBadQuality(a); - ++i; - if (count >= prev_count || i >= max_iter) - unMarkBadQuality(a); - } while(count < prev_count && i < max_iter); - - double t1 = pcu::Time(); - print(a->mesh->getPCU(), "non-aligned elements down from %d to %d in %f seconds", - originalCount,count,t1-t0); -} - void printQuality(Adapt* a) { if ( ! a->input->shouldPrintQuality) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 90cd87c70..347c3c516 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -906,7 +906,7 @@ void snap(Adapt* a) snapLayer(a, snapTag); double t1 = pcu::Time(); - print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds\n", + print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds", toSnap, collect(a,snapper.numSnapped), collect(a,snapper.numFailed), collect(a,snapper.numCollapseToVtx), collect(a,snapper.numCollapse), collect(a,snapper.numSwap), collect(a,snapper.numSplitCollapse), t1 - t0); if (a->hasLayer) checkLayerShape(a->mesh, "after snapping"); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index a2511f845..1d2ae469c 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -184,7 +184,7 @@ static Vector projOnTriPlane(Adapt* a, Entity* face, Entity* vert) return 0 : if an edge is degenerated 1-7 : the index indicating the location of projection point */ -static int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* ents[4], double area[4]) +int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* ents[4], double area[4]) { Entity* faceEdges[3]; a->mesh->getDownward(face, 1, faceEdges); diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 3d6c0d6b3..395f5e5f2 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -89,6 +89,7 @@ class FirstProblemPlane void findCommonEdges(apf::Up& cpRegions); }; +int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* ents[4], double area[4]); Entity* getTetFaceOppositeVert(Mesh* m, Entity* e, Entity* v); void getFaceCoords(Mesh* m, Entity* face, std::vector& coords); Vector getCenter(Mesh* mesh, Entity* face); From af7f1a731023cf9b948371484ac73c82def55073 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 18 Jul 2025 22:18:17 -0400 Subject: [PATCH 126/319] better printFPP --- ma/maSnap.cc | 4 +--- ma/maSnapper.cc | 7 ++++++- 2 files changed, 7 insertions(+), 4 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 347c3c516..723934f9e 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -897,9 +897,7 @@ void snap(Adapt* a) Tag* snapTag = a->mesh->createDoubleTag("ma_snap", 3); preventMatchedCavityMods(a); int toSnap = tagVertsToSnap(a, snapTag); - - // ma_dbg::addTargetLocation(a, "snap_target"); - // ma_dbg::addClassification(a, "classification"); + if (toSnap == 0) return; Snapper snapper(a, snapTag, false); snapTaggedVerts(a, snapTag, snapper); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 1d2ae469c..a2229f3cd 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -126,6 +126,9 @@ static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) static void printFPP(Adapt* a, FirstProblemPlane* FPP) { + ma_dbg::addTargetLocation(a, "snap_target"); + ma_dbg::addClassification(a, "classification"); + apf::writeVtkFiles("FPP_Mesh", a->mesh); EntityArray invalid; for (int i=0; iproblemRegions.n; i++){ @@ -615,6 +618,8 @@ bool Snapper::trySimpleSnap() return tryReposition(adapt, vert, snapTag, invalid); } +static int DEBUGFAILED=0; + bool Snapper::run() { apf::Up invalid; @@ -639,7 +644,7 @@ bool Snapper::run() mesh->removeTag(vert,snapTag); clearFlag(adapt, vert, SNAP); } - // if (!success && numFailed == 1) printFPP(adapt, FPP); + // if (!success && ++DEBUGFAILED == 1) printFPP(adapt, FPP); if (FPP) delete FPP; return success; From 9c20565806201597aee338bbdb375615f7ddc594 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 23 Jul 2025 19:42:38 -0400 Subject: [PATCH 127/319] fixed bug with partial periodic --- gmi_cap/gmi_cap.cc | 5 +---- ma/ma.cc | 2 +- ma/maSnap.cc | 7 ++----- 3 files changed, 4 insertions(+), 10 deletions(-) diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index e21769311..64b23e26a 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -197,10 +197,7 @@ static int periodic(struct gmi_model* m, struct gmi_ent* e, int dim) /* PARAM_COMPOSITE=4, //!< parametrization of a composite edge or face */ /* PARAM_UNBOUNDED=8 //!< infinite parametrization */ /* }; */ - if (paramType & 1) return 0; - int isPeriodic = paramType & (1<<1); - PCU_ALWAYS_ASSERT_VERBOSE(isPeriodic == false, "for now cannot handle periodic geometric entity (with discontinuity in parametric coords)"); - return isPeriodic; + return paramType & (1<<1); } static void range(struct gmi_model* m, struct gmi_ent* e, int dim, diff --git a/ma/ma.cc b/ma/ma.cc index e27809368..c3d1033e0 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -37,9 +37,9 @@ void adapt(Input* in) snap(a); coarsen(a); coarsenLayer(a); - fixElementShapes(a); } allowSplitCollapseOutsideLayer(a); + // fixElementShapes(a); cleanupLayer(a); tetrahedronize(a); printQuality(a); diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 723934f9e..58a04dfb9 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -122,6 +122,8 @@ static double interpolateParametricCoordinate( } double period = range[1]-range[0]; double span = b-a; + if (period < 0.5) //partial range can't be periodic + return (1-t)*a + t*b; if (!mode) { if (span < (period/2)) return (1-t)*a + t*b; @@ -493,8 +495,6 @@ static void interpolateParametricCoordinatesOnRegularFace( * 1) we are assuming manifold surfaces * 2) we only check for faces that are periodic */ - -#ifndef HAVE_CAPSTONE // this need to be done for faces, only if (dim != 2) return; @@ -511,9 +511,6 @@ static void interpolateParametricCoordinatesOnRegularFace( bool isPeriodic = m->getPeriodicRange(g,d,range); p[d] = interpolateParametricCoordinate(t,a[d],b[d],range,isPeriodic, 1); } -#else - (void) gface_isPeriodic; -#endif } static void interpolateParametricCoordinatesOnFace( From c3a1db1ae305c5edcca12938fde351c52050623d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 23 Jul 2025 23:36:43 -0400 Subject: [PATCH 128/319] removed capdefined --- ma/CMakeLists.txt | 1 + ma/maSnap.cc | 166 ++++++++++++++++++++++++---------------------- 2 files changed, 86 insertions(+), 81 deletions(-) diff --git a/ma/CMakeLists.txt b/ma/CMakeLists.txt index c8af8e6fe..72584fe9d 100644 --- a/ma/CMakeLists.txt +++ b/ma/CMakeLists.txt @@ -80,6 +80,7 @@ target_link_libraries(ma apf mds parma + apf_cap apf_zoltan apf_metis pcu diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 58a04dfb9..8d40b45bd 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -16,6 +16,7 @@ #include "maLayer.h" #include "maMatch.h" #include "maDBG.h" +#include "apfCAP.h" #include #include #include @@ -71,10 +72,10 @@ static size_t isSurfUnderlyingFaceDegenerate( m->getFirstDerivative(g, p, uTan, vTan); double uTanSize = uTan.getLength(); double vTanSize = vTan.getLength(); -#ifdef HAVE_CAPSTONE - uTanSize = uTan * uTan; - vTanSize = vTan * vTan; -#endif + if (dynamic_cast(m)) { + uTanSize = uTan * uTan; + vTanSize = vTan * vTan; + } if (uTanSize < tol || vTanSize < tol) { axis = degenAxes; values.push_back(candidateDegenParam); @@ -155,46 +156,46 @@ static void interpolateParametricCoordinateOnEdge( p[1] = 0.0; p[2] = 0.0; -#ifdef HAVE_CAPSTONE - // account for non-uniform parameterization of model-edge - Vector X[3]; - Vector para[2] = {a, b}; - for (int i = 0; i < 2; i++) - m->snapToModel(g, para[i], X[i]); + if (dynamic_cast(m)) { + // account for non-uniform parameterization of model-edge + Vector X[3]; + Vector para[2] = {a, b}; + for (int i = 0; i < 2; i++) + m->snapToModel(g, para[i], X[i]); - double tMax = 1., tMin = 0.; - m->snapToModel(g, p, X[2]); + double tMax = 1., tMin = 0.; + m->snapToModel(g, p, X[2]); - // check if the snap point on the model edge is - // approximately at same length from either vertices + // check if the snap point on the model edge is + // approximately at same length from either vertices - double r = (X[0]-X[2]).getLength(); - double s = (X[1]-X[2]).getLength(); + double r = (X[0]-X[2]).getLength(); + double s = (X[1]-X[2]).getLength(); - double alpha = t/(1. - t); //parametric ratio + double alpha = t/(1. - t); //parametric ratio - int num_it = 0; - while (r/s < 0.95 * alpha || r/s > 1.05 * alpha) { - if ( r/s > alpha) { - tMax = t; - t = (tMin + t) / 2.; - } - else { - tMin = t; - t = (t + tMax) / 2.; - } + int num_it = 0; + while (r/s < 0.95 * alpha || r/s > 1.05 * alpha) { + if ( r/s > alpha) { + tMax = t; + t = (tMin + t) / 2.; + } + else { + tMin = t; + t = (t + tMax) / 2.; + } - p[0] = interpolateParametricCoordinate(t, a[0], b[0], range, isPeriodic, 0); + p[0] = interpolateParametricCoordinate(t, a[0], b[0], range, isPeriodic, 0); - m->snapToModel(g, p, X[2]); + m->snapToModel(g, p, X[2]); - r = (X[0]-X[2]).getLength(); - s = (X[1]-X[2]).getLength(); + r = (X[0]-X[2]).getLength(); + s = (X[1]-X[2]).getLength(); - if ( num_it > 20) break; - num_it++; + if ( num_it > 20) break; + num_it++; + } } -#endif } // convert (phi,theta) on unit sphere to (x,y,z) @@ -496,20 +497,22 @@ static void interpolateParametricCoordinatesOnRegularFace( * 2) we only check for faces that are periodic */ // this need to be done for faces, only - if (dim != 2) - return; - if (!gface_isPeriodic) - return; - - Vector x; - bool ok; - ok = m->isParamPointInsideModel(g, &p[0], x); - if (ok) - return; - - for (int d=0; d < dim; ++d) { - bool isPeriodic = m->getPeriodicRange(g,d,range); - p[d] = interpolateParametricCoordinate(t,a[d],b[d],range,isPeriodic, 1); + if (!dynamic_cast(m)) { + if (dim != 2) + return; + if (!gface_isPeriodic) + return; + + Vector x; + bool ok; + ok = m->isParamPointInsideModel(g, &p[0], x); + if (ok) + return; + + for (int d=0; d < dim; ++d) { + bool isPeriodic = m->getPeriodicRange(g,d,range); + p[d] = interpolateParametricCoordinate(t,a[d],b[d],range,isPeriodic, 1); + } } } @@ -526,50 +529,51 @@ static void interpolateParametricCoordinatesOnFace( size_t num = isSurfUnderlyingFaceDegenerate(m, g, axes, vals); if (num > 0) { // the underlying surface is degenerate -#ifndef HAVE_CAPSTONE - interpolateParametricCoordinatesOnDegenerateFace(m, g, t, a, b, axes, vals, p); -#else - // account for non-uniform parameterization of model-edge - Vector X[3]; - Vector para[2] = {a, b}; - for (int i = 0; i < 2; i++) - m->snapToModel(g, para[i], X[i]); + if (!dynamic_cast(m)) { + interpolateParametricCoordinatesOnDegenerateFace(m, g, t, a, b, axes, vals, p); + } + else { + // account for non-uniform parameterization of model-edge + Vector X[3]; + Vector para[2] = {a, b}; + for (int i = 0; i < 2; i++) + m->snapToModel(g, para[i], X[i]); - interpolateParametricCoordinatesOnDegenerateFace(m, g, t, para[0], para[1], axes, vals, p); + interpolateParametricCoordinatesOnDegenerateFace(m, g, t, para[0], para[1], axes, vals, p); - double tMax = 1., tMin = 0.; - m->snapToModel(g, p, X[2]); + double tMax = 1., tMin = 0.; + m->snapToModel(g, p, X[2]); - // check if the snap point on the model edge is - // approximately at same length from either vertices + // check if the snap point on the model edge is + // approximately at same length from either vertices - double r = (X[0]-X[2]).getLength(); - double s = (X[1]-X[2]).getLength(); + double r = (X[0]-X[2]).getLength(); + double s = (X[1]-X[2]).getLength(); - double alpha = t/(1. - t); //parametric ratio + double alpha = t/(1. - t); //parametric ratio - int num_it = 0; - while (r/s < 0.95 * alpha || r/s > 1.05 * alpha) { - if ( r/s > alpha) { - tMax = t; - t = (tMin + t) / 2.; - } - else { - tMin = t; - t = (t + tMax) / 2.; - } + int num_it = 0; + while (r/s < 0.95 * alpha || r/s > 1.05 * alpha) { + if ( r/s > alpha) { + tMax = t; + t = (tMin + t) / 2.; + } + else { + tMin = t; + t = (t + tMax) / 2.; + } - interpolateParametricCoordinatesOnDegenerateFace(m, g, t, para[0], para[1], axes, vals, p); + interpolateParametricCoordinatesOnDegenerateFace(m, g, t, para[0], para[1], axes, vals, p); - m->snapToModel(g, p, X[2]); + m->snapToModel(g, p, X[2]); - r = (X[0]-X[2]).getLength(); - s = (X[1]-X[2]).getLength(); + r = (X[0]-X[2]).getLength(); + s = (X[1]-X[2]).getLength(); - if ( num_it > 20) break; - num_it++; + if ( num_it > 20) break; + num_it++; + } } -#endif } else interpolateParametricCoordinatesOnRegularFace(m, g, t, a, b, p); From 82c5636e6f14420f7239e0dbcc72a6a8a6faf40b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 23 Jul 2025 23:36:58 -0400 Subject: [PATCH 129/319] fix shape once --- ma/ma.cc | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index c3d1033e0..97c80456e 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -28,7 +28,6 @@ void adapt(Input* in) Adapt* a = new Adapt(in); preBalance(a); coarsen(a); - fixElementShapes(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); @@ -39,7 +38,7 @@ void adapt(Input* in) coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); - // fixElementShapes(a); + fixElementShapes(a); cleanupLayer(a); tetrahedronize(a); printQuality(a); From b1aa88ab366563448d264440fb621206ab5f52a3 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 26 Jul 2025 15:38:31 -0400 Subject: [PATCH 130/319] optional capstone check --- ma/CMakeLists.txt | 5 ++++- ma/maSnap.cc | 53 +++++++++++++++++++++++++++++------------------ 2 files changed, 37 insertions(+), 21 deletions(-) diff --git a/ma/CMakeLists.txt b/ma/CMakeLists.txt index 72584fe9d..45a217fd0 100644 --- a/ma/CMakeLists.txt +++ b/ma/CMakeLists.txt @@ -80,12 +80,15 @@ target_link_libraries(ma apf mds parma - apf_cap apf_zoltan apf_metis pcu ) +if (ENABLE_CAPSTONE) +target_link_libraries(ma PUBLIC apf_cap) +endif() + scorec_export_library(ma) bob_end_subdir() diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 8d40b45bd..eecee363f 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -16,7 +16,6 @@ #include "maLayer.h" #include "maMatch.h" #include "maDBG.h" -#include "apfCAP.h" #include #include #include @@ -25,8 +24,22 @@ #include #include +#ifdef HAVE_CAPSTONE +#include "apfCAP.h" +#endif + namespace ma { +static bool isCapstoneMesh(apf::Mesh* m) +{ + #ifdef HAVE_CAPSTONE + if (dynamic_cast(m)) return true; + else return false; + #else + return false; + #endif +} + static size_t isSurfUnderlyingFaceDegenerate( apf::Mesh* m, Model* g, // this the model entity in question @@ -72,7 +85,7 @@ static size_t isSurfUnderlyingFaceDegenerate( m->getFirstDerivative(g, p, uTan, vTan); double uTanSize = uTan.getLength(); double vTanSize = vTan.getLength(); - if (dynamic_cast(m)) { + if (isCapstoneMesh(m)) { uTanSize = uTan * uTan; vTanSize = vTan * vTan; } @@ -156,7 +169,7 @@ static void interpolateParametricCoordinateOnEdge( p[1] = 0.0; p[2] = 0.0; - if (dynamic_cast(m)) { + if (isCapstoneMesh(m)) { // account for non-uniform parameterization of model-edge Vector X[3]; Vector para[2] = {a, b}; @@ -497,22 +510,22 @@ static void interpolateParametricCoordinatesOnRegularFace( * 2) we only check for faces that are periodic */ // this need to be done for faces, only - if (!dynamic_cast(m)) { - if (dim != 2) - return; - if (!gface_isPeriodic) - return; - - Vector x; - bool ok; - ok = m->isParamPointInsideModel(g, &p[0], x); - if (ok) - return; - - for (int d=0; d < dim; ++d) { - bool isPeriodic = m->getPeriodicRange(g,d,range); - p[d] = interpolateParametricCoordinate(t,a[d],b[d],range,isPeriodic, 1); - } + if (isCapstoneMesh(m)) + return; + if (dim != 2) + return; + if (!gface_isPeriodic) + return; + + Vector x; + bool ok; + ok = m->isParamPointInsideModel(g, &p[0], x); + if (ok) + return; + + for (int d=0; d < dim; ++d) { + bool isPeriodic = m->getPeriodicRange(g,d,range); + p[d] = interpolateParametricCoordinate(t,a[d],b[d],range,isPeriodic, 1); } } @@ -529,7 +542,7 @@ static void interpolateParametricCoordinatesOnFace( size_t num = isSurfUnderlyingFaceDegenerate(m, g, axes, vals); if (num > 0) { // the underlying surface is degenerate - if (!dynamic_cast(m)) { + if (!isCapstoneMesh(m)) { interpolateParametricCoordinatesOnDegenerateFace(m, g, t, a, b, axes, vals, p); } else { From d7efb6370a8672d401ba50869da5660ffc5122ef Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 26 Jul 2025 16:05:30 -0400 Subject: [PATCH 131/319] remove aggressive coarsen --- ma/maCoarsen.cc | 8 ++------ ma/maCoarsen.h | 5 ++--- test/aniso_adapt.h | 2 +- 3 files changed, 5 insertions(+), 10 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 475d79c42..9d2310208 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -229,7 +229,7 @@ long markEdgesToCollapse(Adapt* a) DONT_COLLAPSE | NEED_NOT_COLLAPSE); } -bool coarsen(Adapt* a, bool aggressive) +bool coarsen(Adapt* a) { if (!a->input->shouldCoarsen) return false; @@ -411,16 +411,13 @@ std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) return shortEdgeVerts; } -bool coarsenMultiple(Adapt* a, bool aggressive) +bool coarsenMultiple(Adapt* a) { if (!a->input->shouldCoarsen) return false; double t0 = pcu::Time(); Tag* lengthTag = a->mesh->createDoubleTag("edge_length", 1); std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); - bool oldShouldForce = a->input->shouldForceAdaptation; - if (aggressive) - a->input->shouldForceAdaptation = true; Collapse collapse; collapse.Init(a); @@ -438,7 +435,6 @@ bool coarsenMultiple(Adapt* a, bool aggressive) } } ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE | CHECKED, 0); - a->input->shouldForceAdaptation = oldShouldForce; a->mesh->destroyTag(lengthTag); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index 8af51122c..2e4283c77 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -14,10 +14,9 @@ namespace ma { class Adapt; -bool coarsenMultiple(Adapt* a, bool aggressive=false); -bool coarsen(Adapt* a, bool aggressive=false); +bool coarsenMultiple(Adapt* a); +bool coarsen(Adapt* a); bool coarsenLayer(Adapt* a); -bool coarsenAndPrint(Adapt* a); void checkAllEdgeCollapses(Adapt* a, int modelDimension); void findIndependentSet(Adapt* a); diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 42cf39d8e..de2d68430 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -47,7 +47,7 @@ void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - ma::coarsenMultiple(a, true); + ma::coarsenMultiple(a); for (int i = 0; i < in->maximumIterations; ++i) { ma::refine(a); From 51db69934318f6cd352642f2f7a95a98f20a29ad Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 13:54:20 -0400 Subject: [PATCH 132/319] revert maShape --- ma/maShape.cc | 652 ++++++++++++++++++++++++++++++++++++++++++++++---- 1 file changed, 612 insertions(+), 40 deletions(-) diff --git a/ma/maShape.cc b/ma/maShape.cc index 40a8d52fe..dcd0eec17 100644 --- a/ma/maShape.cc +++ b/ma/maShape.cc @@ -12,7 +12,6 @@ #include "maSize.h" #include "maAdapt.h" #include "maSnap.h" -#include "maSnapper.h" #include "maOperator.h" #include "maEdgeSwap.h" #include "maDoubleSplitCollapse.h" @@ -26,6 +25,100 @@ namespace ma { +/* projects vertex 3 onto the plane + of the bottom triangle and returns + the zone in which it lands as a bit code. + Each bit indicates whether the area coordinate + of that vertex is positive. +*/ + +int getSliverCode( + Adapt* a, + Entity* tet) +{ + SizeField* sf = a->sizeField; + Mesh* m = a->mesh; + Matrix J,Q; + apf::MeshElement* me = apf::createMeshElement(m,tet); + Vector center(.25,.25,.25); + apf::getJacobian(me,center,J); + sf->getTransform(me,center,Q); + J = J*Q; //Jacobian in metric space + apf::destroyMeshElement(me); + int code = 0; + // check first face + Entity* fs[4]; + m->getDownward(tet, 2, fs); + double f0Qual = a->shape->getQuality(fs[0]); + if ((f0Qual*f0Qual*f0Qual > a->input->goodQuality*a->input->goodQuality)) { + // if its okay, use it for projection + Vector v03 = J[2]; + J[2] = apf::cross(J[0],J[1]); //face normal towards v[3] + Vector projected = v03 - apf::project(v03,J[2]); //v[3] projected to face + Matrix inverseMap = apf::invert(apf::transpose(J)); + Vector basisPoint = inverseMap * projected; + Vector areaPoint(1-basisPoint[0]-basisPoint[1], + basisPoint[0], + basisPoint[1]); + for (int i=0; i < 3; ++i) + if (areaPoint[i] > 0) + code |= (1< -0.10 && areaPoint[i] < 0.10) + code |= ((1< 0) + code |= ((1< -0.20 && areaPoint[i] < 0.20) + code |= ((1<> 6) & 1) + return table2d[(code >> 7) & 3][(code >> 9) & 3]; + else + return table[code & 7][(code >> 3) & 7]; +} + struct IsBadQuality : public Predicate { IsBadQuality(Adapt* a_):a(a_) {} @@ -75,6 +168,459 @@ double getMinQuality(Adapt* a) return m->getPCU()->Min(minqual); } +class ShortEdgeFixer : public Operator +{ + public: + ShortEdgeFixer(Adapt* a): + remover(a) + { + adapter = a; + mesh = a->mesh; + sizeField = a->sizeField; + shortEdgeRatio = a->input->maximumEdgeRatio; + nr = nf = 0; + element = 0; + } + virtual ~ShortEdgeFixer() + { + } + virtual int getTargetDimension() {return mesh->getDimension();} + virtual bool shouldApply(Entity* e) + { + if ( ! getFlag(adapter,e,BAD_QUALITY)) + return false; + element = e; + Downward edges; + int n = mesh->getDownward(element,1,edges); + double l[6] = {}; + for (int i=0; i < n; ++i) + l[i] = sizeField->measure(edges[i]); + double maxLength; + double minLength; + Entity* shortEdge; + maxLength = minLength = l[0]; + shortEdge = edges[0]; + for (int i=1; i < n; ++i) + { + if (l[i] > maxLength) maxLength = l[i]; + if (l[i] < minLength) + { + minLength = l[i]; + shortEdge = edges[i]; + } + } + if ((maxLength/minLength) < shortEdgeRatio) + { + clearFlag(adapter,element,BAD_QUALITY); + return false; + } + remover.setEdge(shortEdge); + return true; + } + virtual bool requestLocality(apf::CavityOp* o) + { + return remover.requestLocality(o); + } + virtual void apply() + { + if (remover.run()) + ++nr; + else + { + ++nf; + clearFlag(adapter,element,BAD_QUALITY); + } + } + private: + Adapt* adapter; + Mesh* mesh; + Entity* element; + SizeField* sizeField; + ShortEdgeRemover remover; + double shortEdgeRatio; + public: + int nr; + int nf; +}; + +class TetFixerBase +{ + public: + virtual void setTet(Entity** v) = 0; + virtual bool requestLocality(apf::CavityOp* o) = 0; + virtual bool run() = 0; +}; + +class FixBySwap : public TetFixerBase +{ + public: + FixBySwap(Adapt* a): + adapter(a) + { + mesh = a->mesh; + edgeSwap = makeEdgeSwap(a); + nes = nf = numToTry = 0; + edges[0] = 0; + edges[1] = 0; + edges[2] = 0; + } + ~FixBySwap() + { + delete edgeSwap; + } + virtual void setTet(Entity** v) + { + Entity* tet = apf::findElement(mesh, apf::Mesh::TET, v); + PCU_ALWAYS_ASSERT(tet); + match = matchSliver(adapter, tet); + Entity* dv[4]; + mesh->getDownward(tet, 0, dv); + Entity* rv[4]; + rotateTet(dv,match.rotation,rv); + + enum { EDGE_EDGE, FACE_VERT }; + if (match.code_index==EDGE_EDGE) { + Entity* ev[2]; + ev[0] = rv[0]; ev[1] = rv[2]; + edges[0] = findUpward(mesh, apf::Mesh::EDGE, ev); + ev[0] = rv[1]; ev[1] = rv[3]; + edges[1] = findUpward(mesh, apf::Mesh::EDGE, ev); + numToTry = 2; + } + else + { + PCU_ALWAYS_ASSERT(match.code_index==FACE_VERT); + apf::findTriDown(mesh,rv,edges); + numToTry = 3; + } + } + virtual bool requestLocality(apf::CavityOp* o) + { + return o->requestLocality(edges, numToTry); + } + virtual bool run() + { + for (int i=0; i < numToTry; ++i) + if (edgeSwap->run(edges[i])) + { + ++nes; + return true; + } + ++nf; + return false; + } + private: + Adapt* adapter; + Mesh* mesh; + Entity* edges[3]; + EdgeSwap* edgeSwap; + CodeMatch match; + int numToTry; + int nes; + int nf; +}; + +class EdgeVertFixer : public TetFixerBase +{ +public: + EdgeVertFixer(Adapt* a): + singleSplitCollapse(a) + { + mesh = a->mesh; + edgeSwap = makeEdgeSwap(a); + nes = nssc = nf = 0; + edge = 0; + oppVert = 0; + } + ~EdgeVertFixer() + { + delete edgeSwap; + } + virtual void setTet(Entity** v) + { + /* In this template, the edge v[0]--v[1] and vert v[3] + are too close*/ + edge = apf::findElement(mesh, apf::Mesh::EDGE, v); + oppVert = v[3]; + verts[0] = v[0]; + verts[1] = v[1]; + verts[2] = v[3]; + } + virtual bool requestLocality(apf::CavityOp* o) + { + /* by requesting locality for all the verts we can be sure + * that all the desired entities for this operator are local */ + return o->requestLocality(verts,3); + } + virtual bool run() { + if (edgeSwap->run(edge)) { + ++nes; + return true; + } + if (singleSplitCollapse.run(edge, oppVert)) + { + ++nssc; + return true; + } + ++nf; + return false; + } +private: + Mesh* mesh; + Entity* verts[3]; + Entity *edge, *oppVert; + SingleSplitCollapse singleSplitCollapse; + EdgeSwap* edgeSwap; +public: + int nes; /* number of edge swaps done */ + int nssc; /* number of SSCs done */ + int nf; /* number of failures */ +}; + +class FaceVertFixer : public TetFixerBase +{ + public: + FaceVertFixer(Adapt* a): + faceSplitCollapse(a) + { + mesh = a->mesh; + edgeSwap = makeEdgeSwap(a); + nes = nf = nfsc = 0; + edges[0] = 0; + edges[1] = 0; + edges[2] = 0; + verts[0] = 0; + verts[1] = 0; + verts[2] = 0; + verts[3] = 0; + face = 0; + oppVert = 0; + tet = 0; + } + ~FaceVertFixer() + { + delete edgeSwap; + } + virtual void setTet(Entity** v) + { +/* in this template, the bottom face and v[3] + are too close, the key edges are those that bound + face v(0,1,2) */ + apf::findTriDown(mesh,v,edges); + tet = apf::findElement(mesh, apf::Mesh::TET, v); + oppVert = v[3]; + verts[0] = v[0]; + verts[1] = v[1]; + verts[2] = v[2]; + verts[3] = v[3]; + } + virtual bool requestLocality(apf::CavityOp* o) + { + /* by requesting locality for all the verts we can be sure + * that all the desired entities for this operator are local */ + return o->requestLocality(verts,4); + } + virtual bool run() + { + for (int i=0; i < 3; ++i) + if (edgeSwap->run(edges[i])) + { + ++nes; + return true; + } + face = apf::findUpward(mesh, apf::Mesh::TRIANGLE, edges); + if (faceSplitCollapse.run(face, tet)) + { + ++nfsc; + return true; + } + ++nf; + return false; + } + private: + Mesh* mesh; + Entity* edges[3]; + Entity* verts[4]; + Entity *face, *oppVert; + Entity* tet; + FaceSplitCollapse faceSplitCollapse; + EdgeSwap* edgeSwap; + public: + int nes; /* number of edge swaps done */ + int nfsc; /* number of FSCs done */ + int nf; /* number of failures */ +}; + +class EdgeEdgeFixer : public TetFixerBase +{ + public: + EdgeEdgeFixer(Adapt* a): + doubleSplitCollapse(a) + { + mesh = a->mesh; + edgeSwap = makeEdgeSwap(a); + nes = ndsc = nf = 0; + sf = a->sizeField; + edges[0] = 0; + edges[1] = 0; + } + ~EdgeEdgeFixer() + { + delete edgeSwap; + } + virtual void setTet(Entity** v) + { +/* in this template, the v[0]-v[2] amd v[1]-v[3] + edges are too close. */ + Entity* ev[2]; + ev[0] = v[0]; ev[1] = v[2]; + edges[0] = findUpward(mesh, apf::Mesh::EDGE, ev); + ev[0] = v[1]; ev[1] = v[3]; + edges[1] = findUpward(mesh, apf::Mesh::EDGE, ev); + } + virtual bool requestLocality(apf::CavityOp* o) + { + return o->requestLocality(edges,2); + } + virtual bool run() + { + for (int i=0; i < 2; ++i) + if (edgeSwap->run(edges[i])) + { + ++nes; + return true; + } + if (doubleSplitCollapse.run(edges)) + { + ++ndsc; + return true; + } + ++nf; + return false; + } + private: + Mesh* mesh; + Entity* edges[2]; + EdgeSwap* edgeSwap; + DoubleSplitCollapse doubleSplitCollapse; + SizeField* sf; + public: + int nes; + int ndsc; + int nf; +}; + +class LargeAngleTetFixer : public Operator +{ + public: + LargeAngleTetFixer(Adapt* a): + edgeEdgeFixer(a), + edgeVertFixer(a), + faceVertFixer(a) + { + adapter = a; + mesh = a->mesh; + tet = 0; + fixer = 0; + } + virtual ~LargeAngleTetFixer() + { + } + virtual int getTargetDimension() {return 3;} + enum { EDGE_EDGE, FACE_VERT, EDGE_VERT, VERT_VERT }; + virtual bool shouldApply(Entity* e) + { + if ( ! getFlag(adapter,e,BAD_QUALITY)) + return false; + tet = e; + CodeMatch match = matchSliver(adapter,e); + if (match.code_index==EDGE_EDGE) { + fixer = &edgeEdgeFixer; + } else if (match.code_index==FACE_VERT) { + fixer = &faceVertFixer; + } else if (match.code_index==EDGE_VERT) { + fixer = &edgeVertFixer; + } else if (match.code_index==VERT_VERT) { + fixer = &faceVertFixer; + } + Entity* v[4]; + mesh->getDownward(e,0,v); + Entity* rv[4]; + rotateTet(v,match.rotation,rv); + fixer->setTet(rv); + return true; + } + virtual bool requestLocality(apf::CavityOp* o) + { + return fixer->requestLocality(o); + } + virtual void apply() + { + if ( ! fixer->run()) + clearFlag(adapter,tet,BAD_QUALITY); + } + private: + Adapt* adapter; + Mesh* mesh; + Entity* tet; + TetFixerBase* fixer; + public: + EdgeEdgeFixer edgeEdgeFixer; + EdgeVertFixer edgeVertFixer; + FaceVertFixer faceVertFixer; +}; + +class LargeAngleTetAligner : public Operator +{ + public: + LargeAngleTetAligner(Adapt* a): + fixer(a) + { + adapter = a; + mesh = a->mesh; + tet = 0; + } + virtual ~LargeAngleTetAligner() + { + } + virtual int getTargetDimension() {return 3;} + virtual bool shouldApply(Entity* e) + { + if ( ! getFlag(adapter,e,BAD_QUALITY)) + return false; + tet = e; + /* PCU_ALWAYS_ASSERT(mesh->getType(e) == apf::Mesh::TET); */ + enum { EDGE_EDGE, FACE_VERT }; + CodeMatch match = matchSliver(adapter,e); + if (match.code_index==EDGE_EDGE) { + clearFlag(adapter,tet,BAD_QUALITY); + return false; + } + /* else */ + /* { PCU_ALWAYS_ASSERT(match.code_index==FACE_VERT); */ + /* fixer = &faceVertFixer; */ + /* } */ + Entity* v[4]; + mesh->getDownward(e,0,v); + fixer.setTet(v); + return true; + } + virtual bool requestLocality(apf::CavityOp* o) + { + return fixer.requestLocality(o); + } + virtual void apply() + { + if ( ! fixer.run()) + clearFlag(adapter,tet,BAD_QUALITY); + } + private: + Adapt* adapter; + Mesh* mesh; + Entity* tet; + FixBySwap fixer; +}; + class LargeAngleTriFixer : public Operator { public: @@ -191,45 +737,19 @@ class QualityImprover2D : public Operator int nf; }; +static double fixShortEdgeElements(Adapt* a) +{ + double t0 = pcu::Time(); + ShortEdgeFixer fixer(a); + applyOperator(a,&fixer); + double t1 = pcu::Time(); + return t1 - t0; +} + static void fixLargeAngleTets(Adapt* a) { - FaceSplitCollapse faceSplitCollapse(a); - SingleSplitCollapse splitCollapse(a); - DoubleSplitCollapse doubleSplitCollapse(a); - EdgeSwap* edgeSwap = makeEdgeSwap(a); - - Entity* tet; - Iterator* it = a->mesh->begin(3); - while ((tet = a->mesh->iterate(it))) { - if (!getFlag(a, tet, BAD_QUALITY)) continue; - clearFlag(a, tet, BAD_QUALITY); - Entity* verts[4]; - a->mesh->getDownward(tet, 0, verts); - Entity* vert = verts[0]; - Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); - Entity* ents[4]; - double area[4]; - int bit = getTetStats(a, vert, face, tet, ents, area); - - // two large dihedral angles -> key problem: two mesh edges - if (bit==3 || bit==5 || bit==6) { - if (edgeSwap->run(ents[0])) continue; - if (edgeSwap->run(ents[1])) continue; - if (splitCollapse.run(ents[0], vert)) continue; - if (splitCollapse.run(ents[1], vert)) continue; - if (doubleSplitCollapse.run(ents)) continue; - } - // three large dihedral angles -> key entity: a mesh face - else { - Entity* edges[3]; - a->mesh->getDownward(ents[0], 1, edges); - if (edgeSwap->run(edges[0])) continue; - if (edgeSwap->run(edges[1])) continue; - if (edgeSwap->run(edges[2])) continue; - //TODO: RUN FACE SWAP HERE - if (faceSplitCollapse.run(ents[0], tet)) continue; - } - } + LargeAngleTetFixer fixer(a); + applyOperator(a,&fixer); } static void fixLargeAngleTris(Adapt* a) @@ -238,6 +758,18 @@ static void fixLargeAngleTris(Adapt* a) applyOperator(a,&fixer); } +static void alignLargeAngleTets(Adapt* a) +{ + LargeAngleTetAligner aligner(a); + applyOperator(a,&aligner); +} + +static void alignLargeAngleTris(Adapt* a) +{ + LargeAngleTriFixer aligner(a); + applyOperator(a,&aligner); +} + static void improveQualities2D(Adapt* a) { QualityImprover2D improver(a); @@ -255,6 +787,14 @@ static double fixLargeAngles(Adapt* a) return t1 - t0; } +static void alignLargeAngles(Adapt* a) +{ + if (a->mesh->getDimension()==3) + alignLargeAngleTets(a); + else + alignLargeAngleTris(a); +} + double improveQualities(Adapt* a) { double t0 = pcu::Time(); @@ -272,7 +812,6 @@ void fixElementShapes(Adapt* a) return; double t0 = pcu::Time(); int count = markBadQuality(a); - print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", 0, count); int originalCount = count; int prev_count; double time; @@ -281,6 +820,7 @@ void fixElementShapes(Adapt* a) if ( ! count) break; prev_count = count; + print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", iter, count); time = fixLargeAngles(a); /* We need to snap the new verts as soon as they are * created (to avoid future problems). At the moment @@ -290,10 +830,16 @@ void fixElementShapes(Adapt* a) if (a->mesh->getDimension() == 3) snap(a); count = markBadQuality(a); + print(a->mesh->getPCU(), "--fixLargeAngles in %f seconds: #bad elements %d", time,count); + time = fixShortEdgeElements(a); + count = markBadQuality(a); + print(a->mesh->getPCU(), "--fixShortEdgeElements in %f seconds: #bad elements %d", time,count); if (count >= prev_count) unMarkBadQuality(a); // to make sure markEntities does not complain! // balance the mesh to avoid empty parts midBalance(a); + print(a->mesh->getPCU(), "--percent change in number of bad elements %f", + ((double) prev_count - (double) count) / (double) prev_count); iter++; } while(count < prev_count); double t1 = pcu::Time(); @@ -301,6 +847,32 @@ void fixElementShapes(Adapt* a) originalCount,count,t1-t0); } +void alignElements(Adapt* a) +{ + int max_iter = 5; + if ( ! a->input->shouldFixShape) + return; + double t0 = pcu::Time(); + int count = markBadQuality(a); + int originalCount = count; + int prev_count; + int i = 0; + do { + if ( ! count) + break; + prev_count = count; + alignLargeAngles(a); + count = markBadQuality(a); + ++i; + if (count >= prev_count || i >= max_iter) + unMarkBadQuality(a); + } while(count < prev_count && i < max_iter); + + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "non-aligned elements down from %d to %d in %f seconds", + originalCount,count,t1-t0); +} + void printQuality(Adapt* a) { if ( ! a->input->shouldPrintQuality) @@ -309,4 +881,4 @@ void printQuality(Adapt* a) print(a->mesh->getPCU(), "worst element quality is %e", minqual); } -} +} \ No newline at end of file From cc0d27475c230551f73b92bf30c095758646e1d4 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 14:06:57 -0400 Subject: [PATCH 133/319] remove unused --- ma/maAdapt.h | 1 - ma/maCollapse.cc | 19 ------------------- ma/maCollapse.h | 1 - ma/maRefine.cc | 1 - ma/maRefine.h | 1 - 5 files changed, 23 deletions(-) diff --git a/ma/maAdapt.h b/ma/maAdapt.h index e4daa9246..0b7a0324d 100644 --- a/ma/maAdapt.h +++ b/ma/maAdapt.h @@ -11,7 +11,6 @@ #define MA_ADAPT_H #include "maInput.h" -#include namespace ma { diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index cf492249b..fb32eb6ce 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -80,25 +80,6 @@ bool Collapse::edgesGoodSize() { return true; } -bool Collapse::edgeGrewPastMaxLength() { - PCU_ALWAYS_ASSERT(elementsToKeep.size()); - PCU_ALWAYS_ASSERT(elementsToKeep.size() == newElements.size()); - size_t i=0; - APF_ITERATE(EntitySet,elementsToKeep,it) { - Entity* edgesBefore[6]; - adapt->mesh->getDownward(*it,1,edgesBefore); - Entity* edgesAfter[6]; - adapt->mesh->getDownward(newElements[i++],1,edgesAfter); - for (int j=0; j<6; j++) { - double sizeBefore = adapt->sizeField->measure(edgesBefore[j]); - double sizeAfter = adapt->sizeField->measure(edgesAfter[j]); - if (sizeAfter > sizeBefore && sizeAfter > MAXLENGTH) - return true; - } - } - return false; -} - bool Collapse::tryThisDirection(double qualityToBeat) { if (!tryThisDirectionNoCancel(qualityToBeat)) { diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 096bdea8d..d9a449adf 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,7 +42,6 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); - bool edgeGrewPastMaxLength(); double getOldQuality(); Adapt* adapt; Entity* edge; diff --git a/ma/maRefine.cc b/ma/maRefine.cc index 10dea7d95..915d8481a 100644 --- a/ma/maRefine.cc +++ b/ma/maRefine.cc @@ -19,7 +19,6 @@ #include "maLayer.h" #include #include -#include namespace ma { diff --git a/ma/maRefine.h b/ma/maRefine.h index 7553b9551..88efd8275 100644 --- a/ma/maRefine.h +++ b/ma/maRefine.h @@ -12,7 +12,6 @@ #include "maMesh.h" #include "maTables.h" -#include namespace ma { From a9c52a875db6a56321f61ef89edc502ec91405f3 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 15:03:39 -0400 Subject: [PATCH 134/319] fixed snap bug --- ma/maSnap.cc | 23 ++++++++++++----------- 1 file changed, 12 insertions(+), 11 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index eecee363f..93f73e6e2 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -911,17 +911,18 @@ void snap(Adapt* a) Tag* snapTag = a->mesh->createDoubleTag("ma_snap", 3); preventMatchedCavityMods(a); int toSnap = tagVertsToSnap(a, snapTag); - if (toSnap == 0) return; - - Snapper snapper(a, snapTag, false); - snapTaggedVerts(a, snapTag, snapper); - snapLayer(a, snapTag); - - double t1 = pcu::Time(); - print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds", - toSnap, collect(a,snapper.numSnapped), collect(a,snapper.numFailed), collect(a,snapper.numCollapseToVtx), collect(a,snapper.numCollapse), collect(a,snapper.numSwap), collect(a,snapper.numSplitCollapse), t1 - t0); - if (a->hasLayer) - checkLayerShape(a->mesh, "after snapping"); + if (toSnap) + { + Snapper snapper(a, snapTag, false); + snapTaggedVerts(a, snapTag, snapper); + snapLayer(a, snapTag); + + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds", + toSnap, collect(a,snapper.numSnapped), collect(a,snapper.numFailed), collect(a,snapper.numCollapseToVtx), collect(a,snapper.numCollapse), collect(a,snapper.numSwap), collect(a,snapper.numSplitCollapse), t1 - t0); + if (a->hasLayer) + checkLayerShape(a->mesh, "after snapping"); + } a->mesh->destroyTag(snapTag); } } From fcb8e0d2a3cfc51ca3f9e0a31b9d700d236b7466 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 15:06:30 -0400 Subject: [PATCH 135/319] removed unused test --- test/testing.cmake | 6 ------ 1 file changed, 6 deletions(-) diff --git a/test/testing.cmake b/test/testing.cmake index e3aca08b3..9f93a1d66 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -374,11 +374,6 @@ if(ENABLE_ZOLTAN) "${MESHES}/cube/cube.dmg" "${MESHES}/cube/pumi670/cube.smb" "0") - mpi_test(aniso_ma2 1 - ./aniso_ma_test - "${MESHES}/cube/cube.dmg" - "${MESHES}/cube/pumi670/cube.smb" - "1" "8") mpi_test(aniso_ma_serial_log_interpolation 1 ./aniso_ma_test "${MESHES}/cube/cube.dmg" @@ -716,7 +711,6 @@ mpi_test(construct_bottom_up 1 ./construct_bottom_up "${MDIR}/bottom_up_constructed_cube.smb" "${MDIR}/cube.dmg") -mpi_test(coarsen 1 ./coarsen) set(MDIR ${MESHES}/embeddedEdges) mpi_test(embedded_edges 1 ./embedded_edges From 1c1a0f96f321a30b4ffe54f9756bd02102cba049 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 16:05:08 -0400 Subject: [PATCH 136/319] end iterator --- ma/maCoarsen.cc | 1 + 1 file changed, 1 insertion(+) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 9d2310208..05d0d45cd 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -408,6 +408,7 @@ std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) } } clearListFlag(a, shortEdgeVerts, CHECKED); + a->mesh->end(it); return shortEdgeVerts; } From 17628e83be449a577c97af4dbf26b9920385c062 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 17:30:12 -0400 Subject: [PATCH 137/319] split clps valid quality --- ma/maSnapper.cc | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index a2229f3cd..892242f99 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -362,7 +362,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSwap++; return true; } - if (splitCollapse.run(longest, FPP->vert, 0)) { + if (splitCollapse.run(longest, FPP->vert, adapt->input->validQuality)) { numSplitCollapse++; return true; } @@ -379,11 +379,11 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) return true; } for (int i=0; i<2; i++) - if (splitCollapse.run(ents[i], FPP->vert, 0)) { + if (splitCollapse.run(ents[i], FPP->vert, adapt->input->validQuality)) { numSplitCollapse++; return true; } - if (doubleSplitCollapse.run(ents, 0)) { + if (doubleSplitCollapse.run(ents, adapt->input->validQuality)) { numSplitCollapse++; return true; } @@ -400,7 +400,7 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) } } //TODO: RUN FACE SWAP HERE - if (splitCollapse.run(ents[1], FPP->vert, 0)) { + if (splitCollapse.run(ents[1], FPP->vert, adapt->input->validQuality)) { numSplitCollapse++; return true; } From e257e356854bb83058b7b851a4dba7045d2ba795 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 18:26:37 -0400 Subject: [PATCH 138/319] removed meshes --- pumi-meshes | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pumi-meshes b/pumi-meshes index 8d7deb32d..70977efb9 160000 --- a/pumi-meshes +++ b/pumi-meshes @@ -1 +1 @@ -Subproject commit 8d7deb32d6543804738c9bbc19faefc24346a6b3 +Subproject commit 70977efb9c2375bef93d1d6dc7edcfe1759e0174 From a7f40eb0ee0e1440d0710605d8be4b91028ecf5b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 18:27:44 -0400 Subject: [PATCH 139/319] remove double cone --- pumi-meshes | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pumi-meshes b/pumi-meshes index 70977efb9..27415dd6d 160000 --- a/pumi-meshes +++ b/pumi-meshes @@ -1 +1 @@ -Subproject commit 70977efb9c2375bef93d1d6dc7edcfe1759e0174 +Subproject commit 27415dd6d53fe644c1190b79ed95f46812768a60 From 44a7fe7b1b87ab7722c1972dcbf95d1d86155987 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 30 Jul 2025 19:02:10 -0400 Subject: [PATCH 140/319] revert aniso_ma_test --- test/CMakeLists.txt | 1 + test/aniso_adapt.cc | 28 +++++++++++++++++++++++ test/aniso_ma_test.cc | 52 +++++++++++++++++++++++++++++++++++++++---- 3 files changed, 77 insertions(+), 4 deletions(-) create mode 100644 test/aniso_adapt.cc diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index d2630398c..6812153b8 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -174,6 +174,7 @@ test_exe_func(pumiLoadMesh pumiLoadMesh.cc) test_exe_func(xgc_split xgc_split.cc) test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) +test_exe_func(aniso_adapt aniso_adapt.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) test_exe_func(aniso_adapt_sim aniso_adapt_sim.cc) test_exe_func(torus_ma_test torus_ma_test.cc) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc new file mode 100644 index 000000000..fab5aca87 --- /dev/null +++ b/test/aniso_adapt.cc @@ -0,0 +1,28 @@ +#include "ma.h" +#include +#include +#include +#include +#include +#include +#include +#include "aniso_adapt.h" + +int main(int argc, char** argv) +{ + PCU_ALWAYS_ASSERT(argc==3); + const char* modelFile = argv[1]; + const char* meshFile = argv[2]; + pcu::Init(&argc,&argv); + { + pcu::PCU PCUObj; + lion_set_verbosity(1); + gmi_register_mesh(); + ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); + refineSnapTest(m, 0.5, 1); + m->destroyNative(); + apf::destroyMesh(m); + } + pcu::Finalize(); +} + diff --git a/test/aniso_ma_test.cc b/test/aniso_ma_test.cc index fab5aca87..e115d1c58 100644 --- a/test/aniso_ma_test.cc +++ b/test/aniso_ma_test.cc @@ -5,24 +5,68 @@ #include #include #include + #include -#include "aniso_adapt.h" + +class AnIso : public ma::AnisotropicFunction +{ + public: + AnIso(ma::Mesh* m) + { + mesh = m; + average = ma::getAverageEdgeLength(m); + ma::getBoundingBox(m,lower,upper); + } + virtual void getValue(ma::Entity* v, ma::Matrix& R, ma::Vector& H) + { + ma::Vector p = ma::getPosition(mesh,v); + double x = (p[0] - lower[0])/(upper[0] - lower[0]); + double sizeFactor = 2.; + if (x < 0.5) + sizeFactor = 3.; + ma::Vector h(average, average/sizeFactor, average/sizeFactor); + ma::Matrix r(1.0, 0.0, 0.0, + 0.0, 1.0, 0.0, + 0.0, 0.0, 1.0); + H = h; + R = r; + } + private: + ma::Mesh* mesh; + double average; + ma::Vector lower; + ma::Vector upper; +}; int main(int argc, char** argv) { - PCU_ALWAYS_ASSERT(argc==3); + PCU_ALWAYS_ASSERT(argc==4); const char* modelFile = argv[1]; const char* meshFile = argv[2]; + bool logInterpolation = atoi(argv[3]) > 0 ? true : false; pcu::Init(&argc,&argv); { pcu::PCU PCUObj; lion_set_verbosity(1); gmi_register_mesh(); ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); - refineSnapTest(m, 0.5, 1); + m->verify(); + apf::writeVtkFiles("aniso_before",m); + AnIso sf(m); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf, 0, logInterpolation)); + in->shouldRunPreZoltan = true; + in->shouldRunMidParma = true; + in->shouldRunPostParma = true; + in->shouldRefineLayer = true; + in->goodQuality = 0.2; + ma::adapt(in); + m->verify(); + if (logInterpolation) + apf::writeVtkFiles("aniso_log_interpolation_after",m); + else + apf::writeVtkFiles("aniso_after",m); m->destroyNative(); apf::destroyMesh(m); } pcu::Finalize(); } - From b0d8a7fbb56c620d26dabee1f7750cb496744a2a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 31 Jul 2025 19:50:07 -0400 Subject: [PATCH 141/319] cube test --- test/aniso_adapt.cc | 3 +- test/aniso_adapt.h | 71 ++++++++++++++++++++++++++++++++++++++--- test/aniso_adapt_sim.cc | 2 +- test/testing.cmake | 4 +++ 4 files changed, 73 insertions(+), 7 deletions(-) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index fab5aca87..ae7d4daa7 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -19,7 +19,8 @@ int main(int argc, char** argv) lion_set_verbosity(1); gmi_register_mesh(); ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); - refineSnapTest(m, 0.5, 1); + coarsenTest(m); + // refineSnapTest(m); m->destroyNative(); apf::destroyMesh(m); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index de2d68430..8954c522d 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -39,22 +39,83 @@ class AnIso : public ma::AnisotropicFunction ma::Vector lower, upper; }; -void refineSnapTest(ma::Mesh* m, double sizeFactor1, double sizeFactor2) +void measureQuality(ma::Mesh* m, double& avgQuality, double& minQuality) +{ + int d = m->getDimension(); + apf::MeshEntity* elem; + apf::MeshIterator* elems = m->begin(d); + ma::IdentitySizeField I(m); + while ((elem = m->iterate(elems))) { + double q = ma::measureElementQuality(m, &I, elem); + avgQuality += q; + minQuality = fmin(minQuality, q); + } + m->end(elems); + avgQuality = avgQuality / m->count(d); +} + +int countEdges(ma::Mesh* m) +{ + return m->count(1); +} + +void coarsenTest(ma::Mesh* m) { m->verify(); - apf::writeVtkFiles("before_adapt",m); - AnIso sf(m, sizeFactor1, sizeFactor2); + apf::writeVtkFiles("before_coarsen_test",m); + AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); + double avgQualBefore, avgQualAfter, minQualBefore, minQualAfter; + measureQuality(m, avgQualBefore, minQualBefore); + double averageBefore = ma::getAverageEdgeLength(m); + int edgesBefore = countEdges(m); ma::coarsenMultiple(a); + measureQuality(m, avgQualAfter, minQualAfter); + double averageAfter = ma::getAverageEdgeLength(m); + int edgesAfter = countEdges(m); + + PCU_ALWAYS_ASSERT(edgesBefore > edgesAfter); + PCU_ALWAYS_ASSERT(averageBefore < averageAfter); + PCU_ALWAYS_ASSERT(minQualBefore <= minQualAfter); + // PCU_ALWAYS_ASSERT(avgQualBefore <= avgQualAfter); + + + //TODO: Check that force coarsen again doesn't result in any changes + m->verify(); + apf::printStats(m); + apf::writeVtkFiles("after_coarsen_test",m); + delete a; + // cleanup input object and associated sizefield and solutiontransfer objects + if (in->ownsSizeField) + delete in->sizeField; + if (in->ownsSolutionTransfer) + delete in->solutionTransfer; + delete in; +} + +void refineSnapTest(ma::Mesh* m) +{ + m->verify(); + apf::writeVtkFiles("before_adapt",m); + AnIso sf(m, 2, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + ma::Adapt* a = new ma::Adapt(in); + int edgesBefore = countEdges(m); + double averageBefore = ma::getAverageEdgeLength(m); + for (int i = 0; i < in->maximumIterations; ++i) { ma::refine(a); ma::snap(a); - ma::coarsenMultiple(a); } - ma::fixElementShapes(a); + int edgesAfter = countEdges(m); + double averageAfter = ma::getAverageEdgeLength(m); + PCU_ALWAYS_ASSERT(edgesBefore < edgesAfter); + PCU_ALWAYS_ASSERT(averageBefore > averageAfter); + + m->verify(); apf::writeVtkFiles("after_adapt",m); } \ No newline at end of file diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index cfe91a37b..0c6e40b1b 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -56,7 +56,7 @@ int main(int argc, char* argv[]) { apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); //Adapt - refineSnapTest(m, 3, 1); + refineSnapTest(m); //Clean up m->destroyNative(); diff --git a/test/testing.cmake b/test/testing.cmake index 9f93a1d66..08f6ab20d 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -369,6 +369,10 @@ if(ENABLE_ZOLTAN) ./ma_test "${MDIR}/pipe.${GXT}" "pipe.smb") + mpi_test(adapt_cube 1 + ./aniso_adapt + "${MESHES}/cube/cube.dmg" + "${MESHES}/cube/pumi7k/cube.smb") mpi_test(aniso_ma_serial 1 ./aniso_ma_test "${MESHES}/cube/cube.dmg" From 2440d949b552b81fc370e65c68bdb86523ddaad8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 31 Jul 2025 20:27:13 -0400 Subject: [PATCH 142/319] force coarsen test --- test/aniso_adapt.cc | 5 +--- test/aniso_adapt.h | 65 +++++++++++++++++++++++++++++++++++++-------- 2 files changed, 55 insertions(+), 15 deletions(-) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index ae7d4daa7..141ce3791 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -18,11 +18,8 @@ int main(int argc, char** argv) pcu::PCU PCUObj; lion_set_verbosity(1); gmi_register_mesh(); - ma::Mesh* m = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); - coarsenTest(m); + coarsenTest(modelFile,meshFile,&PCUObj); // refineSnapTest(m); - m->destroyNative(); - apf::destroyMesh(m); } pcu::Finalize(); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 8954c522d..46a60574c 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -59,33 +59,61 @@ int countEdges(ma::Mesh* m) return m->count(1); } -void coarsenTest(ma::Mesh* m) +ma::Mesh* coarsenForced(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) { + ma::Mesh* m = apf::loadMdsMesh(modelfile,meshfile,PCUObj); m->verify(); - apf::writeVtkFiles("before_coarsen_test",m); AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + in->shouldForceAdaptation = true; ma::Adapt* a = new ma::Adapt(in); double avgQualBefore, avgQualAfter, minQualBefore, minQualAfter; measureQuality(m, avgQualBefore, minQualBefore); double averageBefore = ma::getAverageEdgeLength(m); int edgesBefore = countEdges(m); + ma::coarsenMultiple(a); + measureQuality(m, avgQualAfter, minQualAfter); - double averageAfter = ma::getAverageEdgeLength(m); - int edgesAfter = countEdges(m); - PCU_ALWAYS_ASSERT(edgesBefore > edgesAfter); - PCU_ALWAYS_ASSERT(averageBefore < averageAfter); - PCU_ALWAYS_ASSERT(minQualBefore <= minQualAfter); - // PCU_ALWAYS_ASSERT(avgQualBefore <= avgQualAfter); + PCU_ALWAYS_ASSERT(edgesBefore > countEdges(m)); + PCU_ALWAYS_ASSERT(averageBefore < ma::getAverageEdgeLength(m)); + PCU_ALWAYS_ASSERT(minQualAfter >= 0); + + m->verify(); + delete a; + // cleanup input object and associated sizefield and solutiontransfer objects + if (in->ownsSizeField) + delete in->sizeField; + if (in->ownsSolutionTransfer) + delete in->solutionTransfer; + delete in; + return m; +} + +ma::Mesh* coarsenRegular(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +{ + ma::Mesh* m = apf::loadMdsMesh(modelfile,meshfile,PCUObj); + m->verify(); + AnIso sf(m, .5, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + ma::Adapt* a = new ma::Adapt(in); + double avgQualBefore, avgQualAfter, minQualBefore, minQualAfter; + + measureQuality(m, avgQualBefore, minQualBefore); + double averageBefore = ma::getAverageEdgeLength(m); + int edgesBefore = countEdges(m); + ma::coarsenMultiple(a); + + measureQuality(m, avgQualAfter, minQualAfter); + + PCU_ALWAYS_ASSERT(edgesBefore > countEdges(m)); + PCU_ALWAYS_ASSERT(averageBefore < ma::getAverageEdgeLength(m)); + PCU_ALWAYS_ASSERT(fabs(minQualBefore - minQualAfter) < 0.001f || minQualBefore < minQualAfter); - //TODO: Check that force coarsen again doesn't result in any changes m->verify(); - apf::printStats(m); - apf::writeVtkFiles("after_coarsen_test",m); delete a; // cleanup input object and associated sizefield and solutiontransfer objects if (in->ownsSizeField) @@ -93,6 +121,21 @@ void coarsenTest(ma::Mesh* m) if (in->ownsSolutionTransfer) delete in->solutionTransfer; delete in; + return m; +} + +void coarsenTest(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +{ + ma::Mesh* mReg = coarsenRegular(modelfile, meshfile, PCUObj); + ma::Mesh* mForce = coarsenForced(modelfile, meshfile, PCUObj); + + PCU_ALWAYS_ASSERT(countEdges(mReg) > countEdges(mForce)); + PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(mReg) < ma::getAverageEdgeLength(mForce)); + + mReg->destroyNative(); + apf::destroyMesh(mReg); + mForce->destroyNative(); + apf::destroyMesh(mForce); } void refineSnapTest(ma::Mesh* m) From ae33ba52321bb6f760f5cf096933aabdb22c634b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 31 Jul 2025 23:05:30 -0400 Subject: [PATCH 143/319] snap test --- test/aniso_adapt.cc | 2 +- test/aniso_adapt.h | 45 ++++++++++++++++++++++++++++++++++------- test/aniso_adapt_sim.cc | 5 ++++- 3 files changed, 43 insertions(+), 9 deletions(-) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index 141ce3791..0b3b00094 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -19,7 +19,7 @@ int main(int argc, char** argv) lion_set_verbosity(1); gmi_register_mesh(); coarsenTest(modelFile,meshFile,&PCUObj); - // refineSnapTest(m); + refineSnapTest(modelFile,meshFile,&PCUObj); } pcu::Finalize(); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 46a60574c..09cb9cee7 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -13,6 +13,7 @@ #include "maRefine.h" #include "maShape.h" #include "maSnap.h" +#include "apfGeometry.h" class AnIso : public ma::AnisotropicFunction { @@ -138,10 +139,35 @@ void coarsenTest(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) apf::destroyMesh(mForce); } -void refineSnapTest(ma::Mesh* m) +bool allVertsOnModel(ma::Adapt* a) { + if (!a->input->shouldSnap) + return true; + ma::Mesh* m = a->mesh; + int dim = m->getDimension(); + ma::Iterator* it = m->begin(0); + ma::Entity* vert; + while ((vert = m->iterate(it))) { + int md = m->getModelType(m->toModel(vert)); + if (dim == 3 && md == 3) + continue; + ma::Vector position = ma::getPosition(m, vert); + ma::Model* g = m->toModel(vert); + ma::Vector target; + ma::Vector closest; + m->getClosestPoint(g, position, target, closest); + (void) target; + if (!apf::areClose(position, closest, 1e-12)) + return false; + } + m->end(it); + return true; +} + +void refineSnapTest(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +{ + ma::Mesh* m = apf::loadMdsMesh(modelfile,meshfile,PCUObj); m->verify(); - apf::writeVtkFiles("before_adapt",m); AnIso sf(m, 2, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); @@ -153,12 +179,17 @@ void refineSnapTest(ma::Mesh* m) ma::refine(a); ma::snap(a); } - int edgesAfter = countEdges(m); - double averageAfter = ma::getAverageEdgeLength(m); - PCU_ALWAYS_ASSERT(edgesBefore < edgesAfter); - PCU_ALWAYS_ASSERT(averageBefore > averageAfter); + PCU_ALWAYS_ASSERT(edgesBefore < countEdges(m)); + PCU_ALWAYS_ASSERT(averageBefore > ma::getAverageEdgeLength(m)); + PCU_ALWAYS_ASSERT(allVertsOnModel(a)); m->verify(); - apf::writeVtkFiles("after_adapt",m); + delete a; + // cleanup input object and associated sizefield and solutiontransfer objects + if (in->ownsSizeField) + delete in->sizeField; + if (in->ownsSolutionTransfer) + delete in->solutionTransfer; + delete in; } \ No newline at end of file diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 0c6e40b1b..2921e9c95 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -56,7 +56,10 @@ int main(int argc, char* argv[]) { apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); //Adapt - refineSnapTest(m); + m->verify(); + AnIso sf(m, 3, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + adapt(in); //Clean up m->destroyNative(); From daae4be32efc3d22880fc87bacf76ff95893a0ed Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 1 Aug 2025 17:19:30 -0400 Subject: [PATCH 144/319] fixed layer snapping error --- ma/maSnap.cc | 2 ++ ma/maSnapper.cc | 14 +++++++++----- 2 files changed, 11 insertions(+), 5 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 93f73e6e2..ede269847 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -772,6 +772,8 @@ class SnapAll : public Operator { if ( ! getFlag(adapter, e, SNAP)) return false; + if (getFlag(adapter, e, LAYER)) + return false; vert = e; snapper->setVert(e); return true; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 892242f99..072c81d01 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -585,12 +585,18 @@ static FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up return FPP; } -static void getInvalidTets(Mesh* mesh, Upward& adjacentElements, apf::Up& invalid) +static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) { invalid.n = 0; Vector v[4]; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - ma::getVertPoints(mesh,adjacentElements[i],v); + /* for now, when snapping a vertex on the boundary + layer, ignore the quality of layer elements. + not only do we not have metrics for this, but the + algorithm that moves curves would need to change */ + if (getFlag(a, adjacentElements[i], LAYER)) + continue; + ma::getVertPoints(a->mesh,adjacentElements[i],v); if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) invalid.e[invalid.n++] = adjacentElements[i]; } @@ -606,7 +612,7 @@ static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& i Upward adjacentElements; mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); mesh->setPoint(vertex, 0, target); - getInvalidTets(mesh, adjacentElements, invalid); + getInvalidTets(adapt, adjacentElements, invalid); if (invalid.n == 0) return true; mesh->setPoint(vertex, 0, prev); return false; @@ -624,7 +630,6 @@ bool Snapper::run() { apf::Up invalid; bool success = tryReposition(adapt, vert, snapTag, invalid); - if (success) { numSnapped++; mesh->removeTag(vert,snapTag); @@ -633,7 +638,6 @@ bool Snapper::run() } FirstProblemPlane* FPP = getFPP(adapt, vert, snapTag, invalid); - if (!success) success = tryCollapseToVertex(FPP); if (!success) success = tryReduceCommonEdges(FPP); if (!success) success = tryCollapseTetEdges(FPP); From f127dadbd4b1f669d7833f7800beb98fa7b3dc3f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 1 Aug 2025 18:42:10 -0400 Subject: [PATCH 145/319] adapt_cap --- test/CMakeLists.txt | 3 +- test/aniso_adapt_cap.cc | 146 ++++++++++++++++++++++++++++++++++++++++ 2 files changed, 148 insertions(+), 1 deletion(-) create mode 100644 test/aniso_adapt_cap.cc diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 6812153b8..59ed44c4a 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -176,7 +176,6 @@ test_exe_func(ma_insphere ma_insphere.cc) test_exe_func(ma_test ma_test.cc) test_exe_func(aniso_adapt aniso_adapt.cc) test_exe_func(aniso_ma_test aniso_ma_test.cc) -test_exe_func(aniso_adapt_sim aniso_adapt_sim.cc) test_exe_func(torus_ma_test torus_ma_test.cc) test_exe_func(dg_ma_test dg_ma_test.cc) test_exe_func(prismCodeMatch ../ma/prismCodeMatch.cc) @@ -207,6 +206,7 @@ if(ENABLE_DSP) endif() if(ENABLE_SIMMETRIX) test_exe_func(curvetest curvetest.cc) + test_exe_func(aniso_adapt_sim aniso_adapt_sim.cc) test_exe_func(curve_to_bezier curve_to_bezier.cc) test_exe_func(make_all_cavities makeAllCavities.cc) test_exe_func(inClosureOf_test inClosureOf_test.cc) @@ -230,6 +230,7 @@ if(ENABLE_CAPSTONE) util_exe_func(capGeomTest capGeomTest.cc) util_exe_func(capCheckParam capCheckParam.cc) util_exe_func(capAdapt capAdapt.cc) + test_exe_func(aniso_adapt_cap aniso_adapt_cap.cc) target_link_libraries(capAdapt framework_meshing) endif() diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc new file mode 100644 index 000000000..4a3f10961 --- /dev/null +++ b/test/aniso_adapt_cap.cc @@ -0,0 +1,146 @@ +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include "maAdapt.h" +#include "maCoarsen.h" +#include "maRefine.h" +#include "maSnap.h" +#include "lionPrint.h" +#include "aniso_adapt.h" + +#include "CapstoneModule.h" +#include "CreateMG_Framework_Core.h" +#include "CreateMG_Framework_Analysis.h" +#include "CreateMG_Framework_Application.h" +#include "CreateMG_Framework_Attributes.h" +#include "CreateMG_Framework_Core.h" +#include "CreateMG_Framework_Geometry.h" +#include "CreateMG_Framework_Mesh.h" + +using namespace CreateMG; +using namespace CreateMG::Attribution; +using namespace CreateMG::Mesh; +using namespace CreateMG::Geometry; + +int main(int argc, char** argv) +{ + MPI_Init(&argc, &argv); + { + pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); + + if (argc < 2) { + if(PCUObj.Self()==0) + std::cerr << "usage: " << argv[0] + << " <.cre file> or\n" + << " <.smb file> \n"; + return EXIT_FAILURE; + } + + + gmi_register_mesh(); + gmi_register_null(); + + const char* meshFile = argv[1]; + // load capstone mesh + // create an instance of the Capstone Module activating CREATE/CREATE/CREATE + // for the Geometry/Mesh/Attribution databases + /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ + const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD + const std::string mdbName("Mesh Database : Create"); + const std::string adbName("Attribution Database : Create"); + + CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); + + GeometryDatabaseInterface *g = cs.get_geometry(); + MeshDatabaseInterface *m = cs.get_mesh(); + AppContext *c = cs.get_context(); + + PCU_ALWAYS_ASSERT(g); + PCU_ALWAYS_ASSERT(m); + PCU_ALWAYS_ASSERT(c); + + v_string filenames; + filenames.push_back(meshFile); + + M_GModel gmodel = cs.load_files(filenames); + + int numbreps = 0; + MG_CALL(g->get_num_breps(numbreps)); + std::cout << "number of b reps is " << numbreps << std::endl; + if(numbreps == 0) + error(HERE, ERR_INVALID_INPUT, "Model is empty"); + + M_MModel mmodel; + // Pick the volume mesh model from associated mesh models to this geom model + std::vector mmodels; + MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); + for(std::size_t i = 0; i < mmodels.size(); ++i) + { + M_MModel ammodel = mmodels[i]; + std::size_t numregs = 0; + std::size_t numfaces = 0; + std::size_t numedges = 0; + std::size_t numverts = 0; + MG_API_CALL(m, set_current_model(ammodel)); + MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); + MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); + MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); + MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); + std::cout << "num regions is " << numregs << std::endl; + std::cout << "num faces is " << numfaces << std::endl; + std::cout << "num edges is " << numedges << std::endl; + std::cout << "num verts is " << numverts << std::endl; + std::cout << "-----------" << std::endl; + if(numregs > 0) + { + mmodel = ammodel; + break; + } + } + + /* SET THE ADJACENCIES */ + MG_API_CALL(m, set_adjacency_state(REGION2FACE| + REGION2EDGE| + REGION2VERTEX| + FACE2EDGE| + FACE2VERTEX)); + MG_API_CALL(m, set_reverse_states()); + MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); + MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); + MG_API_CALL(m, compute_adjacency()); + + gmi_cap_start(); + gmi_register_cap(); + + // convert the mesh to apf/mds mesh + + apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); + lion_set_verbosity(1); + + //Adapt + // refineSnapTest(mesh, 2, 1); + + gmi_cap_stop(); + } + MPI_Finalize(); +} \ No newline at end of file From e04178f8b4169e3288e0b25dc0aecde4142bb2a9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 1 Aug 2025 20:53:14 -0400 Subject: [PATCH 146/319] sim_test --- pumi-meshes | 2 +- test/aniso_adapt.cc | 13 +++++++++++-- test/aniso_adapt.h | 35 ++++++++++++++++++----------------- test/aniso_adapt_sim.cc | 38 ++++++++++++++++++++------------------ test/testing.cmake | 5 +++++ 5 files changed, 55 insertions(+), 38 deletions(-) diff --git a/pumi-meshes b/pumi-meshes index 27415dd6d..aa88a43c3 160000 --- a/pumi-meshes +++ b/pumi-meshes @@ -1 +1 @@ -Subproject commit 27415dd6d53fe644c1190b79ed95f46812768a60 +Subproject commit aa88a43c3a51f06b1b1060a3d4196a7509d236b2 diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index 0b3b00094..cc1ef8365 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -8,6 +8,11 @@ #include #include "aniso_adapt.h" +ma::Mesh* createMesh(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +{ + return apf::loadMdsMesh(modelfile,meshfile,PCUObj); +} + int main(int argc, char** argv) { PCU_ALWAYS_ASSERT(argc==3); @@ -18,8 +23,12 @@ int main(int argc, char** argv) pcu::PCU PCUObj; lion_set_verbosity(1); gmi_register_mesh(); - coarsenTest(modelFile,meshFile,&PCUObj); - refineSnapTest(modelFile,meshFile,&PCUObj); + + auto createMeshValues = [modelFile,meshFile,&PCUObj]() + { return createMesh(modelFile,meshFile,&PCUObj); }; + + coarsenTest(createMeshValues); + refineSnapTest(createMeshValues); } pcu::Finalize(); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 09cb9cee7..4a02a7e44 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -14,6 +14,7 @@ #include "maShape.h" #include "maSnap.h" #include "apfGeometry.h" +#include class AnIso : public ma::AnisotropicFunction { @@ -60,9 +61,9 @@ int countEdges(ma::Mesh* m) return m->count(1); } -ma::Mesh* coarsenForced(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +ma::Mesh* coarsenForced(const std::function& createMesh) { - ma::Mesh* m = apf::loadMdsMesh(modelfile,meshfile,PCUObj); + ma::Mesh* m = createMesh(); m->verify(); AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); @@ -93,9 +94,9 @@ ma::Mesh* coarsenForced(const char* modelfile, const char* meshfile, pcu::PCU *P return m; } -ma::Mesh* coarsenRegular(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +ma::Mesh* coarsenRegular(const std::function& createMesh) { - ma::Mesh* m = apf::loadMdsMesh(modelfile,meshfile,PCUObj); + ma::Mesh* m = createMesh(); m->verify(); AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); @@ -125,10 +126,10 @@ ma::Mesh* coarsenRegular(const char* modelfile, const char* meshfile, pcu::PCU * return m; } -void coarsenTest(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +void coarsenTest(const std::function& createMesh) { - ma::Mesh* mReg = coarsenRegular(modelfile, meshfile, PCUObj); - ma::Mesh* mForce = coarsenForced(modelfile, meshfile, PCUObj); + ma::Mesh* mReg = coarsenRegular(createMesh); + ma::Mesh* mForce = coarsenForced(createMesh); PCU_ALWAYS_ASSERT(countEdges(mReg) > countEdges(mForce)); PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(mReg) < ma::getAverageEdgeLength(mForce)); @@ -151,24 +152,24 @@ bool allVertsOnModel(ma::Adapt* a) int md = m->getModelType(m->toModel(vert)); if (dim == 3 && md == 3) continue; + ma::Vector modelPoint, param; + m->getPoint(vert,0,modelPoint); + m->getParam(vert,param); + ma::Model* model = m->toModel(vert); + m->snapToModel(model,param,modelPoint); ma::Vector position = ma::getPosition(m, vert); - ma::Model* g = m->toModel(vert); - ma::Vector target; - ma::Vector closest; - m->getClosestPoint(g, position, target, closest); - (void) target; - if (!apf::areClose(position, closest, 1e-12)) - return false; + if (apf::areClose(modelPoint, position, 1e-12)) + continue; } m->end(it); return true; } -void refineSnapTest(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) +void refineSnapTest(const std::function& createMesh) { - ma::Mesh* m = apf::loadMdsMesh(modelfile,meshfile,PCUObj); + ma::Mesh* m = createMesh(); m->verify(); - AnIso sf(m, 2, 1); + AnIso sf(m, 3, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); int edgesBefore = countEdges(m); diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 2921e9c95..4c50e4dca 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -23,15 +23,29 @@ #include "SimAdvMeshing.h" #include "SimMeshTools.h" -int main(int argc, char* argv[]) { +ma::Mesh* createMesh(const char* nativefile, const char* smdfile, const char* smsfile, pcu::PCU* PCUObj) +{ + pProgress progress = Progress_new(); + Progress_setDefaultCallback(progress); + gmi_model* mdl_ref = gmi_sim_load(nativefile, smdfile); + pGModel model = gmi_export_sim(mdl_ref); + pParMesh mesh = PM_load(smsfile, model, progress); + ma::Mesh* mesh_ref = apf::createMesh(mesh, PCUObj); + apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); + return m; +} + +int main(int argc, char* argv[]) +{ if (argc != 4) { std::cerr << "Usage: " << argv[0] << " " << std::endl; return 1; } //Load Mesh - const char* modelFile = argv[1]; - const char* meshFile = argv[2]; + const char* nativefile = argv[1]; + const char* smdfile = argv[2]; + const char* smsfile = argv[3]; MPI_Init(&argc, &argv); pcu::PCU *PCUObj = new pcu::PCU(MPI_COMM_WORLD); lion_set_verbosity(1); @@ -46,24 +60,12 @@ int main(int argc, char* argv[]) { gmi_sim_start(); gmi_register_sim(); - pProgress progress = Progress_new(); - Progress_setDefaultCallback(progress); - gmi_model* mdl_ref = gmi_sim_load(argv[1], argv[2]); - pGModel model = gmi_export_sim(mdl_ref); - pParMesh mesh = PM_load(argv[3], model, progress); - ma::Mesh* mesh_ref = apf::createMesh(mesh, PCUObj); - apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); + auto createMeshValues = [nativefile, smdfile, smsfile, PCUObj]() + { return createMesh(nativefile, smdfile, smsfile, PCUObj); }; - //Adapt - m->verify(); - AnIso sf(m, 3, 1); - ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); - adapt(in); + refineSnapTest(createMeshValues); - //Clean up - m->destroyNative(); - apf::destroyMesh(m); delete PCUObj; MPI_Finalize(); } diff --git a/test/testing.cmake b/test/testing.cmake index 08f6ab20d..f1f7985b3 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -363,6 +363,11 @@ if(ENABLE_SIMMETRIX) "pipe_unif.smb" "pipe.smb") set_test_depends(TESTS snap_serial DEPENDS uniform_serial) + mpi_test(adapt_deformed_slab 1 + ./aniso_adapt_sim + "${MESHES}/deformedSlab/sim_model.x_t" + "${MESHES}/deformedSlab/sim_model.smd" + "${MESHES}/deformedSlab/sim_mesh.sms") endif() if(ENABLE_ZOLTAN) mpi_test(ma_serial 1 From 7b6a33fa162b989b07e0ef936ed679170443f867 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 2 Aug 2025 17:01:24 -0400 Subject: [PATCH 147/319] refine into coarsen --- test/aniso_adapt.cc | 3 +-- test/aniso_adapt.h | 46 +++++++++++++++++++++++------------------ test/aniso_adapt_sim.cc | 2 +- 3 files changed, 28 insertions(+), 23 deletions(-) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index cc1ef8365..6e1eb334d 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -27,8 +27,7 @@ int main(int argc, char** argv) auto createMeshValues = [modelFile,meshFile,&PCUObj]() { return createMesh(modelFile,meshFile,&PCUObj); }; - coarsenTest(createMeshValues); - refineSnapTest(createMeshValues); + adaptTests(createMeshValues); } pcu::Finalize(); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 4a02a7e44..706df1b19 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -61,9 +61,8 @@ int countEdges(ma::Mesh* m) return m->count(1); } -ma::Mesh* coarsenForced(const std::function& createMesh) +ma::Mesh* coarsenForced(ma::Mesh* m) { - ma::Mesh* m = createMesh(); m->verify(); AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); @@ -94,9 +93,8 @@ ma::Mesh* coarsenForced(const std::function& createMesh) return m; } -ma::Mesh* coarsenRegular(const std::function& createMesh) +ma::Mesh* coarsenRegular(ma::Mesh* m) { - ma::Mesh* m = createMesh(); m->verify(); AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); @@ -126,20 +124,6 @@ ma::Mesh* coarsenRegular(const std::function& createMesh) return m; } -void coarsenTest(const std::function& createMesh) -{ - ma::Mesh* mReg = coarsenRegular(createMesh); - ma::Mesh* mForce = coarsenForced(createMesh); - - PCU_ALWAYS_ASSERT(countEdges(mReg) > countEdges(mForce)); - PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(mReg) < ma::getAverageEdgeLength(mForce)); - - mReg->destroyNative(); - apf::destroyMesh(mReg); - mForce->destroyNative(); - apf::destroyMesh(mForce); -} - bool allVertsOnModel(ma::Adapt* a) { if (!a->input->shouldSnap) @@ -165,9 +149,8 @@ bool allVertsOnModel(ma::Adapt* a) return true; } -void refineSnapTest(const std::function& createMesh) +ma::Mesh* refineSnapTest(ma::Mesh* m) { - ma::Mesh* m = createMesh(); m->verify(); AnIso sf(m, 3, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); @@ -193,4 +176,27 @@ void refineSnapTest(const std::function& createMesh) if (in->ownsSolutionTransfer) delete in->solutionTransfer; delete in; + return m; +} + +void adaptTests(const std::function& createMesh) +{ + ma::Mesh* meshReg = createMesh(); + apf::writeVtkFiles("startMesh", meshReg); + refineSnapTest(meshReg); + apf::writeVtkFiles("afterRefine", meshReg); + + + coarsenRegular(meshReg); + apf::writeVtkFiles("afterCoarsen", meshReg); + ma::Mesh* meshForce = coarsenForced(refineSnapTest(createMesh())); + apf::writeVtkFiles("afterForcedCoarsen", meshForce); + + PCU_ALWAYS_ASSERT(countEdges(meshReg) > countEdges(meshForce)); + PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(meshReg) < ma::getAverageEdgeLength(meshForce)); + + meshReg->destroyNative(); + apf::destroyMesh(meshReg); + meshForce->destroyNative(); + apf::destroyMesh(meshForce); } \ No newline at end of file diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 4c50e4dca..32881f641 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -64,7 +64,7 @@ int main(int argc, char* argv[]) auto createMeshValues = [nativefile, smdfile, smsfile, PCUObj]() { return createMesh(nativefile, smdfile, smsfile, PCUObj); }; - refineSnapTest(createMeshValues); + adaptTests(createMeshValues); delete PCUObj; MPI_Finalize(); From 02edf078b2addd99010ec63b86e7ecf0b5b0a57f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 2 Aug 2025 17:13:37 -0400 Subject: [PATCH 148/319] aniso adapt cap tests --- test/aniso_adapt.h | 3 +- test/aniso_adapt_cap.cc | 91 +++++++++++++++++++++-------------------- 2 files changed, 48 insertions(+), 46 deletions(-) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 706df1b19..d20272aff 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -183,12 +183,13 @@ void adaptTests(const std::function& createMesh) { ma::Mesh* meshReg = createMesh(); apf::writeVtkFiles("startMesh", meshReg); + refineSnapTest(meshReg); apf::writeVtkFiles("afterRefine", meshReg); - coarsenRegular(meshReg); apf::writeVtkFiles("afterCoarsen", meshReg); + ma::Mesh* meshForce = coarsenForced(refineSnapTest(createMesh())); apf::writeVtkFiles("afterForcedCoarsen", meshForce); diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 4a3f10961..7f73dfc7f 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -42,25 +42,8 @@ using namespace CreateMG::Attribution; using namespace CreateMG::Mesh; using namespace CreateMG::Geometry; -int main(int argc, char** argv) +ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) { - MPI_Init(&argc, &argv); - { - pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); - - if (argc < 2) { - if(PCUObj.Self()==0) - std::cerr << "usage: " << argv[0] - << " <.cre file> or\n" - << " <.smb file> \n"; - return EXIT_FAILURE; - } - - - gmi_register_mesh(); - gmi_register_null(); - - const char* meshFile = argv[1]; // load capstone mesh // create an instance of the Capstone Module activating CREATE/CREATE/CREATE // for the Geometry/Mesh/Attribution databases @@ -88,7 +71,7 @@ int main(int argc, char** argv) MG_CALL(g->get_num_breps(numbreps)); std::cout << "number of b reps is " << numbreps << std::endl; if(numbreps == 0) - error(HERE, ERR_INVALID_INPUT, "Model is empty"); + error(HERE, ERR_INVALID_INPUT, "Model is empty"); M_MModel mmodel; // Pick the volume mesh model from associated mesh models to this geom model @@ -96,26 +79,25 @@ int main(int argc, char** argv) MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); for(std::size_t i = 0; i < mmodels.size(); ++i) { - M_MModel ammodel = mmodels[i]; - std::size_t numregs = 0; - std::size_t numfaces = 0; - std::size_t numedges = 0; - std::size_t numverts = 0; - MG_API_CALL(m, set_current_model(ammodel)); - MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); - MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); - MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); - MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); - std::cout << "num regions is " << numregs << std::endl; - std::cout << "num faces is " << numfaces << std::endl; - std::cout << "num edges is " << numedges << std::endl; - std::cout << "num verts is " << numverts << std::endl; - std::cout << "-----------" << std::endl; - if(numregs > 0) - { - mmodel = ammodel; - break; - } + M_MModel ammodel = mmodels[i]; + std::size_t numregs = 0; + std::size_t numfaces = 0; + std::size_t numedges = 0; + std::size_t numverts = 0; + MG_API_CALL(m, set_current_model(ammodel)); + MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); + MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); + MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); + MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); + std::cout << "num regions is " << numregs << std::endl; + std::cout << "num faces is " << numfaces << std::endl; + std::cout << "num edges is " << numedges << std::endl; + std::cout << "num verts is " << numverts << std::endl; + std::cout << "-----------" << std::endl; + if(numregs > 0) { + mmodel = ammodel; + break; + } } /* SET THE ADJACENCIES */ @@ -129,16 +111,35 @@ int main(int argc, char** argv) MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); MG_API_CALL(m, compute_adjacency()); + apf::Mesh2* mesh = apf::createMesh(m,g,PCUObj); + return mesh; +} + +int main(int argc, char** argv) +{ + MPI_Init(&argc, &argv); + { + pcu::PCU PCUObj = pcu::PCU(MPI_COMM_WORLD); + + if (argc < 2) { + if(PCUObj.Self()==0) + std::cerr << "usage: " << argv[0] + << " <.cre file> or\n" + << " <.smb file> \n"; + return EXIT_FAILURE; + } + + gmi_register_mesh(); + gmi_register_null(); gmi_cap_start(); gmi_register_cap(); + lion_set_verbosity(1); - // convert the mesh to apf/mds mesh + const char* meshFile = argv[1]; + auto createMeshValues = [meshFile, &PCUObj]() + { return createMesh(meshFile, &PCUObj); }; - apf::Mesh2* mesh = apf::createMesh(m,g,&PCUObj); - lion_set_verbosity(1); - - //Adapt - // refineSnapTest(mesh, 2, 1); + adaptTests(createMeshValues); gmi_cap_stop(); } From a672a3ce41d3ba5aee1ebd19a0ec9b24ade5502d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 2 Aug 2025 17:16:43 -0400 Subject: [PATCH 149/319] smaller cube test --- test/testing.cmake | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/test/testing.cmake b/test/testing.cmake index f1f7985b3..69f915aef 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -377,7 +377,7 @@ if(ENABLE_ZOLTAN) mpi_test(adapt_cube 1 ./aniso_adapt "${MESHES}/cube/cube.dmg" - "${MESHES}/cube/pumi7k/cube.smb") + "${MESHES}/cube/pumi670/cube.smb") mpi_test(aniso_ma_serial 1 ./aniso_ma_test "${MESHES}/cube/cube.dmg" From 854bdc6907017e77fb2eab8f79394077dd230872 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 6 Aug 2025 14:57:37 -0400 Subject: [PATCH 150/319] face swap skeleton --- ma/CMakeLists.txt | 1 + ma/maFaceSwap.cc | 81 +++++++++++++++++++++++++++++++++++++++++++++++ ma/maFaceSwap.h | 8 +++++ 3 files changed, 90 insertions(+) create mode 100644 ma/maFaceSwap.cc create mode 100644 ma/maFaceSwap.h diff --git a/ma/CMakeLists.txt b/ma/CMakeLists.txt index 45a217fd0..5e487839a 100644 --- a/ma/CMakeLists.txt +++ b/ma/CMakeLists.txt @@ -28,6 +28,7 @@ set(SOURCES maSolutionTransferHelper.cc maSnap.cc maEdgeSwap.cc + maFaceSwap.cc maShape.cc maShapeHandler.cc maQuality.cc diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc new file mode 100644 index 000000000..65cfdc750 --- /dev/null +++ b/ma/maFaceSwap.cc @@ -0,0 +1,81 @@ +#include "maAdapt.h" + +namespace ma { + + enum FaceSwapType { + Two2Two, + Two2Three, + }; + + class FaceSwap + { + public: + FaceSwap(Adapt* a, Entity* f): + adapt(a), + mesh(a->mesh), + face(f) + {} + + bool topoCheck() + { + int modelDim = mesh->getModelType(mesh->toModel(face)); + if (modelDim == 2) + return false; + if (getFlag(adapt,face,DONT_SWAP)) + return false; + return true; + } + + bool geomCheck() + { + apf::Up adjTets; + mesh->getUp(face, adjTets); + Entity* newEdgeVerts[2]; + newEdgeVerts[0] = getTetVertOppositeTri(mesh, adjTets.e[0], face); + newEdgeVerts[1] = getTetVertOppositeTri(mesh, adjTets.e[1], face); + + //TODO: determine two2two or two2three by checking if two adjacent sides are coplanar + // check that they are coplanar by comparing normals + //TODO: check quality from swap depending each case + + if (type == Two2Two) { + + } + else if (type == Two2Three) { + + } + + return true; + } + + bool sizeCheck() + { + if (type == Two2Two) { + + } + else if (type == Two2Three) { + + } + return true; + } + + private: + Mesh* mesh; + Adapt* adapt; + Entity* face; + FaceSwapType type; + }; + + bool runEdgeSwap(Adapt* a, Entity* face) + { + FaceSwap faceSwap(a, face); + if (!faceSwap.topoCheck()) + return false; + if (!faceSwap.geomCheck()) + return false; + if (!faceSwap.sizeCheck()) + return false; + return true; + } + +} \ No newline at end of file diff --git a/ma/maFaceSwap.h b/ma/maFaceSwap.h new file mode 100644 index 000000000..2cc353c75 --- /dev/null +++ b/ma/maFaceSwap.h @@ -0,0 +1,8 @@ +#ifndef MA_FACESWAP_H +#define MA_FACESWAP_H + +namespace ma { + bool runEdgeSwap(); +} + +#endif \ No newline at end of file From c3c41aff3eda730affeecac3098fe987909f99b0 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 6 Aug 2025 17:54:06 -0400 Subject: [PATCH 151/319] capstone mesh --- test/aniso_adapt_cap.cc | 10 +++++----- test/testing.cmake | 1 + 2 files changed, 6 insertions(+), 5 deletions(-) diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 7f73dfc7f..090c203c9 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -52,11 +52,11 @@ ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) const std::string mdbName("Mesh Database : Create"); const std::string adbName("Attribution Database : Create"); - CapstoneModule cs("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); + CapstoneModule* cs = new CapstoneModule("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); - GeometryDatabaseInterface *g = cs.get_geometry(); - MeshDatabaseInterface *m = cs.get_mesh(); - AppContext *c = cs.get_context(); + GeometryDatabaseInterface *g = cs->get_geometry(); + MeshDatabaseInterface *m = cs->get_mesh(); + AppContext *c = cs->get_context(); PCU_ALWAYS_ASSERT(g); PCU_ALWAYS_ASSERT(m); @@ -65,7 +65,7 @@ ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) v_string filenames; filenames.push_back(meshFile); - M_GModel gmodel = cs.load_files(filenames); + M_GModel gmodel = cs->load_files(filenames); int numbreps = 0; MG_CALL(g->get_num_breps(numbreps)); diff --git a/test/testing.cmake b/test/testing.cmake index 69f915aef..faa5c768f 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -998,6 +998,7 @@ if(ENABLE_CAPSTONE) mpi_test(capVolCyl2 1 ./capVol -vg 4 ${MESHES}/cap/cyl_surf_only.cre) mpi_test(cap_inClosureOf 1 ./cap_inClosureOf ${MESHES}/cap/cube_surf_only.cre) mpi_test(cap_closestPoint 1 ./cap_closestPoint ${MESHES}/cap/cube_surf_only.cre) + mpi_test(adapt_curved_cube 1 ./aniso_adapt_cap "${MESHES}/curvedCube/cap_mesh.cre") if(HAVE_CAPSTONE_SIZINGMETRICTOOL) mpi_test(cap_smooth 1 ./cap_smooth) endif() From 762e86de093d14e4adc47eca97ea2772eef96cfe Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 6 Aug 2025 17:54:38 -0400 Subject: [PATCH 152/319] curved cube mesh --- pumi-meshes | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pumi-meshes b/pumi-meshes index aa88a43c3..e61d3c4ca 160000 --- a/pumi-meshes +++ b/pumi-meshes @@ -1 +1 @@ -Subproject commit aa88a43c3a51f06b1b1060a3d4196a7509d236b2 +Subproject commit e61d3c4ca2246479e0f198fb4cce8e02ba98e695 From 1d006c0e4c577b52007f3b133f40c4f1218d1dbc Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 6 Aug 2025 23:18:11 -0400 Subject: [PATCH 153/319] update mesh dir --- pumi-meshes | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pumi-meshes b/pumi-meshes index e61d3c4ca..27dca7523 160000 --- a/pumi-meshes +++ b/pumi-meshes @@ -1 +1 @@ -Subproject commit e61d3c4ca2246479e0f198fb4cce8e02ba98e695 +Subproject commit 27dca75239ed386594b7eb35d69c2d58fb28cfe3 From 3ffc85f2d521fa4329eadcaa49d50ae18f08718f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 6 Aug 2025 23:22:46 -0400 Subject: [PATCH 154/319] added meshes back in --- pumi-meshes | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pumi-meshes b/pumi-meshes index 27dca7523..93d3dadf4 160000 --- a/pumi-meshes +++ b/pumi-meshes @@ -1 +1 @@ -Subproject commit 27dca75239ed386594b7eb35d69c2d58fb28cfe3 +Subproject commit 93d3dadf4ecf73f6ec50bdf6f91a4d3ffd0f6f10 From b27f8b52dc10e391b004b1824c54b98684c7df87 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 14:34:50 -0400 Subject: [PATCH 155/319] updated capstone test --- test/aniso_adapt_cap.cc | 90 ++++------------------------------------- test/capVol.cc | 2 +- 2 files changed, 8 insertions(+), 84 deletions(-) diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 090c203c9..82f4628e7 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -28,91 +28,15 @@ #include "lionPrint.h" #include "aniso_adapt.h" -#include "CapstoneModule.h" -#include "CreateMG_Framework_Core.h" -#include "CreateMG_Framework_Analysis.h" -#include "CreateMG_Framework_Application.h" -#include "CreateMG_Framework_Attributes.h" -#include "CreateMG_Framework_Core.h" -#include "CreateMG_Framework_Geometry.h" -#include "CreateMG_Framework_Mesh.h" - -using namespace CreateMG; -using namespace CreateMG::Attribution; -using namespace CreateMG::Mesh; -using namespace CreateMG::Geometry; - ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) { - // load capstone mesh - // create an instance of the Capstone Module activating CREATE/CREATE/CREATE - // for the Geometry/Mesh/Attribution databases - /* const std::string gdbName("Geometry Database : Create");// Switch Create with SMLIB for CAD */ - const std::string gdbName("Geometry Database : SMLIB");// Switch Create with SMLIB for CAD - const std::string mdbName("Mesh Database : Create"); - const std::string adbName("Attribution Database : Create"); - - CapstoneModule* cs = new CapstoneModule("the_module", gdbName.c_str(), mdbName.c_str(), adbName.c_str()); - - GeometryDatabaseInterface *g = cs->get_geometry(); - MeshDatabaseInterface *m = cs->get_mesh(); - AppContext *c = cs->get_context(); - - PCU_ALWAYS_ASSERT(g); - PCU_ALWAYS_ASSERT(m); - PCU_ALWAYS_ASSERT(c); - - v_string filenames; - filenames.push_back(meshFile); - - M_GModel gmodel = cs->load_files(filenames); - - int numbreps = 0; - MG_CALL(g->get_num_breps(numbreps)); - std::cout << "number of b reps is " << numbreps << std::endl; - if(numbreps == 0) - error(HERE, ERR_INVALID_INPUT, "Model is empty"); - - M_MModel mmodel; - // Pick the volume mesh model from associated mesh models to this geom model - std::vector mmodels; - MG_API_CALL(m, get_associated_mesh_models(gmodel, mmodels)); - for(std::size_t i = 0; i < mmodels.size(); ++i) - { - M_MModel ammodel = mmodels[i]; - std::size_t numregs = 0; - std::size_t numfaces = 0; - std::size_t numedges = 0; - std::size_t numverts = 0; - MG_API_CALL(m, set_current_model(ammodel)); - MG_API_CALL(m, get_num_topos(TOPO_REGION, numregs)); - MG_API_CALL(m, get_num_topos(TOPO_FACE, numfaces)); - MG_API_CALL(m, get_num_topos(TOPO_EDGE, numedges)); - MG_API_CALL(m, get_num_topos(TOPO_VERTEX, numverts)); - std::cout << "num regions is " << numregs << std::endl; - std::cout << "num faces is " << numfaces << std::endl; - std::cout << "num edges is " << numedges << std::endl; - std::cout << "num verts is " << numverts << std::endl; - std::cout << "-----------" << std::endl; - if(numregs > 0) { - mmodel = ammodel; - break; - } - } - - /* SET THE ADJACENCIES */ - MG_API_CALL(m, set_adjacency_state(REGION2FACE| - REGION2EDGE| - REGION2VERTEX| - FACE2EDGE| - FACE2VERTEX)); - MG_API_CALL(m, set_reverse_states()); - MG_API_CALL(m, set_adjacency_scope(TOPO_EDGE, SCOPE_FULL)); - MG_API_CALL(m, set_adjacency_scope(TOPO_FACE, SCOPE_FULL)); - MG_API_CALL(m, compute_adjacency()); - - apf::Mesh2* mesh = apf::createMesh(m,g,PCUObj); - return mesh; + gmi_model* model = gmi_load(meshFile); + ma::Mesh* apfCapMesh = apf::createCapMesh(model, PCUObj); + apf::disownCapModel(apfCapMesh); + ma::Mesh* apfMesh = apf::createMdsMesh(model, apfCapMesh, true); + apf::disownMdsModel(apfMesh); + apf::destroyMesh(apfCapMesh); + return apfMesh; } int main(int argc, char** argv) diff --git a/test/capVol.cc b/test/capVol.cc index a6d0fc897..a7ccc0beb 100644 --- a/test/capVol.cc +++ b/test/capVol.cc @@ -241,7 +241,7 @@ apf::Splitter* makeSplitter(Args::Partitioner ptnr, apf::Mesh2* mesh) { default: #if defined(PUMI_HAS_ZOLTAN) return apf::makeZoltanSplitter( - adaptMesh, apf::GRAPH, apf::PARTITION + mesh, apf::GRAPH, apf::PARTITION ); #elif defined(PUMI_HAS_METIS) return apf::makeMETISsplitter(mesh); From 18017d8c3cff012029d8774d2a781c67b51aaec6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 14:51:03 -0400 Subject: [PATCH 156/319] fixed warnings --- ma/maCoarsen.cc | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 05d0d45cd..1c9f4de8a 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -346,7 +346,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg itr = shortEdgeVerts.erase(itr); return false; } - for (int i=0; i < sorted.size(); i++) { + for (size_t i=0; i < sorted.size(); i++) { Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; flagIndependentSet(a, adjacent, checked); @@ -367,9 +367,9 @@ void clearListFlag(Adapt* a, std::list list, int flag) } //Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an independent set -bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& itr, bool& independentSetStarted, const int checked, apf::Up& adjacent) +bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& itr, bool& independentSetStarted, apf::Up& adjacent) { - int numItr=0; + size_t numItr=0; do { numItr++; if (itr == shortEdgeVerts.end()) itr = shortEdgeVerts.begin(); @@ -429,7 +429,7 @@ bool coarsenMultiple(Adapt* a) while (checked < shortEdgeVerts.size()) { apf::Up adjacent; - if (!getAdjIndependentSet(a, shortEdgeVerts, itr, independentSetStarted, checked, adjacent)) continue; + if (!getAdjIndependentSet(a, shortEdgeVerts, itr, independentSetStarted, adjacent)) continue; if (collapseShortest(a, collapse, shortEdgeVerts, itr, checked, adjacent, lengthTag)) { independentSetStarted=true; success++; @@ -438,7 +438,7 @@ bool coarsenMultiple(Adapt* a) ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE | CHECKED, 0); a->mesh->destroyTag(lengthTag); double t1 = pcu::Time(); - print(a->mesh->getPCU(), "coarsened %li edges in %f seconds", success, t1-t0); + print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", success, t1-t0); return true; } From 48eb9e6cb27790724edc1d1f87483aaab9e99563 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 14:55:25 -0400 Subject: [PATCH 157/319] checked size_t --- ma/maCoarsen.cc | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 1c9f4de8a..79913e56f 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -307,7 +307,7 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll } //Prevent adjacent vertices from collapsing to create indepedent set -void flagIndependentSet(Adapt* a, apf::Up& adjacent, int& checked) +void flagIndependentSet(Adapt* a, apf::Up& adjacent, size_t& checked) { for (int adj=0; adj < adjacent.n; adj++) { Entity* vertices[2]; @@ -331,7 +331,7 @@ struct EdgeLength } }; -bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, int& checked, apf::Up& adjacent, Tag* lengthTag) +bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, size_t& checked, apf::Up& adjacent, Tag* lengthTag) { Entity* vertex = *itr; std::vector sorted; @@ -423,7 +423,7 @@ bool coarsenMultiple(Adapt* a) Collapse collapse; collapse.Init(a); int success = 0; - int checked = 0; + size_t checked = 0; bool independentSetStarted = false; std::list::iterator itr = shortEdgeVerts.begin(); while (checked < shortEdgeVerts.size()) From 04f5fbc0d078e1664246f327237cfdf5ce10b3a9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 15:14:13 -0400 Subject: [PATCH 158/319] void m --- ma/maSnap.cc | 1 + 1 file changed, 1 insertion(+) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index ede269847..352a57b83 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -36,6 +36,7 @@ static bool isCapstoneMesh(apf::Mesh* m) if (dynamic_cast(m)) return true; else return false; #else + (void)m; return false; #endif } From 9f2005dc17b4518edd338cdc45032f6ca8fd0ff9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 15:29:50 -0400 Subject: [PATCH 159/319] fixed snapper warnings --- ma/maMatchedSnapper.cc | 7 ++--- ma/maMatchedSnapper.h | 3 +- ma/maSnap.cc | 12 ++++---- ma/maSnapper.cc | 62 ++---------------------------------------- ma/maSnapper.h | 2 +- 5 files changed, 14 insertions(+), 72 deletions(-) diff --git a/ma/maMatchedSnapper.cc b/ma/maMatchedSnapper.cc index c5e87feb1..311c571eb 100644 --- a/ma/maMatchedSnapper.cc +++ b/ma/maMatchedSnapper.cc @@ -16,11 +16,10 @@ namespace ma { -MatchedSnapper::MatchedSnapper(Adapt* a, Tag* st, bool is) +MatchedSnapper::MatchedSnapper(Adapt* a, Tag* st) { adapter = a; snapTag = st; - isSimple = is; sharing = apf::getSharing(a->mesh); vert = 0; } @@ -38,7 +37,7 @@ void MatchedSnapper::setVert(Entity* v) { snappers.setSize(0); snappers.setSize(1); - snappers[0] = new Snapper(adapter, snapTag, isSimple); + snappers[0] = new Snapper(adapter, snapTag); snappers[0]->setVert(v); vert = v; } @@ -63,7 +62,7 @@ void MatchedSnapper::setVerts() snappers.setSize(copies.getSize() + 1); for (unsigned i = 0; i < snappers.getSize(); i++) - snappers[i] = new Snapper(adapter, snapTag, isSimple); + snappers[i] = new Snapper(adapter, snapTag); snappers[0]->setVert(v); for (unsigned i = 0; i < copies.getSize(); i++) snappers[i+1]->setVert(copies[i].entity); diff --git a/ma/maMatchedSnapper.h b/ma/maMatchedSnapper.h index c8fdbd487..42a7c12ce 100644 --- a/ma/maMatchedSnapper.h +++ b/ma/maMatchedSnapper.h @@ -21,7 +21,7 @@ namespace ma { class MatchedSnapper { public: - MatchedSnapper(Adapt* a, Tag* st, bool is); + MatchedSnapper(Adapt* a, Tag* st); ~MatchedSnapper(); void setVert(Entity* v); bool requestLocality(apf::CavityOp* o); @@ -34,7 +34,6 @@ class MatchedSnapper Entity* vert; apf::DynamicArray snappers; apf::DynamicArray locations; - bool isSimple; apf::Sharing* sharing; }; diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 352a57b83..c848f605b 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -807,8 +807,8 @@ bool snapAllVerts(Adapt* a, Tag* t, Snapper& snapper) class SnapMatched : public Operator { public: - SnapMatched(Adapt* a, Tag* t, bool simple): - snapper(a, t, simple) + SnapMatched(Adapt* a, Tag* t): + snapper(a, t) { adapter = a; tag = t; @@ -847,9 +847,9 @@ class SnapMatched : public Operator MatchedSnapper snapper; }; -bool snapMatchedVerts(Adapt* a, Tag* t, bool isSimple, long& successCount) +bool snapMatchedVerts(Adapt* a, Tag* t, long& successCount) { - SnapMatched op(a, t, isSimple); + SnapMatched op(a, t); applyOperator(a, &op); successCount += a->mesh->getPCU()->Add(op.successCount); return a->mesh->getPCU()->Or(op.didAnything); @@ -893,7 +893,7 @@ long snapTaggedVerts(Adapt* a, Tag* tag, Snapper& snapper) if (tagged == prevTagged) break; prevTagged = tagged; if (a->mesh->hasMatching()) - snapped = snapMatchedVerts(a, tag, false, successCount); + snapped = snapMatchedVerts(a, tag, successCount); else snapped = snapAllVerts(a, tag, snapper); } @@ -916,7 +916,7 @@ void snap(Adapt* a) int toSnap = tagVertsToSnap(a, snapTag); if (toSnap) { - Snapper snapper(a, snapTag, false); + Snapper snapper(a, snapTag); snapTaggedVerts(a, snapTag, snapper); snapLayer(a, snapTag); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 072c81d01..f783ee7a6 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -19,7 +19,7 @@ namespace ma { -Snapper::Snapper(Adapt* a, Tag* st, bool is) : splitCollapse(a), doubleSplitCollapse(a) +Snapper::Snapper(Adapt* a, Tag* st) : splitCollapse(a), doubleSplitCollapse(a) { adapt = a; mesh = a->mesh; @@ -61,62 +61,6 @@ bool Snapper::requestLocality(apf::CavityOp* o) return o->requestLocality(&ovs.e[0], ovs.n); } -static void computeNormals(Mesh* m, Upward& es, apf::NewArray& normals) -{ - if (m->getDimension() != 2) - return; - normals.allocate(es.getSize()); - for (size_t i = 0; i < es.getSize(); ++i) - normals[i] = getTriNormal(m, es[i]); -} - -static bool didInvert(Mesh* m, Vector& oldNormal, Entity* tri) -{ - return (oldNormal * getTriNormal(m, tri)) < 0; -} - -static void updateVertexParametricCoords( - Mesh* m, - Entity* vert, - Vector& newTarget) -{ - PCU_ALWAYS_ASSERT_VERBOSE(m->getType(vert) == apf::Mesh::VERTEX, - "expecting a vertex!"); - - // if vert is classified on a model vert or edge return - Model* g = m->toModel(vert); - if (m->getModelType(g) != 2) - return; - - // get the list of upward adj edges that are - // classified on the same model face as vert - apf::Up edges; - m->getUp(vert,edges); - apf::Up oes; - oes.n = edges.n; - int counter = 0; - for (int i = 0; i < edges.n; ++i) { - Model* h = m->toModel(edges.e[i]); - if (m->getModelType(h) == 3) - continue; - PCU_ALWAYS_ASSERT_VERBOSE(g == h, - "expecting the model to be the same for current edge and vert"); - oes.e[counter] = edges.e[i]; - counter++; - } - - Vector pBar(0., 0., 0.); - for (int i = 0; i < counter; i++) { - Vector pTmp; - transferParametricOnEdgeSplit(m, oes.e[i], 0.5, pTmp); - pBar += pTmp; - } - pBar = pBar / oes.n; - - m->snapToModel(m->toModel(vert), pBar, newTarget); - m->setParam(vert, pBar); -} - static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) { setFlag(a, ent, CHECKED); @@ -558,7 +502,7 @@ bool Snapper::tryCollapseToVertex(FirstProblemPlane* FPP) BestCollapse best; - for (size_t i = 0; i < FPP->commEdges.n; ++i) { + for (int i = 0; i < FPP->commEdges.n; ++i) { Entity* edge = FPP->commEdges.e[i]; Entity* vertexOnFPP = getEdgeVertOppositeVert(mesh, edge, vert); Vector vFPPCoord = getPosition(mesh, vertexOnFPP); @@ -648,7 +592,7 @@ bool Snapper::run() mesh->removeTag(vert,snapTag); clearFlag(adapt, vert, SNAP); } - // if (!success && ++DEBUGFAILED == 1) printFPP(adapt, FPP); + if (!success && ++DEBUGFAILED == 1) printFPP(adapt, FPP); if (FPP) delete FPP; return success; diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 395f5e5f2..88034346b 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -37,7 +37,7 @@ class Snapper int numSwap = 0; int numSplitCollapse = 0; - Snapper(Adapt* a, Tag* st, bool is); + Snapper(Adapt* a, Tag* st); ~Snapper(); void setVert(Entity* v); Entity* getVert(); From 24561ab5001fcaaca528973399b4504f638e0382 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 15:34:10 -0400 Subject: [PATCH 160/319] remove unsused from adapt test --- test/aniso_adapt.h | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index d20272aff..aaec1e29a 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -20,7 +20,7 @@ class AnIso : public ma::AnisotropicFunction { public: AnIso(ma::Mesh* m, double sf1, double sf2) : - mesh(m), sizeFactor1(sf1), sizeFactor2(sf2) + sizeFactor1(sf1), sizeFactor2(sf2) { average = ma::getAverageEdgeLength(m); ma::getBoundingBox(m, lower, upper); @@ -36,7 +36,6 @@ class AnIso : public ma::AnisotropicFunction ); } private: - ma::Mesh* mesh; double sizeFactor1, sizeFactor2, average; ma::Vector lower, upper; }; From 7a210c8bc56c59db0989dd2a65996a6b32ddab2f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 7 Aug 2025 16:35:38 -0400 Subject: [PATCH 161/319] compute case --- ma/maFaceSwap.cc | 16 ++++++++++++++-- 1 file changed, 14 insertions(+), 2 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 65cfdc750..643d10cd1 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -1,4 +1,6 @@ #include "maAdapt.h" +#include "maSnapper.h" +#include "apfGeometry.h" namespace ma { @@ -34,8 +36,18 @@ namespace ma { newEdgeVerts[0] = getTetVertOppositeTri(mesh, adjTets.e[0], face); newEdgeVerts[1] = getTetVertOppositeTri(mesh, adjTets.e[1], face); - //TODO: determine two2two or two2three by checking if two adjacent sides are coplanar - // check that they are coplanar by comparing normals + type = Two2Three; + Entity* verts[3]; + mesh->getDownward(face, 0, verts); + for (int i=0; i<3; i++) { + Entity* face0 = getTetFaceOppositeVert(mesh, adjTets.e[0], verts[i]); + Entity* face1 = getTetFaceOppositeVert(mesh, adjTets.e[1], verts[i]); + Vector normal0 = getTriNormal(mesh, face0); + Vector normal1 = getTriNormal(mesh, face1); + if (apf::areClose(normal0, normal1, 1e-10)) + type = Two2Two; + } + //TODO: check quality from swap depending each case if (type == Two2Two) { From 6fd71edabfe7c6ac42f27946c1fd5b37532fc240 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 15:39:40 -0400 Subject: [PATCH 162/319] added comments --- CMakeLists.txt | 2 +- ma/maCoarsen.cc | 25 +++++++++++++++++++++++-- ma/maSnapper.cc | 43 ++++++++++++++++++++++++++++++++++++++++--- test/aniso_adapt.h | 32 ++++++++++++++++++++++++++++---- 4 files changed, 92 insertions(+), 10 deletions(-) diff --git a/CMakeLists.txt b/CMakeLists.txt index 621afc77b..7a2ad4c00 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -6,7 +6,7 @@ endif() # This is the top level CMake file for the SCOREC build cmake_minimum_required(VERSION 3.12) -project(SCOREC VERSION 4.0.0 LANGUAGES CXX C) +project(SCOREC VERSION 4.1.0 LANGUAGES CXX C) include(cmake/bob.cmake) include(cmake/xsdk.cmake) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 79913e56f..333499927 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -257,6 +257,7 @@ bool coarsen(Adapt* a) return true; } +//Measure and edge lenght and stores the result so it doesn't have to be calculated again static double getLength(Adapt* a, Tag* lengthTag, Entity* edge) { double length = 0; @@ -271,6 +272,7 @@ static double getLength(Adapt* a, Tag* lengthTag, Entity* edge) } +//Make sure that a collapse will not create an edge longer than the max bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent) { Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vertex); @@ -306,7 +308,11 @@ static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& coll return result; } -//Prevent adjacent vertices from collapsing to create indepedent set +/* + Used after collpasing a vertex to flag adjacent vertices NEED_NOT_COLLAPSE, will create a + set of collapses were no two adjacent vertices collapsed called an independent set. Will + also clear adjacent vertices for collapse in next independent set since they might succeed now. +*/ void flagIndependentSet(Adapt* a, apf::Up& adjacent, size_t& checked) { for (int adj=0; adj < adjacent.n; adj++) { @@ -331,6 +337,11 @@ struct EdgeLength } }; +/* + Given an iterator pointing to a vertex we will collapse the shortest adjacent edge and try the next + shorted until one succeeds and then it will expand independent set. In Li's thesis it only attempts + to collapse the shortest edge, but this gave us better results. +*/ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, size_t& checked, apf::Up& adjacent, Tag* lengthTag) { Entity* vertex = *itr; @@ -366,7 +377,12 @@ void clearListFlag(Adapt* a, std::list list, int flag) clearFlag(a, *i++, flag); } -//Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an independent set +/* + Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an + independent set. We want our collapses to touch the independent set in order to + reduce adjacent collapses, since collapsing adjacent vertices will result in a + lower quality mesh. +*/ bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& itr, bool& independentSetStarted, apf::Up& adjacent) { size_t numItr=0; @@ -390,6 +406,7 @@ bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::lis return false; } +//returns a list of vertices that bound a short edge and flags them std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) { std::list shortEdgeVerts; @@ -412,6 +429,10 @@ std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) return shortEdgeVerts; } +/* + Follows the alogritm in Li's thesis in order to coarsen all short edges + in a mesh while maintaining a decent quality mesh. +*/ bool coarsenMultiple(Adapt* a) { if (!a->input->shouldCoarsen) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index f783ee7a6..d5981c4ac 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -61,6 +61,8 @@ bool Snapper::requestLocality(apf::CavityOp* o) return o->requestLocality(&ovs.e[0], ovs.n); } +//Write snapping data to files for debugging purposes +//In order to view relevant information it is neccessary to hide entities with relevent flag in vtk viewer static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) { setFlag(a, ent, CHECKED); @@ -68,6 +70,7 @@ static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) clearFlag(a, ent, CHECKED); } +//Write snapping data to files for debugging purposes static void printFPP(Adapt* a, FirstProblemPlane* FPP) { ma_dbg::addTargetLocation(a, "snap_target"); @@ -284,6 +287,11 @@ int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* en return bit; } +/* + We perform this last to make sure that we have a simple region where we can determine the + best operation to perform and because we want to avoid creating more vertices to snap since + we could get stuck in an infinite loop of creating and snapping those vertices. +*/ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) { Entity* ents[4] = {0}; @@ -379,6 +387,11 @@ struct BestCollapse Entity* keep; }; +/* + Perfomes a collapse operation and stores the operation in best if the quality is better, + then cancels the collapse. We want to pick the highest quality after collapsing to the + first problem plane so future operations are more likely to succeed. +*/ static void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, BestCollapse& best) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); @@ -400,6 +413,7 @@ static void getBestQualityCollapse(Adapt* a, Entity* edge, Entity* keep, Collaps if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); } +//returns if testVert and refVert are on the same side of the face static bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) { Entity* faceVert[3]; @@ -420,6 +434,11 @@ static bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) return true; //same side of face } +/* + If collapsing the common edges failed we want to try collapsing any edge that will + move us towards the first problem plane. We try collapses first in order to simplify + the region until we can perform smarter operations. +*/ bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) { apf::Up& commEdges = FPP->commEdges; @@ -454,6 +473,11 @@ bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) else return false; } +/* + If collapsing to the first problem plane has failed then we want + to collapse edges on the first problem plane in order to simplify + the region future operations are more likely to succeed. +*/ bool Snapper::tryReduceCommonEdges(FirstProblemPlane* FPP) { apf::Up& commEdges = FPP->commEdges; @@ -493,6 +517,11 @@ bool Snapper::tryReduceCommonEdges(FirstProblemPlane* FPP) else return false; } +/* + First we try collapsing to a vertex on the first problem plane because this is the most likely + operation to succeed. We first try collapsing to the common edges among the invalid regions + since those are more likely to succeed. +*/ bool Snapper::tryCollapseToVertex(FirstProblemPlane* FPP) { Vector position = getPosition(mesh, vert); @@ -506,7 +535,6 @@ bool Snapper::tryCollapseToVertex(FirstProblemPlane* FPP) Entity* edge = FPP->commEdges.e[i]; Entity* vertexOnFPP = getEdgeVertOppositeVert(mesh, edge, vert); Vector vFPPCoord = getPosition(mesh, vertexOnFPP); - //TODO: add logic for boundary layers double distToFPPVert = (vFPPCoord - target).getLength(); if (distToFPPVert > distTarget) continue; getBestQualityCollapse(adapt, edge, vert, collapse, best); @@ -546,6 +574,7 @@ static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) } } +//Moved vertex to model surface or returns invalid elements if not possible static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) { Mesh* mesh = adapt->mesh; @@ -567,9 +596,16 @@ bool Snapper::trySimpleSnap() apf::Up invalid; return tryReposition(adapt, vert, snapTag, invalid); } - +#if defined(DEBUG_FPP) static int DEBUGFAILED=0; +#endif +/* +This function will attempt to move vert to the model surface, if it can not do so then it +will atleast move to the first problem plane as described in Li's thesis. It might take multiple +iterations for vert to reach the model surface. Li's thesis was missing some details on how +to apply certain opperators so other algoritms were adapted from old scorec libraries. +*/ bool Snapper::run() { apf::Up invalid; @@ -592,8 +628,9 @@ bool Snapper::run() mesh->removeTag(vert,snapTag); clearFlag(adapt, vert, SNAP); } + #if defined(DEBUG_FPP) if (!success && ++DEBUGFAILED == 1) printFPP(adapt, FPP); - + #endif if (FPP) delete FPP; return success; } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index aaec1e29a..2a93098dd 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -44,17 +44,29 @@ void measureQuality(ma::Mesh* m, double& avgQuality, double& minQuality) { int d = m->getDimension(); apf::MeshEntity* elem; - apf::MeshIterator* elems = m->begin(d); + apf::MeshIterator* it = m->begin(d); ma::IdentitySizeField I(m); - while ((elem = m->iterate(elems))) { + while ((elem = m->iterate(it))) { double q = ma::measureElementQuality(m, &I, elem); avgQuality += q; minQuality = fmin(minQuality, q); } - m->end(elems); + m->end(it); avgQuality = avgQuality / m->count(d); } +//make sure refinement is done +bool noLongEdges(ma::Adapt* a) +{ + apf::MeshEntity* edge; + apf::MeshIterator* it = a->mesh->begin(1); + while ((edge = a->mesh->iterate(it))) + if (a->sizeField->measure(edge) > ma::MAXLENGTH) + return false; + a->mesh->end(it); + return true; +} + int countEdges(ma::Mesh* m) { return m->count(1); @@ -77,9 +89,10 @@ ma::Mesh* coarsenForced(ma::Mesh* m) measureQuality(m, avgQualAfter, minQualAfter); + //make sure that coarsening is happening and it doesn't make the mesh invalid PCU_ALWAYS_ASSERT(edgesBefore > countEdges(m)); PCU_ALWAYS_ASSERT(averageBefore < ma::getAverageEdgeLength(m)); - PCU_ALWAYS_ASSERT(minQualAfter >= 0); + PCU_ALWAYS_ASSERT(minQualAfter >= in->validQuality); m->verify(); delete a; @@ -108,6 +121,7 @@ ma::Mesh* coarsenRegular(ma::Mesh* m) measureQuality(m, avgQualAfter, minQualAfter); + //Makes sure that coarsening is happening and it isn't decreasing the quality of the mesh PCU_ALWAYS_ASSERT(edgesBefore > countEdges(m)); PCU_ALWAYS_ASSERT(averageBefore < ma::getAverageEdgeLength(m)); PCU_ALWAYS_ASSERT(fabs(minQualBefore - minQualAfter) < 0.001f || minQualBefore < minQualAfter); @@ -123,6 +137,7 @@ ma::Mesh* coarsenRegular(ma::Mesh* m) return m; } +//Makes sure that all of the vertices snapped to the model bool allVertsOnModel(ma::Adapt* a) { if (!a->input->shouldSnap) @@ -163,9 +178,16 @@ ma::Mesh* refineSnapTest(ma::Mesh* m) ma::snap(a); } + double avgQualAfter, minQualAfter; + measureQuality(m, avgQualAfter, minQualAfter); + + //Makes sure that refinement is happening PCU_ALWAYS_ASSERT(edgesBefore < countEdges(m)); PCU_ALWAYS_ASSERT(averageBefore > ma::getAverageEdgeLength(m)); + + PCU_ALWAYS_ASSERT(noLongEdges(a)); PCU_ALWAYS_ASSERT(allVertsOnModel(a)); + PCU_ALWAYS_ASSERT(minQualAfter >= 0); m->verify(); delete a; @@ -180,6 +202,7 @@ ma::Mesh* refineSnapTest(ma::Mesh* m) void adaptTests(const std::function& createMesh) { + //Mesh created multiple times to compare adaptation ma::Mesh* meshReg = createMesh(); apf::writeVtkFiles("startMesh", meshReg); @@ -192,6 +215,7 @@ void adaptTests(const std::function& createMesh) ma::Mesh* meshForce = coarsenForced(refineSnapTest(createMesh())); apf::writeVtkFiles("afterForcedCoarsen", meshForce); + //Make sure setting to force coarsen is functioning PCU_ALWAYS_ASSERT(countEdges(meshReg) > countEdges(meshForce)); PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(meshReg) < ma::getAverageEdgeLength(meshForce)); From 9395079149d3994cb30cc727b11609ad38f7be32 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 15:54:45 -0400 Subject: [PATCH 163/319] fixed unused warning --- ma/maSnapper.cc | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index d5981c4ac..f616090af 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -63,14 +63,17 @@ bool Snapper::requestLocality(apf::CavityOp* o) //Write snapping data to files for debugging purposes //In order to view relevant information it is neccessary to hide entities with relevent flag in vtk viewer +#if defined(DEBUG_FPP) static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) { setFlag(a, ent, CHECKED); ma_dbg::dumpMeshWithFlag(a, 0, dim, CHECKED, name, name); clearFlag(a, ent, CHECKED); } +#endif //Write snapping data to files for debugging purposes +#if defined(DEBUG_FPP) static void printFPP(Adapt* a, FirstProblemPlane* FPP) { ma_dbg::addTargetLocation(a, "snap_target"); @@ -91,6 +94,7 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) flagAndPrint(a, FPP->problemFace, 2, "FPP_Face"); flagAndPrint(a, FPP->problemRegion, 3, "FPP_Region"); } +#endif static int indexOfMin(double a0, double a1, double a2) { From f6832babd5c56372589bd9d6e8e7a5ac795f893c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 16:11:44 -0400 Subject: [PATCH 164/319] collapse comments --- ma/maCollapse.cc | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index fb32eb6ce..6b4a2ddc9 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -55,6 +55,7 @@ bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) return true; } +//Prevents snapping from undoing refinement bool Collapse::edgesGoodSize() { PCU_ALWAYS_ASSERT(elementsToKeep.size()); PCU_ALWAYS_ASSERT(elementsToKeep.size() == newElements.size()); @@ -155,8 +156,10 @@ bool checkEdgeCollapseEdgeRings(Adapt* a, Entity* edge) Mesh* m = a->mesh; Entity* v[2]; m->getDownward(edge,0,v); - if (!getFlag(a, v[0], DONT_COLLAPSE)) PCU_ALWAYS_ASSERT( ! m->isShared(v[0])); - if (!getFlag(a, v[1], DONT_COLLAPSE)) PCU_ALWAYS_ASSERT( ! m->isShared(v[1])); + if (!getFlag(a, v[0], DONT_COLLAPSE)) //Allow collapse in one direction + PCU_ALWAYS_ASSERT( ! m->isShared(v[0])); + if (!getFlag(a, v[1], DONT_COLLAPSE)) //Allow collapse in one direction + PCU_ALWAYS_ASSERT( ! m->isShared(v[1])); apf::Up ve[2]; m->getUp(v[0],ve[0]); m->getUp(v[1],ve[1]); From 1c829f67ebc2b46ea820d0a863e947933d925302 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 16:52:54 -0400 Subject: [PATCH 165/319] update simmetrix version --- .../simmetrix_enabled_pr_comment_trigger_self_hosted.yml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/.github/workflows/simmetrix_enabled_pr_comment_trigger_self_hosted.yml b/.github/workflows/simmetrix_enabled_pr_comment_trigger_self_hosted.yml index 02999fdbf..1af4cd3b2 100644 --- a/.github/workflows/simmetrix_enabled_pr_comment_trigger_self_hosted.yml +++ b/.github/workflows/simmetrix_enabled_pr_comment_trigger_self_hosted.yml @@ -37,7 +37,7 @@ jobs: module use /opt/scorec/spack/rhel9/v0201_4/lmod/linux-rhel9-x86_64/Core/ module load gcc/12.3.0-iil3lno module load mpich/4.1.1-xpoyz4t - module load simmetrix-simmodsuite/2024.0-240119dev-7abimo4 + module load simmetrix-simmodsuite/2025.0-250108dev-llxq6sk module load zoltan/3.83-hap4ggo module load cmake/3.26.3-2duxfcd set -e @@ -70,7 +70,7 @@ jobs: module use /opt/scorec/spack/rhel9/v0201_4/lmod/linux-rhel9-x86_64/Core/ module load gcc/12.3.0-iil3lno module load mpich/4.1.1-xpoyz4t - module load simmetrix-simmodsuite/2024.0-240119dev-7abimo4 + module load simmetrix-simmodsuite/2025.0-250108dev-llxq6sk module load zoltan/3.83-hap4ggo module load cmake/3.26.3-2duxfcd module load cgns/develop-cc4dfwp From e275b4fd2ee483b72b72b979daf485319d5e8a97 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 18:03:02 -0400 Subject: [PATCH 166/319] two2two case --- ma/maFaceSwap.cc | 35 +++++++++++++++++++++++++++++++++-- 1 file changed, 33 insertions(+), 2 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 643d10cd1..b6045c495 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -9,6 +9,22 @@ namespace ma { Two2Three, }; + Entity* findCommonEdge(Entity* face1, Entity* face2) + { + return face1; + } + + void fillAdjVerts(Mesh* mesh, Entity* newTetVerts[4], const apf::Up& adjTets) + { + apf::Up adjEdges; + mesh->getUp(newTetVerts[0], adjEdges); + int j=1; + for (int i=0; igetDownward(face, 0, verts); + Entity* commonEdge; for (int i=0; i<3; i++) { Entity* face0 = getTetFaceOppositeVert(mesh, adjTets.e[0], verts[i]); Entity* face1 = getTetFaceOppositeVert(mesh, adjTets.e[1], verts[i]); Vector normal0 = getTriNormal(mesh, face0); Vector normal1 = getTriNormal(mesh, face1); - if (apf::areClose(normal0, normal1, 1e-10)) + if (apf::areClose(normal0, normal1, 1e-10)) { type = Two2Two; + commonEdge = findCommonEdge(face0, face1); + } } //TODO: check quality from swap depending each case - + int tempDim = 3; //TODO: calculate dim if (type == Two2Two) { + Entity* commEdgeVerts[2]; + mesh->getDownward(commonEdge, 0, commEdgeVerts); + + Entity* newTetVerts0[4]; + Entity* newTetVerts1[4]; + newTetVerts0[0] = commEdgeVerts[0]; + newTetVerts1[0] = commEdgeVerts[1]; + + fillAdjVerts(mesh, newTetVerts0, adjTets); + fillAdjVerts(mesh, newTetVerts1, adjTets); + buildElement(adapt, tempDim, apf::Mesh::TET, newTetVerts0); + buildElement(adapt, tempDim, apf::Mesh::TET, newTetVerts1); } else if (type == Two2Three) { From fd3b1a793695993c27f0f77f1563fa76bbf0c808 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 18:23:35 -0400 Subject: [PATCH 167/319] two2three case and build cavity --- ma/maFaceSwap.cc | 56 ++++++++++++++++++++++++++++++------------------ 1 file changed, 35 insertions(+), 21 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index b6045c495..3edc0087d 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -14,13 +14,13 @@ namespace ma { return face1; } - void fillAdjVerts(Mesh* mesh, Entity* newTetVerts[4], const apf::Up& adjTets) + void fillAdjVerts(Mesh* mesh, Entity* newTetVerts[4], const Upward& adjTets) { apf::Up adjEdges; mesh->getUp(newTetVerts[0], adjEdges); int j=1; for (int i=0; imesh), - face(f) - {} + FaceSwap(Adapt* a, Entity* f): adapt(a), mesh(a->mesh), face(f) + { + cavity.init(a); + } bool topoCheck() { @@ -46,19 +45,16 @@ namespace ma { bool geomCheck() { - apf::Up adjTets; - mesh->getUp(face, adjTets); - Entity* newEdgeVerts[2]; - newEdgeVerts[0] = getTetVertOppositeTri(mesh, adjTets.e[0], face); - newEdgeVerts[1] = getTetVertOppositeTri(mesh, adjTets.e[1], face); + Upward adjTets; + mesh->getAdjacent(face, 3, adjTets); type = Two2Three; - Entity* verts[3]; - mesh->getDownward(face, 0, verts); + Entity* faceVerts[3]; + mesh->getDownward(face, 0, faceVerts); Entity* commonEdge; for (int i=0; i<3; i++) { - Entity* face0 = getTetFaceOppositeVert(mesh, adjTets.e[0], verts[i]); - Entity* face1 = getTetFaceOppositeVert(mesh, adjTets.e[1], verts[i]); + Entity* face0 = getTetFaceOppositeVert(mesh, adjTets[0], faceVerts[i]); + Entity* face1 = getTetFaceOppositeVert(mesh, adjTets[1], faceVerts[i]); Vector normal0 = getTriNormal(mesh, face0); Vector normal1 = getTriNormal(mesh, face1); if (apf::areClose(normal0, normal1, 1e-10)) { @@ -68,7 +64,8 @@ namespace ma { } //TODO: check quality from swap depending each case - int tempDim = 3; //TODO: calculate dim + cavity.beforeBuilding(); + Model* model = mesh->toModel(adjTets[0]); if (type == Two2Two) { Entity* commEdgeVerts[2]; mesh->getDownward(commonEdge, 0, commEdgeVerts); @@ -81,13 +78,29 @@ namespace ma { fillAdjVerts(mesh, newTetVerts0, adjTets); fillAdjVerts(mesh, newTetVerts1, adjTets); - buildElement(adapt, tempDim, apf::Mesh::TET, newTetVerts0); - buildElement(adapt, tempDim, apf::Mesh::TET, newTetVerts1); + buildElement(adapt, model, apf::Mesh::TET, newTetVerts0); + buildElement(adapt, model, apf::Mesh::TET, newTetVerts1); } else if (type == Two2Three) { - + Entity* newTetVerts[4]; + newTetVerts[0] = getTetVertOppositeTri(mesh, adjTets[0], face); + newTetVerts[1] = getTetVertOppositeTri(mesh, adjTets[1], face); + + Entity* faceEdges[3]; + mesh->getDownward(face, 1, faceEdges); + for (int i=0; i<3; i++) { + Entity* faceEdgeVerts[2]; + mesh->getDownward(faceEdges[i], 0, faceEdgeVerts); + newTetVerts[2]=faceEdgeVerts[0]; + newTetVerts[3]=faceEdgeVerts[1]; + buildElement(adapt, model, apf::Mesh::TET, newTetVerts); + } } - + cavity.afterBuilding(); + cavity.fit(adjTets); + cavity.transfer(adjTets); + destroyElement(adapt, adjTets[0]); + destroyElement(adapt, adjTets[1]); return true; } @@ -107,6 +120,7 @@ namespace ma { Adapt* adapt; Entity* face; FaceSwapType type; + Cavity cavity; }; bool runEdgeSwap(Adapt* a, Entity* face) From e6bb1b1a4062298e96b4e745669a44834e278afc Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 18:28:25 -0400 Subject: [PATCH 168/319] implement find common edge --- ma/maFaceSwap.cc | 13 +++++++++++-- 1 file changed, 11 insertions(+), 2 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 3edc0087d..e15c6b393 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -2,6 +2,10 @@ #include "maSnapper.h" #include "apfGeometry.h" +//TODO: move useful functions to header +//TODO: break up functions into smaller chunks +//TODO: add comments + namespace ma { enum FaceSwapType { @@ -9,8 +13,13 @@ namespace ma { Two2Three, }; - Entity* findCommonEdge(Entity* face1, Entity* face2) + Entity* findCommonEdge(Mesh* mesh, Entity* face1, Entity* face2) { + Entity* face1Edges[3]; + mesh->getDownward(face1, 1, face1Edges); + for (int i=0; i<3; i++) + if (isLowInHigh(mesh, face2, face1Edges[i])) + return face1Edges[i]; return face1; } @@ -59,7 +68,7 @@ namespace ma { Vector normal1 = getTriNormal(mesh, face1); if (apf::areClose(normal0, normal1, 1e-10)) { type = Two2Two; - commonEdge = findCommonEdge(face0, face1); + commonEdge = findCommonEdge(mesh, face0, face1); } } From 673523ad8e1dd059da1ccbc0e2458ab85d4b88eb Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 8 Aug 2025 23:44:50 -0400 Subject: [PATCH 169/319] testing faceswp --- CMakeLists.txt | 4 ++++ ma/maFaceSwap.cc | 8 +++++++- ma/maFaceSwap.h | 2 +- ma/maSnapper.cc | 18 ++++++++++++++++-- 4 files changed, 28 insertions(+), 4 deletions(-) diff --git a/CMakeLists.txt b/CMakeLists.txt index 7a2ad4c00..b5c3d60c1 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -172,6 +172,10 @@ if(ENABLE_CGNS) add_definitions(-DHAVE_CGNS) endif() +if(DEBUG_FPP) + add_definitions(-DDEBUG_FPP) +endif() + configure_file(SCOREC_config.h.in SCOREC_config.h) install(FILES "${CMAKE_BINARY_DIR}/SCOREC_config.h" DESTINATION include) include_directories(PUBLIC "$") diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index e15c6b393..81b0ca3e1 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -1,6 +1,7 @@ #include "maAdapt.h" #include "maSnapper.h" #include "apfGeometry.h" +#include "maDBG.h" //TODO: move useful functions to header //TODO: break up functions into smaller chunks @@ -76,6 +77,7 @@ namespace ma { cavity.beforeBuilding(); Model* model = mesh->toModel(adjTets[0]); if (type == Two2Two) { + printf("\t[Warning]: found two2two face swap, this is unteasted please test\n"); Entity* commEdgeVerts[2]; mesh->getDownward(commonEdge, 0, commEdgeVerts); @@ -132,13 +134,17 @@ namespace ma { Cavity cavity; }; - bool runEdgeSwap(Adapt* a, Entity* face) + bool runFaceSwap(Adapt* a, Entity* face) { + printf("InFaceSwap\n"); FaceSwap faceSwap(a, face); if (!faceSwap.topoCheck()) return false; + printf("TopoCheck\n"); if (!faceSwap.geomCheck()) return false; + printf("GeomCheck\n"); + exit(1); if (!faceSwap.sizeCheck()) return false; return true; diff --git a/ma/maFaceSwap.h b/ma/maFaceSwap.h index 2cc353c75..fb46d6279 100644 --- a/ma/maFaceSwap.h +++ b/ma/maFaceSwap.h @@ -2,7 +2,7 @@ #define MA_FACESWAP_H namespace ma { - bool runEdgeSwap(); + bool runFaceSwap(Adapt* a, Entity* face); } #endif \ No newline at end of file diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index f616090af..a610bd662 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -10,6 +10,7 @@ #include "maSnapper.h" #include "maAdapt.h" #include "maShapeHandler.h" +#include "maFaceSwap.h" #include "maSnap.h" #include "maDBG.h" #include @@ -93,6 +94,19 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) flagAndPrint(a, FPP->vert, 0, "FPP_Vertex"); flagAndPrint(a, FPP->problemFace, 2, "FPP_Face"); flagAndPrint(a, FPP->problemRegion, 3, "FPP_Region"); + + apf::Adjacent adj; + a->mesh->getAdjacent(FPP->vert, 3, adj); + for (int i=0; imesh->getDownward(FPP->problemFace, 0, problemFaceVerts); + for (int i=0; i<3; i++){ + a->mesh->getAdjacent(problemFaceVerts[i], 3, adj); + for (int i=0; ivert, adapt->input->validQuality)) { numSplitCollapse++; return true; } + runFaceSwap(adapt, ents[0]); print(mesh->getPCU(), "Swap failed: face swap not implemented"); } return false; @@ -633,7 +647,7 @@ bool Snapper::run() clearFlag(adapt, vert, SNAP); } #if defined(DEBUG_FPP) - if (!success && ++DEBUGFAILED == 1) printFPP(adapt, FPP); + // if (!success && ++DEBUGFAILED == 2) printFPP(adapt, FPP); #endif if (FPP) delete FPP; return success; From e46a5c2168ce5d8f0e5c36eaf7b6d03c6fa42eba Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 13 Aug 2025 14:32:48 -0400 Subject: [PATCH 170/319] quality check --- ma/maFaceSwap.cc | 75 ++++++++++++++++++++++++++++-------------------- ma/maFaceSwap.h | 2 +- 2 files changed, 45 insertions(+), 32 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 81b0ca3e1..dd6d558e6 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -1,6 +1,7 @@ #include "maAdapt.h" #include "maSnapper.h" #include "apfGeometry.h" +#include "maShapeHandler.h" #include "maDBG.h" //TODO: move useful functions to header @@ -9,11 +10,6 @@ namespace ma { - enum FaceSwapType { - Two2Two, - Two2Three, - }; - Entity* findCommonEdge(Mesh* mesh, Entity* face1, Entity* face2) { Entity* face1Edges[3]; @@ -38,7 +34,8 @@ namespace ma { class FaceSwap { public: - FaceSwap(Adapt* a, Entity* f): adapt(a), mesh(a->mesh), face(f) + FaceSwap(Adapt* a, Entity* f, bool improve) : + adapt(a), mesh(a->mesh), face(f), improveQuality(improve) { cavity.init(a); } @@ -53,30 +50,43 @@ namespace ma { return true; } + bool qualityCheck() + { + double qualityToBeat = adapt->input->validQuality; + if (improveQuality) + qualityToBeat = std::max(getWorstQuality(adapt, oldTets), adapt->input->validQuality); + + for (int i=0; ishape->getQuality(newTets[i]); + if (quality < qualityToBeat) + return false; + } + return true; + } + bool geomCheck() { - Upward adjTets; - mesh->getAdjacent(face, 3, adjTets); + mesh->getAdjacent(face, 3, oldTets); - type = Two2Three; + numNewTets = 3; Entity* faceVerts[3]; mesh->getDownward(face, 0, faceVerts); Entity* commonEdge; for (int i=0; i<3; i++) { - Entity* face0 = getTetFaceOppositeVert(mesh, adjTets[0], faceVerts[i]); - Entity* face1 = getTetFaceOppositeVert(mesh, adjTets[1], faceVerts[i]); + Entity* face0 = getTetFaceOppositeVert(mesh, oldTets[0], faceVerts[i]); + Entity* face1 = getTetFaceOppositeVert(mesh, oldTets[1], faceVerts[i]); Vector normal0 = getTriNormal(mesh, face0); Vector normal1 = getTriNormal(mesh, face1); if (apf::areClose(normal0, normal1, 1e-10)) { - type = Two2Two; + numNewTets = 2; commonEdge = findCommonEdge(mesh, face0, face1); } } //TODO: check quality from swap depending each case cavity.beforeBuilding(); - Model* model = mesh->toModel(adjTets[0]); - if (type == Two2Two) { + Model* model = mesh->toModel(oldTets[0]); + if (numNewTets == 2) { printf("\t[Warning]: found two2two face swap, this is unteasted please test\n"); Entity* commEdgeVerts[2]; mesh->getDownward(commonEdge, 0, commEdgeVerts); @@ -86,16 +96,16 @@ namespace ma { newTetVerts0[0] = commEdgeVerts[0]; newTetVerts1[0] = commEdgeVerts[1]; - fillAdjVerts(mesh, newTetVerts0, adjTets); - fillAdjVerts(mesh, newTetVerts1, adjTets); + fillAdjVerts(mesh, newTetVerts0, oldTets); + fillAdjVerts(mesh, newTetVerts1, oldTets); - buildElement(adapt, model, apf::Mesh::TET, newTetVerts0); - buildElement(adapt, model, apf::Mesh::TET, newTetVerts1); + newTets[0] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts0); + newTets[1] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts1); } - else if (type == Two2Three) { + else if (numNewTets == 3) { Entity* newTetVerts[4]; - newTetVerts[0] = getTetVertOppositeTri(mesh, adjTets[0], face); - newTetVerts[1] = getTetVertOppositeTri(mesh, adjTets[1], face); + newTetVerts[0] = getTetVertOppositeTri(mesh, oldTets[0], face); + newTetVerts[1] = getTetVertOppositeTri(mesh, oldTets[1], face); Entity* faceEdges[3]; mesh->getDownward(face, 1, faceEdges); @@ -104,23 +114,23 @@ namespace ma { mesh->getDownward(faceEdges[i], 0, faceEdgeVerts); newTetVerts[2]=faceEdgeVerts[0]; newTetVerts[3]=faceEdgeVerts[1]; - buildElement(adapt, model, apf::Mesh::TET, newTetVerts); + newTets[i] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts); } } cavity.afterBuilding(); - cavity.fit(adjTets); - cavity.transfer(adjTets); - destroyElement(adapt, adjTets[0]); - destroyElement(adapt, adjTets[1]); + cavity.fit(oldTets); + cavity.transfer(oldTets); + destroyElement(adapt, oldTets[0]); + destroyElement(adapt, oldTets[1]); return true; } bool sizeCheck() { - if (type == Two2Two) { + if (numNewTets == 2) { } - else if (type == Two2Three) { + else if (numNewTets == 3) { } return true; @@ -130,14 +140,17 @@ namespace ma { Mesh* mesh; Adapt* adapt; Entity* face; - FaceSwapType type; Cavity cavity; + int numNewTets; + Upward oldTets; + Entity* newTets[3]; + bool improveQuality; }; - bool runFaceSwap(Adapt* a, Entity* face) + bool runFaceSwap(Adapt* a, Entity* face, bool improveQuality) { printf("InFaceSwap\n"); - FaceSwap faceSwap(a, face); + FaceSwap faceSwap(a, face, improveQuality); if (!faceSwap.topoCheck()) return false; printf("TopoCheck\n"); diff --git a/ma/maFaceSwap.h b/ma/maFaceSwap.h index fb46d6279..50b41f002 100644 --- a/ma/maFaceSwap.h +++ b/ma/maFaceSwap.h @@ -2,7 +2,7 @@ #define MA_FACESWAP_H namespace ma { - bool runFaceSwap(Adapt* a, Entity* face); + bool runFaceSwap(Adapt* a, Entity* face, bool improveQuality=true); } #endif \ No newline at end of file From 4163701616189dc8e909a6a9bb3d405cd505206b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 13 Aug 2025 15:59:13 -0400 Subject: [PATCH 171/319] 2d get invalid --- ma/maSnapper.cc | 35 ++++++++++++++++++++++++++++++----- 1 file changed, 30 insertions(+), 5 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index f616090af..95a378ebe 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -561,7 +561,21 @@ static FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up return FPP; } -static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) +static void computeNormals(Mesh* m, Upward& es, apf::NewArray& normals) +{ + if (m->getDimension() != 2) + return; + normals.allocate(es.getSize()); + for (size_t i = 0; i < es.getSize(); ++i) + normals[i] = getTriNormal(m, es[i]); +} + +static bool didInvert(Mesh* m, Vector& oldNormal, Entity* tri) +{ + return (oldNormal * getTriNormal(m, tri)) < 0; +} + +static void getInvalid(Adapt* a, Upward& adjacentElements, apf::NewArray& normals, apf::Up& invalid) { invalid.n = 0; Vector v[4]; @@ -572,9 +586,16 @@ static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) algorithm that moves curves would need to change */ if (getFlag(a, adjacentElements[i], LAYER)) continue; - ma::getVertPoints(a->mesh,adjacentElements[i],v); - if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) - invalid.e[invalid.n++] = adjacentElements[i]; + + if ((a->mesh->getDimension() == 2)) { + if (didInvert(a->mesh, normals[i], adjacentElements[i])) + invalid.e[invalid.n++] = adjacentElements[i]; + } + else{ + ma::getVertPoints(a->mesh,adjacentElements[i],v); + if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) + invalid.e[invalid.n++] = adjacentElements[i]; + } } } @@ -588,8 +609,12 @@ static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& i mesh->getDoubleTag(vertex, snapTag, &target[0]); Upward adjacentElements; mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + + apf::NewArray normals; + computeNormals(mesh, adjacentElements, normals); + mesh->setPoint(vertex, 0, target); - getInvalidTets(adapt, adjacentElements, invalid); + getInvalid(adapt, adjacentElements, normals, invalid); if (invalid.n == 0) return true; mesh->setPoint(vertex, 0, prev); return false; From 854d08995378dd0dbc9180d436d4bb0444479d89 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 13 Aug 2025 19:12:48 -0400 Subject: [PATCH 172/319] broke up into functions --- ma/maFaceSwap.cc | 96 +++++++++++++++++++++++++++++------------------- 1 file changed, 59 insertions(+), 37 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index dd6d558e6..c331626b9 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -4,8 +4,6 @@ #include "maShapeHandler.h" #include "maDBG.h" -//TODO: move useful functions to header -//TODO: break up functions into smaller chunks //TODO: add comments namespace ma { @@ -64,14 +62,12 @@ namespace ma { return true; } - bool geomCheck() + void findNumNewTets() { mesh->getAdjacent(face, 3, oldTets); - numNewTets = 3; Entity* faceVerts[3]; mesh->getDownward(face, 0, faceVerts); - Entity* commonEdge; for (int i=0; i<3; i++) { Entity* face0 = getTetFaceOppositeVert(mesh, oldTets[0], faceVerts[i]); Entity* face1 = getTetFaceOppositeVert(mesh, oldTets[1], faceVerts[i]); @@ -82,46 +78,71 @@ namespace ma { commonEdge = findCommonEdge(mesh, face0, face1); } } + } - //TODO: check quality from swap depending each case - cavity.beforeBuilding(); + void buildTwo2Two() + { + printf("\t[Warning]: found two2two face swap, this is unteasted please test\n"); Model* model = mesh->toModel(oldTets[0]); - if (numNewTets == 2) { - printf("\t[Warning]: found two2two face swap, this is unteasted please test\n"); - Entity* commEdgeVerts[2]; - mesh->getDownward(commonEdge, 0, commEdgeVerts); + Entity* commEdgeVerts[2]; + mesh->getDownward(commonEdge, 0, commEdgeVerts); - Entity* newTetVerts0[4]; - Entity* newTetVerts1[4]; - newTetVerts0[0] = commEdgeVerts[0]; - newTetVerts1[0] = commEdgeVerts[1]; + Entity* newTetVerts0[4]; + Entity* newTetVerts1[4]; + newTetVerts0[0] = commEdgeVerts[0]; + newTetVerts1[0] = commEdgeVerts[1]; - fillAdjVerts(mesh, newTetVerts0, oldTets); - fillAdjVerts(mesh, newTetVerts1, oldTets); + fillAdjVerts(mesh, newTetVerts0, oldTets); + fillAdjVerts(mesh, newTetVerts1, oldTets); - newTets[0] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts0); - newTets[1] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts1); - } - else if (numNewTets == 3) { - Entity* newTetVerts[4]; - newTetVerts[0] = getTetVertOppositeTri(mesh, oldTets[0], face); - newTetVerts[1] = getTetVertOppositeTri(mesh, oldTets[1], face); - - Entity* faceEdges[3]; - mesh->getDownward(face, 1, faceEdges); - for (int i=0; i<3; i++) { - Entity* faceEdgeVerts[2]; - mesh->getDownward(faceEdges[i], 0, faceEdgeVerts); - newTetVerts[2]=faceEdgeVerts[0]; - newTetVerts[3]=faceEdgeVerts[1]; - newTets[i] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts); - } + newTets[0] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts0); + newTets[1] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts1); + } + + void buildTwo2Three() + { + Model* model = mesh->toModel(oldTets[0]); + Entity* newTetVerts[4]; + newTetVerts[0] = getTetVertOppositeTri(mesh, oldTets[0], face); + newTetVerts[1] = getTetVertOppositeTri(mesh, oldTets[1], face); + + Entity* faceEdges[3]; + mesh->getDownward(face, 1, faceEdges); + for (int i=0; i<3; i++) { + Entity* faceEdgeVerts[2]; + mesh->getDownward(faceEdges[i], 0, faceEdgeVerts); + newTetVerts[2]=faceEdgeVerts[0]; + newTetVerts[3]=faceEdgeVerts[1]; + newTets[i] = buildElement(adapt, model, apf::Mesh::TET, newTetVerts); } - cavity.afterBuilding(); - cavity.fit(oldTets); + } + + void destroyOldElements() + { cavity.transfer(oldTets); destroyElement(adapt, oldTets[0]); destroyElement(adapt, oldTets[1]); + } + + void cancel() + { + for (int i=0; i Date: Thu, 14 Aug 2025 15:39:09 -0400 Subject: [PATCH 173/319] faceswap running --- ma/maFaceSwap.cc | 19 +++-------- ma/maSnapper.cc | 83 ++++++++++++++++++++++++++++-------------------- 2 files changed, 52 insertions(+), 50 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index c331626b9..04e063446 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -36,6 +36,7 @@ namespace ma { adapt(a), mesh(a->mesh), face(f), improveQuality(improve) { cavity.init(a); + numNewTets=0; } bool topoCheck() @@ -148,12 +149,6 @@ namespace ma { bool sizeCheck() { - if (numNewTets == 2) { - - } - else if (numNewTets == 3) { - - } return true; } @@ -171,17 +166,11 @@ namespace ma { bool runFaceSwap(Adapt* a, Entity* face, bool improveQuality) { - printf("InFaceSwap\n"); FaceSwap faceSwap(a, face, improveQuality); - if (!faceSwap.topoCheck()) - return false; - printf("TopoCheck\n"); - if (!faceSwap.geomCheck()) - return false; - printf("GeomCheck\n"); - exit(1); - if (!faceSwap.sizeCheck()) + if (!faceSwap.topoCheck() && !faceSwap.geomCheck()) { + faceSwap.cancel(); return false; + } return true; } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index a610bd662..a8f758ece 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -17,6 +17,7 @@ #include #include #include +#include "apfGeometry.cc" namespace ma { @@ -305,6 +306,42 @@ int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* en return bit; } +static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) +{ + invalid.n = 0; + Vector v[4]; + for (size_t i = 0; i < adjacentElements.getSize(); ++i) { + /* for now, when snapping a vertex on the boundary + layer, ignore the quality of layer elements. + not only do we not have metrics for this, but the + algorithm that moves curves would need to change */ + if (getFlag(a, adjacentElements[i], LAYER)) + continue; + ma::getVertPoints(a->mesh,adjacentElements[i],v); + if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) + invalid.e[invalid.n++] = adjacentElements[i]; + } +} + +//Moved vertex to model surface or returns invalid elements if not possible +static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) +{ + Mesh* mesh = adapt->mesh; + if (!mesh->hasTag(vertex, snapTag)) return true; + Vector prev = getPosition(mesh, vertex); + Vector target; + mesh->getDoubleTag(vertex, snapTag, &target[0]); + Upward adjacentElements; + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + mesh->setPoint(vertex, 0, target); + getInvalidTets(adapt, adjacentElements, invalid); + if (invalid.n == 0) return true; + mesh->setPoint(vertex, 0, prev); + return false; +} + +static int debugprint = 0; + /* We perform this last to make sure that we have a simple region where we can determine the best operation to perform and because we want to avoid creating more vertices to snap since @@ -369,11 +406,21 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) return true; } } + // Vector pos = getPosition(mesh, vert); + // Vector target(1109.718490, 389.662701, 158.589216); + // if (apf::areClose(pos, target, 1e-6) && ++debugprint==2) { + // printFPP(adapt, FPP); + // exit(1); + // } + if (runFaceSwap(adapt, ents[0])) { + numSwap++; + printf("run face swap\n"); + return true; + } if (splitCollapse.run(ents[1], FPP->vert, adapt->input->validQuality)) { numSplitCollapse++; return true; } - runFaceSwap(adapt, ents[0]); print(mesh->getPCU(), "Swap failed: face swap not implemented"); } return false; @@ -575,40 +622,6 @@ static FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up return FPP; } -static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) -{ - invalid.n = 0; - Vector v[4]; - for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - /* for now, when snapping a vertex on the boundary - layer, ignore the quality of layer elements. - not only do we not have metrics for this, but the - algorithm that moves curves would need to change */ - if (getFlag(a, adjacentElements[i], LAYER)) - continue; - ma::getVertPoints(a->mesh,adjacentElements[i],v); - if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) - invalid.e[invalid.n++] = adjacentElements[i]; - } -} - -//Moved vertex to model surface or returns invalid elements if not possible -static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) -{ - Mesh* mesh = adapt->mesh; - if (!mesh->hasTag(vertex, snapTag)) return true; - Vector prev = getPosition(mesh, vertex); - Vector target; - mesh->getDoubleTag(vertex, snapTag, &target[0]); - Upward adjacentElements; - mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - mesh->setPoint(vertex, 0, target); - getInvalidTets(adapt, adjacentElements, invalid); - if (invalid.n == 0) return true; - mesh->setPoint(vertex, 0, prev); - return false; -} - bool Snapper::trySimpleSnap() { apf::Up invalid; From b925308bc54041c60d9956b3270aac53e08176f2 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 15 Aug 2025 21:02:28 -0400 Subject: [PATCH 174/319] faceswap size check --- ma/ma.cc | 26 ++++++++++++++++++++++++ ma/maFaceSwap.cc | 51 ++++++++++++++++++++++++++++++------------------ ma/maSnapper.cc | 13 +++--------- 3 files changed, 61 insertions(+), 29 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 97c80456e..fdba38164 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -17,9 +17,35 @@ #include "maLayer.h" #include "maDBG.h" #include +#include namespace ma { +void printHistogramData(std::string name, std::vector input, double min, double max, Mesh* m) +{ + const int nbins = 10; + int count[nbins] = {0}; + const double bin_size = (max-min)/(nbins*1.0); + for (size_t i = 0; i < input.size(); ++i) { + int bin = (int)std::round((input[i] - min)/bin_size); + count[bin] += 1; + } + + std::cout << name << "\n"; + for (int i = 0; i < nbins; ++i) { + fprintf(stderr, "%d\n", count[i]); + } +} + +void printHistogramStats(Adapt* a) +{ + std::vector lengths; + std::vector qualities; + ma::stats(a->mesh, a->input->sizeField, lengths, qualities, true); + printHistogramData("quality", qualities, 0, 1, a->mesh); + printHistogramData("lengths", lengths, 0, MAXLENGTH+1, a->mesh); +} + void adapt(Input* in) { double t0 = pcu::Time(); diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 04e063446..5f97469c0 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -49,20 +49,6 @@ namespace ma { return true; } - bool qualityCheck() - { - double qualityToBeat = adapt->input->validQuality; - if (improveQuality) - qualityToBeat = std::max(getWorstQuality(adapt, oldTets), adapt->input->validQuality); - - for (int i=0; ishape->getQuality(newTets[i]); - if (quality < qualityToBeat) - return false; - } - return true; - } - void findNumNewTets() { mesh->getAdjacent(face, 3, oldTets); @@ -141,14 +127,33 @@ namespace ma { buildTwo2Three(); cavity.afterBuilding(); cavity.fit(oldTets); - if (!qualityCheck()) - return false; - destroyOldElements(); return true; } bool sizeCheck() { + if (!improveQuality) return true; + for (int i=0; igetDownward(newTets[i], 1, edges); + for (int e=0; e<6; e++) + if (adapt->sizeField->measure(edges[e]) > MAXLENGTH) + return false; + } + return true; + } + + bool qualityCheck() + { + double qualityToBeat = adapt->input->validQuality; + if (improveQuality) + qualityToBeat = std::max(getWorstQuality(adapt, oldTets), adapt->input->validQuality); + + for (int i=0; ishape->getQuality(newTets[i]); + if (quality < qualityToBeat) + return false; + } return true; } @@ -166,12 +171,20 @@ namespace ma { bool runFaceSwap(Adapt* a, Entity* face, bool improveQuality) { + return false; FaceSwap faceSwap(a, face, improveQuality); - if (!faceSwap.topoCheck() && !faceSwap.geomCheck()) { + + if (faceSwap.topoCheck() + && faceSwap.geomCheck() + && faceSwap.sizeCheck() + && faceSwap.qualityCheck()) { + faceSwap.destroyOldElements(); + return true; + } + else { faceSwap.cancel(); return false; } - return true; } } \ No newline at end of file diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index a8f758ece..0d775166e 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -406,17 +406,10 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) return true; } } - // Vector pos = getPosition(mesh, vert); - // Vector target(1109.718490, 389.662701, 158.589216); - // if (apf::areClose(pos, target, 1e-6) && ++debugprint==2) { - // printFPP(adapt, FPP); - // exit(1); + // if (runFaceSwap(adapt, ents[0], false)) { + // numSwap++; + // return true; // } - if (runFaceSwap(adapt, ents[0])) { - numSwap++; - printf("run face swap\n"); - return true; - } if (splitCollapse.run(ents[1], FPP->vert, adapt->input->validQuality)) { numSplitCollapse++; return true; From 963269065c41e3614b19d4e34ce52b2f8dd01062 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 16 Aug 2025 15:38:08 -0400 Subject: [PATCH 175/319] print histogram stats --- ma/ma.cc | 18 ++++++++++++++---- ma/maSnapper.cc | 2 -- 2 files changed, 14 insertions(+), 6 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index fdba38164..d82a97c4f 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -26,15 +26,22 @@ void printHistogramData(std::string name, std::vector input, double min, const int nbins = 10; int count[nbins] = {0}; const double bin_size = (max-min)/(nbins*1.0); + double inputMax = 0; + double inputMin = max; + for (size_t i = 0; i < input.size(); ++i) { + if (input[i] > inputMax) + inputMax = input[i]; + if (input[i] < inputMin) + inputMin = input[i]; int bin = (int)std::round((input[i] - min)/bin_size); count[bin] += 1; } std::cout << name << "\n"; - for (int i = 0; i < nbins; ++i) { + printf("Min: %f, Max: %f\n", inputMin, inputMax); + for (int i = 0; i < nbins; ++i) fprintf(stderr, "%d\n", count[i]); - } } void printHistogramStats(Adapt* a) @@ -70,6 +77,11 @@ void adapt(Input* in) printQuality(a); postBalance(a); Mesh* m = a->mesh; + + double t1 = pcu::Time(); + print(m->getPCU(), "mesh adapted in %f seconds", t1-t0); + printHistogramStats(a); + delete a; // cleanup input object and associated sizefield and solutiontransfer objects if (in->ownsSizeField) @@ -77,8 +89,6 @@ void adapt(Input* in) if (in->ownsSolutionTransfer) delete in->solutionTransfer; delete in; - double t1 = pcu::Time(); - print(m->getPCU(), "mesh adapted in %f seconds", t1-t0); apf::printStats(m); } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 0d775166e..d722696b0 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -394,7 +394,6 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSplitCollapse++; return true; } - print(mesh->getPCU(), "Swap failed: Consider more collapses"); } // three large dihedral angles -> key entity: a mesh face else { @@ -414,7 +413,6 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) numSplitCollapse++; return true; } - print(mesh->getPCU(), "Swap failed: face swap not implemented"); } return false; } From 21e2ba527d93cb7760023c169c05458b9467a15f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 16 Aug 2025 20:29:56 -0400 Subject: [PATCH 176/319] ma shape new --- ma/CMakeLists.txt | 2 + ma/ma.cc | 3 +- ma/maShapeNew.cc | 133 +++++++++++++++++++++++++++++++++++++++++++ ma/maShapeNew.h | 13 +++++ ma/pkg_tribits.cmake | 1 + 5 files changed, 151 insertions(+), 1 deletion(-) create mode 100644 ma/maShapeNew.cc create mode 100644 ma/maShapeNew.h diff --git a/ma/CMakeLists.txt b/ma/CMakeLists.txt index 5e487839a..68d6e3e84 100644 --- a/ma/CMakeLists.txt +++ b/ma/CMakeLists.txt @@ -30,6 +30,7 @@ set(SOURCES maEdgeSwap.cc maFaceSwap.cc maShape.cc + maShapeNew.cc maShapeHandler.cc maQuality.cc maSplits.cc @@ -60,6 +61,7 @@ set(HEADERS maMesh.h maSize.h maShape.h + maShapeNew.h maTables.h maSolutionTransfer.h maExtrude.h diff --git a/ma/ma.cc b/ma/ma.cc index d82a97c4f..4101acaa7 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -16,6 +16,7 @@ #include "maBalance.h" #include "maLayer.h" #include "maDBG.h" +#include "maShapeNew.h" #include #include @@ -71,7 +72,7 @@ void adapt(Input* in) coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); - fixElementShapes(a); + fixElementShapesNew(a); cleanupLayer(a); tetrahedronize(a); printQuality(a); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc new file mode 100644 index 000000000..ed87e17b5 --- /dev/null +++ b/ma/maShapeNew.cc @@ -0,0 +1,133 @@ + +/****************************************************************************** + + Copyright 2013 Scientific Computation Research Center, + Rensselaer Polytechnic Institute. All rights reserved. + + The LICENSE file included with this distribution describes the terms + of the SCOREC Non-Commercial License this program is distributed under. + +*******************************************************************************/ +#include "maShapeNew.h" +#include "maSize.h" +#include "maAdapt.h" +#include "maSnap.h" +#include "maSnapper.h" +#include "maOperator.h" +#include "maEdgeSwap.h" +#include "maDoubleSplitCollapse.h" +#include "maSingleSplitCollapse.h" +#include "maFaceSplitCollapse.h" +#include "maShortEdgeRemover.h" +#include "maShapeHandler.h" +#include "maBalance.h" +#include "maDBG.h" +#include + +namespace ma { + +struct IsBadQuality : public Predicate +{ + IsBadQuality(Adapt* a_):a(a_) {} + bool operator()(Entity* e) + { + return a->shape->getQuality(e) < a->input->goodQuality; + } + Adapt* a; +}; + +int markBadQualityNew(Adapt* a) +{ + IsBadQuality p(a); + return markEntities(a, a->mesh->getDimension(), p, BAD_QUALITY, OK_QUALITY); +} + +void unMarkBadQualityNew(Adapt* a) +{ + Mesh* m = a->mesh; + Iterator* it; + Entity* e; + it = m->begin(m->getDimension()); + while ((e = m->iterate(it))) { + if (getFlag(a, e, ma::BAD_QUALITY)) + clearFlag(a, e, ma::BAD_QUALITY); + } + m->end(it); +} + +static void fixLargeAngleTetsNew(Adapt* a) +{ + FaceSplitCollapse faceSplitCollapse(a); + SingleSplitCollapse splitCollapse(a); + DoubleSplitCollapse doubleSplitCollapse(a); + EdgeSwap* edgeSwap = makeEdgeSwap(a); + + Entity* tet; + Iterator* it = a->mesh->begin(3); + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + clearFlag(a, tet, BAD_QUALITY); + Entity* verts[4]; + a->mesh->getDownward(tet, 0, verts); + Entity* vert = verts[0]; + Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); + Entity* ents[4]; + double area[4]; + int bit = getTetStats(a, vert, face, tet, ents, area); + + // two large dihedral angles -> key problem: two mesh edges + if (bit==3 || bit==5 || bit==6) { + if (edgeSwap->run(ents[0])) continue; + if (edgeSwap->run(ents[1])) continue; + if (splitCollapse.run(ents[0], vert)) continue; + if (splitCollapse.run(ents[1], vert)) continue; + if (doubleSplitCollapse.run(ents)) continue; + } + // three large dihedral angles -> key entity: a mesh face + else { + Entity* edges[3]; + a->mesh->getDownward(ents[0], 1, edges); + if (edgeSwap->run(edges[0])) continue; + if (edgeSwap->run(edges[1])) continue; + if (edgeSwap->run(edges[2])) continue; + //TODO: RUN FACE SWAP HERE + if (faceSplitCollapse.run(ents[0], tet)) continue; + } + } +} + +void fixElementShapesNew(Adapt* a) +{ + if ( ! a->input->shouldFixShape) + return; + double t0 = pcu::Time(); + int count = markBadQualityNew(a); + print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", 0, count); + int originalCount = count; + int prev_count; + int iter = 0; + do { + if ( ! count) + break; + prev_count = count; + fixLargeAngleTetsNew(a); + /* We need to snap the new verts as soon as they are + * created (to avoid future problems). At the moment + * new verts are created only during 3D mesh adapt, so + * we only run a bulk snap operation if the mesh is 3D. + */ + if (a->mesh->getDimension() == 3) + snap(a); + count = markBadQualityNew(a); + if (count >= prev_count) + unMarkBadQualityNew(a); // to make sure markEntities does not complain! + // balance the mesh to avoid empty parts + midBalance(a); + iter++; + } while(count < prev_count); + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", + originalCount,count,t1-t0); +} + +} diff --git a/ma/maShapeNew.h b/ma/maShapeNew.h new file mode 100644 index 000000000..1a453e1f5 --- /dev/null +++ b/ma/maShapeNew.h @@ -0,0 +1,13 @@ +#ifndef MA_SHAPE_NEW +#define MA_SHAPE_NEW + +#include "maMesh.h" +#include "maTables.h" + +namespace ma { +class Adapt; + +void fixElementShapesNew(Adapt* a); +} + +#endif \ No newline at end of file diff --git a/ma/pkg_tribits.cmake b/ma/pkg_tribits.cmake index d1db5c276..0bee3cae0 100644 --- a/ma/pkg_tribits.cmake +++ b/ma/pkg_tribits.cmake @@ -26,6 +26,7 @@ set(SOURCES maSnap.cc maEdgeSwap.cc maShape.cc + maShapeNew.cc maShapeHandler.cc maQuality.cc maSplits.cc From acae05b437c0ed3526ea5cfad7563f9d3e270edb Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 20 Aug 2025 14:28:22 -0400 Subject: [PATCH 177/319] print before and after --- ma/maFaceSwap.cc | 21 ++++++++++++++++++++- 1 file changed, 20 insertions(+), 1 deletion(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 5f97469c0..4f0e3b0e7 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -39,6 +39,24 @@ namespace ma { numNewTets=0; } + void printCavityBefore() + { + EntityArray cavity; + for (int i=0; i<2; i++){ + cavity.append(oldTets[i]); + } + ma_dbg::createCavityMesh(adapt, cavity, "BeforeFaceSwap"); + } + + void printCavityAfter() + { + EntityArray cavity; + for (int i=0; igetModelType(mesh->toModel(face)); @@ -120,6 +138,7 @@ namespace ma { bool geomCheck() { findNumNewTets(); + // printCavityBefore(); cavity.beforeBuilding(); if (numNewTets == 2) buildTwo2Two(); @@ -127,6 +146,7 @@ namespace ma { buildTwo2Three(); cavity.afterBuilding(); cavity.fit(oldTets); + // printCavityAfter(); return true; } @@ -171,7 +191,6 @@ namespace ma { bool runFaceSwap(Adapt* a, Entity* face, bool improveQuality) { - return false; FaceSwap faceSwap(a, face, improveQuality); if (faceSwap.topoCheck() From e853d1ffcd2076596d1c6697985ff459e92248a0 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 27 Aug 2025 20:07:03 -0400 Subject: [PATCH 178/319] new fix shape working --- ma/maFaceSwap.cc | 2 +- ma/maShapeNew.cc | 85 ++++++++++++++++++++++++++++++++++++++++-------- 2 files changed, 73 insertions(+), 14 deletions(-) diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 4f0e3b0e7..8ce6184af 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -141,7 +141,7 @@ namespace ma { // printCavityBefore(); cavity.beforeBuilding(); if (numNewTets == 2) - buildTwo2Two(); + return false; // buildTwo2Two(); else if (numNewTets == 3) buildTwo2Three(); cavity.afterBuilding(); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index ed87e17b5..f439f6fe7 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -18,6 +18,7 @@ #include "maDoubleSplitCollapse.h" #include "maSingleSplitCollapse.h" #include "maFaceSplitCollapse.h" +#include "maFaceSwap.h" #include "maShortEdgeRemover.h" #include "maShapeHandler.h" #include "maBalance.h" @@ -55,8 +56,71 @@ void unMarkBadQualityNew(Adapt* a) m->end(it); } +static bool shortEdgeCase(Adapt* a, Entity* tet, Collapse& collapse) +{ + Entity* edges[6]; + a->mesh->getDownward(tet, 1, edges); + bool shortEdgeCase = false; + for (int i=0; i<6; i++) { + if (a->sizeField->measure(edges[i]) < MINLENGTH) { + shortEdgeCase = true; + if (collapse.setEdge(edges[i]) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(a->input->validQuality)) { + collapse.destroyOldElements(); + return true; + } + } + } + return shortEdgeCase; +} + +static double getWorstTriangle(Adapt* a, Entity* tet, Entity*& worstTriangle) +{ + Entity* triangles[4]; + a->mesh->getDownward(tet, 2, triangles); + double worstQuality = a->sizeField->measure(triangles[0]); + worstTriangle = triangles[0]; + for (int i=1; i<4; i++) { + double quality = a->sizeField->measure(triangles[i]); + if (quality < worstQuality) { + worstQuality = quality; + worstTriangle = triangles[i]; + } + } + return worstQuality; +} + +static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitCollapse, EdgeSwap* edgeSwap) +{ + Entity* worstTriangle; + if (getWorstTriangle(a, tet, worstTriangle) >= a->input->goodQuality) return false; + + Entity* edges[3]; + a->mesh->getDownward(worstTriangle, 1, edges); + double longestLength = a->sizeField->measure(edges[0]); + Entity* longestEdge = edges[0]; + for (int i=1; i<3; i++) { + double length = a->sizeField->measure(edges[i]); + if (length > longestLength) { + longestLength = length; + longestEdge = edges[i]; + } + } + + Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); + if (splitCollapse.run(longestEdge, oppositeVert)) + return true; + if (edgeSwap->run(longestEdge)) + return true; + return true; +} + static void fixLargeAngleTetsNew(Adapt* a) { + Collapse collapse; + collapse.Init(a); FaceSplitCollapse faceSplitCollapse(a); SingleSplitCollapse splitCollapse(a); DoubleSplitCollapse doubleSplitCollapse(a); @@ -67,6 +131,10 @@ static void fixLargeAngleTetsNew(Adapt* a) while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; clearFlag(a, tet, BAD_QUALITY); + + if (shortEdgeCase(a, tet, collapse)) continue; + if (oneLargeAngle(a, tet, splitCollapse, edgeSwap)) continue; + Entity* verts[4]; a->mesh->getDownward(tet, 0, verts); Entity* vert = verts[0]; @@ -75,23 +143,14 @@ static void fixLargeAngleTetsNew(Adapt* a) double area[4]; int bit = getTetStats(a, vert, face, tet, ents, area); - // two large dihedral angles -> key problem: two mesh edges - if (bit==3 || bit==5 || bit==6) { + if (bit==3 || bit==5 || bit==6) { //Two Large Angles + if (doubleSplitCollapse.run(ents)) continue; if (edgeSwap->run(ents[0])) continue; if (edgeSwap->run(ents[1])) continue; - if (splitCollapse.run(ents[0], vert)) continue; - if (splitCollapse.run(ents[1], vert)) continue; - if (doubleSplitCollapse.run(ents)) continue; } - // three large dihedral angles -> key entity: a mesh face - else { - Entity* edges[3]; - a->mesh->getDownward(ents[0], 1, edges); - if (edgeSwap->run(edges[0])) continue; - if (edgeSwap->run(edges[1])) continue; - if (edgeSwap->run(edges[2])) continue; - //TODO: RUN FACE SWAP HERE + else { //Three Large Angles if (faceSplitCollapse.run(ents[0], tet)) continue; + // if (runFaceSwap(a, ents[0], true)) continue; } } } From 41e827e445f2974e0838af6f628cd1849d926e7c Mon Sep 17 00:00:00 2001 From: Aditya Joshi Date: Thu, 28 Aug 2025 10:50:37 -0400 Subject: [PATCH 179/319] apply coarsening first, revert changes --- ma/ma.cc | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 97c80456e..b1aa8c3f9 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -27,15 +27,14 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsen(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); + coarsen(a); + coarsenLayer(a); midBalance(a); refine(a); snap(a); - coarsen(a); - coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); fixElementShapes(a); From da0db3425a8aed3712fbe0dc0a99ef018319aab7 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 28 Aug 2025 19:30:56 -0400 Subject: [PATCH 180/319] fix face swap errors --- ma/ma.cc | 4 ++-- ma/maFaceSwap.cc | 35 +++++++++++++++++++++++++++++++---- ma/maShapeNew.cc | 2 +- 3 files changed, 34 insertions(+), 7 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 4101acaa7..b2415cdc9 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -61,14 +61,14 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsen(a); + coarsenMultiple(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); midBalance(a); refine(a); snap(a); - coarsen(a); + coarsenMultiple(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); diff --git a/ma/maFaceSwap.cc b/ma/maFaceSwap.cc index 8ce6184af..daa326527 100644 --- a/ma/maFaceSwap.cc +++ b/ma/maFaceSwap.cc @@ -57,6 +57,29 @@ namespace ma { ma_dbg::createCavityMesh(adapt, cavity, "AfterFaceSwap"); } + bool invalid(Entity* verts[4]) + { + Vector v[4] {getPosition(mesh, verts[0]), getPosition(mesh, verts[1]), + getPosition(mesh, verts[2]), getPosition(mesh, verts[3])}; + if ((apf::cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) + return true; + return false; + } + + bool invalidSwap() { + Entity* opp1 = getTetVertOppositeTri(mesh, oldTets[0], face); + Entity* opp2 = getTetVertOppositeTri(mesh, oldTets[1], face); + Entity* faceVerts[3]; + mesh->getDownward(face, 0, faceVerts); + Entity* tetVertsA[4] = {faceVerts[0], faceVerts[1], opp1, opp2}; + if (invalid(tetVertsA)) return true; + Entity* tetVertsB[4] = {faceVerts[1], faceVerts[2], opp1, opp2}; + if (invalid(tetVertsB)) return true; + Entity* tetVertsC[4] = {faceVerts[2], faceVerts[0], opp1, opp2}; + if (invalid(tetVertsC)) return true; + return false; + } + bool topoCheck() { int modelDim = mesh->getModelType(mesh->toModel(face)); @@ -64,12 +87,14 @@ namespace ma { return false; if (getFlag(adapt,face,DONT_SWAP)) return false; + mesh->getAdjacent(face, 3, oldTets); + if (invalidSwap()) + return false; return true; } void findNumNewTets() { - mesh->getAdjacent(face, 3, oldTets); numNewTets = 3; Entity* faceVerts[3]; mesh->getDownward(face, 0, faceVerts); @@ -79,7 +104,7 @@ namespace ma { Vector normal0 = getTriNormal(mesh, face0); Vector normal1 = getTriNormal(mesh, face1); if (apf::areClose(normal0, normal1, 1e-10)) { - numNewTets = 2; + numNewTets = 0; //TODO: TEST Two2Two CASE commonEdge = findCommonEdge(mesh, face0, face1); } } @@ -140,8 +165,10 @@ namespace ma { findNumNewTets(); // printCavityBefore(); cavity.beforeBuilding(); - if (numNewTets == 2) - return false; // buildTwo2Two(); + if (numNewTets == 0) + return false; + else if (numNewTets == 2) + buildTwo2Two(); else if (numNewTets == 3) buildTwo2Three(); cavity.afterBuilding(); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index f439f6fe7..22b6f29f2 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -150,7 +150,7 @@ static void fixLargeAngleTetsNew(Adapt* a) } else { //Three Large Angles if (faceSplitCollapse.run(ents[0], tet)) continue; - // if (runFaceSwap(a, ents[0], true)) continue; + if (runFaceSwap(a, ents[0], true)) continue; } } } From cc2d767277293aa1f055f77e7ce30d7935c5812c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 28 Aug 2025 22:14:55 -0400 Subject: [PATCH 181/319] print every loop --- ma/ma.cc | 4 ++-- ma/maShapeNew.cc | 1 + 2 files changed, 3 insertions(+), 2 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index b2415cdc9..4101acaa7 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -61,14 +61,14 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsenMultiple(a); + coarsen(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); midBalance(a); refine(a); snap(a); - coarsenMultiple(a); + coarsen(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 22b6f29f2..0fa504fa6 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -183,6 +183,7 @@ void fixElementShapesNew(Adapt* a) // balance the mesh to avoid empty parts midBalance(a); iter++; + print(a->mesh->getPCU(), "loop %d: bad Shapes went from %d to %d", iter, prev_count, count); } while(count < prev_count); double t1 = pcu::Time(); print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", From d4654792acdeb772f9f843fa9b6454460a74dc35 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 29 Aug 2025 17:46:37 -0400 Subject: [PATCH 182/319] moved comments from github --- ma/maCoarsen.cc | 9 +++++++++ ma/maCollapse.cc | 4 +++- ma/maDBG.cc | 3 ++- ma/maDBG.h | 2 ++ ma/maDoubleSplitCollapse.h | 3 +++ ma/maSingleSplitCollapse.h | 3 +++ ma/maSize.h | 4 ++++ ma/maSnapper.cc | 6 ++++++ test/aniso_adapt.h | 7 ++++++- 9 files changed, 38 insertions(+), 3 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 333499927..cde1151ee 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -7,6 +7,15 @@ of the SCOREC Non-Commercial License this program is distributed under. *******************************************************************************/ +/* +This file contains two coarsening alogrithms. + 1. coarsenMultiple: will repeatedly create independent sets and collapse the mesh + until there are no more short edges left. This code is currently only used for testing + since more work needs to be done to achieve better performance and have the code work in + parallel, at which point the other coarsen algorithm can be deleted. + 2. coarsen: The first will create one independent set and then collapse all of the edges + in that independent set. +*/ #include "maCoarsen.h" #include "maAdapt.h" #include "maCollapse.h" diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 6b4a2ddc9..f966fa37d 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -55,7 +55,9 @@ bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) return true; } -//Prevents snapping from undoing refinement +/*Sometimes the snapping procedure will attempt to collapse a edge that was just +refined. This function will prevent that when the growth of the edge is above a +thresh hold where it might not reach the target edge length*/ bool Collapse::edgesGoodSize() { PCU_ALWAYS_ASSERT(elementsToKeep.size()); PCU_ALWAYS_ASSERT(elementsToKeep.size() == newElements.size()); diff --git a/ma/maDBG.cc b/ma/maDBG.cc index f766a296c..ed78f92df 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -30,7 +30,7 @@ static double PI = 3.14159265359; namespace ma_dbg { - +// If no dimension specified then it will write the greatest dimension to the file. void writeMesh(ma::Mesh* m, const char* prefix, const char* suffix, @@ -262,6 +262,7 @@ void createCavityMesh(ma::Adapt* a, cavityMesh->acceptChanges(); std::stringstream ss; + //Allows the user to print to current directory or to folder if (a->input->debugFolder) { ss << a->input->debugFolder << "/"; } diff --git a/ma/maDBG.h b/ma/maDBG.h index 2d7ed62f9..16a65d882 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -25,6 +25,8 @@ void writeMesh(ma::Mesh* m, const char* prefix, const char* suffix); +/* Creates a field to contain the model classification for each vertex. Which can be + printed to a file using writeMesh() with dim=0. */ void addClassification(ma::Adapt* a, const char* fieldName); diff --git a/ma/maDoubleSplitCollapse.h b/ma/maDoubleSplitCollapse.h index 42c8a9f06..048faa0aa 100644 --- a/ma/maDoubleSplitCollapse.h +++ b/ma/maDoubleSplitCollapse.h @@ -24,6 +24,9 @@ class DoubleSplitCollapse bool tryThisCollapse(); bool tryBothCollapses(Entity* e); void accept(); + /* Quality is optional since during fix shape we don't need a target quality as + the quality improves. However we need a target quality during snapping since + we don't care if the quality gets worse. */ bool run(Entity** edges, double quality = -1); Adapt* getAdapt(); private: diff --git a/ma/maSingleSplitCollapse.h b/ma/maSingleSplitCollapse.h index 712e412ed..19cefb6f2 100644 --- a/ma/maSingleSplitCollapse.h +++ b/ma/maSingleSplitCollapse.h @@ -32,6 +32,9 @@ class SingleSplitCollapse bool tryThisCollapse(); bool tryBothCollapses(Entity* e); void accept(); + /* Quality is optional since during fix shape we don't need a target quality as + the quality improves. However we need a target quality during snapping since + we don't care if the quality gets worse. */ bool run(Entity* edge, Entity* vert, double quality=-1); Adapt* getAdapt(); private: diff --git a/ma/maSize.h b/ma/maSize.h index f83021a30..83cd2b7e8 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -19,6 +19,10 @@ namespace ma { typedef apf::Matrix3x3 Matrix; +/* Desired length bounds in metric space to replace hard coded values. Right now +these values are const, since we are not sure it is worth while to have the user, +modify these in addition to desired length. Future testing in need because Li's +thesis describes there might be utility to having the user modify them */ const double MAXLENGTH = 1.5; const double MINLENGTH = .5; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 95a378ebe..0eb2a9d31 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -7,6 +7,12 @@ of the SCOREC Non-Commercial License this program is distributed under. *******************************************************************************/ +/* + This file contains functions to move a point to the model surface. As described + in Li's thesis it will first try to collapse in the target direction. Otherwise + it will collapse to simplify the region and attempt other operators such as + swap, split collapse, double split collapse. +*/ #include "maSnapper.h" #include "maAdapt.h" #include "maShapeHandler.h" diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 2a93098dd..51f21e575 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -15,7 +15,12 @@ #include "maSnap.h" #include "apfGeometry.h" #include - +/* + Test some of the individual components in mesh adaptation to make sure that they are + functioning as intended. Right now it only tests coarsen refinement and snapping but + can be expanded to test more in the future. This has been tested with mds, simmetrix, + and capstone meshes. +*/ class AnIso : public ma::AnisotropicFunction { public: From f9de8662c8034678e7d9b93cea8e6d7b7913d7d9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 17:56:13 -0400 Subject: [PATCH 183/319] small fix shape improvement --- ma/maShapeNew.cc | 21 +++++++++++++++------ 1 file changed, 15 insertions(+), 6 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 0fa504fa6..3d438d097 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -110,10 +110,8 @@ static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitColla } Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); - if (splitCollapse.run(longestEdge, oppositeVert)) - return true; - if (edgeSwap->run(longestEdge)) - return true; + if (edgeSwap->run(longestEdge)) return true; + if (splitCollapse.run(longestEdge, oppositeVert)) return true; return true; } @@ -144,13 +142,24 @@ static void fixLargeAngleTetsNew(Adapt* a) int bit = getTetStats(a, vert, face, tet, ents, area); if (bit==3 || bit==5 || bit==6) { //Two Large Angles - if (doubleSplitCollapse.run(ents)) continue; if (edgeSwap->run(ents[0])) continue; if (edgeSwap->run(ents[1])) continue; + Entity* v0 = getTriVertOppositeEdge(a->mesh, ents[2], ents[0]); + if (splitCollapse.run(ents[0], v0)) continue; + Entity* v1 = getTriVertOppositeEdge(a->mesh, ents[3], ents[1]); + if (splitCollapse.run(ents[1], v1)) continue; + if (doubleSplitCollapse.run(ents)) continue; } else { //Three Large Angles - if (faceSplitCollapse.run(ents[0], tet)) continue; + Entity* faceEdges[3]; + a->mesh->getDownward(ents[0], 1, faceEdges); + if (edgeSwap->run(faceEdges[0])) continue; + if (edgeSwap->run(faceEdges[1])) continue; + if (edgeSwap->run(faceEdges[2])) continue; if (runFaceSwap(a, ents[0], true)) continue; + Entity* v = getTriVertOppositeEdge(a->mesh, ents[2], ents[1]); + if (splitCollapse.run(ents[1], v)) continue; + if (faceSplitCollapse.run(ents[0], tet)) continue; } } } From a747e289171c09fe7b9f721e85397fb15e35f089 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 19:52:10 -0400 Subject: [PATCH 184/319] pass collapse --- ma/ma.cc | 4 ++-- ma/maShapeNew.cc | 40 +++++++++++++++++++++++----------------- 2 files changed, 25 insertions(+), 19 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 4101acaa7..b8762b80f 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -50,8 +50,8 @@ void printHistogramStats(Adapt* a) std::vector lengths; std::vector qualities; ma::stats(a->mesh, a->input->sizeField, lengths, qualities, true); - printHistogramData("quality", qualities, 0, 1, a->mesh); - printHistogramData("lengths", lengths, 0, MAXLENGTH+1, a->mesh); + printHistogramData("\nQualities:", qualities, 0, 1, a->mesh); + printHistogramData("\nLengths:", lengths, 0, MAXLENGTH+1, a->mesh); } void adapt(Input* in) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 3d438d097..3fd9d6145 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -56,24 +56,27 @@ void unMarkBadQualityNew(Adapt* a) m->end(it); } +static bool collapseEdge(Adapt* a, Entity* edge, Collapse& collapse) +{ + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(a->input->validQuality)) { + collapse.destroyOldElements(); + return true; + } + return false; +} + static bool shortEdgeCase(Adapt* a, Entity* tet, Collapse& collapse) { Entity* edges[6]; a->mesh->getDownward(tet, 1, edges); - bool shortEdgeCase = false; - for (int i=0; i<6; i++) { - if (a->sizeField->measure(edges[i]) < MINLENGTH) { - shortEdgeCase = true; - if (collapse.setEdge(edges[i]) && - collapse.checkClass() && - collapse.checkTopo() && - collapse.tryBothDirections(a->input->validQuality)) { - collapse.destroyOldElements(); + for (int i=0; i<6; i++) + if (a->sizeField->measure(edges[i]) < MINLENGTH) + if (collapseEdge(a, edges[i], collapse)) return true; - } - } - } - return shortEdgeCase; + return false; } static double getWorstTriangle(Adapt* a, Entity* tet, Entity*& worstTriangle) @@ -92,7 +95,7 @@ static double getWorstTriangle(Adapt* a, Entity* tet, Entity*& worstTriangle) return worstQuality; } -static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitCollapse, EdgeSwap* edgeSwap) +static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitCollapse, EdgeSwap* edgeSwap, Collapse& collapse) { Entity* worstTriangle; if (getWorstTriangle(a, tet, worstTriangle) >= a->input->goodQuality) return false; @@ -112,7 +115,10 @@ static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitColla Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); if (edgeSwap->run(longestEdge)) return true; if (splitCollapse.run(longestEdge, oppositeVert)) return true; - return true; + for (int i=0; i<3; i++) + if (edges[i] != longestEdge && collapseEdge(a, edges[i], collapse)) + return true; + return false; } static void fixLargeAngleTetsNew(Adapt* a) @@ -131,7 +137,7 @@ static void fixLargeAngleTetsNew(Adapt* a) clearFlag(a, tet, BAD_QUALITY); if (shortEdgeCase(a, tet, collapse)) continue; - if (oneLargeAngle(a, tet, splitCollapse, edgeSwap)) continue; + if (oneLargeAngle(a, tet, splitCollapse, edgeSwap, collapse)) continue; Entity* verts[4]; a->mesh->getDownward(tet, 0, verts); @@ -192,7 +198,7 @@ void fixElementShapesNew(Adapt* a) // balance the mesh to avoid empty parts midBalance(a); iter++; - print(a->mesh->getPCU(), "loop %d: bad Shapes went from %d to %d", iter, prev_count, count); + print(a->mesh->getPCU(), "loop %d: bad shapes went from %d to %d", iter, prev_count, count); } while(count < prev_count); double t1 = pcu::Time(); print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", From f1fd03df364155c609cea921de3164cfe23f313c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 20:26:17 -0400 Subject: [PATCH 185/319] moved istwolargeangles --- ma/maShapeNew.cc | 46 +++++++++++++++++++++++++--------------------- 1 file changed, 25 insertions(+), 21 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 3fd9d6145..5c9a12ad0 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -121,6 +121,17 @@ static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitColla return false; } +static bool isTwoLargeAngles(Adapt* a, Entity* tet, Entity* problemEnts[4]) +{ + Entity* verts[4]; + a->mesh->getDownward(tet, 0, verts); + Entity* vert = verts[0]; + Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); + double area[4]; + int bit = getTetStats(a, vert, face, tet, problemEnts, area); + return bit==3 || bit==5 || bit==6; +} + static void fixLargeAngleTetsNew(Adapt* a) { Collapse collapse; @@ -139,33 +150,26 @@ static void fixLargeAngleTetsNew(Adapt* a) if (shortEdgeCase(a, tet, collapse)) continue; if (oneLargeAngle(a, tet, splitCollapse, edgeSwap, collapse)) continue; - Entity* verts[4]; - a->mesh->getDownward(tet, 0, verts); - Entity* vert = verts[0]; - Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); - Entity* ents[4]; - double area[4]; - int bit = getTetStats(a, vert, face, tet, ents, area); - - if (bit==3 || bit==5 || bit==6) { //Two Large Angles - if (edgeSwap->run(ents[0])) continue; - if (edgeSwap->run(ents[1])) continue; - Entity* v0 = getTriVertOppositeEdge(a->mesh, ents[2], ents[0]); - if (splitCollapse.run(ents[0], v0)) continue; - Entity* v1 = getTriVertOppositeEdge(a->mesh, ents[3], ents[1]); - if (splitCollapse.run(ents[1], v1)) continue; - if (doubleSplitCollapse.run(ents)) continue; + Entity* problemEnts[4]; + if (isTwoLargeAngles(a, tet, problemEnts)) { + if (edgeSwap->run(problemEnts[0])) continue; + if (edgeSwap->run(problemEnts[1])) continue; + Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); + if (splitCollapse.run(problemEnts[0], v0)) continue; + Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v1)) continue; + if (doubleSplitCollapse.run(problemEnts)) continue; } else { //Three Large Angles Entity* faceEdges[3]; - a->mesh->getDownward(ents[0], 1, faceEdges); + a->mesh->getDownward(problemEnts[0], 1, faceEdges); if (edgeSwap->run(faceEdges[0])) continue; if (edgeSwap->run(faceEdges[1])) continue; if (edgeSwap->run(faceEdges[2])) continue; - if (runFaceSwap(a, ents[0], true)) continue; - Entity* v = getTriVertOppositeEdge(a->mesh, ents[2], ents[1]); - if (splitCollapse.run(ents[1], v)) continue; - if (faceSplitCollapse.run(ents[0], tet)) continue; + if (runFaceSwap(a, problemEnts[0], true)) continue; + Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v)) continue; + if (faceSplitCollapse.run(problemEnts[0], tet)) continue; } } } From 57054727c14f1c8c7ab29d9342e4ce386778ff0b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 20:46:25 -0400 Subject: [PATCH 186/319] moved fix shape to object --- ma/maShapeNew.cc | 222 +++++++++++++++++++++++++---------------------- 1 file changed, 117 insertions(+), 105 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 5c9a12ad0..0c458273d 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -56,123 +56,134 @@ void unMarkBadQualityNew(Adapt* a) m->end(it); } -static bool collapseEdge(Adapt* a, Entity* edge, Collapse& collapse) +class FixShape { - if (collapse.setEdge(edge) && - collapse.checkClass() && - collapse.checkTopo() && - collapse.tryBothDirections(a->input->validQuality)) { - collapse.destroyOldElements(); - return true; - } - return false; -} + public: + Adapt* a; + Collapse collapse; + SingleSplitCollapse splitCollapse; + DoubleSplitCollapse doubleSplitCollapse; + FaceSplitCollapse faceSplitCollapse; + EdgeSwap* edgeSwap; -static bool shortEdgeCase(Adapt* a, Entity* tet, Collapse& collapse) -{ - Entity* edges[6]; - a->mesh->getDownward(tet, 1, edges); - for (int i=0; i<6; i++) - if (a->sizeField->measure(edges[i]) < MINLENGTH) - if (collapseEdge(a, edges[i], collapse)) - return true; - return false; -} + FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt) + { + a = adapt; + collapse.Init(a); + edgeSwap = makeEdgeSwap(a); + } -static double getWorstTriangle(Adapt* a, Entity* tet, Entity*& worstTriangle) -{ - Entity* triangles[4]; - a->mesh->getDownward(tet, 2, triangles); - double worstQuality = a->sizeField->measure(triangles[0]); - worstTriangle = triangles[0]; - for (int i=1; i<4; i++) { - double quality = a->sizeField->measure(triangles[i]); - if (quality < worstQuality) { - worstQuality = quality; - worstTriangle = triangles[i]; + bool collapseEdge(Entity* edge) + { + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(a->input->validQuality)) { + collapse.destroyOldElements(); + return true; } + return false; } - return worstQuality; -} -static bool oneLargeAngle(Adapt* a, Entity* tet, SingleSplitCollapse& splitCollapse, EdgeSwap* edgeSwap, Collapse& collapse) -{ - Entity* worstTriangle; - if (getWorstTriangle(a, tet, worstTriangle) >= a->input->goodQuality) return false; - - Entity* edges[3]; - a->mesh->getDownward(worstTriangle, 1, edges); - double longestLength = a->sizeField->measure(edges[0]); - Entity* longestEdge = edges[0]; - for (int i=1; i<3; i++) { - double length = a->sizeField->measure(edges[i]); - if (length > longestLength) { - longestLength = length; - longestEdge = edges[i]; + bool shortEdgeCase(Entity* tet) + { + Entity* edges[6]; + a->mesh->getDownward(tet, 1, edges); + for (int i=0; i<6; i++) + if (a->sizeField->measure(edges[i]) < MINLENGTH) + if (collapseEdge(edges[i])) + return true; + return false; + } + + double getWorstTriangle(Entity* tet, Entity*& worstTriangle) + { + Entity* triangles[4]; + a->mesh->getDownward(tet, 2, triangles); + double worstQuality = a->sizeField->measure(triangles[0]); + worstTriangle = triangles[0]; + for (int i=1; i<4; i++) { + double quality = a->sizeField->measure(triangles[i]); + if (quality < worstQuality) { + worstQuality = quality; + worstTriangle = triangles[i]; + } } + return worstQuality; } - Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); - if (edgeSwap->run(longestEdge)) return true; - if (splitCollapse.run(longestEdge, oppositeVert)) return true; - for (int i=0; i<3; i++) - if (edges[i] != longestEdge && collapseEdge(a, edges[i], collapse)) - return true; - return false; -} + bool oneLargeAngle(Entity* tet) + { + Entity* worstTriangle; + if (getWorstTriangle(tet, worstTriangle) >= a->input->goodQuality) return false; + + Entity* edges[3]; + a->mesh->getDownward(worstTriangle, 1, edges); + double longestLength = a->sizeField->measure(edges[0]); + Entity* longestEdge = edges[0]; + for (int i=1; i<3; i++) { + double length = a->sizeField->measure(edges[i]); + if (length > longestLength) { + longestLength = length; + longestEdge = edges[i]; + } + } -static bool isTwoLargeAngles(Adapt* a, Entity* tet, Entity* problemEnts[4]) -{ - Entity* verts[4]; - a->mesh->getDownward(tet, 0, verts); - Entity* vert = verts[0]; - Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); - double area[4]; - int bit = getTetStats(a, vert, face, tet, problemEnts, area); - return bit==3 || bit==5 || bit==6; -} + Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); + if (edgeSwap->run(longestEdge)) return true; + if (splitCollapse.run(longestEdge, oppositeVert)) return true; + for (int i=0; i<3; i++) + if (edges[i] != longestEdge && collapseEdge(edges[i])) + return true; + return false; + } -static void fixLargeAngleTetsNew(Adapt* a) -{ - Collapse collapse; - collapse.Init(a); - FaceSplitCollapse faceSplitCollapse(a); - SingleSplitCollapse splitCollapse(a); - DoubleSplitCollapse doubleSplitCollapse(a); - EdgeSwap* edgeSwap = makeEdgeSwap(a); - - Entity* tet; - Iterator* it = a->mesh->begin(3); - while ((tet = a->mesh->iterate(it))) { - if (!getFlag(a, tet, BAD_QUALITY)) continue; - clearFlag(a, tet, BAD_QUALITY); - - if (shortEdgeCase(a, tet, collapse)) continue; - if (oneLargeAngle(a, tet, splitCollapse, edgeSwap, collapse)) continue; - - Entity* problemEnts[4]; - if (isTwoLargeAngles(a, tet, problemEnts)) { - if (edgeSwap->run(problemEnts[0])) continue; - if (edgeSwap->run(problemEnts[1])) continue; - Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); - if (splitCollapse.run(problemEnts[0], v0)) continue; - Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v1)) continue; - if (doubleSplitCollapse.run(problemEnts)) continue; - } - else { //Three Large Angles - Entity* faceEdges[3]; - a->mesh->getDownward(problemEnts[0], 1, faceEdges); - if (edgeSwap->run(faceEdges[0])) continue; - if (edgeSwap->run(faceEdges[1])) continue; - if (edgeSwap->run(faceEdges[2])) continue; - if (runFaceSwap(a, problemEnts[0], true)) continue; - Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v)) continue; - if (faceSplitCollapse.run(problemEnts[0], tet)) continue; + bool isTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) + { + Entity* verts[4]; + a->mesh->getDownward(tet, 0, verts); + Entity* vert = verts[0]; + Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); + double area[4]; + int bit = getTetStats(a, vert, face, tet, problemEnts, area); + return bit==3 || bit==5 || bit==6; + } + + void fixOnce() + { + Entity* tet; + Iterator* it = a->mesh->begin(3); + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + clearFlag(a, tet, BAD_QUALITY); + + if (shortEdgeCase(tet)) continue; + if (oneLargeAngle(tet)) continue; + + Entity* problemEnts[4]; + if (isTwoLargeAngles(tet, problemEnts)) { + if (edgeSwap->run(problemEnts[0])) continue; + if (edgeSwap->run(problemEnts[1])) continue; + Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); + if (splitCollapse.run(problemEnts[0], v0)) continue; + Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v1)) continue; + if (doubleSplitCollapse.run(problemEnts)) continue; + } + else { //Three Large Angles + Entity* faceEdges[3]; + a->mesh->getDownward(problemEnts[0], 1, faceEdges); + if (edgeSwap->run(faceEdges[0])) continue; + if (edgeSwap->run(faceEdges[1])) continue; + if (edgeSwap->run(faceEdges[2])) continue; + if (runFaceSwap(a, problemEnts[0], true)) continue; + Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v)) continue; + if (faceSplitCollapse.run(problemEnts[0], tet)) continue; + } } } -} +}; void fixElementShapesNew(Adapt* a) { @@ -181,6 +192,7 @@ void fixElementShapesNew(Adapt* a) double t0 = pcu::Time(); int count = markBadQualityNew(a); print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", 0, count); + FixShape fixShape(a); int originalCount = count; int prev_count; int iter = 0; @@ -188,7 +200,7 @@ void fixElementShapesNew(Adapt* a) if ( ! count) break; prev_count = count; - fixLargeAngleTetsNew(a); + fixShape.fixOnce(); /* We need to snap the new verts as soon as they are * created (to avoid future problems). At the moment * new verts are created only during 3D mesh adapt, so From 655840dd100344354d09bdb9f4965f846dfc2b05 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 21:04:12 -0400 Subject: [PATCH 187/319] two and three large angle functions --- ma/maShapeNew.cc | 61 ++++++++++++++++++++++++------------------------ 1 file changed, 31 insertions(+), 30 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 0c458273d..d779f7825 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -149,7 +149,31 @@ class FixShape return bit==3 || bit==5 || bit==6; } - void fixOnce() + void fixTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) + { + if (edgeSwap->run(problemEnts[0])) return; + if (edgeSwap->run(problemEnts[1])) return; + Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); + if (splitCollapse.run(problemEnts[0], v0)) return; + Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v1)) return; + if (doubleSplitCollapse.run(problemEnts)) return; + } + + void fixThreeLargeAngles(Entity* tet, Entity* problemEnts[4]) + { + Entity* faceEdges[3]; + a->mesh->getDownward(problemEnts[0], 1, faceEdges); + if (edgeSwap->run(faceEdges[0])) return; + if (edgeSwap->run(faceEdges[1])) return; + if (edgeSwap->run(faceEdges[2])) return; + if (runFaceSwap(a, problemEnts[0], true)) return; + Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v)) return; + if (faceSplitCollapse.run(problemEnts[0], tet)) return; + } + + void loopOnce() { Entity* tet; Iterator* it = a->mesh->begin(3); @@ -159,28 +183,11 @@ class FixShape if (shortEdgeCase(tet)) continue; if (oneLargeAngle(tet)) continue; - Entity* problemEnts[4]; - if (isTwoLargeAngles(tet, problemEnts)) { - if (edgeSwap->run(problemEnts[0])) continue; - if (edgeSwap->run(problemEnts[1])) continue; - Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); - if (splitCollapse.run(problemEnts[0], v0)) continue; - Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v1)) continue; - if (doubleSplitCollapse.run(problemEnts)) continue; - } - else { //Three Large Angles - Entity* faceEdges[3]; - a->mesh->getDownward(problemEnts[0], 1, faceEdges); - if (edgeSwap->run(faceEdges[0])) continue; - if (edgeSwap->run(faceEdges[1])) continue; - if (edgeSwap->run(faceEdges[2])) continue; - if (runFaceSwap(a, problemEnts[0], true)) continue; - Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v)) continue; - if (faceSplitCollapse.run(problemEnts[0], tet)) continue; - } + if (isTwoLargeAngles(tet, problemEnts)) + fixTwoLargeAngles(tet, problemEnts); + else + fixThreeLargeAngles(tet, problemEnts); } } }; @@ -200,19 +207,13 @@ void fixElementShapesNew(Adapt* a) if ( ! count) break; prev_count = count; - fixShape.fixOnce(); - /* We need to snap the new verts as soon as they are - * created (to avoid future problems). At the moment - * new verts are created only during 3D mesh adapt, so - * we only run a bulk snap operation if the mesh is 3D. - */ + fixShape.loopOnce(); if (a->mesh->getDimension() == 3) snap(a); count = markBadQualityNew(a); if (count >= prev_count) unMarkBadQualityNew(a); // to make sure markEntities does not complain! - // balance the mesh to avoid empty parts - midBalance(a); + midBalance(a); // balance the mesh to avoid empty parts iter++; print(a->mesh->getPCU(), "loop %d: bad shapes went from %d to %d", iter, prev_count, count); } while(count < prev_count); From 9783d1551165d7c8dc9a164d7295739b84dc213b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 22:45:37 -0400 Subject: [PATCH 188/319] edge collapse first --- ma/maShapeNew.cc | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index d779f7825..a89fd3f45 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -162,6 +162,12 @@ class FixShape void fixThreeLargeAngles(Entity* tet, Entity* problemEnts[4]) { + Entity* tetEdges[6]; + a->mesh->getDownward(tet, 1, tetEdges); + for (int i=0; i<6; i++) + if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) + if (collapseEdge(tetEdges[i])) + return; Entity* faceEdges[3]; a->mesh->getDownward(problemEnts[0], 1, faceEdges); if (edgeSwap->run(faceEdges[0])) return; From d735b64d4611647f71534cd9caa73fac715847ce Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 30 Aug 2025 23:19:58 -0400 Subject: [PATCH 189/319] todo comments --- ma/maShapeNew.cc | 26 ++++++++++++++++++++------ 1 file changed, 20 insertions(+), 6 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index a89fd3f45..f1a571dd2 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -66,6 +66,20 @@ class FixShape FaceSplitCollapse faceSplitCollapse; EdgeSwap* edgeSwap; + //TODO: Count Operations + int numCollapse=0; + int numEdgeSwap=0; + int numFaceSwap=0; + int numEdgeSplitCollapse=0; + int numFaceSplitCollapse=0; + int numDoubleSplitCollapse=0; + + //TODO: Count Types + int numShortEdges=0; + int numOneLargeAngle=0; + int numTwoLargeAngles=0; + int numThreeLargeAngles=0; + FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt) { a = adapt; @@ -85,13 +99,13 @@ class FixShape return false; } - bool shortEdgeCase(Entity* tet) + bool fixShortEdge(Entity* tet) { Entity* edges[6]; a->mesh->getDownward(tet, 1, edges); for (int i=0; i<6; i++) if (a->sizeField->measure(edges[i]) < MINLENGTH) - if (collapseEdge(edges[i])) + if (collapseEdge(edges[i])) // TODO: Else try collapsing adjacent edges such that edges[i] merges with other edge return true; return false; } @@ -112,7 +126,7 @@ class FixShape return worstQuality; } - bool oneLargeAngle(Entity* tet) + bool fixOneLargeAngle(Entity* tet) { Entity* worstTriangle; if (getWorstTriangle(tet, worstTriangle) >= a->input->goodQuality) return false; @@ -166,7 +180,7 @@ class FixShape a->mesh->getDownward(tet, 1, tetEdges); for (int i=0; i<6; i++) if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) - if (collapseEdge(tetEdges[i])) + if (collapseEdge(tetEdges[i])) //TODO: test collapsing in one direction either towards problemEnts[0] or away return; Entity* faceEdges[3]; a->mesh->getDownward(problemEnts[0], 1, faceEdges); @@ -187,8 +201,8 @@ class FixShape if (!getFlag(a, tet, BAD_QUALITY)) continue; clearFlag(a, tet, BAD_QUALITY); - if (shortEdgeCase(tet)) continue; - if (oneLargeAngle(tet)) continue; + if (fixShortEdge(tet)) continue; + if (fixOneLargeAngle(tet)) continue; Entity* problemEnts[4]; if (isTwoLargeAngles(tet, problemEnts)) fixTwoLargeAngles(tet, problemEnts); From ac4a00f29182d2b6321482329af56451e8a4babc Mon Sep 17 00:00:00 2001 From: Angelyr Date: Tue, 2 Sep 2025 16:08:36 -0400 Subject: [PATCH 190/319] print statistics --- ma/maShapeNew.cc | 116 +++++++++++++++++++++++++++++++++++++---------- 1 file changed, 92 insertions(+), 24 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index f1a571dd2..654cd7a48 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -66,7 +66,6 @@ class FixShape FaceSplitCollapse faceSplitCollapse; EdgeSwap* edgeSwap; - //TODO: Count Operations int numCollapse=0; int numEdgeSwap=0; int numFaceSwap=0; @@ -74,8 +73,10 @@ class FixShape int numFaceSplitCollapse=0; int numDoubleSplitCollapse=0; - //TODO: Count Types - int numShortEdges=0; + int numOneShortEdge=0; + int numTwoShortEdge=0; + int numThreeShortEdge=0; + int numMoreShortEdge=0; int numOneLargeAngle=0; int numTwoLargeAngles=0; int numThreeLargeAngles=0; @@ -105,8 +106,10 @@ class FixShape a->mesh->getDownward(tet, 1, edges); for (int i=0; i<6; i++) if (a->sizeField->measure(edges[i]) < MINLENGTH) - if (collapseEdge(edges[i])) // TODO: Else try collapsing adjacent edges such that edges[i] merges with other edge + if (collapseEdge(edges[i])) { // TODO: Else try collapsing adjacent edges such that edges[i] merges with other edge + numCollapse++; return true; + } return false; } @@ -144,11 +147,13 @@ class FixShape } Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); - if (edgeSwap->run(longestEdge)) return true; - if (splitCollapse.run(longestEdge, oppositeVert)) return true; + if (edgeSwap->run(longestEdge)) + {numEdgeSwap++; return true;} + if (splitCollapse.run(longestEdge, oppositeVert)) + {numEdgeSplitCollapse++; return true;} for (int i=0; i<3; i++) if (edges[i] != longestEdge && collapseEdge(edges[i])) - return true; + {numCollapse++; return true;} return false; } @@ -165,13 +170,13 @@ class FixShape void fixTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) { - if (edgeSwap->run(problemEnts[0])) return; - if (edgeSwap->run(problemEnts[1])) return; + if (edgeSwap->run(problemEnts[0])) {numEdgeSwap++; return;} + if (edgeSwap->run(problemEnts[1])) {numEdgeSwap++; return;} Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); - if (splitCollapse.run(problemEnts[0], v0)) return; + if (splitCollapse.run(problemEnts[0], v0)) {numEdgeSplitCollapse++; return;} Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v1)) return; - if (doubleSplitCollapse.run(problemEnts)) return; + if (splitCollapse.run(problemEnts[1], v1)) {numEdgeSplitCollapse++; return;} + if (doubleSplitCollapse.run(problemEnts)) {numDoubleSplitCollapse++; return;} } void fixThreeLargeAngles(Entity* tet, Entity* problemEnts[4]) @@ -181,16 +186,16 @@ class FixShape for (int i=0; i<6; i++) if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) if (collapseEdge(tetEdges[i])) //TODO: test collapsing in one direction either towards problemEnts[0] or away - return; + {numCollapse++; return;} Entity* faceEdges[3]; a->mesh->getDownward(problemEnts[0], 1, faceEdges); - if (edgeSwap->run(faceEdges[0])) return; - if (edgeSwap->run(faceEdges[1])) return; - if (edgeSwap->run(faceEdges[2])) return; - if (runFaceSwap(a, problemEnts[0], true)) return; + if (edgeSwap->run(faceEdges[0])) {numEdgeSwap++; return;} + if (edgeSwap->run(faceEdges[1])) {numEdgeSwap++; return;} + if (edgeSwap->run(faceEdges[2])) {numEdgeSwap++; return;} + if (runFaceSwap(a, problemEnts[0], true)) {numFaceSwap++; return;} Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v)) return; - if (faceSplitCollapse.run(problemEnts[0], tet)) return; + if (splitCollapse.run(problemEnts[1], v)) {numEdgeSplitCollapse++; return;} + if (faceSplitCollapse.run(problemEnts[0], tet)) {numFaceSplitCollapse++; return;} } void loopOnce() @@ -210,6 +215,68 @@ class FixShape fixThreeLargeAngles(tet, problemEnts); } } + + void printNumOperations() + { + print(a->mesh->getPCU(), "shape operations: collapses %d - edge swaps %d - face swaps %d - edge split collapses %d - face split collapses %d - double split collapse %d", + numCollapse, numEdgeSwap, numFaceSwap, numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); + } + + bool isShortEdge(Entity* tet) + { + Entity* edges[6]; + a->mesh->getDownward(tet, 1, edges); + int numShortEdges=0; + for (int i=0; i<6; i++) + if (a->sizeField->measure(edges[i]) < MINLENGTH) + numShortEdges++; + + if (numShortEdges==0) return false; + else if (numShortEdges==1) numOneShortEdge++; + else if (numShortEdges==2) numTwoShortEdge++; + else if (numShortEdges==3) numThreeShortEdge++; + else numMoreShortEdge++; + return true; + } + + bool isOneLargeAngle(Entity* tet) + { + Entity* worstTriangle; + if (getWorstTriangle(tet, worstTriangle) >= a->input->goodQuality) return false; + return true; + } + + void resetCounters() + { + numOneShortEdge=0; + numTwoShortEdge=0; + numThreeShortEdge=0; + numMoreShortEdge=0; + numOneLargeAngle=0; + numTwoLargeAngles=0; + numThreeLargeAngles=0; + } + + void printNumTypes() + { + resetCounters(); + Entity* tet; + Iterator* it = a->mesh->begin(3); + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + + Entity* problemEnts[4]; + if (isShortEdge(tet)) continue; + else if (isOneLargeAngle(tet)) + numOneLargeAngle++; + else if (isTwoLargeAngles(tet, problemEnts)) + numTwoLargeAngles++; + else + numThreeLargeAngles++; + } + print(a->mesh->getPCU(), "bad shape types: oneShortEdge %d - twoShortEdges %d - threeShortEdges %d - moreShortEdges %d - oneLargeAngle %d - twoLargeAngle %d - threeLargeAngle %d", + numOneShortEdge, numTwoShortEdge, numThreeShortEdge, numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); + } }; void fixElementShapesNew(Adapt* a) @@ -218,21 +285,19 @@ void fixElementShapesNew(Adapt* a) return; double t0 = pcu::Time(); int count = markBadQualityNew(a); - print(a->mesh->getPCU(), "--iter %d of shape correction loop: #bad elements %d", 0, count); + print(a->mesh->getPCU(), "loop %d: of shape correction loop: #bad elements %d", 0, count); FixShape fixShape(a); + fixShape.printNumTypes(); int originalCount = count; int prev_count; int iter = 0; do { - if ( ! count) - break; + if (!count) break; prev_count = count; fixShape.loopOnce(); if (a->mesh->getDimension() == 3) snap(a); count = markBadQualityNew(a); - if (count >= prev_count) - unMarkBadQualityNew(a); // to make sure markEntities does not complain! midBalance(a); // balance the mesh to avoid empty parts iter++; print(a->mesh->getPCU(), "loop %d: bad shapes went from %d to %d", iter, prev_count, count); @@ -240,6 +305,9 @@ void fixElementShapesNew(Adapt* a) double t1 = pcu::Time(); print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", originalCount,count,t1-t0); + fixShape.printNumOperations(); + fixShape.printNumTypes(); + unMarkBadQualityNew(a); } } From 38dcf6ec704769d720c00c33d134d2085d6d121c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Sep 2025 14:17:53 -0400 Subject: [PATCH 191/319] fix tolerance bug --- gmi_cap/gmi_cap.cc | 4 ++++ gmi_cap/gmi_cap.h | 6 ++++++ ma/maSnap.cc | 19 +++++++++---------- 3 files changed, 19 insertions(+), 10 deletions(-) diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index 9996caed6..17eb50491 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -41,6 +41,10 @@ void gmi_cap_start(void) { } } +bool is_gmi_cap_started() { + return cs_module->get_context() && cs_module->get_geometry() && cs_module->get_mesh(); +} + void gmi_cap_stop(void) { if (!cs_module) gmi_fail("gmi_cap_stop called before gmi_cap_start"); diff --git a/gmi_cap/gmi_cap.h b/gmi_cap/gmi_cap.h index 6ee457198..beadebac4 100644 --- a/gmi_cap/gmi_cap.h +++ b/gmi_cap/gmi_cap.h @@ -57,6 +57,12 @@ struct gmi_ent; * \note This call is required before calling any other gmi_cap functions. */ void gmi_cap_start(void); + +/** + * \brief Returns true if gmi_cap library has been initialized with gmi_cap_start + */ +bool is_gmi_cap_started(); + /** * \brief Finalize gmi_cap library. * diff --git a/ma/maSnap.cc b/ma/maSnap.cc index c848f605b..7ab1ea531 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -24,17 +24,16 @@ #include #include -#ifdef HAVE_CAPSTONE -#include "apfCAP.h" +#ifdef PUMI_HAS_CAPSTONE +#include "gmi_cap.h" #endif namespace ma { -static bool isCapstoneMesh(apf::Mesh* m) +static bool isCapstone() { - #ifdef HAVE_CAPSTONE - if (dynamic_cast(m)) return true; - else return false; + #ifdef PUMI_HAS_CAPSTONE + return is_gmi_cap_started(); #else (void)m; return false; @@ -86,7 +85,7 @@ static size_t isSurfUnderlyingFaceDegenerate( m->getFirstDerivative(g, p, uTan, vTan); double uTanSize = uTan.getLength(); double vTanSize = vTan.getLength(); - if (isCapstoneMesh(m)) { + if (isCapstone()) { uTanSize = uTan * uTan; vTanSize = vTan * vTan; } @@ -170,7 +169,7 @@ static void interpolateParametricCoordinateOnEdge( p[1] = 0.0; p[2] = 0.0; - if (isCapstoneMesh(m)) { + if (isCapstone()) { // account for non-uniform parameterization of model-edge Vector X[3]; Vector para[2] = {a, b}; @@ -511,7 +510,7 @@ static void interpolateParametricCoordinatesOnRegularFace( * 2) we only check for faces that are periodic */ // this need to be done for faces, only - if (isCapstoneMesh(m)) + if (isCapstone()) return; if (dim != 2) return; @@ -543,7 +542,7 @@ static void interpolateParametricCoordinatesOnFace( size_t num = isSurfUnderlyingFaceDegenerate(m, g, axes, vals); if (num > 0) { // the underlying surface is degenerate - if (!isCapstoneMesh(m)) { + if (!isCapstone()) { interpolateParametricCoordinatesOnDegenerateFace(m, g, t, a, b, axes, vals, p); } else { From 7988f5f5b8f7233c78049e784afb75356ac23f4a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Sep 2025 14:39:49 -0400 Subject: [PATCH 192/319] remove unused --- ma/maSnap.cc | 1 - 1 file changed, 1 deletion(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 7ab1ea531..bc0c5ae0b 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -35,7 +35,6 @@ static bool isCapstone() #ifdef PUMI_HAS_CAPSTONE return is_gmi_cap_started(); #else - (void)m; return false; #endif } From 2c05df5167e146c0af1178e0b844e39b4de4cab9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Sep 2025 20:46:52 -0400 Subject: [PATCH 193/319] collapse to adjacent --- ma/maShapeNew.cc | 27 +++++++++++++++++++++++---- 1 file changed, 23 insertions(+), 4 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 654cd7a48..966409053 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -100,16 +100,35 @@ class FixShape return false; } + //TODO: consider why this isn't improving + bool collapseToAdjacent(Entity* edge) + { + Entity* verts[2]; + a->mesh->getDownward(edge, 0, verts); + for (int v=0; v<2; v++) { + apf::Up adjEdges; + a->mesh->getUp(verts[v], adjEdges); + for (int e=0; emesh, adjEdges.e[e], verts[v]); + bool alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + setFlag(a, keep, DONT_COLLAPSE); + bool success = collapseEdge(adjEdges.e[e]); + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + if (success) return true; + } + } + return false; + } + bool fixShortEdge(Entity* tet) { Entity* edges[6]; a->mesh->getDownward(tet, 1, edges); for (int i=0; i<6; i++) if (a->sizeField->measure(edges[i]) < MINLENGTH) - if (collapseEdge(edges[i])) { // TODO: Else try collapsing adjacent edges such that edges[i] merges with other edge - numCollapse++; - return true; - } + if (collapseEdge(edges[i])) + { numCollapse++; return true; } return false; } From e5967e34ebedba46a80cbdd9e4666b62bfa46514 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 4 Sep 2025 18:18:40 -0400 Subject: [PATCH 194/319] testing torus adaptation --- test/aniso_adapt.h | 39 ++++++++++++++++++++++++++------------- 1 file changed, 26 insertions(+), 13 deletions(-) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 51f21e575..9f154501d 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -205,27 +205,40 @@ ma::Mesh* refineSnapTest(ma::Mesh* m) return m; } +ma::Mesh* shapeTest(ma::Mesh* m) +{ + m->verify(); + AnIso sf(m, 8, 1); + ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); + adapt(in); + delete in; + return m; +} + void adaptTests(const std::function& createMesh) { //Mesh created multiple times to compare adaptation ma::Mesh* meshReg = createMesh(); apf::writeVtkFiles("startMesh", meshReg); - refineSnapTest(meshReg); - apf::writeVtkFiles("afterRefine", meshReg); + shapeTest(meshReg); + apf::writeVtkFiles("afterShape", meshReg); + + // refineSnapTest(meshReg); + // apf::writeVtkFiles("afterRefine", meshReg); - coarsenRegular(meshReg); - apf::writeVtkFiles("afterCoarsen", meshReg); + // coarsenRegular(meshReg); + // apf::writeVtkFiles("afterCoarsen", meshReg); - ma::Mesh* meshForce = coarsenForced(refineSnapTest(createMesh())); - apf::writeVtkFiles("afterForcedCoarsen", meshForce); + // ma::Mesh* meshForce = coarsenForced(refineSnapTest(createMesh())); + // apf::writeVtkFiles("afterForcedCoarsen", meshForce); - //Make sure setting to force coarsen is functioning - PCU_ALWAYS_ASSERT(countEdges(meshReg) > countEdges(meshForce)); - PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(meshReg) < ma::getAverageEdgeLength(meshForce)); + // //Make sure setting to force coarsen is functioning + // PCU_ALWAYS_ASSERT(countEdges(meshReg) > countEdges(meshForce)); + // PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(meshReg) < ma::getAverageEdgeLength(meshForce)); - meshReg->destroyNative(); - apf::destroyMesh(meshReg); - meshForce->destroyNative(); - apf::destroyMesh(meshForce); + // meshReg->destroyNative(); + // apf::destroyMesh(meshReg); + // meshForce->destroyNative(); + // apf::destroyMesh(meshForce); } \ No newline at end of file From 8f8f3f777ff99b8ebc583965c370546e0e738d41 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 10 Sep 2025 17:37:33 -0400 Subject: [PATCH 195/319] better bins --- ma/ma.cc | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/ma/ma.cc b/ma/ma.cc index b8762b80f..26608d7e0 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -35,7 +35,8 @@ void printHistogramData(std::string name, std::vector input, double min, inputMax = input[i]; if (input[i] < inputMin) inputMin = input[i]; - int bin = (int)std::round((input[i] - min)/bin_size); + int bin = (int)std::floor((input[i] - min)/bin_size); + if (bin >= nbins) bin = nbins - 1; count[bin] += 1; } From 881dcb6c78f8825cb3cd5fa4af416d66806719bd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 10 Sep 2025 19:46:35 -0400 Subject: [PATCH 196/319] dont force and collapse to adj --- ma/maShapeNew.cc | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 966409053..1c4acd9e7 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -129,6 +129,10 @@ class FixShape if (a->sizeField->measure(edges[i]) < MINLENGTH) if (collapseEdge(edges[i])) { numCollapse++; return true; } + for (int i=0; i<6; i++) + if (a->sizeField->measure(edges[i]) < MINLENGTH) + if (collapseToAdjacent(edges[i])) + { numCollapse++; return true; } return false; } @@ -303,6 +307,8 @@ void fixElementShapesNew(Adapt* a) if ( ! a->input->shouldFixShape) return; double t0 = pcu::Time(); + bool oldForce = a->input->shouldForceAdaptation; + a->input->shouldForceAdaptation = false; int count = markBadQualityNew(a); print(a->mesh->getPCU(), "loop %d: of shape correction loop: #bad elements %d", 0, count); FixShape fixShape(a); @@ -321,6 +327,7 @@ void fixElementShapesNew(Adapt* a) iter++; print(a->mesh->getPCU(), "loop %d: bad shapes went from %d to %d", iter, prev_count, count); } while(count < prev_count); + a->input->shouldForceAdaptation = oldForce; double t1 = pcu::Time(); print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", originalCount,count,t1-t0); From 07a869760863049749addd7b41365c160073082c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 10 Sep 2025 20:18:57 -0400 Subject: [PATCH 197/319] .3 2d quality one large angle comparison --- ma/maShapeNew.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 1c4acd9e7..799273862 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -155,7 +155,7 @@ class FixShape bool fixOneLargeAngle(Entity* tet) { Entity* worstTriangle; - if (getWorstTriangle(tet, worstTriangle) >= a->input->goodQuality) return false; + if (getWorstTriangle(tet, worstTriangle) >= .09) return false; Entity* edges[3]; a->mesh->getDownward(worstTriangle, 1, edges); From f258d5967f7e489846902a569d10e9a4d943cebf Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 11 Sep 2025 17:24:25 -0400 Subject: [PATCH 198/319] cbrt quality --- ma/maShape.cc | 2 +- ma/maShapeNew.cc | 22 ++++++++++------------ 2 files changed, 11 insertions(+), 13 deletions(-) diff --git a/ma/maShape.cc b/ma/maShape.cc index dcd0eec17..1a75c248a 100644 --- a/ma/maShape.cc +++ b/ma/maShape.cc @@ -877,7 +877,7 @@ void printQuality(Adapt* a) { if ( ! a->input->shouldPrintQuality) return; - double minqual = getMinQuality(a); + double minqual = cbrt(getMinQuality(a)); print(a->mesh->getPCU(), "worst element quality is %e", minqual); } diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 799273862..e2653fbdc 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -100,7 +100,6 @@ class FixShape return false; } - //TODO: consider why this isn't improving bool collapseToAdjacent(Entity* edge) { Entity* verts[2]; @@ -241,8 +240,10 @@ class FixShape void printNumOperations() { - print(a->mesh->getPCU(), "shape operations: collapses %d - edge swaps %d - face swaps %d - edge split collapses %d - face split collapses %d - double split collapse %d", - numCollapse, numEdgeSwap, numFaceSwap, numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); + print(a->mesh->getPCU(), "shape operations: collapses %d - edge swaps %d - face swaps %d - + edge split collapses %d - face split collapses %d - double split collapse %d", + numCollapse, numEdgeSwap, numFaceSwap, + numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); } bool isShortEdge(Entity* tet) @@ -271,13 +272,8 @@ class FixShape void resetCounters() { - numOneShortEdge=0; - numTwoShortEdge=0; - numThreeShortEdge=0; - numMoreShortEdge=0; - numOneLargeAngle=0; - numTwoLargeAngles=0; - numThreeLargeAngles=0; + numOneShortEdge=numTwoShortEdge=numThreeShortEdge=numMoreShortEdge=0; + numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; } void printNumTypes() @@ -297,8 +293,10 @@ class FixShape else numThreeLargeAngles++; } - print(a->mesh->getPCU(), "bad shape types: oneShortEdge %d - twoShortEdges %d - threeShortEdges %d - moreShortEdges %d - oneLargeAngle %d - twoLargeAngle %d - threeLargeAngle %d", - numOneShortEdge, numTwoShortEdge, numThreeShortEdge, numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); + print(a->mesh->getPCU(), "bad shape types: oneShortEdge %d - twoShortEdges %d - threeShortEdges %d - + moreShortEdges %d - oneLargeAngle %d - twoLargeAngle %d - threeLargeAngle %d", + numOneShortEdge, numTwoShortEdge, numThreeShortEdge, + numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); } }; From e12858f8b98f45dba6c5e48c16a30eae1a00e1a7 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 11 Sep 2025 20:46:44 -0400 Subject: [PATCH 199/319] fixed worst shape --- ma/maShapeNew.cc | 54 ++++++++++++++++++++++++++++++++++++++++-------- 1 file changed, 45 insertions(+), 9 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index e2653fbdc..eeddd328e 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -194,10 +194,18 @@ class FixShape { if (edgeSwap->run(problemEnts[0])) {numEdgeSwap++; return;} if (edgeSwap->run(problemEnts[1])) {numEdgeSwap++; return;} - Entity* v0 = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[0]); - if (splitCollapse.run(problemEnts[0], v0)) {numEdgeSplitCollapse++; return;} - Entity* v1 = getTriVertOppositeEdge(a->mesh, problemEnts[3], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v1)) {numEdgeSplitCollapse++; return;} + Entity* faces[4]; + a->mesh->getDownward(tet, 2, faces); + for (int i=0; i<4; i++) { + if (isLowInHigh(a->mesh, faces[i], problemEnts[0])) { + Entity* v0 = getTriVertOppositeEdge(a->mesh, faces[i], problemEnts[0]); + if (splitCollapse.run(problemEnts[0], v0)) {numEdgeSplitCollapse++; return;} + } + else { + Entity* v0 = getTriVertOppositeEdge(a->mesh, faces[i], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v0)) {numEdgeSplitCollapse++; return;} + } + } if (doubleSplitCollapse.run(problemEnts)) {numDoubleSplitCollapse++; return;} } @@ -240,8 +248,8 @@ class FixShape void printNumOperations() { - print(a->mesh->getPCU(), "shape operations: collapses %d - edge swaps %d - face swaps %d - - edge split collapses %d - face split collapses %d - double split collapse %d", + print(a->mesh->getPCU(), "shape operations: collapses %d - edge swaps %d - face swaps %d - " + "edge split collapses %d - face split collapses %d - double split collapse %d", numCollapse, numEdgeSwap, numFaceSwap, numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); } @@ -276,6 +284,33 @@ class FixShape numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; } + void printBadShape(Entity* tet) + { + if (cbrt(a->shape->getQuality(tet)) > .11) return; + EntityArray bad; + bad.append(tet); + apf::writeVtkFiles("shape_mesh", a->mesh); + ma_dbg::createCavityMesh(a, bad, "shape_worst"); + + Entity* faces[4]; + a->mesh->getDownward(tet, 2, faces); + for (int f=0; f<4; f++) { + apf::Up upward; + a->mesh->getUp(faces[f], upward); + for (int u=0; umesh->begin(3); while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; + prinBadShape(tet); Entity* problemEnts[4]; if (isShortEdge(tet)) continue; @@ -293,8 +329,8 @@ class FixShape else numThreeLargeAngles++; } - print(a->mesh->getPCU(), "bad shape types: oneShortEdge %d - twoShortEdges %d - threeShortEdges %d - - moreShortEdges %d - oneLargeAngle %d - twoLargeAngle %d - threeLargeAngle %d", + print(a->mesh->getPCU(), "bad shape types: oneShortEdge %d - twoShortEdges %d - threeShortEdges %d - " + "moreShortEdges %d - oneLargeAngle %d - twoLargeAngle %d - threeLargeAngle %d", numOneShortEdge, numTwoShortEdge, numThreeShortEdge, numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); } @@ -310,7 +346,7 @@ void fixElementShapesNew(Adapt* a) int count = markBadQualityNew(a); print(a->mesh->getPCU(), "loop %d: of shape correction loop: #bad elements %d", 0, count); FixShape fixShape(a); - fixShape.printNumTypes(); + // fixShape.printNumTypes(); int originalCount = count; int prev_count; int iter = 0; From 3a55c0ba177fc366501c86000854e75a9ed64440 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 11 Sep 2025 21:39:19 -0400 Subject: [PATCH 200/319] fix typo --- ma/maShapeNew.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index eeddd328e..e95e2bc5b 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -318,7 +318,7 @@ class FixShape Iterator* it = a->mesh->begin(3); while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; - prinBadShape(tet); + printBadShape(tet); Entity* problemEnts[4]; if (isShortEdge(tet)) continue; From da99415a80a0c2b482bd75bc06995b65679626f4 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 12 Sep 2025 17:35:43 -0400 Subject: [PATCH 201/319] better formatting for copy paste --- ma/ma.cc | 1 + ma/maShapeNew.cc | 9 +++++---- 2 files changed, 6 insertions(+), 4 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 26608d7e0..2a970a54f 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -73,6 +73,7 @@ void adapt(Input* in) coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); + // fixElementShapes(a); fixElementShapesNew(a); cleanupLayer(a); tetrahedronize(a); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index e95e2bc5b..36924c47f 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -248,8 +248,8 @@ class FixShape void printNumOperations() { - print(a->mesh->getPCU(), "shape operations: collapses %d - edge swaps %d - face swaps %d - " - "edge split collapses %d - face split collapses %d - double split collapse %d", + print(a->mesh->getPCU(), "shape operations: \n collapses %10d\n edge swaps %10d\n face swaps %10d\n" + "edge split collapses %2d\n face split collapses %d\n double split collapse %d\n", numCollapse, numEdgeSwap, numFaceSwap, numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); } @@ -286,6 +286,7 @@ class FixShape void printBadShape(Entity* tet) { + return; if (cbrt(a->shape->getQuality(tet)) > .11) return; EntityArray bad; bad.append(tet); @@ -329,8 +330,8 @@ class FixShape else numThreeLargeAngles++; } - print(a->mesh->getPCU(), "bad shape types: oneShortEdge %d - twoShortEdges %d - threeShortEdges %d - " - "moreShortEdges %d - oneLargeAngle %d - twoLargeAngle %d - threeLargeAngle %d", + print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n" + "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", numOneShortEdge, numTwoShortEdge, numThreeShortEdge, numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); } From fd03ae7d518e66f62f4fa5f0cbef14a75edb717f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 13 Sep 2025 15:59:42 -0400 Subject: [PATCH 202/319] collapse 3 large angles 1 direction --- ma/maShapeNew.cc | 21 ++++++++++++++------- 1 file changed, 14 insertions(+), 7 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 36924c47f..fcf8546b7 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -214,9 +214,16 @@ class FixShape Entity* tetEdges[6]; a->mesh->getDownward(tet, 1, tetEdges); for (int i=0; i<6; i++) - if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) - if (collapseEdge(tetEdges[i])) //TODO: test collapsing in one direction either towards problemEnts[0] or away - {numCollapse++; return;} + if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) { + Entity* verts[2]; + a->mesh->getDownward(tetEdges[i], 0, verts); + Entity* keep = isLowInHigh(a->mesh, problemEnts[0], verts[0]) ? verts[0] : verts[1]; + bool alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + setFlag(a, keep, DONT_COLLAPSE); + bool success = collapseEdge(tetEdges[i]); + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + if (success) {numCollapse++; return;} + } Entity* faceEdges[3]; a->mesh->getDownward(problemEnts[0], 1, faceEdges); if (edgeSwap->run(faceEdges[0])) {numEdgeSwap++; return;} @@ -248,8 +255,8 @@ class FixShape void printNumOperations() { - print(a->mesh->getPCU(), "shape operations: \n collapses %10d\n edge swaps %10d\n face swaps %10d\n" - "edge split collapses %2d\n face split collapses %d\n double split collapse %d\n", + print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n face swaps %12d\n " + "edge split collapses %5d\n face split collapses %3d\n double split collapse %d\n", numCollapse, numEdgeSwap, numFaceSwap, numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); } @@ -330,8 +337,8 @@ class FixShape else numThreeLargeAngles++; } - print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n" - "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", + print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n " + "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", numOneShortEdge, numTwoShortEdge, numThreeShortEdge, numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); } From 7f6dac9f96d99ede372d7f0fe98d39a27b9bc3ca Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 13 Sep 2025 19:30:16 -0400 Subject: [PATCH 203/319] corrected one large angle print --- ma/maShapeNew.cc | 58 ++++++++++++++++++++++-------------------------- 1 file changed, 26 insertions(+), 32 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index fcf8546b7..2016b9a98 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -135,7 +135,7 @@ class FixShape return false; } - double getWorstTriangle(Entity* tet, Entity*& worstTriangle) + bool isOneLargeAngle(Entity* tet, Entity*& worstTriangle) { Entity* triangles[4]; a->mesh->getDownward(tet, 2, triangles); @@ -148,13 +148,13 @@ class FixShape worstTriangle = triangles[i]; } } - return worstQuality; + return worstQuality < .09; } bool fixOneLargeAngle(Entity* tet) { Entity* worstTriangle; - if (getWorstTriangle(tet, worstTriangle) >= .09) return false; + if (!isOneLargeAngle(tet, worstTriangle)) return false; Entity* edges[3]; a->mesh->getDownward(worstTriangle, 1, edges); @@ -253,6 +253,11 @@ class FixShape } } + void resetCounters() + { + numOneShortEdge=numTwoShortEdge=numThreeShortEdge=numMoreShortEdge=0; + numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; + } void printNumOperations() { print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n face swaps %12d\n " @@ -260,6 +265,13 @@ class FixShape numCollapse, numEdgeSwap, numFaceSwap, numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); } + void printBadTypes() + { + print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n " + "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", + numOneShortEdge, numTwoShortEdge, numThreeShortEdge, + numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); + } bool isShortEdge(Entity* tet) { @@ -278,23 +290,8 @@ class FixShape return true; } - bool isOneLargeAngle(Entity* tet) - { - Entity* worstTriangle; - if (getWorstTriangle(tet, worstTriangle) >= a->input->goodQuality) return false; - return true; - } - - void resetCounters() - { - numOneShortEdge=numTwoShortEdge=numThreeShortEdge=numMoreShortEdge=0; - numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; - } - void printBadShape(Entity* tet) { - return; - if (cbrt(a->shape->getQuality(tet)) > .11) return; EntityArray bad; bad.append(tet); apf::writeVtkFiles("shape_mesh", a->mesh); @@ -309,14 +306,6 @@ class FixShape bad.append(upward.e[u]); } ma_dbg::createCavityMesh(a, bad, "shape_adjacent"); - - Entity* problemEnts[4]; - if (isTwoLargeAngles(tet, problemEnts)) { - printf("TWO LARGE ANGLES\n"); - setFlag(a, problemEnts[0], CHECKED); - setFlag(a, problemEnts[1], CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "shape_edges", "shape_edges"); - } } void printNumTypes() @@ -324,23 +313,28 @@ class FixShape resetCounters(); Entity* tet; Iterator* it = a->mesh->begin(3); + double worstQual = 1; + Entity* worstShape; while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; - printBadShape(tet); + double qual = a->shape->getQuality(tet); + if (qual < worstQual) { + worstQual = qual; + worstShape = tet; + } Entity* problemEnts[4]; + Entity* worst; if (isShortEdge(tet)) continue; - else if (isOneLargeAngle(tet)) + else if (isOneLargeAngle(tet, worst)) numOneLargeAngle++; else if (isTwoLargeAngles(tet, problemEnts)) numTwoLargeAngles++; else numThreeLargeAngles++; } - print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n " - "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", - numOneShortEdge, numTwoShortEdge, numThreeShortEdge, - numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); + printBadTypes(); + printBadShape(worstShape); } }; From a876394e6d6b54acc771aa33c625748f24681952 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Tue, 16 Sep 2025 13:22:52 -0400 Subject: [PATCH 204/319] print next layer --- ma/maShapeNew.cc | 32 +++++++++++++++++++++----------- 1 file changed, 21 insertions(+), 11 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 2016b9a98..250ca0592 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -290,22 +290,32 @@ class FixShape return true; } + void addNextLayer(EntitySet& tets) + { + APF_ITERATE(ma::EntitySet,tets,it) { + Entity* faces[4]; + a->mesh->getDownward(*it, 2, faces); + for (int f=0; f<4; f++) { + apf::Up nextLayer; + a->mesh->getUp(faces[f], nextLayer); + for (int n=0; nmesh); + EntitySet bad; + bad.insert(tet); ma_dbg::createCavityMesh(a, bad, "shape_worst"); - Entity* faces[4]; - a->mesh->getDownward(tet, 2, faces); - for (int f=0; f<4; f++) { - apf::Up upward; - a->mesh->getUp(faces[f], upward); - for (int u=0; u Date: Tue, 16 Sep 2025 18:58:35 -0400 Subject: [PATCH 205/319] region collapse --- ma/maShapeNew.cc | 43 ++++++++++++++++++++++++++++++++++++++----- 1 file changed, 38 insertions(+), 5 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 250ca0592..47c2ede9f 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -69,6 +69,7 @@ class FixShape int numCollapse=0; int numEdgeSwap=0; int numFaceSwap=0; + int numRegionCollapse=0; int numEdgeSplitCollapse=0; int numFaceSplitCollapse=0; int numDoubleSplitCollapse=0; @@ -179,6 +180,37 @@ class FixShape return false; } + bool collapseRegion(Entity* tet, Entity* problemEnts[4]) + { + Mesh* mesh = a->mesh; + Entity* faces[4]; + Entity* surface[4]; + Entity* interior[4]; + mesh->getDownward(tet, 2, faces); + int s = 0, i = 0; + for (int f=0; f<4; f++) { + if (mesh->getModelType(mesh->toModel(faces[f])) == 2) + surface[s++] = faces[f]; + else interior[i++] = faces[f]; + } + if (s != 2 || i != 2) return false; + Entity* surfaceEdge = mesh->getModelType(mesh->toModel(problemEnts[0])) == 2 ? problemEnts[0] : problemEnts[1]; + if (!isLowInHigh(mesh, surface[0], surfaceEdge) || !isLowInHigh(mesh, surface[1], surfaceEdge)) + return false; + + Entity* interiorEdge = problemEnts[0] == surfaceEdge ? problemEnts[1] : problemEnts[0]; + Model* modelFace = mesh->toModel(surface[0]); + mesh->destroy(tet); + mesh->destroy(surface[0]); + mesh->destroy(surface[1]); + mesh->destroy(surfaceEdge); + + mesh->setModelEntity(interior[0], modelFace); + mesh->setModelEntity(interior[1], modelFace); + mesh->setModelEntity(interiorEdge, modelFace); + return true; + } + bool isTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) { Entity* verts[4]; @@ -192,6 +224,7 @@ class FixShape void fixTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) { + if (collapseRegion(tet, problemEnts)) {numRegionCollapse++; return;} if (edgeSwap->run(problemEnts[0])) {numEdgeSwap++; return;} if (edgeSwap->run(problemEnts[1])) {numEdgeSwap++; return;} Entity* faces[4]; @@ -260,10 +293,10 @@ class FixShape } void printNumOperations() { - print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n face swaps %12d\n " - "edge split collapses %5d\n face split collapses %3d\n double split collapse %d\n", - numCollapse, numEdgeSwap, numFaceSwap, - numEdgeSplitCollapse, numFaceSplitCollapse, numDoubleSplitCollapse); + print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n double split collapse %d\n " + "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", + numCollapse, numEdgeSwap, numDoubleSplitCollapse, + numEdgeSplitCollapse, numFaceSplitCollapse, numRegionCollapse, numFaceSwap); } void printBadTypes() { @@ -306,7 +339,7 @@ class FixShape void printBadShape(Entity* tet) { - apf::writeVtkFiles("shape_mesh", a->mesh); + // apf::writeVtkFiles("shape_mesh", a->mesh); EntitySet bad; bad.insert(tet); ma_dbg::createCavityMesh(a, bad, "shape_worst"); From 088d76898dddaf3bf6e091697cc7261021304516 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Tue, 16 Sep 2025 19:07:17 -0400 Subject: [PATCH 206/319] fixed spacing --- ma/maShapeNew.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 47c2ede9f..eafc1adbe 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -294,7 +294,7 @@ class FixShape void printNumOperations() { print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n double split collapse %d\n " - "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", + "edge split collapses %5d\n face split collapses %3d\n region collapses %8d\n face swaps %12d\n ", numCollapse, numEdgeSwap, numDoubleSplitCollapse, numEdgeSplitCollapse, numFaceSplitCollapse, numRegionCollapse, numFaceSwap); } From ab7ea9eb9adedb072aef8c4695fead0665784832 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 17 Sep 2025 21:16:22 -0400 Subject: [PATCH 207/319] split reposition --- ma/ma.cc | 1 + ma/maShapeNew.cc | 96 ++++++++++++++++++++++++++++++++++++++++-------- ma/maSplits.h | 2 +- 3 files changed, 83 insertions(+), 16 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 2a970a54f..f533d6089 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -37,6 +37,7 @@ void printHistogramData(std::string name, std::vector input, double min, inputMin = input[i]; int bin = (int)std::floor((input[i] - min)/bin_size); if (bin >= nbins) bin = nbins - 1; + if (bin < 0) bin = 0; count[bin] += 1; } diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index eafc1adbe..0fb9905df 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -60,15 +60,18 @@ class FixShape { public: Adapt* a; + Mesh* mesh; Collapse collapse; SingleSplitCollapse splitCollapse; DoubleSplitCollapse doubleSplitCollapse; FaceSplitCollapse faceSplitCollapse; EdgeSwap* edgeSwap; + Splits split; int numCollapse=0; int numEdgeSwap=0; int numFaceSwap=0; + int numSplitReposition=0; int numRegionCollapse=0; int numEdgeSplitCollapse=0; int numFaceSplitCollapse=0; @@ -82,9 +85,10 @@ class FixShape int numTwoLargeAngles=0; int numThreeLargeAngles=0; - FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt) + FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt), split(adapt) { a = adapt; + mesh = a->mesh; collapse.Init(a); edgeSwap = makeEdgeSwap(a); } @@ -136,6 +140,65 @@ class FixShape return false; } + double getWorstShape(EntityArray& tets, Entity*& worst) + { + double worstQuality = 1; + for (int i=0; isizeField->measure(tets[i]); + if (quality < worstQuality) { + worstQuality = quality; + worst = tets[i]; + } + } + return worstQuality; + } + + void repositionVertex(Entity* vert) + { + EntityArray adjacent; + mesh->getAdjacent(vert, mesh->getDimension(), adjacent); + Entity* worstShape; + Vector prevPos = getPosition(mesh, vert); + getWorstShape(adjacent, worstShape); + double speed = (prevPos - getLinearCentroid(mesh, worstShape)).getLength(); + double prevWorstQuality = 0; + for (int i=0; i<10; i++) { + double worstQuality = getWorstShape(adjacent, worstShape); + if (worstQuality > prevWorstQuality) { + prevWorstQuality = worstQuality; + prevPos = getPosition(mesh, vert); + Vector dir = (prevPos - getLinearCentroid(mesh, worstShape)).normalize(); + mesh->setPoint(vert, 0, prevPos + (dir * speed)); + speed *= 2; + } + else { + mesh->setPoint(vert, 0, prevPos); + speed /= 4; + } + } + } + + bool splitReposition(Entity* edge) + { + if (mesh->getModelType(mesh->toModel(edge)) != 3) return false; + if (!split.setEdges(&edge, 1)) + return false; + double worstQuality = getWorstQuality(a,split.getTets()); + split.makeNewElements(); + split.transfer(); + Entity* newVert = split.getSplitVert(0); + repositionVertex(newVert); + + EntityArray adjacent; + mesh->getAdjacent(newVert, mesh->getDimension(), adjacent); + if (hasWorseQuality(a,adjacent,worstQuality)) { + split.cancel(); + return false; + } + split.destroyOldElements(); + return true; + } + bool isOneLargeAngle(Entity* tet, Entity*& worstTriangle) { Entity* triangles[4]; @@ -152,13 +215,8 @@ class FixShape return worstQuality < .09; } - bool fixOneLargeAngle(Entity* tet) + Entity* getLongestEdge(Entity* edges[3]) { - Entity* worstTriangle; - if (!isOneLargeAngle(tet, worstTriangle)) return false; - - Entity* edges[3]; - a->mesh->getDownward(worstTriangle, 1, edges); double longestLength = a->sizeField->measure(edges[0]); Entity* longestEdge = edges[0]; for (int i=1; i<3; i++) { @@ -168,12 +226,19 @@ class FixShape longestEdge = edges[i]; } } + return longestEdge; + } + bool fixOneLargeAngle(Entity* tet) + { + Entity* worstTriangle; + if (!isOneLargeAngle(tet, worstTriangle)) return false; + Entity* edges[3]; + a->mesh->getDownward(worstTriangle, 1, edges); + Entity* longestEdge = getLongestEdge(edges); Entity* oppositeVert = getTriVertOppositeEdge(a->mesh, worstTriangle, longestEdge); - if (edgeSwap->run(longestEdge)) - {numEdgeSwap++; return true;} - if (splitCollapse.run(longestEdge, oppositeVert)) - {numEdgeSplitCollapse++; return true;} + if (edgeSwap->run(longestEdge)) {numEdgeSwap++; return true;} + if (splitCollapse.run(longestEdge, oppositeVert)) {numEdgeSplitCollapse++; return true;} for (int i=0; i<3; i++) if (edges[i] != longestEdge && collapseEdge(edges[i])) {numCollapse++; return true;} @@ -182,7 +247,6 @@ class FixShape bool collapseRegion(Entity* tet, Entity* problemEnts[4]) { - Mesh* mesh = a->mesh; Entity* faces[4]; Entity* surface[4]; Entity* interior[4]; @@ -227,6 +291,8 @@ class FixShape if (collapseRegion(tet, problemEnts)) {numRegionCollapse++; return;} if (edgeSwap->run(problemEnts[0])) {numEdgeSwap++; return;} if (edgeSwap->run(problemEnts[1])) {numEdgeSwap++; return;} + if (splitReposition(problemEnts[0])) {numSplitReposition++; return;} + if (splitReposition(problemEnts[1])) {numSplitReposition++; return;} Entity* faces[4]; a->mesh->getDownward(tet, 2, faces); for (int i=0; i<4; i++) { @@ -293,9 +359,9 @@ class FixShape } void printNumOperations() { - print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n double split collapse %d\n " - "edge split collapses %5d\n face split collapses %3d\n region collapses %8d\n face swaps %12d\n ", - numCollapse, numEdgeSwap, numDoubleSplitCollapse, + print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n split reposition %9d\n double split collapse %d\n " + "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", + numCollapse, numEdgeSwap, numSplitReposition, numDoubleSplitCollapse, numEdgeSplitCollapse, numFaceSplitCollapse, numRegionCollapse, numFaceSwap); } void printBadTypes() diff --git a/ma/maSplits.h b/ma/maSplits.h index 22b4e1aab..36e5ab70f 100644 --- a/ma/maSplits.h +++ b/ma/maSplits.h @@ -26,8 +26,8 @@ class Splits Entity* getSplitVert(int i); EntityArray& getTets() {return refiner->toSplit[3];} Adapt* getAdapt() {return refiner->adapt;} - private: Refine* refiner; + private: }; } From f4e81b8682245a44700a42891eabb361514bcabd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 25 Sep 2025 13:22:23 -0400 Subject: [PATCH 208/319] print adjacent --- ma/maShapeNew.cc | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 0fb9905df..f2d61e490 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -389,8 +389,9 @@ class FixShape return true; } - void addNextLayer(EntitySet& tets) + EntitySet addNextLayer(EntitySet& tets) { + EntitySet adjacent; APF_ITERATE(ma::EntitySet,tets,it) { Entity* faces[4]; a->mesh->getDownward(*it, 2, faces); @@ -398,9 +399,10 @@ class FixShape apf::Up nextLayer; a->mesh->getUp(faces[f], nextLayer); for (int n=0; n Date: Thu, 25 Sep 2025 17:15:19 -0400 Subject: [PATCH 209/319] fixed error collapsing model edge --- ma/maShapeNew.cc | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index f2d61e490..a6545a6d0 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -258,11 +258,12 @@ class FixShape else interior[i++] = faces[f]; } if (s != 2 || i != 2) return false; - Entity* surfaceEdge = mesh->getModelType(mesh->toModel(problemEnts[0])) == 2 ? problemEnts[0] : problemEnts[1]; + Entity* interiorEdge = mesh->getModelType(mesh->toModel(problemEnts[0])) == 3 ? problemEnts[0] : problemEnts[1]; + Entity* surfaceEdge = problemEnts[0] == interiorEdge ? problemEnts[1] : problemEnts[0]; + if (mesh->getModelType(mesh->toModel(surfaceEdge)) == 1) + return false; if (!isLowInHigh(mesh, surface[0], surfaceEdge) || !isLowInHigh(mesh, surface[1], surfaceEdge)) return false; - - Entity* interiorEdge = problemEnts[0] == surfaceEdge ? problemEnts[1] : problemEnts[0]; Model* modelFace = mesh->toModel(surface[0]); mesh->destroy(tet); mesh->destroy(surface[0]); @@ -407,7 +408,7 @@ class FixShape void printBadShape(Entity* tet) { - // apf::writeVtkFiles("shape_mesh", a->mesh); + apf::writeVtkFiles("shape_mesh", a->mesh); EntitySet bad; bad.insert(tet); ma_dbg::createCavityMesh(a, bad, "shape_worst"); From 9f9d333181ba6f39ee58fb323a7cfa00e1f0586c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 14:44:31 -0400 Subject: [PATCH 210/319] fixed snapper issue --- ma/maSnapper.cc | 20 ++++---------------- 1 file changed, 4 insertions(+), 16 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 0eb2a9d31..47861770d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -581,10 +581,9 @@ static bool didInvert(Mesh* m, Vector& oldNormal, Entity* tri) return (oldNormal * getTriNormal(m, tri)) < 0; } -static void getInvalid(Adapt* a, Upward& adjacentElements, apf::NewArray& normals, apf::Up& invalid) +static void getInvalid(Adapt* a, Upward& adjacentElements, apf::Up& invalid) { invalid.n = 0; - Vector v[4]; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { /* for now, when snapping a vertex on the boundary layer, ignore the quality of layer elements. @@ -592,16 +591,8 @@ static void getInvalid(Adapt* a, Upward& adjacentElements, apf::NewArray algorithm that moves curves would need to change */ if (getFlag(a, adjacentElements[i], LAYER)) continue; - - if ((a->mesh->getDimension() == 2)) { - if (didInvert(a->mesh, normals[i], adjacentElements[i])) - invalid.e[invalid.n++] = adjacentElements[i]; - } - else{ - ma::getVertPoints(a->mesh,adjacentElements[i],v); - if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) - invalid.e[invalid.n++] = adjacentElements[i]; - } + if (a->shape->getQuality(adjacentElements[i]) < a->input->validQuality) + invalid.e[invalid.n++] = adjacentElements[i]; } } @@ -616,11 +607,8 @@ static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& i Upward adjacentElements; mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - apf::NewArray normals; - computeNormals(mesh, adjacentElements, normals); - mesh->setPoint(vertex, 0, target); - getInvalid(adapt, adjacentElements, normals, invalid); + getInvalid(adapt, adjacentElements, invalid); if (invalid.n == 0) return true; mesh->setPoint(vertex, 0, prev); return false; From 63c223deb7f0ec8a9d3576395472e7df47d0ccce Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 16:14:07 -0400 Subject: [PATCH 211/319] fixed cap test --- ma/maSnapper.cc | 27 ++++++++------------------- 1 file changed, 8 insertions(+), 19 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 47861770d..7828a3129 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -567,20 +567,6 @@ static FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up return FPP; } -static void computeNormals(Mesh* m, Upward& es, apf::NewArray& normals) -{ - if (m->getDimension() != 2) - return; - normals.allocate(es.getSize()); - for (size_t i = 0; i < es.getSize(); ++i) - normals[i] = getTriNormal(m, es[i]); -} - -static bool didInvert(Mesh* m, Vector& oldNormal, Entity* tri) -{ - return (oldNormal * getTriNormal(m, tri)) < 0; -} - static void getInvalid(Adapt* a, Upward& adjacentElements, apf::Up& invalid) { invalid.n = 0; @@ -640,11 +626,14 @@ bool Snapper::run() return true; } - FirstProblemPlane* FPP = getFPP(adapt, vert, snapTag, invalid); - if (!success) success = tryCollapseToVertex(FPP); - if (!success) success = tryReduceCommonEdges(FPP); - if (!success) success = tryCollapseTetEdges(FPP); - if (!success) success = trySwapOrSplit(FPP); + FirstProblemPlane* FPP=0; + if (mesh->getDimension() == 3) { + if (!success) FPP = getFPP(adapt, vert, snapTag, invalid); + if (!success) success = tryCollapseToVertex(FPP); + if (!success) success = tryReduceCommonEdges(FPP); + if (!success) success = tryCollapseTetEdges(FPP); + if (!success) success = trySwapOrSplit(FPP); + } if (!success) { numFailed++; From eddc01342558491c642f668a41e082b76a98dd78 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 16:53:49 -0400 Subject: [PATCH 212/319] removed unused adapt tests --- ma/maSnap.cc | 2 +- test/aniso_adapt.cc | 5 ----- test/aniso_adapt.h | 24 +++++++++++++----------- test/aniso_adapt_cap.cc | 24 ------------------------ test/aniso_adapt_sim.cc | 18 ------------------ 5 files changed, 14 insertions(+), 59 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index bc0c5ae0b..733cce5d7 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -135,7 +135,7 @@ static double interpolateParametricCoordinate( } double period = range[1]-range[0]; double span = b-a; - if (period < 0.5) //partial range can't be periodic + if (period < 0.5) //meshes in capstone can have partial ranges that aren't periodic return (1-t)*a + t*b; if (!mode) { if (span < (period/2)) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index 6e1eb334d..7bbd9c6cb 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -1,11 +1,6 @@ -#include "ma.h" #include #include #include -#include -#include -#include -#include #include "aniso_adapt.h" ma::Mesh* createMesh(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 51f21e575..9d549f670 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -1,19 +1,19 @@ -#include -#include -#include +#ifndef TEST_ANISO_ADAPT_H +#define TEST_ANISO_ADAPT_H +#include #include #include #include #include #include #include -#include "maCoarsen.h" -#include "maAdapt.h" -#include "maRefine.h" -#include "maShape.h" -#include "maSnap.h" -#include "apfGeometry.h" +#include +#include +#include +#include +#include +#include #include /* Test some of the individual components in mesh adaptation to make sure that they are @@ -54,7 +54,7 @@ void measureQuality(ma::Mesh* m, double& avgQuality, double& minQuality) while ((elem = m->iterate(it))) { double q = ma::measureElementQuality(m, &I, elem); avgQuality += q; - minQuality = fmin(minQuality, q); + minQuality = std::min(minQuality, q); } m->end(it); avgQuality = avgQuality / m->count(d); @@ -228,4 +228,6 @@ void adaptTests(const std::function& createMesh) apf::destroyMesh(meshReg); meshForce->destroyNative(); apf::destroyMesh(meshForce); -} \ No newline at end of file +} + +#endif \ No newline at end of file diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 82f4628e7..73e7e1a0d 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -1,31 +1,7 @@ #include #include -#include -#include -#include -#include -#include #include #include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include "maAdapt.h" -#include "maCoarsen.h" -#include "maRefine.h" -#include "maSnap.h" -#include "lionPrint.h" #include "aniso_adapt.h" ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 32881f641..89de5dce9 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -1,27 +1,9 @@ -#include -#include -#include - -#include -#include -#include -#include -#include -#include #include "aniso_adapt.h" - #include #include -#include #include #include -#include - -#include "SimParasolidKrnl.h" -#include "MeshSimAdapt.h" -#include "SimDiscrete.h" #include "SimAdvMeshing.h" -#include "SimMeshTools.h" ma::Mesh* createMesh(const char* nativefile, const char* smdfile, const char* smsfile, pcu::PCU* PCUObj) { From 1a72cf846cae73c35d1de231e8628d9ad6cfa2e5 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 17:06:31 -0400 Subject: [PATCH 213/319] moved code maCoarsen --- ma/CMakeLists.txt | 2 +- ma/maCoarsen.cc | 120 ++++++++++++++++++++++------------------------ 2 files changed, 58 insertions(+), 64 deletions(-) diff --git a/ma/CMakeLists.txt b/ma/CMakeLists.txt index 45a217fd0..e54b59b38 100644 --- a/ma/CMakeLists.txt +++ b/ma/CMakeLists.txt @@ -86,7 +86,7 @@ target_link_libraries(ma ) if (ENABLE_CAPSTONE) -target_link_libraries(ma PUBLIC apf_cap) +target_link_libraries(ma PRIVATE apf_cap) endif() scorec_export_library(ma) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index cde1151ee..719ee502b 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -29,6 +29,58 @@ This file contains two coarsening alogrithms. namespace ma { +namespace { + +//Measures edge length and stores the result so it doesn't have to be calculated again +double getLength(Adapt* a, Tag* lengthTag, Entity* edge) +{ + double length = 0; + if (a->mesh->hasTag(edge, lengthTag)) + a->mesh->getDoubleTag(edge, lengthTag, &length); + else { + length = a->sizeField->measure(edge); + a->mesh->setDoubleTag(edge, lengthTag, &length); + } + return length; +} + +//Make sure that a collapse will not create an edge longer than the max +bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent) +{ + Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vertex); + for (int i=0; imesh, adjacent.e[i], vCollapse)}; + Entity* newEdge = a->mesh->createEntity(apf::Mesh::EDGE, 0, newEdgeVerts); + double length = a->sizeField->measure(newEdge); + destroyElement(a, newEdge); + if (length > MAXLENGTH) return false; + } + return true; +} + +bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + + double quality = a->input->shouldForceAdaptation ? a->input->validQuality + : a->input->goodQuality; + + bool result = false; + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapseSizeCheck(a, keep, edge, adjacent) && + collapse.tryBothDirections(quality)) { + result = true; + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + return result; +} +} + class CollapseChecker : public apf::CavityOp { public: @@ -266,61 +318,10 @@ bool coarsen(Adapt* a) return true; } -//Measure and edge lenght and stores the result so it doesn't have to be calculated again -static double getLength(Adapt* a, Tag* lengthTag, Entity* edge) -{ - double length = 0; - length = a->sizeField->measure(edge); - if (a->mesh->hasTag(edge, lengthTag)) - a->mesh->getDoubleTag(edge, lengthTag, &length); - else { - length = a->sizeField->measure(edge); - a->mesh->setDoubleTag(edge, lengthTag, &length); - } - return length; - -} - -//Make sure that a collapse will not create an edge longer than the max -bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent) -{ - Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vertex); - for (int i=0; imesh, adjacent.e[i], vCollapse)}; - Entity* newEdge = a->mesh->createEntity(apf::Mesh::EDGE, 0, newEdgeVerts); - double length = a->sizeField->measure(newEdge); - destroyElement(a, newEdge); - if (length > MAXLENGTH) return false; - } - return true; -} - -static bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) -{ - PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - bool alreadyFlagged = true; - if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); - if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); - - double quality = a->input->shouldForceAdaptation ? a->input->validQuality - : a->input->goodQuality; - - bool result = false; - if (collapse.setEdge(edge) && - collapse.checkClass() && - collapse.checkTopo() && - collapseSizeCheck(a, keep, edge, adjacent) && - collapse.tryBothDirections(quality)) { - result = true; - } - if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); - return result; -} - /* - Used after collpasing a vertex to flag adjacent vertices NEED_NOT_COLLAPSE, will create a - set of collapses were no two adjacent vertices collapsed called an independent set. Will - also clear adjacent vertices for collapse in next independent set since they might succeed now. + To be used after collapsing a vertex to flag adjacent vertices as NEED_NOT_COLLAPSE. This will create a + set of collapses where no two adjacent are vertices collapsed. Will also clear adjacent vertices for + collapse in next independent set since they might succeed after a collapse. */ void flagIndependentSet(Adapt* a, apf::Up& adjacent, size_t& checked) { @@ -379,13 +380,6 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg return false; } -void clearListFlag(Adapt* a, std::list list, int flag) -{ - auto i = list.begin(); - while (i != list.end()) - clearFlag(a, *i++, flag); -} - /* Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an independent set. We want our collapses to touch the independent set in order to @@ -410,7 +404,7 @@ bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::lis } itr++; } while (numItr < shortEdgeVerts.size()); - clearListFlag(a, shortEdgeVerts, NEED_NOT_COLLAPSE); + for (auto v : shortEdgeVerts) clearFlag(a, v, NEED_NOT_COLLAPSE); independentSetStarted = false; return false; } @@ -433,7 +427,7 @@ std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) shortEdgeVerts.push_back(vertices[i]); } } - clearListFlag(a, shortEdgeVerts, CHECKED); + for (auto v : shortEdgeVerts) clearFlag(a, v, CHECKED); a->mesh->end(it); return shortEdgeVerts; } From 03119fe6d70ff4d89591e3dd2876f13dfe6f8aac Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 17:38:45 -0400 Subject: [PATCH 214/319] reformating --- ma/maCollapse.cc | 2 +- ma/maSize.h | 1 + ma/maSnap.cc | 8 ++++++-- ma/maSnapper.cc | 16 ++++++++-------- test/aniso_adapt_cap.cc | 2 -- 5 files changed, 16 insertions(+), 13 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index f966fa37d..af13ba324 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -79,7 +79,7 @@ bool Collapse::edgesGoodSize() { } } } - if (maxSize > MAXLENGTH && ratioAtMaxSize > 1.2 ) return false; + if (maxSize > MAXLENGTH && ratioAtMaxSize > MAXLENGTHRATIO) return false; return true; } diff --git a/ma/maSize.h b/ma/maSize.h index 83cd2b7e8..e8f9b6058 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -25,6 +25,7 @@ modify these in addition to desired length. Future testing in need because Li's thesis describes there might be utility to having the user modify them */ const double MAXLENGTH = 1.5; const double MINLENGTH = .5; +const double MAXLENGTHRATIO = 1.2; class SizeField { diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 733cce5d7..025dceb1b 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -919,8 +919,12 @@ void snap(Adapt* a) snapLayer(a, snapTag); double t1 = pcu::Time(); - print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d - Collapse %d - Swap %d - SplitCollapse %d - completed in %f seconds", - toSnap, collect(a,snapper.numSnapped), collect(a,snapper.numFailed), collect(a,snapper.numCollapseToVtx), collect(a,snapper.numCollapse), collect(a,snapper.numSwap), collect(a,snapper.numSplitCollapse), t1 - t0); + print(a->mesh->getPCU(), "ToSnap %d - Moved %d - Failed %d - CollapseToVtx %d" + " - Collapse %d - Swap %d - SplitCollapse %d" + " - completed in %f seconds", + toSnap, collect(a,snapper.numSnapped), collect(a,snapper.numFailed), + collect(a,snapper.numCollapseToVtx), collect(a,snapper.numCollapse), + collect(a,snapper.numSwap), collect(a,snapper.numSplitCollapse), t1 - t0); if (a->hasLayer) checkLayerShape(a->mesh, "after snapping"); } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 7828a3129..b592dddcb 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -713,16 +713,16 @@ bool FirstProblemPlane::find() lion_oprint(1, "Info: Found Infinitely Many Intersection Points!\n"); Vector newDirection = intersect - ray.start; if (newDirection.getLength() < minDist) { - dists.push_back(newDirection.getLength()); - minDist = dists.back(); - problemFace = face; - problemRegion = elem; - intersection = intersect; - // do not need to check whether the move is valid since the valid - // ones should have been taken care of by this point + dists.push_back(newDirection.getLength()); + minDist = dists.back(); + problemFace = face; + problemRegion = elem; + intersection = intersect; + // do not need to check whether the move is valid since the valid + // ones should have been taken care of by this point } else - dists.push_back(newDirection.getLength()); + dists.push_back(newDirection.getLength()); } } diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 73e7e1a0d..246fd403e 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -1,7 +1,6 @@ #include #include #include -#include #include "aniso_adapt.h" ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) @@ -30,7 +29,6 @@ int main(int argc, char** argv) } gmi_register_mesh(); - gmi_register_null(); gmi_cap_start(); gmi_register_cap(); lion_set_verbosity(1); From 1d928d983b26a0945cc36e58df94f62e7e640027 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 17:51:19 -0400 Subject: [PATCH 215/319] removed unecessary apf::up --- ma/maSnapper.cc | 55 +++++++++++++++++++++---------------------------- ma/maSnapper.h | 4 ++-- 2 files changed, 26 insertions(+), 33 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b592dddcb..7a62596bc 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -451,18 +451,18 @@ static bool sameSide(Adapt* a, Entity* testVert, Entity* refVert, Entity* face) */ bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) { - apf::Up& commEdges = FPP->commEdges; + std::vector& commEdges = FPP->commEdges; BestCollapse best; - for (int i=0; igetDownward(commEdges.e[i], 0, vertex); + mesh->getDownward(commEdges[i], 0, vertex); for (int j=0; j<2; j++) - getBestQualityCollapse(adapt, commEdges.e[i], vertex[j], collapse, best); + getBestQualityCollapse(adapt, commEdges[i], vertex[j], collapse, best); } - for (int i=0; igetUp(vertexFPP, adjEdges); @@ -490,15 +490,15 @@ bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) */ bool Snapper::tryReduceCommonEdges(FirstProblemPlane* FPP) { - apf::Up& commEdges = FPP->commEdges; + std::vector& commEdges = FPP->commEdges; BestCollapse best; Entity* pbEdges[3]; mesh->getDownward(FPP->problemFace, 1, pbEdges); - switch(commEdges.n) { + switch(commEdges.size()) { case 2: { - Entity* v1 = getEdgeVertOppositeVert(mesh, commEdges.e[0], vert); - Entity* v2 = getEdgeVertOppositeVert(mesh, commEdges.e[1], vert); + Entity* v1 = getEdgeVertOppositeVert(mesh, commEdges[0], vert); + Entity* v2 = getEdgeVertOppositeVert(mesh, commEdges[1], vert); for (int i=0; i<3; i++) { Entity* pbVert[2]; @@ -541,8 +541,8 @@ bool Snapper::tryCollapseToVertex(FirstProblemPlane* FPP) BestCollapse best; - for (int i = 0; i < FPP->commEdges.n; ++i) { - Entity* edge = FPP->commEdges.e[i]; + for (int i = 0; i < FPP->commEdges.size(); ++i) { + Entity* edge = FPP->commEdges[i]; Entity* vertexOnFPP = getEdgeVertOppositeVert(mesh, edge, vert); Vector vFPPCoord = getPosition(mesh, vertexOnFPP); double distToFPPVert = (vFPPCoord - target).getLength(); @@ -653,7 +653,7 @@ FirstProblemPlane::FirstProblemPlane(Adapt* a, Tag* st) snapTag = st; problemFace = 0; problemRegion = 0; - commEdges.n = 0; + commEdges.clear(); tol = 1.0e-14; } @@ -664,9 +664,8 @@ void FirstProblemPlane::setVertex(Entity* v) void FirstProblemPlane::setBadElements(apf::Up& badElements) { - problemRegions.n = badElements.n; for (int i = 0; i < badElements.n; i++) { - problemRegions.e[i] = badElements.e[i]; + problemRegions.push_back(badElements.e[i]); } } @@ -686,8 +685,7 @@ bool FirstProblemPlane::find() // determine distances to all possible problem faces, the shortest // distance and its intersection on first problem plane (FPP) - int n; - n = problemRegions.n; + int n = problemRegions.size(); Entity* elem; Entity* face; Ray ray; @@ -699,7 +697,7 @@ bool FirstProblemPlane::find() dists.clear(); for (int i = 0; i < n; i++) { - elem = problemRegions.e[i]; + elem = problemRegions[i]; face = getTetFaceOppositeVert(mesh, elem, vert); std::vector coords; getFaceCoords(mesh, face, coords); @@ -731,18 +729,18 @@ bool FirstProblemPlane::find() coplanarProblemRegions.n = 0; if (!problemRegion) { - problemRegion = problemRegions.e[0]; + problemRegion = problemRegions[0]; problemFace = getTetFaceOppositeVert(mesh, problemRegion, vert); coplanarProblemRegions.n = n; for (int i = 0; i < n; i++) { - coplanarProblemRegions.e[i] = problemRegions.e[i]; + coplanarProblemRegions.e[i] = problemRegions[i]; } } else { minDist += tol; for (int i = 0; i < n; i++) { if (dists[i] < minDist) { - coplanarProblemRegions.e[coplanarProblemRegions.n] = problemRegions.e[i]; + coplanarProblemRegions.e[coplanarProblemRegions.n] = problemRegions[i]; coplanarProblemRegions.n++; } } @@ -769,8 +767,8 @@ void FirstProblemPlane::findCandidateEdges(std::vector &edges) Entity* edge; Entity* v; - for (int i = 0; i < commEdges.n; i++) { - edge = commEdges.e[i]; + for (int i = 0; i < commEdges.size(); i++) { + edge = commEdges[i]; Downward dv; mesh->getDownward(edge, 0, dv); (dv[0] == vert) ? v = dv[1] : v = dv[0]; @@ -844,10 +842,8 @@ void FirstProblemPlane::findCommonEdges(apf::Up& cpRegions) Downward edges; int nDownEdges = mesh->getDownward(cpRegions.e[0], 1, edges); for (int i = 0; i < nDownEdges; i++) { - if (isLowInHigh(mesh, edges[i], vert)) { - commEdges.e[commEdges.n] = edges[i]; - commEdges.n++; - } + if (isLowInHigh(mesh, edges[i], vert)) + commEdges.push_back(edges[i]); } return; } @@ -887,10 +883,7 @@ void FirstProblemPlane::findCommonEdges(apf::Up& cpRegions) break; } } - if (flag) { - commEdges.e[commEdges.n] = edges[i]; - commEdges.n++; - } + if (flag) commEdges.push_back(edges[i]); } } } diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 88034346b..8aa17f5da 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -74,8 +74,8 @@ class FirstProblemPlane void getCandidateEdges(std::vector &edges); Entity* vert; Entity* problemFace; - apf::Up commEdges; - apf::Up problemRegions; + std::vector commEdges; + std::vector problemRegions; Entity* problemRegion; Tag* snapTag; private: From 905f74be41c3a974b0bced9e9fd0ee368bfe4bd8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 17:55:37 -0400 Subject: [PATCH 216/319] using size_t --- ma/maSnapper.cc | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 7a62596bc..46ceebecc 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -454,14 +454,14 @@ bool Snapper::tryCollapseTetEdges(FirstProblemPlane* FPP) std::vector& commEdges = FPP->commEdges; BestCollapse best; - for (int i=0; igetDownward(commEdges[i], 0, vertex); for (int j=0; j<2; j++) getBestQualityCollapse(adapt, commEdges[i], vertex[j], collapse, best); } - for (int i=0; icommEdges.size(); ++i) { + for (size_t i = 0; i < FPP->commEdges.size(); ++i) { Entity* edge = FPP->commEdges[i]; Entity* vertexOnFPP = getEdgeVertOppositeVert(mesh, edge, vert); Vector vFPPCoord = getPosition(mesh, vertexOnFPP); @@ -685,7 +685,7 @@ bool FirstProblemPlane::find() // determine distances to all possible problem faces, the shortest // distance and its intersection on first problem plane (FPP) - int n = problemRegions.size(); + size_t n = problemRegions.size(); Entity* elem; Entity* face; Ray ray; @@ -696,7 +696,7 @@ bool FirstProblemPlane::find() ray.dir = target - ray.start; dists.clear(); - for (int i = 0; i < n; i++) { + for (size_t i = 0; i < n; i++) { elem = problemRegions[i]; face = getTetFaceOppositeVert(mesh, elem, vert); std::vector coords; @@ -767,7 +767,7 @@ void FirstProblemPlane::findCandidateEdges(std::vector &edges) Entity* edge; Entity* v; - for (int i = 0; i < commEdges.size(); i++) { + for (size_t i = 0; i < commEdges.size(); i++) { edge = commEdges[i]; Downward dv; mesh->getDownward(edge, 0, dv); From 9c0fba7e34af8cd8a2187aa7ab2cd810522e671f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 18:10:38 -0400 Subject: [PATCH 217/319] int to size_t --- ma/maSnapper.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 46ceebecc..1b3233544 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -732,13 +732,13 @@ bool FirstProblemPlane::find() problemRegion = problemRegions[0]; problemFace = getTetFaceOppositeVert(mesh, problemRegion, vert); coplanarProblemRegions.n = n; - for (int i = 0; i < n; i++) { + for (size_t i = 0; i < n; i++) { coplanarProblemRegions.e[i] = problemRegions[i]; } } else { minDist += tol; - for (int i = 0; i < n; i++) { + for (size_t i = 0; i < n; i++) { if (dists[i] < minDist) { coplanarProblemRegions.e[coplanarProblemRegions.n] = problemRegions[i]; coplanarProblemRegions.n++; From 41ec12215615e0a5c82446bfd863ec14f2fe0bbd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 19:15:39 -0400 Subject: [PATCH 218/319] simplify code --- ma/maCoarsen.cc | 5 +++-- ma/maSnapper.cc | 42 ++++++++++++++++++------------------------ 2 files changed, 21 insertions(+), 26 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 719ee502b..9baa67130 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -26,6 +26,7 @@ This file contains two coarsening alogrithms. #include "apfShape.h" #include #include +#include namespace ma { @@ -360,13 +361,13 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg double length = getLength(a, lengthTag, adjacent.e[i]); EdgeLength measured{adjacent.e[i], length}; if (measured.length > MINLENGTH) continue; - auto pos = std::lower_bound(sorted.begin(), sorted.end(), measured); - sorted.insert(pos, measured); + sorted.push_back(measured); } if (sorted.size() == 0) { //performance optimization, will rarely result in a missed edge itr = shortEdgeVerts.erase(itr); return false; } + std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 1b3233544..4fe1ea34d 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -7,11 +7,13 @@ of the SCOREC Non-Commercial License this program is distributed under. *******************************************************************************/ -/* - This file contains functions to move a point to the model surface. As described - in Li's thesis it will first try to collapse in the target direction. Otherwise - it will collapse to simplify the region and attempt other operators such as - swap, split collapse, double split collapse. +/** + * \file maSnapper.cc + * \brief Definition of maSnapper.h file. + * This file contains functions to move a point to the model surface. As described + * in Li's thesis it will first try to collapse in the target direction. Otherwise + * it will collapse to simplify the region and attempt other operators such as + * swap, split collapse, double split collapse. */ #include "maSnapper.h" #include "maAdapt.h" @@ -102,29 +104,23 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) } #endif +//returns the greater index in the case of equality static int indexOfMin(double a0, double a1, double a2) { - int k; - double buf; - if( a0mesh->getDownward(face, 0, faceVert); - Vector facePos[3]; - for (int i=0; i < 3; ++i) - facePos[i] = getPosition(a->mesh,faceVert[i]); - - Vector normal = apf::cross((facePos[1]-facePos[0]),(facePos[2]-facePos[0])); double magN = normal*normal; Vector vertPos = getPosition(a->mesh, vert); - double magCP = (vertPos-facePos[0]) * normal; + double magCP = (vertPos-v0) * normal; double ratio=magCP/magN; Vector result; @@ -182,14 +178,12 @@ int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* en } } - Vector projection = projOnTriPlane(a, face, vert); - //TODO: ERROR if projection = any point on problem face - /* find normal to the plane */ Vector v01 = facePos[1] - facePos[0]; Vector v02 = facePos[2] - facePos[0]; Vector norm = apf::cross(v01, v02); + Vector projection = projOnTriPlane(a, face, vert, norm, facePos[0]); Vector ri = projection - facePos[0]; Vector rj = projection - facePos[1]; Vector rk = projection - facePos[2]; From 6894ffc5c4b2cf1314dd17f60accf2114eadc67f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 22:18:07 -0400 Subject: [PATCH 219/319] fixed error with isCapstone --- gmi_cap/gmi_cap.cc | 8 ++++---- gmi_cap/gmi_cap.h | 14 +++++++++----- ma/maSnap.cc | 13 ++++++------- ma/maSnapper.cc | 4 ++-- 4 files changed, 21 insertions(+), 18 deletions(-) diff --git a/gmi_cap/gmi_cap.cc b/gmi_cap/gmi_cap.cc index 17eb50491..ab1b697e0 100644 --- a/gmi_cap/gmi_cap.cc +++ b/gmi_cap/gmi_cap.cc @@ -41,10 +41,6 @@ void gmi_cap_start(void) { } } -bool is_gmi_cap_started() { - return cs_module->get_context() && cs_module->get_geometry() && cs_module->get_mesh(); -} - void gmi_cap_stop(void) { if (!cs_module) gmi_fail("gmi_cap_stop called before gmi_cap_start"); @@ -545,3 +541,7 @@ GDBI* gmi_export_cap(gmi_model* m) cap_model* cm = (cap_model*)m; return cm->geomInterface; } + +int gmi_cap_test(struct gmi_model* model) { + return model->ops == &ops ? 1 : 0; +} diff --git a/gmi_cap/gmi_cap.h b/gmi_cap/gmi_cap.h index beadebac4..fcf9e31e2 100644 --- a/gmi_cap/gmi_cap.h +++ b/gmi_cap/gmi_cap.h @@ -58,11 +58,6 @@ struct gmi_ent; */ void gmi_cap_start(void); -/** - * \brief Returns true if gmi_cap library has been initialized with gmi_cap_start - */ -bool is_gmi_cap_started(); - /** * \brief Finalize gmi_cap library. * @@ -100,6 +95,15 @@ struct gmi_model* gmi_cap_load(const char* creFileName); */ void gmi_cap_write(struct gmi_model* model, const char* creFileName); +/** + * \brief Test if model is a Capstone gmi_model. + * + * \param model An abstract gmi_model which may have an underlying Capstone + * database. + * \return 1 if model is a Capstone gmi_model and 0 otherwise. + */ +int gmi_cap_test(struct gmi_model* model); + #ifdef __cplusplus /** diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 025dceb1b..9271d4448 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -30,10 +30,9 @@ namespace ma { -static bool isCapstone() -{ +static bool isCapstone(apf::Mesh* m) { #ifdef PUMI_HAS_CAPSTONE - return is_gmi_cap_started(); + return gmi_cap_test(m->getModel()); #else return false; #endif @@ -84,7 +83,7 @@ static size_t isSurfUnderlyingFaceDegenerate( m->getFirstDerivative(g, p, uTan, vTan); double uTanSize = uTan.getLength(); double vTanSize = vTan.getLength(); - if (isCapstone()) { + if (isCapstone(m)) { uTanSize = uTan * uTan; vTanSize = vTan * vTan; } @@ -168,7 +167,7 @@ static void interpolateParametricCoordinateOnEdge( p[1] = 0.0; p[2] = 0.0; - if (isCapstone()) { + if (isCapstone(m)) { // account for non-uniform parameterization of model-edge Vector X[3]; Vector para[2] = {a, b}; @@ -509,7 +508,7 @@ static void interpolateParametricCoordinatesOnRegularFace( * 2) we only check for faces that are periodic */ // this need to be done for faces, only - if (isCapstone()) + if (isCapstone(m)) return; if (dim != 2) return; @@ -541,7 +540,7 @@ static void interpolateParametricCoordinatesOnFace( size_t num = isSurfUnderlyingFaceDegenerate(m, g, axes, vals); if (num > 0) { // the underlying surface is degenerate - if (!isCapstone()) { + if (!isCapstone(m)) { interpolateParametricCoordinatesOnDegenerateFace(m, g, t, a, b, axes, vals, p); } else { diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 4fe1ea34d..6a4558ba8 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -116,7 +116,7 @@ static int indexOfMin(double a0, double a1, double a2) } } -static Vector projOnTriPlane(Adapt* a, Entity* face, Entity* vert, Vector normal, Vector v0) +static Vector projOnTriPlane(Adapt* a, Entity* vert, Vector normal, Vector v0) { double magN = normal*normal; Vector vertPos = getPosition(a->mesh, vert); @@ -183,7 +183,7 @@ int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* en Vector v02 = facePos[2] - facePos[0]; Vector norm = apf::cross(v01, v02); - Vector projection = projOnTriPlane(a, face, vert, norm, facePos[0]); + Vector projection = projOnTriPlane(a, vert, norm, facePos[0]); Vector ri = projection - facePos[0]; Vector rj = projection - facePos[1]; Vector rk = projection - facePos[2]; From 47ed51a10a2a2a57b3d7f6c2627ef314cfa652cd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 22:31:20 -0400 Subject: [PATCH 220/319] reuse and recycle adapt_sim --- ma/maSnap.cc | 1 + test/aniso_adapt.h | 2 -- test/aniso_adapt_sim.cc | 31 +++++++++++++++++-------------- 3 files changed, 18 insertions(+), 16 deletions(-) diff --git a/ma/maSnap.cc b/ma/maSnap.cc index 9271d4448..fef9a28de 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -34,6 +34,7 @@ static bool isCapstone(apf::Mesh* m) { #ifdef PUMI_HAS_CAPSTONE return gmi_cap_test(m->getModel()); #else + (void) m; return false; #endif } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 9d549f670..9beaab9d5 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -226,8 +226,6 @@ void adaptTests(const std::function& createMesh) meshReg->destroyNative(); apf::destroyMesh(meshReg); - meshForce->destroyNative(); - apf::destroyMesh(meshForce); } #endif \ No newline at end of file diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 89de5dce9..39da0b102 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -5,18 +5,6 @@ #include #include "SimAdvMeshing.h" -ma::Mesh* createMesh(const char* nativefile, const char* smdfile, const char* smsfile, pcu::PCU* PCUObj) -{ - pProgress progress = Progress_new(); - Progress_setDefaultCallback(progress); - gmi_model* mdl_ref = gmi_sim_load(nativefile, smdfile); - pGModel model = gmi_export_sim(mdl_ref); - pParMesh mesh = PM_load(smsfile, model, progress); - ma::Mesh* mesh_ref = apf::createMesh(mesh, PCUObj); - apf::Mesh2* m = apf::createMdsMesh(mdl_ref, mesh_ref); - return m; -} - int main(int argc, char* argv[]) { if (argc != 4) { @@ -43,11 +31,26 @@ int main(int argc, char* argv[]) gmi_sim_start(); gmi_register_sim(); - auto createMeshValues = [nativefile, smdfile, smsfile, PCUObj]() - { return createMesh(nativefile, smdfile, smsfile, PCUObj); }; + pProgress progress = Progress_new(); + Progress_setDefaultCallback(progress); + gmi_model* mdl_ref = gmi_sim_load(nativefile, smdfile); + pGModel model = gmi_export_sim(mdl_ref); + pParMesh mesh = PM_load(smsfile, model, progress); + ma::Mesh* mesh_ref = apf::createMesh(mesh, PCUObj); + + auto createMeshValues = [mdl_ref, mesh_ref]() + { return apf::createMdsMesh(mdl_ref, mesh_ref); }; adaptTests(createMeshValues); + M_release(mesh); + Progress_delete(progress); + gmi_sim_stop(); + SimPartitionedMesh_stop(); + Sim_unregisterAllKeys(); + SimModel_stop(); + MS_exit(); + delete PCUObj; MPI_Finalize(); } From 24dccb246104d92c64b6e0f361fcc3d9750a8f53 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 26 Sep 2025 23:00:02 -0400 Subject: [PATCH 221/319] simplify aniso_adapt --- test/aniso_adapt.cc | 7 +------ test/aniso_adapt_cap.cc | 26 +++++++++++--------------- 2 files changed, 12 insertions(+), 21 deletions(-) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index 7bbd9c6cb..e604564f1 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -3,11 +3,6 @@ #include #include "aniso_adapt.h" -ma::Mesh* createMesh(const char* modelfile, const char* meshfile, pcu::PCU *PCUObj) -{ - return apf::loadMdsMesh(modelfile,meshfile,PCUObj); -} - int main(int argc, char** argv) { PCU_ALWAYS_ASSERT(argc==3); @@ -20,7 +15,7 @@ int main(int argc, char** argv) gmi_register_mesh(); auto createMeshValues = [modelFile,meshFile,&PCUObj]() - { return createMesh(modelFile,meshFile,&PCUObj); }; + { return apf::loadMdsMesh(modelFile,meshFile,&PCUObj); }; adaptTests(createMeshValues); } diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 246fd403e..9cc0bbec5 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -3,17 +3,6 @@ #include #include "aniso_adapt.h" -ma::Mesh* createMesh(const char* meshFile, pcu::PCU* PCUObj) -{ - gmi_model* model = gmi_load(meshFile); - ma::Mesh* apfCapMesh = apf::createCapMesh(model, PCUObj); - apf::disownCapModel(apfCapMesh); - ma::Mesh* apfMesh = apf::createMdsMesh(model, apfCapMesh, true); - apf::disownMdsModel(apfMesh); - apf::destroyMesh(apfCapMesh); - return apfMesh; -} - int main(int argc, char** argv) { MPI_Init(&argc, &argv); @@ -32,13 +21,20 @@ int main(int argc, char** argv) gmi_cap_start(); gmi_register_cap(); lion_set_verbosity(1); - const char* meshFile = argv[1]; - auto createMeshValues = [meshFile, &PCUObj]() - { return createMesh(meshFile, &PCUObj); }; - adaptTests(createMeshValues); + gmi_model* model = gmi_load(meshFile); //Freed in adaptTests + ma::Mesh* apfCapMesh = apf::createCapMesh(model, &PCUObj); + apf::disownCapModel(apfCapMesh); + ma::Mesh* mesh = apf::createMdsMesh(model, apfCapMesh, true); + apf::disownMdsModel(mesh); + apf::destroyMesh(apfCapMesh); + auto createMeshValues = [model, mesh]() + { return apf::createMdsMesh(model, mesh, true); }; + + adaptTests(createMeshValues); + apf::destroyMesh(mesh); gmi_cap_stop(); } MPI_Finalize(); From 9bfd4941ecef8d7ab91319f651e737bb8bb4a0f1 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 27 Sep 2025 14:58:21 -0400 Subject: [PATCH 222/319] reuse print next layer --- ma/maShapeNew.cc | 20 ++------------------ ma/maSnapper.cc | 42 ++++++++++++++++++++++++------------------ ma/maSnapper.h | 1 + 3 files changed, 27 insertions(+), 36 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index a6545a6d0..341e405cd 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -390,31 +390,15 @@ class FixShape return true; } - EntitySet addNextLayer(EntitySet& tets) - { - EntitySet adjacent; - APF_ITERATE(ma::EntitySet,tets,it) { - Entity* faces[4]; - a->mesh->getDownward(*it, 2, faces); - for (int f=0; f<4; f++) { - apf::Up nextLayer; - a->mesh->getUp(faces[f], nextLayer); - for (int n=0; nmesh); EntitySet bad; bad.insert(tet); ma_dbg::createCavityMesh(a, bad, "shape_worst"); - EntitySet adjacent1 = addNextLayer(bad); + EntitySet adjacent1 = getNextLayer(a, bad); ma_dbg::createCavityMesh(a, adjacent1, "shape_adjacent_1"); - EntitySet adjacent2 = addNextLayer(adjacent1); + EntitySet adjacent2 = getNextLayer(a, adjacent1); ma_dbg::createCavityMesh(a, adjacent2, "shape_adjacent_2"); } diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b91f26e6b..6ff11d2a7 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -90,32 +90,22 @@ static void printFPP(Adapt* a, FirstProblemPlane* FPP) ma_dbg::addClassification(a, "classification"); apf::writeVtkFiles("FPP_Mesh", a->mesh); - EntityArray invalid; - for (int i=0; iproblemRegions.n; i++){ - invalid.append(FPP->problemRegions.e[i]); - } + EntitySet invalid; + for (auto e : FPP->problemRegions) invalid.insert(e); ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); - for (int i=0; icommEdges.n; i++) setFlag(a, FPP->commEdges.e[i], CHECKED); + for (auto e : FPP->commEdges) setFlag(a, e, CHECKED); ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); - for (int i=0; icommEdges.n; i++) clearFlag(a, FPP->commEdges.e[i], CHECKED); + for (auto e : FPP->commEdges) clearFlag(a, e, CHECKED); flagAndPrint(a, FPP->vert, 0, "FPP_Vertex"); flagAndPrint(a, FPP->problemFace, 2, "FPP_Face"); flagAndPrint(a, FPP->problemRegion, 3, "FPP_Region"); - apf::Adjacent adj; - a->mesh->getAdjacent(FPP->vert, 3, adj); - for (int i=0; imesh->getDownward(FPP->problemFace, 0, problemFaceVerts); - for (int i=0; i<3; i++){ - a->mesh->getAdjacent(problemFaceVerts[i], 3, adj); - for (int i=0; imesh->getDownward(*it, 2, faces); + for (int f=0; f<4; f++) { + apf::Up nextLayer; + a->mesh->getUp(faces[f], nextLayer); + for (int n=0; n& coords); Vector getCenter(Mesh* mesh, Entity* face); bool isLowInHigh(Mesh* mesh, Entity* highEnt, Entity* lowEnt); +EntitySet getNextLayer(Adapt* a, EntitySet& tets); } From aaaf02b38883ac00e3cd3365ab55bc9d51dcab5c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Mon, 29 Sep 2025 17:56:09 -0400 Subject: [PATCH 223/319] fixed parallel adapt --- apf/apfCavityOp.cc | 41 +++++++++++++++++++++++++++++++++++ apf/apfCavityOp.h | 4 ++++ ma/ma.cc | 11 ++++++---- ma/maShapeNew.cc | 54 ++++++++++++++++++++++++++++------------------ 4 files changed, 85 insertions(+), 25 deletions(-) diff --git a/apf/apfCavityOp.cc b/apf/apfCavityOp.cc index 568fd2287..99f141c45 100644 --- a/apf/apfCavityOp.cc +++ b/apf/apfCavityOp.cc @@ -119,6 +119,47 @@ void CavityOp::applyToDimension(int d) sharing = 0; } +void CavityOp::iterateDimension(int d, std::function getLocality, + std::function modifyMesh) +{ + do { + delete sharing; + sharing = apf::getSharing(mesh); + + Mesh2* mesh2 = static_cast(mesh); + MeshEntity* e; + isRequesting = false; + iterator = mesh->begin(d); + while ((e = mesh->iterate(iterator))) { + if (sharing->isOwned(e)) { + if (getLocality(e) == OK) { + movedByDeletion = false; + modifyMesh(e); + if (movedByDeletion) + continue; + } + } + mesh2->increment(iterator); + } + mesh2->end(iterator); + /* request any non-local cavities. + note: it is critical that this loop + be separated from the one above for + mesh-modifying operators, since an apply() + call could change other overlapping cavities */ + isRequesting = true; + iterator = mesh2->begin(d); + while ((e = mesh2->iterate(iterator))) { + if (!sharing->isOwned(e)) continue; + getLocality(e); + } + mesh2->end(iterator); + } while (tryToPull()); + + delete sharing; + sharing = 0; +} + bool CavityOp::requestLocality(MeshEntity** entities, int count) { bool areLocal = true; diff --git a/apf/apfCavityOp.h b/apf/apfCavityOp.h index 026b2875b..61766a88e 100644 --- a/apf/apfCavityOp.h +++ b/apf/apfCavityOp.h @@ -14,6 +14,7 @@ #include "apfMesh.h" #include #include +#include namespace apf { @@ -102,6 +103,9 @@ class CavityOp bool tryToPull(); void applyLocallyWithModification(int d); void applyLocallyWithoutModification(int d); + void iterateDimension(int d, std::function checkValidity, + std::function modifyMesh); + bool canModify; bool movedByDeletion; MeshIterator* iterator; diff --git a/ma/ma.cc b/ma/ma.cc index f533d6089..fca24693d 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -41,10 +41,13 @@ void printHistogramData(std::string name, std::vector input, double min, count[bin] += 1; } - std::cout << name << "\n"; - printf("Min: %f, Max: %f\n", inputMin, inputMax); - for (int i = 0; i < nbins; ++i) - fprintf(stderr, "%d\n", count[i]); + inputMin = m->getPCU()->Min(inputMin); + inputMax = m->getPCU()->Max(inputMax); + for (int i = 0; i < nbins; ++i) count[i] = m->getPCU()->Add(count[i]); + + if (m->getPCU()->Self()) return; + printf("%s Min: %f, Max: %f\n", name.c_str(), inputMin, inputMax); + for (int i = 0; i < nbins; ++i) printf("%d\n", count[i]); } void printHistogramStats(Adapt* a) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 341e405cd..359e66318 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -56,7 +56,7 @@ void unMarkBadQualityNew(Adapt* a) m->end(it); } -class FixShape +class FixShape : public Operator { public: Adapt* a; @@ -67,6 +67,7 @@ class FixShape FaceSplitCollapse faceSplitCollapse; EdgeSwap* edgeSwap; Splits split; + Entity* badTet; int numCollapse=0; int numEdgeSwap=0; @@ -93,6 +94,18 @@ class FixShape edgeSwap = makeEdgeSwap(a); } + int getTargetDimension() { return 3; } + bool shouldApply(Entity* e) { + badTet = e; + return getFlag(a, e, BAD_QUALITY); + } + bool requestLocality(apf::CavityOp* o) + { + Entity* verts[4]; + a->mesh->getDownward(badTet, 0, verts); + return o->requestLocality(verts, 4); + } + bool collapseEdge(Entity* edge) { if (collapse.setEdge(edge) && @@ -115,6 +128,8 @@ class FixShape for (int e=0; emesh, adjEdges.e[e], verts[v]); + if (!mesh->isOwned(keep)) continue; // TODO: improvement to requestLocality should remove use for this function + if (mesh->isShared(keep)) continue; // TODO: improvement to requestLocality should remove use for this function bool alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); setFlag(a, keep, DONT_COLLAPSE); bool success = collapseEdge(adjEdges.e[e]); @@ -335,22 +350,16 @@ class FixShape if (faceSplitCollapse.run(problemEnts[0], tet)) {numFaceSplitCollapse++; return;} } - void loopOnce() + void apply() { - Entity* tet; - Iterator* it = a->mesh->begin(3); - while ((tet = a->mesh->iterate(it))) { - if (!getFlag(a, tet, BAD_QUALITY)) continue; - clearFlag(a, tet, BAD_QUALITY); - - if (fixShortEdge(tet)) continue; - if (fixOneLargeAngle(tet)) continue; - Entity* problemEnts[4]; - if (isTwoLargeAngles(tet, problemEnts)) - fixTwoLargeAngles(tet, problemEnts); - else - fixThreeLargeAngles(tet, problemEnts); - } + clearFlag(a, badTet, BAD_QUALITY); + if (fixShortEdge(badTet)) return; + if (fixOneLargeAngle(badTet)) return; + Entity* problemEnts[4]; + if (isTwoLargeAngles(badTet, problemEnts)) + fixTwoLargeAngles(badTet, problemEnts); + else + fixThreeLargeAngles(badTet, problemEnts); } void resetCounters() @@ -358,19 +367,22 @@ class FixShape numOneShortEdge=numTwoShortEdge=numThreeShortEdge=numMoreShortEdge=0; numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; } + int collect(int val) { + return a->mesh->getPCU()->Add(val); + } void printNumOperations() { print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n split reposition %9d\n double split collapse %d\n " "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", - numCollapse, numEdgeSwap, numSplitReposition, numDoubleSplitCollapse, - numEdgeSplitCollapse, numFaceSplitCollapse, numRegionCollapse, numFaceSwap); + collect(numCollapse), collect(numEdgeSwap), collect(numSplitReposition), collect(numDoubleSplitCollapse), + collect(numEdgeSplitCollapse), collect(numFaceSplitCollapse), collect(numRegionCollapse), collect(numFaceSwap)); } void printBadTypes() { print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n " "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", - numOneShortEdge, numTwoShortEdge, numThreeShortEdge, - numMoreShortEdge, numOneLargeAngle, numTwoLargeAngles, numThreeLargeAngles); + collect(numOneShortEdge), collect(numTwoShortEdge), collect(numThreeShortEdge), + collect(numMoreShortEdge), collect(numOneLargeAngle), collect(numTwoLargeAngles), collect(numThreeLargeAngles)); } bool isShortEdge(Entity* tet) @@ -449,7 +461,7 @@ void fixElementShapesNew(Adapt* a) do { if (!count) break; prev_count = count; - fixShape.loopOnce(); + applyOperator(a,&fixShape); if (a->mesh->getDimension() == 3) snap(a); count = markBadQualityNew(a); From 3c86168b61a852e7f278d8b9284172d12767a166 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 1 Oct 2025 15:33:38 -0400 Subject: [PATCH 224/319] remove debug --- ma/maShapeNew.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 359e66318..c49da1255 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -440,7 +440,7 @@ class FixShape : public Operator numThreeLargeAngles++; } printBadTypes(); - printBadShape(worstShape); + // printBadShape(worstShape); } }; From ab8c58052be0ff5b670d94c7be541530b630b6f1 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 1 Oct 2025 17:05:47 -0400 Subject: [PATCH 225/319] improved comments --- ma/maMatch.cc | 2 +- ma/maSnap.cc | 6 ++++++ ma/maSnapper.cc | 13 ++++++------- 3 files changed, 13 insertions(+), 8 deletions(-) diff --git a/ma/maMatch.cc b/ma/maMatch.cc index 7309f5c5c..1a0582c1b 100644 --- a/ma/maMatch.cc +++ b/ma/maMatch.cc @@ -76,7 +76,7 @@ void matchNewElements(Refine* r) } /* we are starting to support a few operations on matched -meshes, sincluding snapping+UR. this should prevent snapping +meshes, including snapping+UR. this should prevent snapping from modifying any matched entities */ void preventMatchedCavityMods(Adapt* a) { diff --git a/ma/maSnap.cc b/ma/maSnap.cc index fef9a28de..3c4d92b76 100644 --- a/ma/maSnap.cc +++ b/ma/maSnap.cc @@ -904,6 +904,12 @@ int collect(Adapt* a, int val) { return a->mesh->getPCU()->Add(val); } +/* + This function follows the snapping procedure specified in Li's thesis, in which verticies + will be moved directly to the model boundary, however if the movement fails due to making + an element invalid, then several operations will be attempted in order to resolve invalid + elements. +*/ void snap(Adapt* a) { if (!a->input->shouldSnap) diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 6a4558ba8..2f3a426d2 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -27,10 +27,9 @@ namespace ma { -Snapper::Snapper(Adapt* a, Tag* st) : splitCollapse(a), doubleSplitCollapse(a) +Snapper::Snapper(Adapt* a, Tag* st) : mesh(a->mesh), splitCollapse(a), doubleSplitCollapse(a) { adapt = a; - mesh = a->mesh; snapTag = st; collapse.Init(a); edgeSwap = makeEdgeSwap(a); @@ -134,11 +133,11 @@ static Vector projOnTriPlane(Adapt* a, Entity* vert, Vector normal, Vector v0) Given a poorly-shaped tetrahedron, a base triangle and the opposite vertex of the base, determine the following information: 1. the key mesh entities to apply local mesh modification - 2. area of the four faces - 3. the intersection of two intersected opposite edges in case two large dihedral angles - - return 0 : if an edge is degenerated - 1-7 : the index indicating the location of projection point + 2. area of the four face + + return 0 : if an edge is degenerated + 3,5,6 : the tetrahedron has two large dihedral angles. The opposite edges will be stored in ents[0], ents[1]. + 1,2,4,7 : the tetrahedron has three large angles. The largeest face is stored in ents[0]. */ int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* ents[4], double area[4]) { From a2960ec4f95f1475a32e4f45e6fd6493e1421ca8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 2 Oct 2025 14:45:27 -0400 Subject: [PATCH 226/319] coarsen once v1 --- ma/ma.cc | 2 +- ma/maCoarsen.cc | 53 +++++++++++++++++++++++++++++++++++++++++++++++++ ma/maCoarsen.h | 1 + 3 files changed, 55 insertions(+), 1 deletion(-) diff --git a/ma/ma.cc b/ma/ma.cc index fca24693d..37d765d18 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -66,7 +66,7 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsen(a); + coarsenOnce(a); for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 9baa67130..531ea3b5b 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -467,5 +467,58 @@ bool coarsenMultiple(Adapt* a) return true; } +/* + Given an iterator pointing to a vertex we will collapse the shortest adjacent edge and try the next + shorted until one succeeds and then it will expand independent set. In Li's thesis it only attempts + to collapse the shortest edge, but this gave us better results. +*/ +bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adjacent, Tag* lengthTag) +{ + std::vector sorted; + for (int i=0; i < adjacent.n; i++) { + double length = getLength(a, lengthTag, adjacent.e[i]); + EdgeLength measured{adjacent.e[i], length}; + if (measured.length > MINLENGTH) continue; + sorted.push_back(measured); + } + std::sort(sorted.begin(), sorted.end()); + for (size_t i=0; i < sorted.size(); i++) { + Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); + if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; + for (int adj=0; adj < adjacent.n; adj++) { + Entity* verts[2]; + a->mesh->getDownward(adjacent.e[adj], 0, verts); + for (int v = 0; v < 2; v++) + setFlag(a, verts[v], NEED_NOT_COLLAPSE); + } + collapse.destroyOldElements(); + return true; + } + return false; +} + +void coarsenOnce(Adapt* a) +{ + if (!a->input->shouldCoarsen) + return; + double t0 = pcu::Time(); + Tag* lengthTag = a->mesh->createDoubleTag("edge_length", 1); + std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); + + Collapse collapse; + collapse.Init(a); + int success = 0; + for (Entity* vertex : shortEdgeVerts) { + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) continue; + apf::Up adjacent; + a->mesh->getUp(vertex, adjacent); + if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) success++; + } + ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + a->mesh->destroyTag(lengthTag); + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", success, t1-t0); +} + } diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index 2e4283c77..30e867ea4 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -14,6 +14,7 @@ namespace ma { class Adapt; +void coarsenOnce(Adapt* a); bool coarsenMultiple(Adapt* a); bool coarsen(Adapt* a); bool coarsenLayer(Adapt* a); From 6d4b3d7afc644c3d7429458ca4e8b499cf167d1c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 2 Oct 2025 18:35:58 -0400 Subject: [PATCH 227/319] corsen a few times --- ma/ma.cc | 2 +- ma/maCoarsen.cc | 55 +++++++++++++++++++++++++++++++++++-------------- 2 files changed, 40 insertions(+), 17 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 37d765d18..f4c994792 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -73,7 +73,7 @@ void adapt(Input* in) midBalance(a); refine(a); snap(a); - coarsen(a); + coarsenOnce(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 531ea3b5b..6446aab9d 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -467,6 +467,24 @@ bool coarsenMultiple(Adapt* a) return true; } +/* + To be used after collapsing a vertex to flag adjacent vertices as NEED_NOT_COLLAPSE. This will create a + set of collapses where no two adjacent are vertices collapsed. Will also clear adjacent vertices for + collapse in next independent set since they might succeed after a collapse. +*/ +void flagIndependentSet(Adapt* a, apf::Up& adjacent) +{ + for (int adj=0; adj < adjacent.n; adj++) { + Entity* vertices[2]; + a->mesh->getDownward(adjacent.e[adj],0, vertices); + for (int v = 0; v < 2; v++) { + setFlag(a, vertices[v], NEED_NOT_COLLAPSE); + if (getFlag(a, vertices[v], CHECKED)) + clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set + } + } +} + /* Given an iterator pointing to a vertex we will collapse the shortest adjacent edge and try the next shorted until one succeeds and then it will expand independent set. In Li's thesis it only attempts @@ -485,12 +503,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adj for (size_t i=0; i < sorted.size(); i++) { Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; - for (int adj=0; adj < adjacent.n; adj++) { - Entity* verts[2]; - a->mesh->getDownward(adjacent.e[adj], 0, verts); - for (int v = 0; v < 2; v++) - setFlag(a, verts[v], NEED_NOT_COLLAPSE); - } + flagIndependentSet(a, adjacent); collapse.destroyOldElements(); return true; } @@ -503,21 +516,31 @@ void coarsenOnce(Adapt* a) return; double t0 = pcu::Time(); Tag* lengthTag = a->mesh->createDoubleTag("edge_length", 1); - std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); - Collapse collapse; collapse.Init(a); + int totalSuccess = 0; int success = 0; - for (Entity* vertex : shortEdgeVerts) { - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) continue; - apf::Up adjacent; - a->mesh->getUp(vertex, adjacent); - if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) success++; - } - ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + int counter = 0; + do { + success = 0; + std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); + for (Entity* vertex : shortEdgeVerts) { + if (getFlag(a, vertex, CHECKED)) continue; + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) continue; + apf::Up adjacent; + a->mesh->getUp(vertex, adjacent); + if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) success++; + else setFlag(a, vertex, CHECKED); + } + ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + totalSuccess += success; + if (counter++ == 5) break; + } while (success > 0); + + ma::clearFlagFromDimension(a, CHECKED, 0); a->mesh->destroyTag(lengthTag); double t1 = pcu::Time(); - print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", success, t1-t0); + print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", totalSuccess, t1-t0); } From a1703962b4066f4da042f7d0494b7c2435447b7b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 2 Oct 2025 23:44:44 -0400 Subject: [PATCH 228/319] collapse once --- ma/maCoarsen.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 6446aab9d..6fead7dd2 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -479,8 +479,8 @@ void flagIndependentSet(Adapt* a, apf::Up& adjacent) a->mesh->getDownward(adjacent.e[adj],0, vertices); for (int v = 0; v < 2; v++) { setFlag(a, vertices[v], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[v], CHECKED)) - clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set + // if (getFlag(a, vertices[v], CHECKED)) + // clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set } } } From ee5373fa8c36dfaf170898aa06982d4eb2f8df77 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 8 Oct 2025 10:32:32 -0400 Subject: [PATCH 229/319] unused --- ma/maCoarsen.cc | 22 +++++++++++++++++++++- ma/maCollapse.cc | 18 ++++++++++++++++++ ma/maCollapse.h | 1 + 3 files changed, 40 insertions(+), 1 deletion(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 6fead7dd2..d77580e36 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -27,6 +27,8 @@ This file contains two coarsening alogrithms. #include #include #include +#include "maSnapper.h" +#include "maShapeHandler.h" namespace ma { @@ -59,6 +61,25 @@ bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent return true; } +// bool collapseValid(Adapt* a, Entity* vKeep, Entity* edge, apf::Up& adjacent) +// { +// // double worst = getWorstQuality(a, adjacent.e, adjacent.n); +// Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vKeep); +// Vector prev = getPosition(a->mesh, vCollapse); +// Vector target = getPosition(a->mesh, vKeep); +// a->mesh->setPoint(vCollapse, 0, target); +// bool output = true; +// for (int i=0; imesh, adjacent.e[i], vCollapse)) continue; +// if (a->shape->getQuality(adjacent.e[i]) < a->input->goodQuality) { +// output = false; +// break; +// } +// } +// a->mesh->setPoint(vCollapse, 0, prev); +// return output; +// } + bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) { PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); @@ -534,7 +555,6 @@ void coarsenOnce(Adapt* a) } ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); totalSuccess += success; - if (counter++ == 5) break; } while (success > 0); ma::clearFlagFromDimension(a, CHECKED, 0); diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index af13ba324..900e70777 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -10,6 +10,7 @@ #include "maCollapse.h" #include "maAdapt.h" #include "maShape.h" +#include "maShapeHandler.h" #include #include @@ -34,6 +35,23 @@ bool Collapse::requestLocality(apf::CavityOp* o) return o->requestLocality(v,2); } +bool Collapse::collapseValid(double qualityToBeat) +{ + Vector prev = getPosition(adapt->mesh, vertToCollapse); + Vector target = getPosition(adapt->mesh, vertToKeep); + adapt->mesh->setPoint(vertToCollapse, 0, target); + bool output = true; + for (Entity* shape : newElements) { + // if (isLowInHigh(m, adjacent.e[i], vertToCollapse)) continue; + if (adapt->shape->getQuality(shape) < qualityToBeat) { + output = false; + break; + } + } + adapt->mesh->setPoint(vertToCollapse, 0, prev); + return output; +} + bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) { PCU_ALWAYS_ASSERT( ! adapt->mesh->isShared(vertToCollapse)); diff --git a/ma/maCollapse.h b/ma/maCollapse.h index d9a449adf..abb9c0243 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,6 +42,7 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); + bool collapseValid(double qualityToBeat); double getOldQuality(); Adapt* adapt; Entity* edge; From 395697f3f07896833603c2dafbb25e0ea4558c8e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 8 Oct 2025 14:44:48 -0400 Subject: [PATCH 230/319] collapse check validity first --- ma/maCoarsen.cc | 28 ++--------------------- ma/maCollapse.cc | 58 ++++++++++++++++++++++++++++++++++++++++-------- ma/maCollapse.h | 3 ++- 3 files changed, 53 insertions(+), 36 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index d77580e36..165151466 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -79,28 +79,6 @@ bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent // a->mesh->setPoint(vCollapse, 0, prev); // return output; // } - -bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) -{ - PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - bool alreadyFlagged = true; - if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); - if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); - - double quality = a->input->shouldForceAdaptation ? a->input->validQuality - : a->input->goodQuality; - - bool result = false; - if (collapse.setEdge(edge) && - collapse.checkClass() && - collapse.checkTopo() && - collapseSizeCheck(a, keep, edge, adjacent) && - collapse.tryBothDirections(quality)) { - result = true; - } - if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); - return result; -} } class CollapseChecker : public apf::CavityOp @@ -390,8 +368,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg } std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); - if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; + if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex)) continue; flagIndependentSet(a, adjacent, checked); itr = shortEdgeVerts.erase(itr); collapse.destroyOldElements(); @@ -522,8 +499,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adj } std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { - Entity* keepVertex = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); - if (!tryCollapseEdge(a, sorted[i].edge, keepVertex, collapse, adjacent)) continue; + if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex)) continue; flagIndependentSet(a, adjacent); collapse.destroyOldElements(); return true; diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 900e70777..62fbff4d5 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -35,19 +35,35 @@ bool Collapse::requestLocality(apf::CavityOp* o) return o->requestLocality(v,2); } -bool Collapse::collapseValid(double qualityToBeat) +// bool Collapse::collapseValid(double qualityToBeat) +// { +// Vector prev = getPosition(adapt->mesh, vertToCollapse); +// Vector target = getPosition(adapt->mesh, vertToKeep); +// adapt->mesh->setPoint(vertToCollapse, 0, target); +// bool output = true; +// for (Entity* shape : newElements) { +// // if (isLowInHigh(m, adjacent.e[i], vertToCollapse)) continue; +// if (adapt->shape->getQuality(shape) < qualityToBeat) { +// output = false; +// break; +// } +// } +// adapt->mesh->setPoint(vertToCollapse, 0, prev); +// return output; +// } + + +bool Collapse::isValid() { Vector prev = getPosition(adapt->mesh, vertToCollapse); Vector target = getPosition(adapt->mesh, vertToKeep); adapt->mesh->setPoint(vertToCollapse, 0, target); - bool output = true; - for (Entity* shape : newElements) { - // if (isLowInHigh(m, adjacent.e[i], vertToCollapse)) continue; - if (adapt->shape->getQuality(shape) < qualityToBeat) { - output = false; - break; - } - } + EntityArray elements; + elements.setSize(elementsToKeep.size()); + int i=0; + for (Entity* e : elementsToKeep) + elements[i++] = e; + bool output = areTetsValid(adapt->mesh, elements); adapt->mesh->setPoint(vertToCollapse, 0, prev); return output; } @@ -499,6 +515,30 @@ bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex) return isRequiredForAnEdgeCollapse(adapt, vertex); } +bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) +{ + Adapt* adapt = collapse.adapt; + double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality + : adapt->input->goodQuality; + if (!setupCollapse(collapse, edge, vert)) + return false; + if (!collapse.isValid()) + return false; + + if (!adapt->input->shouldForceAdaptation) + qualityToBeat = std::min(adapt->input->goodQuality, + std::max(collapse.getOldQuality(),adapt->input->validQuality)); + + collapse.rebuildElements(); + collapse.fitElements(); + if (hasWorseQuality(adapt,collapse.newElements,qualityToBeat)) + collapse.destroyNewElements(); + else return true; + + collapse.unmark(); + return false; +} + bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert) { Adapt* adapter = collapse.adapt; diff --git a/ma/maCollapse.h b/ma/maCollapse.h index abb9c0243..217507fe3 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,7 +42,7 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); - bool collapseValid(double qualityToBeat); + bool isValid(); double getOldQuality(); Adapt* adapt; Entity* edge; @@ -58,6 +58,7 @@ class Collapse bool checkEdgeCollapseTopology(Adapt* a, Entity* edge); bool isRequiredForAnEdgeCollapse(Adapt* adapt, Entity* vertex); bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex); +bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert); bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert); } From 8691b800d6df49ee1dc3b9f1f3889eaa61c56448 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 8 Oct 2025 15:03:32 -0400 Subject: [PATCH 231/319] quality first --- ma/maCollapse.cc | 28 ++++++++++++++-------------- ma/maCollapse.h | 2 +- 2 files changed, 15 insertions(+), 15 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 62fbff4d5..7e00cee49 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -53,7 +53,7 @@ bool Collapse::requestLocality(apf::CavityOp* o) // } -bool Collapse::isValid() +bool Collapse::isValid(double qualityToBeat) { Vector prev = getPosition(adapt->mesh, vertToCollapse); Vector target = getPosition(adapt->mesh, vertToKeep); @@ -63,9 +63,12 @@ bool Collapse::isValid() int i=0; for (Entity* e : elementsToKeep) elements[i++] = e; - bool output = areTetsValid(adapt->mesh, elements); + + bool valid = areTetsValid(adapt->mesh, elements) + && !hasWorseQuality(adapt, elements, qualityToBeat); + adapt->mesh->setPoint(vertToCollapse, 0, prev); - return output; + return valid; } bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) @@ -520,23 +523,20 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) Adapt* adapt = collapse.adapt; double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality : adapt->input->goodQuality; - if (!setupCollapse(collapse, edge, vert)) - return false; - if (!collapse.isValid()) - return false; - if (!adapt->input->shouldForceAdaptation) qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); + if (!setupCollapse(collapse, edge, vert)) + return false; + if (!collapse.isValid(qualityToBeat)) { + collapse.unmark(); + return false; + } + collapse.rebuildElements(); collapse.fitElements(); - if (hasWorseQuality(adapt,collapse.newElements,qualityToBeat)) - collapse.destroyNewElements(); - else return true; - - collapse.unmark(); - return false; + return true; } bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert) diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 217507fe3..200b428aa 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,7 +42,7 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); - bool isValid(); + bool isValid(double qualityToBeat); double getOldQuality(); Adapt* adapt; Entity* edge; From 2cde312bf1f34b225122a8b082beb96e01aca05a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 8 Oct 2025 15:09:08 -0400 Subject: [PATCH 232/319] remove unused --- ma/maCoarsen.cc | 19 ------------------- 1 file changed, 19 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 165151466..8e05cdf30 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -60,25 +60,6 @@ bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent } return true; } - -// bool collapseValid(Adapt* a, Entity* vKeep, Entity* edge, apf::Up& adjacent) -// { -// // double worst = getWorstQuality(a, adjacent.e, adjacent.n); -// Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vKeep); -// Vector prev = getPosition(a->mesh, vCollapse); -// Vector target = getPosition(a->mesh, vKeep); -// a->mesh->setPoint(vCollapse, 0, target); -// bool output = true; -// for (int i=0; imesh, adjacent.e[i], vCollapse)) continue; -// if (a->shape->getQuality(adjacent.e[i]) < a->input->goodQuality) { -// output = false; -// break; -// } -// } -// a->mesh->setPoint(vCollapse, 0, prev); -// return output; -// } } class CollapseChecker : public apf::CavityOp From 140f9bb883f5e2ca532c39ebb0fe8b0943b57478 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 8 Oct 2025 17:08:18 -0400 Subject: [PATCH 233/319] get short edges once --- ma/maCoarsen.cc | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 8e05cdf30..7de3c711c 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -499,16 +499,18 @@ void coarsenOnce(Adapt* a) int totalSuccess = 0; int success = 0; int counter = 0; + std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); do { success = 0; - std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); - for (Entity* vertex : shortEdgeVerts) { - if (getFlag(a, vertex, CHECKED)) continue; - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) continue; + for (auto it = shortEdgeVerts.begin(); it != shortEdgeVerts.end();) { + Entity* vertex = *it; + if (getFlag(a, vertex, CHECKED)) {it = shortEdgeVerts.erase(it); continue;} + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {++it; continue;} apf::Up adjacent; a->mesh->getUp(vertex, adjacent); if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) success++; else setFlag(a, vertex, CHECKED); + it = shortEdgeVerts.erase(it); } ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); totalSuccess += success; From 344d7a0ff960110659b55b42f9167368bccf24b1 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 8 Oct 2025 19:33:00 -0400 Subject: [PATCH 234/319] seperate valid and quality --- ma/maCollapse.cc | 22 ++++++++++++++++------ ma/maCollapse.h | 3 ++- 2 files changed, 18 insertions(+), 7 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 7e00cee49..0345b069c 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -53,7 +53,7 @@ bool Collapse::requestLocality(apf::CavityOp* o) // } -bool Collapse::isValid(double qualityToBeat) +bool Collapse::isValid() { Vector prev = getPosition(adapt->mesh, vertToCollapse); Vector target = getPosition(adapt->mesh, vertToKeep); @@ -63,14 +63,24 @@ bool Collapse::isValid(double qualityToBeat) int i=0; for (Entity* e : elementsToKeep) elements[i++] = e; - - bool valid = areTetsValid(adapt->mesh, elements) - && !hasWorseQuality(adapt, elements, qualityToBeat); - + bool valid = areTetsValid(adapt->mesh, elements); adapt->mesh->setPoint(vertToCollapse, 0, prev); return valid; } +bool Collapse::anyWorseQuality(double qualityToBeat) +{ + Vector prev = getPosition(adapt->mesh, vertToCollapse); + Vector target = getPosition(adapt->mesh, vertToKeep); + adapt->mesh->setPoint(vertToCollapse, 0, target); + bool worse = false; + for (Entity* e : elementsToKeep) + if (adapt->sizeField->measure(e) < qualityToBeat) + {worse = true; break;} + adapt->mesh->setPoint(vertToCollapse, 0, prev); + return worse; +} + bool Collapse::tryThisDirectionNoCancel(double qualityToBeat) { PCU_ALWAYS_ASSERT( ! adapt->mesh->isShared(vertToCollapse)); @@ -529,7 +539,7 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) if (!setupCollapse(collapse, edge, vert)) return false; - if (!collapse.isValid(qualityToBeat)) { + if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false; } diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 200b428aa..add7976fb 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -42,7 +42,8 @@ class Collapse bool tryBothDirections(double qualityToBeat); void getOldElements(EntityArray& oldElements); bool edgesGoodSize(); - bool isValid(double qualityToBeat); + bool isValid(); + bool anyWorseQuality(double qualityToBeat); double getOldQuality(); Adapt* adapt; Entity* edge; From 33608f96a092bd916fd69f9e1f97e7b80b6f238f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 01:03:37 -0400 Subject: [PATCH 235/319] combine setupCollapse --- ma/maCollapse.cc | 14 ++++++++++++-- 1 file changed, 12 insertions(+), 2 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 0345b069c..304891ebe 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -531,14 +531,24 @@ bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex) bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) { Adapt* adapt = collapse.adapt; + PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); + PCU_ALWAYS_ASSERT(adapt->mesh->getType(vert) == apf::Mesh::VERTEX); + if (!collapse.setEdge(edge)) return false; + if (!collapse.checkClass()) return false; + if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } + if (!collapse.checkTopo()) return false; + if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } + if (collapse.vertToCollapse != vert) + std::swap(collapse.vertToCollapse, collapse.vertToKeep); + PCU_ALWAYS_ASSERT(collapse.vertToCollapse == vert); + collapse.computeElementSets(); + double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality : adapt->input->goodQuality; if (!adapt->input->shouldForceAdaptation) qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); - if (!setupCollapse(collapse, edge, vert)) - return false; if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false; From 17dd85f6c1950cc26504a19bea38ca40b84873de Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 01:05:28 -0400 Subject: [PATCH 236/319] remove unused --- ma/maCollapse.cc | 18 ------------------ 1 file changed, 18 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 304891ebe..333c1329b 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -35,24 +35,6 @@ bool Collapse::requestLocality(apf::CavityOp* o) return o->requestLocality(v,2); } -// bool Collapse::collapseValid(double qualityToBeat) -// { -// Vector prev = getPosition(adapt->mesh, vertToCollapse); -// Vector target = getPosition(adapt->mesh, vertToKeep); -// adapt->mesh->setPoint(vertToCollapse, 0, target); -// bool output = true; -// for (Entity* shape : newElements) { -// // if (isLowInHigh(m, adjacent.e[i], vertToCollapse)) continue; -// if (adapt->shape->getQuality(shape) < qualityToBeat) { -// output = false; -// break; -// } -// } -// adapt->mesh->setPoint(vertToCollapse, 0, prev); -// return output; -// } - - bool Collapse::isValid() { Vector prev = getPosition(adapt->mesh, vertToCollapse); From 23df81c062311ac5aca19bcc5ab34eae3ef6a97e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 13:24:23 -0400 Subject: [PATCH 237/319] check valid earlier --- ma/maCollapse.cc | 15 +++++++++------ 1 file changed, 9 insertions(+), 6 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 333c1329b..19b68879f 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -392,7 +392,7 @@ void Collapse::computeElementSets() APF_ITERATE(Upward,adjacent,it) if ( ! elementsToCollapse.count(*it)) elementsToKeep.insert(*it); - PCU_ALWAYS_ASSERT(elementsToKeep.size()); + // PCU_ALWAYS_ASSERT(elementsToKeep.size()); TODO: change computeElementSets to bool function that fails when this is false } void Collapse::rebuildElements() @@ -518,12 +518,15 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) if (!collapse.setEdge(edge)) return false; if (!collapse.checkClass()) return false; if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } - if (!collapse.checkTopo()) return false; + collapse.vertToCollapse = vert; + collapse.vertToKeep = getEdgeVertOppositeVert(adapt->mesh, edge, vert); + collapse.computeElementSets(); + if (collapse.elementsToKeep.size() == 0) { collapse.unmark(); return false; } + if (!collapse.isValid()) { collapse.unmark(); return false; } + + if (!checkEdgeCollapseTopology(adapt, edge)) { collapse.unmark(); return false; } if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } - if (collapse.vertToCollapse != vert) - std::swap(collapse.vertToCollapse, collapse.vertToKeep); PCU_ALWAYS_ASSERT(collapse.vertToCollapse == vert); - collapse.computeElementSets(); double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality : adapt->input->goodQuality; @@ -531,7 +534,7 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); - if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { + if (collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false; } From 757eecbed33a33a8e8c49d343d51efde9c0d2946 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 16:09:23 -0400 Subject: [PATCH 238/319] collapse edge --- ma/maCollapse.cc | 27 +++++++++++++++++++++++++++ ma/maCollapse.h | 1 + 2 files changed, 28 insertions(+) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 19b68879f..86201e5aa 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -510,6 +510,33 @@ bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex) return isRequiredForAnEdgeCollapse(adapt, vertex); } +bool collapseEdge(Collapse& collapse, Entity* edge) +{ + Adapt* adapt = collapse.adapt; + PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); + if (!collapse.setEdge(edge)) return false; + if (!collapse.checkClass()) return false; + if (!collapse.checkTopo()) return false; + + double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality + : adapt->input->goodQuality; + if (!adapt->input->shouldForceAdaptation) + qualityToBeat = std::min(adapt->input->goodQuality, + std::max(collapse.getOldQuality(),adapt->input->validQuality)); + + collapse.computeElementSets(); + if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { + if (!getFlag(adapt,collapse.vertToKeep,COLLAPSE)) { collapse.unmark(); return false; } + std::swap(collapse.vertToKeep,collapse.vertToCollapse); + computeElementSets(); + if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false; } + } + + collapse.rebuildElements(); + collapse.fitElements(); + return true; +} + bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) { Adapt* adapt = collapse.adapt; diff --git a/ma/maCollapse.h b/ma/maCollapse.h index add7976fb..b6f85e4d3 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -60,6 +60,7 @@ bool checkEdgeCollapseTopology(Adapt* a, Entity* edge); bool isRequiredForAnEdgeCollapse(Adapt* adapt, Entity* vertex); bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex); bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert); +bool collapseEdge(Collapse& collapse, Entity* edge); bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert); } From d299be026aeaa0d1cc2e1e5290b26b6d4d61fb3c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 18:12:58 -0400 Subject: [PATCH 239/319] added quality to collapse --- ma/maCoarsen.cc | 11 +++++++++-- ma/maCollapse.cc | 10 +++------- ma/maCollapse.h | 4 ++-- 3 files changed, 14 insertions(+), 11 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 7de3c711c..cd076bfa5 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -335,6 +335,10 @@ struct EdgeLength */ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, size_t& checked, apf::Up& adjacent, Tag* lengthTag) { + double qualityToBeat = a->input->shouldForceAdaptation ? a->input->validQuality + : a->input->goodQuality; + + Entity* vertex = *itr; std::vector sorted; for (int i=0; i < adjacent.n; i++) { @@ -349,7 +353,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdg } std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { - if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex)) continue; + if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; flagIndependentSet(a, adjacent, checked); itr = shortEdgeVerts.erase(itr); collapse.destroyOldElements(); @@ -471,6 +475,9 @@ void flagIndependentSet(Adapt* a, apf::Up& adjacent) */ bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adjacent, Tag* lengthTag) { + double qualityToBeat = a->input->shouldForceAdaptation ? a->input->validQuality + : a->input->goodQuality; + std::vector sorted; for (int i=0; i < adjacent.n; i++) { double length = getLength(a, lengthTag, adjacent.e[i]); @@ -480,7 +487,7 @@ bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adj } std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { - if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex)) continue; + if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; flagIndependentSet(a, adjacent); collapse.destroyOldElements(); return true; diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 86201e5aa..f04309e59 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -510,7 +510,7 @@ bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex) return isRequiredForAnEdgeCollapse(adapt, vertex); } -bool collapseEdge(Collapse& collapse, Entity* edge) +bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) { Adapt* adapt = collapse.adapt; PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); @@ -518,8 +518,6 @@ bool collapseEdge(Collapse& collapse, Entity* edge) if (!collapse.checkClass()) return false; if (!collapse.checkTopo()) return false; - double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality - : adapt->input->goodQuality; if (!adapt->input->shouldForceAdaptation) qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); @@ -528,7 +526,7 @@ bool collapseEdge(Collapse& collapse, Entity* edge) if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { if (!getFlag(adapt,collapse.vertToKeep,COLLAPSE)) { collapse.unmark(); return false; } std::swap(collapse.vertToKeep,collapse.vertToCollapse); - computeElementSets(); + collapse.computeElementSets(); if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false; } } @@ -537,7 +535,7 @@ bool collapseEdge(Collapse& collapse, Entity* edge) return true; } -bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) +bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double qualityToBeat) { Adapt* adapt = collapse.adapt; PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); @@ -555,8 +553,6 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert) if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } PCU_ALWAYS_ASSERT(collapse.vertToCollapse == vert); - double qualityToBeat = adapt->input->shouldForceAdaptation ? adapt->input->validQuality - : adapt->input->goodQuality; if (!adapt->input->shouldForceAdaptation) qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); diff --git a/ma/maCollapse.h b/ma/maCollapse.h index b6f85e4d3..f7b7dedf2 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -59,8 +59,8 @@ class Collapse bool checkEdgeCollapseTopology(Adapt* a, Entity* edge); bool isRequiredForAnEdgeCollapse(Adapt* adapt, Entity* vertex); bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex); -bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert); -bool collapseEdge(Collapse& collapse, Entity* edge); +bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double qualityToBeat); +bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat); bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert); } From 35168e5353dc39959b8a8fec8901559c375d197b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 18:31:32 -0400 Subject: [PATCH 240/319] clear collapse flag --- ma/maCollapse.cc | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index f04309e59..1aa250fe5 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -545,6 +545,7 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double q if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } collapse.vertToCollapse = vert; collapse.vertToKeep = getEdgeVertOppositeVert(adapt->mesh, edge, vert); + clearFlag(adapt, collapse.vertToKeep, COLLAPSE); collapse.computeElementSets(); if (collapse.elementsToKeep.size() == 0) { collapse.unmark(); return false; } if (!collapse.isValid()) { collapse.unmark(); return false; } @@ -557,10 +558,7 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double q qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); - if (collapse.anyWorseQuality(qualityToBeat)) { - collapse.unmark(); - return false; - } + if (collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false;} collapse.rebuildElements(); collapse.fitElements(); From 3b9a5582cf8f26c562bb44ff1d2c965b83fa5d63 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 21:52:56 -0400 Subject: [PATCH 241/319] temp code for testing --- ma/maCoarsen.cc | 23 +++++++++++++++++++++++ ma/maCollapse.cc | 2 +- 2 files changed, 24 insertions(+), 1 deletion(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index cd076bfa5..1ebc7d3a1 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -60,6 +60,27 @@ bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent } return true; } + +bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) +{ + PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); + bool alreadyFlagged = true; + if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); + + double quality = a->input->shouldForceAdaptation ? a->input->validQuality + : a->input->goodQuality; + + bool result = false; + if (collapse.setEdge(edge) && + collapse.checkClass() && + collapse.checkTopo() && + collapse.tryBothDirections(quality)) { + result = true; + } + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + return result; +} } class CollapseChecker : public apf::CavityOp @@ -487,6 +508,8 @@ bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adj } std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { + // Entity* opposite = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); + // if (!tryCollapseEdge(a, sorted[i].edge, opposite, collapse, adjacent)) continue; if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; flagIndependentSet(a, adjacent); collapse.destroyOldElements(); diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 1aa250fe5..15080519c 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -518,11 +518,11 @@ bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) if (!collapse.checkClass()) return false; if (!collapse.checkTopo()) return false; + collapse.computeElementSets(); if (!adapt->input->shouldForceAdaptation) qualityToBeat = std::min(adapt->input->goodQuality, std::max(collapse.getOldQuality(),adapt->input->validQuality)); - collapse.computeElementSets(); if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { if (!getFlag(adapt,collapse.vertToKeep,COLLAPSE)) { collapse.unmark(); return false; } std::swap(collapse.vertToKeep,collapse.vertToCollapse); From f76664ab4580200514be47673f4bdfec6f540da9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 22:17:01 -0400 Subject: [PATCH 242/319] coarsen all --- ma/maCoarsen.cc | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 1ebc7d3a1..1001d2353 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -483,8 +483,8 @@ void flagIndependentSet(Adapt* a, apf::Up& adjacent) a->mesh->getDownward(adjacent.e[adj],0, vertices); for (int v = 0; v < 2; v++) { setFlag(a, vertices[v], NEED_NOT_COLLAPSE); - // if (getFlag(a, vertices[v], CHECKED)) - // clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set + if (getFlag(a, vertices[v], CHECKED)) + clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set } } } @@ -534,13 +534,12 @@ void coarsenOnce(Adapt* a) success = 0; for (auto it = shortEdgeVerts.begin(); it != shortEdgeVerts.end();) { Entity* vertex = *it; - if (getFlag(a, vertex, CHECKED)) {it = shortEdgeVerts.erase(it); continue;} + if (getFlag(a, vertex, CHECKED)) {++it; continue;} if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {++it; continue;} apf::Up adjacent; a->mesh->getUp(vertex, adjacent); - if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) success++; + if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) {it = shortEdgeVerts.erase(it); success++;} else setFlag(a, vertex, CHECKED); - it = shortEdgeVerts.erase(it); } ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); totalSuccess += success; From 42b454362fb320f59b651f5fd66f332ead3f3b8c Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 9 Oct 2025 23:16:12 -0400 Subject: [PATCH 243/319] print bad shape surface --- ma/maShapeNew.cc | 14 +++++++++++++- 1 file changed, 13 insertions(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index c49da1255..c2306bc3a 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -404,7 +404,6 @@ class FixShape : public Operator void printBadShape(Entity* tet) { - apf::writeVtkFiles("shape_mesh", a->mesh); EntitySet bad; bad.insert(tet); ma_dbg::createCavityMesh(a, bad, "shape_worst"); @@ -412,6 +411,19 @@ class FixShape : public Operator ma_dbg::createCavityMesh(a, adjacent1, "shape_adjacent_1"); EntitySet adjacent2 = getNextLayer(a, adjacent1); ma_dbg::createCavityMesh(a, adjacent2, "shape_adjacent_2"); + + EntitySet badFaces; + Iterator* it = a->mesh->begin(3); + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + Entity* faces[4]; + mesh->getDownward(tet, 2, faces); + for (Entity* face : faces) + if (mesh->getModelType(mesh->toModel(face)) == 2) + badFaces.insert(face); + } + ma_dbg::createCavityMesh(a, badFaces, "shape_bad_surface"); + apf::writeVtkFiles("shape_mesh", a->mesh); } void printNumTypes() From 0dbba4d8b982c88e504c0dc2161778cb5945a350 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 15 Oct 2025 18:01:20 -0400 Subject: [PATCH 244/319] print bad faces --- ma/maShapeNew.cc | 9 ++++----- 1 file changed, 4 insertions(+), 5 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index c2306bc3a..aa5a1c3b4 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -412,7 +412,6 @@ class FixShape : public Operator EntitySet adjacent2 = getNextLayer(a, adjacent1); ma_dbg::createCavityMesh(a, adjacent2, "shape_adjacent_2"); - EntitySet badFaces; Iterator* it = a->mesh->begin(3); while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; @@ -420,10 +419,10 @@ class FixShape : public Operator mesh->getDownward(tet, 2, faces); for (Entity* face : faces) if (mesh->getModelType(mesh->toModel(face)) == 2) - badFaces.insert(face); + setFlag(a, face, CHECKED); } - ma_dbg::createCavityMesh(a, badFaces, "shape_bad_surface"); - apf::writeVtkFiles("shape_mesh", a->mesh); + ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "shape_bad_faces", "shape_bad_faces"); + // apf::writeVtkFiles("shape_mesh", a->mesh); } void printNumTypes() @@ -452,7 +451,7 @@ class FixShape : public Operator numThreeLargeAngles++; } printBadTypes(); - // printBadShape(worstShape); + printBadShape(worstShape); } }; From a191a662efd504e3b0c8f300ac5021edd7c7c636 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 15 Oct 2025 20:35:53 -0400 Subject: [PATCH 245/319] collapse all class --- ma/maCoarsen.cc | 262 +++++++++++++++------------------------------ test/aniso_adapt.h | 4 +- 2 files changed, 87 insertions(+), 179 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 1001d2353..3f0d637f9 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -320,101 +320,7 @@ bool coarsen(Adapt* a) return true; } -/* - To be used after collapsing a vertex to flag adjacent vertices as NEED_NOT_COLLAPSE. This will create a - set of collapses where no two adjacent are vertices collapsed. Will also clear adjacent vertices for - collapse in next independent set since they might succeed after a collapse. -*/ -void flagIndependentSet(Adapt* a, apf::Up& adjacent, size_t& checked) -{ - for (int adj=0; adj < adjacent.n; adj++) { - Entity* vertices[2]; - a->mesh->getDownward(adjacent.e[adj],0, vertices); - for (int v = 0; v < 2; v++) { - setFlag(a, vertices[v], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[v], CHECKED)){ - clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set - checked--; - } - } - } -} - -struct EdgeLength -{ - Entity* edge; - double length; - bool operator<(const EdgeLength& other) const { - return length < other.length; - } -}; - -/* - Given an iterator pointing to a vertex we will collapse the shortest adjacent edge and try the next - shorted until one succeeds and then it will expand independent set. In Li's thesis it only attempts - to collapse the shortest edge, but this gave us better results. -*/ -bool collapseShortest(Adapt* a, Collapse& collapse, std::list& shortEdgeVerts, std::list::iterator& itr, size_t& checked, apf::Up& adjacent, Tag* lengthTag) -{ - double qualityToBeat = a->input->shouldForceAdaptation ? a->input->validQuality - : a->input->goodQuality; - - - Entity* vertex = *itr; - std::vector sorted; - for (int i=0; i < adjacent.n; i++) { - double length = getLength(a, lengthTag, adjacent.e[i]); - EdgeLength measured{adjacent.e[i], length}; - if (measured.length > MINLENGTH) continue; - sorted.push_back(measured); - } - if (sorted.size() == 0) { //performance optimization, will rarely result in a missed edge - itr = shortEdgeVerts.erase(itr); - return false; - } - std::sort(sorted.begin(), sorted.end()); - for (size_t i=0; i < sorted.size(); i++) { - if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; - flagIndependentSet(a, adjacent, checked); - itr = shortEdgeVerts.erase(itr); - collapse.destroyOldElements(); - return true; - } - setFlag(a, vertex, CHECKED); - checked++; - return false; -} - -/* - Iterates through shortEdgeVerts until it finds a vertex that is adjacent to an - independent set. We want our collapses to touch the independent set in order to - reduce adjacent collapses, since collapsing adjacent vertices will result in a - lower quality mesh. -*/ -bool getAdjIndependentSet(Adapt* a, std::list& shortEdgeVerts, std::list::iterator& itr, bool& independentSetStarted, apf::Up& adjacent) -{ - size_t numItr=0; - do { - numItr++; - if (itr == shortEdgeVerts.end()) itr = shortEdgeVerts.begin(); - Entity* vertex = *itr; - if (getFlag(a, vertex, CHECKED)) {itr++; continue;} //Already tried to collapse - a->mesh->getUp(vertex, adjacent); - if (!independentSetStarted) return true; - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {itr++; continue;} //Too close to last collapse - for (int i=0; i < adjacent.n; i++) - { - Entity* opposite = getEdgeVertOppositeVert(a->mesh, adjacent.e[i], vertex); - if (getFlag(a, opposite, NEED_NOT_COLLAPSE)) return true; //Touching independent set - } - itr++; - } while (numItr < shortEdgeVerts.size()); - for (auto v : shortEdgeVerts) clearFlag(a, v, NEED_NOT_COLLAPSE); - independentSetStarted = false; - return false; -} - -//returns a list of vertices that bound a short edge and flags them +//returns a list of vertices that bound a short edge std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) { std::list shortEdgeVerts; @@ -437,100 +343,90 @@ std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) return shortEdgeVerts; } -/* - Follows the alogritm in Li's thesis in order to coarsen all short edges - in a mesh while maintaining a decent quality mesh. -*/ -bool coarsenMultiple(Adapt* a) +class CollapseAll { - if (!a->input->shouldCoarsen) - return false; - double t0 = pcu::Time(); - Tag* lengthTag = a->mesh->createDoubleTag("edge_length", 1); - std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); - + public: + Adapt* a; + Tag* lengthTag; Collapse collapse; - collapse.Init(a); - int success = 0; - size_t checked = 0; - bool independentSetStarted = false; - std::list::iterator itr = shortEdgeVerts.begin(); - while (checked < shortEdgeVerts.size()) + std::list shortEdgeVerts; + + int success=0; + + CollapseAll(Adapt* adapt) { - apf::Up adjacent; - if (!getAdjIndependentSet(a, shortEdgeVerts, itr, independentSetStarted, adjacent)) continue; - if (collapseShortest(a, collapse, shortEdgeVerts, itr, checked, adjacent, lengthTag)) { - independentSetStarted=true; - success++; - } + a = adapt; + collapse.Init(a); + lengthTag = a->mesh->createDoubleTag("edge_length", 1); + shortEdgeVerts = getShortEdgeVerts(a, lengthTag); } - ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE | CHECKED, 0); - a->mesh->destroyTag(lengthTag); - double t1 = pcu::Time(); - print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", success, t1-t0); - return true; -} -/* + ~CollapseAll() + { + ma::clearFlagFromDimension(a, CHECKED, 0); + a->mesh->destroyTag(lengthTag); + } + + void resetIndependentSet() { ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); } + + /* To be used after collapsing a vertex to flag adjacent vertices as NEED_NOT_COLLAPSE. This will create a set of collapses where no two adjacent are vertices collapsed. Will also clear adjacent vertices for collapse in next independent set since they might succeed after a collapse. -*/ -void flagIndependentSet(Adapt* a, apf::Up& adjacent) -{ - for (int adj=0; adj < adjacent.n; adj++) { - Entity* vertices[2]; - a->mesh->getDownward(adjacent.e[adj],0, vertices); - for (int v = 0; v < 2; v++) { - setFlag(a, vertices[v], NEED_NOT_COLLAPSE); - if (getFlag(a, vertices[v], CHECKED)) - clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set + */ + void flagIndependentSet(apf::Up& adjacent) + { + for (int adj=0; adj < adjacent.n; adj++) { + Entity* vertices[2]; + a->mesh->getDownward(adjacent.e[adj],0, vertices); + for (int v = 0; v < 2; v++) { + setFlag(a, vertices[v], NEED_NOT_COLLAPSE); + if (getFlag(a, vertices[v], CHECKED)) + clearFlag(a, vertices[v], CHECKED); //needs to be checked again in next independent set + } } } -} -/* + struct EdgeLength + { + Entity* edge; + double length; + bool operator<(const EdgeLength& other) const { + return length < other.length; + } + }; + + /* Given an iterator pointing to a vertex we will collapse the shortest adjacent edge and try the next shorted until one succeeds and then it will expand independent set. In Li's thesis it only attempts to collapse the shortest edge, but this gave us better results. -*/ -bool collapseShortest(Adapt* a, Collapse& collapse, Entity* vertex, apf::Up& adjacent, Tag* lengthTag) -{ - double qualityToBeat = a->input->shouldForceAdaptation ? a->input->validQuality - : a->input->goodQuality; - - std::vector sorted; - for (int i=0; i < adjacent.n; i++) { - double length = getLength(a, lengthTag, adjacent.e[i]); - EdgeLength measured{adjacent.e[i], length}; - if (measured.length > MINLENGTH) continue; - sorted.push_back(measured); - } - std::sort(sorted.begin(), sorted.end()); - for (size_t i=0; i < sorted.size(); i++) { - // Entity* opposite = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); - // if (!tryCollapseEdge(a, sorted[i].edge, opposite, collapse, adjacent)) continue; - if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; - flagIndependentSet(a, adjacent); - collapse.destroyOldElements(); - return true; + */ + bool collapseShortest(Entity* vertex, apf::Up& adjacent) + { + double qualityToBeat = a->input->shouldForceAdaptation ? a->input->validQuality + : a->input->goodQuality; + + std::vector sorted; + for (int i=0; i < adjacent.n; i++) { + double length = getLength(a, lengthTag, adjacent.e[i]); + EdgeLength measured{adjacent.e[i], length}; + if (measured.length > MINLENGTH) continue; + sorted.push_back(measured); + } + std::sort(sorted.begin(), sorted.end()); + for (size_t i=0; i < sorted.size(); i++) { + // Entity* opposite = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); + // if (!tryCollapseEdge(a, sorted[i].edge, opposite, collapse, adjacent)) continue; + if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; + flagIndependentSet(adjacent); + collapse.destroyOldElements(); + return true; + } + return false; } - return false; -} -void coarsenOnce(Adapt* a) -{ - if (!a->input->shouldCoarsen) - return; - double t0 = pcu::Time(); - Tag* lengthTag = a->mesh->createDoubleTag("edge_length", 1); - Collapse collapse; - collapse.Init(a); - int totalSuccess = 0; - int success = 0; - int counter = 0; - std::list shortEdgeVerts = getShortEdgeVerts(a, lengthTag); - do { + int collapseOneSet() + { success = 0; for (auto it = shortEdgeVerts.begin(); it != shortEdgeVerts.end();) { Entity* vertex = *it; @@ -538,15 +434,27 @@ void coarsenOnce(Adapt* a) if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {++it; continue;} apf::Up adjacent; a->mesh->getUp(vertex, adjacent); - if (collapseShortest(a, collapse, vertex, adjacent, lengthTag)) {it = shortEdgeVerts.erase(it); success++;} + if (collapseShortest(vertex, adjacent)) {it = shortEdgeVerts.erase(it); success++;} else setFlag(a, vertex, CHECKED); } - ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); + return success; + } +}; + +void coarsenOnce(Adapt* a) +{ + if (!a->input->shouldCoarsen) + return; + double t0 = pcu::Time(); + CollapseAll collapseAll(a); + int totalSuccess = 0; + int success = 0; + do { + success = collapseAll.collapseOneSet(); + collapseAll.resetIndependentSet(); totalSuccess += success; } while (success > 0); - ma::clearFlagFromDimension(a, CHECKED, 0); - a->mesh->destroyTag(lengthTag); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", totalSuccess, t1-t0); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index a4838722f..0376de7f7 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -90,7 +90,7 @@ ma::Mesh* coarsenForced(ma::Mesh* m) double averageBefore = ma::getAverageEdgeLength(m); int edgesBefore = countEdges(m); - ma::coarsenMultiple(a); + // ma::coarsenMultiple(a); measureQuality(m, avgQualAfter, minQualAfter); @@ -122,7 +122,7 @@ ma::Mesh* coarsenRegular(ma::Mesh* m) double averageBefore = ma::getAverageEdgeLength(m); int edgesBefore = countEdges(m); - ma::coarsenMultiple(a); + // ma::coarsenMultiple(a); measureQuality(m, avgQualAfter, minQualAfter); From 36be24b4e94e3e06171a2a7de47810c5f172aca3 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 16 Oct 2025 16:11:36 -0400 Subject: [PATCH 246/319] using apply to list --- apf/apfCavityOp.cc | 31 ++++++++++++------------------- apf/apfCavityOp.h | 7 ++++--- ma/maCoarsen.cc | 42 ++++++++++++++++++++++++------------------ 3 files changed, 40 insertions(+), 40 deletions(-) diff --git a/apf/apfCavityOp.cc b/apf/apfCavityOp.cc index 99f141c45..3236a3909 100644 --- a/apf/apfCavityOp.cc +++ b/apf/apfCavityOp.cc @@ -119,41 +119,34 @@ void CavityOp::applyToDimension(int d) sharing = 0; } -void CavityOp::iterateDimension(int d, std::function getLocality, - std::function modifyMesh) +void CavityOp::applyToList(std::list& elements) { do { delete sharing; sharing = apf::getSharing(mesh); - Mesh2* mesh2 = static_cast(mesh); - MeshEntity* e; isRequesting = false; - iterator = mesh->begin(d); - while ((e = mesh->iterate(iterator))) { - if (sharing->isOwned(e)) { - if (getLocality(e) == OK) { - movedByDeletion = false; - modifyMesh(e); - if (movedByDeletion) - continue; + for (auto iter = elements.begin(); iter != elements.end();) { + if (sharing->isOwned(*iter)) { + if (setEntity(*iter) == OK) { + movedByDeletion=false; + apply(); + if (movedByDeletion) {iter = elements.erase(iter); continue;} } } - mesh2->increment(iterator); + ++iter; } - mesh2->end(iterator); /* request any non-local cavities. note: it is critical that this loop be separated from the one above for mesh-modifying operators, since an apply() call could change other overlapping cavities */ isRequesting = true; - iterator = mesh2->begin(d); - while ((e = mesh2->iterate(iterator))) { - if (!sharing->isOwned(e)) continue; - getLocality(e); + for (auto iter = elements.begin(); iter != elements.end();) { + if (sharing->isOwned(*iter)) + setEntity(*iter); + ++iter; } - mesh2->end(iterator); } while (tryToPull()); delete sharing; diff --git a/apf/apfCavityOp.h b/apf/apfCavityOp.h index 61766a88e..f9934a80a 100644 --- a/apf/apfCavityOp.h +++ b/apf/apfCavityOp.h @@ -15,6 +15,7 @@ #include #include #include +#include namespace apf { @@ -88,12 +89,15 @@ class CavityOp virtual void apply() = 0; /** \brief parallel collective operation over entities of one dimension */ void applyToDimension(int d); + /** \brief parallel collective operation over entities in list */ + void applyToList(std::list& elements); /** \brief within setEntity, require that entities be made local */ bool requestLocality(MeshEntity** entities, int count); /** \brief call before deleting a mesh entity during the operation */ void preDeletion(MeshEntity* e); /** \brief mesh pointer for convenience */ Mesh* mesh; + bool movedByDeletion; private: typedef std::vector Requests; Requests requests; @@ -103,11 +107,8 @@ class CavityOp bool tryToPull(); void applyLocallyWithModification(int d); void applyLocallyWithoutModification(int d); - void iterateDimension(int d, std::function checkValidity, - std::function modifyMesh); bool canModify; - bool movedByDeletion; MeshIterator* iterator; protected: Sharing* sharing; diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 3f0d637f9..9286d74df 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -343,17 +343,18 @@ std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) return shortEdgeVerts; } -class CollapseAll +class CollapseAll : public apf::CavityOp, public DeleteCallback { public: Adapt* a; + Entity* vertex; Tag* lengthTag; Collapse collapse; std::list shortEdgeVerts; int success=0; - CollapseAll(Adapt* adapt) + CollapseAll(Adapt* adapt) : apf::CavityOp(adapt->mesh,true), DeleteCallback(adapt) { a = adapt; collapse.Init(a); @@ -367,6 +368,8 @@ class CollapseAll a->mesh->destroyTag(lengthTag); } + int getTargetDimension() { return 0; } + void call(Entity* e) { movedByDeletion = true; } void resetIndependentSet() { ma::clearFlagFromDimension(a, NEED_NOT_COLLAPSE, 0); } /* @@ -425,19 +428,22 @@ class CollapseAll return false; } - int collapseOneSet() + Outcome setEntity(Entity* vert) { - success = 0; - for (auto it = shortEdgeVerts.begin(); it != shortEdgeVerts.end();) { - Entity* vertex = *it; - if (getFlag(a, vertex, CHECKED)) {++it; continue;} - if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) {++it; continue;} - apf::Up adjacent; - a->mesh->getUp(vertex, adjacent); - if (collapseShortest(vertex, adjacent)) {it = shortEdgeVerts.erase(it); success++;} - else setFlag(a, vertex, CHECKED); - } - return success; + vertex = vert; + if (getFlag(a, vertex, CHECKED)) return SKIP; + if (getFlag(a, vertex, NEED_NOT_COLLAPSE)) return SKIP; + if (!requestLocality(&vertex, 1)) + return REQUEST; + return OK; + } + + void apply() + { + apf::Up adjacent; + a->mesh->getUp(vertex, adjacent); + setFlag(a, vertex, CHECKED); + if (collapseShortest(vertex, adjacent)) success++; } }; @@ -448,12 +454,12 @@ void coarsenOnce(Adapt* a) double t0 = pcu::Time(); CollapseAll collapseAll(a); int totalSuccess = 0; - int success = 0; do { - success = collapseAll.collapseOneSet(); + collapseAll.success = 0; + collapseAll.applyToList(collapseAll.shortEdgeVerts); collapseAll.resetIndependentSet(); - totalSuccess += success; - } while (success > 0); + totalSuccess += collapseAll.success; + } while (collapseAll.success > 0); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", totalSuccess, t1-t0); From 977e18c9e0d25cba6d443aecaa0d9e529d26e26a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 16 Oct 2025 16:50:00 -0400 Subject: [PATCH 247/319] parallel coarsen tested and working --- ma/maCoarsen.cc | 6 ++++-- ma/maCollapse.cc | 4 ++-- 2 files changed, 6 insertions(+), 4 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 9286d74df..3c964eb23 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -454,12 +454,14 @@ void coarsenOnce(Adapt* a) double t0 = pcu::Time(); CollapseAll collapseAll(a); int totalSuccess = 0; + int success = 0; do { collapseAll.success = 0; collapseAll.applyToList(collapseAll.shortEdgeVerts); collapseAll.resetIndependentSet(); - totalSuccess += collapseAll.success; - } while (collapseAll.success > 0); + success = a->mesh->getPCU()->Add(collapseAll.success); + totalSuccess += success; + } while (success > 0); double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", totalSuccess, t1-t0); diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 15080519c..b8fa053de 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -187,9 +187,9 @@ bool checkEdgeCollapseEdgeRings(Adapt* a, Entity* edge) Mesh* m = a->mesh; Entity* v[2]; m->getDownward(edge,0,v); - if (!getFlag(a, v[0], DONT_COLLAPSE)) //Allow collapse in one direction + if (getFlag(a, v[0], COLLAPSE)) //Allow collapse in one direction PCU_ALWAYS_ASSERT( ! m->isShared(v[0])); - if (!getFlag(a, v[1], DONT_COLLAPSE)) //Allow collapse in one direction + if (getFlag(a, v[1], COLLAPSE)) //Allow collapse in one direction PCU_ALWAYS_ASSERT( ! m->isShared(v[1])); apf::Up ve[2]; m->getUp(v[0],ve[0]); From e485808921603eef02dc26fa7e566b6b6859c9fd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 17 Oct 2025 12:36:56 -0400 Subject: [PATCH 248/319] print worst shape type --- ma/maShapeNew.cc | 7 +++++++ 1 file changed, 7 insertions(+) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index aa5a1c3b4..3d67439ad 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -404,6 +404,13 @@ class FixShape : public Operator void printBadShape(Entity* tet) { + Entity* worst; + Entity* problemEnts[4]; + if (isShortEdge(tet)) print(a->mesh->getPCU(), "Worst is short\n"); + else if (isOneLargeAngle(tet, worst)) print(a->mesh->getPCU(), "Worst is one large angle\n"); + else if (isTwoLargeAngles(tet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); + else print(a->mesh->getPCU(), "Worst is three large angles\n"); + EntitySet bad; bad.insert(tet); ma_dbg::createCavityMesh(a, bad, "shape_worst"); From 4379f554eb47b492a0cc4bbb9d9bf646d5daae80 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sun, 19 Oct 2025 16:29:38 -0400 Subject: [PATCH 249/319] better print bad shape --- ma/maShapeNew.cc | 40 ++++++++++++++++++++++++++++++---------- 1 file changed, 30 insertions(+), 10 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 3d67439ad..41b5292b3 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -402,24 +402,43 @@ class FixShape : public Operator return true; } - void printBadShape(Entity* tet) + void printBadShape(Entity* badTet) { Entity* worst; Entity* problemEnts[4]; - if (isShortEdge(tet)) print(a->mesh->getPCU(), "Worst is short\n"); - else if (isOneLargeAngle(tet, worst)) print(a->mesh->getPCU(), "Worst is one large angle\n"); - else if (isTwoLargeAngles(tet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); + if (isShortEdge(badTet)) print(a->mesh->getPCU(), "Worst is short\n"); + else if (isOneLargeAngle(badTet, worst)) print(a->mesh->getPCU(), "Worst is one large angle\n"); + else if (isTwoLargeAngles(badTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); else print(a->mesh->getPCU(), "Worst is three large angles\n"); + ma_dbg::addClassification(a, "classification"); + EntitySet bad; - bad.insert(tet); - ma_dbg::createCavityMesh(a, bad, "shape_worst"); + bad.insert(badTet); EntitySet adjacent1 = getNextLayer(a, bad); - ma_dbg::createCavityMesh(a, adjacent1, "shape_adjacent_1"); EntitySet adjacent2 = getNextLayer(a, adjacent1); - ma_dbg::createCavityMesh(a, adjacent2, "shape_adjacent_2"); - + apf::Field* worstTet = apf::createField(mesh, "worstTet", apf::SCALAR, apf::getConstant(3)); + apf::Field* worstVert = apf::createFieldOn(mesh, "worstVert", apf::SCALAR); Iterator* it = a->mesh->begin(3); + Entity* tet; + while ((tet = a->mesh->iterate(it))) { + double zero = 0.0; + apf::setComponents(worstTet, tet, 0, &zero); + Entity* verts[4]; + mesh->getDownward(tet, 0, verts); + for (Entity* vert : verts) apf::setComponents(worstVert, vert, 0, &zero); + } + for (Entity* shape : adjacent2) { + double adj = 3.0; + if (bad.count(shape)) adj = 1.0; + else if (adjacent1.count(shape)) adj = 2.0; + apf::setComponents(worstTet, shape, 0, &adj); + Entity* verts[4]; + mesh->getDownward(shape, 0, verts); + for (Entity* vert : verts) apf::setComponents(worstVert, vert, 0, &adj); + } + + it = a->mesh->begin(3); while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; Entity* faces[4]; @@ -429,7 +448,8 @@ class FixShape : public Operator setFlag(a, face, CHECKED); } ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "shape_bad_faces", "shape_bad_faces"); - // apf::writeVtkFiles("shape_mesh", a->mesh); + apf::writeVtkFiles("shape_mesh_verts", a->mesh, 0); + apf::writeVtkFiles("shape_mesh_tets", a->mesh); } void printNumTypes() From 28bbabcd7669a491567cfcea67c4d5cda0a7a47b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Mon, 20 Oct 2025 00:26:36 -0400 Subject: [PATCH 250/319] better reposition dir --- ma/ma.cc | 1 + ma/maShapeNew.cc | 19 ++++++++++++++++--- 2 files changed, 17 insertions(+), 3 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index f4c994792..a933fd111 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -31,6 +31,7 @@ void printHistogramData(std::string name, std::vector input, double min, double inputMin = max; for (size_t i = 0; i < input.size(); ++i) { + if (std::isnan(input[i])) continue; if (input[i] > inputMax) inputMax = input[i]; if (input[i] < inputMin) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 41b5292b3..18c96a27b 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -168,6 +168,19 @@ class FixShape : public Operator return worstQuality; } + Vector avgCavityPos(Entity* vert) + { + apf::Up edges; + mesh->getUp(vert, edges); + Vector avg(0,0,0); + for (int i=0; i prevWorstQuality) { prevWorstQuality = worstQuality; prevPos = getPosition(mesh, vert); - Vector dir = (prevPos - getLinearCentroid(mesh, worstShape)).normalize(); mesh->setPoint(vert, 0, prevPos + (dir * speed)); speed *= 2; } @@ -478,7 +491,7 @@ class FixShape : public Operator numThreeLargeAngles++; } printBadTypes(); - printBadShape(worstShape); + // printBadShape(worstShape); } }; From fb810f36b579b081c91d21a9604c21f2af80ecdd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 22 Oct 2025 15:34:35 -0400 Subject: [PATCH 251/319] unmark after collapse --- ma/maCollapse.cc | 2 ++ 1 file changed, 2 insertions(+) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index b8fa053de..870e5f14c 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -532,6 +532,7 @@ bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) collapse.rebuildElements(); collapse.fitElements(); + collapse.unmark(); return true; } @@ -562,6 +563,7 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double q collapse.rebuildElements(); collapse.fitElements(); + collapse.unmark(); return true; } From 0a4de89e3d39afce0a3b1d84a50f66f7277d9538 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 23 Oct 2025 18:18:10 -0400 Subject: [PATCH 252/319] better debug options --- ma/maCollapse.cc | 47 +++++++++++++++++++++++++++++++++++ ma/maDBG.cc | 64 ++++++++++++++++++++++++++++++++++++++---------- ma/maDBG.h | 8 +++--- ma/maShapeNew.cc | 2 +- ma/maSnapper.cc | 2 +- 5 files changed, 104 insertions(+), 19 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 870e5f14c..cce54f417 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -13,6 +13,8 @@ #include "maShapeHandler.h" #include #include +#include "apfGeometry.h" +#include "maDBG.h" namespace ma { @@ -536,6 +538,49 @@ bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) return true; } +static int DEBUG=0; + +void printCollapseInfo(Collapse& collapse, Entity* edge, Entity* vert) +{ + Adapt* adapt = collapse.adapt; + const Vector target(1502.327985, 375.402966, 174.096195); + Entity* found = 0; + for (Entity* shape : collapse.elementsToKeep) { + Entity* verts[4]; + adapt->mesh->getDownward(shape, 0, verts); + for (Entity* v : verts) { + Vector pos = getPosition(adapt->mesh, v); + if (apf::areClose(pos, target, 1e-5)) found = v; + } + } + + if (found && ++DEBUG == 4) { + ma_dbg::addClassification(adapt); + ma_dbg::flagEntity(adapt, 1, "edge_to_collapse", &edge, 1); + ma_dbg::flagEntity(adapt, 0, "vert_to_collapse", &vert, 1); + apf::Adjacent tets; + adapt->mesh->getAdjacent(vert, 3, tets); + + std::vector adjEdges; + for(int i=0; imesh->getDownward(tets[i], 1, edges); + for (Entity* e : edges) + adjEdges.push_back(e); + } + std::vector elemsToCollapse(collapse.elementsToCollapse.begin(), collapse.elementsToCollapse.end()); + ma_dbg::flagEntity(adapt, 3, "tets_to_collapse", &elemsToCollapse[0], elemsToCollapse.size()); + std::vector elemsToKeep(collapse.elementsToKeep.begin(), collapse.elementsToKeep.end()); + ma_dbg::flagEntity(adapt, 3, "tets_to_keep", &elemsToKeep[0], elemsToKeep.size()); + ma_dbg::flagEntity(adapt, 1, "adjacent_edge", &adjEdges[0], adjEdges.size()); + ma_dbg::flagEntity(adapt, 3, "adjacent_tets", &tets[0], tets.size()); + apf::writeVtkFiles("mesh_before_bad_collapse_3", adapt->mesh, 3); + apf::writeVtkFiles("mesh_before_bad_collapse_1", adapt->mesh, 1); + // apf::writeVtkFiles("mesh_before_bad_collapse_0", adapt->mesh, 0); + exit(0); + } +} + bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double qualityToBeat) { Adapt* adapt = collapse.adapt; @@ -561,6 +606,8 @@ bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double q if (collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false;} + // printCollapseInfo(collapse, edge, vert); + collapse.rebuildElements(); collapse.fitElements(); collapse.unmark(); diff --git a/ma/maDBG.cc b/ma/maDBG.cc index ed78f92df..abff0f976 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -46,23 +46,44 @@ void writeMesh(ma::Mesh* m, apf::writeVtkFiles(fileName, m, dim); } -void addClassification(ma::Adapt* a, - const char* fieldName) +apf::Field* getField(ma::Adapt* a, int dim, const char* fieldName) { - ma::Mesh* m = a->mesh; - apf::Field* field; - field = m->findField(fieldName); + apf::Field* field = a->mesh->findField(fieldName); if (field) apf::destroyField(field); + if (dim == 0) + field = apf::createFieldOn(a->mesh, fieldName, apf::SCALAR); + else + field = apf::createField(a->mesh, fieldName, apf::SCALAR, apf::getConstant(dim)); + return field; +} - field = apf::createFieldOn(m, fieldName, apf::SCALAR); - ma::Entity* ent; - ma::Iterator* it; - it = m->begin(0); - while ( (ent = m->iterate(it)) ){ - ma::Model* g = m->toModel(ent); - double modelDimension = (double)m->getModelType(g); - apf::setComponents(field, ent, 0, &modelDimension); +void addClassification(ma::Adapt* a) +{ + ma::Mesh* m = a->mesh; + apf::Field* fieldVert = getField(a, 0, "vert_classification"); + apf::Field* fieldEdge = getField(a, 1, "edge_classification"); + apf::Field* fieldFace = getField(a, 2, "face_classification"); + + ma::Entity* e; + ma::Iterator* it = m->begin(0); + while ((e = m->iterate(it))){ + double modelDimension = (double)m->getModelType(m->toModel(e)); + apf::setComponents(fieldVert, e, 0, &modelDimension); + } + m->end(it); + + it = m->begin(1); + while ((e = m->iterate(it))){ + double modelDimension = (double)m->getModelType(m->toModel(e)); + apf::setComponents(fieldEdge, e, 0, &modelDimension); + } + m->end(it); + + it = m->begin(2); + while ((e = m->iterate(it))){ + double modelDimension = (double)m->getModelType(m->toModel(e)); + apf::setComponents(fieldFace, e, 0, &modelDimension); } m->end(it); } @@ -116,6 +137,23 @@ void addParamCoords(ma::Adapt* a, m->end(it); } +void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entToFlag, int size) +{ + apf::Field* colorField = getField(a, dim, fieldName); + ma::Entity* entity; + ma::Iterator* it = a->mesh->begin(dim); + while ((entity = a->mesh->iterate(it))){ + double zero = 0.0; + apf::setComponents(colorField, entity, 0, &zero); + } + a->mesh->end(it); + + for (int i=0; i & vals, diff --git a/ma/maDBG.h b/ma/maDBG.h index 16a65d882..55cd8a575 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -25,10 +25,8 @@ void writeMesh(ma::Mesh* m, const char* prefix, const char* suffix); -/* Creates a field to contain the model classification for each vertex. Which can be - printed to a file using writeMesh() with dim=0. */ -void addClassification(ma::Adapt* a, - const char* fieldName); +/* Creates a field to contain the model classification for each entity*/ +void addClassification(ma::Adapt* a); void addTargetLocation(ma::Adapt* a, const char* fieldName); @@ -36,6 +34,8 @@ void addTargetLocation(ma::Adapt* a, void addParamCoords(ma::Adapt* a, const char* fieldName); +void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entToFlag, int size); + void colorEntitiesOfDimWithValues(ma::Adapt* a, int dim, const std::vector & quals, diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 18c96a27b..7fbf51439 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -424,7 +424,7 @@ class FixShape : public Operator else if (isTwoLargeAngles(badTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); else print(a->mesh->getPCU(), "Worst is three large angles\n"); - ma_dbg::addClassification(a, "classification"); + ma_dbg::addClassification(a); EntitySet bad; bad.insert(badTet); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 2b66c606c..c11edd941 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -86,7 +86,7 @@ static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) static void printFPP(Adapt* a, FirstProblemPlane* FPP) { ma_dbg::addTargetLocation(a, "snap_target"); - ma_dbg::addClassification(a, "classification"); + ma_dbg::addClassification(a); apf::writeVtkFiles("FPP_Mesh", a->mesh); EntitySet invalid; From b198c2a3717ba64d218c6e987671d46b47122a36 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 24 Oct 2025 15:51:06 -0400 Subject: [PATCH 253/319] improve print bad shape --- ma/maDBG.cc | 6 ++++++ ma/maDBG.h | 11 ++++++++++- ma/maQuality.cc | 1 + ma/maShapeNew.cc | 35 +++++++++++------------------------ 4 files changed, 28 insertions(+), 25 deletions(-) diff --git a/ma/maDBG.cc b/ma/maDBG.cc index abff0f976..165b8db01 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -137,6 +137,12 @@ void addParamCoords(ma::Adapt* a, m->end(it); } +void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::EntitySet toFlag) +{ + std::vector converted(toFlag.begin(), toFlag.end()); + flagEntity(a, dim, fieldName, &converted[0], converted.size()); +} + void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entToFlag, int size) { apf::Field* colorField = getField(a, dim, fieldName); diff --git a/ma/maDBG.h b/ma/maDBG.h index 55cd8a575..c60187411 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -34,7 +34,16 @@ void addTargetLocation(ma::Adapt* a, void addParamCoords(ma::Adapt* a, const char* fieldName); -void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entToFlag, int size); +void flagEntity(ma::Adapt* a, + int dim, + const char* fieldName, + ma::EntitySet toFlag); + +void flagEntity(ma::Adapt* a, + int dim, + const char* fieldName, + ma::Entity** entToFlag, + int size); void colorEntitiesOfDimWithValues(ma::Adapt* a, int dim, diff --git a/ma/maQuality.cc b/ma/maQuality.cc index 85f465116..a3221d51d 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -26,6 +26,7 @@ bool areTetsValid(Mesh* m, EntityArray& tets) size_t n = tets.getSize(); for (size_t i = 0; i < n; ++i){ ma::getVertPoints(m,tets[i],v); + // if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0.00001) if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) return false; } diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 7fbf51439..942414a79 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -430,39 +430,26 @@ class FixShape : public Operator bad.insert(badTet); EntitySet adjacent1 = getNextLayer(a, bad); EntitySet adjacent2 = getNextLayer(a, adjacent1); - apf::Field* worstTet = apf::createField(mesh, "worstTet", apf::SCALAR, apf::getConstant(3)); - apf::Field* worstVert = apf::createFieldOn(mesh, "worstVert", apf::SCALAR); + + ma_dbg::flagEntity(a, 3, "worst_tet", bad); + ma_dbg::flagEntity(a, 3, "worst_tet_adj", adjacent1); + ma_dbg::flagEntity(a, 3, "worst_tet_adj2", adjacent2); + + std::vector badFaces; Iterator* it = a->mesh->begin(3); Entity* tet; - while ((tet = a->mesh->iterate(it))) { - double zero = 0.0; - apf::setComponents(worstTet, tet, 0, &zero); - Entity* verts[4]; - mesh->getDownward(tet, 0, verts); - for (Entity* vert : verts) apf::setComponents(worstVert, vert, 0, &zero); - } - for (Entity* shape : adjacent2) { - double adj = 3.0; - if (bad.count(shape)) adj = 1.0; - else if (adjacent1.count(shape)) adj = 2.0; - apf::setComponents(worstTet, shape, 0, &adj); - Entity* verts[4]; - mesh->getDownward(shape, 0, verts); - for (Entity* vert : verts) apf::setComponents(worstVert, vert, 0, &adj); - } - - it = a->mesh->begin(3); while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; Entity* faces[4]; mesh->getDownward(tet, 2, faces); for (Entity* face : faces) if (mesh->getModelType(mesh->toModel(face)) == 2) - setFlag(a, face, CHECKED); + badFaces.push_back(face); } - ma_dbg::dumpMeshWithFlag(a, 0, 2, CHECKED, "shape_bad_faces", "shape_bad_faces"); - apf::writeVtkFiles("shape_mesh_verts", a->mesh, 0); - apf::writeVtkFiles("shape_mesh_tets", a->mesh); + ma_dbg::flagEntity(a, 2, "bad_surface_tets", &badFaces[0], badFaces.size()); + apf::writeVtkFiles("mesh_faces", a->mesh, 2); + apf::writeVtkFiles("mesh_edges", a->mesh, 1); + apf::writeVtkFiles("mesh_tets", a->mesh); } void printNumTypes() From e15f470466bf0bd1d8498eccaf765cc8345aefd6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 24 Oct 2025 18:08:07 -0400 Subject: [PATCH 254/319] more bad shape info --- ma/maShapeNew.cc | 232 +---------------------------------------------- 1 file changed, 1 insertion(+), 231 deletions(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 942414a79..ce34094f8 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -286,234 +286,4 @@ class FixShape : public Operator else interior[i++] = faces[f]; } if (s != 2 || i != 2) return false; - Entity* interiorEdge = mesh->getModelType(mesh->toModel(problemEnts[0])) == 3 ? problemEnts[0] : problemEnts[1]; - Entity* surfaceEdge = problemEnts[0] == interiorEdge ? problemEnts[1] : problemEnts[0]; - if (mesh->getModelType(mesh->toModel(surfaceEdge)) == 1) - return false; - if (!isLowInHigh(mesh, surface[0], surfaceEdge) || !isLowInHigh(mesh, surface[1], surfaceEdge)) - return false; - Model* modelFace = mesh->toModel(surface[0]); - mesh->destroy(tet); - mesh->destroy(surface[0]); - mesh->destroy(surface[1]); - mesh->destroy(surfaceEdge); - - mesh->setModelEntity(interior[0], modelFace); - mesh->setModelEntity(interior[1], modelFace); - mesh->setModelEntity(interiorEdge, modelFace); - return true; - } - - bool isTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) - { - Entity* verts[4]; - a->mesh->getDownward(tet, 0, verts); - Entity* vert = verts[0]; - Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); - double area[4]; - int bit = getTetStats(a, vert, face, tet, problemEnts, area); - return bit==3 || bit==5 || bit==6; - } - - void fixTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) - { - if (collapseRegion(tet, problemEnts)) {numRegionCollapse++; return;} - if (edgeSwap->run(problemEnts[0])) {numEdgeSwap++; return;} - if (edgeSwap->run(problemEnts[1])) {numEdgeSwap++; return;} - if (splitReposition(problemEnts[0])) {numSplitReposition++; return;} - if (splitReposition(problemEnts[1])) {numSplitReposition++; return;} - Entity* faces[4]; - a->mesh->getDownward(tet, 2, faces); - for (int i=0; i<4; i++) { - if (isLowInHigh(a->mesh, faces[i], problemEnts[0])) { - Entity* v0 = getTriVertOppositeEdge(a->mesh, faces[i], problemEnts[0]); - if (splitCollapse.run(problemEnts[0], v0)) {numEdgeSplitCollapse++; return;} - } - else { - Entity* v0 = getTriVertOppositeEdge(a->mesh, faces[i], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v0)) {numEdgeSplitCollapse++; return;} - } - } - if (doubleSplitCollapse.run(problemEnts)) {numDoubleSplitCollapse++; return;} - } - - void fixThreeLargeAngles(Entity* tet, Entity* problemEnts[4]) - { - Entity* tetEdges[6]; - a->mesh->getDownward(tet, 1, tetEdges); - for (int i=0; i<6; i++) - if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) { - Entity* verts[2]; - a->mesh->getDownward(tetEdges[i], 0, verts); - Entity* keep = isLowInHigh(a->mesh, problemEnts[0], verts[0]) ? verts[0] : verts[1]; - bool alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); - setFlag(a, keep, DONT_COLLAPSE); - bool success = collapseEdge(tetEdges[i]); - if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); - if (success) {numCollapse++; return;} - } - Entity* faceEdges[3]; - a->mesh->getDownward(problemEnts[0], 1, faceEdges); - if (edgeSwap->run(faceEdges[0])) {numEdgeSwap++; return;} - if (edgeSwap->run(faceEdges[1])) {numEdgeSwap++; return;} - if (edgeSwap->run(faceEdges[2])) {numEdgeSwap++; return;} - if (runFaceSwap(a, problemEnts[0], true)) {numFaceSwap++; return;} - Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); - if (splitCollapse.run(problemEnts[1], v)) {numEdgeSplitCollapse++; return;} - if (faceSplitCollapse.run(problemEnts[0], tet)) {numFaceSplitCollapse++; return;} - } - - void apply() - { - clearFlag(a, badTet, BAD_QUALITY); - if (fixShortEdge(badTet)) return; - if (fixOneLargeAngle(badTet)) return; - Entity* problemEnts[4]; - if (isTwoLargeAngles(badTet, problemEnts)) - fixTwoLargeAngles(badTet, problemEnts); - else - fixThreeLargeAngles(badTet, problemEnts); - } - - void resetCounters() - { - numOneShortEdge=numTwoShortEdge=numThreeShortEdge=numMoreShortEdge=0; - numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; - } - int collect(int val) { - return a->mesh->getPCU()->Add(val); - } - void printNumOperations() - { - print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n split reposition %9d\n double split collapse %d\n " - "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", - collect(numCollapse), collect(numEdgeSwap), collect(numSplitReposition), collect(numDoubleSplitCollapse), - collect(numEdgeSplitCollapse), collect(numFaceSplitCollapse), collect(numRegionCollapse), collect(numFaceSwap)); - } - void printBadTypes() - { - print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n " - "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", - collect(numOneShortEdge), collect(numTwoShortEdge), collect(numThreeShortEdge), - collect(numMoreShortEdge), collect(numOneLargeAngle), collect(numTwoLargeAngles), collect(numThreeLargeAngles)); - } - - bool isShortEdge(Entity* tet) - { - Entity* edges[6]; - a->mesh->getDownward(tet, 1, edges); - int numShortEdges=0; - for (int i=0; i<6; i++) - if (a->sizeField->measure(edges[i]) < MINLENGTH) - numShortEdges++; - - if (numShortEdges==0) return false; - else if (numShortEdges==1) numOneShortEdge++; - else if (numShortEdges==2) numTwoShortEdge++; - else if (numShortEdges==3) numThreeShortEdge++; - else numMoreShortEdge++; - return true; - } - - void printBadShape(Entity* badTet) - { - Entity* worst; - Entity* problemEnts[4]; - if (isShortEdge(badTet)) print(a->mesh->getPCU(), "Worst is short\n"); - else if (isOneLargeAngle(badTet, worst)) print(a->mesh->getPCU(), "Worst is one large angle\n"); - else if (isTwoLargeAngles(badTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); - else print(a->mesh->getPCU(), "Worst is three large angles\n"); - - ma_dbg::addClassification(a); - - EntitySet bad; - bad.insert(badTet); - EntitySet adjacent1 = getNextLayer(a, bad); - EntitySet adjacent2 = getNextLayer(a, adjacent1); - - ma_dbg::flagEntity(a, 3, "worst_tet", bad); - ma_dbg::flagEntity(a, 3, "worst_tet_adj", adjacent1); - ma_dbg::flagEntity(a, 3, "worst_tet_adj2", adjacent2); - - std::vector badFaces; - Iterator* it = a->mesh->begin(3); - Entity* tet; - while ((tet = a->mesh->iterate(it))) { - if (!getFlag(a, tet, BAD_QUALITY)) continue; - Entity* faces[4]; - mesh->getDownward(tet, 2, faces); - for (Entity* face : faces) - if (mesh->getModelType(mesh->toModel(face)) == 2) - badFaces.push_back(face); - } - ma_dbg::flagEntity(a, 2, "bad_surface_tets", &badFaces[0], badFaces.size()); - apf::writeVtkFiles("mesh_faces", a->mesh, 2); - apf::writeVtkFiles("mesh_edges", a->mesh, 1); - apf::writeVtkFiles("mesh_tets", a->mesh); - } - - void printNumTypes() - { - resetCounters(); - Entity* tet; - Iterator* it = a->mesh->begin(3); - double worstQual = 1; - Entity* worstShape; - while ((tet = a->mesh->iterate(it))) { - if (!getFlag(a, tet, BAD_QUALITY)) continue; - double qual = a->shape->getQuality(tet); - if (qual < worstQual) { - worstQual = qual; - worstShape = tet; - } - - Entity* problemEnts[4]; - Entity* worst; - if (isShortEdge(tet)) continue; - else if (isOneLargeAngle(tet, worst)) - numOneLargeAngle++; - else if (isTwoLargeAngles(tet, problemEnts)) - numTwoLargeAngles++; - else - numThreeLargeAngles++; - } - printBadTypes(); - // printBadShape(worstShape); - } -}; - -void fixElementShapesNew(Adapt* a) -{ - if ( ! a->input->shouldFixShape) - return; - double t0 = pcu::Time(); - bool oldForce = a->input->shouldForceAdaptation; - a->input->shouldForceAdaptation = false; - int count = markBadQualityNew(a); - print(a->mesh->getPCU(), "loop %d: of shape correction loop: #bad elements %d", 0, count); - FixShape fixShape(a); - // fixShape.printNumTypes(); - int originalCount = count; - int prev_count; - int iter = 0; - do { - if (!count) break; - prev_count = count; - applyOperator(a,&fixShape); - if (a->mesh->getDimension() == 3) - snap(a); - count = markBadQualityNew(a); - midBalance(a); // balance the mesh to avoid empty parts - iter++; - print(a->mesh->getPCU(), "loop %d: bad shapes went from %d to %d", iter, prev_count, count); - } while(count < prev_count); - a->input->shouldForceAdaptation = oldForce; - double t1 = pcu::Time(); - print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", - originalCount,count,t1-t0); - fixShape.printNumOperations(); - fixShape.printNumTypes(); - unMarkBadQualityNew(a); -} - -} + Entity* in \ No newline at end of file From 8745b2a0956095d4dc724f17ff36d7c907ce58b8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 24 Oct 2025 18:15:06 -0400 Subject: [PATCH 255/319] undo --- ma/maShapeNew.cc | 232 ++++++++++++++++++++++++++++++++++++++++++++++- 1 file changed, 231 insertions(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index ce34094f8..c50fbd52a 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -286,4 +286,234 @@ class FixShape : public Operator else interior[i++] = faces[f]; } if (s != 2 || i != 2) return false; - Entity* in \ No newline at end of file + Entity* interiorEdge = mesh->getModelType(mesh->toModel(problemEnts[0])) == 3 ? problemEnts[0] : problemEnts[1]; + Entity* surfaceEdge = problemEnts[0] == interiorEdge ? problemEnts[1] : problemEnts[0]; + if (mesh->getModelType(mesh->toModel(surfaceEdge)) == 1) + return false; + if (!isLowInHigh(mesh, surface[0], surfaceEdge) || !isLowInHigh(mesh, surface[1], surfaceEdge)) + return false; + Model* modelFace = mesh->toModel(surface[0]); + mesh->destroy(tet); + mesh->destroy(surface[0]); + mesh->destroy(surface[1]); + mesh->destroy(surfaceEdge); + + mesh->setModelEntity(interior[0], modelFace); + mesh->setModelEntity(interior[1], modelFace); + mesh->setModelEntity(interiorEdge, modelFace); + return true; + } + + bool isTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) + { + Entity* verts[4]; + a->mesh->getDownward(tet, 0, verts); + Entity* vert = verts[0]; + Entity* face = getTetFaceOppositeVert(a->mesh, tet, vert); + double area[4]; + int bit = getTetStats(a, vert, face, tet, problemEnts, area); + return bit==3 || bit==5 || bit==6; + } + + void fixTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) + { + if (collapseRegion(tet, problemEnts)) {numRegionCollapse++; return;} + if (edgeSwap->run(problemEnts[0])) {numEdgeSwap++; return;} + if (edgeSwap->run(problemEnts[1])) {numEdgeSwap++; return;} + if (splitReposition(problemEnts[0])) {numSplitReposition++; return;} + if (splitReposition(problemEnts[1])) {numSplitReposition++; return;} + Entity* faces[4]; + a->mesh->getDownward(tet, 2, faces); + for (int i=0; i<4; i++) { + if (isLowInHigh(a->mesh, faces[i], problemEnts[0])) { + Entity* v0 = getTriVertOppositeEdge(a->mesh, faces[i], problemEnts[0]); + if (splitCollapse.run(problemEnts[0], v0)) {numEdgeSplitCollapse++; return;} + } + else { + Entity* v0 = getTriVertOppositeEdge(a->mesh, faces[i], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v0)) {numEdgeSplitCollapse++; return;} + } + } + if (doubleSplitCollapse.run(problemEnts)) {numDoubleSplitCollapse++; return;} + } + + void fixThreeLargeAngles(Entity* tet, Entity* problemEnts[4]) + { + Entity* tetEdges[6]; + a->mesh->getDownward(tet, 1, tetEdges); + for (int i=0; i<6; i++) + if (!isLowInHigh(a->mesh, problemEnts[0], tetEdges[i])) { + Entity* verts[2]; + a->mesh->getDownward(tetEdges[i], 0, verts); + Entity* keep = isLowInHigh(a->mesh, problemEnts[0], verts[0]) ? verts[0] : verts[1]; + bool alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); + setFlag(a, keep, DONT_COLLAPSE); + bool success = collapseEdge(tetEdges[i]); + if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); + if (success) {numCollapse++; return;} + } + Entity* faceEdges[3]; + a->mesh->getDownward(problemEnts[0], 1, faceEdges); + if (edgeSwap->run(faceEdges[0])) {numEdgeSwap++; return;} + if (edgeSwap->run(faceEdges[1])) {numEdgeSwap++; return;} + if (edgeSwap->run(faceEdges[2])) {numEdgeSwap++; return;} + if (runFaceSwap(a, problemEnts[0], true)) {numFaceSwap++; return;} + Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); + if (splitCollapse.run(problemEnts[1], v)) {numEdgeSplitCollapse++; return;} + if (faceSplitCollapse.run(problemEnts[0], tet)) {numFaceSplitCollapse++; return;} + } + + void apply() + { + clearFlag(a, badTet, BAD_QUALITY); + if (fixShortEdge(badTet)) return; + if (fixOneLargeAngle(badTet)) return; + Entity* problemEnts[4]; + if (isTwoLargeAngles(badTet, problemEnts)) + fixTwoLargeAngles(badTet, problemEnts); + else + fixThreeLargeAngles(badTet, problemEnts); + } + + void resetCounters() + { + numOneShortEdge=numTwoShortEdge=numThreeShortEdge=numMoreShortEdge=0; + numOneLargeAngle=numTwoLargeAngles=numThreeLargeAngles=0; + } + int collect(int val) { + return a->mesh->getPCU()->Add(val); + } + void printNumOperations() + { + print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n split reposition %9d\n double split collapse %d\n " + "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", + collect(numCollapse), collect(numEdgeSwap), collect(numSplitReposition), collect(numDoubleSplitCollapse), + collect(numEdgeSplitCollapse), collect(numFaceSplitCollapse), collect(numRegionCollapse), collect(numFaceSwap)); + } + void printBadTypes() + { + print(a->mesh->getPCU(), "bad shape types: \n oneShortEdge \t%d\n twoShortEdges \t%d\n threeShortEdges \t%d\n " + "moreShortEdges \t%d\n oneLargeAngle \t%d\n twoLargeAngle \t%d\n threeLargeAngle \t%d\n", + collect(numOneShortEdge), collect(numTwoShortEdge), collect(numThreeShortEdge), + collect(numMoreShortEdge), collect(numOneLargeAngle), collect(numTwoLargeAngles), collect(numThreeLargeAngles)); + } + + bool isShortEdge(Entity* tet) + { + Entity* edges[6]; + a->mesh->getDownward(tet, 1, edges); + int numShortEdges=0; + for (int i=0; i<6; i++) + if (a->sizeField->measure(edges[i]) < MINLENGTH) + numShortEdges++; + + if (numShortEdges==0) return false; + else if (numShortEdges==1) numOneShortEdge++; + else if (numShortEdges==2) numTwoShortEdge++; + else if (numShortEdges==3) numThreeShortEdge++; + else numMoreShortEdge++; + return true; + } + + void printBadShape(Entity* badTet) + { + Entity* worst; + Entity* problemEnts[4]; + if (isShortEdge(badTet)) print(a->mesh->getPCU(), "Worst is short\n"); + else if (isOneLargeAngle(badTet, worst)) print(a->mesh->getPCU(), "Worst is one large angle\n"); + else if (isTwoLargeAngles(badTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); + else print(a->mesh->getPCU(), "Worst is three large angles\n"); + + ma_dbg::addClassification(a); + + EntitySet bad; + bad.insert(badTet); + EntitySet adjacent1 = getNextLayer(a, bad); + EntitySet adjacent2 = getNextLayer(a, adjacent1); + + ma_dbg::flagEntity(a, 3, "worst_tet", bad); + ma_dbg::flagEntity(a, 3, "worst_tet_adj", adjacent1); + ma_dbg::flagEntity(a, 3, "worst_tet_adj2", adjacent2); + + std::vector badFaces; + Iterator* it = a->mesh->begin(3); + Entity* tet; + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + Entity* faces[4]; + mesh->getDownward(tet, 2, faces); + for (Entity* face : faces) + if (mesh->getModelType(mesh->toModel(face)) == 2) + badFaces.push_back(face); + } + ma_dbg::flagEntity(a, 2, "bad_surface_tets", &badFaces[0], badFaces.size()); + apf::writeVtkFiles("mesh_faces", a->mesh, 2); + apf::writeVtkFiles("mesh_edges", a->mesh, 1); + apf::writeVtkFiles("mesh_tets", a->mesh); + } + + void printNumTypes() + { + resetCounters(); + Entity* tet; + Iterator* it = a->mesh->begin(3); + double worstQual = 1; + Entity* worstShape; + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + double qual = a->shape->getQuality(tet); + if (qual < worstQual) { + worstQual = qual; + worstShape = tet; + } + + Entity* problemEnts[4]; + Entity* worst; + if (isShortEdge(tet)) continue; + else if (isOneLargeAngle(tet, worst)) + numOneLargeAngle++; + else if (isTwoLargeAngles(tet, problemEnts)) + numTwoLargeAngles++; + else + numThreeLargeAngles++; + } + printBadTypes(); + // printBadShape(worstShape); + } +}; + +void fixElementShapesNew(Adapt* a) +{ + if ( ! a->input->shouldFixShape) + return; + double t0 = pcu::Time(); + bool oldForce = a->input->shouldForceAdaptation; + a->input->shouldForceAdaptation = false; + int count = markBadQualityNew(a); + print(a->mesh->getPCU(), "loop %d: of shape correction loop: #bad elements %d", 0, count); + FixShape fixShape(a); + // fixShape.printNumTypes(); + int originalCount = count; + int prev_count; + int iter = 0; + do { + if (!count) break; + prev_count = count; + applyOperator(a,&fixShape); + if (a->mesh->getDimension() == 3) + snap(a); + count = markBadQualityNew(a); + midBalance(a); // balance the mesh to avoid empty parts + iter++; + print(a->mesh->getPCU(), "loop %d: bad shapes went from %d to %d", iter, prev_count, count); + } while(count < prev_count); + a->input->shouldForceAdaptation = oldForce; + double t1 = pcu::Time(); + print(a->mesh->getPCU(), "bad shapes down from %d to %d in %f seconds", + originalCount,count,t1-t0); + fixShape.printNumOperations(); + fixShape.printNumTypes(); + unMarkBadQualityNew(a); +} + +} \ No newline at end of file From d3379f7efba9a4670e0aaa01b915a71239508e3f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 24 Oct 2025 19:34:27 -0400 Subject: [PATCH 256/319] rename multiple coarsen --- ma/ma.cc | 8 ++++++-- ma/maCoarsen.cc | 2 +- ma/maCoarsen.h | 3 +-- 3 files changed, 8 insertions(+), 5 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index a933fd111..f466129e2 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -19,6 +19,7 @@ #include "maShapeNew.h" #include #include +#include namespace ma { @@ -67,14 +68,17 @@ void adapt(Input* in) validateInput(in); Adapt* a = new Adapt(in); preBalance(a); - coarsenOnce(a); + CALLGRIND_START_INSTRUMENTATION; + coarsenMultiple(a); + CALLGRIND_STOP_INSTRUMENTATION; + return; for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); midBalance(a); refine(a); snap(a); - coarsenOnce(a); + coarsenMultiple(a); coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 3c964eb23..97a03dc7d 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -447,7 +447,7 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback } }; -void coarsenOnce(Adapt* a) +void coarsenMultiple(Adapt* a) { if (!a->input->shouldCoarsen) return; diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index 30e867ea4..8069fe3dc 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -14,8 +14,7 @@ namespace ma { class Adapt; -void coarsenOnce(Adapt* a); -bool coarsenMultiple(Adapt* a); +void coarsenMultiple(Adapt* a); bool coarsen(Adapt* a); bool coarsenLayer(Adapt* a); From cc8fd84329689f295ad0d6c734c0848b15ae5984 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 25 Oct 2025 13:00:52 -0400 Subject: [PATCH 257/319] print more tet info --- ma/ma.cc | 1 - ma/maShapeNew.cc | 24 +++++++++++++++++++++--- 2 files changed, 21 insertions(+), 4 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index f466129e2..562a343ca 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -71,7 +71,6 @@ void adapt(Input* in) CALLGRIND_START_INSTRUMENTATION; coarsenMultiple(a); CALLGRIND_STOP_INSTRUMENTATION; - return; for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index c50fbd52a..5a124d994 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -417,10 +417,10 @@ class FixShape : public Operator void printBadShape(Entity* badTet) { - Entity* worst; + Entity* worstTri; Entity* problemEnts[4]; if (isShortEdge(badTet)) print(a->mesh->getPCU(), "Worst is short\n"); - else if (isOneLargeAngle(badTet, worst)) print(a->mesh->getPCU(), "Worst is one large angle\n"); + else if (isOneLargeAngle(badTet, worstTri)) print(a->mesh->getPCU(), "Worst is one large angle\n"); else if (isTwoLargeAngles(badTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); else print(a->mesh->getPCU(), "Worst is three large angles\n"); @@ -434,6 +434,24 @@ class FixShape : public Operator ma_dbg::flagEntity(a, 3, "worst_tet", bad); ma_dbg::flagEntity(a, 3, "worst_tet_adj", adjacent1); ma_dbg::flagEntity(a, 3, "worst_tet_adj2", adjacent2); + ma_dbg::flagEntity(a, 2, "worst_tet_triangle", &worstTri, 1); + + Entity* worstEdges[3]; + a->mesh->getDownward(worstTri, 1, worstEdges); + Entity* longestEdge = getLongestEdge(worstEdges); + ma_dbg::flagEntity(a, 1, "worst_triangle_longest", &longestEdge, 1); + + Entity* faces[4]; + a->mesh->getDownward(badTet, 2, faces); + ma_dbg::flagEntity(a, 2, "worst_tet_faces", faces, 4); + + Entity* edges[6]; + a->mesh->getDownward(badTet, 1, edges); + ma_dbg::flagEntity(a, 1, "worst_tet_edges", edges, 6); + + Entity* verts[4]; + a->mesh->getDownward(badTet, 0, verts); + ma_dbg::flagEntity(a, 0, "worst_tet_verts", verts, 4); std::vector badFaces; Iterator* it = a->mesh->begin(3); @@ -478,7 +496,7 @@ class FixShape : public Operator numThreeLargeAngles++; } printBadTypes(); - // printBadShape(worstShape); + printBadShape(worstShape); } }; From 773918eb6b4a338f4a6a1e6070e96a39b054eb41 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 25 Oct 2025 13:49:11 -0400 Subject: [PATCH 258/319] fixed tet print --- ma/maShapeNew.cc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 5a124d994..68a647468 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -465,9 +465,9 @@ class FixShape : public Operator badFaces.push_back(face); } ma_dbg::flagEntity(a, 2, "bad_surface_tets", &badFaces[0], badFaces.size()); + apf::writeVtkFiles("mesh_tets", a->mesh, 3); apf::writeVtkFiles("mesh_faces", a->mesh, 2); apf::writeVtkFiles("mesh_edges", a->mesh, 1); - apf::writeVtkFiles("mesh_tets", a->mesh); } void printNumTypes() From 2408f75ab41231fbce8126aec2a4627337eca6ab Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 25 Oct 2025 16:12:26 -0400 Subject: [PATCH 259/319] flag entity all dim --- ma/ma.cc | 25 ++++++++++++++++++++++++ ma/maDBG.cc | 49 ++++++++++++++++++++++++++++++++++++++++++++---- ma/maDBG.h | 10 ++++++++-- ma/maShapeNew.cc | 19 +------------------ 4 files changed, 79 insertions(+), 24 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 562a343ca..f88e8c51c 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -20,6 +20,7 @@ #include #include #include +#include "apfGeometry.h" namespace ma { @@ -71,6 +72,30 @@ void adapt(Input* in) CALLGRIND_START_INSTRUMENTATION; coarsenMultiple(a); CALLGRIND_STOP_INSTRUMENTATION; + + // const Vector target(1502.327985, 375.402966, 174.096195); + // ma::Iterator* it = a->mesh->begin(0); + // Entity* vert; + // while ((vert = a->mesh->iterate(it))) { + // Vector pos = getPosition(a->mesh, vert); + // if (apf::areClose(pos, target, 1e-5)) { + // apf::Adjacent tets; + // a->mesh->getAdjacent(vert, 3, tets); + // for (int i=0; isizeField->measure(tets[i])); + // printf("Qual %f\n", qual); + // if (qual < .1) { + // ma_dbg::addClassification(a); + // ma_dbg::flagEntityAllDim(a, 3, "worst_tet", &tets[i], 1); + // apf::writeVtkFiles("mesh_tets", a->mesh, 3); + // apf::writeVtkFiles("mesh_faces", a->mesh, 2); + // apf::writeVtkFiles("mesh_verts", a->mesh, 1); + // exit(1); + // } + // } + // } + // } + for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); diff --git a/ma/maDBG.cc b/ma/maDBG.cc index 165b8db01..c4139f7cf 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -137,13 +137,54 @@ void addParamCoords(ma::Adapt* a, m->end(it); } -void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::EntitySet toFlag) +void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::EntitySet entities) { - std::vector converted(toFlag.begin(), toFlag.end()); + std::vector converted(entities.begin(), entities.end()); flagEntity(a, dim, fieldName, &converted[0], converted.size()); } -void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entToFlag, int size) +void flagEntityAllDim(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entities, int size) +{ + std::vector allFaces; + std::vector allEdges; + std::vector allVerts; + + for (int i = 0; i 2){ + ma::Entity* faces[4]; + a->mesh->getDownward(entities[i], 2, faces); + for (ma::Entity* face : faces) allFaces.push_back(face); + } + if (dim > 1){ + ma::Entity* edges[6]; + a->mesh->getDownward(entities[i], 1, edges); + for (ma::Entity* edge : edges) allEdges.push_back(edge); + } + if (dim > 0){ + ma::Entity* verts[4]; + a->mesh->getDownward(entities[i], 0, verts); + for (ma::Entity* vert : verts) allVerts.push_back(vert); + } + } + + std::string dimName = std::string(fieldName) + std::to_string(dim); + flagEntity(a, dim, dimName.c_str(), entities, size); + + if (dim > 2){ + std::string dimName2 = std::string(fieldName) + "2"; + flagEntity(a, 2, dimName2.c_str(), &allFaces[0], allFaces.size()); + } + if (dim > 1){ + std::string dimName1 = std::string(fieldName) + "1"; + flagEntity(a, 1, dimName1.c_str(), &allEdges[0], allEdges.size()); + } + if (dim > 0){ + std::string dimName0 = std::string(fieldName) + "0"; + flagEntity(a, 0, dimName0.c_str(), &allVerts[0], allVerts.size()); + } +} + +void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entities, int size) { apf::Field* colorField = getField(a, dim, fieldName); ma::Entity* entity; @@ -156,7 +197,7 @@ void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entTo for (int i=0; imesh->getDownward(worstTri, 1, worstEdges); - Entity* longestEdge = getLongestEdge(worstEdges); - ma_dbg::flagEntity(a, 1, "worst_triangle_longest", &longestEdge, 1); - - Entity* faces[4]; - a->mesh->getDownward(badTet, 2, faces); - ma_dbg::flagEntity(a, 2, "worst_tet_faces", faces, 4); - - Entity* edges[6]; - a->mesh->getDownward(badTet, 1, edges); - ma_dbg::flagEntity(a, 1, "worst_tet_edges", edges, 6); - - Entity* verts[4]; - a->mesh->getDownward(badTet, 0, verts); - ma_dbg::flagEntity(a, 0, "worst_tet_verts", verts, 4); std::vector badFaces; Iterator* it = a->mesh->begin(3); From b65cb5d18659a04ae87cc195f6d41bffc74ca3f9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 25 Oct 2025 17:43:26 -0400 Subject: [PATCH 260/319] better flag all dim --- ma/maCollapse.cc | 17 +++++------------ ma/maDBG.cc | 19 ++++--------------- 2 files changed, 9 insertions(+), 27 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index cce54f417..e0e76403e 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -560,23 +560,16 @@ void printCollapseInfo(Collapse& collapse, Entity* edge, Entity* vert) ma_dbg::flagEntity(adapt, 0, "vert_to_collapse", &vert, 1); apf::Adjacent tets; adapt->mesh->getAdjacent(vert, 3, tets); + ma_dbg::flagEntityAllDim(adapt, 3, "adjacent_tets", &tets[0], tets.size()); - std::vector adjEdges; - for(int i=0; imesh->getDownward(tets[i], 1, edges); - for (Entity* e : edges) - adjEdges.push_back(e); - } std::vector elemsToCollapse(collapse.elementsToCollapse.begin(), collapse.elementsToCollapse.end()); ma_dbg::flagEntity(adapt, 3, "tets_to_collapse", &elemsToCollapse[0], elemsToCollapse.size()); std::vector elemsToKeep(collapse.elementsToKeep.begin(), collapse.elementsToKeep.end()); ma_dbg::flagEntity(adapt, 3, "tets_to_keep", &elemsToKeep[0], elemsToKeep.size()); - ma_dbg::flagEntity(adapt, 1, "adjacent_edge", &adjEdges[0], adjEdges.size()); - ma_dbg::flagEntity(adapt, 3, "adjacent_tets", &tets[0], tets.size()); - apf::writeVtkFiles("mesh_before_bad_collapse_3", adapt->mesh, 3); - apf::writeVtkFiles("mesh_before_bad_collapse_1", adapt->mesh, 1); - // apf::writeVtkFiles("mesh_before_bad_collapse_0", adapt->mesh, 0); + + apf::writeVtkFiles("mesh_tets", adapt->mesh, 3); + apf::writeVtkFiles("mesh_faces", adapt->mesh, 2); + apf::writeVtkFiles("mesh_edges", adapt->mesh, 1); exit(0); } } diff --git a/ma/maDBG.cc b/ma/maDBG.cc index c4139f7cf..fdd77f4ab 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -167,21 +167,10 @@ void flagEntityAllDim(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** } } - std::string dimName = std::string(fieldName) + std::to_string(dim); - flagEntity(a, dim, dimName.c_str(), entities, size); - - if (dim > 2){ - std::string dimName2 = std::string(fieldName) + "2"; - flagEntity(a, 2, dimName2.c_str(), &allFaces[0], allFaces.size()); - } - if (dim > 1){ - std::string dimName1 = std::string(fieldName) + "1"; - flagEntity(a, 1, dimName1.c_str(), &allEdges[0], allEdges.size()); - } - if (dim > 0){ - std::string dimName0 = std::string(fieldName) + "0"; - flagEntity(a, 0, dimName0.c_str(), &allVerts[0], allVerts.size()); - } + flagEntity(a, dim, fieldName, entities, size); + if (dim > 2) flagEntity(a, 2, fieldName, &allFaces[0], allFaces.size()); + if (dim > 1) flagEntity(a, 1, fieldName, &allEdges[0], allEdges.size()); + if (dim > 0) flagEntity(a, 0, fieldName, &allVerts[0], allVerts.size()); } void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entities, int size) From c8e06e783c7767667b0f5ec46b09ed2ff50c8d3b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 1 Nov 2025 22:59:09 -0400 Subject: [PATCH 261/319] faster collapse build --- ma/maCollapse.cc | 75 +++++++++++++++++++++++++++++++++++++++++++++++- ma/maMesh.cc | 18 ++++++++---- ma/maMesh.h | 4 ++- 3 files changed, 89 insertions(+), 8 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index e0e76403e..61356101f 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -403,10 +403,83 @@ void Collapse::rebuildElements() newElements.setSize(elementsToKeep.size()); cavity.beforeBuilding(); size_t ni=0; + Mesh* m = adapt->mesh; + std::map rebuilt; + + for (Entity* elm : elementsToCollapse) { //Find edges and faces that are being reused in new elements + Entity* faces[4]; + m->getDownward(elm, 2, faces); + Entity* faceToKeep; + Entity* faceToReplace; + + for (int f=0; f<4; f++) { + Entity* edges[3]; + m->getDownward(faces[f], 1, edges); + Entity* edgeToDelete=0; + Entity* edgeToKeep=0; + Entity* edgeToReplace=0; + for (int e=0; e<3; e++) { + if (edges[e] == edge) edgeToDelete = edges[e]; + else if (isInClosure(m, edges[e], vertToKeep)) edgeToKeep = edges[e]; + else if (isInClosure(m, edges[e], vertToCollapse)) edgeToReplace = edges[e]; + } + if (edgeToReplace != 0 && edgeToDelete == 0 && edgeToKeep == 0) + faceToReplace = faces[f]; + if (edgeToKeep != 0 && edgeToDelete == 0 && edgeToReplace == 0) + faceToKeep = faces[f]; + if (edgeToDelete != 0) + rebuilt[edgeToReplace] = edgeToKeep; + } + rebuilt[faceToReplace] = faceToKeep; + } + + // APF_ITERATE(EntitySet,elementsToKeep,it) { + // Entity* tetEdges[6]; + // m->getDownward(*it, 1, tetEdges); + // for (int e=0; e<6; e++) { //Rebuild edges only if necessary + // if (rebuilt.find(tetEdges[e]) != rebuilt.end()) continue; //Edge already rebuilt + + // Entity* edgeVerts[2]; + // m->getDownward(tetEdges[e], 0, edgeVerts); + // if (edgeVerts[0] == vertToCollapse) edgeVerts[0] = vertToKeep; + // else if (edgeVerts[1] == vertToCollapse) edgeVerts[1] = vertToKeep; + // else continue; + // rebuilt[tetEdges[e]] = m->createEntity(m->getType(tetEdges[e]), m->toModel(tetEdges[e]), edgeVerts); + // } + // Entity* tetFaces[4]; + // m->getDownward(*it, 2, tetFaces); + // for (int f=0; f<4; f++) { //Rebuild faces only if necessary + // auto foundFace = rebuilt.find(tetFaces[f]); + // if (foundFace != rebuilt.end()) { //Face already rebuilt + // tetFaces[f] = foundFace->second; + // continue; + // } + + // Entity* faceEdges[3]; + // m->getDownward(tetFaces[f], 1, faceEdges); + // bool rebuild = false; + // for (int e=0; e<3; e++) { + // auto foundEdge = rebuilt.find(faceEdges[e]); + // if (foundEdge == rebuilt.end()) continue; //edge does not need rebuilding + // rebuild = true; + // faceEdges[e] = foundEdge->second; + // } + // if (!rebuild) continue; + // Entity* newFace = m->createEntity(m->getType(tetFaces[f]), m->toModel(tetFaces[f]), faceEdges); + // rebuilt[tetFaces[f]] = newFace; + // tetFaces[f] = newFace; + // } + + // newElements[ni++]= m->createEntity(m->getType(*it), m->toModel(*it), tetFaces); + // if (adapt->buildCallback) adapt->buildCallback->call(newElements[ni]); + // if (rebuildCallback) rebuildCallback->rebuilt(newElements[ni], *it); + // ni++; + // } + APF_ITERATE(EntitySet,elementsToKeep,it) newElements[ni++]= rebuildElement(adapt->mesh, *it, vertToCollapse, vertToKeep, - adapt->buildCallback, rebuildCallback); + adapt->buildCallback, rebuildCallback, &rebuilt); cavity.afterBuilding(); } diff --git a/ma/maMesh.cc b/ma/maMesh.cc index 3e0f370e8..b37f72535 100644 --- a/ma/maMesh.cc +++ b/ma/maMesh.cc @@ -230,7 +230,8 @@ Entity* rebuildElement( Entity* oldVert, Entity* newVert, apf::BuildCallback* cb, - RebuildCallback* rcb) + RebuildCallback* rcb, + std::map* rebuilt) { int type = m->getType(original); if (type == apf::Mesh::VERTEX) @@ -240,15 +241,20 @@ Entity* rebuildElement( return newVert; return original; } + auto foundNew = rebuilt->find(original); + if (foundNew != rebuilt->end()) return foundNew->second; + if (!isInClosure(m, original, oldVert)) return original; + int d = Mesh::typeDimension[type]; Downward down; int nd = m->getDownward(original,d-1,down); for (int i=0; i < nd; ++i) - down[i] = rebuildElement(m, down[i], oldVert, newVert, cb, rcb); - bool made; - Entity* e = apf::makeOrFind(m, m->toModel(original), type, down, cb, &made); - if (made && rcb) - rcb->rebuilt(e, original); + down[i] = rebuildElement(m, down[i], oldVert, newVert, cb, rcb, rebuilt); + + Entity* e = m->createEntity(type,m->toModel(original),down); + (*rebuilt)[original] = e; + if (rcb) rcb->rebuilt(e, original); + return e; } diff --git a/ma/maMesh.h b/ma/maMesh.h index f5409d2b8..e75e35004 100644 --- a/ma/maMesh.h +++ b/ma/maMesh.h @@ -16,6 +16,7 @@ #include #include #include +#include namespace ma { @@ -87,7 +88,8 @@ Entity* rebuildElement( Entity* oldVert, Entity* newVert, apf::BuildCallback* cb, - RebuildCallback* rcb = 0); + RebuildCallback* rcb = 0, + std::map* rebuilt = 0); bool isInClosure(Mesh* m, Entity* parent, Entity* e); From f0e60a2e7d1850ddd76a8c361e5492198a8e6191 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 1 Nov 2025 23:09:06 -0400 Subject: [PATCH 262/319] get reusable entities function --- ma/maCollapse.cc | 26 ++++++++++++++++---------- ma/maCollapse.h | 2 ++ 2 files changed, 18 insertions(+), 10 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 61356101f..c1bb112bc 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -397,16 +397,12 @@ void Collapse::computeElementSets() // PCU_ALWAYS_ASSERT(elementsToKeep.size()); TODO: change computeElementSets to bool function that fails when this is false } -void Collapse::rebuildElements() +//Find edges and faces that can be reused in new entities after collapse +std::map Collapse::getReusableEntities() { - PCU_ALWAYS_ASSERT(elementsToKeep.size()); - newElements.setSize(elementsToKeep.size()); - cavity.beforeBuilding(); - size_t ni=0; Mesh* m = adapt->mesh; - std::map rebuilt; - - for (Entity* elm : elementsToCollapse) { //Find edges and faces that are being reused in new elements + std::map reusable; + for (Entity* elm : elementsToCollapse) { Entity* faces[4]; m->getDownward(elm, 2, faces); Entity* faceToKeep; @@ -428,10 +424,20 @@ void Collapse::rebuildElements() if (edgeToKeep != 0 && edgeToDelete == 0 && edgeToReplace == 0) faceToKeep = faces[f]; if (edgeToDelete != 0) - rebuilt[edgeToReplace] = edgeToKeep; + reusable[edgeToReplace] = edgeToKeep; } - rebuilt[faceToReplace] = faceToKeep; + reusable[faceToReplace] = faceToKeep; } + return reusable; +} + +void Collapse::rebuildElements() +{ + PCU_ALWAYS_ASSERT(elementsToKeep.size()); + newElements.setSize(elementsToKeep.size()); + cavity.beforeBuilding(); + size_t ni=0; + std::map rebuilt = getReusableEntities(); // APF_ITERATE(EntitySet,elementsToKeep,it) { // Entity* tetEdges[6]; diff --git a/ma/maCollapse.h b/ma/maCollapse.h index f7b7dedf2..1931f291b 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -54,6 +54,8 @@ class Collapse EntityArray newElements; Cavity cavity; RebuildCallback* rebuildCallback; + private: + std::map getReusableEntities(); }; bool checkEdgeCollapseTopology(Adapt* a, Entity* edge); From 6ef021cea44a94d8d1a758edb4c01e158c2af141 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sun, 2 Nov 2025 00:03:44 -0400 Subject: [PATCH 263/319] replace recursive rebuild with iterative rebuild --- ma/maCollapse.cc | 76 ++++++++++++++++++++---------------------------- ma/maMesh.cc | 18 ++++-------- ma/maMesh.h | 3 +- 3 files changed, 38 insertions(+), 59 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index c1bb112bc..63f4b4e45 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -437,55 +437,41 @@ void Collapse::rebuildElements() newElements.setSize(elementsToKeep.size()); cavity.beforeBuilding(); size_t ni=0; + + Mesh* m = adapt->mesh; std::map rebuilt = getReusableEntities(); + APF_ITERATE(EntitySet,elementsToKeep,it) { + Entity* tetFaces[4]; + m->getDownward(*it, 2, tetFaces); + for (int f=0; f<4; f++) { + auto foundFace = rebuilt.find(tetFaces[f]); + if (foundFace != rebuilt.end()) {tetFaces[f] = foundFace->second; continue;} + if (!isInClosure(m, tetFaces[f], vertToCollapse)) continue; + + Entity* faceEdges[3]; + m->getDownward(tetFaces[f], 1, faceEdges); + for (int e=0; e<3; e++) { + auto foundEdge = rebuilt.find(faceEdges[e]); + if (foundEdge != rebuilt.end()) {faceEdges[e] = foundEdge->second; continue;} + Entity* edgeVerts[2]; + m->getDownward(faceEdges[e], 0, edgeVerts); + if (edgeVerts[0] == vertToCollapse) edgeVerts[0] = vertToKeep; + else if (edgeVerts[1] == vertToCollapse) edgeVerts[1] = vertToKeep; + else continue; + Entity* newEdge = m->createEntity(m->getType(faceEdges[e]), m->toModel(faceEdges[e]), edgeVerts); + rebuilt[faceEdges[e]] = newEdge; + faceEdges[e] = newEdge; + } + Entity* newFace = m->createEntity(m->getType(tetFaces[f]), m->toModel(tetFaces[f]), faceEdges); + rebuilt[tetFaces[f]] = newFace; + tetFaces[f] = newFace; + } - // APF_ITERATE(EntitySet,elementsToKeep,it) { - // Entity* tetEdges[6]; - // m->getDownward(*it, 1, tetEdges); - // for (int e=0; e<6; e++) { //Rebuild edges only if necessary - // if (rebuilt.find(tetEdges[e]) != rebuilt.end()) continue; //Edge already rebuilt - - // Entity* edgeVerts[2]; - // m->getDownward(tetEdges[e], 0, edgeVerts); - // if (edgeVerts[0] == vertToCollapse) edgeVerts[0] = vertToKeep; - // else if (edgeVerts[1] == vertToCollapse) edgeVerts[1] = vertToKeep; - // else continue; - // rebuilt[tetEdges[e]] = m->createEntity(m->getType(tetEdges[e]), m->toModel(tetEdges[e]), edgeVerts); - // } - // Entity* tetFaces[4]; - // m->getDownward(*it, 2, tetFaces); - // for (int f=0; f<4; f++) { //Rebuild faces only if necessary - // auto foundFace = rebuilt.find(tetFaces[f]); - // if (foundFace != rebuilt.end()) { //Face already rebuilt - // tetFaces[f] = foundFace->second; - // continue; - // } - - // Entity* faceEdges[3]; - // m->getDownward(tetFaces[f], 1, faceEdges); - // bool rebuild = false; - // for (int e=0; e<3; e++) { - // auto foundEdge = rebuilt.find(faceEdges[e]); - // if (foundEdge == rebuilt.end()) continue; //edge does not need rebuilding - // rebuild = true; - // faceEdges[e] = foundEdge->second; - // } - // if (!rebuild) continue; - // Entity* newFace = m->createEntity(m->getType(tetFaces[f]), m->toModel(tetFaces[f]), faceEdges); - // rebuilt[tetFaces[f]] = newFace; - // tetFaces[f] = newFace; - // } - - // newElements[ni++]= m->createEntity(m->getType(*it), m->toModel(*it), tetFaces); + newElements[ni]= m->createEntity(m->getType(*it), m->toModel(*it), tetFaces); // if (adapt->buildCallback) adapt->buildCallback->call(newElements[ni]); // if (rebuildCallback) rebuildCallback->rebuilt(newElements[ni], *it); - // ni++; - // } - - APF_ITERATE(EntitySet,elementsToKeep,it) - newElements[ni++]= - rebuildElement(adapt->mesh, *it, vertToCollapse, vertToKeep, - adapt->buildCallback, rebuildCallback, &rebuilt); + ni++; + } cavity.afterBuilding(); } diff --git a/ma/maMesh.cc b/ma/maMesh.cc index b37f72535..3e0f370e8 100644 --- a/ma/maMesh.cc +++ b/ma/maMesh.cc @@ -230,8 +230,7 @@ Entity* rebuildElement( Entity* oldVert, Entity* newVert, apf::BuildCallback* cb, - RebuildCallback* rcb, - std::map* rebuilt) + RebuildCallback* rcb) { int type = m->getType(original); if (type == apf::Mesh::VERTEX) @@ -241,20 +240,15 @@ Entity* rebuildElement( return newVert; return original; } - auto foundNew = rebuilt->find(original); - if (foundNew != rebuilt->end()) return foundNew->second; - if (!isInClosure(m, original, oldVert)) return original; - int d = Mesh::typeDimension[type]; Downward down; int nd = m->getDownward(original,d-1,down); for (int i=0; i < nd; ++i) - down[i] = rebuildElement(m, down[i], oldVert, newVert, cb, rcb, rebuilt); - - Entity* e = m->createEntity(type,m->toModel(original),down); - (*rebuilt)[original] = e; - if (rcb) rcb->rebuilt(e, original); - + down[i] = rebuildElement(m, down[i], oldVert, newVert, cb, rcb); + bool made; + Entity* e = apf::makeOrFind(m, m->toModel(original), type, down, cb, &made); + if (made && rcb) + rcb->rebuilt(e, original); return e; } diff --git a/ma/maMesh.h b/ma/maMesh.h index e75e35004..aa0165ba2 100644 --- a/ma/maMesh.h +++ b/ma/maMesh.h @@ -88,8 +88,7 @@ Entity* rebuildElement( Entity* oldVert, Entity* newVert, apf::BuildCallback* cb, - RebuildCallback* rcb = 0, - std::map* rebuilt = 0); + RebuildCallback* rcb = 0); bool isInClosure(Mesh* m, Entity* parent, Entity* e); From f171fc7ceb55b8f636bc9299e0a8dcc209c07930 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 6 Nov 2025 16:42:03 -0500 Subject: [PATCH 264/319] fixed valgrind errors --- test/aniso_adapt.cc | 12 +++++++----- test/aniso_adapt.h | 24 ++++++++++-------------- test/aniso_adapt_cap.cc | 21 ++++++++++++--------- test/aniso_adapt_sim.cc | 17 ++++++++++++----- test/testing.cmake | 2 +- 5 files changed, 42 insertions(+), 34 deletions(-) diff --git a/test/aniso_adapt.cc b/test/aniso_adapt.cc index e604564f1..beb582a23 100644 --- a/test/aniso_adapt.cc +++ b/test/aniso_adapt.cc @@ -13,11 +13,13 @@ int main(int argc, char** argv) pcu::PCU PCUObj; lion_set_verbosity(1); gmi_register_mesh(); - - auto createMeshValues = [modelFile,meshFile,&PCUObj]() - { return apf::loadMdsMesh(modelFile,meshFile,&PCUObj); }; - - adaptTests(createMeshValues); + ma::Mesh* mesh1 = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); + ma::Mesh* mesh2 = apf::loadMdsMesh(modelFile,meshFile,&PCUObj); + adaptTests(mesh1, mesh2); + mesh1->destroyNative(); + mesh2->destroyNative(); + apf::destroyMesh(mesh1); + apf::destroyMesh(mesh2); } pcu::Finalize(); } diff --git a/test/aniso_adapt.h b/test/aniso_adapt.h index 9beaab9d5..8eb85ee1f 100644 --- a/test/aniso_adapt.h +++ b/test/aniso_adapt.h @@ -51,6 +51,7 @@ void measureQuality(ma::Mesh* m, double& avgQuality, double& minQuality) apf::MeshEntity* elem; apf::MeshIterator* it = m->begin(d); ma::IdentitySizeField I(m); + minQuality = 1; while ((elem = m->iterate(it))) { double q = ma::measureElementQuality(m, &I, elem); avgQuality += q; @@ -84,7 +85,7 @@ ma::Mesh* coarsenForced(ma::Mesh* m) ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); in->shouldForceAdaptation = true; ma::Adapt* a = new ma::Adapt(in); - double avgQualBefore, avgQualAfter, minQualBefore, minQualAfter; + double avgQualBefore=0, avgQualAfter=0, minQualBefore=0, minQualAfter=0; measureQuality(m, avgQualBefore, minQualBefore); double averageBefore = ma::getAverageEdgeLength(m); @@ -116,7 +117,7 @@ ma::Mesh* coarsenRegular(ma::Mesh* m) AnIso sf(m, .5, 1); ma::Input* in = ma::makeAdvanced(ma::configure(m, &sf)); ma::Adapt* a = new ma::Adapt(in); - double avgQualBefore, avgQualAfter, minQualBefore, minQualAfter; + double avgQualBefore=0, avgQualAfter=0, minQualBefore=0, minQualAfter=0; measureQuality(m, avgQualBefore, minQualBefore); double averageBefore = ma::getAverageEdgeLength(m); @@ -129,7 +130,7 @@ ma::Mesh* coarsenRegular(ma::Mesh* m) //Makes sure that coarsening is happening and it isn't decreasing the quality of the mesh PCU_ALWAYS_ASSERT(edgesBefore > countEdges(m)); PCU_ALWAYS_ASSERT(averageBefore < ma::getAverageEdgeLength(m)); - PCU_ALWAYS_ASSERT(fabs(minQualBefore - minQualAfter) < 0.001f || minQualBefore < minQualAfter); + PCU_ALWAYS_ASSERT(fabs(minQualBefore - minQualAfter) < 0.01f || minQualBefore < minQualAfter); m->verify(); delete a; @@ -183,7 +184,7 @@ ma::Mesh* refineSnapTest(ma::Mesh* m) ma::snap(a); } - double avgQualAfter, minQualAfter; + double avgQualAfter=0, minQualAfter=0; measureQuality(m, avgQualAfter, minQualAfter); //Makes sure that refinement is happening @@ -205,10 +206,8 @@ ma::Mesh* refineSnapTest(ma::Mesh* m) return m; } -void adaptTests(const std::function& createMesh) +void adaptTests(ma::Mesh* meshReg, ma::Mesh* meshForced) { - //Mesh created multiple times to compare adaptation - ma::Mesh* meshReg = createMesh(); apf::writeVtkFiles("startMesh", meshReg); refineSnapTest(meshReg); @@ -217,15 +216,12 @@ void adaptTests(const std::function& createMesh) coarsenRegular(meshReg); apf::writeVtkFiles("afterCoarsen", meshReg); - ma::Mesh* meshForce = coarsenForced(refineSnapTest(createMesh())); - apf::writeVtkFiles("afterForcedCoarsen", meshForce); + coarsenForced(refineSnapTest(meshForced)); + apf::writeVtkFiles("afterForcedCoarsen", meshForced); //Make sure setting to force coarsen is functioning - PCU_ALWAYS_ASSERT(countEdges(meshReg) > countEdges(meshForce)); - PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(meshReg) < ma::getAverageEdgeLength(meshForce)); - - meshReg->destroyNative(); - apf::destroyMesh(meshReg); + PCU_ALWAYS_ASSERT(countEdges(meshReg) > countEdges(meshForced)); + PCU_ALWAYS_ASSERT(ma::getAverageEdgeLength(meshReg) < ma::getAverageEdgeLength(meshForced)); } #endif \ No newline at end of file diff --git a/test/aniso_adapt_cap.cc b/test/aniso_adapt_cap.cc index 9cc0bbec5..464c9ed89 100644 --- a/test/aniso_adapt_cap.cc +++ b/test/aniso_adapt_cap.cc @@ -17,24 +17,27 @@ int main(int argc, char** argv) return EXIT_FAILURE; } - gmi_register_mesh(); gmi_cap_start(); gmi_register_cap(); lion_set_verbosity(1); const char* meshFile = argv[1]; - gmi_model* model = gmi_load(meshFile); //Freed in adaptTests + gmi_model* model = gmi_load(meshFile); ma::Mesh* apfCapMesh = apf::createCapMesh(model, &PCUObj); apf::disownCapModel(apfCapMesh); - ma::Mesh* mesh = apf::createMdsMesh(model, apfCapMesh, true); - apf::disownMdsModel(mesh); - apf::destroyMesh(apfCapMesh); + ma::Mesh* mesh1 = apf::createMdsMesh(model, apfCapMesh); + apf::disownMdsModel(mesh1); + ma::Mesh* mesh2 = apf::createMdsMesh(model, apfCapMesh); + apf::disownMdsModel(mesh2); - auto createMeshValues = [model, mesh]() - { return apf::createMdsMesh(model, mesh, true); }; + adaptTests(apfCapMesh, mesh2); - adaptTests(createMeshValues); - apf::destroyMesh(mesh); + mesh1->destroyNative(); + mesh2->destroyNative(); + apfCapMesh->destroyNative(); + apf::destroyMesh(mesh1); + apf::destroyMesh(mesh2); + apf::destroyMesh(apfCapMesh); gmi_cap_stop(); } MPI_Finalize(); diff --git a/test/aniso_adapt_sim.cc b/test/aniso_adapt_sim.cc index 39da0b102..74e472b1e 100644 --- a/test/aniso_adapt_sim.cc +++ b/test/aniso_adapt_sim.cc @@ -37,13 +37,20 @@ int main(int argc, char* argv[]) pGModel model = gmi_export_sim(mdl_ref); pParMesh mesh = PM_load(smsfile, model, progress); ma::Mesh* mesh_ref = apf::createMesh(mesh, PCUObj); + ma::Mesh* mesh1 = apf::createMdsMesh(mdl_ref, mesh_ref); + ma::Mesh* mesh2 = apf::createMdsMesh(mdl_ref, mesh_ref); + apf::disownMdsModel(mesh1); + apf::disownMdsModel(mesh2); - auto createMeshValues = [mdl_ref, mesh_ref]() - { return apf::createMdsMesh(mdl_ref, mesh_ref); }; + adaptTests(mesh1, mesh2); - adaptTests(createMeshValues); - - M_release(mesh); + mesh1->destroyNative(); + mesh2->destroyNative(); + mesh_ref->destroyNative(); + apf::destroyMesh(mesh1); + apf::destroyMesh(mesh2); + apf::destroyMesh(mesh_ref); + gmi_destroy(mdl_ref); Progress_delete(progress); gmi_sim_stop(); SimPartitionedMesh_stop(); diff --git a/test/testing.cmake b/test/testing.cmake index 3ea560159..ecb43e858 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -1025,7 +1025,7 @@ if(PUMI_ENABLE_CAPSTONE) endif() mpi_test(cap_inClosureOf 1 ./cap_inClosureOf ${MESHES}/cap/cube_surf_only.cre) mpi_test(cap_closestPoint 1 ./cap_closestPoint ${MESHES}/cap/cube_surf_only.cre) - mpi_test(adapt_curved_cube 1 ./aniso_adapt_cap "${MESHES}/curvedCube/cap_mesh.cre") + mpi_test(adapt_curved_cube 1 ./aniso_adapt_cap ${MESHES}/curvedCube/cap_mesh.cre) if(PUMI_HAS_CAPSTONE_SIZINGMETRICTOOL) mpi_test(cap_smooth 1 ./cap_smooth) endif() From 1ca51ab8f69d8ec74b0d2fde2e53dbc40bf0cec4 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 6 Nov 2025 18:01:44 -0500 Subject: [PATCH 265/319] rebuild entity --- ma/maCollapse.cc | 20 ++++++++++++-------- ma/maCollapse.h | 1 + ma/maShapeNew.cc | 2 +- 3 files changed, 14 insertions(+), 9 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 63f4b4e45..b1b3ddb1d 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -431,6 +431,14 @@ std::map Collapse::getReusableEntities() return reusable; } +Entity* Collapse::rebuildEntity(Mesh* m, Entity* original, Entity** downward) +{ + Entity* entity = m->createEntity(m->getType(original), m->toModel(original), downward); + if (adapt->buildCallback) adapt->buildCallback->call(entity); + if (rebuildCallback) rebuildCallback->rebuilt(entity, original); + return entity; +} + void Collapse::rebuildElements() { PCU_ALWAYS_ASSERT(elementsToKeep.size()); @@ -440,7 +448,7 @@ void Collapse::rebuildElements() Mesh* m = adapt->mesh; std::map rebuilt = getReusableEntities(); - APF_ITERATE(EntitySet,elementsToKeep,it) { + APF_ITERATE(EntitySet, elementsToKeep, it) { Entity* tetFaces[4]; m->getDownward(*it, 2, tetFaces); for (int f=0; f<4; f++) { @@ -458,19 +466,15 @@ void Collapse::rebuildElements() if (edgeVerts[0] == vertToCollapse) edgeVerts[0] = vertToKeep; else if (edgeVerts[1] == vertToCollapse) edgeVerts[1] = vertToKeep; else continue; - Entity* newEdge = m->createEntity(m->getType(faceEdges[e]), m->toModel(faceEdges[e]), edgeVerts); + Entity* newEdge = rebuildEntity(m, faceEdges[e], edgeVerts); rebuilt[faceEdges[e]] = newEdge; faceEdges[e] = newEdge; } - Entity* newFace = m->createEntity(m->getType(tetFaces[f]), m->toModel(tetFaces[f]), faceEdges); + Entity* newFace = rebuildEntity(m, tetFaces[f], faceEdges); rebuilt[tetFaces[f]] = newFace; tetFaces[f] = newFace; } - - newElements[ni]= m->createEntity(m->getType(*it), m->toModel(*it), tetFaces); - // if (adapt->buildCallback) adapt->buildCallback->call(newElements[ni]); - // if (rebuildCallback) rebuildCallback->rebuilt(newElements[ni], *it); - ni++; + newElements[ni++] = rebuildEntity(m, *it, tetFaces); } cavity.afterBuilding(); } diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 1931f291b..33d6a9353 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -56,6 +56,7 @@ class Collapse RebuildCallback* rebuildCallback; private: std::map getReusableEntities(); + Entity* rebuildEntity(Mesh* m, Entity* original, Entity** downward); }; bool checkEdgeCollapseTopology(Adapt* a, Entity* edge); diff --git a/ma/maShapeNew.cc b/ma/maShapeNew.cc index 839813d75..0b1375329 100644 --- a/ma/maShapeNew.cc +++ b/ma/maShapeNew.cc @@ -479,7 +479,7 @@ class FixShape : public Operator numThreeLargeAngles++; } printBadTypes(); - printBadShape(worstShape); + // printBadShape(worstShape); } }; From ef726a8c09030f25e35a2ac66719b6a7a7abeb22 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 6 Nov 2025 22:51:59 -0500 Subject: [PATCH 266/319] store integrator --- ma/maSize.cc | 40 +++++++++++++++++++++++----------------- 1 file changed, 23 insertions(+), 17 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index e596d0788..e50a0699a 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -184,6 +184,7 @@ class SizeFieldIntegrator : public apf::Integrator { meshElement = me; dimension = apf::getDimension(me); + measurement = 0; } void atPoint(Vector const& p , double w, double ) { @@ -205,14 +206,14 @@ class SizeFieldIntegrator : public apf::Integrator struct MetricSizeField : public SizeField { + MetricSizeField() : integrator(this, 1) + {} double measure(Entity* e) { - SizeFieldIntegrator sFI(this, - std::max(mesh->getShape()->getOrder(), order)+1); apf::MeshElement* me = apf::createMeshElement(mesh, e); - sFI.process(me); + integrator.process(me); apf::destroyMeshElement(me); - return sFI.measurement; + return integrator.measurement; } bool shouldSplit(Entity* edge) { @@ -229,6 +230,7 @@ struct MetricSizeField : public SizeField } Mesh* mesh; int order; // this is the underlying sizefield order (default 1) + SizeFieldIntegrator integrator; }; AnisotropicFunction::~AnisotropicFunction() @@ -391,6 +393,8 @@ struct AnisoSizeField : public MetricSizeField order = apf::getShape(sizes)->getOrder(); hField = sizes; rField = frames; + integrator = SizeFieldIntegrator(this, + std::max(mesh->getShape()->getOrder(), order)+1); } void getTransform( apf::MeshElement* me, @@ -475,6 +479,8 @@ struct LogAnisoSizeField : public MetricSizeField { mesh = m; order = apf::getShape(sizes)->getOrder(); + integrator = SizeFieldIntegrator(this, + std::max(mesh->getShape()->getOrder(), order)+1); logMField = apf::createField(m, "ma_logM", apf::MATRIX, apf::getShape(sizes)); int dim = m->getDimension(); @@ -485,19 +491,19 @@ struct LogAnisoSizeField : public MetricSizeField continue; it = m->begin(d); while( (ent = m->iterate(it)) ){ - int type = m->getType(ent); - int non = apf::getShape(logMField)->countNodesOn(type); - for (int i = 0; i < non; i++) { - Vector h; - Matrix f; - apf::getVector(sizes, ent, i, h); - apf::getMatrix(frames, ent, i, f); - Vector s(log(1/h[0]/h[0]), log(1/h[1]/h[1]), log(1/h[2]/h[2])); - Matrix S(s[0], 0 , 0, - 0 , s[1], 0, - 0 , 0 , s[2]); - apf::setMatrix(logMField, ent, i, f * S * transpose(f)); - } + int type = m->getType(ent); + int non = apf::getShape(logMField)->countNodesOn(type); + for (int i = 0; i < non; i++) { + Vector h; + Matrix f; + apf::getVector(sizes, ent, i, h); + apf::getMatrix(frames, ent, i, f); + Vector s(log(1/h[0]/h[0]), log(1/h[1]/h[1]), log(1/h[2]/h[2])); + Matrix S(s[0], 0 , 0, + 0 , s[1], 0, + 0 , 0 , s[2]); + apf::setMatrix(logMField, ent, i, f * S * transpose(f)); + } } m->end(it); } From d00069af73835edcf4107b370080d89e5c61af4a Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 6 Nov 2025 23:55:45 -0500 Subject: [PATCH 267/319] reuse mesh element --- apf/apfElement.h | 2 +- ma/maSize.cc | 25 +++++++++++-------------- 2 files changed, 12 insertions(+), 15 deletions(-) diff --git a/apf/apfElement.h b/apf/apfElement.h index b54cd5901..9a1b1f185 100644 --- a/apf/apfElement.h +++ b/apf/apfElement.h @@ -36,8 +36,8 @@ class Element FieldShape* getFieldShape() {return field->getShape();} void getComponents(Vector3 const& xi, double* c); void getElementNodeData(NewArray& d); - protected: void init(Field* f, MeshEntity* e, VectorElement* p); + protected: void getNodeData(); Field* field; Mesh* mesh; diff --git a/ma/maSize.cc b/ma/maSize.cc index e50a0699a..6c43bb6b5 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -13,6 +13,7 @@ #include #include #include +#include "apfVectorElement.h" namespace ma { @@ -206,13 +207,14 @@ class SizeFieldIntegrator : public apf::Integrator struct MetricSizeField : public SizeField { - MetricSizeField() : integrator(this, 1) - {} + MetricSizeField(Mesh* m, int o) : mesh(m), order(o), integrator(this, 1) + { + } double measure(Entity* e) { - apf::MeshElement* me = apf::createMeshElement(mesh, e); + if (me == 0) me = apf::createMeshElement(mesh, e); + else me->init(mesh->getCoordinateField(), e, 0); integrator.process(me); - apf::destroyMeshElement(me); return integrator.measurement; } bool shouldSplit(Entity* edge) @@ -231,6 +233,7 @@ struct MetricSizeField : public SizeField Mesh* mesh; int order; // this is the underlying sizefield order (default 1) SizeFieldIntegrator integrator; + apf::MeshElement* me=0; }; AnisotropicFunction::~AnisotropicFunction() @@ -365,18 +368,14 @@ struct LogMEval : public apf::Function struct AnisoSizeField : public MetricSizeField { - AnisoSizeField() + AnisoSizeField() : MetricSizeField(0, 1) { - mesh = 0; - order = 1; } - AnisoSizeField(Mesh* m, AnisotropicFunction* f): + AnisoSizeField(Mesh* m, AnisotropicFunction* f): MetricSizeField(m, 1), bothEval(f), sizesEval(&bothEval), frameEval(&bothEval) { - mesh = m; - order = 1; hField = apf::createUserField(m, "ma_sizes", apf::VECTOR, apf::getLagrange(1), &sizesEval); rField = apf::createUserField(m, "ma_frame", apf::MATRIX, @@ -458,12 +457,10 @@ struct AnisoSizeField : public MetricSizeField struct LogAnisoSizeField : public MetricSizeField { - LogAnisoSizeField() + LogAnisoSizeField() : MetricSizeField(0, 1) { - mesh = 0; - order = 1; } - LogAnisoSizeField(Mesh* m, AnisotropicFunction* f): + LogAnisoSizeField(Mesh* m, AnisotropicFunction* f): MetricSizeField(m, 1), logMEval(f) { mesh = m; From 8cb1eeca5df4e9d88ec100520af7d3c786488970 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 7 Nov 2025 13:38:36 -0500 Subject: [PATCH 268/319] removed integrator --- ma/maSize.cc | 28 ++++++++++++++++++++-------- 1 file changed, 20 insertions(+), 8 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index 6c43bb6b5..35df7b6f3 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -207,15 +207,32 @@ class SizeFieldIntegrator : public apf::Integrator struct MetricSizeField : public SizeField { - MetricSizeField(Mesh* m, int o) : mesh(m), order(o), integrator(this, 1) + MetricSizeField(Mesh* m, int o) : mesh(m), order(o) { } double measure(Entity* e) { if (me == 0) me = apf::createMeshElement(mesh, e); else me->init(mesh->getCoordinateField(), e, 0); - integrator.process(me); - return integrator.measurement; + int integrationOrder = std::max(mesh->getShape()->getOrder(), order)+1; + double measurement = 0; + int dimension = apf::getDimension(me); + int np = countIntPoints(me,integrationOrder); + for (int p=0; p < np; ++p) + { + Vector point; + getIntPoint(me,integrationOrder,p,point); + double w = getIntWeight(me,integrationOrder,p); + Matrix Q; + getTransform(me,point,Q); + Matrix J; + apf::getJacobian(me,point,J); + /* transforms the rows of J, the differential tangent vectors, + into the metric space, then uses the generalized determinant */ + double dV2 = apf::getJacobianDeterminant(J*Q,dimension); + measurement += w*dV2; + } + return measurement; } bool shouldSplit(Entity* edge) { @@ -232,7 +249,6 @@ struct MetricSizeField : public SizeField } Mesh* mesh; int order; // this is the underlying sizefield order (default 1) - SizeFieldIntegrator integrator; apf::MeshElement* me=0; }; @@ -392,8 +408,6 @@ struct AnisoSizeField : public MetricSizeField order = apf::getShape(sizes)->getOrder(); hField = sizes; rField = frames; - integrator = SizeFieldIntegrator(this, - std::max(mesh->getShape()->getOrder(), order)+1); } void getTransform( apf::MeshElement* me, @@ -476,8 +490,6 @@ struct LogAnisoSizeField : public MetricSizeField { mesh = m; order = apf::getShape(sizes)->getOrder(); - integrator = SizeFieldIntegrator(this, - std::max(mesh->getShape()->getOrder(), order)+1); logMField = apf::createField(m, "ma_logM", apf::MATRIX, apf::getShape(sizes)); int dim = m->getDimension(); From fa4d9a0935bd00bf1456724fe6116fae2fdd7c86 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 7 Nov 2025 15:16:11 -0500 Subject: [PATCH 269/319] cache integration points and weight --- ma/maSize.cc | 12 +++++++----- 1 file changed, 7 insertions(+), 5 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index 35df7b6f3..a2651cc32 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -214,22 +214,22 @@ struct MetricSizeField : public SizeField { if (me == 0) me = apf::createMeshElement(mesh, e); else me->init(mesh->getCoordinateField(), e, 0); - int integrationOrder = std::max(mesh->getShape()->getOrder(), order)+1; + int integrationOrder = std::max(mesh->getShape()->getOrder(), order)+1; double measurement = 0; - int dimension = apf::getDimension(me); - int np = countIntPoints(me,integrationOrder); + int dim = apf::getDimension(me); + int np = numIntegrationPoints.try_emplace(dim, countIntPoints(me,integrationOrder)).first->second; + double w = integrationWeight.try_emplace(dim, getIntWeight(me,integrationOrder,0)).first->second; for (int p=0; p < np; ++p) { Vector point; getIntPoint(me,integrationOrder,p,point); - double w = getIntWeight(me,integrationOrder,p); Matrix Q; getTransform(me,point,Q); Matrix J; apf::getJacobian(me,point,J); /* transforms the rows of J, the differential tangent vectors, into the metric space, then uses the generalized determinant */ - double dV2 = apf::getJacobianDeterminant(J*Q,dimension); + double dV2 = apf::getJacobianDeterminant(J*Q,dim); measurement += w*dV2; } return measurement; @@ -250,6 +250,8 @@ struct MetricSizeField : public SizeField Mesh* mesh; int order; // this is the underlying sizefield order (default 1) apf::MeshElement* me=0; + std::map numIntegrationPoints; + std::map integrationWeight; }; AnisotropicFunction::~AnisotropicFunction() From fef51920e5a2a005b7369ce4b8e141dab60b8cad Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 7 Nov 2025 15:48:00 -0500 Subject: [PATCH 270/319] cache log field element --- ma/maSize.cc | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index a2651cc32..74b16a0a3 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -416,6 +416,7 @@ struct AnisoSizeField : public MetricSizeField Vector const& xi, Matrix& Q) { + //TODO: cache these elements apf::Element* hElement = apf::createElement(hField,me); apf::Element* rElement = apf::createElement(rField,me); Vector h; @@ -525,10 +526,10 @@ struct LogAnisoSizeField : public MetricSizeField Vector const& xi, Matrix& Q) { - apf::Element* logMElement = apf::createElement(logMField,me); + if (logMElement==0) logMElement = apf::createElement(logMField,me); + else logMElement->init(logMField,me->getEntity(),me); Matrix logM; apf::getMatrix(logMElement,xi,logM); - apf::destroyElement(logMElement); Vector v; Matrix R; orthogonalEigenDecompForSymmetricMatrix(logM, v, R); @@ -542,11 +543,11 @@ struct LogAnisoSizeField : public MetricSizeField Vector const& xi, Entity* newVert) { - apf::Element* logMElement = apf::createElement(logMField,parent); + if (logMElement==0) logMElement = apf::createElement(logMField,parent); + else logMElement->init(logMField,parent->getEntity(),parent); Matrix logM; apf::getMatrix(logMElement,xi,logM); this->setValue(newVert,logM); - apf::destroyElement(logMElement); } void setValue( Entity* vert, @@ -591,6 +592,7 @@ struct LogAnisoSizeField : public MetricSizeField return apf::getShape(logMField)->hasNodesIn(dimension); } apf::NewArray fieldVal; + apf::Element* logMElement=0; apf::Field* logMField; LogMEval logMEval; }; From 3dff5ce1b12310fa2d0e6d7f0a1579e7331d2594 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 7 Nov 2025 17:04:21 -0500 Subject: [PATCH 271/319] cache integration point --- ma/maSize.cc | 11 ++++++++--- 1 file changed, 8 insertions(+), 3 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index 74b16a0a3..ea71093d3 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -219,10 +219,14 @@ struct MetricSizeField : public SizeField int dim = apf::getDimension(me); int np = numIntegrationPoints.try_emplace(dim, countIntPoints(me,integrationOrder)).first->second; double w = integrationWeight.try_emplace(dim, getIntWeight(me,integrationOrder,0)).first->second; - for (int p=0; p < np; ++p) - { + for (int p=0; p < np; ++p) { Vector point; - getIntPoint(me,integrationOrder,p,point); + auto it = integrationPoint.find({dim, p}); + if (it == integrationPoint.end()) { + getIntPoint(me,integrationOrder,p,point); + integrationPoint.insert(it, {{dim, p}, point}); + } + else point = it->second; Matrix Q; getTransform(me,point,Q); Matrix J; @@ -252,6 +256,7 @@ struct MetricSizeField : public SizeField apf::MeshElement* me=0; std::map numIntegrationPoints; std::map integrationWeight; + std::map, Vector> integrationPoint; }; AnisotropicFunction::~AnisotropicFunction() From 4dec00b953ff67fc8b0748f968f84efec9d3fad6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 7 Nov 2025 20:10:04 -0500 Subject: [PATCH 272/319] reuse last field element --- ma/maSize.cc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index ea71093d3..c0a39ea9b 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -532,7 +532,7 @@ struct LogAnisoSizeField : public MetricSizeField Matrix& Q) { if (logMElement==0) logMElement = apf::createElement(logMField,me); - else logMElement->init(logMField,me->getEntity(),me); + else if (me->getEntity() != logMElement->getEntity()) logMElement->init(logMField,me->getEntity(),me); Matrix logM; apf::getMatrix(logMElement,xi,logM); Vector v; @@ -549,7 +549,7 @@ struct LogAnisoSizeField : public MetricSizeField Entity* newVert) { if (logMElement==0) logMElement = apf::createElement(logMField,parent); - else logMElement->init(logMField,parent->getEntity(),parent); + else if (parent->getEntity() != logMElement->getEntity()) logMElement->init(logMField,parent->getEntity(),parent); Matrix logM; apf::getMatrix(logMElement,xi,logM); this->setValue(newVert,logM); From 9811881e1bfb896f8d2d3d324ca7d973f01b56f4 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 7 Nov 2025 23:56:03 -0500 Subject: [PATCH 273/319] using eigen library --- CMakeLists.txt | 1 + Eigen/CMakeLists.txt | 4 + Eigen/Cholesky | 46 + Eigen/CholmodSupport | 48 + Eigen/Core | 562 + Eigen/Dense | 7 + Eigen/Eigen | 2 + Eigen/Eigenvalues | 61 + Eigen/Geometry | 61 + Eigen/Householder | 30 + Eigen/IterativeLinearSolvers | 48 + Eigen/Jacobi | 33 + Eigen/KLUSupport | 41 + Eigen/LU | 50 + Eigen/MetisSupport | 35 + Eigen/OrderingMethods | 73 + Eigen/PaStiXSupport | 49 + Eigen/PardisoSupport | 35 + Eigen/QR | 51 + Eigen/QtAlignedMalloc | 40 + Eigen/SPQRSupport | 34 + Eigen/SVD | 51 + Eigen/Sparse | 36 + Eigen/SparseCholesky | 45 + Eigen/SparseCore | 69 + Eigen/SparseLU | 46 + Eigen/SparseQR | 37 + Eigen/StdDeque | 27 + Eigen/StdList | 26 + Eigen/StdVector | 27 + Eigen/SuperLUSupport | 64 + Eigen/UmfPackSupport | 40 + Eigen/src/Cholesky/LDLT.h | 670 + Eigen/src/Cholesky/LLT.h | 541 + Eigen/src/Cholesky/LLT_LAPACKE.h | 99 + Eigen/src/CholmodSupport/CholmodSupport.h | 682 + Eigen/src/Core/ArithmeticSequence.h | 350 + Eigen/src/Core/Array.h | 331 + Eigen/src/Core/ArrayBase.h | 226 + Eigen/src/Core/ArrayWrapper.h | 209 + Eigen/src/Core/Assign.h | 90 + Eigen/src/Core/AssignEvaluator.h | 935 + Eigen/src/Core/Assign_MKL.h | 176 + Eigen/src/Core/BandMatrix.h | 353 + Eigen/src/Core/Block.h | 452 + Eigen/src/Core/BooleanRedux.h | 162 + Eigen/src/Core/CommaInitializer.h | 160 + Eigen/src/Core/ConditionEstimator.h | 175 + Eigen/src/Core/CoreEvaluators.h | 1746 ++ Eigen/src/Core/CoreIterators.h | 132 + Eigen/src/Core/CwiseBinaryOp.h | 183 + Eigen/src/Core/CwiseNullaryOp.h | 902 + Eigen/src/Core/CwiseTernaryOp.h | 197 + Eigen/src/Core/CwiseUnaryOp.h | 103 + Eigen/src/Core/CwiseUnaryView.h | 128 + Eigen/src/Core/DenseBase.h | 615 + Eigen/src/Core/DenseCoeffsBase.h | 681 + Eigen/src/Core/DenseStorage.h | 570 + Eigen/src/Core/Diagonal.h | 259 + Eigen/src/Core/DiagonalMatrix.h | 343 + Eigen/src/Core/DiagonalProduct.h | 28 + Eigen/src/Core/Dot.h | 315 + Eigen/src/Core/EigenBase.h | 159 + Eigen/src/Core/ForceAlignedAccess.h | 146 + Eigen/src/Core/Fuzzy.h | 155 + Eigen/src/Core/GeneralProduct.h | 466 + Eigen/src/Core/GenericPacketMath.h | 598 + Eigen/src/Core/GlobalFunctions.h | 185 + Eigen/src/Core/IO.h | 225 + Eigen/src/Core/IndexedView.h | 207 + Eigen/src/Core/Inverse.h | 118 + Eigen/src/Core/Map.h | 171 + Eigen/src/Core/MapBase.h | 299 + Eigen/src/Core/MathFunctions.h | 1711 ++ Eigen/src/Core/MathFunctionsImpl.h | 73 + Eigen/src/Core/Matrix.h | 461 + Eigen/src/Core/MatrixBase.h | 525 + Eigen/src/Core/NestByValue.h | 110 + Eigen/src/Core/NoAlias.h | 109 + Eigen/src/Core/NumTraits.h | 282 + Eigen/src/Core/PermutationMatrix.h | 633 + Eigen/src/Core/PlainObjectBase.h | 1035 + Eigen/src/Core/Product.h | 186 + Eigen/src/Core/ProductEvaluators.h | 1105 ++ Eigen/src/Core/Random.h | 182 + Eigen/src/Core/Redux.h | 505 + Eigen/src/Core/Ref.h | 285 + Eigen/src/Core/Replicate.h | 142 + Eigen/src/Core/ReturnByValue.h | 117 + Eigen/src/Core/Reverse.h | 211 + Eigen/src/Core/Select.h | 162 + Eigen/src/Core/SelfAdjointView.h | 352 + Eigen/src/Core/SelfCwiseBinaryOp.h | 51 + Eigen/src/Core/Solve.h | 188 + Eigen/src/Core/SolveTriangular.h | 232 + Eigen/src/Core/SolverBase.h | 130 + Eigen/src/Core/StableNorm.h | 221 + Eigen/src/Core/Stride.h | 111 + Eigen/src/Core/Swap.h | 67 + Eigen/src/Core/Transpose.h | 403 + Eigen/src/Core/Transpositions.h | 407 + Eigen/src/Core/TriangularMatrix.h | 984 + Eigen/src/Core/VectorBlock.h | 96 + Eigen/src/Core/VectorwiseOp.h | 695 + Eigen/src/Core/Visitor.h | 273 + Eigen/src/Core/arch/AVX/Complex.h | 451 + Eigen/src/Core/arch/AVX/MathFunctions.h | 439 + Eigen/src/Core/arch/AVX/PacketMath.h | 643 + Eigen/src/Core/arch/AVX/TypeCasting.h | 51 + Eigen/src/Core/arch/AVX512/MathFunctions.h | 396 + Eigen/src/Core/arch/AVX512/PacketMath.h | 1286 ++ Eigen/src/Core/arch/AltiVec/Complex.h | 430 + Eigen/src/Core/arch/AltiVec/MathFunctions.h | 322 + Eigen/src/Core/arch/AltiVec/PacketMath.h | 1033 + Eigen/src/Core/arch/CUDA/Complex.h | 103 + Eigen/src/Core/arch/CUDA/Half.h | 666 + Eigen/src/Core/arch/CUDA/MathFunctions.h | 103 + Eigen/src/Core/arch/CUDA/PacketMath.h | 333 + Eigen/src/Core/arch/CUDA/PacketMathHalf.h | 1133 ++ Eigen/src/Core/arch/CUDA/TypeCasting.h | 212 + Eigen/src/Core/arch/Default/ConjHelper.h | 29 + Eigen/src/Core/arch/Default/Settings.h | 49 + Eigen/src/Core/arch/NEON/Complex.h | 490 + Eigen/src/Core/arch/NEON/MathFunctions.h | 183 + Eigen/src/Core/arch/NEON/PacketMath.h | 729 + Eigen/src/Core/arch/SSE/Complex.h | 471 + Eigen/src/Core/arch/SSE/MathFunctions.h | 562 + Eigen/src/Core/arch/SSE/PacketMath.h | 931 + Eigen/src/Core/arch/SSE/TypeCasting.h | 77 + Eigen/src/Core/arch/ZVector/Complex.h | 563 + Eigen/src/Core/arch/ZVector/MathFunctions.h | 232 + Eigen/src/Core/arch/ZVector/PacketMath.h | 1191 ++ Eigen/src/Core/functors/AssignmentFunctors.h | 168 + Eigen/src/Core/functors/BinaryFunctors.h | 482 + Eigen/src/Core/functors/NullaryFunctors.h | 188 + Eigen/src/Core/functors/StlFunctors.h | 132 + Eigen/src/Core/functors/TernaryFunctors.h | 25 + Eigen/src/Core/functors/UnaryFunctors.h | 830 + .../Core/products/GeneralBlockPanelKernel.h | 2149 ++ Eigen/src/Core/products/GeneralMatrixMatrix.h | 498 + .../products/GeneralMatrixMatrixTriangular.h | 311 + .../GeneralMatrixMatrixTriangular_BLAS.h | 145 + .../Core/products/GeneralMatrixMatrix_BLAS.h | 122 + Eigen/src/Core/products/GeneralMatrixVector.h | 405 + .../Core/products/GeneralMatrixVector_BLAS.h | 136 + Eigen/src/Core/products/Parallelizer.h | 163 + .../Core/products/SelfadjointMatrixMatrix.h | 521 + .../products/SelfadjointMatrixMatrix_BLAS.h | 287 + .../Core/products/SelfadjointMatrixVector.h | 260 + .../products/SelfadjointMatrixVector_BLAS.h | 118 + Eigen/src/Core/products/SelfadjointProduct.h | 133 + .../Core/products/SelfadjointRank2Update.h | 93 + .../Core/products/TriangularMatrixMatrix.h | 466 + .../products/TriangularMatrixMatrix_BLAS.h | 315 + .../Core/products/TriangularMatrixVector.h | 350 + .../products/TriangularMatrixVector_BLAS.h | 255 + .../Core/products/TriangularSolverMatrix.h | 335 + .../products/TriangularSolverMatrix_BLAS.h | 163 + .../Core/products/TriangularSolverVector.h | 145 + Eigen/src/Core/util/BlasUtil.h | 403 + Eigen/src/Core/util/Constants.h | 551 + Eigen/src/Core/util/DisableStupidWarnings.h | 79 + Eigen/src/Core/util/ForwardDeclarations.h | 303 + Eigen/src/Core/util/IndexedViewHelper.h | 187 + Eigen/src/Core/util/IntegralConstant.h | 270 + Eigen/src/Core/util/MKL_support.h | 137 + Eigen/src/Core/util/Macros.h | 1031 + Eigen/src/Core/util/Memory.h | 985 + Eigen/src/Core/util/Meta.h | 550 + Eigen/src/Core/util/NonMPL2.h | 3 + Eigen/src/Core/util/ReenableStupidWarnings.h | 27 + Eigen/src/Core/util/StaticAssert.h | 218 + Eigen/src/Core/util/SymbolicIndex.h | 300 + Eigen/src/Core/util/XprHelper.h | 835 + Eigen/src/Eigenvalues/ComplexEigenSolver.h | 346 + Eigen/src/Eigenvalues/ComplexSchur.h | 459 + Eigen/src/Eigenvalues/ComplexSchur_LAPACKE.h | 91 + Eigen/src/Eigenvalues/EigenSolver.h | 622 + .../src/Eigenvalues/GeneralizedEigenSolver.h | 419 + .../GeneralizedSelfAdjointEigenSolver.h | 226 + .../src/Eigenvalues/HessenbergDecomposition.h | 374 + Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h | 160 + Eigen/src/Eigenvalues/RealQZ.h | 654 + Eigen/src/Eigenvalues/RealSchur.h | 546 + Eigen/src/Eigenvalues/RealSchur_LAPACKE.h | 77 + .../src/Eigenvalues/SelfAdjointEigenSolver.h | 870 + .../SelfAdjointEigenSolver_LAPACKE.h | 90 + Eigen/src/Eigenvalues/Tridiagonalization.h | 556 + Eigen/src/Geometry/AlignedBox.h | 392 + Eigen/src/Geometry/AngleAxis.h | 247 + Eigen/src/Geometry/EulerAngles.h | 114 + Eigen/src/Geometry/Homogeneous.h | 497 + Eigen/src/Geometry/Hyperplane.h | 282 + Eigen/src/Geometry/OrthoMethods.h | 234 + Eigen/src/Geometry/ParametrizedLine.h | 232 + Eigen/src/Geometry/Quaternion.h | 814 + Eigen/src/Geometry/Rotation2D.h | 199 + Eigen/src/Geometry/RotationBase.h | 206 + Eigen/src/Geometry/Scaling.h | 188 + Eigen/src/Geometry/Transform.h | 1542 ++ Eigen/src/Geometry/Translation.h | 208 + Eigen/src/Geometry/Umeyama.h | 166 + Eigen/src/Geometry/arch/Geometry_SSE.h | 161 + Eigen/src/Householder/BlockHouseholder.h | 103 + Eigen/src/Householder/Householder.h | 172 + Eigen/src/Householder/HouseholderSequence.h | 470 + .../BasicPreconditioners.h | 226 + Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | 228 + .../ConjugateGradient.h | 245 + .../IncompleteCholesky.h | 400 + .../IterativeLinearSolvers/IncompleteLUT.h | 462 + .../IterativeSolverBase.h | 394 + .../LeastSquareConjugateGradient.h | 216 + .../IterativeLinearSolvers/SolveWithGuess.h | 115 + Eigen/src/Jacobi/Jacobi.h | 474 + Eigen/src/KLUSupport/KLUSupport.h | 358 + Eigen/src/LU/Determinant.h | 101 + Eigen/src/LU/FullPivLU.h | 889 + Eigen/src/LU/InverseImpl.h | 415 + Eigen/src/LU/PartialPivLU.h | 611 + Eigen/src/LU/PartialPivLU_LAPACKE.h | 83 + Eigen/src/LU/arch/Inverse_SSE.h | 338 + Eigen/src/MetisSupport/MetisSupport.h | 137 + Eigen/src/OrderingMethods/Amd.h | 445 + Eigen/src/OrderingMethods/Eigen_Colamd.h | 1843 ++ Eigen/src/OrderingMethods/Ordering.h | 157 + Eigen/src/PaStiXSupport/PaStiXSupport.h | 678 + Eigen/src/PardisoSupport/PardisoSupport.h | 543 + Eigen/src/QR/ColPivHouseholderQR.h | 652 + Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h | 97 + .../src/QR/CompleteOrthogonalDecomposition.h | 562 + Eigen/src/QR/FullPivHouseholderQR.h | 675 + Eigen/src/QR/HouseholderQR.h | 408 + Eigen/src/QR/HouseholderQR_LAPACKE.h | 68 + Eigen/src/SPQRSupport/SuiteSparseQRSupport.h | 313 + Eigen/src/SVD/BDCSVD.h | 1319 ++ Eigen/src/SVD/JacobiSVD.h | 804 + Eigen/src/SVD/JacobiSVD_LAPACKE.h | 91 + Eigen/src/SVD/SVDBase.h | 312 + Eigen/src/SVD/UpperBidiagonalization.h | 414 + Eigen/src/SparseCholesky/SimplicialCholesky.h | 689 + .../SparseCholesky/SimplicialCholesky_impl.h | 199 + Eigen/src/SparseCore/AmbiVector.h | 377 + Eigen/src/SparseCore/CompressedStorage.h | 258 + .../ConservativeSparseSparseProduct.h | 352 + Eigen/src/SparseCore/MappedSparseMatrix.h | 67 + Eigen/src/SparseCore/SparseAssign.h | 216 + Eigen/src/SparseCore/SparseBlock.h | 603 + Eigen/src/SparseCore/SparseColEtree.h | 206 + Eigen/src/SparseCore/SparseCompressedBase.h | 357 + Eigen/src/SparseCore/SparseCwiseBinaryOp.h | 722 + Eigen/src/SparseCore/SparseCwiseUnaryOp.h | 148 + Eigen/src/SparseCore/SparseDenseProduct.h | 320 + Eigen/src/SparseCore/SparseDiagonalProduct.h | 138 + Eigen/src/SparseCore/SparseDot.h | 98 + Eigen/src/SparseCore/SparseFuzzy.h | 29 + Eigen/src/SparseCore/SparseMap.h | 305 + Eigen/src/SparseCore/SparseMatrix.h | 1403 ++ Eigen/src/SparseCore/SparseMatrixBase.h | 405 + Eigen/src/SparseCore/SparsePermutation.h | 178 + Eigen/src/SparseCore/SparseProduct.h | 169 + Eigen/src/SparseCore/SparseRedux.h | 49 + Eigen/src/SparseCore/SparseRef.h | 397 + Eigen/src/SparseCore/SparseSelfAdjointView.h | 656 + Eigen/src/SparseCore/SparseSolverBase.h | 124 + .../SparseSparseProductWithPruning.h | 198 + Eigen/src/SparseCore/SparseTranspose.h | 92 + Eigen/src/SparseCore/SparseTriangularView.h | 189 + Eigen/src/SparseCore/SparseUtil.h | 178 + Eigen/src/SparseCore/SparseVector.h | 478 + Eigen/src/SparseCore/SparseView.h | 253 + Eigen/src/SparseCore/TriangularSolver.h | 315 + Eigen/src/SparseLU/SparseLU.h | 775 + Eigen/src/SparseLU/SparseLUImpl.h | 66 + Eigen/src/SparseLU/SparseLU_Memory.h | 226 + Eigen/src/SparseLU/SparseLU_Structs.h | 110 + .../src/SparseLU/SparseLU_SupernodalMatrix.h | 301 + Eigen/src/SparseLU/SparseLU_Utils.h | 80 + Eigen/src/SparseLU/SparseLU_column_bmod.h | 181 + Eigen/src/SparseLU/SparseLU_column_dfs.h | 179 + Eigen/src/SparseLU/SparseLU_copy_to_ucol.h | 107 + Eigen/src/SparseLU/SparseLU_gemm_kernel.h | 280 + .../src/SparseLU/SparseLU_heap_relax_snode.h | 126 + Eigen/src/SparseLU/SparseLU_kernel_bmod.h | 130 + Eigen/src/SparseLU/SparseLU_panel_bmod.h | 223 + Eigen/src/SparseLU/SparseLU_panel_dfs.h | 258 + Eigen/src/SparseLU/SparseLU_pivotL.h | 137 + Eigen/src/SparseLU/SparseLU_pruneL.h | 136 + Eigen/src/SparseLU/SparseLU_relax_snode.h | 83 + Eigen/src/SparseQR/SparseQR.h | 739 + Eigen/src/StlSupport/StdDeque.h | 126 + Eigen/src/StlSupport/StdList.h | 106 + Eigen/src/StlSupport/StdVector.h | 131 + Eigen/src/StlSupport/details.h | 84 + Eigen/src/SuperLUSupport/SuperLUSupport.h | 1027 + Eigen/src/UmfPackSupport/UmfPackSupport.h | 506 + Eigen/src/misc/Image.h | 82 + Eigen/src/misc/Kernel.h | 79 + Eigen/src/misc/RealSvd2x2.h | 55 + Eigen/src/misc/blas.h | 440 + Eigen/src/misc/lapack.h | 152 + Eigen/src/misc/lapacke.h | 16292 ++++++++++++++++ Eigen/src/misc/lapacke_mangling.h | 17 + Eigen/src/plugins/ArrayCwiseBinaryOps.h | 332 + Eigen/src/plugins/ArrayCwiseUnaryOps.h | 567 + Eigen/src/plugins/BlockMethods.h | 1356 ++ Eigen/src/plugins/CommonCwiseBinaryOps.h | 115 + Eigen/src/plugins/CommonCwiseUnaryOps.h | 163 + Eigen/src/plugins/IndexedViewMethods.h | 267 + Eigen/src/plugins/MatrixCwiseBinaryOps.h | 152 + Eigen/src/plugins/MatrixCwiseUnaryOps.h | 85 + apf/CMakeLists.txt | 2 + apf/apfMatrix.cc | 29 +- 313 files changed, 119800 insertions(+), 7 deletions(-) create mode 100644 Eigen/CMakeLists.txt create mode 100644 Eigen/Cholesky create mode 100644 Eigen/CholmodSupport create mode 100644 Eigen/Core create mode 100644 Eigen/Dense create mode 100644 Eigen/Eigen create mode 100644 Eigen/Eigenvalues create mode 100644 Eigen/Geometry create mode 100644 Eigen/Householder create mode 100644 Eigen/IterativeLinearSolvers create mode 100644 Eigen/Jacobi create mode 100644 Eigen/KLUSupport create mode 100644 Eigen/LU create mode 100644 Eigen/MetisSupport create mode 100644 Eigen/OrderingMethods create mode 100644 Eigen/PaStiXSupport create mode 100755 Eigen/PardisoSupport create mode 100644 Eigen/QR create mode 100644 Eigen/QtAlignedMalloc create mode 100644 Eigen/SPQRSupport create mode 100644 Eigen/SVD create mode 100644 Eigen/Sparse create mode 100644 Eigen/SparseCholesky create mode 100644 Eigen/SparseCore create mode 100644 Eigen/SparseLU create mode 100644 Eigen/SparseQR create mode 100644 Eigen/StdDeque create mode 100644 Eigen/StdList create mode 100644 Eigen/StdVector create mode 100644 Eigen/SuperLUSupport create mode 100644 Eigen/UmfPackSupport create mode 100644 Eigen/src/Cholesky/LDLT.h create mode 100644 Eigen/src/Cholesky/LLT.h create mode 100644 Eigen/src/Cholesky/LLT_LAPACKE.h create mode 100644 Eigen/src/CholmodSupport/CholmodSupport.h create mode 100644 Eigen/src/Core/ArithmeticSequence.h create mode 100644 Eigen/src/Core/Array.h create mode 100644 Eigen/src/Core/ArrayBase.h create mode 100644 Eigen/src/Core/ArrayWrapper.h create mode 100644 Eigen/src/Core/Assign.h create mode 100644 Eigen/src/Core/AssignEvaluator.h create mode 100755 Eigen/src/Core/Assign_MKL.h create mode 100644 Eigen/src/Core/BandMatrix.h create mode 100644 Eigen/src/Core/Block.h create mode 100644 Eigen/src/Core/BooleanRedux.h create mode 100644 Eigen/src/Core/CommaInitializer.h create mode 100644 Eigen/src/Core/ConditionEstimator.h create mode 100644 Eigen/src/Core/CoreEvaluators.h create mode 100644 Eigen/src/Core/CoreIterators.h create mode 100644 Eigen/src/Core/CwiseBinaryOp.h create mode 100644 Eigen/src/Core/CwiseNullaryOp.h create mode 100644 Eigen/src/Core/CwiseTernaryOp.h create mode 100644 Eigen/src/Core/CwiseUnaryOp.h create mode 100644 Eigen/src/Core/CwiseUnaryView.h create mode 100644 Eigen/src/Core/DenseBase.h create mode 100644 Eigen/src/Core/DenseCoeffsBase.h create mode 100644 Eigen/src/Core/DenseStorage.h create mode 100644 Eigen/src/Core/Diagonal.h create mode 100644 Eigen/src/Core/DiagonalMatrix.h create mode 100644 Eigen/src/Core/DiagonalProduct.h create mode 100644 Eigen/src/Core/Dot.h create mode 100644 Eigen/src/Core/EigenBase.h create mode 100644 Eigen/src/Core/ForceAlignedAccess.h create mode 100644 Eigen/src/Core/Fuzzy.h create mode 100644 Eigen/src/Core/GeneralProduct.h create mode 100644 Eigen/src/Core/GenericPacketMath.h create mode 100644 Eigen/src/Core/GlobalFunctions.h create mode 100644 Eigen/src/Core/IO.h create mode 100644 Eigen/src/Core/IndexedView.h create mode 100644 Eigen/src/Core/Inverse.h create mode 100644 Eigen/src/Core/Map.h create mode 100644 Eigen/src/Core/MapBase.h create mode 100644 Eigen/src/Core/MathFunctions.h create mode 100644 Eigen/src/Core/MathFunctionsImpl.h create mode 100644 Eigen/src/Core/Matrix.h create mode 100644 Eigen/src/Core/MatrixBase.h create mode 100644 Eigen/src/Core/NestByValue.h create mode 100644 Eigen/src/Core/NoAlias.h create mode 100644 Eigen/src/Core/NumTraits.h create mode 100644 Eigen/src/Core/PermutationMatrix.h create mode 100644 Eigen/src/Core/PlainObjectBase.h create mode 100644 Eigen/src/Core/Product.h create mode 100644 Eigen/src/Core/ProductEvaluators.h create mode 100644 Eigen/src/Core/Random.h create mode 100644 Eigen/src/Core/Redux.h create mode 100644 Eigen/src/Core/Ref.h create mode 100644 Eigen/src/Core/Replicate.h create mode 100644 Eigen/src/Core/ReturnByValue.h create mode 100644 Eigen/src/Core/Reverse.h create mode 100644 Eigen/src/Core/Select.h create mode 100644 Eigen/src/Core/SelfAdjointView.h create mode 100644 Eigen/src/Core/SelfCwiseBinaryOp.h create mode 100644 Eigen/src/Core/Solve.h create mode 100644 Eigen/src/Core/SolveTriangular.h create mode 100644 Eigen/src/Core/SolverBase.h create mode 100644 Eigen/src/Core/StableNorm.h create mode 100644 Eigen/src/Core/Stride.h create mode 100644 Eigen/src/Core/Swap.h create mode 100644 Eigen/src/Core/Transpose.h create mode 100644 Eigen/src/Core/Transpositions.h create mode 100644 Eigen/src/Core/TriangularMatrix.h create mode 100644 Eigen/src/Core/VectorBlock.h create mode 100644 Eigen/src/Core/VectorwiseOp.h create mode 100644 Eigen/src/Core/Visitor.h create mode 100644 Eigen/src/Core/arch/AVX/Complex.h create mode 100644 Eigen/src/Core/arch/AVX/MathFunctions.h create mode 100644 Eigen/src/Core/arch/AVX/PacketMath.h create mode 100644 Eigen/src/Core/arch/AVX/TypeCasting.h create mode 100644 Eigen/src/Core/arch/AVX512/MathFunctions.h create mode 100644 Eigen/src/Core/arch/AVX512/PacketMath.h create mode 100644 Eigen/src/Core/arch/AltiVec/Complex.h create mode 100644 Eigen/src/Core/arch/AltiVec/MathFunctions.h create mode 100755 Eigen/src/Core/arch/AltiVec/PacketMath.h create mode 100644 Eigen/src/Core/arch/CUDA/Complex.h create mode 100644 Eigen/src/Core/arch/CUDA/Half.h create mode 100644 Eigen/src/Core/arch/CUDA/MathFunctions.h create mode 100644 Eigen/src/Core/arch/CUDA/PacketMath.h create mode 100644 Eigen/src/Core/arch/CUDA/PacketMathHalf.h create mode 100644 Eigen/src/Core/arch/CUDA/TypeCasting.h create mode 100644 Eigen/src/Core/arch/Default/ConjHelper.h create mode 100644 Eigen/src/Core/arch/Default/Settings.h create mode 100644 Eigen/src/Core/arch/NEON/Complex.h create mode 100644 Eigen/src/Core/arch/NEON/MathFunctions.h create mode 100644 Eigen/src/Core/arch/NEON/PacketMath.h create mode 100644 Eigen/src/Core/arch/SSE/Complex.h create mode 100644 Eigen/src/Core/arch/SSE/MathFunctions.h create mode 100755 Eigen/src/Core/arch/SSE/PacketMath.h create mode 100644 Eigen/src/Core/arch/SSE/TypeCasting.h create mode 100644 Eigen/src/Core/arch/ZVector/Complex.h create mode 100644 Eigen/src/Core/arch/ZVector/MathFunctions.h create mode 100755 Eigen/src/Core/arch/ZVector/PacketMath.h create mode 100644 Eigen/src/Core/functors/AssignmentFunctors.h create mode 100644 Eigen/src/Core/functors/BinaryFunctors.h create mode 100644 Eigen/src/Core/functors/NullaryFunctors.h create mode 100644 Eigen/src/Core/functors/StlFunctors.h create mode 100644 Eigen/src/Core/functors/TernaryFunctors.h create mode 100644 Eigen/src/Core/functors/UnaryFunctors.h create mode 100644 Eigen/src/Core/products/GeneralBlockPanelKernel.h create mode 100644 Eigen/src/Core/products/GeneralMatrixMatrix.h create mode 100644 Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h create mode 100644 Eigen/src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h create mode 100644 Eigen/src/Core/products/GeneralMatrixMatrix_BLAS.h create mode 100644 Eigen/src/Core/products/GeneralMatrixVector.h create mode 100644 Eigen/src/Core/products/GeneralMatrixVector_BLAS.h create mode 100644 Eigen/src/Core/products/Parallelizer.h create mode 100644 Eigen/src/Core/products/SelfadjointMatrixMatrix.h create mode 100644 Eigen/src/Core/products/SelfadjointMatrixMatrix_BLAS.h create mode 100644 Eigen/src/Core/products/SelfadjointMatrixVector.h create mode 100644 Eigen/src/Core/products/SelfadjointMatrixVector_BLAS.h create mode 100644 Eigen/src/Core/products/SelfadjointProduct.h create mode 100644 Eigen/src/Core/products/SelfadjointRank2Update.h create mode 100644 Eigen/src/Core/products/TriangularMatrixMatrix.h create mode 100644 Eigen/src/Core/products/TriangularMatrixMatrix_BLAS.h create mode 100644 Eigen/src/Core/products/TriangularMatrixVector.h create mode 100644 Eigen/src/Core/products/TriangularMatrixVector_BLAS.h create mode 100644 Eigen/src/Core/products/TriangularSolverMatrix.h create mode 100644 Eigen/src/Core/products/TriangularSolverMatrix_BLAS.h create mode 100644 Eigen/src/Core/products/TriangularSolverVector.h create mode 100755 Eigen/src/Core/util/BlasUtil.h create mode 100644 Eigen/src/Core/util/Constants.h create mode 100755 Eigen/src/Core/util/DisableStupidWarnings.h create mode 100644 Eigen/src/Core/util/ForwardDeclarations.h create mode 100644 Eigen/src/Core/util/IndexedViewHelper.h create mode 100644 Eigen/src/Core/util/IntegralConstant.h create mode 100755 Eigen/src/Core/util/MKL_support.h create mode 100644 Eigen/src/Core/util/Macros.h create mode 100644 Eigen/src/Core/util/Memory.h create mode 100755 Eigen/src/Core/util/Meta.h create mode 100644 Eigen/src/Core/util/NonMPL2.h create mode 100644 Eigen/src/Core/util/ReenableStupidWarnings.h create mode 100644 Eigen/src/Core/util/StaticAssert.h create mode 100644 Eigen/src/Core/util/SymbolicIndex.h create mode 100644 Eigen/src/Core/util/XprHelper.h create mode 100644 Eigen/src/Eigenvalues/ComplexEigenSolver.h create mode 100644 Eigen/src/Eigenvalues/ComplexSchur.h create mode 100644 Eigen/src/Eigenvalues/ComplexSchur_LAPACKE.h create mode 100644 Eigen/src/Eigenvalues/EigenSolver.h create mode 100644 Eigen/src/Eigenvalues/GeneralizedEigenSolver.h create mode 100644 Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h create mode 100644 Eigen/src/Eigenvalues/HessenbergDecomposition.h create mode 100644 Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h create mode 100644 Eigen/src/Eigenvalues/RealQZ.h create mode 100644 Eigen/src/Eigenvalues/RealSchur.h create mode 100644 Eigen/src/Eigenvalues/RealSchur_LAPACKE.h create mode 100644 Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h create mode 100644 Eigen/src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h create mode 100644 Eigen/src/Eigenvalues/Tridiagonalization.h create mode 100644 Eigen/src/Geometry/AlignedBox.h create mode 100644 Eigen/src/Geometry/AngleAxis.h create mode 100644 Eigen/src/Geometry/EulerAngles.h create mode 100644 Eigen/src/Geometry/Homogeneous.h create mode 100644 Eigen/src/Geometry/Hyperplane.h create mode 100644 Eigen/src/Geometry/OrthoMethods.h create mode 100644 Eigen/src/Geometry/ParametrizedLine.h create mode 100644 Eigen/src/Geometry/Quaternion.h create mode 100644 Eigen/src/Geometry/Rotation2D.h create mode 100644 Eigen/src/Geometry/RotationBase.h create mode 100755 Eigen/src/Geometry/Scaling.h create mode 100644 Eigen/src/Geometry/Transform.h create mode 100644 Eigen/src/Geometry/Translation.h create mode 100644 Eigen/src/Geometry/Umeyama.h create mode 100644 Eigen/src/Geometry/arch/Geometry_SSE.h create mode 100644 Eigen/src/Householder/BlockHouseholder.h create mode 100644 Eigen/src/Householder/Householder.h create mode 100644 Eigen/src/Householder/HouseholderSequence.h create mode 100644 Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h create mode 100644 Eigen/src/IterativeLinearSolvers/BiCGSTAB.h create mode 100644 Eigen/src/IterativeLinearSolvers/ConjugateGradient.h create mode 100644 Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h create mode 100644 Eigen/src/IterativeLinearSolvers/IncompleteLUT.h create mode 100644 Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h create mode 100644 Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h create mode 100644 Eigen/src/IterativeLinearSolvers/SolveWithGuess.h create mode 100644 Eigen/src/Jacobi/Jacobi.h create mode 100644 Eigen/src/KLUSupport/KLUSupport.h create mode 100644 Eigen/src/LU/Determinant.h create mode 100644 Eigen/src/LU/FullPivLU.h create mode 100644 Eigen/src/LU/InverseImpl.h create mode 100644 Eigen/src/LU/PartialPivLU.h create mode 100644 Eigen/src/LU/PartialPivLU_LAPACKE.h create mode 100644 Eigen/src/LU/arch/Inverse_SSE.h create mode 100644 Eigen/src/MetisSupport/MetisSupport.h create mode 100644 Eigen/src/OrderingMethods/Amd.h create mode 100644 Eigen/src/OrderingMethods/Eigen_Colamd.h create mode 100644 Eigen/src/OrderingMethods/Ordering.h create mode 100644 Eigen/src/PaStiXSupport/PaStiXSupport.h create mode 100644 Eigen/src/PardisoSupport/PardisoSupport.h create mode 100644 Eigen/src/QR/ColPivHouseholderQR.h create mode 100644 Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h create mode 100644 Eigen/src/QR/CompleteOrthogonalDecomposition.h create mode 100644 Eigen/src/QR/FullPivHouseholderQR.h create mode 100644 Eigen/src/QR/HouseholderQR.h create mode 100644 Eigen/src/QR/HouseholderQR_LAPACKE.h create mode 100644 Eigen/src/SPQRSupport/SuiteSparseQRSupport.h create mode 100644 Eigen/src/SVD/BDCSVD.h create mode 100644 Eigen/src/SVD/JacobiSVD.h create mode 100644 Eigen/src/SVD/JacobiSVD_LAPACKE.h create mode 100644 Eigen/src/SVD/SVDBase.h create mode 100644 Eigen/src/SVD/UpperBidiagonalization.h create mode 100644 Eigen/src/SparseCholesky/SimplicialCholesky.h create mode 100644 Eigen/src/SparseCholesky/SimplicialCholesky_impl.h create mode 100644 Eigen/src/SparseCore/AmbiVector.h create mode 100644 Eigen/src/SparseCore/CompressedStorage.h create mode 100644 Eigen/src/SparseCore/ConservativeSparseSparseProduct.h create mode 100644 Eigen/src/SparseCore/MappedSparseMatrix.h create mode 100644 Eigen/src/SparseCore/SparseAssign.h create mode 100644 Eigen/src/SparseCore/SparseBlock.h create mode 100644 Eigen/src/SparseCore/SparseColEtree.h create mode 100644 Eigen/src/SparseCore/SparseCompressedBase.h create mode 100644 Eigen/src/SparseCore/SparseCwiseBinaryOp.h create mode 100644 Eigen/src/SparseCore/SparseCwiseUnaryOp.h create mode 100644 Eigen/src/SparseCore/SparseDenseProduct.h create mode 100644 Eigen/src/SparseCore/SparseDiagonalProduct.h create mode 100644 Eigen/src/SparseCore/SparseDot.h create mode 100644 Eigen/src/SparseCore/SparseFuzzy.h create mode 100644 Eigen/src/SparseCore/SparseMap.h create mode 100644 Eigen/src/SparseCore/SparseMatrix.h create mode 100644 Eigen/src/SparseCore/SparseMatrixBase.h create mode 100644 Eigen/src/SparseCore/SparsePermutation.h create mode 100644 Eigen/src/SparseCore/SparseProduct.h create mode 100644 Eigen/src/SparseCore/SparseRedux.h create mode 100644 Eigen/src/SparseCore/SparseRef.h create mode 100644 Eigen/src/SparseCore/SparseSelfAdjointView.h create mode 100644 Eigen/src/SparseCore/SparseSolverBase.h create mode 100644 Eigen/src/SparseCore/SparseSparseProductWithPruning.h create mode 100644 Eigen/src/SparseCore/SparseTranspose.h create mode 100644 Eigen/src/SparseCore/SparseTriangularView.h create mode 100644 Eigen/src/SparseCore/SparseUtil.h create mode 100644 Eigen/src/SparseCore/SparseVector.h create mode 100644 Eigen/src/SparseCore/SparseView.h create mode 100644 Eigen/src/SparseCore/TriangularSolver.h create mode 100644 Eigen/src/SparseLU/SparseLU.h create mode 100644 Eigen/src/SparseLU/SparseLUImpl.h create mode 100644 Eigen/src/SparseLU/SparseLU_Memory.h create mode 100644 Eigen/src/SparseLU/SparseLU_Structs.h create mode 100644 Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h create mode 100644 Eigen/src/SparseLU/SparseLU_Utils.h create mode 100644 Eigen/src/SparseLU/SparseLU_column_bmod.h create mode 100644 Eigen/src/SparseLU/SparseLU_column_dfs.h create mode 100644 Eigen/src/SparseLU/SparseLU_copy_to_ucol.h create mode 100644 Eigen/src/SparseLU/SparseLU_gemm_kernel.h create mode 100644 Eigen/src/SparseLU/SparseLU_heap_relax_snode.h create mode 100644 Eigen/src/SparseLU/SparseLU_kernel_bmod.h create mode 100644 Eigen/src/SparseLU/SparseLU_panel_bmod.h create mode 100644 Eigen/src/SparseLU/SparseLU_panel_dfs.h create mode 100644 Eigen/src/SparseLU/SparseLU_pivotL.h create mode 100644 Eigen/src/SparseLU/SparseLU_pruneL.h create mode 100644 Eigen/src/SparseLU/SparseLU_relax_snode.h create mode 100644 Eigen/src/SparseQR/SparseQR.h create mode 100644 Eigen/src/StlSupport/StdDeque.h create mode 100644 Eigen/src/StlSupport/StdList.h create mode 100644 Eigen/src/StlSupport/StdVector.h create mode 100644 Eigen/src/StlSupport/details.h create mode 100644 Eigen/src/SuperLUSupport/SuperLUSupport.h create mode 100644 Eigen/src/UmfPackSupport/UmfPackSupport.h create mode 100644 Eigen/src/misc/Image.h create mode 100644 Eigen/src/misc/Kernel.h create mode 100644 Eigen/src/misc/RealSvd2x2.h create mode 100644 Eigen/src/misc/blas.h create mode 100644 Eigen/src/misc/lapack.h create mode 100755 Eigen/src/misc/lapacke.h create mode 100644 Eigen/src/misc/lapacke_mangling.h create mode 100644 Eigen/src/plugins/ArrayCwiseBinaryOps.h create mode 100644 Eigen/src/plugins/ArrayCwiseUnaryOps.h create mode 100644 Eigen/src/plugins/BlockMethods.h create mode 100644 Eigen/src/plugins/CommonCwiseBinaryOps.h create mode 100644 Eigen/src/plugins/CommonCwiseUnaryOps.h create mode 100644 Eigen/src/plugins/IndexedViewMethods.h create mode 100644 Eigen/src/plugins/MatrixCwiseBinaryOps.h create mode 100644 Eigen/src/plugins/MatrixCwiseUnaryOps.h diff --git a/CMakeLists.txt b/CMakeLists.txt index b5c3d60c1..41705aa1e 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -205,6 +205,7 @@ add_subdirectory(dsp) add_subdirectory(omega_h) add_subdirectory(gmi_cap) add_subdirectory(apf_cap) +add_subdirectory(Eigen) # this INTERFACE target bundles all the enabled libraries together add_library(core INTERFACE) diff --git a/Eigen/CMakeLists.txt b/Eigen/CMakeLists.txt new file mode 100644 index 000000000..09b8f040a --- /dev/null +++ b/Eigen/CMakeLists.txt @@ -0,0 +1,4 @@ +add_library(eigen INTERFACE) +target_include_directories(eigen INTERFACE + ${CMAKE_CURRENT_SOURCE_DIR} +) \ No newline at end of file diff --git a/Eigen/Cholesky b/Eigen/Cholesky new file mode 100644 index 000000000..1332b540d --- /dev/null +++ b/Eigen/Cholesky @@ -0,0 +1,46 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CHOLESKY_MODULE_H +#define EIGEN_CHOLESKY_MODULE_H + +#include "Core" +#include "Jacobi" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** \defgroup Cholesky_Module Cholesky module + * + * + * + * This module provides two variants of the Cholesky decomposition for selfadjoint (hermitian) matrices. + * Those decompositions are also accessible via the following methods: + * - MatrixBase::llt() + * - MatrixBase::ldlt() + * - SelfAdjointView::llt() + * - SelfAdjointView::ldlt() + * + * \code + * #include + * \endcode + */ + +#include "src/Cholesky/LLT.h" +#include "src/Cholesky/LDLT.h" +#ifdef EIGEN_USE_LAPACKE +#ifdef EIGEN_USE_MKL +#include "mkl_lapacke.h" +#else +#include "src/misc/lapacke.h" +#endif +#include "src/Cholesky/LLT_LAPACKE.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_CHOLESKY_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/CholmodSupport b/Eigen/CholmodSupport new file mode 100644 index 000000000..bed8924d3 --- /dev/null +++ b/Eigen/CholmodSupport @@ -0,0 +1,48 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CHOLMODSUPPORT_MODULE_H +#define EIGEN_CHOLMODSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +extern "C" { + #include +} + +/** \ingroup Support_modules + * \defgroup CholmodSupport_Module CholmodSupport module + * + * This module provides an interface to the Cholmod library which is part of the suitesparse package. + * It provides the two following main factorization classes: + * - class CholmodSupernodalLLT: a supernodal LLT Cholesky factorization. + * - class CholmodDecomposiiton: a general L(D)LT Cholesky factorization with automatic or explicit runtime selection of the underlying factorization method (supernodal or simplicial). + * + * For the sake of completeness, this module also propose the two following classes: + * - class CholmodSimplicialLLT + * - class CholmodSimplicialLDLT + * Note that these classes does not bring any particular advantage compared to the built-in + * SimplicialLLT and SimplicialLDLT factorization classes. + * + * \code + * #include + * \endcode + * + * In order to use this module, the cholmod headers must be accessible from the include paths, and your binary must be linked to the cholmod library and its dependencies. + * The dependencies depend on how cholmod has been compiled. + * For a cmake based project, you can use our FindCholmod.cmake module to help you in this task. + * + */ + +#include "src/CholmodSupport/CholmodSupport.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_CHOLMODSUPPORT_MODULE_H + diff --git a/Eigen/Core b/Eigen/Core new file mode 100644 index 000000000..5a6dec8cc --- /dev/null +++ b/Eigen/Core @@ -0,0 +1,562 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2007-2011 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CORE_H +#define EIGEN_CORE_H + +// first thing Eigen does: stop the compiler from committing suicide +#include "src/Core/util/DisableStupidWarnings.h" + +#if defined(__CUDACC__) && !defined(EIGEN_NO_CUDA) + #define EIGEN_CUDACC __CUDACC__ +#endif + +#if defined(__CUDA_ARCH__) && !defined(EIGEN_NO_CUDA) + #define EIGEN_CUDA_ARCH __CUDA_ARCH__ +#endif + +// Starting with CUDA 9 the composite __CUDACC_VER__ is not available. +#if defined(__CUDACC_VER_MAJOR__) && (__CUDACC_VER_MAJOR__ >= 9) +#define EIGEN_CUDACC_VER ((__CUDACC_VER_MAJOR__ * 10000) + (__CUDACC_VER_MINOR__ * 100)) +#elif defined(__CUDACC_VER__) +#define EIGEN_CUDACC_VER __CUDACC_VER__ +#else +#define EIGEN_CUDACC_VER 0 +#endif + +// Handle NVCC/CUDA/SYCL +#if defined(EIGEN_CUDACC) || defined(__SYCL_DEVICE_ONLY__) + // Do not try asserts on CUDA and SYCL! + #ifndef EIGEN_NO_DEBUG + #define EIGEN_NO_DEBUG + #endif + + #ifdef EIGEN_INTERNAL_DEBUGGING + #undef EIGEN_INTERNAL_DEBUGGING + #endif + + #ifdef EIGEN_EXCEPTIONS + #undef EIGEN_EXCEPTIONS + #endif + + // All functions callable from CUDA code must be qualified with __device__ + #ifdef EIGEN_CUDACC + // Do not try to vectorize on CUDA and SYCL! + #ifndef EIGEN_DONT_VECTORIZE + #define EIGEN_DONT_VECTORIZE + #endif + + #define EIGEN_DEVICE_FUNC __host__ __device__ + // We need cuda_runtime.h to ensure that that EIGEN_USING_STD_MATH macro + // works properly on the device side + #include + #else + #define EIGEN_DEVICE_FUNC + #endif +#else + #define EIGEN_DEVICE_FUNC +#endif + +#ifdef __NVCC__ +#define EIGEN_DONT_VECTORIZE +#endif + +// When compiling CUDA device code with NVCC, pull in math functions from the +// global namespace. In host mode, and when device doee with clang, use the +// std versions. +#if defined(EIGEN_CUDA_ARCH) && defined(__NVCC__) + #define EIGEN_USING_STD_MATH(FUNC) using ::FUNC; +#else + #define EIGEN_USING_STD_MATH(FUNC) using std::FUNC; +#endif + +#if (defined(_CPPUNWIND) || defined(__EXCEPTIONS)) && !defined(EIGEN_CUDA_ARCH) && !defined(EIGEN_EXCEPTIONS) && !defined(EIGEN_USE_SYCL) + #define EIGEN_EXCEPTIONS +#endif + +#ifdef EIGEN_EXCEPTIONS + #include +#endif + +// then include this file where all our macros are defined. It's really important to do it first because +// it's where we do all the alignment settings (platform detection and honoring the user's will if he +// defined e.g. EIGEN_DONT_ALIGN) so it needs to be done before we do anything with vectorization. +#include "src/Core/util/Macros.h" + +// Disable the ipa-cp-clone optimization flag with MinGW 6.x or newer (enabled by default with -O3) +// See http://eigen.tuxfamily.org/bz/show_bug.cgi?id=556 for details. +#if EIGEN_COMP_MINGW && EIGEN_GNUC_AT_LEAST(4,6) + #pragma GCC optimize ("-fno-ipa-cp-clone") +#endif + +#include + +// this include file manages BLAS and MKL related macros +// and inclusion of their respective header files +#include "src/Core/util/MKL_support.h" + +// if alignment is disabled, then disable vectorization. Note: EIGEN_MAX_ALIGN_BYTES is the proper check, it takes into +// account both the user's will (EIGEN_MAX_ALIGN_BYTES,EIGEN_DONT_ALIGN) and our own platform checks +#if EIGEN_MAX_ALIGN_BYTES==0 + #ifndef EIGEN_DONT_VECTORIZE + #define EIGEN_DONT_VECTORIZE + #endif +#endif + +#if EIGEN_COMP_MSVC + #include // for _aligned_malloc -- need it regardless of whether vectorization is enabled + #if (EIGEN_COMP_MSVC >= 1500) // 2008 or later + // Remember that usage of defined() in a #define is undefined by the standard. + // a user reported that in 64-bit mode, MSVC doesn't care to define _M_IX86_FP. + #if (defined(_M_IX86_FP) && (_M_IX86_FP >= 2)) || EIGEN_ARCH_x86_64 + #define EIGEN_SSE2_ON_MSVC_2008_OR_LATER + #endif + #endif +#else + // Remember that usage of defined() in a #define is undefined by the standard + #if (defined __SSE2__) && ( (!EIGEN_COMP_GNUC) || EIGEN_COMP_ICC || EIGEN_GNUC_AT_LEAST(4,2) ) + #define EIGEN_SSE2_ON_NON_MSVC_BUT_NOT_OLD_GCC + #endif +#endif + +#ifndef EIGEN_DONT_VECTORIZE + + #if defined (EIGEN_SSE2_ON_NON_MSVC_BUT_NOT_OLD_GCC) || defined(EIGEN_SSE2_ON_MSVC_2008_OR_LATER) + + // Defines symbols for compile-time detection of which instructions are + // used. + // EIGEN_VECTORIZE_YY is defined if and only if the instruction set YY is used + #define EIGEN_VECTORIZE + #define EIGEN_VECTORIZE_SSE + #define EIGEN_VECTORIZE_SSE2 + + // Detect sse3/ssse3/sse4: + // gcc and icc defines __SSE3__, ... + // there is no way to know about this on msvc. You can define EIGEN_VECTORIZE_SSE* if you + // want to force the use of those instructions with msvc. + #ifdef __SSE3__ + #define EIGEN_VECTORIZE_SSE3 + #endif + #ifdef __SSSE3__ + #define EIGEN_VECTORIZE_SSSE3 + #endif + #ifdef __SSE4_1__ + #define EIGEN_VECTORIZE_SSE4_1 + #endif + #ifdef __SSE4_2__ + #define EIGEN_VECTORIZE_SSE4_2 + #endif + #ifdef __AVX__ + #define EIGEN_VECTORIZE_AVX + #define EIGEN_VECTORIZE_SSE3 + #define EIGEN_VECTORIZE_SSSE3 + #define EIGEN_VECTORIZE_SSE4_1 + #define EIGEN_VECTORIZE_SSE4_2 + #endif + #ifdef __AVX2__ + #define EIGEN_VECTORIZE_AVX2 + #define EIGEN_VECTORIZE_AVX + #define EIGEN_VECTORIZE_SSE3 + #define EIGEN_VECTORIZE_SSSE3 + #define EIGEN_VECTORIZE_SSE4_1 + #define EIGEN_VECTORIZE_SSE4_2 + #endif + #ifdef __FMA__ + #define EIGEN_VECTORIZE_FMA + #endif + #if defined(__AVX512F__) + #define EIGEN_VECTORIZE_AVX512 + #define EIGEN_VECTORIZE_AVX2 + #define EIGEN_VECTORIZE_AVX + #define EIGEN_VECTORIZE_FMA + #define EIGEN_VECTORIZE_SSE3 + #define EIGEN_VECTORIZE_SSSE3 + #define EIGEN_VECTORIZE_SSE4_1 + #define EIGEN_VECTORIZE_SSE4_2 + #ifdef __AVX512DQ__ + #define EIGEN_VECTORIZE_AVX512DQ + #endif + #endif + + // include files + + // This extern "C" works around a MINGW-w64 compilation issue + // https://sourceforge.net/tracker/index.php?func=detail&aid=3018394&group_id=202880&atid=983354 + // In essence, intrin.h is included by windows.h and also declares intrinsics (just as emmintrin.h etc. below do). + // However, intrin.h uses an extern "C" declaration, and g++ thus complains of duplicate declarations + // with conflicting linkage. The linkage for intrinsics doesn't matter, but at that stage the compiler doesn't know; + // so, to avoid compile errors when windows.h is included after Eigen/Core, ensure intrinsics are extern "C" here too. + // notice that since these are C headers, the extern "C" is theoretically needed anyways. + extern "C" { + // In theory we should only include immintrin.h and not the other *mmintrin.h header files directly. + // Doing so triggers some issues with ICC. However old gcc versions seems to not have this file, thus: + #if EIGEN_COMP_ICC >= 1110 + #include + #else + #include + #include + #include + #ifdef EIGEN_VECTORIZE_SSE3 + #include + #endif + #ifdef EIGEN_VECTORIZE_SSSE3 + #include + #endif + #ifdef EIGEN_VECTORIZE_SSE4_1 + #include + #endif + #ifdef EIGEN_VECTORIZE_SSE4_2 + #include + #endif + #if defined(EIGEN_VECTORIZE_AVX) || defined(EIGEN_VECTORIZE_AVX512) + #include + #endif + #endif + } // end extern "C" + #elif defined __VSX__ + #define EIGEN_VECTORIZE + #define EIGEN_VECTORIZE_VSX + #include + // We need to #undef all these ugly tokens defined in + // => use __vector instead of vector + #undef bool + #undef vector + #undef pixel + #elif defined __ALTIVEC__ + #define EIGEN_VECTORIZE + #define EIGEN_VECTORIZE_ALTIVEC + #include + // We need to #undef all these ugly tokens defined in + // => use __vector instead of vector + #undef bool + #undef vector + #undef pixel + #elif (defined __ARM_NEON) || (defined __ARM_NEON__) + #define EIGEN_VECTORIZE + #define EIGEN_VECTORIZE_NEON + #include + #elif (defined __s390x__ && defined __VEC__) + #define EIGEN_VECTORIZE + #define EIGEN_VECTORIZE_ZVECTOR + #include + #endif +#endif + +#if defined(__F16C__) && !defined(EIGEN_COMP_CLANG) + // We can use the optimized fp16 to float and float to fp16 conversion routines + #define EIGEN_HAS_FP16_C +#endif + +#if defined EIGEN_CUDACC + #define EIGEN_VECTORIZE_CUDA + #include + #if EIGEN_CUDACC_VER >= 70500 + #define EIGEN_HAS_CUDA_FP16 + #endif +#endif + +#if defined EIGEN_HAS_CUDA_FP16 + #include + #include +#endif + +#if (defined _OPENMP) && (!defined EIGEN_DONT_PARALLELIZE) + #define EIGEN_HAS_OPENMP +#endif + +#ifdef EIGEN_HAS_OPENMP +#include +#endif + +// MSVC for windows mobile does not have the errno.h file +#if !(EIGEN_COMP_MSVC && EIGEN_OS_WINCE) && !EIGEN_COMP_ARM +#define EIGEN_HAS_ERRNO +#endif + +#ifdef EIGEN_HAS_ERRNO +#include +#endif +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include // for CHAR_BIT +// for min/max: +#include + +// for std::is_nothrow_move_assignable +#ifdef EIGEN_INCLUDE_TYPE_TRAITS +#include +#endif + +// for outputting debug info +#ifdef EIGEN_DEBUG_ASSIGN +#include +#endif + +// required for __cpuid, needs to be included after cmath +#if EIGEN_COMP_MSVC && EIGEN_ARCH_i386_OR_x86_64 && !EIGEN_OS_WINCE + #include +#endif + +#if defined(__SYCL_DEVICE_ONLY__) + #undef min + #undef max + #undef isnan + #undef isinf + #undef isfinite + #include +#endif + +/** \brief Namespace containing all symbols from the %Eigen library. */ +namespace Eigen { + +inline static const char *SimdInstructionSetsInUse(void) { +#if defined(EIGEN_VECTORIZE_AVX512) + return "AVX512, FMA, AVX2, AVX, SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2"; +#elif defined(EIGEN_VECTORIZE_AVX) + return "AVX SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2"; +#elif defined(EIGEN_VECTORIZE_SSE4_2) + return "SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2"; +#elif defined(EIGEN_VECTORIZE_SSE4_1) + return "SSE, SSE2, SSE3, SSSE3, SSE4.1"; +#elif defined(EIGEN_VECTORIZE_SSSE3) + return "SSE, SSE2, SSE3, SSSE3"; +#elif defined(EIGEN_VECTORIZE_SSE3) + return "SSE, SSE2, SSE3"; +#elif defined(EIGEN_VECTORIZE_SSE2) + return "SSE, SSE2"; +#elif defined(EIGEN_VECTORIZE_ALTIVEC) + return "AltiVec"; +#elif defined(EIGEN_VECTORIZE_VSX) + return "VSX"; +#elif defined(EIGEN_VECTORIZE_NEON) + return "ARM NEON"; +#elif defined(EIGEN_VECTORIZE_ZVECTOR) + return "S390X ZVECTOR"; +#else + return "None"; +#endif +} + +} // end namespace Eigen + +#if defined EIGEN2_SUPPORT_STAGE40_FULL_EIGEN3_STRICTNESS || defined EIGEN2_SUPPORT_STAGE30_FULL_EIGEN3_API || defined EIGEN2_SUPPORT_STAGE20_RESOLVE_API_CONFLICTS || defined EIGEN2_SUPPORT_STAGE10_FULL_EIGEN2_API || defined EIGEN2_SUPPORT +// This will generate an error message: +#error Eigen2-support is only available up to version 3.2. Please go to "http://eigen.tuxfamily.org/index.php?title=Eigen2" for further information +#endif + +namespace Eigen { + +// we use size_t frequently and we'll never remember to prepend it with std:: everytime just to +// ensure QNX/QCC support +using std::size_t; +// gcc 4.6.0 wants std:: for ptrdiff_t +using std::ptrdiff_t; + +} + +/** \defgroup Core_Module Core module + * This is the main module of Eigen providing dense matrix and vector support + * (both fixed and dynamic size) with all the features corresponding to a BLAS library + * and much more... + * + * \code + * #include + * \endcode + */ + +#include "src/Core/util/Constants.h" +#include "src/Core/util/Meta.h" +#include "src/Core/util/ForwardDeclarations.h" +#include "src/Core/util/StaticAssert.h" +#include "src/Core/util/XprHelper.h" +#include "src/Core/util/Memory.h" +#include "src/Core/util/IntegralConstant.h" +#include "src/Core/util/SymbolicIndex.h" + + +#include "src/Core/NumTraits.h" +#include "src/Core/MathFunctions.h" +#include "src/Core/GenericPacketMath.h" +#include "src/Core/MathFunctionsImpl.h" +#include "src/Core/arch/Default/ConjHelper.h" + +#if defined EIGEN_VECTORIZE_AVX512 + #include "src/Core/arch/SSE/PacketMath.h" + #include "src/Core/arch/AVX/PacketMath.h" + #include "src/Core/arch/AVX512/PacketMath.h" + #include "src/Core/arch/SSE/MathFunctions.h" + #include "src/Core/arch/AVX/MathFunctions.h" + #include "src/Core/arch/AVX512/MathFunctions.h" +#elif defined EIGEN_VECTORIZE_AVX + // Use AVX for floats and doubles, SSE for integers + #include "src/Core/arch/SSE/PacketMath.h" + #include "src/Core/arch/SSE/Complex.h" + #include "src/Core/arch/SSE/MathFunctions.h" + #include "src/Core/arch/AVX/PacketMath.h" + #include "src/Core/arch/AVX/MathFunctions.h" + #include "src/Core/arch/AVX/Complex.h" + #include "src/Core/arch/AVX/TypeCasting.h" +#elif defined EIGEN_VECTORIZE_SSE + #include "src/Core/arch/SSE/PacketMath.h" + #include "src/Core/arch/SSE/MathFunctions.h" + #include "src/Core/arch/SSE/Complex.h" + #include "src/Core/arch/SSE/TypeCasting.h" +#elif defined(EIGEN_VECTORIZE_ALTIVEC) || defined(EIGEN_VECTORIZE_VSX) + #include "src/Core/arch/AltiVec/PacketMath.h" + #include "src/Core/arch/AltiVec/MathFunctions.h" + #include "src/Core/arch/AltiVec/Complex.h" +#elif defined EIGEN_VECTORIZE_NEON + #include "src/Core/arch/NEON/PacketMath.h" + #include "src/Core/arch/NEON/MathFunctions.h" + #include "src/Core/arch/NEON/Complex.h" +#elif defined EIGEN_VECTORIZE_ZVECTOR + #include "src/Core/arch/ZVector/PacketMath.h" + #include "src/Core/arch/ZVector/MathFunctions.h" + #include "src/Core/arch/ZVector/Complex.h" +#endif + +// Half float support +#include "src/Core/arch/CUDA/Half.h" +#include "src/Core/arch/CUDA/PacketMathHalf.h" +#include "src/Core/arch/CUDA/TypeCasting.h" + +#if defined EIGEN_VECTORIZE_CUDA + #include "src/Core/arch/CUDA/PacketMath.h" + #include "src/Core/arch/CUDA/MathFunctions.h" +#endif + +#include "src/Core/arch/Default/Settings.h" + +#include "src/Core/functors/TernaryFunctors.h" +#include "src/Core/functors/BinaryFunctors.h" +#include "src/Core/functors/UnaryFunctors.h" +#include "src/Core/functors/NullaryFunctors.h" +#include "src/Core/functors/StlFunctors.h" +#include "src/Core/functors/AssignmentFunctors.h" + +// Specialized functors to enable the processing of complex numbers +// on CUDA devices +#include "src/Core/arch/CUDA/Complex.h" + +#include "src/Core/util/IndexedViewHelper.h" +#include "src/Core/ArithmeticSequence.h" +#include "src/Core/IO.h" +#include "src/Core/DenseCoeffsBase.h" +#include "src/Core/DenseBase.h" +#include "src/Core/MatrixBase.h" +#include "src/Core/EigenBase.h" + +#include "src/Core/Product.h" +#include "src/Core/CoreEvaluators.h" +#include "src/Core/AssignEvaluator.h" + +#ifndef EIGEN_PARSED_BY_DOXYGEN // work around Doxygen bug triggered by Assign.h r814874 + // at least confirmed with Doxygen 1.5.5 and 1.5.6 + #include "src/Core/Assign.h" +#endif + +#include "src/Core/ArrayBase.h" +#include "src/Core/util/BlasUtil.h" +#include "src/Core/DenseStorage.h" +#include "src/Core/NestByValue.h" + +// #include "src/Core/ForceAlignedAccess.h" + +#include "src/Core/ReturnByValue.h" +#include "src/Core/NoAlias.h" +#include "src/Core/PlainObjectBase.h" +#include "src/Core/Matrix.h" +#include "src/Core/Array.h" +#include "src/Core/CwiseTernaryOp.h" +#include "src/Core/CwiseBinaryOp.h" +#include "src/Core/CwiseUnaryOp.h" +#include "src/Core/CwiseNullaryOp.h" +#include "src/Core/CwiseUnaryView.h" +#include "src/Core/SelfCwiseBinaryOp.h" +#include "src/Core/Dot.h" +#include "src/Core/StableNorm.h" +#include "src/Core/Stride.h" +#include "src/Core/MapBase.h" +#include "src/Core/Map.h" +#include "src/Core/Ref.h" +#include "src/Core/Block.h" +#include "src/Core/VectorBlock.h" +#include "src/Core/IndexedView.h" +#include "src/Core/Transpose.h" +#include "src/Core/DiagonalMatrix.h" +#include "src/Core/Diagonal.h" +#include "src/Core/DiagonalProduct.h" +#include "src/Core/Redux.h" +#include "src/Core/Visitor.h" +#include "src/Core/Fuzzy.h" +#include "src/Core/Swap.h" +#include "src/Core/CommaInitializer.h" +#include "src/Core/GeneralProduct.h" +#include "src/Core/Solve.h" +#include "src/Core/Inverse.h" +#include "src/Core/SolverBase.h" +#include "src/Core/PermutationMatrix.h" +#include "src/Core/Transpositions.h" +#include "src/Core/TriangularMatrix.h" +#include "src/Core/SelfAdjointView.h" +#include "src/Core/products/GeneralBlockPanelKernel.h" +#include "src/Core/products/Parallelizer.h" +#include "src/Core/ProductEvaluators.h" +#include "src/Core/products/GeneralMatrixVector.h" +#include "src/Core/products/GeneralMatrixMatrix.h" +#include "src/Core/SolveTriangular.h" +#include "src/Core/products/GeneralMatrixMatrixTriangular.h" +#include "src/Core/products/SelfadjointMatrixVector.h" +#include "src/Core/products/SelfadjointMatrixMatrix.h" +#include "src/Core/products/SelfadjointProduct.h" +#include "src/Core/products/SelfadjointRank2Update.h" +#include "src/Core/products/TriangularMatrixVector.h" +#include "src/Core/products/TriangularMatrixMatrix.h" +#include "src/Core/products/TriangularSolverMatrix.h" +#include "src/Core/products/TriangularSolverVector.h" +#include "src/Core/BandMatrix.h" +#include "src/Core/CoreIterators.h" +#include "src/Core/ConditionEstimator.h" + +#include "src/Core/BooleanRedux.h" +#include "src/Core/Select.h" +#include "src/Core/VectorwiseOp.h" +#include "src/Core/Random.h" +#include "src/Core/Replicate.h" +#include "src/Core/Reverse.h" +#include "src/Core/ArrayWrapper.h" + +#ifdef EIGEN_USE_BLAS +#include "src/Core/products/GeneralMatrixMatrix_BLAS.h" +#include "src/Core/products/GeneralMatrixVector_BLAS.h" +#include "src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h" +#include "src/Core/products/SelfadjointMatrixMatrix_BLAS.h" +#include "src/Core/products/SelfadjointMatrixVector_BLAS.h" +#include "src/Core/products/TriangularMatrixMatrix_BLAS.h" +#include "src/Core/products/TriangularMatrixVector_BLAS.h" +#include "src/Core/products/TriangularSolverMatrix_BLAS.h" +#endif // EIGEN_USE_BLAS + +#ifdef EIGEN_USE_MKL_VML +#include "src/Core/Assign_MKL.h" +#endif + +#include "src/Core/GlobalFunctions.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_CORE_H diff --git a/Eigen/Dense b/Eigen/Dense new file mode 100644 index 000000000..5768910bd --- /dev/null +++ b/Eigen/Dense @@ -0,0 +1,7 @@ +#include "Core" +#include "LU" +#include "Cholesky" +#include "QR" +#include "SVD" +#include "Geometry" +#include "Eigenvalues" diff --git a/Eigen/Eigen b/Eigen/Eigen new file mode 100644 index 000000000..654c8dc63 --- /dev/null +++ b/Eigen/Eigen @@ -0,0 +1,2 @@ +#include "Dense" +#include "Sparse" diff --git a/Eigen/Eigenvalues b/Eigen/Eigenvalues new file mode 100644 index 000000000..f3f661b07 --- /dev/null +++ b/Eigen/Eigenvalues @@ -0,0 +1,61 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_EIGENVALUES_MODULE_H +#define EIGEN_EIGENVALUES_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +#include "Cholesky" +#include "Jacobi" +#include "Householder" +#include "LU" +#include "Geometry" + +/** \defgroup Eigenvalues_Module Eigenvalues module + * + * + * + * This module mainly provides various eigenvalue solvers. + * This module also provides some MatrixBase methods, including: + * - MatrixBase::eigenvalues(), + * - MatrixBase::operatorNorm() + * + * \code + * #include + * \endcode + */ + +#include "src/misc/RealSvd2x2.h" +#include "src/Eigenvalues/Tridiagonalization.h" +#include "src/Eigenvalues/RealSchur.h" +#include "src/Eigenvalues/EigenSolver.h" +#include "src/Eigenvalues/SelfAdjointEigenSolver.h" +#include "src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h" +#include "src/Eigenvalues/HessenbergDecomposition.h" +#include "src/Eigenvalues/ComplexSchur.h" +#include "src/Eigenvalues/ComplexEigenSolver.h" +#include "src/Eigenvalues/RealQZ.h" +#include "src/Eigenvalues/GeneralizedEigenSolver.h" +#include "src/Eigenvalues/MatrixBaseEigenvalues.h" +#ifdef EIGEN_USE_LAPACKE +#ifdef EIGEN_USE_MKL +#include "mkl_lapacke.h" +#else +#include "src/misc/lapacke.h" +#endif +#include "src/Eigenvalues/RealSchur_LAPACKE.h" +#include "src/Eigenvalues/ComplexSchur_LAPACKE.h" +#include "src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_EIGENVALUES_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/Geometry b/Eigen/Geometry new file mode 100644 index 000000000..131a4edfc --- /dev/null +++ b/Eigen/Geometry @@ -0,0 +1,61 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_GEOMETRY_MODULE_H +#define EIGEN_GEOMETRY_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +#include "SVD" +#include "LU" +#include + +/** \defgroup Geometry_Module Geometry module + * + * This module provides support for: + * - fixed-size homogeneous transformations + * - translation, scaling, 2D and 3D rotations + * - \link Quaternion quaternions \endlink + * - cross products (\ref MatrixBase::cross, \ref MatrixBase::cross3) + * - orthognal vector generation (\ref MatrixBase::unitOrthogonal) + * - some linear components: \link ParametrizedLine parametrized-lines \endlink and \link Hyperplane hyperplanes \endlink + * - \link AlignedBox axis aligned bounding boxes \endlink + * - \link umeyama least-square transformation fitting \endlink + * + * \code + * #include + * \endcode + */ + +#include "src/Geometry/OrthoMethods.h" +#include "src/Geometry/EulerAngles.h" + +#include "src/Geometry/Homogeneous.h" +#include "src/Geometry/RotationBase.h" +#include "src/Geometry/Rotation2D.h" +#include "src/Geometry/Quaternion.h" +#include "src/Geometry/AngleAxis.h" +#include "src/Geometry/Transform.h" +#include "src/Geometry/Translation.h" +#include "src/Geometry/Scaling.h" +#include "src/Geometry/Hyperplane.h" +#include "src/Geometry/ParametrizedLine.h" +#include "src/Geometry/AlignedBox.h" +#include "src/Geometry/Umeyama.h" + +// Use the SSE optimized version whenever possible. At the moment the +// SSE version doesn't compile when AVX is enabled +#if defined EIGEN_VECTORIZE_SSE && !defined EIGEN_VECTORIZE_AVX +#include "src/Geometry/arch/Geometry_SSE.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_GEOMETRY_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/Householder b/Eigen/Householder new file mode 100644 index 000000000..89cd81b1a --- /dev/null +++ b/Eigen/Householder @@ -0,0 +1,30 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_HOUSEHOLDER_MODULE_H +#define EIGEN_HOUSEHOLDER_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** \defgroup Householder_Module Householder module + * This module provides Householder transformations. + * + * \code + * #include + * \endcode + */ + +#include "src/Householder/Householder.h" +#include "src/Householder/HouseholderSequence.h" +#include "src/Householder/BlockHouseholder.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_HOUSEHOLDER_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/IterativeLinearSolvers b/Eigen/IterativeLinearSolvers new file mode 100644 index 000000000..957d5750b --- /dev/null +++ b/Eigen/IterativeLinearSolvers @@ -0,0 +1,48 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ITERATIVELINEARSOLVERS_MODULE_H +#define EIGEN_ITERATIVELINEARSOLVERS_MODULE_H + +#include "SparseCore" +#include "OrderingMethods" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** + * \defgroup IterativeLinearSolvers_Module IterativeLinearSolvers module + * + * This module currently provides iterative methods to solve problems of the form \c A \c x = \c b, where \c A is a squared matrix, usually very large and sparse. + * Those solvers are accessible via the following classes: + * - ConjugateGradient for selfadjoint (hermitian) matrices, + * - LeastSquaresConjugateGradient for rectangular least-square problems, + * - BiCGSTAB for general square matrices. + * + * These iterative solvers are associated with some preconditioners: + * - IdentityPreconditioner - not really useful + * - DiagonalPreconditioner - also called Jacobi preconditioner, work very well on diagonal dominant matrices. + * - IncompleteLUT - incomplete LU factorization with dual thresholding + * + * Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, CholmodSupport, UmfPackSupport, SuperLUSupport. + * + \code + #include + \endcode + */ + +#include "src/IterativeLinearSolvers/SolveWithGuess.h" +#include "src/IterativeLinearSolvers/IterativeSolverBase.h" +#include "src/IterativeLinearSolvers/BasicPreconditioners.h" +#include "src/IterativeLinearSolvers/ConjugateGradient.h" +#include "src/IterativeLinearSolvers/LeastSquareConjugateGradient.h" +#include "src/IterativeLinearSolvers/BiCGSTAB.h" +#include "src/IterativeLinearSolvers/IncompleteLUT.h" +#include "src/IterativeLinearSolvers/IncompleteCholesky.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_ITERATIVELINEARSOLVERS_MODULE_H diff --git a/Eigen/Jacobi b/Eigen/Jacobi new file mode 100644 index 000000000..17c1d785a --- /dev/null +++ b/Eigen/Jacobi @@ -0,0 +1,33 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_JACOBI_MODULE_H +#define EIGEN_JACOBI_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** \defgroup Jacobi_Module Jacobi module + * This module provides Jacobi and Givens rotations. + * + * \code + * #include + * \endcode + * + * In addition to listed classes, it defines the two following MatrixBase methods to apply a Jacobi or Givens rotation: + * - MatrixBase::applyOnTheLeft() + * - MatrixBase::applyOnTheRight(). + */ + +#include "src/Jacobi/Jacobi.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_JACOBI_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ + diff --git a/Eigen/KLUSupport b/Eigen/KLUSupport new file mode 100644 index 000000000..b23d90535 --- /dev/null +++ b/Eigen/KLUSupport @@ -0,0 +1,41 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_KLUSUPPORT_MODULE_H +#define EIGEN_KLUSUPPORT_MODULE_H + +#include + +#include + +extern "C" { +#include +#include + } + +/** \ingroup Support_modules + * \defgroup KLUSupport_Module KLUSupport module + * + * This module provides an interface to the KLU library which is part of the suitesparse package. + * It provides the following factorization class: + * - class KLU: a sparse LU factorization, well-suited for circuit simulation. + * + * \code + * #include + * \endcode + * + * In order to use this module, the klu and btf headers must be accessible from the include paths, and your binary must be linked to the klu library and its dependencies. + * The dependencies depend on how umfpack has been compiled. + * For a cmake based project, you can use our FindKLU.cmake module to help you in this task. + * + */ + +#include "src/KLUSupport/KLUSupport.h" + +#include + +#endif // EIGEN_KLUSUPPORT_MODULE_H diff --git a/Eigen/LU b/Eigen/LU new file mode 100644 index 000000000..6418a86e1 --- /dev/null +++ b/Eigen/LU @@ -0,0 +1,50 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_LU_MODULE_H +#define EIGEN_LU_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** \defgroup LU_Module LU module + * This module includes %LU decomposition and related notions such as matrix inversion and determinant. + * This module defines the following MatrixBase methods: + * - MatrixBase::inverse() + * - MatrixBase::determinant() + * + * \code + * #include + * \endcode + */ + +#include "src/misc/Kernel.h" +#include "src/misc/Image.h" +#include "src/LU/FullPivLU.h" +#include "src/LU/PartialPivLU.h" +#ifdef EIGEN_USE_LAPACKE +#ifdef EIGEN_USE_MKL +#include "mkl_lapacke.h" +#else +#include "src/misc/lapacke.h" +#endif +#include "src/LU/PartialPivLU_LAPACKE.h" +#endif +#include "src/LU/Determinant.h" +#include "src/LU/InverseImpl.h" + +// Use the SSE optimized version whenever possible. At the moment the +// SSE version doesn't compile when AVX is enabled +#if defined EIGEN_VECTORIZE_SSE && !defined EIGEN_VECTORIZE_AVX + #include "src/LU/arch/Inverse_SSE.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_LU_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/MetisSupport b/Eigen/MetisSupport new file mode 100644 index 000000000..85c41bf34 --- /dev/null +++ b/Eigen/MetisSupport @@ -0,0 +1,35 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_METISSUPPORT_MODULE_H +#define EIGEN_METISSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +extern "C" { +#include +} + + +/** \ingroup Support_modules + * \defgroup MetisSupport_Module MetisSupport module + * + * \code + * #include + * \endcode + * This module defines an interface to the METIS reordering package (http://glaros.dtc.umn.edu/gkhome/views/metis). + * It can be used just as any other built-in method as explained in \link OrderingMethods_Module here. \endlink + */ + + +#include "src/MetisSupport/MetisSupport.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_METISSUPPORT_MODULE_H diff --git a/Eigen/OrderingMethods b/Eigen/OrderingMethods new file mode 100644 index 000000000..d8ea36193 --- /dev/null +++ b/Eigen/OrderingMethods @@ -0,0 +1,73 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ORDERINGMETHODS_MODULE_H +#define EIGEN_ORDERINGMETHODS_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** + * \defgroup OrderingMethods_Module OrderingMethods module + * + * This module is currently for internal use only + * + * It defines various built-in and external ordering methods for sparse matrices. + * They are typically used to reduce the number of elements during + * the sparse matrix decomposition (LLT, LU, QR). + * Precisely, in a preprocessing step, a permutation matrix P is computed using + * those ordering methods and applied to the columns of the matrix. + * Using for instance the sparse Cholesky decomposition, it is expected that + * the nonzeros elements in LLT(A*P) will be much smaller than that in LLT(A). + * + * + * Usage : + * \code + * #include + * \endcode + * + * A simple usage is as a template parameter in the sparse decomposition classes : + * + * \code + * SparseLU > solver; + * \endcode + * + * \code + * SparseQR > solver; + * \endcode + * + * It is possible as well to call directly a particular ordering method for your own purpose, + * \code + * AMDOrdering ordering; + * PermutationMatrix perm; + * SparseMatrix A; + * //Fill the matrix ... + * + * ordering(A, perm); // Call AMD + * \endcode + * + * \note Some of these methods (like AMD or METIS), need the sparsity pattern + * of the input matrix to be symmetric. When the matrix is structurally unsymmetric, + * Eigen computes internally the pattern of \f$A^T*A\f$ before calling the method. + * If your matrix is already symmetric (at leat in structure), you can avoid that + * by calling the method with a SelfAdjointView type. + * + * \code + * // Call the ordering on the pattern of the lower triangular matrix A + * ordering(A.selfadjointView(), perm); + * \endcode + */ + +#ifndef EIGEN_MPL2_ONLY +#include "src/OrderingMethods/Amd.h" +#endif + +#include "src/OrderingMethods/Ordering.h" +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_ORDERINGMETHODS_MODULE_H diff --git a/Eigen/PaStiXSupport b/Eigen/PaStiXSupport new file mode 100644 index 000000000..234619acc --- /dev/null +++ b/Eigen/PaStiXSupport @@ -0,0 +1,49 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_PASTIXSUPPORT_MODULE_H +#define EIGEN_PASTIXSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +extern "C" { +#include +#include +} + +#ifdef complex +#undef complex +#endif + +/** \ingroup Support_modules + * \defgroup PaStiXSupport_Module PaStiXSupport module + * + * This module provides an interface to the PaSTiX library. + * PaSTiX is a general \b supernodal, \b parallel and \b opensource sparse solver. + * It provides the two following main factorization classes: + * - class PastixLLT : a supernodal, parallel LLt Cholesky factorization. + * - class PastixLDLT: a supernodal, parallel LDLt Cholesky factorization. + * - class PastixLU : a supernodal, parallel LU factorization (optimized for a symmetric pattern). + * + * \code + * #include + * \endcode + * + * In order to use this module, the PaSTiX headers must be accessible from the include paths, and your binary must be linked to the PaSTiX library and its dependencies. + * This wrapper resuires PaStiX version 5.x compiled without MPI support. + * The dependencies depend on how PaSTiX has been compiled. + * For a cmake based project, you can use our FindPaSTiX.cmake module to help you in this task. + * + */ + +#include "src/PaStiXSupport/PaStiXSupport.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_PASTIXSUPPORT_MODULE_H diff --git a/Eigen/PardisoSupport b/Eigen/PardisoSupport new file mode 100755 index 000000000..340edf51f --- /dev/null +++ b/Eigen/PardisoSupport @@ -0,0 +1,35 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_PARDISOSUPPORT_MODULE_H +#define EIGEN_PARDISOSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +#include + +/** \ingroup Support_modules + * \defgroup PardisoSupport_Module PardisoSupport module + * + * This module brings support for the Intel(R) MKL PARDISO direct sparse solvers. + * + * \code + * #include + * \endcode + * + * In order to use this module, the MKL headers must be accessible from the include paths, and your binary must be linked to the MKL library and its dependencies. + * See this \ref TopicUsingIntelMKL "page" for more information on MKL-Eigen integration. + * + */ + +#include "src/PardisoSupport/PardisoSupport.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_PARDISOSUPPORT_MODULE_H diff --git a/Eigen/QR b/Eigen/QR new file mode 100644 index 000000000..c7e914469 --- /dev/null +++ b/Eigen/QR @@ -0,0 +1,51 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_QR_MODULE_H +#define EIGEN_QR_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +#include "Cholesky" +#include "Jacobi" +#include "Householder" + +/** \defgroup QR_Module QR module + * + * + * + * This module provides various QR decompositions + * This module also provides some MatrixBase methods, including: + * - MatrixBase::householderQr() + * - MatrixBase::colPivHouseholderQr() + * - MatrixBase::fullPivHouseholderQr() + * + * \code + * #include + * \endcode + */ + +#include "src/QR/HouseholderQR.h" +#include "src/QR/FullPivHouseholderQR.h" +#include "src/QR/ColPivHouseholderQR.h" +#include "src/QR/CompleteOrthogonalDecomposition.h" +#ifdef EIGEN_USE_LAPACKE +#ifdef EIGEN_USE_MKL +#include "mkl_lapacke.h" +#else +#include "src/misc/lapacke.h" +#endif +#include "src/QR/HouseholderQR_LAPACKE.h" +#include "src/QR/ColPivHouseholderQR_LAPACKE.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_QR_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/QtAlignedMalloc b/Eigen/QtAlignedMalloc new file mode 100644 index 000000000..4f07df02a --- /dev/null +++ b/Eigen/QtAlignedMalloc @@ -0,0 +1,40 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_QTMALLOC_MODULE_H +#define EIGEN_QTMALLOC_MODULE_H + +#include "Core" + +#if (!EIGEN_MALLOC_ALREADY_ALIGNED) + +#include "src/Core/util/DisableStupidWarnings.h" + +void *qMalloc(std::size_t size) +{ + return Eigen::internal::aligned_malloc(size); +} + +void qFree(void *ptr) +{ + Eigen::internal::aligned_free(ptr); +} + +void *qRealloc(void *ptr, std::size_t size) +{ + void* newPtr = Eigen::internal::aligned_malloc(size); + std::memcpy(newPtr, ptr, size); + Eigen::internal::aligned_free(ptr); + return newPtr; +} + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif + +#endif // EIGEN_QTMALLOC_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/SPQRSupport b/Eigen/SPQRSupport new file mode 100644 index 000000000..f70390c17 --- /dev/null +++ b/Eigen/SPQRSupport @@ -0,0 +1,34 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SPQRSUPPORT_MODULE_H +#define EIGEN_SPQRSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +#include "SuiteSparseQR.hpp" + +/** \ingroup Support_modules + * \defgroup SPQRSupport_Module SuiteSparseQR module + * + * This module provides an interface to the SPQR library, which is part of the suitesparse package. + * + * \code + * #include + * \endcode + * + * In order to use this module, the SPQR headers must be accessible from the include paths, and your binary must be linked to the SPQR library and its dependencies (Cholmod, AMD, COLAMD,...). + * For a cmake based project, you can use our FindSPQR.cmake and FindCholmod.Cmake modules + * + */ + +#include "src/CholmodSupport/CholmodSupport.h" +#include "src/SPQRSupport/SuiteSparseQRSupport.h" + +#endif diff --git a/Eigen/SVD b/Eigen/SVD new file mode 100644 index 000000000..5d0e75f7f --- /dev/null +++ b/Eigen/SVD @@ -0,0 +1,51 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SVD_MODULE_H +#define EIGEN_SVD_MODULE_H + +#include "QR" +#include "Householder" +#include "Jacobi" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** \defgroup SVD_Module SVD module + * + * + * + * This module provides SVD decomposition for matrices (both real and complex). + * Two decomposition algorithms are provided: + * - JacobiSVD implementing two-sided Jacobi iterations is numerically very accurate, fast for small matrices, but very slow for larger ones. + * - BDCSVD implementing a recursive divide & conquer strategy on top of an upper-bidiagonalization which remains fast for large problems. + * These decompositions are accessible via the respective classes and following MatrixBase methods: + * - MatrixBase::jacobiSvd() + * - MatrixBase::bdcSvd() + * + * \code + * #include + * \endcode + */ + +#include "src/misc/RealSvd2x2.h" +#include "src/SVD/UpperBidiagonalization.h" +#include "src/SVD/SVDBase.h" +#include "src/SVD/JacobiSVD.h" +#include "src/SVD/BDCSVD.h" +#if defined(EIGEN_USE_LAPACKE) && !defined(EIGEN_USE_LAPACKE_STRICT) +#ifdef EIGEN_USE_MKL +#include "mkl_lapacke.h" +#else +#include "src/misc/lapacke.h" +#endif +#include "src/SVD/JacobiSVD_LAPACKE.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_SVD_MODULE_H +/* vim: set filetype=cpp et sw=2 ts=2 ai: */ diff --git a/Eigen/Sparse b/Eigen/Sparse new file mode 100644 index 000000000..136e681a1 --- /dev/null +++ b/Eigen/Sparse @@ -0,0 +1,36 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SPARSE_MODULE_H +#define EIGEN_SPARSE_MODULE_H + +/** \defgroup Sparse_Module Sparse meta-module + * + * Meta-module including all related modules: + * - \ref SparseCore_Module + * - \ref OrderingMethods_Module + * - \ref SparseCholesky_Module + * - \ref SparseLU_Module + * - \ref SparseQR_Module + * - \ref IterativeLinearSolvers_Module + * + \code + #include + \endcode + */ + +#include "SparseCore" +#include "OrderingMethods" +#ifndef EIGEN_MPL2_ONLY +#include "SparseCholesky" +#endif +#include "SparseLU" +#include "SparseQR" +#include "IterativeLinearSolvers" + +#endif // EIGEN_SPARSE_MODULE_H + diff --git a/Eigen/SparseCholesky b/Eigen/SparseCholesky new file mode 100644 index 000000000..b6a320c40 --- /dev/null +++ b/Eigen/SparseCholesky @@ -0,0 +1,45 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2013 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SPARSECHOLESKY_MODULE_H +#define EIGEN_SPARSECHOLESKY_MODULE_H + +#include "SparseCore" +#include "OrderingMethods" + +#include "src/Core/util/DisableStupidWarnings.h" + +/** + * \defgroup SparseCholesky_Module SparseCholesky module + * + * This module currently provides two variants of the direct sparse Cholesky decomposition for selfadjoint (hermitian) matrices. + * Those decompositions are accessible via the following classes: + * - SimplicialLLt, + * - SimplicialLDLt + * + * Such problems can also be solved using the ConjugateGradient solver from the IterativeLinearSolvers module. + * + * \code + * #include + * \endcode + */ + +#ifdef EIGEN_MPL2_ONLY +#error The SparseCholesky module has nothing to offer in MPL2 only mode +#endif + +#include "src/SparseCholesky/SimplicialCholesky.h" + +#ifndef EIGEN_MPL2_ONLY +#include "src/SparseCholesky/SimplicialCholesky_impl.h" +#endif + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_SPARSECHOLESKY_MODULE_H diff --git a/Eigen/SparseCore b/Eigen/SparseCore new file mode 100644 index 000000000..76966c4c4 --- /dev/null +++ b/Eigen/SparseCore @@ -0,0 +1,69 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SPARSECORE_MODULE_H +#define EIGEN_SPARSECORE_MODULE_H + +#include "Core" + +#include "src/Core/util/DisableStupidWarnings.h" + +#include +#include +#include +#include +#include + +/** + * \defgroup SparseCore_Module SparseCore module + * + * This module provides a sparse matrix representation, and basic associated matrix manipulations + * and operations. + * + * See the \ref TutorialSparse "Sparse tutorial" + * + * \code + * #include + * \endcode + * + * This module depends on: Core. + */ + +#include "src/SparseCore/SparseUtil.h" +#include "src/SparseCore/SparseMatrixBase.h" +#include "src/SparseCore/SparseAssign.h" +#include "src/SparseCore/CompressedStorage.h" +#include "src/SparseCore/AmbiVector.h" +#include "src/SparseCore/SparseCompressedBase.h" +#include "src/SparseCore/SparseMatrix.h" +#include "src/SparseCore/SparseMap.h" +#include "src/SparseCore/MappedSparseMatrix.h" +#include "src/SparseCore/SparseVector.h" +#include "src/SparseCore/SparseRef.h" +#include "src/SparseCore/SparseCwiseUnaryOp.h" +#include "src/SparseCore/SparseCwiseBinaryOp.h" +#include "src/SparseCore/SparseTranspose.h" +#include "src/SparseCore/SparseBlock.h" +#include "src/SparseCore/SparseDot.h" +#include "src/SparseCore/SparseRedux.h" +#include "src/SparseCore/SparseView.h" +#include "src/SparseCore/SparseDiagonalProduct.h" +#include "src/SparseCore/ConservativeSparseSparseProduct.h" +#include "src/SparseCore/SparseSparseProductWithPruning.h" +#include "src/SparseCore/SparseProduct.h" +#include "src/SparseCore/SparseDenseProduct.h" +#include "src/SparseCore/SparseSelfAdjointView.h" +#include "src/SparseCore/SparseTriangularView.h" +#include "src/SparseCore/TriangularSolver.h" +#include "src/SparseCore/SparsePermutation.h" +#include "src/SparseCore/SparseFuzzy.h" +#include "src/SparseCore/SparseSolverBase.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_SPARSECORE_MODULE_H + diff --git a/Eigen/SparseLU b/Eigen/SparseLU new file mode 100644 index 000000000..38b38b531 --- /dev/null +++ b/Eigen/SparseLU @@ -0,0 +1,46 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2012 Désiré Nuentsa-Wakam +// Copyright (C) 2012 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SPARSELU_MODULE_H +#define EIGEN_SPARSELU_MODULE_H + +#include "SparseCore" + +/** + * \defgroup SparseLU_Module SparseLU module + * This module defines a supernodal factorization of general sparse matrices. + * The code is fully optimized for supernode-panel updates with specialized kernels. + * Please, see the documentation of the SparseLU class for more details. + */ + +// Ordering interface +#include "OrderingMethods" + +#include "src/SparseLU/SparseLU_gemm_kernel.h" + +#include "src/SparseLU/SparseLU_Structs.h" +#include "src/SparseLU/SparseLU_SupernodalMatrix.h" +#include "src/SparseLU/SparseLUImpl.h" +#include "src/SparseCore/SparseColEtree.h" +#include "src/SparseLU/SparseLU_Memory.h" +#include "src/SparseLU/SparseLU_heap_relax_snode.h" +#include "src/SparseLU/SparseLU_relax_snode.h" +#include "src/SparseLU/SparseLU_pivotL.h" +#include "src/SparseLU/SparseLU_panel_dfs.h" +#include "src/SparseLU/SparseLU_kernel_bmod.h" +#include "src/SparseLU/SparseLU_panel_bmod.h" +#include "src/SparseLU/SparseLU_column_dfs.h" +#include "src/SparseLU/SparseLU_column_bmod.h" +#include "src/SparseLU/SparseLU_copy_to_ucol.h" +#include "src/SparseLU/SparseLU_pruneL.h" +#include "src/SparseLU/SparseLU_Utils.h" +#include "src/SparseLU/SparseLU.h" + +#endif // EIGEN_SPARSELU_MODULE_H diff --git a/Eigen/SparseQR b/Eigen/SparseQR new file mode 100644 index 000000000..a6f3b7f7d --- /dev/null +++ b/Eigen/SparseQR @@ -0,0 +1,37 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SPARSEQR_MODULE_H +#define EIGEN_SPARSEQR_MODULE_H + +#include "SparseCore" +#include "OrderingMethods" +#include "src/Core/util/DisableStupidWarnings.h" + +/** \defgroup SparseQR_Module SparseQR module + * \brief Provides QR decomposition for sparse matrices + * + * This module provides a simplicial version of the left-looking Sparse QR decomposition. + * The columns of the input matrix should be reordered to limit the fill-in during the + * decomposition. Built-in methods (COLAMD, AMD) or external methods (METIS) can be used to this end. + * See the \link OrderingMethods_Module OrderingMethods\endlink module for the list + * of built-in and external ordering methods. + * + * \code + * #include + * \endcode + * + * + */ + +#include "OrderingMethods" +#include "src/SparseCore/SparseColEtree.h" +#include "src/SparseQR/SparseQR.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif diff --git a/Eigen/StdDeque b/Eigen/StdDeque new file mode 100644 index 000000000..bc68397be --- /dev/null +++ b/Eigen/StdDeque @@ -0,0 +1,27 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// Copyright (C) 2009 Hauke Heibel +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_STDDEQUE_MODULE_H +#define EIGEN_STDDEQUE_MODULE_H + +#include "Core" +#include + +#if EIGEN_COMP_MSVC && EIGEN_OS_WIN64 && (EIGEN_MAX_STATIC_ALIGN_BYTES<=16) /* MSVC auto aligns up to 16 bytes in 64 bit builds */ + +#define EIGEN_DEFINE_STL_DEQUE_SPECIALIZATION(...) + +#else + +#include "src/StlSupport/StdDeque.h" + +#endif + +#endif // EIGEN_STDDEQUE_MODULE_H diff --git a/Eigen/StdList b/Eigen/StdList new file mode 100644 index 000000000..4c6262c08 --- /dev/null +++ b/Eigen/StdList @@ -0,0 +1,26 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Hauke Heibel +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_STDLIST_MODULE_H +#define EIGEN_STDLIST_MODULE_H + +#include "Core" +#include + +#if EIGEN_COMP_MSVC && EIGEN_OS_WIN64 && (EIGEN_MAX_STATIC_ALIGN_BYTES<=16) /* MSVC auto aligns up to 16 bytes in 64 bit builds */ + +#define EIGEN_DEFINE_STL_LIST_SPECIALIZATION(...) + +#else + +#include "src/StlSupport/StdList.h" + +#endif + +#endif // EIGEN_STDLIST_MODULE_H diff --git a/Eigen/StdVector b/Eigen/StdVector new file mode 100644 index 000000000..0c4697ad5 --- /dev/null +++ b/Eigen/StdVector @@ -0,0 +1,27 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// Copyright (C) 2009 Hauke Heibel +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_STDVECTOR_MODULE_H +#define EIGEN_STDVECTOR_MODULE_H + +#include "Core" +#include + +#if EIGEN_COMP_MSVC && EIGEN_OS_WIN64 && (EIGEN_MAX_STATIC_ALIGN_BYTES<=16) /* MSVC auto aligns up to 16 bytes in 64 bit builds */ + +#define EIGEN_DEFINE_STL_VECTOR_SPECIALIZATION(...) + +#else + +#include "src/StlSupport/StdVector.h" + +#endif + +#endif // EIGEN_STDVECTOR_MODULE_H diff --git a/Eigen/SuperLUSupport b/Eigen/SuperLUSupport new file mode 100644 index 000000000..59312a82d --- /dev/null +++ b/Eigen/SuperLUSupport @@ -0,0 +1,64 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SUPERLUSUPPORT_MODULE_H +#define EIGEN_SUPERLUSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +#ifdef EMPTY +#define EIGEN_EMPTY_WAS_ALREADY_DEFINED +#endif + +typedef int int_t; +#include +#include +#include + +// slu_util.h defines a preprocessor token named EMPTY which is really polluting, +// so we remove it in favor of a SUPERLU_EMPTY token. +// If EMPTY was already defined then we don't undef it. + +#if defined(EIGEN_EMPTY_WAS_ALREADY_DEFINED) +# undef EIGEN_EMPTY_WAS_ALREADY_DEFINED +#elif defined(EMPTY) +# undef EMPTY +#endif + +#define SUPERLU_EMPTY (-1) + +namespace Eigen { struct SluMatrix; } + +/** \ingroup Support_modules + * \defgroup SuperLUSupport_Module SuperLUSupport module + * + * This module provides an interface to the SuperLU library. + * It provides the following factorization class: + * - class SuperLU: a supernodal sequential LU factorization. + * - class SuperILU: a supernodal sequential incomplete LU factorization (to be used as a preconditioner for iterative methods). + * + * \warning This wrapper requires at least versions 4.0 of SuperLU. The 3.x versions are not supported. + * + * \warning When including this module, you have to use SUPERLU_EMPTY instead of EMPTY which is no longer defined because it is too polluting. + * + * \code + * #include + * \endcode + * + * In order to use this module, the superlu headers must be accessible from the include paths, and your binary must be linked to the superlu library and its dependencies. + * The dependencies depend on how superlu has been compiled. + * For a cmake based project, you can use our FindSuperLU.cmake module to help you in this task. + * + */ + +#include "src/SuperLUSupport/SuperLUSupport.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_SUPERLUSUPPORT_MODULE_H diff --git a/Eigen/UmfPackSupport b/Eigen/UmfPackSupport new file mode 100644 index 000000000..00eec8087 --- /dev/null +++ b/Eigen/UmfPackSupport @@ -0,0 +1,40 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_UMFPACKSUPPORT_MODULE_H +#define EIGEN_UMFPACKSUPPORT_MODULE_H + +#include "SparseCore" + +#include "src/Core/util/DisableStupidWarnings.h" + +extern "C" { +#include +} + +/** \ingroup Support_modules + * \defgroup UmfPackSupport_Module UmfPackSupport module + * + * This module provides an interface to the UmfPack library which is part of the suitesparse package. + * It provides the following factorization class: + * - class UmfPackLU: a multifrontal sequential LU factorization. + * + * \code + * #include + * \endcode + * + * In order to use this module, the umfpack headers must be accessible from the include paths, and your binary must be linked to the umfpack library and its dependencies. + * The dependencies depend on how umfpack has been compiled. + * For a cmake based project, you can use our FindUmfPack.cmake module to help you in this task. + * + */ + +#include "src/UmfPackSupport/UmfPackSupport.h" + +#include "src/Core/util/ReenableStupidWarnings.h" + +#endif // EIGEN_UMFPACKSUPPORT_MODULE_H diff --git a/Eigen/src/Cholesky/LDLT.h b/Eigen/src/Cholesky/LDLT.h new file mode 100644 index 000000000..13a8f6d14 --- /dev/null +++ b/Eigen/src/Cholesky/LDLT.h @@ -0,0 +1,670 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2011 Gael Guennebaud +// Copyright (C) 2009 Keir Mierle +// Copyright (C) 2009 Benoit Jacob +// Copyright (C) 2011 Timothy E. Holy +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_LDLT_H +#define EIGEN_LDLT_H + +namespace Eigen { + +namespace internal { + template struct LDLT_Traits; + + // PositiveSemiDef means positive semi-definite and non-zero; same for NegativeSemiDef + enum SignMatrix { PositiveSemiDef, NegativeSemiDef, ZeroSign, Indefinite }; +} + +/** \ingroup Cholesky_Module + * + * \class LDLT + * + * \brief Robust Cholesky decomposition of a matrix with pivoting + * + * \tparam _MatrixType the type of the matrix of which to compute the LDL^T Cholesky decomposition + * \tparam _UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper. + * The other triangular part won't be read. + * + * Perform a robust Cholesky decomposition of a positive semidefinite or negative semidefinite + * matrix \f$ A \f$ such that \f$ A = P^TLDL^*P \f$, where P is a permutation matrix, L + * is lower triangular with a unit diagonal and D is a diagonal matrix. + * + * The decomposition uses pivoting to ensure stability, so that L will have + * zeros in the bottom right rank(A) - n submatrix. Avoiding the square root + * on D also stabilizes the computation. + * + * Remember that Cholesky decompositions are not rank-revealing. Also, do not use a Cholesky + * decomposition to determine whether a system of equations has a solution. + * + * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. + * + * \sa MatrixBase::ldlt(), SelfAdjointView::ldlt(), class LLT + */ +template class LDLT +{ + public: + typedef _MatrixType MatrixType; + enum { + RowsAtCompileTime = MatrixType::RowsAtCompileTime, + ColsAtCompileTime = MatrixType::ColsAtCompileTime, + MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, + MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, + UpLo = _UpLo + }; + typedef typename MatrixType::Scalar Scalar; + typedef typename NumTraits::Real RealScalar; + typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 + typedef typename MatrixType::StorageIndex StorageIndex; + typedef Matrix TmpMatrixType; + + typedef Transpositions TranspositionType; + typedef PermutationMatrix PermutationType; + + typedef internal::LDLT_Traits Traits; + + /** \brief Default Constructor. + * + * The default constructor is useful in cases in which the user intends to + * perform decompositions via LDLT::compute(const MatrixType&). + */ + LDLT() + : m_matrix(), + m_transpositions(), + m_sign(internal::ZeroSign), + m_isInitialized(false) + {} + + /** \brief Default Constructor with memory preallocation + * + * Like the default constructor but with preallocation of the internal data + * according to the specified problem \a size. + * \sa LDLT() + */ + explicit LDLT(Index size) + : m_matrix(size, size), + m_transpositions(size), + m_temporary(size), + m_sign(internal::ZeroSign), + m_isInitialized(false) + {} + + /** \brief Constructor with decomposition + * + * This calculates the decomposition for the input \a matrix. + * + * \sa LDLT(Index size) + */ + template + explicit LDLT(const EigenBase& matrix) + : m_matrix(matrix.rows(), matrix.cols()), + m_transpositions(matrix.rows()), + m_temporary(matrix.rows()), + m_sign(internal::ZeroSign), + m_isInitialized(false) + { + compute(matrix.derived()); + } + + /** \brief Constructs a LDLT factorization from a given matrix + * + * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when \c MatrixType is a Eigen::Ref. + * + * \sa LDLT(const EigenBase&) + */ + template + explicit LDLT(EigenBase& matrix) + : m_matrix(matrix.derived()), + m_transpositions(matrix.rows()), + m_temporary(matrix.rows()), + m_sign(internal::ZeroSign), + m_isInitialized(false) + { + compute(matrix.derived()); + } + + /** Clear any existing decomposition + * \sa rankUpdate(w,sigma) + */ + void setZero() + { + m_isInitialized = false; + } + + /** \returns a view of the upper triangular matrix U */ + inline typename Traits::MatrixU matrixU() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return Traits::getU(m_matrix); + } + + /** \returns a view of the lower triangular matrix L */ + inline typename Traits::MatrixL matrixL() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return Traits::getL(m_matrix); + } + + /** \returns the permutation matrix P as a transposition sequence. + */ + inline const TranspositionType& transpositionsP() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return m_transpositions; + } + + /** \returns the coefficients of the diagonal matrix D */ + inline Diagonal vectorD() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return m_matrix.diagonal(); + } + + /** \returns true if the matrix is positive (semidefinite) */ + inline bool isPositive() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return m_sign == internal::PositiveSemiDef || m_sign == internal::ZeroSign; + } + + /** \returns true if the matrix is negative (semidefinite) */ + inline bool isNegative(void) const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return m_sign == internal::NegativeSemiDef || m_sign == internal::ZeroSign; + } + + /** \returns a solution x of \f$ A x = b \f$ using the current decomposition of A. + * + * This function also supports in-place solves using the syntax x = decompositionObject.solve(x) . + * + * \note_about_checking_solutions + * + * More precisely, this method solves \f$ A x = b \f$ using the decomposition \f$ A = P^T L D L^* P \f$ + * by solving the systems \f$ P^T y_1 = b \f$, \f$ L y_2 = y_1 \f$, \f$ D y_3 = y_2 \f$, + * \f$ L^* y_4 = y_3 \f$ and \f$ P x = y_4 \f$ in succession. If the matrix \f$ A \f$ is singular, then + * \f$ D \f$ will also be singular (all the other matrices are invertible). In that case, the + * least-square solution of \f$ D y_3 = y_2 \f$ is computed. This does not mean that this function + * computes the least-square solution of \f$ A x = b \f$ is \f$ A \f$ is singular. + * + * \sa MatrixBase::ldlt(), SelfAdjointView::ldlt() + */ + template + inline const Solve + solve(const MatrixBase& b) const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + eigen_assert(m_matrix.rows()==b.rows() + && "LDLT::solve(): invalid number of rows of the right hand side matrix b"); + return Solve(*this, b.derived()); + } + + template + bool solveInPlace(MatrixBase &bAndX) const; + + template + LDLT& compute(const EigenBase& matrix); + + /** \returns an estimate of the reciprocal condition number of the matrix of + * which \c *this is the LDLT decomposition. + */ + RealScalar rcond() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return internal::rcond_estimate_helper(m_l1_norm, *this); + } + + template + LDLT& rankUpdate(const MatrixBase& w, const RealScalar& alpha=1); + + /** \returns the internal LDLT decomposition matrix + * + * TODO: document the storage layout + */ + inline const MatrixType& matrixLDLT() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return m_matrix; + } + + MatrixType reconstructedMatrix() const; + + /** \returns the adjoint of \c *this, that is, a const reference to the decomposition itself as the underlying matrix is self-adjoint. + * + * This method is provided for compatibility with other matrix decompositions, thus enabling generic code such as: + * \code x = decomposition.adjoint().solve(b) \endcode + */ + const LDLT& adjoint() const { return *this; }; + + inline Index rows() const { return m_matrix.rows(); } + inline Index cols() const { return m_matrix.cols(); } + + /** \brief Reports whether previous computation was successful. + * + * \returns \c Success if computation was succesful, + * \c NumericalIssue if the factorization failed because of a zero pivot. + */ + ComputationInfo info() const + { + eigen_assert(m_isInitialized && "LDLT is not initialized."); + return m_info; + } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + template + void _solve_impl(const RhsType &rhs, DstType &dst) const; + #endif + + protected: + + static void check_template_parameters() + { + EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); + } + + /** \internal + * Used to compute and store the Cholesky decomposition A = L D L^* = U^* D U. + * The strict upper part is used during the decomposition, the strict lower + * part correspond to the coefficients of L (its diagonal is equal to 1 and + * is not stored), and the diagonal entries correspond to D. + */ + MatrixType m_matrix; + RealScalar m_l1_norm; + TranspositionType m_transpositions; + TmpMatrixType m_temporary; + internal::SignMatrix m_sign; + bool m_isInitialized; + ComputationInfo m_info; +}; + +namespace internal { + +template struct ldlt_inplace; + +template<> struct ldlt_inplace +{ + template + static bool unblocked(MatrixType& mat, TranspositionType& transpositions, Workspace& temp, SignMatrix& sign) + { + using std::abs; + typedef typename MatrixType::Scalar Scalar; + typedef typename MatrixType::RealScalar RealScalar; + typedef typename TranspositionType::StorageIndex IndexType; + eigen_assert(mat.rows()==mat.cols()); + const Index size = mat.rows(); + bool found_zero_pivot = false; + bool ret = true; + + if (size <= 1) + { + transpositions.setIdentity(); + if (numext::real(mat.coeff(0,0)) > static_cast(0) ) sign = PositiveSemiDef; + else if (numext::real(mat.coeff(0,0)) < static_cast(0)) sign = NegativeSemiDef; + else sign = ZeroSign; + return true; + } + + for (Index k = 0; k < size; ++k) + { + // Find largest diagonal element + Index index_of_biggest_in_corner; + mat.diagonal().tail(size-k).cwiseAbs().maxCoeff(&index_of_biggest_in_corner); + index_of_biggest_in_corner += k; + + transpositions.coeffRef(k) = IndexType(index_of_biggest_in_corner); + if(k != index_of_biggest_in_corner) + { + // apply the transposition while taking care to consider only + // the lower triangular part + Index s = size-index_of_biggest_in_corner-1; // trailing size after the biggest element + mat.row(k).head(k).swap(mat.row(index_of_biggest_in_corner).head(k)); + mat.col(k).tail(s).swap(mat.col(index_of_biggest_in_corner).tail(s)); + std::swap(mat.coeffRef(k,k),mat.coeffRef(index_of_biggest_in_corner,index_of_biggest_in_corner)); + for(Index i=k+1;i::IsComplex) + mat.coeffRef(index_of_biggest_in_corner,k) = numext::conj(mat.coeff(index_of_biggest_in_corner,k)); + } + + // partition the matrix: + // A00 | - | - + // lu = A10 | A11 | - + // A20 | A21 | A22 + Index rs = size - k - 1; + Block A21(mat,k+1,k,rs,1); + Block A10(mat,k,0,1,k); + Block A20(mat,k+1,0,rs,k); + + if(k>0) + { + temp.head(k) = mat.diagonal().real().head(k).asDiagonal() * A10.adjoint(); + mat.coeffRef(k,k) -= (A10 * temp.head(k)).value(); + if(rs>0) + A21.noalias() -= A20 * temp.head(k); + } + + // In some previous versions of Eigen (e.g., 3.2.1), the scaling was omitted if the pivot + // was smaller than the cutoff value. However, since LDLT is not rank-revealing + // we should only make sure that we do not introduce INF or NaN values. + // Remark that LAPACK also uses 0 as the cutoff value. + RealScalar realAkk = numext::real(mat.coeffRef(k,k)); + bool pivot_is_valid = (abs(realAkk) > RealScalar(0)); + + if(k==0 && !pivot_is_valid) + { + // The entire diagonal is zero, there is nothing more to do + // except filling the transpositions, and checking whether the matrix is zero. + sign = ZeroSign; + for(Index j = 0; j0) && pivot_is_valid) + A21 /= realAkk; + else if(rs>0) + ret = ret && (A21.array()==Scalar(0)).all(); + + if(found_zero_pivot && pivot_is_valid) ret = false; // factorization failed + else if(!pivot_is_valid) found_zero_pivot = true; + + if (sign == PositiveSemiDef) { + if (realAkk < static_cast(0)) sign = Indefinite; + } else if (sign == NegativeSemiDef) { + if (realAkk > static_cast(0)) sign = Indefinite; + } else if (sign == ZeroSign) { + if (realAkk > static_cast(0)) sign = PositiveSemiDef; + else if (realAkk < static_cast(0)) sign = NegativeSemiDef; + } + } + + return ret; + } + + // Reference for the algorithm: Davis and Hager, "Multiple Rank + // Modifications of a Sparse Cholesky Factorization" (Algorithm 1) + // Trivial rearrangements of their computations (Timothy E. Holy) + // allow their algorithm to work for rank-1 updates even if the + // original matrix is not of full rank. + // Here only rank-1 updates are implemented, to reduce the + // requirement for intermediate storage and improve accuracy + template + static bool updateInPlace(MatrixType& mat, MatrixBase& w, const typename MatrixType::RealScalar& sigma=1) + { + using numext::isfinite; + typedef typename MatrixType::Scalar Scalar; + typedef typename MatrixType::RealScalar RealScalar; + + const Index size = mat.rows(); + eigen_assert(mat.cols() == size && w.size()==size); + + RealScalar alpha = 1; + + // Apply the update + for (Index j = 0; j < size; j++) + { + // Check for termination due to an original decomposition of low-rank + if (!(isfinite)(alpha)) + break; + + // Update the diagonal terms + RealScalar dj = numext::real(mat.coeff(j,j)); + Scalar wj = w.coeff(j); + RealScalar swj2 = sigma*numext::abs2(wj); + RealScalar gamma = dj*alpha + swj2; + + mat.coeffRef(j,j) += swj2/alpha; + alpha += swj2/dj; + + + // Update the terms of L + Index rs = size-j-1; + w.tail(rs) -= wj * mat.col(j).tail(rs); + if(gamma != 0) + mat.col(j).tail(rs) += (sigma*numext::conj(wj)/gamma)*w.tail(rs); + } + return true; + } + + template + static bool update(MatrixType& mat, const TranspositionType& transpositions, Workspace& tmp, const WType& w, const typename MatrixType::RealScalar& sigma=1) + { + // Apply the permutation to the input w + tmp = transpositions * w; + + return ldlt_inplace::updateInPlace(mat,tmp,sigma); + } +}; + +template<> struct ldlt_inplace +{ + template + static EIGEN_STRONG_INLINE bool unblocked(MatrixType& mat, TranspositionType& transpositions, Workspace& temp, SignMatrix& sign) + { + Transpose matt(mat); + return ldlt_inplace::unblocked(matt, transpositions, temp, sign); + } + + template + static EIGEN_STRONG_INLINE bool update(MatrixType& mat, TranspositionType& transpositions, Workspace& tmp, WType& w, const typename MatrixType::RealScalar& sigma=1) + { + Transpose matt(mat); + return ldlt_inplace::update(matt, transpositions, tmp, w.conjugate(), sigma); + } +}; + +template struct LDLT_Traits +{ + typedef const TriangularView MatrixL; + typedef const TriangularView MatrixU; + static inline MatrixL getL(const MatrixType& m) { return MatrixL(m); } + static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } +}; + +template struct LDLT_Traits +{ + typedef const TriangularView MatrixL; + typedef const TriangularView MatrixU; + static inline MatrixL getL(const MatrixType& m) { return MatrixL(m.adjoint()); } + static inline MatrixU getU(const MatrixType& m) { return MatrixU(m); } +}; + +} // end namespace internal + +/** Compute / recompute the LDLT decomposition A = L D L^* = U^* D U of \a matrix + */ +template +template +LDLT& LDLT::compute(const EigenBase& a) +{ + check_template_parameters(); + + eigen_assert(a.rows()==a.cols()); + const Index size = a.rows(); + + m_matrix = a.derived(); + + // Compute matrix L1 norm = max abs column sum. + m_l1_norm = RealScalar(0); + // TODO move this code to SelfAdjointView + for (Index col = 0; col < size; ++col) { + RealScalar abs_col_sum; + if (_UpLo == Lower) + abs_col_sum = m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>(); + else + abs_col_sum = m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>(); + if (abs_col_sum > m_l1_norm) + m_l1_norm = abs_col_sum; + } + + m_transpositions.resize(size); + m_isInitialized = false; + m_temporary.resize(size); + m_sign = internal::ZeroSign; + + m_info = internal::ldlt_inplace::unblocked(m_matrix, m_transpositions, m_temporary, m_sign) ? Success : NumericalIssue; + + m_isInitialized = true; + return *this; +} + +/** Update the LDLT decomposition: given A = L D L^T, efficiently compute the decomposition of A + sigma w w^T. + * \param w a vector to be incorporated into the decomposition. + * \param sigma a scalar, +1 for updates and -1 for "downdates," which correspond to removing previously-added column vectors. Optional; default value is +1. + * \sa setZero() + */ +template +template +LDLT& LDLT::rankUpdate(const MatrixBase& w, const typename LDLT::RealScalar& sigma) +{ + typedef typename TranspositionType::StorageIndex IndexType; + const Index size = w.rows(); + if (m_isInitialized) + { + eigen_assert(m_matrix.rows()==size); + } + else + { + m_matrix.resize(size,size); + m_matrix.setZero(); + m_transpositions.resize(size); + for (Index i = 0; i < size; i++) + m_transpositions.coeffRef(i) = IndexType(i); + m_temporary.resize(size); + m_sign = sigma>=0 ? internal::PositiveSemiDef : internal::NegativeSemiDef; + m_isInitialized = true; + } + + internal::ldlt_inplace::update(m_matrix, m_transpositions, m_temporary, w, sigma); + + return *this; +} + +#ifndef EIGEN_PARSED_BY_DOXYGEN +template +template +void LDLT<_MatrixType,_UpLo>::_solve_impl(const RhsType &rhs, DstType &dst) const +{ + eigen_assert(rhs.rows() == rows()); + // dst = P b + dst = m_transpositions * rhs; + + // dst = L^-1 (P b) + matrixL().solveInPlace(dst); + + // dst = D^-1 (L^-1 P b) + // more precisely, use pseudo-inverse of D (see bug 241) + using std::abs; + const typename Diagonal::RealReturnType vecD(vectorD()); + // In some previous versions, tolerance was set to the max of 1/highest and the maximal diagonal entry * epsilon + // as motivated by LAPACK's xGELSS: + // RealScalar tolerance = numext::maxi(vecD.array().abs().maxCoeff() * NumTraits::epsilon(),RealScalar(1) / NumTraits::highest()); + // However, LDLT is not rank revealing, and so adjusting the tolerance wrt to the highest + // diagonal element is not well justified and leads to numerical issues in some cases. + // Moreover, Lapack's xSYTRS routines use 0 for the tolerance. + RealScalar tolerance = RealScalar(1) / NumTraits::highest(); + + for (Index i = 0; i < vecD.size(); ++i) + { + if(abs(vecD(i)) > tolerance) + dst.row(i) /= vecD(i); + else + dst.row(i).setZero(); + } + + // dst = L^-T (D^-1 L^-1 P b) + matrixU().solveInPlace(dst); + + // dst = P^-1 (L^-T D^-1 L^-1 P b) = A^-1 b + dst = m_transpositions.transpose() * dst; +} +#endif + +/** \internal use x = ldlt_object.solve(x); + * + * This is the \em in-place version of solve(). + * + * \param bAndX represents both the right-hand side matrix b and result x. + * + * \returns true always! If you need to check for existence of solutions, use another decomposition like LU, QR, or SVD. + * + * This version avoids a copy when the right hand side matrix b is not + * needed anymore. + * + * \sa LDLT::solve(), MatrixBase::ldlt() + */ +template +template +bool LDLT::solveInPlace(MatrixBase &bAndX) const +{ + eigen_assert(m_isInitialized && "LDLT is not initialized."); + eigen_assert(m_matrix.rows() == bAndX.rows()); + + bAndX = this->solve(bAndX); + + return true; +} + +/** \returns the matrix represented by the decomposition, + * i.e., it returns the product: P^T L D L^* P. + * This function is provided for debug purpose. */ +template +MatrixType LDLT::reconstructedMatrix() const +{ + eigen_assert(m_isInitialized && "LDLT is not initialized."); + const Index size = m_matrix.rows(); + MatrixType res(size,size); + + // P + res.setIdentity(); + res = transpositionsP() * res; + // L^* P + res = matrixU() * res; + // D(L^*P) + res = vectorD().real().asDiagonal() * res; + // L(DL^*P) + res = matrixL() * res; + // P^T (LDL^*P) + res = transpositionsP().transpose() * res; + + return res; +} + +/** \cholesky_module + * \returns the Cholesky decomposition with full pivoting without square root of \c *this + * \sa MatrixBase::ldlt() + */ +template +inline const LDLT::PlainObject, UpLo> +SelfAdjointView::ldlt() const +{ + return LDLT(m_matrix); +} + +/** \cholesky_module + * \returns the Cholesky decomposition with full pivoting without square root of \c *this + * \sa SelfAdjointView::ldlt() + */ +template +inline const LDLT::PlainObject> +MatrixBase::ldlt() const +{ + return LDLT(derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_LDLT_H diff --git a/Eigen/src/Cholesky/LLT.h b/Eigen/src/Cholesky/LLT.h new file mode 100644 index 000000000..814174d47 --- /dev/null +++ b/Eigen/src/Cholesky/LLT.h @@ -0,0 +1,541 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_LLT_H +#define EIGEN_LLT_H + +namespace Eigen { + +namespace internal{ +template struct LLT_Traits; +} + +/** \ingroup Cholesky_Module + * + * \class LLT + * + * \brief Standard Cholesky decomposition (LL^T) of a matrix and associated features + * + * \tparam _MatrixType the type of the matrix of which we are computing the LL^T Cholesky decomposition + * \tparam _UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper. + * The other triangular part won't be read. + * + * This class performs a LL^T Cholesky decomposition of a symmetric, positive definite + * matrix A such that A = LL^* = U^*U, where L is lower triangular. + * + * While the Cholesky decomposition is particularly useful to solve selfadjoint problems like D^*D x = b, + * for that purpose, we recommend the Cholesky decomposition without square root which is more stable + * and even faster. Nevertheless, this standard Cholesky decomposition remains useful in many other + * situations like generalised eigen problems with hermitian matrices. + * + * Remember that Cholesky decompositions are not rank-revealing. This LLT decomposition is only stable on positive definite matrices, + * use LDLT instead for the semidefinite case. Also, do not use a Cholesky decomposition to determine whether a system of equations + * has a solution. + * + * Example: \include LLT_example.cpp + * Output: \verbinclude LLT_example.out + * + * \b Performance: for best performance, it is recommended to use a column-major storage format + * with the Lower triangular part (the default), or, equivalently, a row-major storage format + * with the Upper triangular part. Otherwise, you might get a 20% slowdown for the full factorization + * step, and rank-updates can be up to 3 times slower. + * + * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. + * + * Note that during the decomposition, only the lower (or upper, as defined by _UpLo) triangular part of A is considered. + * Therefore, the strict lower part does not have to store correct values. + * + * \sa MatrixBase::llt(), SelfAdjointView::llt(), class LDLT + */ +template class LLT +{ + public: + typedef _MatrixType MatrixType; + enum { + RowsAtCompileTime = MatrixType::RowsAtCompileTime, + ColsAtCompileTime = MatrixType::ColsAtCompileTime, + MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime + }; + typedef typename MatrixType::Scalar Scalar; + typedef typename NumTraits::Real RealScalar; + typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 + typedef typename MatrixType::StorageIndex StorageIndex; + + enum { + PacketSize = internal::packet_traits::size, + AlignmentMask = int(PacketSize)-1, + UpLo = _UpLo + }; + + typedef internal::LLT_Traits Traits; + + /** + * \brief Default Constructor. + * + * The default constructor is useful in cases in which the user intends to + * perform decompositions via LLT::compute(const MatrixType&). + */ + LLT() : m_matrix(), m_isInitialized(false) {} + + /** \brief Default Constructor with memory preallocation + * + * Like the default constructor but with preallocation of the internal data + * according to the specified problem \a size. + * \sa LLT() + */ + explicit LLT(Index size) : m_matrix(size, size), + m_isInitialized(false) {} + + template + explicit LLT(const EigenBase& matrix) + : m_matrix(matrix.rows(), matrix.cols()), + m_isInitialized(false) + { + compute(matrix.derived()); + } + + /** \brief Constructs a LDLT factorization from a given matrix + * + * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when + * \c MatrixType is a Eigen::Ref. + * + * \sa LLT(const EigenBase&) + */ + template + explicit LLT(EigenBase& matrix) + : m_matrix(matrix.derived()), + m_isInitialized(false) + { + compute(matrix.derived()); + } + + /** \returns a view of the upper triangular matrix U */ + inline typename Traits::MatrixU matrixU() const + { + eigen_assert(m_isInitialized && "LLT is not initialized."); + return Traits::getU(m_matrix); + } + + /** \returns a view of the lower triangular matrix L */ + inline typename Traits::MatrixL matrixL() const + { + eigen_assert(m_isInitialized && "LLT is not initialized."); + return Traits::getL(m_matrix); + } + + /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A. + * + * Since this LLT class assumes anyway that the matrix A is invertible, the solution + * theoretically exists and is unique regardless of b. + * + * Example: \include LLT_solve.cpp + * Output: \verbinclude LLT_solve.out + * + * \sa solveInPlace(), MatrixBase::llt(), SelfAdjointView::llt() + */ + template + inline const Solve + solve(const MatrixBase& b) const + { + eigen_assert(m_isInitialized && "LLT is not initialized."); + eigen_assert(m_matrix.rows()==b.rows() + && "LLT::solve(): invalid number of rows of the right hand side matrix b"); + return Solve(*this, b.derived()); + } + + template + void solveInPlace(const MatrixBase &bAndX) const; + + template + LLT& compute(const EigenBase& matrix); + + /** \returns an estimate of the reciprocal condition number of the matrix of + * which \c *this is the Cholesky decomposition. + */ + RealScalar rcond() const + { + eigen_assert(m_isInitialized && "LLT is not initialized."); + eigen_assert(m_info == Success && "LLT failed because matrix appears to be negative"); + return internal::rcond_estimate_helper(m_l1_norm, *this); + } + + /** \returns the LLT decomposition matrix + * + * TODO: document the storage layout + */ + inline const MatrixType& matrixLLT() const + { + eigen_assert(m_isInitialized && "LLT is not initialized."); + return m_matrix; + } + + MatrixType reconstructedMatrix() const; + + + /** \brief Reports whether previous computation was successful. + * + * \returns \c Success if computation was succesful, + * \c NumericalIssue if the matrix.appears not to be positive definite. + */ + ComputationInfo info() const + { + eigen_assert(m_isInitialized && "LLT is not initialized."); + return m_info; + } + + /** \returns the adjoint of \c *this, that is, a const reference to the decomposition itself as the underlying matrix is self-adjoint. + * + * This method is provided for compatibility with other matrix decompositions, thus enabling generic code such as: + * \code x = decomposition.adjoint().solve(b) \endcode + */ + const LLT& adjoint() const { return *this; }; + + inline Index rows() const { return m_matrix.rows(); } + inline Index cols() const { return m_matrix.cols(); } + + template + LLT rankUpdate(const VectorType& vec, const RealScalar& sigma = 1); + + #ifndef EIGEN_PARSED_BY_DOXYGEN + template + void _solve_impl(const RhsType &rhs, DstType &dst) const; + #endif + + protected: + + static void check_template_parameters() + { + EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); + } + + /** \internal + * Used to compute and store L + * The strict upper part is not used and even not initialized. + */ + MatrixType m_matrix; + RealScalar m_l1_norm; + bool m_isInitialized; + ComputationInfo m_info; +}; + +namespace internal { + +template struct llt_inplace; + +template +static Index llt_rank_update_lower(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) +{ + using std::sqrt; + typedef typename MatrixType::Scalar Scalar; + typedef typename MatrixType::RealScalar RealScalar; + typedef typename MatrixType::ColXpr ColXpr; + typedef typename internal::remove_all::type ColXprCleaned; + typedef typename ColXprCleaned::SegmentReturnType ColXprSegment; + typedef Matrix TempVectorType; + typedef typename TempVectorType::SegmentReturnType TempVecSegment; + + Index n = mat.cols(); + eigen_assert(mat.rows()==n && vec.size()==n); + + TempVectorType temp; + + if(sigma>0) + { + // This version is based on Givens rotations. + // It is faster than the other one below, but only works for updates, + // i.e., for sigma > 0 + temp = sqrt(sigma) * vec; + + for(Index i=0; i g; + g.makeGivens(mat(i,i), -temp(i), &mat(i,i)); + + Index rs = n-i-1; + if(rs>0) + { + ColXprSegment x(mat.col(i).tail(rs)); + TempVecSegment y(temp.tail(rs)); + apply_rotation_in_the_plane(x, y, g); + } + } + } + else + { + temp = vec; + RealScalar beta = 1; + for(Index j=0; j struct llt_inplace +{ + typedef typename NumTraits::Real RealScalar; + template + static Index unblocked(MatrixType& mat) + { + using std::sqrt; + + eigen_assert(mat.rows()==mat.cols()); + const Index size = mat.rows(); + for(Index k = 0; k < size; ++k) + { + Index rs = size-k-1; // remaining size + + Block A21(mat,k+1,k,rs,1); + Block A10(mat,k,0,1,k); + Block A20(mat,k+1,0,rs,k); + + RealScalar x = numext::real(mat.coeff(k,k)); + if (k>0) x -= A10.squaredNorm(); + if (x<=RealScalar(0)) + return k; + mat.coeffRef(k,k) = x = sqrt(x); + if (k>0 && rs>0) A21.noalias() -= A20 * A10.adjoint(); + if (rs>0) A21 /= x; + } + return -1; + } + + template + static Index blocked(MatrixType& m) + { + eigen_assert(m.rows()==m.cols()); + Index size = m.rows(); + if(size<32) + return unblocked(m); + + Index blockSize = size/8; + blockSize = (blockSize/16)*16; + blockSize = (std::min)((std::max)(blockSize,Index(8)), Index(128)); + + for (Index k=0; k A11(m,k, k, bs,bs); + Block A21(m,k+bs,k, rs,bs); + Block A22(m,k+bs,k+bs,rs,rs); + + Index ret; + if((ret=unblocked(A11))>=0) return k+ret; + if(rs>0) A11.adjoint().template triangularView().template solveInPlace(A21); + if(rs>0) A22.template selfadjointView().rankUpdate(A21,typename NumTraits::Literal(-1)); // bottleneck + } + return -1; + } + + template + static Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma) + { + return Eigen::internal::llt_rank_update_lower(mat, vec, sigma); + } +}; + +template struct llt_inplace +{ + typedef typename NumTraits::Real RealScalar; + + template + static EIGEN_STRONG_INLINE Index unblocked(MatrixType& mat) + { + Transpose matt(mat); + return llt_inplace::unblocked(matt); + } + template + static EIGEN_STRONG_INLINE Index blocked(MatrixType& mat) + { + Transpose matt(mat); + return llt_inplace::blocked(matt); + } + template + static Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma) + { + Transpose matt(mat); + return llt_inplace::rankUpdate(matt, vec.conjugate(), sigma); + } +}; + +template struct LLT_Traits +{ + typedef const TriangularView MatrixL; + typedef const TriangularView MatrixU; + static inline MatrixL getL(const MatrixType& m) { return MatrixL(m); } + static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } + static bool inplace_decomposition(MatrixType& m) + { return llt_inplace::blocked(m)==-1; } +}; + +template struct LLT_Traits +{ + typedef const TriangularView MatrixL; + typedef const TriangularView MatrixU; + static inline MatrixL getL(const MatrixType& m) { return MatrixL(m.adjoint()); } + static inline MatrixU getU(const MatrixType& m) { return MatrixU(m); } + static bool inplace_decomposition(MatrixType& m) + { return llt_inplace::blocked(m)==-1; } +}; + +} // end namespace internal + +/** Computes / recomputes the Cholesky decomposition A = LL^* = U^*U of \a matrix + * + * \returns a reference to *this + * + * Example: \include TutorialLinAlgComputeTwice.cpp + * Output: \verbinclude TutorialLinAlgComputeTwice.out + */ +template +template +LLT& LLT::compute(const EigenBase& a) +{ + check_template_parameters(); + + eigen_assert(a.rows()==a.cols()); + const Index size = a.rows(); + m_matrix.resize(size, size); + if (!internal::is_same_dense(m_matrix, a.derived())) + m_matrix = a.derived(); + + // Compute matrix L1 norm = max abs column sum. + m_l1_norm = RealScalar(0); + // TODO move this code to SelfAdjointView + for (Index col = 0; col < size; ++col) { + RealScalar abs_col_sum; + if (_UpLo == Lower) + abs_col_sum = m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>(); + else + abs_col_sum = m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>(); + if (abs_col_sum > m_l1_norm) + m_l1_norm = abs_col_sum; + } + + m_isInitialized = true; + bool ok = Traits::inplace_decomposition(m_matrix); + m_info = ok ? Success : NumericalIssue; + + return *this; +} + +/** Performs a rank one update (or dowdate) of the current decomposition. + * If A = LL^* before the rank one update, + * then after it we have LL^* = A + sigma * v v^* where \a v must be a vector + * of same dimension. + */ +template +template +LLT<_MatrixType,_UpLo> LLT<_MatrixType,_UpLo>::rankUpdate(const VectorType& v, const RealScalar& sigma) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(VectorType); + eigen_assert(v.size()==m_matrix.cols()); + eigen_assert(m_isInitialized); + if(internal::llt_inplace::rankUpdate(m_matrix,v,sigma)>=0) + m_info = NumericalIssue; + else + m_info = Success; + + return *this; +} + +#ifndef EIGEN_PARSED_BY_DOXYGEN +template +template +void LLT<_MatrixType,_UpLo>::_solve_impl(const RhsType &rhs, DstType &dst) const +{ + dst = rhs; + solveInPlace(dst); +} +#endif + +/** \internal use x = llt_object.solve(x); + * + * This is the \em in-place version of solve(). + * + * \param bAndX represents both the right-hand side matrix b and result x. + * + * This version avoids a copy when the right hand side matrix b is not needed anymore. + * + * \warning The parameter is only marked 'const' to make the C++ compiler accept a temporary expression here. + * This function will const_cast it, so constness isn't honored here. + * + * \sa LLT::solve(), MatrixBase::llt() + */ +template +template +void LLT::solveInPlace(const MatrixBase &bAndX) const +{ + eigen_assert(m_isInitialized && "LLT is not initialized."); + eigen_assert(m_matrix.rows()==bAndX.rows()); + matrixL().solveInPlace(bAndX); + matrixU().solveInPlace(bAndX); +} + +/** \returns the matrix represented by the decomposition, + * i.e., it returns the product: L L^*. + * This function is provided for debug purpose. */ +template +MatrixType LLT::reconstructedMatrix() const +{ + eigen_assert(m_isInitialized && "LLT is not initialized."); + return matrixL() * matrixL().adjoint().toDenseMatrix(); +} + +/** \cholesky_module + * \returns the LLT decomposition of \c *this + * \sa SelfAdjointView::llt() + */ +template +inline const LLT::PlainObject> +MatrixBase::llt() const +{ + return LLT(derived()); +} + +/** \cholesky_module + * \returns the LLT decomposition of \c *this + * \sa SelfAdjointView::llt() + */ +template +inline const LLT::PlainObject, UpLo> +SelfAdjointView::llt() const +{ + return LLT(m_matrix); +} + +} // end namespace Eigen + +#endif // EIGEN_LLT_H diff --git a/Eigen/src/Cholesky/LLT_LAPACKE.h b/Eigen/src/Cholesky/LLT_LAPACKE.h new file mode 100644 index 000000000..bc6489e69 --- /dev/null +++ b/Eigen/src/Cholesky/LLT_LAPACKE.h @@ -0,0 +1,99 @@ +/* + Copyright (c) 2011, Intel Corporation. All rights reserved. + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + * Neither the name of Intel Corporation nor the names of its contributors may + be used to endorse or promote products derived from this software without + specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND + ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED + WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR + ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES + (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; + LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON + ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS + SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + + ******************************************************************************** + * Content : Eigen bindings to LAPACKe + * LLt decomposition based on LAPACKE_?potrf function. + ******************************************************************************** +*/ + +#ifndef EIGEN_LLT_LAPACKE_H +#define EIGEN_LLT_LAPACKE_H + +namespace Eigen { + +namespace internal { + +template struct lapacke_llt; + +#define EIGEN_LAPACKE_LLT(EIGTYPE, BLASTYPE, LAPACKE_PREFIX) \ +template<> struct lapacke_llt \ +{ \ + template \ + static inline Index potrf(MatrixType& m, char uplo) \ + { \ + lapack_int matrix_order; \ + lapack_int size, lda, info, StorageOrder; \ + EIGTYPE* a; \ + eigen_assert(m.rows()==m.cols()); \ + /* Set up parameters for ?potrf */ \ + size = convert_index(m.rows()); \ + StorageOrder = MatrixType::Flags&RowMajorBit?RowMajor:ColMajor; \ + matrix_order = StorageOrder==RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR; \ + a = &(m.coeffRef(0,0)); \ + lda = convert_index(m.outerStride()); \ +\ + info = LAPACKE_##LAPACKE_PREFIX##potrf( matrix_order, uplo, size, (BLASTYPE*)a, lda ); \ + info = (info==0) ? -1 : info>0 ? info-1 : size; \ + return info; \ + } \ +}; \ +template<> struct llt_inplace \ +{ \ + template \ + static Index blocked(MatrixType& m) \ + { \ + return lapacke_llt::potrf(m, 'L'); \ + } \ + template \ + static Index rankUpdate(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) \ + { return Eigen::internal::llt_rank_update_lower(mat, vec, sigma); } \ +}; \ +template<> struct llt_inplace \ +{ \ + template \ + static Index blocked(MatrixType& m) \ + { \ + return lapacke_llt::potrf(m, 'U'); \ + } \ + template \ + static Index rankUpdate(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) \ + { \ + Transpose matt(mat); \ + return llt_inplace::rankUpdate(matt, vec.conjugate(), sigma); \ + } \ +}; + +EIGEN_LAPACKE_LLT(double, double, d) +EIGEN_LAPACKE_LLT(float, float, s) +EIGEN_LAPACKE_LLT(dcomplex, lapack_complex_double, z) +EIGEN_LAPACKE_LLT(scomplex, lapack_complex_float, c) + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_LLT_LAPACKE_H diff --git a/Eigen/src/CholmodSupport/CholmodSupport.h b/Eigen/src/CholmodSupport/CholmodSupport.h new file mode 100644 index 000000000..dc199ece6 --- /dev/null +++ b/Eigen/src/CholmodSupport/CholmodSupport.h @@ -0,0 +1,682 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CHOLMODSUPPORT_H +#define EIGEN_CHOLMODSUPPORT_H + +namespace Eigen { + +namespace internal { + +template struct cholmod_configure_matrix; + +template<> struct cholmod_configure_matrix { + template + static void run(CholmodType& mat) { + mat.xtype = CHOLMOD_REAL; + mat.dtype = CHOLMOD_DOUBLE; + } +}; + +template<> struct cholmod_configure_matrix > { + template + static void run(CholmodType& mat) { + mat.xtype = CHOLMOD_COMPLEX; + mat.dtype = CHOLMOD_DOUBLE; + } +}; + +// Other scalar types are not yet supported by Cholmod +// template<> struct cholmod_configure_matrix { +// template +// static void run(CholmodType& mat) { +// mat.xtype = CHOLMOD_REAL; +// mat.dtype = CHOLMOD_SINGLE; +// } +// }; +// +// template<> struct cholmod_configure_matrix > { +// template +// static void run(CholmodType& mat) { +// mat.xtype = CHOLMOD_COMPLEX; +// mat.dtype = CHOLMOD_SINGLE; +// } +// }; + +} // namespace internal + +/** Wraps the Eigen sparse matrix \a mat into a Cholmod sparse matrix object. + * Note that the data are shared. + */ +template +cholmod_sparse viewAsCholmod(Ref > mat) +{ + cholmod_sparse res; + res.nzmax = mat.nonZeros(); + res.nrow = mat.rows(); + res.ncol = mat.cols(); + res.p = mat.outerIndexPtr(); + res.i = mat.innerIndexPtr(); + res.x = mat.valuePtr(); + res.z = 0; + res.sorted = 1; + if(mat.isCompressed()) + { + res.packed = 1; + res.nz = 0; + } + else + { + res.packed = 0; + res.nz = mat.innerNonZeroPtr(); + } + + res.dtype = 0; + res.stype = -1; + + if (internal::is_same<_StorageIndex,int>::value) + { + res.itype = CHOLMOD_INT; + } + else if (internal::is_same<_StorageIndex,long>::value) + { + res.itype = CHOLMOD_LONG; + } + else + { + eigen_assert(false && "Index type not supported yet"); + } + + // setup res.xtype + internal::cholmod_configure_matrix<_Scalar>::run(res); + + res.stype = 0; + + return res; +} + +template +const cholmod_sparse viewAsCholmod(const SparseMatrix<_Scalar,_Options,_Index>& mat) +{ + cholmod_sparse res = viewAsCholmod(Ref >(mat.const_cast_derived())); + return res; +} + +template +const cholmod_sparse viewAsCholmod(const SparseVector<_Scalar,_Options,_Index>& mat) +{ + cholmod_sparse res = viewAsCholmod(Ref >(mat.const_cast_derived())); + return res; +} + +/** Returns a view of the Eigen sparse matrix \a mat as Cholmod sparse matrix. + * The data are not copied but shared. */ +template +cholmod_sparse viewAsCholmod(const SparseSelfAdjointView, UpLo>& mat) +{ + cholmod_sparse res = viewAsCholmod(Ref >(mat.matrix().const_cast_derived())); + + if(UpLo==Upper) res.stype = 1; + if(UpLo==Lower) res.stype = -1; + // swap stype for rowmajor matrices (only works for real matrices) + EIGEN_STATIC_ASSERT((_Options & RowMajorBit) == 0 || NumTraits<_Scalar>::IsComplex == 0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); + if(_Options & RowMajorBit) res.stype *=-1; + + return res; +} + +/** Returns a view of the Eigen \b dense matrix \a mat as Cholmod dense matrix. + * The data are not copied but shared. */ +template +cholmod_dense viewAsCholmod(MatrixBase& mat) +{ + EIGEN_STATIC_ASSERT((internal::traits::Flags&RowMajorBit)==0,THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); + typedef typename Derived::Scalar Scalar; + + cholmod_dense res; + res.nrow = mat.rows(); + res.ncol = mat.cols(); + res.nzmax = res.nrow * res.ncol; + res.d = Derived::IsVectorAtCompileTime ? mat.derived().size() : mat.derived().outerStride(); + res.x = (void*)(mat.derived().data()); + res.z = 0; + + internal::cholmod_configure_matrix::run(res); + + return res; +} + +/** Returns a view of the Cholmod sparse matrix \a cm as an Eigen sparse matrix. + * The data are not copied but shared. */ +template +MappedSparseMatrix viewAsEigen(cholmod_sparse& cm) +{ + return MappedSparseMatrix + (cm.nrow, cm.ncol, static_cast(cm.p)[cm.ncol], + static_cast(cm.p), static_cast(cm.i),static_cast(cm.x) ); +} + +namespace internal { + +// template specializations for int and long that call the correct cholmod method + +#define EIGEN_CHOLMOD_SPECIALIZE0(ret, name) \ + template inline ret cm_ ## name (cholmod_common &Common) { return cholmod_ ## name (&Common); } \ + template<> inline ret cm_ ## name (cholmod_common &Common) { return cholmod_l_ ## name (&Common); } + +#define EIGEN_CHOLMOD_SPECIALIZE1(ret, name, t1, a1) \ + template inline ret cm_ ## name (t1& a1, cholmod_common &Common) { return cholmod_ ## name (&a1, &Common); } \ + template<> inline ret cm_ ## name (t1& a1, cholmod_common &Common) { return cholmod_l_ ## name (&a1, &Common); } + +EIGEN_CHOLMOD_SPECIALIZE0(int, start) +EIGEN_CHOLMOD_SPECIALIZE0(int, finish) + +EIGEN_CHOLMOD_SPECIALIZE1(int, free_factor, cholmod_factor*, L) +EIGEN_CHOLMOD_SPECIALIZE1(int, free_dense, cholmod_dense*, X) +EIGEN_CHOLMOD_SPECIALIZE1(int, free_sparse, cholmod_sparse*, A) + +EIGEN_CHOLMOD_SPECIALIZE1(cholmod_factor*, analyze, cholmod_sparse, A) + +template inline cholmod_dense* cm_solve (int sys, cholmod_factor& L, cholmod_dense& B, cholmod_common &Common) { return cholmod_solve (sys, &L, &B, &Common); } +template<> inline cholmod_dense* cm_solve (int sys, cholmod_factor& L, cholmod_dense& B, cholmod_common &Common) { return cholmod_l_solve (sys, &L, &B, &Common); } + +template inline cholmod_sparse* cm_spsolve (int sys, cholmod_factor& L, cholmod_sparse& B, cholmod_common &Common) { return cholmod_spsolve (sys, &L, &B, &Common); } +template<> inline cholmod_sparse* cm_spsolve (int sys, cholmod_factor& L, cholmod_sparse& B, cholmod_common &Common) { return cholmod_l_spsolve (sys, &L, &B, &Common); } + +template +inline int cm_factorize_p (cholmod_sparse* A, double beta[2], _StorageIndex* fset, std::size_t fsize, cholmod_factor* L, cholmod_common &Common) { return cholmod_factorize_p (A, beta, fset, fsize, L, &Common); } +template<> +inline int cm_factorize_p (cholmod_sparse* A, double beta[2], long* fset, std::size_t fsize, cholmod_factor* L, cholmod_common &Common) { return cholmod_l_factorize_p (A, beta, fset, fsize, L, &Common); } + +#undef EIGEN_CHOLMOD_SPECIALIZE0 +#undef EIGEN_CHOLMOD_SPECIALIZE1 + +} // namespace internal + + +enum CholmodMode { + CholmodAuto, CholmodSimplicialLLt, CholmodSupernodalLLt, CholmodLDLt +}; + + +/** \ingroup CholmodSupport_Module + * \class CholmodBase + * \brief The base class for the direct Cholesky factorization of Cholmod + * \sa class CholmodSupernodalLLT, class CholmodSimplicialLDLT, class CholmodSimplicialLLT + */ +template +class CholmodBase : public SparseSolverBase +{ + protected: + typedef SparseSolverBase Base; + using Base::derived; + using Base::m_isInitialized; + public: + typedef _MatrixType MatrixType; + enum { UpLo = _UpLo }; + typedef typename MatrixType::Scalar Scalar; + typedef typename MatrixType::RealScalar RealScalar; + typedef MatrixType CholMatrixType; + typedef typename MatrixType::StorageIndex StorageIndex; + enum { + ColsAtCompileTime = MatrixType::ColsAtCompileTime, + MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime + }; + + public: + + CholmodBase() + : m_cholmodFactor(0), m_info(Success), m_factorizationIsOk(false), m_analysisIsOk(false) + { + EIGEN_STATIC_ASSERT((internal::is_same::value), CHOLMOD_SUPPORTS_DOUBLE_PRECISION_ONLY); + m_shiftOffset[0] = m_shiftOffset[1] = 0.0; + internal::cm_start(m_cholmod); + } + + explicit CholmodBase(const MatrixType& matrix) + : m_cholmodFactor(0), m_info(Success), m_factorizationIsOk(false), m_analysisIsOk(false) + { + EIGEN_STATIC_ASSERT((internal::is_same::value), CHOLMOD_SUPPORTS_DOUBLE_PRECISION_ONLY); + m_shiftOffset[0] = m_shiftOffset[1] = 0.0; + internal::cm_start(m_cholmod); + compute(matrix); + } + + ~CholmodBase() + { + if(m_cholmodFactor) + internal::cm_free_factor(m_cholmodFactor, m_cholmod); + internal::cm_finish(m_cholmod); + } + + inline StorageIndex cols() const { return internal::convert_index(m_cholmodFactor->n); } + inline StorageIndex rows() const { return internal::convert_index(m_cholmodFactor->n); } + + /** \brief Reports whether previous computation was successful. + * + * \returns \c Success if computation was successful, + * \c NumericalIssue if the matrix.appears to be negative. + */ + ComputationInfo info() const + { + eigen_assert(m_isInitialized && "Decomposition is not initialized."); + return m_info; + } + + /** Computes the sparse Cholesky decomposition of \a matrix */ + Derived& compute(const MatrixType& matrix) + { + analyzePattern(matrix); + factorize(matrix); + return derived(); + } + + /** Performs a symbolic decomposition on the sparsity pattern of \a matrix. + * + * This function is particularly useful when solving for several problems having the same structure. + * + * \sa factorize() + */ + void analyzePattern(const MatrixType& matrix) + { + if(m_cholmodFactor) + { + internal::cm_free_factor(m_cholmodFactor, m_cholmod); + m_cholmodFactor = 0; + } + cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView()); + m_cholmodFactor = internal::cm_analyze(A, m_cholmod); + + this->m_isInitialized = true; + this->m_info = Success; + m_analysisIsOk = true; + m_factorizationIsOk = false; + } + + /** Performs a numeric decomposition of \a matrix + * + * The given matrix must have the same sparsity pattern as the matrix on which the symbolic decomposition has been performed. + * + * \sa analyzePattern() + */ + void factorize(const MatrixType& matrix) + { + eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); + cholmod_sparse A = viewAsCholmod(matrix.template selfadjointView()); + internal::cm_factorize_p(&A, m_shiftOffset, 0, 0, m_cholmodFactor, m_cholmod); + + // If the factorization failed, minor is the column at which it did. On success minor == n. + this->m_info = (m_cholmodFactor->minor == m_cholmodFactor->n ? Success : NumericalIssue); + m_factorizationIsOk = true; + } + + /** Returns a reference to the Cholmod's configuration structure to get a full control over the performed operations. + * See the Cholmod user guide for details. */ + cholmod_common& cholmod() { return m_cholmod; } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** \internal */ + template + void _solve_impl(const MatrixBase &b, MatrixBase &dest) const + { + eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); + const Index size = m_cholmodFactor->n; + EIGEN_UNUSED_VARIABLE(size); + eigen_assert(size==b.rows()); + + // Cholmod needs column-major storage without inner-stride, which corresponds to the default behavior of Ref. + Ref > b_ref(b.derived()); + + cholmod_dense b_cd = viewAsCholmod(b_ref); + cholmod_dense* x_cd = internal::cm_solve(CHOLMOD_A, *m_cholmodFactor, b_cd, m_cholmod); + if(!x_cd) + { + this->m_info = NumericalIssue; + return; + } + // TODO optimize this copy by swapping when possible (be careful with alignment, etc.) + // NOTE Actually, the copy can be avoided by calling cholmod_solve2 instead of cholmod_solve + dest = Matrix::Map(reinterpret_cast(x_cd->x),b.rows(),b.cols()); + internal::cm_free_dense(x_cd, m_cholmod); + } + + /** \internal */ + template + void _solve_impl(const SparseMatrixBase &b, SparseMatrixBase &dest) const + { + eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); + const Index size = m_cholmodFactor->n; + EIGEN_UNUSED_VARIABLE(size); + eigen_assert(size==b.rows()); + + // note: cs stands for Cholmod Sparse + Ref > b_ref(b.const_cast_derived()); + cholmod_sparse b_cs = viewAsCholmod(b_ref); + cholmod_sparse* x_cs = internal::cm_spsolve(CHOLMOD_A, *m_cholmodFactor, b_cs, m_cholmod); + if(!x_cs) + { + this->m_info = NumericalIssue; + return; + } + // TODO optimize this copy by swapping when possible (be careful with alignment, etc.) + // NOTE cholmod_spsolve in fact just calls the dense solver for blocks of 4 columns at a time (similar to Eigen's sparse solver) + dest.derived() = viewAsEigen(*x_cs); + internal::cm_free_sparse(x_cs, m_cholmod); + } + #endif // EIGEN_PARSED_BY_DOXYGEN + + + /** Sets the shift parameter that will be used to adjust the diagonal coefficients during the numerical factorization. + * + * During the numerical factorization, an offset term is added to the diagonal coefficients:\n + * \c d_ii = \a offset + \c d_ii + * + * The default is \a offset=0. + * + * \returns a reference to \c *this. + */ + Derived& setShift(const RealScalar& offset) + { + m_shiftOffset[0] = double(offset); + return derived(); + } + + /** \returns the determinant of the underlying matrix from the current factorization */ + Scalar determinant() const + { + using std::exp; + return exp(logDeterminant()); + } + + /** \returns the log determinant of the underlying matrix from the current factorization */ + Scalar logDeterminant() const + { + using std::log; + using numext::real; + eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); + + RealScalar logDet = 0; + Scalar *x = static_cast(m_cholmodFactor->x); + if (m_cholmodFactor->is_super) + { + // Supernodal factorization stored as a packed list of dense column-major blocs, + // as described by the following structure: + + // super[k] == index of the first column of the j-th super node + StorageIndex *super = static_cast(m_cholmodFactor->super); + // pi[k] == offset to the description of row indices + StorageIndex *pi = static_cast(m_cholmodFactor->pi); + // px[k] == offset to the respective dense block + StorageIndex *px = static_cast(m_cholmodFactor->px); + + Index nb_super_nodes = m_cholmodFactor->nsuper; + for (Index k=0; k < nb_super_nodes; ++k) + { + StorageIndex ncols = super[k + 1] - super[k]; + StorageIndex nrows = pi[k + 1] - pi[k]; + + Map, 0, InnerStride<> > sk(x + px[k], ncols, InnerStride<>(nrows+1)); + logDet += sk.real().log().sum(); + } + } + else + { + // Simplicial factorization stored as standard CSC matrix. + StorageIndex *p = static_cast(m_cholmodFactor->p); + Index size = m_cholmodFactor->n; + for (Index k=0; kis_ll) + logDet *= 2.0; + return logDet; + }; + + template + void dumpMemory(Stream& /*s*/) + {} + + protected: + mutable cholmod_common m_cholmod; + cholmod_factor* m_cholmodFactor; + double m_shiftOffset[2]; + mutable ComputationInfo m_info; + int m_factorizationIsOk; + int m_analysisIsOk; +}; + +/** \ingroup CholmodSupport_Module + * \class CholmodSimplicialLLT + * \brief A simplicial direct Cholesky (LLT) factorization and solver based on Cholmod + * + * This class allows to solve for A.X = B sparse linear problems via a simplicial LL^T Cholesky factorization + * using the Cholmod library. + * This simplicial variant is equivalent to Eigen's built-in SimplicialLLT class. Therefore, it has little practical interest. + * The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices + * X and B can be either dense or sparse. + * + * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> + * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower + * or Upper. Default is Lower. + * + * \implsparsesolverconcept + * + * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed. + * + * \warning Only double precision real and complex scalar types are supported by Cholmod. + * + * \sa \ref TutorialSparseSolverConcept, class CholmodSupernodalLLT, class SimplicialLLT + */ +template +class CholmodSimplicialLLT : public CholmodBase<_MatrixType, _UpLo, CholmodSimplicialLLT<_MatrixType, _UpLo> > +{ + typedef CholmodBase<_MatrixType, _UpLo, CholmodSimplicialLLT> Base; + using Base::m_cholmod; + + public: + + typedef _MatrixType MatrixType; + + CholmodSimplicialLLT() : Base() { init(); } + + CholmodSimplicialLLT(const MatrixType& matrix) : Base() + { + init(); + this->compute(matrix); + } + + ~CholmodSimplicialLLT() {} + protected: + void init() + { + m_cholmod.final_asis = 0; + m_cholmod.supernodal = CHOLMOD_SIMPLICIAL; + m_cholmod.final_ll = 1; + } +}; + + +/** \ingroup CholmodSupport_Module + * \class CholmodSimplicialLDLT + * \brief A simplicial direct Cholesky (LDLT) factorization and solver based on Cholmod + * + * This class allows to solve for A.X = B sparse linear problems via a simplicial LDL^T Cholesky factorization + * using the Cholmod library. + * This simplicial variant is equivalent to Eigen's built-in SimplicialLDLT class. Therefore, it has little practical interest. + * The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices + * X and B can be either dense or sparse. + * + * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> + * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower + * or Upper. Default is Lower. + * + * \implsparsesolverconcept + * + * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed. + * + * \warning Only double precision real and complex scalar types are supported by Cholmod. + * + * \sa \ref TutorialSparseSolverConcept, class CholmodSupernodalLLT, class SimplicialLDLT + */ +template +class CholmodSimplicialLDLT : public CholmodBase<_MatrixType, _UpLo, CholmodSimplicialLDLT<_MatrixType, _UpLo> > +{ + typedef CholmodBase<_MatrixType, _UpLo, CholmodSimplicialLDLT> Base; + using Base::m_cholmod; + + public: + + typedef _MatrixType MatrixType; + + CholmodSimplicialLDLT() : Base() { init(); } + + CholmodSimplicialLDLT(const MatrixType& matrix) : Base() + { + init(); + this->compute(matrix); + } + + ~CholmodSimplicialLDLT() {} + protected: + void init() + { + m_cholmod.final_asis = 1; + m_cholmod.supernodal = CHOLMOD_SIMPLICIAL; + } +}; + +/** \ingroup CholmodSupport_Module + * \class CholmodSupernodalLLT + * \brief A supernodal Cholesky (LLT) factorization and solver based on Cholmod + * + * This class allows to solve for A.X = B sparse linear problems via a supernodal LL^T Cholesky factorization + * using the Cholmod library. + * This supernodal variant performs best on dense enough problems, e.g., 3D FEM, or very high order 2D FEM. + * The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices + * X and B can be either dense or sparse. + * + * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> + * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower + * or Upper. Default is Lower. + * + * \implsparsesolverconcept + * + * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed. + * + * \warning Only double precision real and complex scalar types are supported by Cholmod. + * + * \sa \ref TutorialSparseSolverConcept + */ +template +class CholmodSupernodalLLT : public CholmodBase<_MatrixType, _UpLo, CholmodSupernodalLLT<_MatrixType, _UpLo> > +{ + typedef CholmodBase<_MatrixType, _UpLo, CholmodSupernodalLLT> Base; + using Base::m_cholmod; + + public: + + typedef _MatrixType MatrixType; + + CholmodSupernodalLLT() : Base() { init(); } + + CholmodSupernodalLLT(const MatrixType& matrix) : Base() + { + init(); + this->compute(matrix); + } + + ~CholmodSupernodalLLT() {} + protected: + void init() + { + m_cholmod.final_asis = 1; + m_cholmod.supernodal = CHOLMOD_SUPERNODAL; + } +}; + +/** \ingroup CholmodSupport_Module + * \class CholmodDecomposition + * \brief A general Cholesky factorization and solver based on Cholmod + * + * This class allows to solve for A.X = B sparse linear problems via a LL^T or LDL^T Cholesky factorization + * using the Cholmod library. The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices + * X and B can be either dense or sparse. + * + * This variant permits to change the underlying Cholesky method at runtime. + * On the other hand, it does not provide access to the result of the factorization. + * The default is to let Cholmod automatically choose between a simplicial and supernodal factorization. + * + * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> + * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower + * or Upper. Default is Lower. + * + * \implsparsesolverconcept + * + * This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed. + * + * \warning Only double precision real and complex scalar types are supported by Cholmod. + * + * \sa \ref TutorialSparseSolverConcept + */ +template +class CholmodDecomposition : public CholmodBase<_MatrixType, _UpLo, CholmodDecomposition<_MatrixType, _UpLo> > +{ + typedef CholmodBase<_MatrixType, _UpLo, CholmodDecomposition> Base; + using Base::m_cholmod; + + public: + + typedef _MatrixType MatrixType; + + CholmodDecomposition() : Base() { init(); } + + CholmodDecomposition(const MatrixType& matrix) : Base() + { + init(); + this->compute(matrix); + } + + ~CholmodDecomposition() {} + + void setMode(CholmodMode mode) + { + switch(mode) + { + case CholmodAuto: + m_cholmod.final_asis = 1; + m_cholmod.supernodal = CHOLMOD_AUTO; + break; + case CholmodSimplicialLLt: + m_cholmod.final_asis = 0; + m_cholmod.supernodal = CHOLMOD_SIMPLICIAL; + m_cholmod.final_ll = 1; + break; + case CholmodSupernodalLLt: + m_cholmod.final_asis = 1; + m_cholmod.supernodal = CHOLMOD_SUPERNODAL; + break; + case CholmodLDLt: + m_cholmod.final_asis = 1; + m_cholmod.supernodal = CHOLMOD_SIMPLICIAL; + break; + default: + break; + } + } + protected: + void init() + { + m_cholmod.final_asis = 1; + m_cholmod.supernodal = CHOLMOD_AUTO; + } +}; + +} // end namespace Eigen + +#endif // EIGEN_CHOLMODSUPPORT_H diff --git a/Eigen/src/Core/ArithmeticSequence.h b/Eigen/src/Core/ArithmeticSequence.h new file mode 100644 index 000000000..ada1571f1 --- /dev/null +++ b/Eigen/src/Core/ArithmeticSequence.h @@ -0,0 +1,350 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2017 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ARITHMETIC_SEQUENCE_H +#define EIGEN_ARITHMETIC_SEQUENCE_H + +namespace Eigen { + +namespace internal { + +#if (!EIGEN_HAS_CXX11) || !((!EIGEN_COMP_GNUC) || EIGEN_COMP_GNUC>=48) +template struct aseq_negate {}; + +template<> struct aseq_negate { + typedef Index type; +}; + +template struct aseq_negate > { + typedef FixedInt<-N> type; +}; + +// Compilation error in the following case: +template<> struct aseq_negate > {}; + +template::value, + bool SizeIsSymbolic =Symbolic::is_symbolic::value> +struct aseq_reverse_first_type { + typedef Index type; +}; + +template +struct aseq_reverse_first_type { + typedef Symbolic::AddExpr > >, + Symbolic::ValueExpr > + > type; +}; + +template +struct aseq_reverse_first_type_aux { + typedef Index type; +}; + +template +struct aseq_reverse_first_type_aux::type> { + typedef FixedInt<(SizeType::value-1)*IncrType::value> type; +}; + +template +struct aseq_reverse_first_type { + typedef typename aseq_reverse_first_type_aux::type Aux; + typedef Symbolic::AddExpr > type; +}; + +template +struct aseq_reverse_first_type { + typedef Symbolic::AddExpr > >, + Symbolic::ValueExpr >, + Symbolic::ValueExpr<> > type; +}; +#endif + +// Helper to cleanup the type of the increment: +template struct cleanup_seq_incr { + typedef typename cleanup_index_type::type type; +}; + +} + +//-------------------------------------------------------------------------------- +// seq(first,last,incr) and seqN(first,size,incr) +//-------------------------------------------------------------------------------- + +template > +class ArithmeticSequence; + +template +ArithmeticSequence::type, + typename internal::cleanup_index_type::type, + typename internal::cleanup_seq_incr::type > +seqN(FirstType first, SizeType size, IncrType incr); + +/** \class ArithmeticSequence + * \ingroup Core_Module + * + * This class represents an arithmetic progression \f$ a_0, a_1, a_2, ..., a_{n-1}\f$ defined by + * its \em first value \f$ a_0 \f$, its \em size (aka length) \em n, and the \em increment (aka stride) + * that is equal to \f$ a_{i+1}-a_{i}\f$ for any \em i. + * + * It is internally used as the return type of the Eigen::seq and Eigen::seqN functions, and as the input arguments + * of DenseBase::operator()(const RowIndices&, const ColIndices&), and most of the time this is the + * only way it is used. + * + * \tparam FirstType type of the first element, usually an Index, + * but internally it can be a symbolic expression + * \tparam SizeType type representing the size of the sequence, usually an Index + * or a compile time integral constant. Internally, it can also be a symbolic expression + * \tparam IncrType type of the increment, can be a runtime Index, or a compile time integral constant (default is compile-time 1) + * + * \sa Eigen::seq, Eigen::seqN, DenseBase::operator()(const RowIndices&, const ColIndices&), class IndexedView + */ +template +class ArithmeticSequence +{ +public: + ArithmeticSequence(FirstType first, SizeType size) : m_first(first), m_size(size) {} + ArithmeticSequence(FirstType first, SizeType size, IncrType incr) : m_first(first), m_size(size), m_incr(incr) {} + + enum { + SizeAtCompileTime = internal::get_fixed_value::value, + IncrAtCompileTime = internal::get_fixed_value::value + }; + + /** \returns the size, i.e., number of elements, of the sequence */ + Index size() const { return m_size; } + + /** \returns the first element \f$ a_0 \f$ in the sequence */ + Index first() const { return m_first; } + + /** \returns the value \f$ a_i \f$ at index \a i in the sequence. */ + Index operator[](Index i) const { return m_first + i * m_incr; } + + const FirstType& firstObject() const { return m_first; } + const SizeType& sizeObject() const { return m_size; } + const IncrType& incrObject() const { return m_incr; } + +protected: + FirstType m_first; + SizeType m_size; + IncrType m_incr; + +public: + +#if EIGEN_HAS_CXX11 && ((!EIGEN_COMP_GNUC) || EIGEN_COMP_GNUC>=48) + auto reverse() const -> decltype(Eigen::seqN(m_first+(m_size+fix<-1>())*m_incr,m_size,-m_incr)) { + return seqN(m_first+(m_size+fix<-1>())*m_incr,m_size,-m_incr); + } +#else +protected: + typedef typename internal::aseq_negate::type ReverseIncrType; + typedef typename internal::aseq_reverse_first_type::type ReverseFirstType; +public: + ArithmeticSequence + reverse() const { + return seqN(m_first+(m_size+fix<-1>())*m_incr,m_size,-m_incr); + } +#endif +}; + +/** \returns an ArithmeticSequence starting at \a first, of length \a size, and increment \a incr + * + * \sa seqN(FirstType,SizeType), seq(FirstType,LastType,IncrType) */ +template +ArithmeticSequence::type,typename internal::cleanup_index_type::type,typename internal::cleanup_seq_incr::type > +seqN(FirstType first, SizeType size, IncrType incr) { + return ArithmeticSequence::type,typename internal::cleanup_index_type::type,typename internal::cleanup_seq_incr::type>(first,size,incr); +} + +/** \returns an ArithmeticSequence starting at \a first, of length \a size, and unit increment + * + * \sa seqN(FirstType,SizeType,IncrType), seq(FirstType,LastType) */ +template +ArithmeticSequence::type,typename internal::cleanup_index_type::type > +seqN(FirstType first, SizeType size) { + return ArithmeticSequence::type,typename internal::cleanup_index_type::type>(first,size); +} + +#ifdef EIGEN_PARSED_BY_DOXYGEN + +/** \returns an ArithmeticSequence starting at \a f, up (or down) to \a l, and with positive (or negative) increment \a incr + * + * It is essentially an alias to: + * \code + * seqN(f, (l-f+incr)/incr, incr); + * \endcode + * + * \sa seqN(FirstType,SizeType,IncrType), seq(FirstType,LastType) + */ +template +auto seq(FirstType f, LastType l, IncrType incr); + +/** \returns an ArithmeticSequence starting at \a f, up (or down) to \a l, and unit increment + * + * It is essentially an alias to: + * \code + * seqN(f,l-f+1); + * \endcode + * + * \sa seqN(FirstType,SizeType), seq(FirstType,LastType,IncrType) + */ +template +auto seq(FirstType f, LastType l); + +#else // EIGEN_PARSED_BY_DOXYGEN + +#if EIGEN_HAS_CXX11 +template +auto seq(FirstType f, LastType l) -> decltype(seqN(typename internal::cleanup_index_type::type(f), + ( typename internal::cleanup_index_type::type(l) + - typename internal::cleanup_index_type::type(f)+fix<1>()))) +{ + return seqN(typename internal::cleanup_index_type::type(f), + (typename internal::cleanup_index_type::type(l) + -typename internal::cleanup_index_type::type(f)+fix<1>())); +} + +template +auto seq(FirstType f, LastType l, IncrType incr) + -> decltype(seqN(typename internal::cleanup_index_type::type(f), + ( typename internal::cleanup_index_type::type(l) + - typename internal::cleanup_index_type::type(f)+typename internal::cleanup_seq_incr::type(incr) + ) / typename internal::cleanup_seq_incr::type(incr), + typename internal::cleanup_seq_incr::type(incr))) +{ + typedef typename internal::cleanup_seq_incr::type CleanedIncrType; + return seqN(typename internal::cleanup_index_type::type(f), + ( typename internal::cleanup_index_type::type(l) + -typename internal::cleanup_index_type::type(f)+CleanedIncrType(incr)) / CleanedIncrType(incr), + CleanedIncrType(incr)); +} +#else + +template +typename internal::enable_if::value || Symbolic::is_symbolic::value), + ArithmeticSequence::type,Index> >::type +seq(FirstType f, LastType l) +{ + return seqN(typename internal::cleanup_index_type::type(f), + Index((typename internal::cleanup_index_type::type(l)-typename internal::cleanup_index_type::type(f)+fix<1>()))); +} + +template +typename internal::enable_if::value, + ArithmeticSequence,Symbolic::ValueExpr<> >, + Symbolic::ValueExpr > > > >::type +seq(const Symbolic::BaseExpr &f, LastType l) +{ + return seqN(f.derived(),(typename internal::cleanup_index_type::type(l)-f.derived()+fix<1>())); +} + +template +typename internal::enable_if::value, + ArithmeticSequence::type, + Symbolic::AddExpr >, + Symbolic::ValueExpr > > > >::type +seq(FirstType f, const Symbolic::BaseExpr &l) +{ + return seqN(typename internal::cleanup_index_type::type(f),(l.derived()-typename internal::cleanup_index_type::type(f)+fix<1>())); +} + +template +ArithmeticSequence >,Symbolic::ValueExpr > > > +seq(const Symbolic::BaseExpr &f, const Symbolic::BaseExpr &l) +{ + return seqN(f.derived(),(l.derived()-f.derived()+fix<1>())); +} + + +template +typename internal::enable_if::value || Symbolic::is_symbolic::value), + ArithmeticSequence::type,Index,typename internal::cleanup_seq_incr::type> >::type +seq(FirstType f, LastType l, IncrType incr) +{ + typedef typename internal::cleanup_seq_incr::type CleanedIncrType; + return seqN(typename internal::cleanup_index_type::type(f), + Index((typename internal::cleanup_index_type::type(l)-typename internal::cleanup_index_type::type(f)+CleanedIncrType(incr))/CleanedIncrType(incr)), incr); +} + +template +typename internal::enable_if::value, + ArithmeticSequence, + Symbolic::ValueExpr<> >, + Symbolic::ValueExpr::type> >, + Symbolic::ValueExpr::type> >, + typename internal::cleanup_seq_incr::type> >::type +seq(const Symbolic::BaseExpr &f, LastType l, IncrType incr) +{ + typedef typename internal::cleanup_seq_incr::type CleanedIncrType; + return seqN(f.derived(),(typename internal::cleanup_index_type::type(l)-f.derived()+CleanedIncrType(incr))/CleanedIncrType(incr), incr); +} + +template +typename internal::enable_if::value, + ArithmeticSequence::type, + Symbolic::QuotientExpr >, + Symbolic::ValueExpr::type> >, + Symbolic::ValueExpr::type> >, + typename internal::cleanup_seq_incr::type> >::type +seq(FirstType f, const Symbolic::BaseExpr &l, IncrType incr) +{ + typedef typename internal::cleanup_seq_incr::type CleanedIncrType; + return seqN(typename internal::cleanup_index_type::type(f), + (l.derived()-typename internal::cleanup_index_type::type(f)+CleanedIncrType(incr))/CleanedIncrType(incr), incr); +} + +template +ArithmeticSequence >, + Symbolic::ValueExpr::type> >, + Symbolic::ValueExpr::type> >, + typename internal::cleanup_seq_incr::type> +seq(const Symbolic::BaseExpr &f, const Symbolic::BaseExpr &l, IncrType incr) +{ + typedef typename internal::cleanup_seq_incr::type CleanedIncrType; + return seqN(f.derived(),(l.derived()-f.derived()+CleanedIncrType(incr))/CleanedIncrType(incr), incr); +} +#endif + +#endif // EIGEN_PARSED_BY_DOXYGEN + +namespace internal { + +// Convert a symbolic span into a usable one (i.e., remove last/end "keywords") +template +struct make_size_type { + typedef typename internal::conditional::value, Index, T>::type type; +}; + +template +struct IndexedViewCompatibleType, XprSize> { + typedef ArithmeticSequence::type,IncrType> type; +}; + +template +ArithmeticSequence::type,IncrType> +makeIndexedViewCompatible(const ArithmeticSequence& ids, Index size,SpecializedType) { + return ArithmeticSequence::type,IncrType>( + eval_expr_given_size(ids.firstObject(),size),eval_expr_given_size(ids.sizeObject(),size),ids.incrObject()); +} + +template +struct get_compile_time_incr > { + enum { value = get_fixed_value::value }; +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_ARITHMETIC_SEQUENCE_H diff --git a/Eigen/src/Core/Array.h b/Eigen/src/Core/Array.h new file mode 100644 index 000000000..e10020d4f --- /dev/null +++ b/Eigen/src/Core/Array.h @@ -0,0 +1,331 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ARRAY_H +#define EIGEN_ARRAY_H + +namespace Eigen { + +namespace internal { +template +struct traits > : traits > +{ + typedef ArrayXpr XprKind; + typedef ArrayBase > XprBase; +}; +} + +/** \class Array + * \ingroup Core_Module + * + * \brief General-purpose arrays with easy API for coefficient-wise operations + * + * The %Array class is very similar to the Matrix class. It provides + * general-purpose one- and two-dimensional arrays. The difference between the + * %Array and the %Matrix class is primarily in the API: the API for the + * %Array class provides easy access to coefficient-wise operations, while the + * API for the %Matrix class provides easy access to linear-algebra + * operations. + * + * See documentation of class Matrix for detailed information on the template parameters + * storage layout. + * + * This class can be extended with the help of the plugin mechanism described on the page + * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_ARRAY_PLUGIN. + * + * \sa \blank \ref TutorialArrayClass, \ref TopicClassHierarchy + */ +template +class Array + : public PlainObjectBase > +{ + public: + + typedef PlainObjectBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Array) + + enum { Options = _Options }; + typedef typename Base::PlainObject PlainObject; + + protected: + template + friend struct internal::conservative_resize_like_impl; + + using Base::m_storage; + + public: + + using Base::base; + using Base::coeff; + using Base::coeffRef; + + /** + * The usage of + * using Base::operator=; + * fails on MSVC. Since the code below is working with GCC and MSVC, we skipped + * the usage of 'using'. This should be done only for operator=. + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array& operator=(const EigenBase &other) + { + return Base::operator=(other); + } + + /** Set all the entries to \a value. + * \sa DenseBase::setConstant(), DenseBase::fill() + */ + /* This overload is needed because the usage of + * using Base::operator=; + * fails on MSVC. Since the code below is working with GCC and MSVC, we skipped + * the usage of 'using'. This should be done only for operator=. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array& operator=(const Scalar &value) + { + Base::setConstant(value); + return *this; + } + + /** Copies the value of the expression \a other into \c *this with automatic resizing. + * + * *this might be resized to match the dimensions of \a other. If *this was a null matrix (not already initialized), + * it will be initialized. + * + * Note that copying a row-vector into a vector (and conversely) is allowed. + * The resizing, if any, is then done in the appropriate way so that row-vectors + * remain row-vectors and vectors remain vectors. + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array& operator=(const DenseBase& other) + { + return Base::_set(other); + } + + /** This is a special case of the templated operator=. Its purpose is to + * prevent a default operator= from hiding the templated operator=. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array& operator=(const Array& other) + { + return Base::_set(other); + } + + /** Default constructor. + * + * For fixed-size matrices, does nothing. + * + * For dynamic-size matrices, creates an empty matrix of size 0. Does not allocate any array. Such a matrix + * is called a null matrix. This constructor is the unique way to create null matrices: resizing + * a matrix to 0 is not supported. + * + * \sa resize(Index,Index) + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array() : Base() + { + Base::_check_template_params(); + EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + } + +#ifndef EIGEN_PARSED_BY_DOXYGEN + // FIXME is it still needed ?? + /** \internal */ + EIGEN_DEVICE_FUNC + Array(internal::constructor_without_unaligned_array_assert) + : Base(internal::constructor_without_unaligned_array_assert()) + { + Base::_check_template_params(); + EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + } +#endif + +#if EIGEN_HAS_RVALUE_REFERENCES + EIGEN_DEVICE_FUNC + Array(Array&& other) EIGEN_NOEXCEPT_IF(std::is_nothrow_move_constructible::value) + : Base(std::move(other)) + { + Base::_check_template_params(); + if (RowsAtCompileTime!=Dynamic && ColsAtCompileTime!=Dynamic) + Base::_set_noalias(other); + } + EIGEN_DEVICE_FUNC + Array& operator=(Array&& other) EIGEN_NOEXCEPT_IF(std::is_nothrow_move_assignable::value) + { + other.swap(*this); + return *this; + } +#endif + + #ifndef EIGEN_PARSED_BY_DOXYGEN + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE explicit Array(const T& x) + { + Base::_check_template_params(); + Base::template _init1(x); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array(const T0& val0, const T1& val1) + { + Base::_check_template_params(); + this->template _init2(val0, val1); + } + #else + /** \brief Constructs a fixed-sized array initialized with coefficients starting at \a data */ + EIGEN_DEVICE_FUNC explicit Array(const Scalar *data); + /** Constructs a vector or row-vector with given dimension. \only_for_vectors + * + * Note that this is only useful for dynamic-size vectors. For fixed-size vectors, + * it is redundant to pass the dimension here, so it makes more sense to use the default + * constructor Array() instead. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE explicit Array(Index dim); + /** constructs an initialized 1x1 Array with the given coefficient */ + Array(const Scalar& value); + /** constructs an uninitialized array with \a rows rows and \a cols columns. + * + * This is useful for dynamic-size arrays. For fixed-size arrays, + * it is redundant to pass these parameters, so one should use the default constructor + * Array() instead. */ + Array(Index rows, Index cols); + /** constructs an initialized 2D vector with given coefficients */ + Array(const Scalar& val0, const Scalar& val1); + #endif + + /** constructs an initialized 3D vector with given coefficients */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array(const Scalar& val0, const Scalar& val1, const Scalar& val2) + { + Base::_check_template_params(); + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(Array, 3) + m_storage.data()[0] = val0; + m_storage.data()[1] = val1; + m_storage.data()[2] = val2; + } + /** constructs an initialized 4D vector with given coefficients */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array(const Scalar& val0, const Scalar& val1, const Scalar& val2, const Scalar& val3) + { + Base::_check_template_params(); + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(Array, 4) + m_storage.data()[0] = val0; + m_storage.data()[1] = val1; + m_storage.data()[2] = val2; + m_storage.data()[3] = val3; + } + + /** Copy constructor */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array(const Array& other) + : Base(other) + { } + + private: + struct PrivateType {}; + public: + + /** \sa MatrixBase::operator=(const EigenBase&) */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Array(const EigenBase &other, + typename internal::enable_if::value, + PrivateType>::type = PrivateType()) + : Base(other.derived()) + { } + + EIGEN_DEVICE_FUNC inline Index innerStride() const { return 1; } + EIGEN_DEVICE_FUNC inline Index outerStride() const { return this->innerSize(); } + + #ifdef EIGEN_ARRAY_PLUGIN + #include EIGEN_ARRAY_PLUGIN + #endif + + private: + + template + friend struct internal::matrix_swap_impl; +}; + +/** \defgroup arraytypedefs Global array typedefs + * \ingroup Core_Module + * + * Eigen defines several typedef shortcuts for most common 1D and 2D array types. + * + * The general patterns are the following: + * + * \c ArrayRowsColsType where \c Rows and \c Cols can be \c 2,\c 3,\c 4 for fixed size square matrices or \c X for dynamic size, + * and where \c Type can be \c i for integer, \c f for float, \c d for double, \c cf for complex float, \c cd + * for complex double. + * + * For example, \c Array33d is a fixed-size 3x3 array type of doubles, and \c ArrayXXf is a dynamic-size matrix of floats. + * + * There are also \c ArraySizeType which are self-explanatory. For example, \c Array4cf is + * a fixed-size 1D array of 4 complex floats. + * + * \sa class Array + */ + +#define EIGEN_MAKE_ARRAY_TYPEDEFS(Type, TypeSuffix, Size, SizeSuffix) \ +/** \ingroup arraytypedefs */ \ +typedef Array Array##SizeSuffix##SizeSuffix##TypeSuffix; \ +/** \ingroup arraytypedefs */ \ +typedef Array Array##SizeSuffix##TypeSuffix; + +#define EIGEN_MAKE_ARRAY_FIXED_TYPEDEFS(Type, TypeSuffix, Size) \ +/** \ingroup arraytypedefs */ \ +typedef Array Array##Size##X##TypeSuffix; \ +/** \ingroup arraytypedefs */ \ +typedef Array Array##X##Size##TypeSuffix; + +#define EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(Type, TypeSuffix) \ +EIGEN_MAKE_ARRAY_TYPEDEFS(Type, TypeSuffix, 2, 2) \ +EIGEN_MAKE_ARRAY_TYPEDEFS(Type, TypeSuffix, 3, 3) \ +EIGEN_MAKE_ARRAY_TYPEDEFS(Type, TypeSuffix, 4, 4) \ +EIGEN_MAKE_ARRAY_TYPEDEFS(Type, TypeSuffix, Dynamic, X) \ +EIGEN_MAKE_ARRAY_FIXED_TYPEDEFS(Type, TypeSuffix, 2) \ +EIGEN_MAKE_ARRAY_FIXED_TYPEDEFS(Type, TypeSuffix, 3) \ +EIGEN_MAKE_ARRAY_FIXED_TYPEDEFS(Type, TypeSuffix, 4) + +EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(int, i) +EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(float, f) +EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(double, d) +EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(std::complex, cf) +EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES(std::complex, cd) + +#undef EIGEN_MAKE_ARRAY_TYPEDEFS_ALL_SIZES +#undef EIGEN_MAKE_ARRAY_TYPEDEFS + +#undef EIGEN_MAKE_ARRAY_TYPEDEFS_LARGE + +#define EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, SizeSuffix) \ +using Eigen::Matrix##SizeSuffix##TypeSuffix; \ +using Eigen::Vector##SizeSuffix##TypeSuffix; \ +using Eigen::RowVector##SizeSuffix##TypeSuffix; + +#define EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(TypeSuffix) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, 2) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, 3) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, 4) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE_AND_SIZE(TypeSuffix, X) \ + +#define EIGEN_USING_ARRAY_TYPEDEFS \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(i) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(f) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(d) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(cf) \ +EIGEN_USING_ARRAY_TYPEDEFS_FOR_TYPE(cd) + +} // end namespace Eigen + +#endif // EIGEN_ARRAY_H diff --git a/Eigen/src/Core/ArrayBase.h b/Eigen/src/Core/ArrayBase.h new file mode 100644 index 000000000..9da960f08 --- /dev/null +++ b/Eigen/src/Core/ArrayBase.h @@ -0,0 +1,226 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ARRAYBASE_H +#define EIGEN_ARRAYBASE_H + +namespace Eigen { + +template class MatrixWrapper; + +/** \class ArrayBase + * \ingroup Core_Module + * + * \brief Base class for all 1D and 2D array, and related expressions + * + * An array is similar to a dense vector or matrix. While matrices are mathematical + * objects with well defined linear algebra operators, an array is just a collection + * of scalar values arranged in a one or two dimensionnal fashion. As the main consequence, + * all operations applied to an array are performed coefficient wise. Furthermore, + * arrays support scalar math functions of the c++ standard library (e.g., std::sin(x)), and convenient + * constructors allowing to easily write generic code working for both scalar values + * and arrays. + * + * This class is the base that is inherited by all array expression types. + * + * \tparam Derived is the derived type, e.g., an array or an expression type. + * + * This class can be extended with the help of the plugin mechanism described on the page + * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_ARRAYBASE_PLUGIN. + * + * \sa class MatrixBase, \ref TopicClassHierarchy + */ +template class ArrayBase + : public DenseBase +{ + public: +#ifndef EIGEN_PARSED_BY_DOXYGEN + /** The base class for a given storage type. */ + typedef ArrayBase StorageBaseType; + + typedef ArrayBase Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl; + + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::packet_traits::type PacketScalar; + typedef typename NumTraits::Real RealScalar; + + typedef DenseBase Base; + using Base::RowsAtCompileTime; + using Base::ColsAtCompileTime; + using Base::SizeAtCompileTime; + using Base::MaxRowsAtCompileTime; + using Base::MaxColsAtCompileTime; + using Base::MaxSizeAtCompileTime; + using Base::IsVectorAtCompileTime; + using Base::Flags; + + using Base::derived; + using Base::const_cast_derived; + using Base::rows; + using Base::cols; + using Base::size; + using Base::coeff; + using Base::coeffRef; + using Base::lazyAssign; + using Base::operator-; + using Base::operator=; + using Base::operator+=; + using Base::operator-=; + using Base::operator*=; + using Base::operator/=; + + typedef typename Base::CoeffReturnType CoeffReturnType; + +#endif // not EIGEN_PARSED_BY_DOXYGEN + +#ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename Base::PlainObject PlainObject; + + /** \internal Represents a matrix with all coefficients equal to one another*/ + typedef CwiseNullaryOp,PlainObject> ConstantReturnType; +#endif // not EIGEN_PARSED_BY_DOXYGEN + +#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::ArrayBase +#define EIGEN_DOC_UNARY_ADDONS(X,Y) +# include "../plugins/MatrixCwiseUnaryOps.h" +# include "../plugins/ArrayCwiseUnaryOps.h" +# include "../plugins/CommonCwiseBinaryOps.h" +# include "../plugins/MatrixCwiseBinaryOps.h" +# include "../plugins/ArrayCwiseBinaryOps.h" +# ifdef EIGEN_ARRAYBASE_PLUGIN +# include EIGEN_ARRAYBASE_PLUGIN +# endif +#undef EIGEN_CURRENT_STORAGE_BASE_CLASS +#undef EIGEN_DOC_UNARY_ADDONS + + /** Special case of the template operator=, in order to prevent the compiler + * from generating a default operator= (issue hit with g++ 4.1) + */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator=(const ArrayBase& other) + { + internal::call_assignment(derived(), other.derived()); + return derived(); + } + + /** Set all the entries to \a value. + * \sa DenseBase::setConstant(), DenseBase::fill() */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator=(const Scalar &value) + { Base::setConstant(value); return derived(); } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator+=(const Scalar& scalar); + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator-=(const Scalar& scalar); + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator+=(const ArrayBase& other); + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator-=(const ArrayBase& other); + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator*=(const ArrayBase& other); + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator/=(const ArrayBase& other); + + public: + EIGEN_DEVICE_FUNC + ArrayBase& array() { return *this; } + EIGEN_DEVICE_FUNC + const ArrayBase& array() const { return *this; } + + /** \returns an \link Eigen::MatrixBase Matrix \endlink expression of this array + * \sa MatrixBase::array() */ + EIGEN_DEVICE_FUNC + MatrixWrapper matrix() { return MatrixWrapper(derived()); } + EIGEN_DEVICE_FUNC + const MatrixWrapper matrix() const { return MatrixWrapper(derived()); } + +// template +// inline void evalTo(Dest& dst) const { dst = matrix(); } + + protected: + EIGEN_DEVICE_FUNC + ArrayBase() : Base() {} + + private: + explicit ArrayBase(Index); + ArrayBase(Index,Index); + template explicit ArrayBase(const ArrayBase&); + protected: + // mixing arrays and matrices is not legal + template Derived& operator+=(const MatrixBase& ) + {EIGEN_STATIC_ASSERT(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1,YOU_CANNOT_MIX_ARRAYS_AND_MATRICES); return *this;} + // mixing arrays and matrices is not legal + template Derived& operator-=(const MatrixBase& ) + {EIGEN_STATIC_ASSERT(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1,YOU_CANNOT_MIX_ARRAYS_AND_MATRICES); return *this;} +}; + +/** replaces \c *this by \c *this - \a other. + * + * \returns a reference to \c *this + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived & +ArrayBase::operator-=(const ArrayBase &other) +{ + call_assignment(derived(), other.derived(), internal::sub_assign_op()); + return derived(); +} + +/** replaces \c *this by \c *this + \a other. + * + * \returns a reference to \c *this + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived & +ArrayBase::operator+=(const ArrayBase& other) +{ + call_assignment(derived(), other.derived(), internal::add_assign_op()); + return derived(); +} + +/** replaces \c *this by \c *this * \a other coefficient wise. + * + * \returns a reference to \c *this + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived & +ArrayBase::operator*=(const ArrayBase& other) +{ + call_assignment(derived(), other.derived(), internal::mul_assign_op()); + return derived(); +} + +/** replaces \c *this by \c *this / \a other coefficient wise. + * + * \returns a reference to \c *this + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived & +ArrayBase::operator/=(const ArrayBase& other) +{ + call_assignment(derived(), other.derived(), internal::div_assign_op()); + return derived(); +} + +} // end namespace Eigen + +#endif // EIGEN_ARRAYBASE_H diff --git a/Eigen/src/Core/ArrayWrapper.h b/Eigen/src/Core/ArrayWrapper.h new file mode 100644 index 000000000..688aadd62 --- /dev/null +++ b/Eigen/src/Core/ArrayWrapper.h @@ -0,0 +1,209 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ARRAYWRAPPER_H +#define EIGEN_ARRAYWRAPPER_H + +namespace Eigen { + +/** \class ArrayWrapper + * \ingroup Core_Module + * + * \brief Expression of a mathematical vector or matrix as an array object + * + * This class is the return type of MatrixBase::array(), and most of the time + * this is the only way it is use. + * + * \sa MatrixBase::array(), class MatrixWrapper + */ + +namespace internal { +template +struct traits > + : public traits::type > +{ + typedef ArrayXpr XprKind; + // Let's remove NestByRefBit + enum { + Flags0 = traits::type >::Flags, + LvalueBitFlag = is_lvalue::value ? LvalueBit : 0, + Flags = (Flags0 & ~(NestByRefBit | LvalueBit)) | LvalueBitFlag + }; +}; +} + +template +class ArrayWrapper : public ArrayBase > +{ + public: + typedef ArrayBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(ArrayWrapper) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(ArrayWrapper) + typedef typename internal::remove_all::type NestedExpression; + + typedef typename internal::conditional< + internal::is_lvalue::value, + Scalar, + const Scalar + >::type ScalarWithConstIfNotLvalue; + + typedef typename internal::ref_selector::non_const_type NestedExpressionType; + + using Base::coeffRef; + + EIGEN_DEVICE_FUNC + explicit EIGEN_STRONG_INLINE ArrayWrapper(ExpressionType& matrix) : m_expression(matrix) {} + + EIGEN_DEVICE_FUNC + inline Index rows() const { return m_expression.rows(); } + EIGEN_DEVICE_FUNC + inline Index cols() const { return m_expression.cols(); } + EIGEN_DEVICE_FUNC + inline Index outerStride() const { return m_expression.outerStride(); } + EIGEN_DEVICE_FUNC + inline Index innerStride() const { return m_expression.innerStride(); } + + EIGEN_DEVICE_FUNC + inline ScalarWithConstIfNotLvalue* data() { return m_expression.data(); } + EIGEN_DEVICE_FUNC + inline const Scalar* data() const { return m_expression.data(); } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index rowId, Index colId) const + { + return m_expression.coeffRef(rowId, colId); + } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index index) const + { + return m_expression.coeffRef(index); + } + + template + EIGEN_DEVICE_FUNC + inline void evalTo(Dest& dst) const { dst = m_expression; } + + const typename internal::remove_all::type& + EIGEN_DEVICE_FUNC + nestedExpression() const + { + return m_expression; + } + + /** Forwards the resizing request to the nested expression + * \sa DenseBase::resize(Index) */ + EIGEN_DEVICE_FUNC + void resize(Index newSize) { m_expression.resize(newSize); } + /** Forwards the resizing request to the nested expression + * \sa DenseBase::resize(Index,Index)*/ + EIGEN_DEVICE_FUNC + void resize(Index rows, Index cols) { m_expression.resize(rows,cols); } + + protected: + NestedExpressionType m_expression; +}; + +/** \class MatrixWrapper + * \ingroup Core_Module + * + * \brief Expression of an array as a mathematical vector or matrix + * + * This class is the return type of ArrayBase::matrix(), and most of the time + * this is the only way it is use. + * + * \sa MatrixBase::matrix(), class ArrayWrapper + */ + +namespace internal { +template +struct traits > + : public traits::type > +{ + typedef MatrixXpr XprKind; + // Let's remove NestByRefBit + enum { + Flags0 = traits::type >::Flags, + LvalueBitFlag = is_lvalue::value ? LvalueBit : 0, + Flags = (Flags0 & ~(NestByRefBit | LvalueBit)) | LvalueBitFlag + }; +}; +} + +template +class MatrixWrapper : public MatrixBase > +{ + public: + typedef MatrixBase > Base; + EIGEN_DENSE_PUBLIC_INTERFACE(MatrixWrapper) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(MatrixWrapper) + typedef typename internal::remove_all::type NestedExpression; + + typedef typename internal::conditional< + internal::is_lvalue::value, + Scalar, + const Scalar + >::type ScalarWithConstIfNotLvalue; + + typedef typename internal::ref_selector::non_const_type NestedExpressionType; + + using Base::coeffRef; + + EIGEN_DEVICE_FUNC + explicit inline MatrixWrapper(ExpressionType& matrix) : m_expression(matrix) {} + + EIGEN_DEVICE_FUNC + inline Index rows() const { return m_expression.rows(); } + EIGEN_DEVICE_FUNC + inline Index cols() const { return m_expression.cols(); } + EIGEN_DEVICE_FUNC + inline Index outerStride() const { return m_expression.outerStride(); } + EIGEN_DEVICE_FUNC + inline Index innerStride() const { return m_expression.innerStride(); } + + EIGEN_DEVICE_FUNC + inline ScalarWithConstIfNotLvalue* data() { return m_expression.data(); } + EIGEN_DEVICE_FUNC + inline const Scalar* data() const { return m_expression.data(); } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index rowId, Index colId) const + { + return m_expression.derived().coeffRef(rowId, colId); + } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index index) const + { + return m_expression.coeffRef(index); + } + + EIGEN_DEVICE_FUNC + const typename internal::remove_all::type& + nestedExpression() const + { + return m_expression; + } + + /** Forwards the resizing request to the nested expression + * \sa DenseBase::resize(Index) */ + EIGEN_DEVICE_FUNC + void resize(Index newSize) { m_expression.resize(newSize); } + /** Forwards the resizing request to the nested expression + * \sa DenseBase::resize(Index,Index)*/ + EIGEN_DEVICE_FUNC + void resize(Index rows, Index cols) { m_expression.resize(rows,cols); } + + protected: + NestedExpressionType m_expression; +}; + +} // end namespace Eigen + +#endif // EIGEN_ARRAYWRAPPER_H diff --git a/Eigen/src/Core/Assign.h b/Eigen/src/Core/Assign.h new file mode 100644 index 000000000..655412efd --- /dev/null +++ b/Eigen/src/Core/Assign.h @@ -0,0 +1,90 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2007 Michael Olbrich +// Copyright (C) 2006-2010 Benoit Jacob +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ASSIGN_H +#define EIGEN_ASSIGN_H + +namespace Eigen { + +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase + ::lazyAssign(const DenseBase& other) +{ + enum{ + SameType = internal::is_same::value + }; + + EIGEN_STATIC_ASSERT_LVALUE(Derived) + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(Derived,OtherDerived) + EIGEN_STATIC_ASSERT(SameType,YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) + + eigen_assert(rows() == other.rows() && cols() == other.cols()); + internal::call_assignment_no_alias(derived(),other.derived()); + + return derived(); +} + +template +template +EIGEN_DEVICE_FUNC +EIGEN_STRONG_INLINE Derived& DenseBase::operator=(const DenseBase& other) +{ + internal::call_assignment(derived(), other.derived()); + return derived(); +} + +template +EIGEN_DEVICE_FUNC +EIGEN_STRONG_INLINE Derived& DenseBase::operator=(const DenseBase& other) +{ + internal::call_assignment(derived(), other.derived()); + return derived(); +} + +template +EIGEN_DEVICE_FUNC +EIGEN_STRONG_INLINE Derived& MatrixBase::operator=(const MatrixBase& other) +{ + internal::call_assignment(derived(), other.derived()); + return derived(); +} + +template +template +EIGEN_DEVICE_FUNC +EIGEN_STRONG_INLINE Derived& MatrixBase::operator=(const DenseBase& other) +{ + internal::call_assignment(derived(), other.derived()); + return derived(); +} + +template +template +EIGEN_DEVICE_FUNC +EIGEN_STRONG_INLINE Derived& MatrixBase::operator=(const EigenBase& other) +{ + internal::call_assignment(derived(), other.derived()); + return derived(); +} + +template +template +EIGEN_DEVICE_FUNC +EIGEN_STRONG_INLINE Derived& MatrixBase::operator=(const ReturnByValue& other) +{ + other.derived().evalTo(derived()); + return derived(); +} + +} // end namespace Eigen + +#endif // EIGEN_ASSIGN_H diff --git a/Eigen/src/Core/AssignEvaluator.h b/Eigen/src/Core/AssignEvaluator.h new file mode 100644 index 000000000..ebf5590de --- /dev/null +++ b/Eigen/src/Core/AssignEvaluator.h @@ -0,0 +1,935 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2011 Benoit Jacob +// Copyright (C) 2011-2014 Gael Guennebaud +// Copyright (C) 2011-2012 Jitse Niesen +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ASSIGN_EVALUATOR_H +#define EIGEN_ASSIGN_EVALUATOR_H + +namespace Eigen { + +// This implementation is based on Assign.h + +namespace internal { + +/*************************************************************************** +* Part 1 : the logic deciding a strategy for traversal and unrolling * +***************************************************************************/ + +// copy_using_evaluator_traits is based on assign_traits + +template +struct copy_using_evaluator_traits +{ + typedef typename DstEvaluator::XprType Dst; + typedef typename Dst::Scalar DstScalar; + + enum { + DstFlags = DstEvaluator::Flags, + SrcFlags = SrcEvaluator::Flags + }; + +public: + enum { + DstAlignment = DstEvaluator::Alignment, + SrcAlignment = SrcEvaluator::Alignment, + DstHasDirectAccess = (DstFlags & DirectAccessBit) == DirectAccessBit, + JointAlignment = EIGEN_PLAIN_ENUM_MIN(DstAlignment,SrcAlignment) + }; + +private: + enum { + InnerSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::SizeAtCompileTime) + : int(DstFlags)&RowMajorBit ? int(Dst::ColsAtCompileTime) + : int(Dst::RowsAtCompileTime), + InnerMaxSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::MaxSizeAtCompileTime) + : int(DstFlags)&RowMajorBit ? int(Dst::MaxColsAtCompileTime) + : int(Dst::MaxRowsAtCompileTime), + OuterStride = int(outer_stride_at_compile_time::ret), + MaxSizeAtCompileTime = Dst::SizeAtCompileTime + }; + + // TODO distinguish between linear traversal and inner-traversals + typedef typename find_best_packet::type LinearPacketType; + typedef typename find_best_packet::type InnerPacketType; + + enum { + LinearPacketSize = unpacket_traits::size, + InnerPacketSize = unpacket_traits::size + }; + +public: + enum { + LinearRequiredAlignment = unpacket_traits::alignment, + InnerRequiredAlignment = unpacket_traits::alignment + }; + +private: + enum { + DstIsRowMajor = DstFlags&RowMajorBit, + SrcIsRowMajor = SrcFlags&RowMajorBit, + StorageOrdersAgree = (int(DstIsRowMajor) == int(SrcIsRowMajor)), + MightVectorize = bool(StorageOrdersAgree) + && (int(DstFlags) & int(SrcFlags) & ActualPacketAccessBit) + && bool(functor_traits::PacketAccess), + MayInnerVectorize = MightVectorize + && int(InnerSize)!=Dynamic && int(InnerSize)%int(InnerPacketSize)==0 + && int(OuterStride)!=Dynamic && int(OuterStride)%int(InnerPacketSize)==0 + && (EIGEN_UNALIGNED_VECTORIZE || int(JointAlignment)>=int(InnerRequiredAlignment)), + MayLinearize = bool(StorageOrdersAgree) && (int(DstFlags) & int(SrcFlags) & LinearAccessBit), + MayLinearVectorize = bool(MightVectorize) && bool(MayLinearize) && bool(DstHasDirectAccess) + && (EIGEN_UNALIGNED_VECTORIZE || (int(DstAlignment)>=int(LinearRequiredAlignment)) || MaxSizeAtCompileTime == Dynamic), + /* If the destination isn't aligned, we have to do runtime checks and we don't unroll, + so it's only good for large enough sizes. */ + MaySliceVectorize = bool(MightVectorize) && bool(DstHasDirectAccess) + && (int(InnerMaxSize)==Dynamic || int(InnerMaxSize)>=(EIGEN_UNALIGNED_VECTORIZE?InnerPacketSize:(3*InnerPacketSize))) + /* slice vectorization can be slow, so we only want it if the slices are big, which is + indicated by InnerMaxSize rather than InnerSize, think of the case of a dynamic block + in a fixed-size matrix + However, with EIGEN_UNALIGNED_VECTORIZE and unrolling, slice vectorization is still worth it */ + }; + +public: + enum { + Traversal = (int(MayLinearVectorize) && (LinearPacketSize>InnerPacketSize)) ? int(LinearVectorizedTraversal) + : int(MayInnerVectorize) ? int(InnerVectorizedTraversal) + : int(MayLinearVectorize) ? int(LinearVectorizedTraversal) + : int(MaySliceVectorize) ? int(SliceVectorizedTraversal) + : int(MayLinearize) ? int(LinearTraversal) + : int(DefaultTraversal), + Vectorized = int(Traversal) == InnerVectorizedTraversal + || int(Traversal) == LinearVectorizedTraversal + || int(Traversal) == SliceVectorizedTraversal + }; + + typedef typename conditional::type PacketType; + +private: + enum { + ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize + : Vectorized ? InnerPacketSize + : 1, + UnrollingLimit = EIGEN_UNROLLING_LIMIT * ActualPacketSize, + MayUnrollCompletely = int(Dst::SizeAtCompileTime) != Dynamic + && int(Dst::SizeAtCompileTime) * (int(DstEvaluator::CoeffReadCost)+int(SrcEvaluator::CoeffReadCost)) <= int(UnrollingLimit), + MayUnrollInner = int(InnerSize) != Dynamic + && int(InnerSize) * (int(DstEvaluator::CoeffReadCost)+int(SrcEvaluator::CoeffReadCost)) <= int(UnrollingLimit) + }; + +public: + enum { + Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTraversal)) + ? ( + int(MayUnrollCompletely) ? int(CompleteUnrolling) + : int(MayUnrollInner) ? int(InnerUnrolling) + : int(NoUnrolling) + ) + : int(Traversal) == int(LinearVectorizedTraversal) + ? ( bool(MayUnrollCompletely) && ( EIGEN_UNALIGNED_VECTORIZE || (int(DstAlignment)>=int(LinearRequiredAlignment))) + ? int(CompleteUnrolling) + : int(NoUnrolling) ) + : int(Traversal) == int(LinearTraversal) + ? ( bool(MayUnrollCompletely) ? int(CompleteUnrolling) + : int(NoUnrolling) ) +#if EIGEN_UNALIGNED_VECTORIZE + : int(Traversal) == int(SliceVectorizedTraversal) + ? ( bool(MayUnrollInner) ? int(InnerUnrolling) + : int(NoUnrolling) ) +#endif + : int(NoUnrolling) + }; + +#ifdef EIGEN_DEBUG_ASSIGN + static void debug() + { + std::cerr << "DstXpr: " << typeid(typename DstEvaluator::XprType).name() << std::endl; + std::cerr << "SrcXpr: " << typeid(typename SrcEvaluator::XprType).name() << std::endl; + std::cerr.setf(std::ios::hex, std::ios::basefield); + std::cerr << "DstFlags" << " = " << DstFlags << " (" << demangle_flags(DstFlags) << " )" << std::endl; + std::cerr << "SrcFlags" << " = " << SrcFlags << " (" << demangle_flags(SrcFlags) << " )" << std::endl; + std::cerr.unsetf(std::ios::hex); + EIGEN_DEBUG_VAR(DstAlignment) + EIGEN_DEBUG_VAR(SrcAlignment) + EIGEN_DEBUG_VAR(LinearRequiredAlignment) + EIGEN_DEBUG_VAR(InnerRequiredAlignment) + EIGEN_DEBUG_VAR(JointAlignment) + EIGEN_DEBUG_VAR(InnerSize) + EIGEN_DEBUG_VAR(InnerMaxSize) + EIGEN_DEBUG_VAR(LinearPacketSize) + EIGEN_DEBUG_VAR(InnerPacketSize) + EIGEN_DEBUG_VAR(ActualPacketSize) + EIGEN_DEBUG_VAR(StorageOrdersAgree) + EIGEN_DEBUG_VAR(MightVectorize) + EIGEN_DEBUG_VAR(MayLinearize) + EIGEN_DEBUG_VAR(MayInnerVectorize) + EIGEN_DEBUG_VAR(MayLinearVectorize) + EIGEN_DEBUG_VAR(MaySliceVectorize) + std::cerr << "Traversal" << " = " << Traversal << " (" << demangle_traversal(Traversal) << ")" << std::endl; + EIGEN_DEBUG_VAR(SrcEvaluator::CoeffReadCost) + EIGEN_DEBUG_VAR(UnrollingLimit) + EIGEN_DEBUG_VAR(MayUnrollCompletely) + EIGEN_DEBUG_VAR(MayUnrollInner) + std::cerr << "Unrolling" << " = " << Unrolling << " (" << demangle_unrolling(Unrolling) << ")" << std::endl; + std::cerr << std::endl; + } +#endif +}; + +/*************************************************************************** +* Part 2 : meta-unrollers +***************************************************************************/ + +/************************ +*** Default traversal *** +************************/ + +template +struct copy_using_evaluator_DefaultTraversal_CompleteUnrolling +{ + // FIXME: this is not very clean, perhaps this information should be provided by the kernel? + typedef typename Kernel::DstEvaluatorType DstEvaluatorType; + typedef typename DstEvaluatorType::XprType DstXprType; + + enum { + outer = Index / DstXprType::InnerSizeAtCompileTime, + inner = Index % DstXprType::InnerSizeAtCompileTime + }; + + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + kernel.assignCoeffByOuterInner(outer, inner); + copy_using_evaluator_DefaultTraversal_CompleteUnrolling::run(kernel); + } +}; + +template +struct copy_using_evaluator_DefaultTraversal_CompleteUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel&) { } +}; + +template +struct copy_using_evaluator_DefaultTraversal_InnerUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel, Index outer) + { + kernel.assignCoeffByOuterInner(outer, Index_); + copy_using_evaluator_DefaultTraversal_InnerUnrolling::run(kernel, outer); + } +}; + +template +struct copy_using_evaluator_DefaultTraversal_InnerUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel&, Index) { } +}; + +/*********************** +*** Linear traversal *** +***********************/ + +template +struct copy_using_evaluator_LinearTraversal_CompleteUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel& kernel) + { + kernel.assignCoeff(Index); + copy_using_evaluator_LinearTraversal_CompleteUnrolling::run(kernel); + } +}; + +template +struct copy_using_evaluator_LinearTraversal_CompleteUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel&) { } +}; + +/************************** +*** Inner vectorization *** +**************************/ + +template +struct copy_using_evaluator_innervec_CompleteUnrolling +{ + // FIXME: this is not very clean, perhaps this information should be provided by the kernel? + typedef typename Kernel::DstEvaluatorType DstEvaluatorType; + typedef typename DstEvaluatorType::XprType DstXprType; + typedef typename Kernel::PacketType PacketType; + + enum { + outer = Index / DstXprType::InnerSizeAtCompileTime, + inner = Index % DstXprType::InnerSizeAtCompileTime, + SrcAlignment = Kernel::AssignmentTraits::SrcAlignment, + DstAlignment = Kernel::AssignmentTraits::DstAlignment + }; + + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + kernel.template assignPacketByOuterInner(outer, inner); + enum { NextIndex = Index + unpacket_traits::size }; + copy_using_evaluator_innervec_CompleteUnrolling::run(kernel); + } +}; + +template +struct copy_using_evaluator_innervec_CompleteUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel&) { } +}; + +template +struct copy_using_evaluator_innervec_InnerUnrolling +{ + typedef typename Kernel::PacketType PacketType; + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel, Index outer) + { + kernel.template assignPacketByOuterInner(outer, Index_); + enum { NextIndex = Index_ + unpacket_traits::size }; + copy_using_evaluator_innervec_InnerUnrolling::run(kernel, outer); + } +}; + +template +struct copy_using_evaluator_innervec_InnerUnrolling +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &, Index) { } +}; + +/*************************************************************************** +* Part 3 : implementation of all cases +***************************************************************************/ + +// dense_assignment_loop is based on assign_impl + +template +struct dense_assignment_loop; + +/************************ +*** Default traversal *** +************************/ + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static void EIGEN_STRONG_INLINE run(Kernel &kernel) + { + for(Index outer = 0; outer < kernel.outerSize(); ++outer) { + for(Index inner = 0; inner < kernel.innerSize(); ++inner) { + kernel.assignCoeffByOuterInner(outer, inner); + } + } + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + copy_using_evaluator_DefaultTraversal_CompleteUnrolling::run(kernel); + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + + const Index outerSize = kernel.outerSize(); + for(Index outer = 0; outer < outerSize; ++outer) + copy_using_evaluator_DefaultTraversal_InnerUnrolling::run(kernel, outer); + } +}; + +/*************************** +*** Linear vectorization *** +***************************/ + + +// The goal of unaligned_dense_assignment_loop is simply to factorize the handling +// of the non vectorizable beginning and ending parts + +template +struct unaligned_dense_assignment_loop +{ + // if IsAligned = true, then do nothing + template + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel&, Index, Index) {} +}; + +template <> +struct unaligned_dense_assignment_loop +{ + // MSVC must not inline this functions. If it does, it fails to optimize the + // packet access path. + // FIXME check which version exhibits this issue +#if EIGEN_COMP_MSVC + template + static EIGEN_DONT_INLINE void run(Kernel &kernel, + Index start, + Index end) +#else + template + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel, + Index start, + Index end) +#endif + { + for (Index index = start; index < end; ++index) + kernel.assignCoeff(index); + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + const Index size = kernel.size(); + typedef typename Kernel::Scalar Scalar; + typedef typename Kernel::PacketType PacketType; + enum { + requestedAlignment = Kernel::AssignmentTraits::LinearRequiredAlignment, + packetSize = unpacket_traits::size, + dstIsAligned = int(Kernel::AssignmentTraits::DstAlignment)>=int(requestedAlignment), + dstAlignment = packet_traits::AlignedOnScalar ? int(requestedAlignment) + : int(Kernel::AssignmentTraits::DstAlignment), + srcAlignment = Kernel::AssignmentTraits::JointAlignment + }; + const Index alignedStart = dstIsAligned ? 0 : internal::first_aligned(kernel.dstDataPtr(), size); + const Index alignedEnd = alignedStart + ((size-alignedStart)/packetSize)*packetSize; + + unaligned_dense_assignment_loop::run(kernel, 0, alignedStart); + + for(Index index = alignedStart; index < alignedEnd; index += packetSize) + kernel.template assignPacket(index); + + unaligned_dense_assignment_loop<>::run(kernel, alignedEnd, size); + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + typedef typename Kernel::PacketType PacketType; + + enum { size = DstXprType::SizeAtCompileTime, + packetSize =unpacket_traits::size, + alignedSize = (size/packetSize)*packetSize }; + + copy_using_evaluator_innervec_CompleteUnrolling::run(kernel); + copy_using_evaluator_DefaultTraversal_CompleteUnrolling::run(kernel); + } +}; + +/************************** +*** Inner vectorization *** +**************************/ + +template +struct dense_assignment_loop +{ + typedef typename Kernel::PacketType PacketType; + enum { + SrcAlignment = Kernel::AssignmentTraits::SrcAlignment, + DstAlignment = Kernel::AssignmentTraits::DstAlignment + }; + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + const Index innerSize = kernel.innerSize(); + const Index outerSize = kernel.outerSize(); + const Index packetSize = unpacket_traits::size; + for(Index outer = 0; outer < outerSize; ++outer) + for(Index inner = 0; inner < innerSize; inner+=packetSize) + kernel.template assignPacketByOuterInner(outer, inner); + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + copy_using_evaluator_innervec_CompleteUnrolling::run(kernel); + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + typedef typename Kernel::AssignmentTraits Traits; + const Index outerSize = kernel.outerSize(); + for(Index outer = 0; outer < outerSize; ++outer) + copy_using_evaluator_innervec_InnerUnrolling::run(kernel, outer); + } +}; + +/*********************** +*** Linear traversal *** +***********************/ + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + const Index size = kernel.size(); + for(Index i = 0; i < size; ++i) + kernel.assignCoeff(i); + } +}; + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + copy_using_evaluator_LinearTraversal_CompleteUnrolling::run(kernel); + } +}; + +/************************** +*** Slice vectorization *** +***************************/ + +template +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::Scalar Scalar; + typedef typename Kernel::PacketType PacketType; + enum { + packetSize = unpacket_traits::size, + requestedAlignment = int(Kernel::AssignmentTraits::InnerRequiredAlignment), + alignable = packet_traits::AlignedOnScalar || int(Kernel::AssignmentTraits::DstAlignment)>=sizeof(Scalar), + dstIsAligned = int(Kernel::AssignmentTraits::DstAlignment)>=int(requestedAlignment), + dstAlignment = alignable ? int(requestedAlignment) + : int(Kernel::AssignmentTraits::DstAlignment) + }; + const Scalar *dst_ptr = kernel.dstDataPtr(); + if((!bool(dstIsAligned)) && (UIntPtr(dst_ptr) % sizeof(Scalar))>0) + { + // the pointer is not aligend-on scalar, so alignment is not possible + return dense_assignment_loop::run(kernel); + } + const Index packetAlignedMask = packetSize - 1; + const Index innerSize = kernel.innerSize(); + const Index outerSize = kernel.outerSize(); + const Index alignedStep = alignable ? (packetSize - kernel.outerStride() % packetSize) & packetAlignedMask : 0; + Index alignedStart = ((!alignable) || bool(dstIsAligned)) ? 0 : internal::first_aligned(dst_ptr, innerSize); + + for(Index outer = 0; outer < outerSize; ++outer) + { + const Index alignedEnd = alignedStart + ((innerSize-alignedStart) & ~packetAlignedMask); + // do the non-vectorizable part of the assignment + for(Index inner = 0; inner(outer, inner); + + // do the non-vectorizable part of the assignment + for(Index inner = alignedEnd; inner +struct dense_assignment_loop +{ + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel) + { + typedef typename Kernel::DstEvaluatorType::XprType DstXprType; + typedef typename Kernel::PacketType PacketType; + + enum { size = DstXprType::InnerSizeAtCompileTime, + packetSize =unpacket_traits::size, + vectorizableSize = (size/packetSize)*packetSize }; + + for(Index outer = 0; outer < kernel.outerSize(); ++outer) + { + copy_using_evaluator_innervec_InnerUnrolling::run(kernel, outer); + copy_using_evaluator_DefaultTraversal_InnerUnrolling::run(kernel, outer); + } + } +}; +#endif + + +/*************************************************************************** +* Part 4 : Generic dense assignment kernel +***************************************************************************/ + +// This class generalize the assignment of a coefficient (or packet) from one dense evaluator +// to another dense writable evaluator. +// It is parametrized by the two evaluators, and the actual assignment functor. +// This abstraction level permits to keep the evaluation loops as simple and as generic as possible. +// One can customize the assignment using this generic dense_assignment_kernel with different +// functors, or by completely overloading it, by-passing a functor. +template +class generic_dense_assignment_kernel +{ +protected: + typedef typename DstEvaluatorTypeT::XprType DstXprType; + typedef typename SrcEvaluatorTypeT::XprType SrcXprType; +public: + + typedef DstEvaluatorTypeT DstEvaluatorType; + typedef SrcEvaluatorTypeT SrcEvaluatorType; + typedef typename DstEvaluatorType::Scalar Scalar; + typedef copy_using_evaluator_traits AssignmentTraits; + typedef typename AssignmentTraits::PacketType PacketType; + + + EIGEN_DEVICE_FUNC generic_dense_assignment_kernel(DstEvaluatorType &dst, const SrcEvaluatorType &src, const Functor &func, DstXprType& dstExpr) + : m_dst(dst), m_src(src), m_functor(func), m_dstExpr(dstExpr) + { + #ifdef EIGEN_DEBUG_ASSIGN + AssignmentTraits::debug(); + #endif + } + + EIGEN_DEVICE_FUNC Index size() const { return m_dstExpr.size(); } + EIGEN_DEVICE_FUNC Index innerSize() const { return m_dstExpr.innerSize(); } + EIGEN_DEVICE_FUNC Index outerSize() const { return m_dstExpr.outerSize(); } + EIGEN_DEVICE_FUNC Index rows() const { return m_dstExpr.rows(); } + EIGEN_DEVICE_FUNC Index cols() const { return m_dstExpr.cols(); } + EIGEN_DEVICE_FUNC Index outerStride() const { return m_dstExpr.outerStride(); } + + EIGEN_DEVICE_FUNC DstEvaluatorType& dstEvaluator() { return m_dst; } + EIGEN_DEVICE_FUNC const SrcEvaluatorType& srcEvaluator() const { return m_src; } + + /// Assign src(row,col) to dst(row,col) through the assignment functor. + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(Index row, Index col) + { + m_functor.assignCoeff(m_dst.coeffRef(row,col), m_src.coeff(row,col)); + } + + /// \sa assignCoeff(Index,Index) + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(Index index) + { + m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index)); + } + + /// \sa assignCoeff(Index,Index) + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeffByOuterInner(Index outer, Index inner) + { + Index row = rowIndexByOuterInner(outer, inner); + Index col = colIndexByOuterInner(outer, inner); + assignCoeff(row, col); + } + + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignPacket(Index row, Index col) + { + m_functor.template assignPacket(&m_dst.coeffRef(row,col), m_src.template packet(row,col)); + } + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignPacket(Index index) + { + m_functor.template assignPacket(&m_dst.coeffRef(index), m_src.template packet(index)); + } + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignPacketByOuterInner(Index outer, Index inner) + { + Index row = rowIndexByOuterInner(outer, inner); + Index col = colIndexByOuterInner(outer, inner); + assignPacket(row, col); + } + + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Index rowIndexByOuterInner(Index outer, Index inner) + { + typedef typename DstEvaluatorType::ExpressionTraits Traits; + return int(Traits::RowsAtCompileTime) == 1 ? 0 + : int(Traits::ColsAtCompileTime) == 1 ? inner + : int(DstEvaluatorType::Flags)&RowMajorBit ? outer + : inner; + } + + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Index colIndexByOuterInner(Index outer, Index inner) + { + typedef typename DstEvaluatorType::ExpressionTraits Traits; + return int(Traits::ColsAtCompileTime) == 1 ? 0 + : int(Traits::RowsAtCompileTime) == 1 ? inner + : int(DstEvaluatorType::Flags)&RowMajorBit ? inner + : outer; + } + + EIGEN_DEVICE_FUNC const Scalar* dstDataPtr() const + { + return m_dstExpr.data(); + } + +protected: + DstEvaluatorType& m_dst; + const SrcEvaluatorType& m_src; + const Functor &m_functor; + // TODO find a way to avoid the needs of the original expression + DstXprType& m_dstExpr; +}; + +/*************************************************************************** +* Part 5 : Entry point for dense rectangular assignment +***************************************************************************/ + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void resize_if_allowed(DstXprType &dst, const SrcXprType& src, const Functor &/*func*/) +{ + EIGEN_ONLY_USED_FOR_DEBUG(dst); + EIGEN_ONLY_USED_FOR_DEBUG(src); + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); +} + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void resize_if_allowed(DstXprType &dst, const SrcXprType& src, const internal::assign_op &/*func*/) +{ + Index dstRows = src.rows(); + Index dstCols = src.cols(); + if(((dst.rows()!=dstRows) || (dst.cols()!=dstCols))) + dst.resize(dstRows, dstCols); + eigen_assert(dst.rows() == dstRows && dst.cols() == dstCols); +} + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void call_dense_assignment_loop(DstXprType& dst, const SrcXprType& src, const Functor &func) +{ + typedef evaluator DstEvaluatorType; + typedef evaluator SrcEvaluatorType; + + SrcEvaluatorType srcEvaluator(src); + + // NOTE To properly handle A = (A*A.transpose())/s with A rectangular, + // we need to resize the destination after the source evaluator has been created. + resize_if_allowed(dst, src, func); + + DstEvaluatorType dstEvaluator(dst); + + typedef generic_dense_assignment_kernel Kernel; + Kernel kernel(dstEvaluator, srcEvaluator, func, dst.const_cast_derived()); + + dense_assignment_loop::run(kernel); +} + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void call_dense_assignment_loop(DstXprType& dst, const SrcXprType& src) +{ + call_dense_assignment_loop(dst, src, internal::assign_op()); +} + +/*************************************************************************** +* Part 6 : Generic assignment +***************************************************************************/ + +// Based on the respective shapes of the destination and source, +// the class AssignmentKind determine the kind of assignment mechanism. +// AssignmentKind must define a Kind typedef. +template struct AssignmentKind; + +// Assignement kind defined in this file: +struct Dense2Dense {}; +struct EigenBase2EigenBase {}; + +template struct AssignmentKind { typedef EigenBase2EigenBase Kind; }; +template<> struct AssignmentKind { typedef Dense2Dense Kind; }; + +// This is the main assignment class +template< typename DstXprType, typename SrcXprType, typename Functor, + typename Kind = typename AssignmentKind< typename evaluator_traits::Shape , typename evaluator_traits::Shape >::Kind, + typename EnableIf = void> +struct Assignment; + + +// The only purpose of this call_assignment() function is to deal with noalias() / "assume-aliasing" and automatic transposition. +// Indeed, I (Gael) think that this concept of "assume-aliasing" was a mistake, and it makes thing quite complicated. +// So this intermediate function removes everything related to "assume-aliasing" such that Assignment +// does not has to bother about these annoying details. + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment(Dst& dst, const Src& src) +{ + call_assignment(dst, src, internal::assign_op()); +} +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment(const Dst& dst, const Src& src) +{ + call_assignment(dst, src, internal::assign_op()); +} + +// Deal with "assume-aliasing" +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment(Dst& dst, const Src& src, const Func& func, typename enable_if< evaluator_assume_aliasing::value, void*>::type = 0) +{ + typename plain_matrix_type::type tmp(src); + call_assignment_no_alias(dst, tmp, func); +} + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment(Dst& dst, const Src& src, const Func& func, typename enable_if::value, void*>::type = 0) +{ + call_assignment_no_alias(dst, src, func); +} + +// by-pass "assume-aliasing" +// When there is no aliasing, we require that 'dst' has been properly resized +template class StorageBase, typename Src, typename Func> +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment(NoAlias& dst, const Src& src, const Func& func) +{ + call_assignment_no_alias(dst.expression(), src, func); +} + + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment_no_alias(Dst& dst, const Src& src, const Func& func) +{ + enum { + NeedToTranspose = ( (int(Dst::RowsAtCompileTime) == 1 && int(Src::ColsAtCompileTime) == 1) + || (int(Dst::ColsAtCompileTime) == 1 && int(Src::RowsAtCompileTime) == 1) + ) && int(Dst::SizeAtCompileTime) != 1 + }; + + typedef typename internal::conditional, Dst>::type ActualDstTypeCleaned; + typedef typename internal::conditional, Dst&>::type ActualDstType; + ActualDstType actualDst(dst); + + // TODO check whether this is the right place to perform these checks: + EIGEN_STATIC_ASSERT_LVALUE(Dst) + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(ActualDstTypeCleaned,Src) + EIGEN_CHECK_BINARY_COMPATIBILIY(Func,typename ActualDstTypeCleaned::Scalar,typename Src::Scalar); + + Assignment::run(actualDst, src, func); +} +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment_no_alias(Dst& dst, const Src& src) +{ + call_assignment_no_alias(dst, src, internal::assign_op()); +} + +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment_no_alias_no_transpose(Dst& dst, const Src& src, const Func& func) +{ + // TODO check whether this is the right place to perform these checks: + EIGEN_STATIC_ASSERT_LVALUE(Dst) + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(Dst,Src) + EIGEN_CHECK_BINARY_COMPATIBILIY(Func,typename Dst::Scalar,typename Src::Scalar); + + Assignment::run(dst, src, func); +} +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE +void call_assignment_no_alias_no_transpose(Dst& dst, const Src& src) +{ + call_assignment_no_alias_no_transpose(dst, src, internal::assign_op()); +} + +// forward declaration +template void check_for_aliasing(const Dst &dst, const Src &src); + +// Generic Dense to Dense assignment +// Note that the last template argument "Weak" is needed to make it possible to perform +// both partial specialization+SFINAE without ambiguous specialization +template< typename DstXprType, typename SrcXprType, typename Functor, typename Weak> +struct Assignment +{ + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE void run(DstXprType &dst, const SrcXprType &src, const Functor &func) + { +#ifndef EIGEN_NO_DEBUG + internal::check_for_aliasing(dst, src); +#endif + + call_dense_assignment_loop(dst, src, func); + } +}; + +// Generic assignment through evalTo. +// TODO: not sure we have to keep that one, but it helps porting current code to new evaluator mechanism. +// Note that the last template argument "Weak" is needed to make it possible to perform +// both partial specialization+SFINAE without ambiguous specialization +template< typename DstXprType, typename SrcXprType, typename Functor, typename Weak> +struct Assignment +{ + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &/*func*/) + { + Index dstRows = src.rows(); + Index dstCols = src.cols(); + if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) + dst.resize(dstRows, dstCols); + + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); + src.evalTo(dst); + } + + // NOTE The following two functions are templated to avoid their instanciation if not needed + // This is needed because some expressions supports evalTo only and/or have 'void' as scalar type. + template + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op &/*func*/) + { + Index dstRows = src.rows(); + Index dstCols = src.cols(); + if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) + dst.resize(dstRows, dstCols); + + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); + src.addTo(dst); + } + + template + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op &/*func*/) + { + Index dstRows = src.rows(); + Index dstCols = src.cols(); + if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) + dst.resize(dstRows, dstCols); + + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); + src.subTo(dst); + } +}; + +} // namespace internal + +} // end namespace Eigen + +#endif // EIGEN_ASSIGN_EVALUATOR_H diff --git a/Eigen/src/Core/Assign_MKL.h b/Eigen/src/Core/Assign_MKL.h new file mode 100755 index 000000000..6c2ab9264 --- /dev/null +++ b/Eigen/src/Core/Assign_MKL.h @@ -0,0 +1,176 @@ +/* + Copyright (c) 2011, Intel Corporation. All rights reserved. + Copyright (C) 2015 Gael Guennebaud + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + * Redistributions of source code must retain the above copyright notice, this + list of conditions and the following disclaimer. + * Redistributions in binary form must reproduce the above copyright notice, + this list of conditions and the following disclaimer in the documentation + and/or other materials provided with the distribution. + * Neither the name of Intel Corporation nor the names of its contributors may + be used to endorse or promote products derived from this software without + specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND + ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED + WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE + DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR + ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES + (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; + LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON + ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS + SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + + ******************************************************************************** + * Content : Eigen bindings to Intel(R) MKL + * MKL VML support for coefficient-wise unary Eigen expressions like a=b.sin() + ******************************************************************************** +*/ + +#ifndef EIGEN_ASSIGN_VML_H +#define EIGEN_ASSIGN_VML_H + +namespace Eigen { + +namespace internal { + +template +class vml_assign_traits +{ + private: + enum { + DstHasDirectAccess = Dst::Flags & DirectAccessBit, + SrcHasDirectAccess = Src::Flags & DirectAccessBit, + StorageOrdersAgree = (int(Dst::IsRowMajor) == int(Src::IsRowMajor)), + InnerSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::SizeAtCompileTime) + : int(Dst::Flags)&RowMajorBit ? int(Dst::ColsAtCompileTime) + : int(Dst::RowsAtCompileTime), + InnerMaxSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::MaxSizeAtCompileTime) + : int(Dst::Flags)&RowMajorBit ? int(Dst::MaxColsAtCompileTime) + : int(Dst::MaxRowsAtCompileTime), + MaxSizeAtCompileTime = Dst::SizeAtCompileTime, + + MightEnableVml = StorageOrdersAgree && DstHasDirectAccess && SrcHasDirectAccess && Src::InnerStrideAtCompileTime==1 && Dst::InnerStrideAtCompileTime==1, + MightLinearize = MightEnableVml && (int(Dst::Flags) & int(Src::Flags) & LinearAccessBit), + VmlSize = MightLinearize ? MaxSizeAtCompileTime : InnerMaxSize, + LargeEnough = VmlSize==Dynamic || VmlSize>=EIGEN_MKL_VML_THRESHOLD + }; + public: + enum { + EnableVml = MightEnableVml && LargeEnough, + Traversal = MightLinearize ? LinearTraversal : DefaultTraversal + }; +}; + +#define EIGEN_PP_EXPAND(ARG) ARG +#if !defined (EIGEN_FAST_MATH) || (EIGEN_FAST_MATH != 1) +#define EIGEN_VMLMODE_EXPAND_LA , VML_HA +#else +#define EIGEN_VMLMODE_EXPAND_LA , VML_LA +#endif + +#define EIGEN_VMLMODE_EXPAND__ + +#define EIGEN_VMLMODE_PREFIX_LA vm +#define EIGEN_VMLMODE_PREFIX__ v +#define EIGEN_VMLMODE_PREFIX(VMLMODE) EIGEN_CAT(EIGEN_VMLMODE_PREFIX_,VMLMODE) + +#define EIGEN_MKL_VML_DECLARE_UNARY_CALL(EIGENOP, VMLOP, EIGENTYPE, VMLTYPE, VMLMODE) \ + template< typename DstXprType, typename SrcXprNested> \ + struct Assignment, SrcXprNested>, assign_op, \ + Dense2Dense, typename enable_if::EnableVml>::type> { \ + typedef CwiseUnaryOp, SrcXprNested> SrcXprType; \ + static void run(DstXprType &dst, const SrcXprType &src, const assign_op &/*func*/) { \ + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); \ + if(vml_assign_traits::Traversal==LinearTraversal) { \ + VMLOP(dst.size(), (const VMLTYPE*)src.nestedExpression().data(), \ + (VMLTYPE*)dst.data() EIGEN_PP_EXPAND(EIGEN_VMLMODE_EXPAND_##VMLMODE) ); \ + } else { \ + const Index outerSize = dst.outerSize(); \ + for(Index outer = 0; outer < outerSize; ++outer) { \ + const EIGENTYPE *src_ptr = src.IsRowMajor ? &(src.nestedExpression().coeffRef(outer,0)) : \ + &(src.nestedExpression().coeffRef(0, outer)); \ + EIGENTYPE *dst_ptr = dst.IsRowMajor ? &(dst.coeffRef(outer,0)) : &(dst.coeffRef(0, outer)); \ + VMLOP( dst.innerSize(), (const VMLTYPE*)src_ptr, \ + (VMLTYPE*)dst_ptr EIGEN_PP_EXPAND(EIGEN_VMLMODE_EXPAND_##VMLMODE)); \ + } \ + } \ + } \ + }; \ + + +#define EIGEN_MKL_VML_DECLARE_UNARY_CALLS_REAL(EIGENOP, VMLOP, VMLMODE) \ + EIGEN_MKL_VML_DECLARE_UNARY_CALL(EIGENOP, EIGEN_CAT(EIGEN_VMLMODE_PREFIX(VMLMODE),s##VMLOP), float, float, VMLMODE) \ + EIGEN_MKL_VML_DECLARE_UNARY_CALL(EIGENOP, EIGEN_CAT(EIGEN_VMLMODE_PREFIX(VMLMODE),d##VMLOP), double, double, VMLMODE) + +#define EIGEN_MKL_VML_DECLARE_UNARY_CALLS_CPLX(EIGENOP, VMLOP, VMLMODE) \ + EIGEN_MKL_VML_DECLARE_UNARY_CALL(EIGENOP, EIGEN_CAT(EIGEN_VMLMODE_PREFIX(VMLMODE),c##VMLOP), scomplex, MKL_Complex8, VMLMODE) \ + EIGEN_MKL_VML_DECLARE_UNARY_CALL(EIGENOP, EIGEN_CAT(EIGEN_VMLMODE_PREFIX(VMLMODE),z##VMLOP), dcomplex, MKL_Complex16, VMLMODE) + +#define EIGEN_MKL_VML_DECLARE_UNARY_CALLS(EIGENOP, VMLOP, VMLMODE) \ + EIGEN_MKL_VML_DECLARE_UNARY_CALLS_REAL(EIGENOP, VMLOP, VMLMODE) \ + EIGEN_MKL_VML_DECLARE_UNARY_CALLS_CPLX(EIGENOP, VMLOP, VMLMODE) + + +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(sin, Sin, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(asin, Asin, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(sinh, Sinh, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(cos, Cos, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(acos, Acos, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(cosh, Cosh, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(tan, Tan, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(atan, Atan, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(tanh, Tanh, LA) +// EIGEN_MKL_VML_DECLARE_UNARY_CALLS(abs, Abs, _) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(exp, Exp, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(log, Ln, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(log10, Log10, LA) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS(sqrt, Sqrt, _) + +EIGEN_MKL_VML_DECLARE_UNARY_CALLS_REAL(square, Sqr, _) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS_CPLX(arg, Arg, _) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS_REAL(round, Round, _) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS_REAL(floor, Floor, _) +EIGEN_MKL_VML_DECLARE_UNARY_CALLS_REAL(ceil, Ceil, _) + +#define EIGEN_MKL_VML_DECLARE_POW_CALL(EIGENOP, VMLOP, EIGENTYPE, VMLTYPE, VMLMODE) \ + template< typename DstXprType, typename SrcXprNested, typename Plain> \ + struct Assignment, SrcXprNested, \ + const CwiseNullaryOp,Plain> >, assign_op, \ + Dense2Dense, typename enable_if::EnableVml>::type> { \ + typedef CwiseBinaryOp, SrcXprNested, \ + const CwiseNullaryOp,Plain> > SrcXprType; \ + static void run(DstXprType &dst, const SrcXprType &src, const assign_op &/*func*/) { \ + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); \ + VMLTYPE exponent = reinterpret_cast(src.rhs().functor().m_other); \ + if(vml_assign_traits::Traversal==LinearTraversal) \ + { \ + VMLOP( dst.size(), (const VMLTYPE*)src.lhs().data(), exponent, \ + (VMLTYPE*)dst.data() EIGEN_PP_EXPAND(EIGEN_VMLMODE_EXPAND_##VMLMODE) ); \ + } else { \ + const Index outerSize = dst.outerSize(); \ + for(Index outer = 0; outer < outerSize; ++outer) { \ + const EIGENTYPE *src_ptr = src.IsRowMajor ? &(src.lhs().coeffRef(outer,0)) : \ + &(src.lhs().coeffRef(0, outer)); \ + EIGENTYPE *dst_ptr = dst.IsRowMajor ? &(dst.coeffRef(outer,0)) : &(dst.coeffRef(0, outer)); \ + VMLOP( dst.innerSize(), (const VMLTYPE*)src_ptr, exponent, \ + (VMLTYPE*)dst_ptr EIGEN_PP_EXPAND(EIGEN_VMLMODE_EXPAND_##VMLMODE)); \ + } \ + } \ + } \ + }; + +EIGEN_MKL_VML_DECLARE_POW_CALL(pow, vmsPowx, float, float, LA) +EIGEN_MKL_VML_DECLARE_POW_CALL(pow, vmdPowx, double, double, LA) +EIGEN_MKL_VML_DECLARE_POW_CALL(pow, vmcPowx, scomplex, MKL_Complex8, LA) +EIGEN_MKL_VML_DECLARE_POW_CALL(pow, vmzPowx, dcomplex, MKL_Complex16, LA) + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_ASSIGN_VML_H diff --git a/Eigen/src/Core/BandMatrix.h b/Eigen/src/Core/BandMatrix.h new file mode 100644 index 000000000..4978c9140 --- /dev/null +++ b/Eigen/src/Core/BandMatrix.h @@ -0,0 +1,353 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_BANDMATRIX_H +#define EIGEN_BANDMATRIX_H + +namespace Eigen { + +namespace internal { + +template +class BandMatrixBase : public EigenBase +{ + public: + + enum { + Flags = internal::traits::Flags, + CoeffReadCost = internal::traits::CoeffReadCost, + RowsAtCompileTime = internal::traits::RowsAtCompileTime, + ColsAtCompileTime = internal::traits::ColsAtCompileTime, + MaxRowsAtCompileTime = internal::traits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = internal::traits::MaxColsAtCompileTime, + Supers = internal::traits::Supers, + Subs = internal::traits::Subs, + Options = internal::traits::Options + }; + typedef typename internal::traits::Scalar Scalar; + typedef Matrix DenseMatrixType; + typedef typename DenseMatrixType::StorageIndex StorageIndex; + typedef typename internal::traits::CoefficientsType CoefficientsType; + typedef EigenBase Base; + + protected: + enum { + DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) + ? 1 + Supers + Subs + : Dynamic, + SizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime,ColsAtCompileTime) + }; + + public: + + using Base::derived; + using Base::rows; + using Base::cols; + + /** \returns the number of super diagonals */ + inline Index supers() const { return derived().supers(); } + + /** \returns the number of sub diagonals */ + inline Index subs() const { return derived().subs(); } + + /** \returns an expression of the underlying coefficient matrix */ + inline const CoefficientsType& coeffs() const { return derived().coeffs(); } + + /** \returns an expression of the underlying coefficient matrix */ + inline CoefficientsType& coeffs() { return derived().coeffs(); } + + /** \returns a vector expression of the \a i -th column, + * only the meaningful part is returned. + * \warning the internal storage must be column major. */ + inline Block col(Index i) + { + EIGEN_STATIC_ASSERT((Options&RowMajor)==0,THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); + Index start = 0; + Index len = coeffs().rows(); + if (i<=supers()) + { + start = supers()-i; + len = (std::min)(rows(),std::max(0,coeffs().rows() - (supers()-i))); + } + else if (i>=rows()-subs()) + len = std::max(0,coeffs().rows() - (i + 1 - rows() + subs())); + return Block(coeffs(), start, i, len, 1); + } + + /** \returns a vector expression of the main diagonal */ + inline Block diagonal() + { return Block(coeffs(),supers(),0,1,(std::min)(rows(),cols())); } + + /** \returns a vector expression of the main diagonal (const version) */ + inline const Block diagonal() const + { return Block(coeffs(),supers(),0,1,(std::min)(rows(),cols())); } + + template struct DiagonalIntReturnType { + enum { + ReturnOpposite = (Options&SelfAdjoint) && (((Index)>0 && Supers==0) || ((Index)<0 && Subs==0)), + Conjugate = ReturnOpposite && NumTraits::IsComplex, + ActualIndex = ReturnOpposite ? -Index : Index, + DiagonalSize = (RowsAtCompileTime==Dynamic || ColsAtCompileTime==Dynamic) + ? Dynamic + : (ActualIndex<0 + ? EIGEN_SIZE_MIN_PREFER_DYNAMIC(ColsAtCompileTime, RowsAtCompileTime + ActualIndex) + : EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime, ColsAtCompileTime - ActualIndex)) + }; + typedef Block BuildType; + typedef typename internal::conditional,BuildType >, + BuildType>::type Type; + }; + + /** \returns a vector expression of the \a N -th sub or super diagonal */ + template inline typename DiagonalIntReturnType::Type diagonal() + { + return typename DiagonalIntReturnType::BuildType(coeffs(), supers()-N, (std::max)(0,N), 1, diagonalLength(N)); + } + + /** \returns a vector expression of the \a N -th sub or super diagonal */ + template inline const typename DiagonalIntReturnType::Type diagonal() const + { + return typename DiagonalIntReturnType::BuildType(coeffs(), supers()-N, (std::max)(0,N), 1, diagonalLength(N)); + } + + /** \returns a vector expression of the \a i -th sub or super diagonal */ + inline Block diagonal(Index i) + { + eigen_assert((i<0 && -i<=subs()) || (i>=0 && i<=supers())); + return Block(coeffs(), supers()-i, std::max(0,i), 1, diagonalLength(i)); + } + + /** \returns a vector expression of the \a i -th sub or super diagonal */ + inline const Block diagonal(Index i) const + { + eigen_assert((i<0 && -i<=subs()) || (i>=0 && i<=supers())); + return Block(coeffs(), supers()-i, std::max(0,i), 1, diagonalLength(i)); + } + + template inline void evalTo(Dest& dst) const + { + dst.resize(rows(),cols()); + dst.setZero(); + dst.diagonal() = diagonal(); + for (Index i=1; i<=supers();++i) + dst.diagonal(i) = diagonal(i); + for (Index i=1; i<=subs();++i) + dst.diagonal(-i) = diagonal(-i); + } + + DenseMatrixType toDenseMatrix() const + { + DenseMatrixType res(rows(),cols()); + evalTo(res); + return res; + } + + protected: + + inline Index diagonalLength(Index i) const + { return i<0 ? (std::min)(cols(),rows()+i) : (std::min)(rows(),cols()-i); } +}; + +/** + * \class BandMatrix + * \ingroup Core_Module + * + * \brief Represents a rectangular matrix with a banded storage + * + * \tparam _Scalar Numeric type, i.e. float, double, int + * \tparam _Rows Number of rows, or \b Dynamic + * \tparam _Cols Number of columns, or \b Dynamic + * \tparam _Supers Number of super diagonal + * \tparam _Subs Number of sub diagonal + * \tparam _Options A combination of either \b #RowMajor or \b #ColMajor, and of \b #SelfAdjoint + * The former controls \ref TopicStorageOrders "storage order", and defaults to + * column-major. The latter controls whether the matrix represents a selfadjoint + * matrix in which case either Supers of Subs have to be null. + * + * \sa class TridiagonalMatrix + */ + +template +struct traits > +{ + typedef _Scalar Scalar; + typedef Dense StorageKind; + typedef Eigen::Index StorageIndex; + enum { + CoeffReadCost = NumTraits::ReadCost, + RowsAtCompileTime = _Rows, + ColsAtCompileTime = _Cols, + MaxRowsAtCompileTime = _Rows, + MaxColsAtCompileTime = _Cols, + Flags = LvalueBit, + Supers = _Supers, + Subs = _Subs, + Options = _Options, + DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) ? 1 + Supers + Subs : Dynamic + }; + typedef Matrix CoefficientsType; +}; + +template +class BandMatrix : public BandMatrixBase > +{ + public: + + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::traits::StorageIndex StorageIndex; + typedef typename internal::traits::CoefficientsType CoefficientsType; + + explicit inline BandMatrix(Index rows=Rows, Index cols=Cols, Index supers=Supers, Index subs=Subs) + : m_coeffs(1+supers+subs,cols), + m_rows(rows), m_supers(supers), m_subs(subs) + { + } + + /** \returns the number of columns */ + inline Index rows() const { return m_rows.value(); } + + /** \returns the number of rows */ + inline Index cols() const { return m_coeffs.cols(); } + + /** \returns the number of super diagonals */ + inline Index supers() const { return m_supers.value(); } + + /** \returns the number of sub diagonals */ + inline Index subs() const { return m_subs.value(); } + + inline const CoefficientsType& coeffs() const { return m_coeffs; } + inline CoefficientsType& coeffs() { return m_coeffs; } + + protected: + + CoefficientsType m_coeffs; + internal::variable_if_dynamic m_rows; + internal::variable_if_dynamic m_supers; + internal::variable_if_dynamic m_subs; +}; + +template +class BandMatrixWrapper; + +template +struct traits > +{ + typedef typename _CoefficientsType::Scalar Scalar; + typedef typename _CoefficientsType::StorageKind StorageKind; + typedef typename _CoefficientsType::StorageIndex StorageIndex; + enum { + CoeffReadCost = internal::traits<_CoefficientsType>::CoeffReadCost, + RowsAtCompileTime = _Rows, + ColsAtCompileTime = _Cols, + MaxRowsAtCompileTime = _Rows, + MaxColsAtCompileTime = _Cols, + Flags = LvalueBit, + Supers = _Supers, + Subs = _Subs, + Options = _Options, + DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) ? 1 + Supers + Subs : Dynamic + }; + typedef _CoefficientsType CoefficientsType; +}; + +template +class BandMatrixWrapper : public BandMatrixBase > +{ + public: + + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::traits::CoefficientsType CoefficientsType; + typedef typename internal::traits::StorageIndex StorageIndex; + + explicit inline BandMatrixWrapper(const CoefficientsType& coeffs, Index rows=_Rows, Index cols=_Cols, Index supers=_Supers, Index subs=_Subs) + : m_coeffs(coeffs), + m_rows(rows), m_supers(supers), m_subs(subs) + { + EIGEN_UNUSED_VARIABLE(cols); + //internal::assert(coeffs.cols()==cols() && (supers()+subs()+1)==coeffs.rows()); + } + + /** \returns the number of columns */ + inline Index rows() const { return m_rows.value(); } + + /** \returns the number of rows */ + inline Index cols() const { return m_coeffs.cols(); } + + /** \returns the number of super diagonals */ + inline Index supers() const { return m_supers.value(); } + + /** \returns the number of sub diagonals */ + inline Index subs() const { return m_subs.value(); } + + inline const CoefficientsType& coeffs() const { return m_coeffs; } + + protected: + + const CoefficientsType& m_coeffs; + internal::variable_if_dynamic m_rows; + internal::variable_if_dynamic m_supers; + internal::variable_if_dynamic m_subs; +}; + +/** + * \class TridiagonalMatrix + * \ingroup Core_Module + * + * \brief Represents a tridiagonal matrix with a compact banded storage + * + * \tparam Scalar Numeric type, i.e. float, double, int + * \tparam Size Number of rows and cols, or \b Dynamic + * \tparam Options Can be 0 or \b SelfAdjoint + * + * \sa class BandMatrix + */ +template +class TridiagonalMatrix : public BandMatrix +{ + typedef BandMatrix Base; + typedef typename Base::StorageIndex StorageIndex; + public: + explicit TridiagonalMatrix(Index size = Size) : Base(size,size,Options&SelfAdjoint?0:1,1) {} + + inline typename Base::template DiagonalIntReturnType<1>::Type super() + { return Base::template diagonal<1>(); } + inline const typename Base::template DiagonalIntReturnType<1>::Type super() const + { return Base::template diagonal<1>(); } + inline typename Base::template DiagonalIntReturnType<-1>::Type sub() + { return Base::template diagonal<-1>(); } + inline const typename Base::template DiagonalIntReturnType<-1>::Type sub() const + { return Base::template diagonal<-1>(); } + protected: +}; + + +struct BandShape {}; + +template +struct evaluator_traits > + : public evaluator_traits_base > +{ + typedef BandShape Shape; +}; + +template +struct evaluator_traits > + : public evaluator_traits_base > +{ + typedef BandShape Shape; +}; + +template<> struct AssignmentKind { typedef EigenBase2EigenBase Kind; }; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_BANDMATRIX_H diff --git a/Eigen/src/Core/Block.h b/Eigen/src/Core/Block.h new file mode 100644 index 000000000..11de45c2e --- /dev/null +++ b/Eigen/src/Core/Block.h @@ -0,0 +1,452 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2006-2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_BLOCK_H +#define EIGEN_BLOCK_H + +namespace Eigen { + +namespace internal { +template +struct traits > : traits +{ + typedef typename traits::Scalar Scalar; + typedef typename traits::StorageKind StorageKind; + typedef typename traits::XprKind XprKind; + typedef typename ref_selector::type XprTypeNested; + typedef typename remove_reference::type _XprTypeNested; + enum{ + MatrixRows = traits::RowsAtCompileTime, + MatrixCols = traits::ColsAtCompileTime, + RowsAtCompileTime = MatrixRows == 0 ? 0 : BlockRows, + ColsAtCompileTime = MatrixCols == 0 ? 0 : BlockCols, + MaxRowsAtCompileTime = BlockRows==0 ? 0 + : RowsAtCompileTime != Dynamic ? int(RowsAtCompileTime) + : int(traits::MaxRowsAtCompileTime), + MaxColsAtCompileTime = BlockCols==0 ? 0 + : ColsAtCompileTime != Dynamic ? int(ColsAtCompileTime) + : int(traits::MaxColsAtCompileTime), + + XprTypeIsRowMajor = (int(traits::Flags)&RowMajorBit) != 0, + IsRowMajor = (MaxRowsAtCompileTime==1&&MaxColsAtCompileTime!=1) ? 1 + : (MaxColsAtCompileTime==1&&MaxRowsAtCompileTime!=1) ? 0 + : XprTypeIsRowMajor, + HasSameStorageOrderAsXprType = (IsRowMajor == XprTypeIsRowMajor), + InnerSize = IsRowMajor ? int(ColsAtCompileTime) : int(RowsAtCompileTime), + InnerStrideAtCompileTime = HasSameStorageOrderAsXprType + ? int(inner_stride_at_compile_time::ret) + : int(outer_stride_at_compile_time::ret), + OuterStrideAtCompileTime = HasSameStorageOrderAsXprType + ? int(outer_stride_at_compile_time::ret) + : int(inner_stride_at_compile_time::ret), + + // FIXME, this traits is rather specialized for dense object and it needs to be cleaned further + FlagsLvalueBit = is_lvalue::value ? LvalueBit : 0, + FlagsRowMajorBit = IsRowMajor ? RowMajorBit : 0, + Flags = (traits::Flags & (DirectAccessBit | (InnerPanel?CompressedAccessBit:0))) | FlagsLvalueBit | FlagsRowMajorBit, + // FIXME DirectAccessBit should not be handled by expressions + // + // Alignment is needed by MapBase's assertions + // We can sefely set it to false here. Internal alignment errors will be detected by an eigen_internal_assert in the respective evaluator + Alignment = 0 + }; +}; + +template::ret> class BlockImpl_dense; + +} // end namespace internal + +template class BlockImpl; + +/** \class Block + * \ingroup Core_Module + * + * \brief Expression of a fixed-size or dynamic-size block + * + * \tparam XprType the type of the expression in which we are taking a block + * \tparam BlockRows the number of rows of the block we are taking at compile time (optional) + * \tparam BlockCols the number of columns of the block we are taking at compile time (optional) + * \tparam InnerPanel is true, if the block maps to a set of rows of a row major matrix or + * to set of columns of a column major matrix (optional). The parameter allows to determine + * at compile time whether aligned access is possible on the block expression. + * + * This class represents an expression of either a fixed-size or dynamic-size block. It is the return + * type of DenseBase::block(Index,Index,Index,Index) and DenseBase::block(Index,Index) and + * most of the time this is the only way it is used. + * + * However, if you want to directly maniputate block expressions, + * for instance if you want to write a function returning such an expression, you + * will need to use this class. + * + * Here is an example illustrating the dynamic case: + * \include class_Block.cpp + * Output: \verbinclude class_Block.out + * + * \note Even though this expression has dynamic size, in the case where \a XprType + * has fixed size, this expression inherits a fixed maximal size which means that evaluating + * it does not cause a dynamic memory allocation. + * + * Here is an example illustrating the fixed-size case: + * \include class_FixedBlock.cpp + * Output: \verbinclude class_FixedBlock.out + * + * \sa DenseBase::block(Index,Index,Index,Index), DenseBase::block(Index,Index), class VectorBlock + */ +template class Block + : public BlockImpl::StorageKind> +{ + typedef BlockImpl::StorageKind> Impl; + public: + //typedef typename Impl::Base Base; + typedef Impl Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(Block) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Block) + + typedef typename internal::remove_all::type NestedExpression; + + /** Column or Row constructor + */ + EIGEN_DEVICE_FUNC + inline Block(XprType& xpr, Index i) : Impl(xpr,i) + { + eigen_assert( (i>=0) && ( + ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && i= 0 && BlockRows >= 0 && startRow + BlockRows <= xpr.rows() + && startCol >= 0 && BlockCols >= 0 && startCol + BlockCols <= xpr.cols()); + } + + /** Dynamic-size constructor + */ + EIGEN_DEVICE_FUNC + inline Block(XprType& xpr, + Index startRow, Index startCol, + Index blockRows, Index blockCols) + : Impl(xpr, startRow, startCol, blockRows, blockCols) + { + eigen_assert((RowsAtCompileTime==Dynamic || RowsAtCompileTime==blockRows) + && (ColsAtCompileTime==Dynamic || ColsAtCompileTime==blockCols)); + eigen_assert(startRow >= 0 && blockRows >= 0 && startRow <= xpr.rows() - blockRows + && startCol >= 0 && blockCols >= 0 && startCol <= xpr.cols() - blockCols); + } +}; + +// The generic default implementation for dense block simplu forward to the internal::BlockImpl_dense +// that must be specialized for direct and non-direct access... +template +class BlockImpl + : public internal::BlockImpl_dense +{ + typedef internal::BlockImpl_dense Impl; + typedef typename XprType::StorageIndex StorageIndex; + public: + typedef Impl Base; + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl) + EIGEN_DEVICE_FUNC inline BlockImpl(XprType& xpr, Index i) : Impl(xpr,i) {} + EIGEN_DEVICE_FUNC inline BlockImpl(XprType& xpr, Index startRow, Index startCol) : Impl(xpr, startRow, startCol) {} + EIGEN_DEVICE_FUNC + inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) + : Impl(xpr, startRow, startCol, blockRows, blockCols) {} +}; + +namespace internal { + +/** \internal Internal implementation of dense Blocks in the general case. */ +template class BlockImpl_dense + : public internal::dense_xpr_base >::type +{ + typedef Block BlockType; + typedef typename internal::ref_selector::non_const_type XprTypeNested; + public: + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(BlockType) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl_dense) + + // class InnerIterator; // FIXME apparently never used + + /** Column or Row constructor + */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, Index i) + : m_xpr(xpr), + // It is a row if and only if BlockRows==1 and BlockCols==XprType::ColsAtCompileTime, + // and it is a column if and only if BlockRows==XprType::RowsAtCompileTime and BlockCols==1, + // all other cases are invalid. + // The case a 1x1 matrix seems ambiguous, but the result is the same anyway. + m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0), + m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0), + m_blockRows(BlockRows==1 ? 1 : xpr.rows()), + m_blockCols(BlockCols==1 ? 1 : xpr.cols()) + {} + + /** Fixed-size constructor + */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, Index startRow, Index startCol) + : m_xpr(xpr), m_startRow(startRow), m_startCol(startCol), + m_blockRows(BlockRows), m_blockCols(BlockCols) + {} + + /** Dynamic-size constructor + */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, + Index startRow, Index startCol, + Index blockRows, Index blockCols) + : m_xpr(xpr), m_startRow(startRow), m_startCol(startCol), + m_blockRows(blockRows), m_blockCols(blockCols) + {} + + EIGEN_DEVICE_FUNC inline Index rows() const { return m_blockRows.value(); } + EIGEN_DEVICE_FUNC inline Index cols() const { return m_blockCols.value(); } + + EIGEN_DEVICE_FUNC + inline Scalar& coeffRef(Index rowId, Index colId) + { + EIGEN_STATIC_ASSERT_LVALUE(XprType) + return m_xpr.coeffRef(rowId + m_startRow.value(), colId + m_startCol.value()); + } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index rowId, Index colId) const + { + return m_xpr.derived().coeffRef(rowId + m_startRow.value(), colId + m_startCol.value()); + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE const CoeffReturnType coeff(Index rowId, Index colId) const + { + return m_xpr.coeff(rowId + m_startRow.value(), colId + m_startCol.value()); + } + + EIGEN_DEVICE_FUNC + inline Scalar& coeffRef(Index index) + { + EIGEN_STATIC_ASSERT_LVALUE(XprType) + return m_xpr.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), + m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); + } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index index) const + { + return m_xpr.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), + m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); + } + + EIGEN_DEVICE_FUNC + inline const CoeffReturnType coeff(Index index) const + { + return m_xpr.coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), + m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); + } + + template + inline PacketScalar packet(Index rowId, Index colId) const + { + return m_xpr.template packet(rowId + m_startRow.value(), colId + m_startCol.value()); + } + + template + inline void writePacket(Index rowId, Index colId, const PacketScalar& val) + { + m_xpr.template writePacket(rowId + m_startRow.value(), colId + m_startCol.value(), val); + } + + template + inline PacketScalar packet(Index index) const + { + return m_xpr.template packet + (m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), + m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); + } + + template + inline void writePacket(Index index, const PacketScalar& val) + { + m_xpr.template writePacket + (m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), + m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0), val); + } + + #ifdef EIGEN_PARSED_BY_DOXYGEN + /** \sa MapBase::data() */ + EIGEN_DEVICE_FUNC inline const Scalar* data() const; + EIGEN_DEVICE_FUNC inline Index innerStride() const; + EIGEN_DEVICE_FUNC inline Index outerStride() const; + #endif + + EIGEN_DEVICE_FUNC + const typename internal::remove_all::type& nestedExpression() const + { + return m_xpr; + } + + EIGEN_DEVICE_FUNC + XprType& nestedExpression() { return m_xpr; } + + EIGEN_DEVICE_FUNC + StorageIndex startRow() const + { + return m_startRow.value(); + } + + EIGEN_DEVICE_FUNC + StorageIndex startCol() const + { + return m_startCol.value(); + } + + protected: + + XprTypeNested m_xpr; + const internal::variable_if_dynamic m_startRow; + const internal::variable_if_dynamic m_startCol; + const internal::variable_if_dynamic m_blockRows; + const internal::variable_if_dynamic m_blockCols; +}; + +/** \internal Internal implementation of dense Blocks in the direct access case.*/ +template +class BlockImpl_dense + : public MapBase > +{ + typedef Block BlockType; + typedef typename internal::ref_selector::non_const_type XprTypeNested; + enum { + XprTypeIsRowMajor = (int(traits::Flags)&RowMajorBit) != 0 + }; + public: + + typedef MapBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(BlockType) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(BlockImpl_dense) + + /** Column or Row constructor + */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, Index i) + : Base(xpr.data() + i * ( ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && (!XprTypeIsRowMajor)) + || ((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && ( XprTypeIsRowMajor)) ? xpr.innerStride() : xpr.outerStride()), + BlockRows==1 ? 1 : xpr.rows(), + BlockCols==1 ? 1 : xpr.cols()), + m_xpr(xpr), + m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0), + m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0) + { + init(); + } + + /** Fixed-size constructor + */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, Index startRow, Index startCol) + : Base(xpr.data()+xpr.innerStride()*(XprTypeIsRowMajor?startCol:startRow) + xpr.outerStride()*(XprTypeIsRowMajor?startRow:startCol)), + m_xpr(xpr), m_startRow(startRow), m_startCol(startCol) + { + init(); + } + + /** Dynamic-size constructor + */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, + Index startRow, Index startCol, + Index blockRows, Index blockCols) + : Base(xpr.data()+xpr.innerStride()*(XprTypeIsRowMajor?startCol:startRow) + xpr.outerStride()*(XprTypeIsRowMajor?startRow:startCol), blockRows, blockCols), + m_xpr(xpr), m_startRow(startRow), m_startCol(startCol) + { + init(); + } + + EIGEN_DEVICE_FUNC + const typename internal::remove_all::type& nestedExpression() const + { + return m_xpr; + } + + EIGEN_DEVICE_FUNC + XprType& nestedExpression() { return m_xpr; } + + /** \sa MapBase::innerStride() */ + EIGEN_DEVICE_FUNC + inline Index innerStride() const + { + return internal::traits::HasSameStorageOrderAsXprType + ? m_xpr.innerStride() + : m_xpr.outerStride(); + } + + /** \sa MapBase::outerStride() */ + EIGEN_DEVICE_FUNC + inline Index outerStride() const + { + return m_outerStride; + } + + EIGEN_DEVICE_FUNC + StorageIndex startRow() const + { + return m_startRow.value(); + } + + EIGEN_DEVICE_FUNC + StorageIndex startCol() const + { + return m_startCol.value(); + } + + #ifndef __SUNPRO_CC + // FIXME sunstudio is not friendly with the above friend... + // META-FIXME there is no 'friend' keyword around here. Is this obsolete? + protected: + #endif + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** \internal used by allowAligned() */ + EIGEN_DEVICE_FUNC + inline BlockImpl_dense(XprType& xpr, const Scalar* data, Index blockRows, Index blockCols) + : Base(data, blockRows, blockCols), m_xpr(xpr) + { + init(); + } + #endif + + protected: + EIGEN_DEVICE_FUNC + void init() + { + m_outerStride = internal::traits::HasSameStorageOrderAsXprType + ? m_xpr.outerStride() + : m_xpr.innerStride(); + } + + XprTypeNested m_xpr; + const internal::variable_if_dynamic m_startRow; + const internal::variable_if_dynamic m_startCol; + Index m_outerStride; +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_BLOCK_H diff --git a/Eigen/src/Core/BooleanRedux.h b/Eigen/src/Core/BooleanRedux.h new file mode 100644 index 000000000..ccf519067 --- /dev/null +++ b/Eigen/src/Core/BooleanRedux.h @@ -0,0 +1,162 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_ALLANDANY_H +#define EIGEN_ALLANDANY_H + +namespace Eigen { + +namespace internal { + +template +struct all_unroller +{ + enum { + col = (UnrollCount-1) / Rows, + row = (UnrollCount-1) % Rows + }; + + static inline bool run(const Derived &mat) + { + return all_unroller::run(mat) && mat.coeff(row, col); + } +}; + +template +struct all_unroller +{ + static inline bool run(const Derived &/*mat*/) { return true; } +}; + +template +struct all_unroller +{ + static inline bool run(const Derived &) { return false; } +}; + +template +struct any_unroller +{ + enum { + col = (UnrollCount-1) / Rows, + row = (UnrollCount-1) % Rows + }; + + static inline bool run(const Derived &mat) + { + return any_unroller::run(mat) || mat.coeff(row, col); + } +}; + +template +struct any_unroller +{ + static inline bool run(const Derived & /*mat*/) { return false; } +}; + +template +struct any_unroller +{ + static inline bool run(const Derived &) { return false; } +}; + +} // end namespace internal + +/** \returns true if all coefficients are true + * + * Example: \include MatrixBase_all.cpp + * Output: \verbinclude MatrixBase_all.out + * + * \sa any(), Cwise::operator<() + */ +template +EIGEN_DEVICE_FUNC inline bool DenseBase::all() const +{ + typedef internal::evaluator Evaluator; + enum { + unroll = SizeAtCompileTime != Dynamic + && SizeAtCompileTime * (Evaluator::CoeffReadCost + NumTraits::AddCost) <= EIGEN_UNROLLING_LIMIT + }; + Evaluator evaluator(derived()); + if(unroll) + return internal::all_unroller::RowsAtCompileTime>::run(evaluator); + else + { + for(Index j = 0; j < cols(); ++j) + for(Index i = 0; i < rows(); ++i) + if (!evaluator.coeff(i, j)) return false; + return true; + } +} + +/** \returns true if at least one coefficient is true + * + * \sa all() + */ +template +EIGEN_DEVICE_FUNC inline bool DenseBase::any() const +{ + typedef internal::evaluator Evaluator; + enum { + unroll = SizeAtCompileTime != Dynamic + && SizeAtCompileTime * (Evaluator::CoeffReadCost + NumTraits::AddCost) <= EIGEN_UNROLLING_LIMIT + }; + Evaluator evaluator(derived()); + if(unroll) + return internal::any_unroller::RowsAtCompileTime>::run(evaluator); + else + { + for(Index j = 0; j < cols(); ++j) + for(Index i = 0; i < rows(); ++i) + if (evaluator.coeff(i, j)) return true; + return false; + } +} + +/** \returns the number of coefficients which evaluate to true + * + * \sa all(), any() + */ +template +EIGEN_DEVICE_FUNC inline Eigen::Index DenseBase::count() const +{ + return derived().template cast().template cast().sum(); +} + +/** \returns true is \c *this contains at least one Not A Number (NaN). + * + * \sa allFinite() + */ +template +inline bool DenseBase::hasNaN() const +{ +#if EIGEN_COMP_MSVC || (defined __FAST_MATH__) + return derived().array().isNaN().any(); +#else + return !((derived().array()==derived().array()).all()); +#endif +} + +/** \returns true if \c *this contains only finite numbers, i.e., no NaN and no +/-INF values. + * + * \sa hasNaN() + */ +template +inline bool DenseBase::allFinite() const +{ +#if EIGEN_COMP_MSVC || (defined __FAST_MATH__) + return derived().array().isFinite().all(); +#else + return !((derived()-derived()).hasNaN()); +#endif +} + +} // end namespace Eigen + +#endif // EIGEN_ALLANDANY_H diff --git a/Eigen/src/Core/CommaInitializer.h b/Eigen/src/Core/CommaInitializer.h new file mode 100644 index 000000000..35fdbb819 --- /dev/null +++ b/Eigen/src/Core/CommaInitializer.h @@ -0,0 +1,160 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_COMMAINITIALIZER_H +#define EIGEN_COMMAINITIALIZER_H + +namespace Eigen { + +/** \class CommaInitializer + * \ingroup Core_Module + * + * \brief Helper class used by the comma initializer operator + * + * This class is internally used to implement the comma initializer feature. It is + * the return type of MatrixBase::operator<<, and most of the time this is the only + * way it is used. + * + * \sa \blank \ref MatrixBaseCommaInitRef "MatrixBase::operator<<", CommaInitializer::finished() + */ +template +struct CommaInitializer +{ + typedef typename XprType::Scalar Scalar; + + EIGEN_DEVICE_FUNC + inline CommaInitializer(XprType& xpr, const Scalar& s) + : m_xpr(xpr), m_row(0), m_col(1), m_currentBlockRows(1) + { + m_xpr.coeffRef(0,0) = s; + } + + template + EIGEN_DEVICE_FUNC + inline CommaInitializer(XprType& xpr, const DenseBase& other) + : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows()) + { + m_xpr.block(0, 0, other.rows(), other.cols()) = other; + } + + /* Copy/Move constructor which transfers ownership. This is crucial in + * absence of return value optimization to avoid assertions during destruction. */ + // FIXME in C++11 mode this could be replaced by a proper RValue constructor + EIGEN_DEVICE_FUNC + inline CommaInitializer(const CommaInitializer& o) + : m_xpr(o.m_xpr), m_row(o.m_row), m_col(o.m_col), m_currentBlockRows(o.m_currentBlockRows) { + // Mark original object as finished. In absence of R-value references we need to const_cast: + const_cast(o).m_row = m_xpr.rows(); + const_cast(o).m_col = m_xpr.cols(); + const_cast(o).m_currentBlockRows = 0; + } + + /* inserts a scalar value in the target matrix */ + EIGEN_DEVICE_FUNC + CommaInitializer& operator,(const Scalar& s) + { + if (m_col==m_xpr.cols()) + { + m_row+=m_currentBlockRows; + m_col = 0; + m_currentBlockRows = 1; + eigen_assert(m_row + EIGEN_DEVICE_FUNC + CommaInitializer& operator,(const DenseBase& other) + { + if (m_col==m_xpr.cols() && (other.cols()!=0 || other.rows()!=m_currentBlockRows)) + { + m_row+=m_currentBlockRows; + m_col = 0; + m_currentBlockRows = other.rows(); + eigen_assert(m_row+m_currentBlockRows<=m_xpr.rows() + && "Too many rows passed to comma initializer (operator<<)"); + } + eigen_assert((m_col + other.cols() <= m_xpr.cols()) + && "Too many coefficients passed to comma initializer (operator<<)"); + eigen_assert(m_currentBlockRows==other.rows()); + m_xpr.template block + (m_row, m_col, other.rows(), other.cols()) = other; + m_col += other.cols(); + return *this; + } + + EIGEN_DEVICE_FUNC + inline ~CommaInitializer() +#if defined VERIFY_RAISES_ASSERT && (!defined EIGEN_NO_ASSERTION_CHECKING) && defined EIGEN_EXCEPTIONS + EIGEN_EXCEPTION_SPEC(Eigen::eigen_assert_exception) +#endif + { + finished(); + } + + /** \returns the built matrix once all its coefficients have been set. + * Calling finished is 100% optional. Its purpose is to write expressions + * like this: + * \code + * quaternion.fromRotationMatrix((Matrix3f() << axis0, axis1, axis2).finished()); + * \endcode + */ + EIGEN_DEVICE_FUNC + inline XprType& finished() { + eigen_assert(((m_row+m_currentBlockRows) == m_xpr.rows() || m_xpr.cols() == 0) + && m_col == m_xpr.cols() + && "Too few coefficients passed to comma initializer (operator<<)"); + return m_xpr; + } + + XprType& m_xpr; // target expression + Index m_row; // current row id + Index m_col; // current col id + Index m_currentBlockRows; // current block height +}; + +/** \anchor MatrixBaseCommaInitRef + * Convenient operator to set the coefficients of a matrix. + * + * The coefficients must be provided in a row major order and exactly match + * the size of the matrix. Otherwise an assertion is raised. + * + * Example: \include MatrixBase_set.cpp + * Output: \verbinclude MatrixBase_set.out + * + * \note According the c++ standard, the argument expressions of this comma initializer are evaluated in arbitrary order. + * + * \sa CommaInitializer::finished(), class CommaInitializer + */ +template +EIGEN_DEVICE_FUNC inline CommaInitializer DenseBase::operator<< (const Scalar& s) +{ + return CommaInitializer(*static_cast(this), s); +} + +/** \sa operator<<(const Scalar&) */ +template +template +EIGEN_DEVICE_FUNC inline CommaInitializer +DenseBase::operator<<(const DenseBase& other) +{ + return CommaInitializer(*static_cast(this), other); +} + +} // end namespace Eigen + +#endif // EIGEN_COMMAINITIALIZER_H diff --git a/Eigen/src/Core/ConditionEstimator.h b/Eigen/src/Core/ConditionEstimator.h new file mode 100644 index 000000000..aa7efdc76 --- /dev/null +++ b/Eigen/src/Core/ConditionEstimator.h @@ -0,0 +1,175 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2016 Rasmus Munk Larsen (rmlarsen@google.com) +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CONDITIONESTIMATOR_H +#define EIGEN_CONDITIONESTIMATOR_H + +namespace Eigen { + +namespace internal { + +template +struct rcond_compute_sign { + static inline Vector run(const Vector& v) { + const RealVector v_abs = v.cwiseAbs(); + return (v_abs.array() == static_cast(0)) + .select(Vector::Ones(v.size()), v.cwiseQuotient(v_abs)); + } +}; + +// Partial specialization to avoid elementwise division for real vectors. +template +struct rcond_compute_sign { + static inline Vector run(const Vector& v) { + return (v.array() < static_cast(0)) + .select(-Vector::Ones(v.size()), Vector::Ones(v.size())); + } +}; + +/** + * \returns an estimate of ||inv(matrix)||_1 given a decomposition of + * \a matrix that implements .solve() and .adjoint().solve() methods. + * + * This function implements Algorithms 4.1 and 5.1 from + * http://www.maths.manchester.ac.uk/~higham/narep/narep135.pdf + * which also forms the basis for the condition number estimators in + * LAPACK. Since at most 10 calls to the solve method of dec are + * performed, the total cost is O(dims^2), as opposed to O(dims^3) + * needed to compute the inverse matrix explicitly. + * + * The most common usage is in estimating the condition number + * ||matrix||_1 * ||inv(matrix)||_1. The first term ||matrix||_1 can be + * computed directly in O(n^2) operations. + * + * Supports the following decompositions: FullPivLU, PartialPivLU, LDLT, and + * LLT. + * + * \sa FullPivLU, PartialPivLU, LDLT, LLT. + */ +template +typename Decomposition::RealScalar rcond_invmatrix_L1_norm_estimate(const Decomposition& dec) +{ + typedef typename Decomposition::MatrixType MatrixType; + typedef typename Decomposition::Scalar Scalar; + typedef typename Decomposition::RealScalar RealScalar; + typedef typename internal::plain_col_type::type Vector; + typedef typename internal::plain_col_type::type RealVector; + const bool is_complex = (NumTraits::IsComplex != 0); + + eigen_assert(dec.rows() == dec.cols()); + const Index n = dec.rows(); + if (n == 0) + return 0; + + // Disable Index to float conversion warning +#ifdef __INTEL_COMPILER + #pragma warning push + #pragma warning ( disable : 2259 ) +#endif + Vector v = dec.solve(Vector::Ones(n) / Scalar(n)); +#ifdef __INTEL_COMPILER + #pragma warning pop +#endif + + // lower_bound is a lower bound on + // ||inv(matrix)||_1 = sup_v ||inv(matrix) v||_1 / ||v||_1 + // and is the objective maximized by the ("super-") gradient ascent + // algorithm below. + RealScalar lower_bound = v.template lpNorm<1>(); + if (n == 1) + return lower_bound; + + // Gradient ascent algorithm follows: We know that the optimum is achieved at + // one of the simplices v = e_i, so in each iteration we follow a + // super-gradient to move towards the optimal one. + RealScalar old_lower_bound = lower_bound; + Vector sign_vector(n); + Vector old_sign_vector; + Index v_max_abs_index = -1; + Index old_v_max_abs_index = v_max_abs_index; + for (int k = 0; k < 4; ++k) + { + sign_vector = internal::rcond_compute_sign::run(v); + if (k > 0 && !is_complex && sign_vector == old_sign_vector) { + // Break if the solution stagnated. + break; + } + // v_max_abs_index = argmax |real( inv(matrix)^T * sign_vector )| + v = dec.adjoint().solve(sign_vector); + v.real().cwiseAbs().maxCoeff(&v_max_abs_index); + if (v_max_abs_index == old_v_max_abs_index) { + // Break if the solution stagnated. + break; + } + // Move to the new simplex e_j, where j = v_max_abs_index. + v = dec.solve(Vector::Unit(n, v_max_abs_index)); // v = inv(matrix) * e_j. + lower_bound = v.template lpNorm<1>(); + if (lower_bound <= old_lower_bound) { + // Break if the gradient step did not increase the lower_bound. + break; + } + if (!is_complex) { + old_sign_vector = sign_vector; + } + old_v_max_abs_index = v_max_abs_index; + old_lower_bound = lower_bound; + } + // The following calculates an independent estimate of ||matrix||_1 by + // multiplying matrix by a vector with entries of slowly increasing + // magnitude and alternating sign: + // v_i = (-1)^{i} (1 + (i / (dim-1))), i = 0,...,dim-1. + // This improvement to Hager's algorithm above is due to Higham. It was + // added to make the algorithm more robust in certain corner cases where + // large elements in the matrix might otherwise escape detection due to + // exact cancellation (especially when op and op_adjoint correspond to a + // sequence of backsubstitutions and permutations), which could cause + // Hager's algorithm to vastly underestimate ||matrix||_1. + Scalar alternating_sign(RealScalar(1)); + for (Index i = 0; i < n; ++i) { + // The static_cast is needed when Scalar is a complex and RealScalar implements expression templates + v[i] = alternating_sign * static_cast(RealScalar(1) + (RealScalar(i) / (RealScalar(n - 1)))); + alternating_sign = -alternating_sign; + } + v = dec.solve(v); + const RealScalar alternate_lower_bound = (2 * v.template lpNorm<1>()) / (3 * RealScalar(n)); + return numext::maxi(lower_bound, alternate_lower_bound); +} + +/** \brief Reciprocal condition number estimator. + * + * Computing a decomposition of a dense matrix takes O(n^3) operations, while + * this method estimates the condition number quickly and reliably in O(n^2) + * operations. + * + * \returns an estimate of the reciprocal condition number + * (1 / (||matrix||_1 * ||inv(matrix)||_1)) of matrix, given ||matrix||_1 and + * its decomposition. Supports the following decompositions: FullPivLU, + * PartialPivLU, LDLT, and LLT. + * + * \sa FullPivLU, PartialPivLU, LDLT, LLT. + */ +template +typename Decomposition::RealScalar +rcond_estimate_helper(typename Decomposition::RealScalar matrix_norm, const Decomposition& dec) +{ + typedef typename Decomposition::RealScalar RealScalar; + eigen_assert(dec.rows() == dec.cols()); + if (dec.rows() == 0) return RealScalar(1); + if (matrix_norm == RealScalar(0)) return RealScalar(0); + if (dec.rows() == 1) return RealScalar(1); + const RealScalar inverse_matrix_norm = rcond_invmatrix_L1_norm_estimate(dec); + return (inverse_matrix_norm == RealScalar(0) ? RealScalar(0) + : (RealScalar(1) / inverse_matrix_norm) / matrix_norm); +} + +} // namespace internal + +} // namespace Eigen + +#endif diff --git a/Eigen/src/Core/CoreEvaluators.h b/Eigen/src/Core/CoreEvaluators.h new file mode 100644 index 000000000..8419798c1 --- /dev/null +++ b/Eigen/src/Core/CoreEvaluators.h @@ -0,0 +1,1746 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2011 Benoit Jacob +// Copyright (C) 2011-2014 Gael Guennebaud +// Copyright (C) 2011-2012 Jitse Niesen +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + + +#ifndef EIGEN_COREEVALUATORS_H +#define EIGEN_COREEVALUATORS_H + +namespace Eigen { + +namespace internal { + +// This class returns the evaluator kind from the expression storage kind. +// Default assumes index based accessors +template +struct storage_kind_to_evaluator_kind { + typedef IndexBased Kind; +}; + +// This class returns the evaluator shape from the expression storage kind. +// It can be Dense, Sparse, Triangular, Diagonal, SelfAdjoint, Band, etc. +template struct storage_kind_to_shape; + +template<> struct storage_kind_to_shape { typedef DenseShape Shape; }; +template<> struct storage_kind_to_shape { typedef SolverShape Shape; }; +template<> struct storage_kind_to_shape { typedef PermutationShape Shape; }; +template<> struct storage_kind_to_shape { typedef TranspositionsShape Shape; }; + +// Evaluators have to be specialized with respect to various criteria such as: +// - storage/structure/shape +// - scalar type +// - etc. +// Therefore, we need specialization of evaluator providing additional template arguments for each kind of evaluators. +// We currently distinguish the following kind of evaluators: +// - unary_evaluator for expressions taking only one arguments (CwiseUnaryOp, CwiseUnaryView, Transpose, MatrixWrapper, ArrayWrapper, Reverse, Replicate) +// - binary_evaluator for expression taking two arguments (CwiseBinaryOp) +// - ternary_evaluator for expression taking three arguments (CwiseTernaryOp) +// - product_evaluator for linear algebra products (Product); special case of binary_evaluator because it requires additional tags for dispatching. +// - mapbase_evaluator for Map, Block, Ref +// - block_evaluator for Block (special dispatching to a mapbase_evaluator or unary_evaluator) + +template< typename T, + typename Arg1Kind = typename evaluator_traits::Kind, + typename Arg2Kind = typename evaluator_traits::Kind, + typename Arg3Kind = typename evaluator_traits::Kind, + typename Arg1Scalar = typename traits::Scalar, + typename Arg2Scalar = typename traits::Scalar, + typename Arg3Scalar = typename traits::Scalar> struct ternary_evaluator; + +template< typename T, + typename LhsKind = typename evaluator_traits::Kind, + typename RhsKind = typename evaluator_traits::Kind, + typename LhsScalar = typename traits::Scalar, + typename RhsScalar = typename traits::Scalar> struct binary_evaluator; + +template< typename T, + typename Kind = typename evaluator_traits::Kind, + typename Scalar = typename T::Scalar> struct unary_evaluator; + +// evaluator_traits contains traits for evaluator + +template +struct evaluator_traits_base +{ + // by default, get evaluator kind and shape from storage + typedef typename storage_kind_to_evaluator_kind::StorageKind>::Kind Kind; + typedef typename storage_kind_to_shape::StorageKind>::Shape Shape; +}; + +// Default evaluator traits +template +struct evaluator_traits : public evaluator_traits_base +{ +}; + +template::Shape > +struct evaluator_assume_aliasing { + static const bool value = false; +}; + +// By default, we assume a unary expression: +template +struct evaluator : public unary_evaluator +{ + typedef unary_evaluator Base; + EIGEN_DEVICE_FUNC explicit evaluator(const T& xpr) : Base(xpr) {} +}; + + +// TODO: Think about const-correctness +template +struct evaluator + : evaluator +{ + EIGEN_DEVICE_FUNC + explicit evaluator(const T& xpr) : evaluator(xpr) {} +}; + +// ---------- base class for all evaluators ---------- + +template +struct evaluator_base +{ + // TODO that's not very nice to have to propagate all these traits. They are currently only needed to handle outer,inner indices. + typedef traits ExpressionTraits; + + enum { + Alignment = 0 + }; + // noncopyable: + // Don't make this class inherit noncopyable as this kills EBO (Empty Base Optimization) + // and make complex evaluator much larger than then should do. + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE evaluator_base() {} + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE ~evaluator_base() {} +private: + EIGEN_DEVICE_FUNC evaluator_base(const evaluator_base&); + EIGEN_DEVICE_FUNC const evaluator_base& operator=(const evaluator_base&); +}; + +// -------------------- Matrix and Array -------------------- +// +// evaluator is a common base class for the +// Matrix and Array evaluators. +// Here we directly specialize evaluator. This is not really a unary expression, and it is, by definition, dense, +// so no need for more sophisticated dispatching. + +// this helper permits to completely eliminate m_outerStride if it is known at compiletime. +template class plainobjectbase_evaluator_data { +public: + EIGEN_DEVICE_FUNC plainobjectbase_evaluator_data(const Scalar* ptr, Index outerStride) : data(ptr) + { +#ifndef EIGEN_INTERNAL_DEBUGGING + EIGEN_UNUSED_VARIABLE(outerStride); +#endif + eigen_internal_assert(outerStride==OuterStride); + } + EIGEN_DEVICE_FUNC Index outerStride() const { return OuterStride; } + const Scalar *data; +}; + +template class plainobjectbase_evaluator_data { +public: + EIGEN_DEVICE_FUNC plainobjectbase_evaluator_data(const Scalar* ptr, Index outerStride) : data(ptr), m_outerStride(outerStride) {} + EIGEN_DEVICE_FUNC Index outerStride() const { return m_outerStride; } + const Scalar *data; +protected: + Index m_outerStride; +}; + +template +struct evaluator > + : evaluator_base +{ + typedef PlainObjectBase PlainObjectType; + typedef typename PlainObjectType::Scalar Scalar; + typedef typename PlainObjectType::CoeffReturnType CoeffReturnType; + + enum { + IsRowMajor = PlainObjectType::IsRowMajor, + IsVectorAtCompileTime = PlainObjectType::IsVectorAtCompileTime, + RowsAtCompileTime = PlainObjectType::RowsAtCompileTime, + ColsAtCompileTime = PlainObjectType::ColsAtCompileTime, + + CoeffReadCost = NumTraits::ReadCost, + Flags = traits::EvaluatorFlags, + Alignment = traits::Alignment + }; + enum { + // We do not need to know the outer stride for vectors + OuterStrideAtCompileTime = IsVectorAtCompileTime ? 0 + : int(IsRowMajor) ? ColsAtCompileTime + : RowsAtCompileTime + }; + + EIGEN_DEVICE_FUNC evaluator() + : m_d(0,OuterStrideAtCompileTime) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + EIGEN_DEVICE_FUNC explicit evaluator(const PlainObjectType& m) + : m_d(m.data(),IsVectorAtCompileTime ? 0 : m.outerStride()) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + if (IsRowMajor) + return m_d.data[row * m_d.outerStride() + col]; + else + return m_d.data[row + col * m_d.outerStride()]; + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_d.data[index]; + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + if (IsRowMajor) + return const_cast(m_d.data)[row * m_d.outerStride() + col]; + else + return const_cast(m_d.data)[row + col * m_d.outerStride()]; + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + return const_cast(m_d.data)[index]; + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + if (IsRowMajor) + return ploadt(m_d.data + row * m_d.outerStride() + col); + else + return ploadt(m_d.data + row + col * m_d.outerStride()); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return ploadt(m_d.data + index); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index row, Index col, const PacketType& x) + { + if (IsRowMajor) + return pstoret + (const_cast(m_d.data) + row * m_d.outerStride() + col, x); + else + return pstoret + (const_cast(m_d.data) + row + col * m_d.outerStride(), x); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index index, const PacketType& x) + { + return pstoret(const_cast(m_d.data) + index, x); + } + +protected: + + plainobjectbase_evaluator_data m_d; +}; + +template +struct evaluator > + : evaluator > > +{ + typedef Matrix XprType; + + EIGEN_DEVICE_FUNC evaluator() {} + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& m) + : evaluator >(m) + { } +}; + +template +struct evaluator > + : evaluator > > +{ + typedef Array XprType; + + EIGEN_DEVICE_FUNC evaluator() {} + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& m) + : evaluator >(m) + { } +}; + +// -------------------- Transpose -------------------- + +template +struct unary_evaluator, IndexBased> + : evaluator_base > +{ + typedef Transpose XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost, + Flags = evaluator::Flags ^ RowMajorBit, + Alignment = evaluator::Alignment + }; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& t) : m_argImpl(t.nestedExpression()) {} + + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_argImpl.coeff(col, row); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_argImpl.coeff(index); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_argImpl.coeffRef(col, row); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + typename XprType::Scalar& coeffRef(Index index) + { + return m_argImpl.coeffRef(index); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + return m_argImpl.template packet(col, row); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return m_argImpl.template packet(index); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index row, Index col, const PacketType& x) + { + m_argImpl.template writePacket(col, row, x); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index index, const PacketType& x) + { + m_argImpl.template writePacket(index, x); + } + +protected: + evaluator m_argImpl; +}; + +// -------------------- CwiseNullaryOp -------------------- +// Like Matrix and Array, this is not really a unary expression, so we directly specialize evaluator. +// Likewise, there is not need to more sophisticated dispatching here. + +template::value, + bool has_unary = has_unary_operator::value, + bool has_binary = has_binary_operator::value> +struct nullary_wrapper +{ + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const { return op(i,j); } + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i) const { return op(i); } + + template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i, IndexType j) const { return op.template packetOp(i,j); } + template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i) const { return op.template packetOp(i); } +}; + +template +struct nullary_wrapper +{ + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType=0, IndexType=0) const { return op(); } + template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType=0, IndexType=0) const { return op.template packetOp(); } +}; + +template +struct nullary_wrapper +{ + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i, IndexType j=0) const { return op(i,j); } + template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i, IndexType j=0) const { return op.template packetOp(i,j); } +}; + +// We need the following specialization for vector-only functors assigned to a runtime vector, +// for instance, using linspace and assigning a RowVectorXd to a MatrixXd or even a row of a MatrixXd. +// In this case, i==0 and j is used for the actual iteration. +template +struct nullary_wrapper +{ + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const { + eigen_assert(i==0 || j==0); + return op(i+j); + } + template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i, IndexType j) const { + eigen_assert(i==0 || j==0); + return op.template packetOp(i+j); + } + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i) const { return op(i); } + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i) const { return op.template packetOp(i); } +}; + +template +struct nullary_wrapper {}; + +#if 0 && EIGEN_COMP_MSVC>0 +// Disable this ugly workaround. This is now handled in traits::match, +// but this piece of code might still become handly if some other weird compilation +// erros pop up again. + +// MSVC exhibits a weird compilation error when +// compiling: +// Eigen::MatrixXf A = MatrixXf::Random(3,3); +// Ref R = 2.f*A; +// and that has_*ary_operator> have not been instantiated yet. +// The "problem" is that evaluator<2.f*A> is instantiated by traits::match<2.f*A> +// and at that time has_*ary_operator returns true regardless of T. +// Then nullary_wrapper is badly instantiated as nullary_wrapper<.,.,true,true,true>. +// The trick is thus to defer the proper instantiation of nullary_wrapper when coeff(), +// and packet() are really instantiated as implemented below: + +// This is a simple wrapper around Index to enforce the re-instantiation of +// has_*ary_operator when needed. +template struct nullary_wrapper_workaround_msvc { + nullary_wrapper_workaround_msvc(const T&); + operator T()const; +}; + +template +struct nullary_wrapper +{ + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const { + return nullary_wrapper >::value, + has_unary_operator >::value, + has_binary_operator >::value>().operator()(op,i,j); + } + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar operator()(const NullaryOp& op, IndexType i) const { + return nullary_wrapper >::value, + has_unary_operator >::value, + has_binary_operator >::value>().operator()(op,i); + } + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i, IndexType j) const { + return nullary_wrapper >::value, + has_unary_operator >::value, + has_binary_operator >::value>().template packetOp(op,i,j); + } + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T packetOp(const NullaryOp& op, IndexType i) const { + return nullary_wrapper >::value, + has_unary_operator >::value, + has_binary_operator >::value>().template packetOp(op,i); + } +}; +#endif // MSVC workaround + +template +struct evaluator > + : evaluator_base > +{ + typedef CwiseNullaryOp XprType; + typedef typename internal::remove_all::type PlainObjectTypeCleaned; + + enum { + CoeffReadCost = internal::functor_traits::Cost, + + Flags = (evaluator::Flags + & ( HereditaryBits + | (functor_has_linear_access::ret ? LinearAccessBit : 0) + | (functor_traits::PacketAccess ? PacketAccessBit : 0))) + | (functor_traits::IsRepeatable ? 0 : EvalBeforeNestingBit), + Alignment = AlignedMax + }; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& n) + : m_functor(n.functor()), m_wrapper() + { + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::CoeffReturnType CoeffReturnType; + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(IndexType row, IndexType col) const + { + return m_wrapper(m_functor, row, col); + } + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(IndexType index) const + { + return m_wrapper(m_functor,index); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(IndexType row, IndexType col) const + { + return m_wrapper.template packetOp(m_functor, row, col); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(IndexType index) const + { + return m_wrapper.template packetOp(m_functor, index); + } + +protected: + const NullaryOp m_functor; + const internal::nullary_wrapper m_wrapper; +}; + +// -------------------- CwiseUnaryOp -------------------- + +template +struct unary_evaluator, IndexBased > + : evaluator_base > +{ + typedef CwiseUnaryOp XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost + functor_traits::Cost, + + Flags = evaluator::Flags + & (HereditaryBits | LinearAccessBit | (functor_traits::PacketAccess ? PacketAccessBit : 0)), + Alignment = evaluator::Alignment + }; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + explicit unary_evaluator(const XprType& op) : m_d(op) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_d.func()(m_d.argImpl.coeff(row, col)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_d.func()(m_d.argImpl.coeff(index)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + return m_d.func().packetOp(m_d.argImpl.template packet(row, col)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return m_d.func().packetOp(m_d.argImpl.template packet(index)); + } + +protected: + + // this helper permits to completely eliminate the functor if it is empty + class Data : private UnaryOp + { + public: + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Data(const XprType& xpr) : UnaryOp(xpr.functor()), argImpl(xpr.nestedExpression()) {} + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const UnaryOp& func() const { return static_cast(*this); } + evaluator argImpl; + }; + + Data m_d; +}; + +// -------------------- CwiseTernaryOp -------------------- + +// this is a ternary expression +template +struct evaluator > + : public ternary_evaluator > +{ + typedef CwiseTernaryOp XprType; + typedef ternary_evaluator > Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) : Base(xpr) {} +}; + +template +struct ternary_evaluator, IndexBased, IndexBased> + : evaluator_base > +{ + typedef CwiseTernaryOp XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, + + Arg1Flags = evaluator::Flags, + Arg2Flags = evaluator::Flags, + Arg3Flags = evaluator::Flags, + SameType = is_same::value && is_same::value, + StorageOrdersAgree = (int(Arg1Flags)&RowMajorBit)==(int(Arg2Flags)&RowMajorBit) && (int(Arg1Flags)&RowMajorBit)==(int(Arg3Flags)&RowMajorBit), + Flags0 = (int(Arg1Flags) | int(Arg2Flags) | int(Arg3Flags)) & ( + HereditaryBits + | (int(Arg1Flags) & int(Arg2Flags) & int(Arg3Flags) & + ( (StorageOrdersAgree ? LinearAccessBit : 0) + | (functor_traits::PacketAccess && StorageOrdersAgree && SameType ? PacketAccessBit : 0) + ) + ) + ), + Flags = (Flags0 & ~RowMajorBit) | (Arg1Flags & RowMajorBit), + Alignment = EIGEN_PLAIN_ENUM_MIN( + EIGEN_PLAIN_ENUM_MIN(evaluator::Alignment, evaluator::Alignment), + evaluator::Alignment) + }; + + EIGEN_DEVICE_FUNC explicit ternary_evaluator(const XprType& xpr) : m_d(xpr) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_d.func()(m_d.arg1Impl.coeff(row, col), m_d.arg2Impl.coeff(row, col), m_d.arg3Impl.coeff(row, col)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_d.func()(m_d.arg1Impl.coeff(index), m_d.arg2Impl.coeff(index), m_d.arg3Impl.coeff(index)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + return m_d.func().packetOp(m_d.arg1Impl.template packet(row, col), + m_d.arg2Impl.template packet(row, col), + m_d.arg3Impl.template packet(row, col)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return m_d.func().packetOp(m_d.arg1Impl.template packet(index), + m_d.arg2Impl.template packet(index), + m_d.arg3Impl.template packet(index)); + } + +protected: + // this helper permits to completely eliminate the functor if it is empty + struct Data : private TernaryOp + { + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Data(const XprType& xpr) : TernaryOp(xpr.functor()), arg1Impl(xpr.arg1()), arg2Impl(xpr.arg2()), arg3Impl(xpr.arg3()) {} + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const TernaryOp& func() const { return static_cast(*this); } + evaluator arg1Impl; + evaluator arg2Impl; + evaluator arg3Impl; + }; + + Data m_d; +}; + +// -------------------- CwiseBinaryOp -------------------- + +// this is a binary expression +template +struct evaluator > + : public binary_evaluator > +{ + typedef CwiseBinaryOp XprType; + typedef binary_evaluator > Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) : Base(xpr) {} +}; + +template +struct binary_evaluator, IndexBased, IndexBased> + : evaluator_base > +{ + typedef CwiseBinaryOp XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, + + LhsFlags = evaluator::Flags, + RhsFlags = evaluator::Flags, + SameType = is_same::value, + StorageOrdersAgree = (int(LhsFlags)&RowMajorBit)==(int(RhsFlags)&RowMajorBit), + Flags0 = (int(LhsFlags) | int(RhsFlags)) & ( + HereditaryBits + | (int(LhsFlags) & int(RhsFlags) & + ( (StorageOrdersAgree ? LinearAccessBit : 0) + | (functor_traits::PacketAccess && StorageOrdersAgree && SameType ? PacketAccessBit : 0) + ) + ) + ), + Flags = (Flags0 & ~RowMajorBit) | (LhsFlags & RowMajorBit), + Alignment = EIGEN_PLAIN_ENUM_MIN(evaluator::Alignment,evaluator::Alignment) + }; + + EIGEN_DEVICE_FUNC explicit binary_evaluator(const XprType& xpr) : m_d(xpr) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_d.func()(m_d.lhsImpl.coeff(row, col), m_d.rhsImpl.coeff(row, col)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_d.func()(m_d.lhsImpl.coeff(index), m_d.rhsImpl.coeff(index)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + return m_d.func().packetOp(m_d.lhsImpl.template packet(row, col), + m_d.rhsImpl.template packet(row, col)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return m_d.func().packetOp(m_d.lhsImpl.template packet(index), + m_d.rhsImpl.template packet(index)); + } + +protected: + + // this helper permits to completely eliminate the functor if it is empty + struct Data : private BinaryOp + { + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Data(const XprType& xpr) : BinaryOp(xpr.functor()), lhsImpl(xpr.lhs()), rhsImpl(xpr.rhs()) {} + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const BinaryOp& func() const { return static_cast(*this); } + evaluator lhsImpl; + evaluator rhsImpl; + }; + + Data m_d; +}; + +// -------------------- CwiseUnaryView -------------------- + +template +struct unary_evaluator, IndexBased> + : evaluator_base > +{ + typedef CwiseUnaryView XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost + functor_traits::Cost, + + Flags = (evaluator::Flags & (HereditaryBits | LinearAccessBit | DirectAccessBit)), + + Alignment = 0 // FIXME it is not very clear why alignment is necessarily lost... + }; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& op) : m_d(op) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_d.func()(m_d.argImpl.coeff(row, col)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_d.func()(m_d.argImpl.coeff(index)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_d.func()(m_d.argImpl.coeffRef(row, col)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + return m_d.func()(m_d.argImpl.coeffRef(index)); + } + +protected: + + // this helper permits to completely eliminate the functor if it is empty + struct Data : private UnaryOp + { + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Data(const XprType& xpr) : UnaryOp(xpr.functor()), argImpl(xpr.nestedExpression()) {} + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const UnaryOp& func() const { return static_cast(*this); } + evaluator argImpl; + }; + + Data m_d; +}; + +// -------------------- Map -------------------- + +// FIXME perhaps the PlainObjectType could be provided by Derived::PlainObject ? +// but that might complicate template specialization +template +struct mapbase_evaluator; + +template +struct mapbase_evaluator : evaluator_base +{ + typedef Derived XprType; + typedef typename XprType::PointerType PointerType; + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + enum { + IsRowMajor = XprType::RowsAtCompileTime, + ColsAtCompileTime = XprType::ColsAtCompileTime, + CoeffReadCost = NumTraits::ReadCost + }; + + EIGEN_DEVICE_FUNC explicit mapbase_evaluator(const XprType& map) + : m_data(const_cast(map.data())), + m_innerStride(map.innerStride()), + m_outerStride(map.outerStride()) + { + EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(evaluator::Flags&PacketAccessBit, internal::inner_stride_at_compile_time::ret==1), + PACKET_ACCESS_REQUIRES_TO_HAVE_INNER_STRIDE_FIXED_TO_1); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_data[col * colStride() + row * rowStride()]; + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_data[index * m_innerStride.value()]; + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_data[col * colStride() + row * rowStride()]; + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + return m_data[index * m_innerStride.value()]; + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + PointerType ptr = m_data + row * rowStride() + col * colStride(); + return internal::ploadt(ptr); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return internal::ploadt(m_data + index * m_innerStride.value()); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index row, Index col, const PacketType& x) + { + PointerType ptr = m_data + row * rowStride() + col * colStride(); + return internal::pstoret(ptr, x); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index index, const PacketType& x) + { + internal::pstoret(m_data + index * m_innerStride.value(), x); + } +protected: + EIGEN_DEVICE_FUNC + inline Index rowStride() const { return XprType::IsRowMajor ? m_outerStride.value() : m_innerStride.value(); } + EIGEN_DEVICE_FUNC + inline Index colStride() const { return XprType::IsRowMajor ? m_innerStride.value() : m_outerStride.value(); } + + PointerType m_data; + const internal::variable_if_dynamic m_innerStride; + const internal::variable_if_dynamic m_outerStride; +}; + +template +struct evaluator > + : public mapbase_evaluator, PlainObjectType> +{ + typedef Map XprType; + typedef typename XprType::Scalar Scalar; + // TODO: should check for smaller packet types once we can handle multi-sized packet types + typedef typename packet_traits::type PacketScalar; + + enum { + InnerStrideAtCompileTime = StrideType::InnerStrideAtCompileTime == 0 + ? int(PlainObjectType::InnerStrideAtCompileTime) + : int(StrideType::InnerStrideAtCompileTime), + OuterStrideAtCompileTime = StrideType::OuterStrideAtCompileTime == 0 + ? int(PlainObjectType::OuterStrideAtCompileTime) + : int(StrideType::OuterStrideAtCompileTime), + HasNoInnerStride = InnerStrideAtCompileTime == 1, + HasNoOuterStride = StrideType::OuterStrideAtCompileTime == 0, + HasNoStride = HasNoInnerStride && HasNoOuterStride, + IsDynamicSize = PlainObjectType::SizeAtCompileTime==Dynamic, + + PacketAccessMask = bool(HasNoInnerStride) ? ~int(0) : ~int(PacketAccessBit), + LinearAccessMask = bool(HasNoStride) || bool(PlainObjectType::IsVectorAtCompileTime) ? ~int(0) : ~int(LinearAccessBit), + Flags = int( evaluator::Flags) & (LinearAccessMask&PacketAccessMask), + + Alignment = int(MapOptions)&int(AlignedMask) + }; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& map) + : mapbase_evaluator(map) + { } +}; + +// -------------------- Ref -------------------- + +template +struct evaluator > + : public mapbase_evaluator, PlainObjectType> +{ + typedef Ref XprType; + + enum { + Flags = evaluator >::Flags, + Alignment = evaluator >::Alignment + }; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& ref) + : mapbase_evaluator(ref) + { } +}; + +// -------------------- Block -------------------- + +template::ret> struct block_evaluator; + +template +struct evaluator > + : block_evaluator +{ + typedef Block XprType; + typedef typename XprType::Scalar Scalar; + // TODO: should check for smaller packet types once we can handle multi-sized packet types + typedef typename packet_traits::type PacketScalar; + + enum { + CoeffReadCost = evaluator::CoeffReadCost, + + RowsAtCompileTime = traits::RowsAtCompileTime, + ColsAtCompileTime = traits::ColsAtCompileTime, + MaxRowsAtCompileTime = traits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = traits::MaxColsAtCompileTime, + + ArgTypeIsRowMajor = (int(evaluator::Flags)&RowMajorBit) != 0, + IsRowMajor = (MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1) ? 1 + : (MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1) ? 0 + : ArgTypeIsRowMajor, + HasSameStorageOrderAsArgType = (IsRowMajor == ArgTypeIsRowMajor), + InnerSize = IsRowMajor ? int(ColsAtCompileTime) : int(RowsAtCompileTime), + InnerStrideAtCompileTime = HasSameStorageOrderAsArgType + ? int(inner_stride_at_compile_time::ret) + : int(outer_stride_at_compile_time::ret), + OuterStrideAtCompileTime = HasSameStorageOrderAsArgType + ? int(outer_stride_at_compile_time::ret) + : int(inner_stride_at_compile_time::ret), + MaskPacketAccessBit = (InnerStrideAtCompileTime == 1 || HasSameStorageOrderAsArgType) ? PacketAccessBit : 0, + + FlagsLinearAccessBit = (RowsAtCompileTime == 1 || ColsAtCompileTime == 1 || (InnerPanel && (evaluator::Flags&LinearAccessBit))) ? LinearAccessBit : 0, + FlagsRowMajorBit = XprType::Flags&RowMajorBit, + Flags0 = evaluator::Flags & ( (HereditaryBits & ~RowMajorBit) | + DirectAccessBit | + MaskPacketAccessBit), + Flags = Flags0 | FlagsLinearAccessBit | FlagsRowMajorBit, + + PacketAlignment = unpacket_traits::alignment, + Alignment0 = (InnerPanel && (OuterStrideAtCompileTime!=Dynamic) + && (OuterStrideAtCompileTime!=0) + && (((OuterStrideAtCompileTime * int(sizeof(Scalar))) % int(PacketAlignment)) == 0)) ? int(PacketAlignment) : 0, + Alignment = EIGEN_PLAIN_ENUM_MIN(evaluator::Alignment, Alignment0) + }; + typedef block_evaluator block_evaluator_type; + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& block) : block_evaluator_type(block) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } +}; + +// no direct-access => dispatch to a unary evaluator +template +struct block_evaluator + : unary_evaluator > +{ + typedef Block XprType; + + EIGEN_DEVICE_FUNC explicit block_evaluator(const XprType& block) + : unary_evaluator(block) + {} +}; + +template +struct unary_evaluator, IndexBased> + : evaluator_base > +{ + typedef Block XprType; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& block) + : m_argImpl(block.nestedExpression()), + m_startRow(block.startRow()), + m_startCol(block.startCol()), + m_linear_offset(InnerPanel?(XprType::IsRowMajor ? block.startRow()*block.cols() : block.startCol()*block.rows()):0) + { } + + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + enum { + RowsAtCompileTime = XprType::RowsAtCompileTime + }; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_argImpl.coeff(m_startRow.value() + row, m_startCol.value() + col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + if (InnerPanel) + return m_argImpl.coeff(m_linear_offset.value() + index); + else + return coeff(RowsAtCompileTime == 1 ? 0 : index, RowsAtCompileTime == 1 ? index : 0); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_argImpl.coeffRef(m_startRow.value() + row, m_startCol.value() + col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + if (InnerPanel) + return m_argImpl.coeffRef(m_linear_offset.value() + index); + else + return coeffRef(RowsAtCompileTime == 1 ? 0 : index, RowsAtCompileTime == 1 ? index : 0); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + return m_argImpl.template packet(m_startRow.value() + row, m_startCol.value() + col); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + if (InnerPanel) + return m_argImpl.template packet(m_linear_offset.value() + index); + else + return packet(RowsAtCompileTime == 1 ? 0 : index, + RowsAtCompileTime == 1 ? index : 0); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index row, Index col, const PacketType& x) + { + return m_argImpl.template writePacket(m_startRow.value() + row, m_startCol.value() + col, x); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index index, const PacketType& x) + { + if (InnerPanel) + return m_argImpl.template writePacket(m_linear_offset.value() + index, x); + else + return writePacket(RowsAtCompileTime == 1 ? 0 : index, + RowsAtCompileTime == 1 ? index : 0, + x); + } + +protected: + evaluator m_argImpl; + const variable_if_dynamic m_startRow; + const variable_if_dynamic m_startCol; + const variable_if_dynamic m_linear_offset; +}; + +// TODO: This evaluator does not actually use the child evaluator; +// all action is via the data() as returned by the Block expression. + +template +struct block_evaluator + : mapbase_evaluator, + typename Block::PlainObject> +{ + typedef Block XprType; + typedef typename XprType::Scalar Scalar; + + EIGEN_DEVICE_FUNC explicit block_evaluator(const XprType& block) + : mapbase_evaluator(block) + { + // TODO: for the 3.3 release, this should be turned to an internal assertion, but let's keep it as is for the beta lifetime + eigen_assert(((internal::UIntPtr(block.data()) % EIGEN_PLAIN_ENUM_MAX(1,evaluator::Alignment)) == 0) && "data is not aligned"); + } +}; + + +// -------------------- Select -------------------- +// NOTE shall we introduce a ternary_evaluator? + +// TODO enable vectorization for Select +template +struct evaluator > + : evaluator_base > +{ + typedef Select XprType; + enum { + CoeffReadCost = evaluator::CoeffReadCost + + EIGEN_PLAIN_ENUM_MAX(evaluator::CoeffReadCost, + evaluator::CoeffReadCost), + + Flags = (unsigned int)evaluator::Flags & evaluator::Flags & HereditaryBits, + + Alignment = EIGEN_PLAIN_ENUM_MIN(evaluator::Alignment, evaluator::Alignment) + }; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& select) + : m_conditionImpl(select.conditionMatrix()), + m_thenImpl(select.thenMatrix()), + m_elseImpl(select.elseMatrix()) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + if (m_conditionImpl.coeff(row, col)) + return m_thenImpl.coeff(row, col); + else + return m_elseImpl.coeff(row, col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + if (m_conditionImpl.coeff(index)) + return m_thenImpl.coeff(index); + else + return m_elseImpl.coeff(index); + } + +protected: + evaluator m_conditionImpl; + evaluator m_thenImpl; + evaluator m_elseImpl; +}; + + +// -------------------- Replicate -------------------- + +template +struct unary_evaluator > + : evaluator_base > +{ + typedef Replicate XprType; + typedef typename XprType::CoeffReturnType CoeffReturnType; + enum { + Factor = (RowFactor==Dynamic || ColFactor==Dynamic) ? Dynamic : RowFactor*ColFactor + }; + typedef typename internal::nested_eval::type ArgTypeNested; + typedef typename internal::remove_all::type ArgTypeNestedCleaned; + + enum { + CoeffReadCost = evaluator::CoeffReadCost, + LinearAccessMask = XprType::IsVectorAtCompileTime ? LinearAccessBit : 0, + Flags = (evaluator::Flags & (HereditaryBits|LinearAccessMask) & ~RowMajorBit) | (traits::Flags & RowMajorBit), + + Alignment = evaluator::Alignment + }; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& replicate) + : m_arg(replicate.nestedExpression()), + m_argImpl(m_arg), + m_rows(replicate.nestedExpression().rows()), + m_cols(replicate.nestedExpression().cols()) + {} + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + // try to avoid using modulo; this is a pure optimization strategy + const Index actual_row = internal::traits::RowsAtCompileTime==1 ? 0 + : RowFactor==1 ? row + : row % m_rows.value(); + const Index actual_col = internal::traits::ColsAtCompileTime==1 ? 0 + : ColFactor==1 ? col + : col % m_cols.value(); + + return m_argImpl.coeff(actual_row, actual_col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + // try to avoid using modulo; this is a pure optimization strategy + const Index actual_index = internal::traits::RowsAtCompileTime==1 + ? (ColFactor==1 ? index : index%m_cols.value()) + : (RowFactor==1 ? index : index%m_rows.value()); + + return m_argImpl.coeff(actual_index); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + const Index actual_row = internal::traits::RowsAtCompileTime==1 ? 0 + : RowFactor==1 ? row + : row % m_rows.value(); + const Index actual_col = internal::traits::ColsAtCompileTime==1 ? 0 + : ColFactor==1 ? col + : col % m_cols.value(); + + return m_argImpl.template packet(actual_row, actual_col); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + const Index actual_index = internal::traits::RowsAtCompileTime==1 + ? (ColFactor==1 ? index : index%m_cols.value()) + : (RowFactor==1 ? index : index%m_rows.value()); + + return m_argImpl.template packet(actual_index); + } + +protected: + const ArgTypeNested m_arg; + evaluator m_argImpl; + const variable_if_dynamic m_rows; + const variable_if_dynamic m_cols; +}; + + +// -------------------- PartialReduxExpr -------------------- + +template< typename ArgType, typename MemberOp, int Direction> +struct evaluator > + : evaluator_base > +{ + typedef PartialReduxExpr XprType; + typedef typename internal::nested_eval::type ArgTypeNested; + typedef typename internal::remove_all::type ArgTypeNestedCleaned; + typedef typename ArgType::Scalar InputScalar; + typedef typename XprType::Scalar Scalar; + enum { + TraversalSize = Direction==int(Vertical) ? int(ArgType::RowsAtCompileTime) : int(ArgType::ColsAtCompileTime) + }; + typedef typename MemberOp::template Cost CostOpType; + enum { + CoeffReadCost = TraversalSize==Dynamic ? HugeCost + : TraversalSize * evaluator::CoeffReadCost + int(CostOpType::value), + + Flags = (traits::Flags&RowMajorBit) | (evaluator::Flags&(HereditaryBits&(~RowMajorBit))) | LinearAccessBit, + + Alignment = 0 // FIXME this will need to be improved once PartialReduxExpr is vectorized + }; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType xpr) + : m_arg(xpr.nestedExpression()), m_functor(xpr.functor()) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(TraversalSize==Dynamic ? HugeCost : int(CostOpType::value)); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const Scalar coeff(Index i, Index j) const + { + if (Direction==Vertical) + return m_functor(m_arg.col(j)); + else + return m_functor(m_arg.row(i)); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const Scalar coeff(Index index) const + { + if (Direction==Vertical) + return m_functor(m_arg.col(index)); + else + return m_functor(m_arg.row(index)); + } + +protected: + typename internal::add_const_on_value_type::type m_arg; + const MemberOp m_functor; +}; + + +// -------------------- MatrixWrapper and ArrayWrapper -------------------- +// +// evaluator_wrapper_base is a common base class for the +// MatrixWrapper and ArrayWrapper evaluators. + +template +struct evaluator_wrapper_base + : evaluator_base +{ + typedef typename remove_all::type ArgType; + enum { + CoeffReadCost = evaluator::CoeffReadCost, + Flags = evaluator::Flags, + Alignment = evaluator::Alignment + }; + + EIGEN_DEVICE_FUNC explicit evaluator_wrapper_base(const ArgType& arg) : m_argImpl(arg) {} + + typedef typename ArgType::Scalar Scalar; + typedef typename ArgType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_argImpl.coeff(row, col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_argImpl.coeff(index); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_argImpl.coeffRef(row, col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + return m_argImpl.coeffRef(index); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + return m_argImpl.template packet(row, col); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + return m_argImpl.template packet(index); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index row, Index col, const PacketType& x) + { + m_argImpl.template writePacket(row, col, x); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index index, const PacketType& x) + { + m_argImpl.template writePacket(index, x); + } + +protected: + evaluator m_argImpl; +}; + +template +struct unary_evaluator > + : evaluator_wrapper_base > +{ + typedef MatrixWrapper XprType; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& wrapper) + : evaluator_wrapper_base >(wrapper.nestedExpression()) + { } +}; + +template +struct unary_evaluator > + : evaluator_wrapper_base > +{ + typedef ArrayWrapper XprType; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& wrapper) + : evaluator_wrapper_base >(wrapper.nestedExpression()) + { } +}; + + +// -------------------- Reverse -------------------- + +// defined in Reverse.h: +template struct reverse_packet_cond; + +template +struct unary_evaluator > + : evaluator_base > +{ + typedef Reverse XprType; + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + enum { + IsRowMajor = XprType::IsRowMajor, + IsColMajor = !IsRowMajor, + ReverseRow = (Direction == Vertical) || (Direction == BothDirections), + ReverseCol = (Direction == Horizontal) || (Direction == BothDirections), + ReversePacket = (Direction == BothDirections) + || ((Direction == Vertical) && IsColMajor) + || ((Direction == Horizontal) && IsRowMajor), + + CoeffReadCost = evaluator::CoeffReadCost, + + // let's enable LinearAccess only with vectorization because of the product overhead + // FIXME enable DirectAccess with negative strides? + Flags0 = evaluator::Flags, + LinearAccess = ( (Direction==BothDirections) && (int(Flags0)&PacketAccessBit) ) + || ((ReverseRow && XprType::ColsAtCompileTime==1) || (ReverseCol && XprType::RowsAtCompileTime==1)) + ? LinearAccessBit : 0, + + Flags = int(Flags0) & (HereditaryBits | PacketAccessBit | LinearAccess), + + Alignment = 0 // FIXME in some rare cases, Alignment could be preserved, like a Vector4f. + }; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& reverse) + : m_argImpl(reverse.nestedExpression()), + m_rows(ReverseRow ? reverse.nestedExpression().rows() : 1), + m_cols(ReverseCol ? reverse.nestedExpression().cols() : 1) + { } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_argImpl.coeff(ReverseRow ? m_rows.value() - row - 1 : row, + ReverseCol ? m_cols.value() - col - 1 : col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_argImpl.coeff(m_rows.value() * m_cols.value() - index - 1); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_argImpl.coeffRef(ReverseRow ? m_rows.value() - row - 1 : row, + ReverseCol ? m_cols.value() - col - 1 : col); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + return m_argImpl.coeffRef(m_rows.value() * m_cols.value() - index - 1); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index row, Index col) const + { + enum { + PacketSize = unpacket_traits::size, + OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1, + OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1 + }; + typedef internal::reverse_packet_cond reverse_packet; + return reverse_packet::run(m_argImpl.template packet( + ReverseRow ? m_rows.value() - row - OffsetRow : row, + ReverseCol ? m_cols.value() - col - OffsetCol : col)); + } + + template + EIGEN_STRONG_INLINE + PacketType packet(Index index) const + { + enum { PacketSize = unpacket_traits::size }; + return preverse(m_argImpl.template packet(m_rows.value() * m_cols.value() - index - PacketSize)); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index row, Index col, const PacketType& x) + { + // FIXME we could factorize some code with packet(i,j) + enum { + PacketSize = unpacket_traits::size, + OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1, + OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1 + }; + typedef internal::reverse_packet_cond reverse_packet; + m_argImpl.template writePacket( + ReverseRow ? m_rows.value() - row - OffsetRow : row, + ReverseCol ? m_cols.value() - col - OffsetCol : col, + reverse_packet::run(x)); + } + + template + EIGEN_STRONG_INLINE + void writePacket(Index index, const PacketType& x) + { + enum { PacketSize = unpacket_traits::size }; + m_argImpl.template writePacket + (m_rows.value() * m_cols.value() - index - PacketSize, preverse(x)); + } + +protected: + evaluator m_argImpl; + + // If we do not reverse rows, then we do not need to know the number of rows; same for columns + // Nonetheless, in this case it is important to set to 1 such that the coeff(index) method works fine for vectors. + const variable_if_dynamic m_rows; + const variable_if_dynamic m_cols; +}; + + +// -------------------- Diagonal -------------------- + +template +struct evaluator > + : evaluator_base > +{ + typedef Diagonal XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost, + + Flags = (unsigned int)(evaluator::Flags & (HereditaryBits | DirectAccessBit) & ~RowMajorBit) | LinearAccessBit, + + Alignment = 0 + }; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& diagonal) + : m_argImpl(diagonal.nestedExpression()), + m_index(diagonal.index()) + { } + + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index) const + { + return m_argImpl.coeff(row + rowOffset(), row + colOffset()); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index index) const + { + return m_argImpl.coeff(index + rowOffset(), index + colOffset()); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index) + { + return m_argImpl.coeffRef(row + rowOffset(), row + colOffset()); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index index) + { + return m_argImpl.coeffRef(index + rowOffset(), index + colOffset()); + } + +protected: + evaluator m_argImpl; + const internal::variable_if_dynamicindex m_index; + +private: + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Index rowOffset() const { return m_index.value() > 0 ? 0 : -m_index.value(); } + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Index colOffset() const { return m_index.value() > 0 ? m_index.value() : 0; } +}; + + +//---------------------------------------------------------------------- +// deprecated code +//---------------------------------------------------------------------- + +// -------------------- EvalToTemp -------------------- + +// expression class for evaluating nested expression to a temporary + +template class EvalToTemp; + +template +struct traits > + : public traits +{ }; + +template +class EvalToTemp + : public dense_xpr_base >::type +{ + public: + + typedef typename dense_xpr_base::type Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(EvalToTemp) + + explicit EvalToTemp(const ArgType& arg) + : m_arg(arg) + { } + + const ArgType& arg() const + { + return m_arg; + } + + Index rows() const + { + return m_arg.rows(); + } + + Index cols() const + { + return m_arg.cols(); + } + + private: + const ArgType& m_arg; +}; + +template +struct evaluator > + : public evaluator +{ + typedef EvalToTemp XprType; + typedef typename ArgType::PlainObject PlainObject; + typedef evaluator Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) + : m_result(xpr.arg()) + { + ::new (static_cast(this)) Base(m_result); + } + + // This constructor is used when nesting an EvalTo evaluator in another evaluator + EIGEN_DEVICE_FUNC evaluator(const ArgType& arg) + : m_result(arg) + { + ::new (static_cast(this)) Base(m_result); + } + +protected: + PlainObject m_result; +}; + +} // namespace internal + +} // end namespace Eigen + +#endif // EIGEN_COREEVALUATORS_H diff --git a/Eigen/src/Core/CoreIterators.h b/Eigen/src/Core/CoreIterators.h new file mode 100644 index 000000000..b96719681 --- /dev/null +++ b/Eigen/src/Core/CoreIterators.h @@ -0,0 +1,132 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2014 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_COREITERATORS_H +#define EIGEN_COREITERATORS_H + +namespace Eigen { + +/* This file contains the respective InnerIterator definition of the expressions defined in Eigen/Core + */ + +namespace internal { + +template +class inner_iterator_selector; + +} + +/** \class InnerIterator + * \brief An InnerIterator allows to loop over the element of any matrix expression. + * + * \warning To be used with care because an evaluator is constructed every time an InnerIterator iterator is constructed. + * + * TODO: add a usage example + */ +template +class InnerIterator +{ +protected: + typedef internal::inner_iterator_selector::Kind> IteratorType; + typedef internal::evaluator EvaluatorType; + typedef typename internal::traits::Scalar Scalar; +public: + /** Construct an iterator over the \a outerId -th row or column of \a xpr */ + InnerIterator(const XprType &xpr, const Index &outerId) + : m_eval(xpr), m_iter(m_eval, outerId, xpr.innerSize()) + {} + + /// \returns the value of the current coefficient. + EIGEN_STRONG_INLINE Scalar value() const { return m_iter.value(); } + /** Increment the iterator \c *this to the next non-zero coefficient. + * Explicit zeros are not skipped over. To skip explicit zeros, see class SparseView + */ + EIGEN_STRONG_INLINE InnerIterator& operator++() { m_iter.operator++(); return *this; } + EIGEN_STRONG_INLINE InnerIterator& operator+=(Index i) { m_iter.operator+=(i); return *this; } + EIGEN_STRONG_INLINE InnerIterator operator+(Index i) + { InnerIterator result(*this); result+=i; return result; } + + + /// \returns the column or row index of the current coefficient. + EIGEN_STRONG_INLINE Index index() const { return m_iter.index(); } + /// \returns the row index of the current coefficient. + EIGEN_STRONG_INLINE Index row() const { return m_iter.row(); } + /// \returns the column index of the current coefficient. + EIGEN_STRONG_INLINE Index col() const { return m_iter.col(); } + /// \returns \c true if the iterator \c *this still references a valid coefficient. + EIGEN_STRONG_INLINE operator bool() const { return m_iter; } + +protected: + EvaluatorType m_eval; + IteratorType m_iter; +private: + // If you get here, then you're not using the right InnerIterator type, e.g.: + // SparseMatrix A; + // SparseMatrix::InnerIterator it(A,0); + template InnerIterator(const EigenBase&,Index outer); +}; + +namespace internal { + +// Generic inner iterator implementation for dense objects +template +class inner_iterator_selector +{ +protected: + typedef evaluator EvaluatorType; + typedef typename traits::Scalar Scalar; + enum { IsRowMajor = (XprType::Flags&RowMajorBit)==RowMajorBit }; + +public: + EIGEN_STRONG_INLINE inner_iterator_selector(const EvaluatorType &eval, const Index &outerId, const Index &innerSize) + : m_eval(eval), m_inner(0), m_outer(outerId), m_end(innerSize) + {} + + EIGEN_STRONG_INLINE Scalar value() const + { + return (IsRowMajor) ? m_eval.coeff(m_outer, m_inner) + : m_eval.coeff(m_inner, m_outer); + } + + EIGEN_STRONG_INLINE inner_iterator_selector& operator++() { m_inner++; return *this; } + + EIGEN_STRONG_INLINE Index index() const { return m_inner; } + inline Index row() const { return IsRowMajor ? m_outer : index(); } + inline Index col() const { return IsRowMajor ? index() : m_outer; } + + EIGEN_STRONG_INLINE operator bool() const { return m_inner < m_end && m_inner>=0; } + +protected: + const EvaluatorType& m_eval; + Index m_inner; + const Index m_outer; + const Index m_end; +}; + +// For iterator-based evaluator, inner-iterator is already implemented as +// evaluator<>::InnerIterator +template +class inner_iterator_selector + : public evaluator::InnerIterator +{ +protected: + typedef typename evaluator::InnerIterator Base; + typedef evaluator EvaluatorType; + +public: + EIGEN_STRONG_INLINE inner_iterator_selector(const EvaluatorType &eval, const Index &outerId, const Index &/*innerSize*/) + : Base(eval, outerId) + {} +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_COREITERATORS_H diff --git a/Eigen/src/Core/CwiseBinaryOp.h b/Eigen/src/Core/CwiseBinaryOp.h new file mode 100644 index 000000000..bf2632d9e --- /dev/null +++ b/Eigen/src/Core/CwiseBinaryOp.h @@ -0,0 +1,183 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2014 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CWISE_BINARY_OP_H +#define EIGEN_CWISE_BINARY_OP_H + +namespace Eigen { + +namespace internal { +template +struct traits > +{ + // we must not inherit from traits since it has + // the potential to cause problems with MSVC + typedef typename remove_all::type Ancestor; + typedef typename traits::XprKind XprKind; + enum { + RowsAtCompileTime = traits::RowsAtCompileTime, + ColsAtCompileTime = traits::ColsAtCompileTime, + MaxRowsAtCompileTime = traits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = traits::MaxColsAtCompileTime + }; + + // even though we require Lhs and Rhs to have the same scalar type (see CwiseBinaryOp constructor), + // we still want to handle the case when the result type is different. + typedef typename result_of< + BinaryOp( + const typename Lhs::Scalar&, + const typename Rhs::Scalar& + ) + >::type Scalar; + typedef typename cwise_promote_storage_type::StorageKind, + typename traits::StorageKind, + BinaryOp>::ret StorageKind; + typedef typename promote_index_type::StorageIndex, + typename traits::StorageIndex>::type StorageIndex; + typedef typename Lhs::Nested LhsNested; + typedef typename Rhs::Nested RhsNested; + typedef typename remove_reference::type _LhsNested; + typedef typename remove_reference::type _RhsNested; + enum { + Flags = cwise_promote_storage_order::StorageKind,typename traits::StorageKind,_LhsNested::Flags & RowMajorBit,_RhsNested::Flags & RowMajorBit>::value + }; +}; +} // end namespace internal + +template +class CwiseBinaryOpImpl; + +/** \class CwiseBinaryOp + * \ingroup Core_Module + * + * \brief Generic expression where a coefficient-wise binary operator is applied to two expressions + * + * \tparam BinaryOp template functor implementing the operator + * \tparam LhsType the type of the left-hand side + * \tparam RhsType the type of the right-hand side + * + * This class represents an expression where a coefficient-wise binary operator is applied to two expressions. + * It is the return type of binary operators, by which we mean only those binary operators where + * both the left-hand side and the right-hand side are Eigen expressions. + * For example, the return type of matrix1+matrix2 is a CwiseBinaryOp. + * + * Most of the time, this is the only way that it is used, so you typically don't have to name + * CwiseBinaryOp types explicitly. + * + * \sa MatrixBase::binaryExpr(const MatrixBase &,const CustomBinaryOp &) const, class CwiseUnaryOp, class CwiseNullaryOp + */ +template +class CwiseBinaryOp : + public CwiseBinaryOpImpl< + BinaryOp, LhsType, RhsType, + typename internal::cwise_promote_storage_type::StorageKind, + typename internal::traits::StorageKind, + BinaryOp>::ret>, + internal::no_assignment_operator +{ + public: + + typedef typename internal::remove_all::type Functor; + typedef typename internal::remove_all::type Lhs; + typedef typename internal::remove_all::type Rhs; + + typedef typename CwiseBinaryOpImpl< + BinaryOp, LhsType, RhsType, + typename internal::cwise_promote_storage_type::StorageKind, + typename internal::traits::StorageKind, + BinaryOp>::ret>::Base Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(CwiseBinaryOp) + + typedef typename internal::ref_selector::type LhsNested; + typedef typename internal::ref_selector::type RhsNested; + typedef typename internal::remove_reference::type _LhsNested; + typedef typename internal::remove_reference::type _RhsNested; + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CwiseBinaryOp(const Lhs& aLhs, const Rhs& aRhs, const BinaryOp& func = BinaryOp()) + : m_lhs(aLhs), m_rhs(aRhs), m_functor(func) + { + EIGEN_CHECK_BINARY_COMPATIBILIY(BinaryOp,typename Lhs::Scalar,typename Rhs::Scalar); + // require the sizes to match + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(Lhs, Rhs) + eigen_assert(aLhs.rows() == aRhs.rows() && aLhs.cols() == aRhs.cols()); + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index rows() const { + // return the fixed size type if available to enable compile time optimizations + if (internal::traits::type>::RowsAtCompileTime==Dynamic) + return m_rhs.rows(); + else + return m_lhs.rows(); + } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index cols() const { + // return the fixed size type if available to enable compile time optimizations + if (internal::traits::type>::ColsAtCompileTime==Dynamic) + return m_rhs.cols(); + else + return m_lhs.cols(); + } + + /** \returns the left hand side nested expression */ + EIGEN_DEVICE_FUNC + const _LhsNested& lhs() const { return m_lhs; } + /** \returns the right hand side nested expression */ + EIGEN_DEVICE_FUNC + const _RhsNested& rhs() const { return m_rhs; } + /** \returns the functor representing the binary operation */ + EIGEN_DEVICE_FUNC + const BinaryOp& functor() const { return m_functor; } + + protected: + LhsNested m_lhs; + RhsNested m_rhs; + const BinaryOp m_functor; +}; + +// Generic API dispatcher +template +class CwiseBinaryOpImpl + : public internal::generic_xpr_base >::type +{ +public: + typedef typename internal::generic_xpr_base >::type Base; +}; + +/** replaces \c *this by \c *this - \a other. + * + * \returns a reference to \c *this + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived & +MatrixBase::operator-=(const MatrixBase &other) +{ + call_assignment(derived(), other.derived(), internal::sub_assign_op()); + return derived(); +} + +/** replaces \c *this by \c *this + \a other. + * + * \returns a reference to \c *this + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived & +MatrixBase::operator+=(const MatrixBase& other) +{ + call_assignment(derived(), other.derived(), internal::add_assign_op()); + return derived(); +} + +} // end namespace Eigen + +#endif // EIGEN_CWISE_BINARY_OP_H diff --git a/Eigen/src/Core/CwiseNullaryOp.h b/Eigen/src/Core/CwiseNullaryOp.h new file mode 100644 index 000000000..b1923da0f --- /dev/null +++ b/Eigen/src/Core/CwiseNullaryOp.h @@ -0,0 +1,902 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CWISE_NULLARY_OP_H +#define EIGEN_CWISE_NULLARY_OP_H + +namespace Eigen { + +namespace internal { +template +struct traits > : traits +{ + enum { + Flags = traits::Flags & RowMajorBit + }; +}; + +} // namespace internal + +/** \class CwiseNullaryOp + * \ingroup Core_Module + * + * \brief Generic expression of a matrix where all coefficients are defined by a functor + * + * \tparam NullaryOp template functor implementing the operator + * \tparam PlainObjectType the underlying plain matrix/array type + * + * This class represents an expression of a generic nullary operator. + * It is the return type of the Ones(), Zero(), Constant(), Identity() and Random() methods, + * and most of the time this is the only way it is used. + * + * However, if you want to write a function returning such an expression, you + * will need to use this class. + * + * The functor NullaryOp must expose one of the following method: + + + + +
\c operator()() if the procedural generation does not depend on the coefficient entries (e.g., random numbers)
\c operator()(Index i)if the procedural generation makes sense for vectors only and that it depends on the coefficient index \c i (e.g., linspace)
\c operator()(Index i,Index j)if the procedural generation depends on the matrix coordinates \c i, \c j (e.g., to generate a checkerboard with 0 and 1)
+ * It is also possible to expose the last two operators if the generation makes sense for matrices but can be optimized for vectors. + * + * See DenseBase::NullaryExpr(Index,const CustomNullaryOp&) for an example binding + * C++11 random number generators. + * + * A nullary expression can also be used to implement custom sophisticated matrix manipulations + * that cannot be covered by the existing set of natively supported matrix manipulations. + * See this \ref TopicCustomizing_NullaryExpr "page" for some examples and additional explanations + * on the behavior of CwiseNullaryOp. + * + * \sa class CwiseUnaryOp, class CwiseBinaryOp, DenseBase::NullaryExpr + */ +template +class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp >::type, internal::no_assignment_operator +{ + public: + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(CwiseNullaryOp) + + EIGEN_DEVICE_FUNC + CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp()) + : m_rows(rows), m_cols(cols), m_functor(func) + { + eigen_assert(rows >= 0 + && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows) + && cols >= 0 + && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols)); + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index rows() const { return m_rows.value(); } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index cols() const { return m_cols.value(); } + + /** \returns the functor representing the nullary operation */ + EIGEN_DEVICE_FUNC + const NullaryOp& functor() const { return m_functor; } + + protected: + const internal::variable_if_dynamic m_rows; + const internal::variable_if_dynamic m_cols; + const NullaryOp m_functor; +}; + + +/** \returns an expression of a matrix defined by a custom functor \a func + * + * The parameters \a rows and \a cols are the number of rows and of columns of + * the returned matrix. Must be compatible with this MatrixBase type. + * + * This variant is meant to be used for dynamic-size matrix types. For fixed-size types, + * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used + * instead. + * + * The template parameter \a CustomNullaryOp is the type of the functor. + * + * \sa class CwiseNullaryOp + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const CwiseNullaryOp::PlainObject> +DenseBase::NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func) +{ + return CwiseNullaryOp(rows, cols, func); +} + +/** \returns an expression of a matrix defined by a custom functor \a func + * + * The parameter \a size is the size of the returned vector. + * Must be compatible with this MatrixBase type. + * + * \only_for_vectors + * + * This variant is meant to be used for dynamic-size vector types. For fixed-size types, + * it is redundant to pass \a size as argument, so Zero() should be used + * instead. + * + * The template parameter \a CustomNullaryOp is the type of the functor. + * + * Here is an example with C++11 random generators: \include random_cpp11.cpp + * Output: \verbinclude random_cpp11.out + * + * \sa class CwiseNullaryOp + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const CwiseNullaryOp::PlainObject> +DenseBase::NullaryExpr(Index size, const CustomNullaryOp& func) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + if(RowsAtCompileTime == 1) return CwiseNullaryOp(1, size, func); + else return CwiseNullaryOp(size, 1, func); +} + +/** \returns an expression of a matrix defined by a custom functor \a func + * + * This variant is only for fixed-size DenseBase types. For dynamic-size types, you + * need to use the variants taking size arguments. + * + * The template parameter \a CustomNullaryOp is the type of the functor. + * + * \sa class CwiseNullaryOp + */ +template +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const CwiseNullaryOp::PlainObject> +DenseBase::NullaryExpr(const CustomNullaryOp& func) +{ + return CwiseNullaryOp(RowsAtCompileTime, ColsAtCompileTime, func); +} + +/** \returns an expression of a constant matrix of value \a value + * + * The parameters \a rows and \a cols are the number of rows and of columns of + * the returned matrix. Must be compatible with this DenseBase type. + * + * This variant is meant to be used for dynamic-size matrix types. For fixed-size types, + * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used + * instead. + * + * The template parameter \a CustomNullaryOp is the type of the functor. + * + * \sa class CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Constant(Index rows, Index cols, const Scalar& value) +{ + return DenseBase::NullaryExpr(rows, cols, internal::scalar_constant_op(value)); +} + +/** \returns an expression of a constant matrix of value \a value + * + * The parameter \a size is the size of the returned vector. + * Must be compatible with this DenseBase type. + * + * \only_for_vectors + * + * This variant is meant to be used for dynamic-size vector types. For fixed-size types, + * it is redundant to pass \a size as argument, so Zero() should be used + * instead. + * + * The template parameter \a CustomNullaryOp is the type of the functor. + * + * \sa class CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Constant(Index size, const Scalar& value) +{ + return DenseBase::NullaryExpr(size, internal::scalar_constant_op(value)); +} + +/** \returns an expression of a constant matrix of value \a value + * + * This variant is only for fixed-size DenseBase types. For dynamic-size types, you + * need to use the variants taking size arguments. + * + * The template parameter \a CustomNullaryOp is the type of the functor. + * + * \sa class CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Constant(const Scalar& value) +{ + EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived) + return DenseBase::NullaryExpr(RowsAtCompileTime, ColsAtCompileTime, internal::scalar_constant_op(value)); +} + +/** \deprecated because of accuracy loss. In Eigen 3.3, it is an alias for LinSpaced(Index,const Scalar&,const Scalar&) + * + * \sa LinSpaced(Index,Scalar,Scalar), setLinSpaced(Index,const Scalar&,const Scalar&) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::RandomAccessLinSpacedReturnType +DenseBase::LinSpaced(Sequential_t, Index size, const Scalar& low, const Scalar& high) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + return DenseBase::NullaryExpr(size, internal::linspaced_op(low,high,size)); +} + +/** \deprecated because of accuracy loss. In Eigen 3.3, it is an alias for LinSpaced(const Scalar&,const Scalar&) + * + * \sa LinSpaced(Scalar,Scalar) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::RandomAccessLinSpacedReturnType +DenseBase::LinSpaced(Sequential_t, const Scalar& low, const Scalar& high) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived) + return DenseBase::NullaryExpr(Derived::SizeAtCompileTime, internal::linspaced_op(low,high,Derived::SizeAtCompileTime)); +} + +/** + * \brief Sets a linearly spaced vector. + * + * The function generates 'size' equally spaced values in the closed interval [low,high]. + * When size is set to 1, a vector of length 1 containing 'high' is returned. + * + * \only_for_vectors + * + * Example: \include DenseBase_LinSpaced.cpp + * Output: \verbinclude DenseBase_LinSpaced.out + * + * For integer scalar types, an even spacing is possible if and only if the length of the range, + * i.e., \c high-low is a scalar multiple of \c size-1, or if \c size is a scalar multiple of the + * number of values \c high-low+1 (meaning each value can be repeated the same number of time). + * If one of these two considions is not satisfied, then \c high is lowered to the largest value + * satisfying one of this constraint. + * Here are some examples: + * + * Example: \include DenseBase_LinSpacedInt.cpp + * Output: \verbinclude DenseBase_LinSpacedInt.out + * + * \sa setLinSpaced(Index,const Scalar&,const Scalar&), CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::RandomAccessLinSpacedReturnType +DenseBase::LinSpaced(Index size, const Scalar& low, const Scalar& high) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + return DenseBase::NullaryExpr(size, internal::linspaced_op(low,high,size)); +} + +/** + * \copydoc DenseBase::LinSpaced(Index, const Scalar&, const Scalar&) + * Special version for fixed size types which does not require the size parameter. + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::RandomAccessLinSpacedReturnType +DenseBase::LinSpaced(const Scalar& low, const Scalar& high) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived) + return DenseBase::NullaryExpr(Derived::SizeAtCompileTime, internal::linspaced_op(low,high,Derived::SizeAtCompileTime)); +} + +/** \returns true if all coefficients in this matrix are approximately equal to \a val, to within precision \a prec */ +template +EIGEN_DEVICE_FUNC bool DenseBase::isApproxToConstant +(const Scalar& val, const RealScalar& prec) const +{ + typename internal::nested_eval::type self(derived()); + for(Index j = 0; j < cols(); ++j) + for(Index i = 0; i < rows(); ++i) + if(!internal::isApprox(self.coeff(i, j), val, prec)) + return false; + return true; +} + +/** This is just an alias for isApproxToConstant(). + * + * \returns true if all coefficients in this matrix are approximately equal to \a value, to within precision \a prec */ +template +EIGEN_DEVICE_FUNC bool DenseBase::isConstant +(const Scalar& val, const RealScalar& prec) const +{ + return isApproxToConstant(val, prec); +} + +/** Alias for setConstant(): sets all coefficients in this expression to \a val. + * + * \sa setConstant(), Constant(), class CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void DenseBase::fill(const Scalar& val) +{ + setConstant(val); +} + +/** Sets all coefficients in this expression to value \a val. + * + * \sa fill(), setConstant(Index,const Scalar&), setConstant(Index,Index,const Scalar&), setZero(), setOnes(), Constant(), class CwiseNullaryOp, setZero(), setOnes() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::setConstant(const Scalar& val) +{ + return derived() = Constant(rows(), cols(), val); +} + +/** Resizes to the given \a size, and sets all coefficients in this expression to the given value \a val. + * + * \only_for_vectors + * + * Example: \include Matrix_setConstant_int.cpp + * Output: \verbinclude Matrix_setConstant_int.out + * + * \sa MatrixBase::setConstant(const Scalar&), setConstant(Index,Index,const Scalar&), class CwiseNullaryOp, MatrixBase::Constant(const Scalar&) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setConstant(Index size, const Scalar& val) +{ + resize(size); + return setConstant(val); +} + +/** Resizes to the given size, and sets all coefficients in this expression to the given value \a val. + * + * \param rows the new number of rows + * \param cols the new number of columns + * \param val the value to which all coefficients are set + * + * Example: \include Matrix_setConstant_int_int.cpp + * Output: \verbinclude Matrix_setConstant_int_int.out + * + * \sa MatrixBase::setConstant(const Scalar&), setConstant(Index,const Scalar&), class CwiseNullaryOp, MatrixBase::Constant(const Scalar&) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setConstant(Index rows, Index cols, const Scalar& val) +{ + resize(rows, cols); + return setConstant(val); +} + +/** + * \brief Sets a linearly spaced vector. + * + * The function generates 'size' equally spaced values in the closed interval [low,high]. + * When size is set to 1, a vector of length 1 containing 'high' is returned. + * + * \only_for_vectors + * + * Example: \include DenseBase_setLinSpaced.cpp + * Output: \verbinclude DenseBase_setLinSpaced.out + * + * For integer scalar types, do not miss the explanations on the definition + * of \link LinSpaced(Index,const Scalar&,const Scalar&) even spacing \endlink. + * + * \sa LinSpaced(Index,const Scalar&,const Scalar&), CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::setLinSpaced(Index newSize, const Scalar& low, const Scalar& high) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + return derived() = Derived::NullaryExpr(newSize, internal::linspaced_op(low,high,newSize)); +} + +/** + * \brief Sets a linearly spaced vector. + * + * The function fills \c *this with equally spaced values in the closed interval [low,high]. + * When size is set to 1, a vector of length 1 containing 'high' is returned. + * + * \only_for_vectors + * + * For integer scalar types, do not miss the explanations on the definition + * of \link LinSpaced(Index,const Scalar&,const Scalar&) even spacing \endlink. + * + * \sa LinSpaced(Index,const Scalar&,const Scalar&), setLinSpaced(Index, const Scalar&, const Scalar&), CwiseNullaryOp + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::setLinSpaced(const Scalar& low, const Scalar& high) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + return setLinSpaced(size(), low, high); +} + +// zero: + +/** \returns an expression of a zero matrix. + * + * The parameters \a rows and \a cols are the number of rows and of columns of + * the returned matrix. Must be compatible with this MatrixBase type. + * + * This variant is meant to be used for dynamic-size matrix types. For fixed-size types, + * it is redundant to pass \a rows and \a cols as arguments, so Zero() should be used + * instead. + * + * Example: \include MatrixBase_zero_int_int.cpp + * Output: \verbinclude MatrixBase_zero_int_int.out + * + * \sa Zero(), Zero(Index) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Zero(Index rows, Index cols) +{ + return Constant(rows, cols, Scalar(0)); +} + +/** \returns an expression of a zero vector. + * + * The parameter \a size is the size of the returned vector. + * Must be compatible with this MatrixBase type. + * + * \only_for_vectors + * + * This variant is meant to be used for dynamic-size vector types. For fixed-size types, + * it is redundant to pass \a size as argument, so Zero() should be used + * instead. + * + * Example: \include MatrixBase_zero_int.cpp + * Output: \verbinclude MatrixBase_zero_int.out + * + * \sa Zero(), Zero(Index,Index) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Zero(Index size) +{ + return Constant(size, Scalar(0)); +} + +/** \returns an expression of a fixed-size zero matrix or vector. + * + * This variant is only for fixed-size MatrixBase types. For dynamic-size types, you + * need to use the variants taking size arguments. + * + * Example: \include MatrixBase_zero.cpp + * Output: \verbinclude MatrixBase_zero.out + * + * \sa Zero(Index), Zero(Index,Index) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Zero() +{ + return Constant(Scalar(0)); +} + +/** \returns true if *this is approximately equal to the zero matrix, + * within the precision given by \a prec. + * + * Example: \include MatrixBase_isZero.cpp + * Output: \verbinclude MatrixBase_isZero.out + * + * \sa class CwiseNullaryOp, Zero() + */ +template +EIGEN_DEVICE_FUNC bool DenseBase::isZero(const RealScalar& prec) const +{ + typename internal::nested_eval::type self(derived()); + for(Index j = 0; j < cols(); ++j) + for(Index i = 0; i < rows(); ++i) + if(!internal::isMuchSmallerThan(self.coeff(i, j), static_cast(1), prec)) + return false; + return true; +} + +/** Sets all coefficients in this expression to zero. + * + * Example: \include MatrixBase_setZero.cpp + * Output: \verbinclude MatrixBase_setZero.out + * + * \sa class CwiseNullaryOp, Zero() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::setZero() +{ + return setConstant(Scalar(0)); +} + +/** Resizes to the given \a size, and sets all coefficients in this expression to zero. + * + * \only_for_vectors + * + * Example: \include Matrix_setZero_int.cpp + * Output: \verbinclude Matrix_setZero_int.out + * + * \sa DenseBase::setZero(), setZero(Index,Index), class CwiseNullaryOp, DenseBase::Zero() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setZero(Index newSize) +{ + resize(newSize); + return setConstant(Scalar(0)); +} + +/** Resizes to the given size, and sets all coefficients in this expression to zero. + * + * \param rows the new number of rows + * \param cols the new number of columns + * + * Example: \include Matrix_setZero_int_int.cpp + * Output: \verbinclude Matrix_setZero_int_int.out + * + * \sa DenseBase::setZero(), setZero(Index), class CwiseNullaryOp, DenseBase::Zero() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setZero(Index rows, Index cols) +{ + resize(rows, cols); + return setConstant(Scalar(0)); +} + +// ones: + +/** \returns an expression of a matrix where all coefficients equal one. + * + * The parameters \a rows and \a cols are the number of rows and of columns of + * the returned matrix. Must be compatible with this MatrixBase type. + * + * This variant is meant to be used for dynamic-size matrix types. For fixed-size types, + * it is redundant to pass \a rows and \a cols as arguments, so Ones() should be used + * instead. + * + * Example: \include MatrixBase_ones_int_int.cpp + * Output: \verbinclude MatrixBase_ones_int_int.out + * + * \sa Ones(), Ones(Index), isOnes(), class Ones + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Ones(Index rows, Index cols) +{ + return Constant(rows, cols, Scalar(1)); +} + +/** \returns an expression of a vector where all coefficients equal one. + * + * The parameter \a newSize is the size of the returned vector. + * Must be compatible with this MatrixBase type. + * + * \only_for_vectors + * + * This variant is meant to be used for dynamic-size vector types. For fixed-size types, + * it is redundant to pass \a size as argument, so Ones() should be used + * instead. + * + * Example: \include MatrixBase_ones_int.cpp + * Output: \verbinclude MatrixBase_ones_int.out + * + * \sa Ones(), Ones(Index,Index), isOnes(), class Ones + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Ones(Index newSize) +{ + return Constant(newSize, Scalar(1)); +} + +/** \returns an expression of a fixed-size matrix or vector where all coefficients equal one. + * + * This variant is only for fixed-size MatrixBase types. For dynamic-size types, you + * need to use the variants taking size arguments. + * + * Example: \include MatrixBase_ones.cpp + * Output: \verbinclude MatrixBase_ones.out + * + * \sa Ones(Index), Ones(Index,Index), isOnes(), class Ones + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename DenseBase::ConstantReturnType +DenseBase::Ones() +{ + return Constant(Scalar(1)); +} + +/** \returns true if *this is approximately equal to the matrix where all coefficients + * are equal to 1, within the precision given by \a prec. + * + * Example: \include MatrixBase_isOnes.cpp + * Output: \verbinclude MatrixBase_isOnes.out + * + * \sa class CwiseNullaryOp, Ones() + */ +template +EIGEN_DEVICE_FUNC bool DenseBase::isOnes +(const RealScalar& prec) const +{ + return isApproxToConstant(Scalar(1), prec); +} + +/** Sets all coefficients in this expression to one. + * + * Example: \include MatrixBase_setOnes.cpp + * Output: \verbinclude MatrixBase_setOnes.out + * + * \sa class CwiseNullaryOp, Ones() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::setOnes() +{ + return setConstant(Scalar(1)); +} + +/** Resizes to the given \a newSize, and sets all coefficients in this expression to one. + * + * \only_for_vectors + * + * Example: \include Matrix_setOnes_int.cpp + * Output: \verbinclude Matrix_setOnes_int.out + * + * \sa MatrixBase::setOnes(), setOnes(Index,Index), class CwiseNullaryOp, MatrixBase::Ones() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setOnes(Index newSize) +{ + resize(newSize); + return setConstant(Scalar(1)); +} + +/** Resizes to the given size, and sets all coefficients in this expression to one. + * + * \param rows the new number of rows + * \param cols the new number of columns + * + * Example: \include Matrix_setOnes_int_int.cpp + * Output: \verbinclude Matrix_setOnes_int_int.out + * + * \sa MatrixBase::setOnes(), setOnes(Index), class CwiseNullaryOp, MatrixBase::Ones() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setOnes(Index rows, Index cols) +{ + resize(rows, cols); + return setConstant(Scalar(1)); +} + +// Identity: + +/** \returns an expression of the identity matrix (not necessarily square). + * + * The parameters \a rows and \a cols are the number of rows and of columns of + * the returned matrix. Must be compatible with this MatrixBase type. + * + * This variant is meant to be used for dynamic-size matrix types. For fixed-size types, + * it is redundant to pass \a rows and \a cols as arguments, so Identity() should be used + * instead. + * + * Example: \include MatrixBase_identity_int_int.cpp + * Output: \verbinclude MatrixBase_identity_int_int.out + * + * \sa Identity(), setIdentity(), isIdentity() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::IdentityReturnType +MatrixBase::Identity(Index rows, Index cols) +{ + return DenseBase::NullaryExpr(rows, cols, internal::scalar_identity_op()); +} + +/** \returns an expression of the identity matrix (not necessarily square). + * + * This variant is only for fixed-size MatrixBase types. For dynamic-size types, you + * need to use the variant taking size arguments. + * + * Example: \include MatrixBase_identity.cpp + * Output: \verbinclude MatrixBase_identity.out + * + * \sa Identity(Index,Index), setIdentity(), isIdentity() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::IdentityReturnType +MatrixBase::Identity() +{ + EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived) + return MatrixBase::NullaryExpr(RowsAtCompileTime, ColsAtCompileTime, internal::scalar_identity_op()); +} + +/** \returns true if *this is approximately equal to the identity matrix + * (not necessarily square), + * within the precision given by \a prec. + * + * Example: \include MatrixBase_isIdentity.cpp + * Output: \verbinclude MatrixBase_isIdentity.out + * + * \sa class CwiseNullaryOp, Identity(), Identity(Index,Index), setIdentity() + */ +template +bool MatrixBase::isIdentity +(const RealScalar& prec) const +{ + typename internal::nested_eval::type self(derived()); + for(Index j = 0; j < cols(); ++j) + { + for(Index i = 0; i < rows(); ++i) + { + if(i == j) + { + if(!internal::isApprox(self.coeff(i, j), static_cast(1), prec)) + return false; + } + else + { + if(!internal::isMuchSmallerThan(self.coeff(i, j), static_cast(1), prec)) + return false; + } + } + } + return true; +} + +namespace internal { + +template=16)> +struct setIdentity_impl +{ + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE Derived& run(Derived& m) + { + return m = Derived::Identity(m.rows(), m.cols()); + } +}; + +template +struct setIdentity_impl +{ + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE Derived& run(Derived& m) + { + m.setZero(); + const Index size = numext::mini(m.rows(), m.cols()); + for(Index i = 0; i < size; ++i) m.coeffRef(i,i) = typename Derived::Scalar(1); + return m; + } +}; + +} // end namespace internal + +/** Writes the identity expression (not necessarily square) into *this. + * + * Example: \include MatrixBase_setIdentity.cpp + * Output: \verbinclude MatrixBase_setIdentity.out + * + * \sa class CwiseNullaryOp, Identity(), Identity(Index,Index), isIdentity() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& MatrixBase::setIdentity() +{ + return internal::setIdentity_impl::run(derived()); +} + +/** \brief Resizes to the given size, and writes the identity expression (not necessarily square) into *this. + * + * \param rows the new number of rows + * \param cols the new number of columns + * + * Example: \include Matrix_setIdentity_int_int.cpp + * Output: \verbinclude Matrix_setIdentity_int_int.out + * + * \sa MatrixBase::setIdentity(), class CwiseNullaryOp, MatrixBase::Identity() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& MatrixBase::setIdentity(Index rows, Index cols) +{ + derived().resize(rows, cols); + return setIdentity(); +} + +/** \returns an expression of the i-th unit (basis) vector. + * + * \only_for_vectors + * + * \sa MatrixBase::Unit(Index), MatrixBase::UnitX(), MatrixBase::UnitY(), MatrixBase::UnitZ(), MatrixBase::UnitW() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::BasisReturnType MatrixBase::Unit(Index newSize, Index i) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + return BasisReturnType(SquareMatrixType::Identity(newSize,newSize), i); +} + +/** \returns an expression of the i-th unit (basis) vector. + * + * \only_for_vectors + * + * This variant is for fixed-size vector only. + * + * \sa MatrixBase::Unit(Index,Index), MatrixBase::UnitX(), MatrixBase::UnitY(), MatrixBase::UnitZ(), MatrixBase::UnitW() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::BasisReturnType MatrixBase::Unit(Index i) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + return BasisReturnType(SquareMatrixType::Identity(),i); +} + +/** \returns an expression of the X axis unit vector (1{,0}^*) + * + * \only_for_vectors + * + * \sa MatrixBase::Unit(Index,Index), MatrixBase::Unit(Index), MatrixBase::UnitY(), MatrixBase::UnitZ(), MatrixBase::UnitW() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::BasisReturnType MatrixBase::UnitX() +{ return Derived::Unit(0); } + +/** \returns an expression of the Y axis unit vector (0,1{,0}^*) + * + * \only_for_vectors + * + * \sa MatrixBase::Unit(Index,Index), MatrixBase::Unit(Index), MatrixBase::UnitY(), MatrixBase::UnitZ(), MatrixBase::UnitW() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::BasisReturnType MatrixBase::UnitY() +{ return Derived::Unit(1); } + +/** \returns an expression of the Z axis unit vector (0,0,1{,0}^*) + * + * \only_for_vectors + * + * \sa MatrixBase::Unit(Index,Index), MatrixBase::Unit(Index), MatrixBase::UnitY(), MatrixBase::UnitZ(), MatrixBase::UnitW() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::BasisReturnType MatrixBase::UnitZ() +{ return Derived::Unit(2); } + +/** \returns an expression of the W axis unit vector (0,0,0,1) + * + * \only_for_vectors + * + * \sa MatrixBase::Unit(Index,Index), MatrixBase::Unit(Index), MatrixBase::UnitY(), MatrixBase::UnitZ(), MatrixBase::UnitW() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename MatrixBase::BasisReturnType MatrixBase::UnitW() +{ return Derived::Unit(3); } + +/** \brief Set the coefficients of \c *this to the i-th unit (basis) vector + * + * \param i index of the unique coefficient to be set to 1 + * + * \only_for_vectors + * + * \sa MatrixBase::setIdentity(), class CwiseNullaryOp, MatrixBase::Unit(Index,Index) + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& MatrixBase::setUnit(Index i) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); + eigen_assert(i +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& MatrixBase::setUnit(Index newSize, Index i) +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); + eigen_assert(i +// Copyright (C) 2006-2008 Benoit Jacob +// Copyright (C) 2016 Eugene Brevdo +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CWISE_TERNARY_OP_H +#define EIGEN_CWISE_TERNARY_OP_H + +namespace Eigen { + +namespace internal { +template +struct traits > { + // we must not inherit from traits since it has + // the potential to cause problems with MSVC + typedef typename remove_all::type Ancestor; + typedef typename traits::XprKind XprKind; + enum { + RowsAtCompileTime = traits::RowsAtCompileTime, + ColsAtCompileTime = traits::ColsAtCompileTime, + MaxRowsAtCompileTime = traits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = traits::MaxColsAtCompileTime + }; + + // even though we require Arg1, Arg2, and Arg3 to have the same scalar type + // (see CwiseTernaryOp constructor), + // we still want to handle the case when the result type is different. + typedef typename result_of::type Scalar; + + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::StorageIndex StorageIndex; + + typedef typename Arg1::Nested Arg1Nested; + typedef typename Arg2::Nested Arg2Nested; + typedef typename Arg3::Nested Arg3Nested; + typedef typename remove_reference::type _Arg1Nested; + typedef typename remove_reference::type _Arg2Nested; + typedef typename remove_reference::type _Arg3Nested; + enum { Flags = _Arg1Nested::Flags & RowMajorBit }; +}; +} // end namespace internal + +template +class CwiseTernaryOpImpl; + +/** \class CwiseTernaryOp + * \ingroup Core_Module + * + * \brief Generic expression where a coefficient-wise ternary operator is + * applied to two expressions + * + * \tparam TernaryOp template functor implementing the operator + * \tparam Arg1Type the type of the first argument + * \tparam Arg2Type the type of the second argument + * \tparam Arg3Type the type of the third argument + * + * This class represents an expression where a coefficient-wise ternary + * operator is applied to three expressions. + * It is the return type of ternary operators, by which we mean only those + * ternary operators where + * all three arguments are Eigen expressions. + * For example, the return type of betainc(matrix1, matrix2, matrix3) is a + * CwiseTernaryOp. + * + * Most of the time, this is the only way that it is used, so you typically + * don't have to name + * CwiseTernaryOp types explicitly. + * + * \sa MatrixBase::ternaryExpr(const MatrixBase &, const + * MatrixBase &, const CustomTernaryOp &) const, class CwiseBinaryOp, + * class CwiseUnaryOp, class CwiseNullaryOp + */ +template +class CwiseTernaryOp : public CwiseTernaryOpImpl< + TernaryOp, Arg1Type, Arg2Type, Arg3Type, + typename internal::traits::StorageKind>, + internal::no_assignment_operator +{ + public: + typedef typename internal::remove_all::type Arg1; + typedef typename internal::remove_all::type Arg2; + typedef typename internal::remove_all::type Arg3; + + typedef typename CwiseTernaryOpImpl< + TernaryOp, Arg1Type, Arg2Type, Arg3Type, + typename internal::traits::StorageKind>::Base Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(CwiseTernaryOp) + + typedef typename internal::ref_selector::type Arg1Nested; + typedef typename internal::ref_selector::type Arg2Nested; + typedef typename internal::ref_selector::type Arg3Nested; + typedef typename internal::remove_reference::type _Arg1Nested; + typedef typename internal::remove_reference::type _Arg2Nested; + typedef typename internal::remove_reference::type _Arg3Nested; + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CwiseTernaryOp(const Arg1& a1, const Arg2& a2, + const Arg3& a3, + const TernaryOp& func = TernaryOp()) + : m_arg1(a1), m_arg2(a2), m_arg3(a3), m_functor(func) { + // require the sizes to match + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(Arg1, Arg2) + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(Arg1, Arg3) + + // The index types should match + EIGEN_STATIC_ASSERT((internal::is_same< + typename internal::traits::StorageKind, + typename internal::traits::StorageKind>::value), + STORAGE_KIND_MUST_MATCH) + EIGEN_STATIC_ASSERT((internal::is_same< + typename internal::traits::StorageKind, + typename internal::traits::StorageKind>::value), + STORAGE_KIND_MUST_MATCH) + + eigen_assert(a1.rows() == a2.rows() && a1.cols() == a2.cols() && + a1.rows() == a3.rows() && a1.cols() == a3.cols()); + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index rows() const { + // return the fixed size type if available to enable compile time + // optimizations + if (internal::traits::type>:: + RowsAtCompileTime == Dynamic && + internal::traits::type>:: + RowsAtCompileTime == Dynamic) + return m_arg3.rows(); + else if (internal::traits::type>:: + RowsAtCompileTime == Dynamic && + internal::traits::type>:: + RowsAtCompileTime == Dynamic) + return m_arg2.rows(); + else + return m_arg1.rows(); + } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index cols() const { + // return the fixed size type if available to enable compile time + // optimizations + if (internal::traits::type>:: + ColsAtCompileTime == Dynamic && + internal::traits::type>:: + ColsAtCompileTime == Dynamic) + return m_arg3.cols(); + else if (internal::traits::type>:: + ColsAtCompileTime == Dynamic && + internal::traits::type>:: + ColsAtCompileTime == Dynamic) + return m_arg2.cols(); + else + return m_arg1.cols(); + } + + /** \returns the first argument nested expression */ + EIGEN_DEVICE_FUNC + const _Arg1Nested& arg1() const { return m_arg1; } + /** \returns the first argument nested expression */ + EIGEN_DEVICE_FUNC + const _Arg2Nested& arg2() const { return m_arg2; } + /** \returns the third argument nested expression */ + EIGEN_DEVICE_FUNC + const _Arg3Nested& arg3() const { return m_arg3; } + /** \returns the functor representing the ternary operation */ + EIGEN_DEVICE_FUNC + const TernaryOp& functor() const { return m_functor; } + + protected: + Arg1Nested m_arg1; + Arg2Nested m_arg2; + Arg3Nested m_arg3; + const TernaryOp m_functor; +}; + +// Generic API dispatcher +template +class CwiseTernaryOpImpl + : public internal::generic_xpr_base< + CwiseTernaryOp >::type { + public: + typedef typename internal::generic_xpr_base< + CwiseTernaryOp >::type Base; +}; + +} // end namespace Eigen + +#endif // EIGEN_CWISE_TERNARY_OP_H diff --git a/Eigen/src/Core/CwiseUnaryOp.h b/Eigen/src/Core/CwiseUnaryOp.h new file mode 100644 index 000000000..1d2dd19f2 --- /dev/null +++ b/Eigen/src/Core/CwiseUnaryOp.h @@ -0,0 +1,103 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2014 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CWISE_UNARY_OP_H +#define EIGEN_CWISE_UNARY_OP_H + +namespace Eigen { + +namespace internal { +template +struct traits > + : traits +{ + typedef typename result_of< + UnaryOp(const typename XprType::Scalar&) + >::type Scalar; + typedef typename XprType::Nested XprTypeNested; + typedef typename remove_reference::type _XprTypeNested; + enum { + Flags = _XprTypeNested::Flags & RowMajorBit + }; +}; +} + +template +class CwiseUnaryOpImpl; + +/** \class CwiseUnaryOp + * \ingroup Core_Module + * + * \brief Generic expression where a coefficient-wise unary operator is applied to an expression + * + * \tparam UnaryOp template functor implementing the operator + * \tparam XprType the type of the expression to which we are applying the unary operator + * + * This class represents an expression where a unary operator is applied to an expression. + * It is the return type of all operations taking exactly 1 input expression, regardless of the + * presence of other inputs such as scalars. For example, the operator* in the expression 3*matrix + * is considered unary, because only the right-hand side is an expression, and its + * return type is a specialization of CwiseUnaryOp. + * + * Most of the time, this is the only way that it is used, so you typically don't have to name + * CwiseUnaryOp types explicitly. + * + * \sa MatrixBase::unaryExpr(const CustomUnaryOp &) const, class CwiseBinaryOp, class CwiseNullaryOp + */ +template +class CwiseUnaryOp : public CwiseUnaryOpImpl::StorageKind>, internal::no_assignment_operator +{ + public: + + typedef typename CwiseUnaryOpImpl::StorageKind>::Base Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(CwiseUnaryOp) + typedef typename internal::ref_selector::type XprTypeNested; + typedef typename internal::remove_all::type NestedExpression; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + explicit CwiseUnaryOp(const XprType& xpr, const UnaryOp& func = UnaryOp()) + : m_xpr(xpr), m_functor(func) {} + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Index rows() const { return m_xpr.rows(); } + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Index cols() const { return m_xpr.cols(); } + + /** \returns the functor representing the unary operation */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const UnaryOp& functor() const { return m_functor; } + + /** \returns the nested expression */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + const typename internal::remove_all::type& + nestedExpression() const { return m_xpr; } + + /** \returns the nested expression */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + typename internal::remove_all::type& + nestedExpression() { return m_xpr; } + + protected: + XprTypeNested m_xpr; + const UnaryOp m_functor; +}; + +// Generic API dispatcher +template +class CwiseUnaryOpImpl + : public internal::generic_xpr_base >::type +{ +public: + typedef typename internal::generic_xpr_base >::type Base; +}; + +} // end namespace Eigen + +#endif // EIGEN_CWISE_UNARY_OP_H diff --git a/Eigen/src/Core/CwiseUnaryView.h b/Eigen/src/Core/CwiseUnaryView.h new file mode 100644 index 000000000..271033056 --- /dev/null +++ b/Eigen/src/Core/CwiseUnaryView.h @@ -0,0 +1,128 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_CWISE_UNARY_VIEW_H +#define EIGEN_CWISE_UNARY_VIEW_H + +namespace Eigen { + +namespace internal { +template +struct traits > + : traits +{ + typedef typename result_of< + ViewOp(const typename traits::Scalar&) + >::type Scalar; + typedef typename MatrixType::Nested MatrixTypeNested; + typedef typename remove_all::type _MatrixTypeNested; + enum { + FlagsLvalueBit = is_lvalue::value ? LvalueBit : 0, + Flags = traits<_MatrixTypeNested>::Flags & (RowMajorBit | FlagsLvalueBit | DirectAccessBit), // FIXME DirectAccessBit should not be handled by expressions + MatrixTypeInnerStride = inner_stride_at_compile_time::ret, + // need to cast the sizeof's from size_t to int explicitly, otherwise: + // "error: no integral type can represent all of the enumerator values + InnerStrideAtCompileTime = MatrixTypeInnerStride == Dynamic + ? int(Dynamic) + : int(MatrixTypeInnerStride) * int(sizeof(typename traits::Scalar) / sizeof(Scalar)), + OuterStrideAtCompileTime = outer_stride_at_compile_time::ret == Dynamic + ? int(Dynamic) + : outer_stride_at_compile_time::ret * int(sizeof(typename traits::Scalar) / sizeof(Scalar)) + }; +}; +} + +template +class CwiseUnaryViewImpl; + +/** \class CwiseUnaryView + * \ingroup Core_Module + * + * \brief Generic lvalue expression of a coefficient-wise unary operator of a matrix or a vector + * + * \tparam ViewOp template functor implementing the view + * \tparam MatrixType the type of the matrix we are applying the unary operator + * + * This class represents a lvalue expression of a generic unary view operator of a matrix or a vector. + * It is the return type of real() and imag(), and most of the time this is the only way it is used. + * + * \sa MatrixBase::unaryViewExpr(const CustomUnaryOp &) const, class CwiseUnaryOp + */ +template +class CwiseUnaryView : public CwiseUnaryViewImpl::StorageKind> +{ + public: + + typedef typename CwiseUnaryViewImpl::StorageKind>::Base Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(CwiseUnaryView) + typedef typename internal::ref_selector::non_const_type MatrixTypeNested; + typedef typename internal::remove_all::type NestedExpression; + + explicit inline CwiseUnaryView(MatrixType& mat, const ViewOp& func = ViewOp()) + : m_matrix(mat), m_functor(func) {} + + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(CwiseUnaryView) + + EIGEN_STRONG_INLINE Index rows() const { return m_matrix.rows(); } + EIGEN_STRONG_INLINE Index cols() const { return m_matrix.cols(); } + + /** \returns the functor representing unary operation */ + const ViewOp& functor() const { return m_functor; } + + /** \returns the nested expression */ + const typename internal::remove_all::type& + nestedExpression() const { return m_matrix; } + + /** \returns the nested expression */ + typename internal::remove_reference::type& + nestedExpression() { return m_matrix.const_cast_derived(); } + + protected: + MatrixTypeNested m_matrix; + ViewOp m_functor; +}; + +// Generic API dispatcher +template +class CwiseUnaryViewImpl + : public internal::generic_xpr_base >::type +{ +public: + typedef typename internal::generic_xpr_base >::type Base; +}; + +template +class CwiseUnaryViewImpl + : public internal::dense_xpr_base< CwiseUnaryView >::type +{ + public: + + typedef CwiseUnaryView Derived; + typedef typename internal::dense_xpr_base< CwiseUnaryView >::type Base; + + EIGEN_DENSE_PUBLIC_INTERFACE(Derived) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(CwiseUnaryViewImpl) + + EIGEN_DEVICE_FUNC inline Scalar* data() { return &(this->coeffRef(0)); } + EIGEN_DEVICE_FUNC inline const Scalar* data() const { return &(this->coeff(0)); } + + EIGEN_DEVICE_FUNC inline Index innerStride() const + { + return derived().nestedExpression().innerStride() * sizeof(typename internal::traits::Scalar) / sizeof(Scalar); + } + + EIGEN_DEVICE_FUNC inline Index outerStride() const + { + return derived().nestedExpression().outerStride() * sizeof(typename internal::traits::Scalar) / sizeof(Scalar); + } +}; + +} // end namespace Eigen + +#endif // EIGEN_CWISE_UNARY_VIEW_H diff --git a/Eigen/src/Core/DenseBase.h b/Eigen/src/Core/DenseBase.h new file mode 100644 index 000000000..fd933eed4 --- /dev/null +++ b/Eigen/src/Core/DenseBase.h @@ -0,0 +1,615 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2007-2010 Benoit Jacob +// Copyright (C) 2008-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DENSEBASE_H +#define EIGEN_DENSEBASE_H + +namespace Eigen { + +namespace internal { + +// The index type defined by EIGEN_DEFAULT_DENSE_INDEX_TYPE must be a signed type. +// This dummy function simply aims at checking that at compile time. +static inline void check_DenseIndex_is_signed() { + EIGEN_STATIC_ASSERT(NumTraits::IsSigned,THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE); +} + +} // end namespace internal + +/** \class DenseBase + * \ingroup Core_Module + * + * \brief Base class for all dense matrices, vectors, and arrays + * + * This class is the base that is inherited by all dense objects (matrix, vector, arrays, + * and related expression types). The common Eigen API for dense objects is contained in this class. + * + * \tparam Derived is the derived type, e.g., a matrix type or an expression. + * + * This class can be extended with the help of the plugin mechanism described on the page + * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_DENSEBASE_PLUGIN. + * + * \sa \blank \ref TopicClassHierarchy + */ +template class DenseBase +#ifndef EIGEN_PARSED_BY_DOXYGEN + : public DenseCoeffsBase +#else + : public DenseCoeffsBase +#endif // not EIGEN_PARSED_BY_DOXYGEN +{ + public: + + /** Inner iterator type to iterate over the coefficients of a row or column. + * \sa class InnerIterator + */ + typedef Eigen::InnerIterator InnerIterator; + + typedef typename internal::traits::StorageKind StorageKind; + + /** + * \brief The type used to store indices + * \details This typedef is relevant for types that store multiple indices such as + * PermutationMatrix or Transpositions, otherwise it defaults to Eigen::Index + * \sa \blank \ref TopicPreprocessorDirectives, Eigen::Index, SparseMatrixBase. + */ + typedef typename internal::traits::StorageIndex StorageIndex; + + /** The numeric type of the expression' coefficients, e.g. float, double, int or std::complex, etc. */ + typedef typename internal::traits::Scalar Scalar; + + /** The numeric type of the expression' coefficients, e.g. float, double, int or std::complex, etc. + * + * It is an alias for the Scalar type */ + typedef Scalar value_type; + + typedef typename NumTraits::Real RealScalar; + typedef DenseCoeffsBase Base; + + using Base::derived; + using Base::const_cast_derived; + using Base::rows; + using Base::cols; + using Base::size; + using Base::rowIndexByOuterInner; + using Base::colIndexByOuterInner; + using Base::coeff; + using Base::coeffByOuterInner; + using Base::operator(); + using Base::operator[]; + using Base::x; + using Base::y; + using Base::z; + using Base::w; + using Base::stride; + using Base::innerStride; + using Base::outerStride; + using Base::rowStride; + using Base::colStride; + typedef typename Base::CoeffReturnType CoeffReturnType; + + enum { + + RowsAtCompileTime = internal::traits::RowsAtCompileTime, + /**< The number of rows at compile-time. This is just a copy of the value provided + * by the \a Derived type. If a value is not known at compile-time, + * it is set to the \a Dynamic constant. + * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */ + + ColsAtCompileTime = internal::traits::ColsAtCompileTime, + /**< The number of columns at compile-time. This is just a copy of the value provided + * by the \a Derived type. If a value is not known at compile-time, + * it is set to the \a Dynamic constant. + * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */ + + + SizeAtCompileTime = (internal::size_at_compile_time::RowsAtCompileTime, + internal::traits::ColsAtCompileTime>::ret), + /**< This is equal to the number of coefficients, i.e. the number of + * rows times the number of columns, or to \a Dynamic if this is not + * known at compile-time. \sa RowsAtCompileTime, ColsAtCompileTime */ + + MaxRowsAtCompileTime = internal::traits::MaxRowsAtCompileTime, + /**< This value is equal to the maximum possible number of rows that this expression + * might have. If this expression might have an arbitrarily high number of rows, + * this value is set to \a Dynamic. + * + * This value is useful to know when evaluating an expression, in order to determine + * whether it is possible to avoid doing a dynamic memory allocation. + * + * \sa RowsAtCompileTime, MaxColsAtCompileTime, MaxSizeAtCompileTime + */ + + MaxColsAtCompileTime = internal::traits::MaxColsAtCompileTime, + /**< This value is equal to the maximum possible number of columns that this expression + * might have. If this expression might have an arbitrarily high number of columns, + * this value is set to \a Dynamic. + * + * This value is useful to know when evaluating an expression, in order to determine + * whether it is possible to avoid doing a dynamic memory allocation. + * + * \sa ColsAtCompileTime, MaxRowsAtCompileTime, MaxSizeAtCompileTime + */ + + MaxSizeAtCompileTime = (internal::size_at_compile_time::MaxRowsAtCompileTime, + internal::traits::MaxColsAtCompileTime>::ret), + /**< This value is equal to the maximum possible number of coefficients that this expression + * might have. If this expression might have an arbitrarily high number of coefficients, + * this value is set to \a Dynamic. + * + * This value is useful to know when evaluating an expression, in order to determine + * whether it is possible to avoid doing a dynamic memory allocation. + * + * \sa SizeAtCompileTime, MaxRowsAtCompileTime, MaxColsAtCompileTime + */ + + IsVectorAtCompileTime = internal::traits::MaxRowsAtCompileTime == 1 + || internal::traits::MaxColsAtCompileTime == 1, + /**< This is set to true if either the number of rows or the number of + * columns is known at compile-time to be equal to 1. Indeed, in that case, + * we are dealing with a column-vector (if there is only one column) or with + * a row-vector (if there is only one row). */ + + Flags = internal::traits::Flags, + /**< This stores expression \ref flags flags which may or may not be inherited by new expressions + * constructed from this one. See the \ref flags "list of flags". + */ + + IsRowMajor = int(Flags) & RowMajorBit, /**< True if this expression has row-major storage order. */ + + InnerSizeAtCompileTime = int(IsVectorAtCompileTime) ? int(SizeAtCompileTime) + : int(IsRowMajor) ? int(ColsAtCompileTime) : int(RowsAtCompileTime), + + InnerStrideAtCompileTime = internal::inner_stride_at_compile_time::ret, + OuterStrideAtCompileTime = internal::outer_stride_at_compile_time::ret + }; + + typedef typename internal::find_best_packet::type PacketScalar; + + enum { IsPlainObjectBase = 0 }; + + /** The plain matrix type corresponding to this expression. + * \sa PlainObject */ + typedef Matrix::Scalar, + internal::traits::RowsAtCompileTime, + internal::traits::ColsAtCompileTime, + AutoAlign | (internal::traits::Flags&RowMajorBit ? RowMajor : ColMajor), + internal::traits::MaxRowsAtCompileTime, + internal::traits::MaxColsAtCompileTime + > PlainMatrix; + + /** The plain array type corresponding to this expression. + * \sa PlainObject */ + typedef Array::Scalar, + internal::traits::RowsAtCompileTime, + internal::traits::ColsAtCompileTime, + AutoAlign | (internal::traits::Flags&RowMajorBit ? RowMajor : ColMajor), + internal::traits::MaxRowsAtCompileTime, + internal::traits::MaxColsAtCompileTime + > PlainArray; + + /** \brief The plain matrix or array type corresponding to this expression. + * + * This is not necessarily exactly the return type of eval(). In the case of plain matrices, + * the return type of eval() is a const reference to a matrix, not a matrix! It is however guaranteed + * that the return type of eval() is either PlainObject or const PlainObject&. + */ + typedef typename internal::conditional::XprKind,MatrixXpr >::value, + PlainMatrix, PlainArray>::type PlainObject; + + /** \returns the number of nonzero coefficients which is in practice the number + * of stored coefficients. */ + EIGEN_DEVICE_FUNC + inline Index nonZeros() const { return size(); } + + /** \returns the outer size. + * + * \note For a vector, this returns just 1. For a matrix (non-vector), this is the major dimension + * with respect to the \ref TopicStorageOrders "storage order", i.e., the number of columns for a + * column-major matrix, and the number of rows for a row-major matrix. */ + EIGEN_DEVICE_FUNC + Index outerSize() const + { + return IsVectorAtCompileTime ? 1 + : int(IsRowMajor) ? this->rows() : this->cols(); + } + + /** \returns the inner size. + * + * \note For a vector, this is just the size. For a matrix (non-vector), this is the minor dimension + * with respect to the \ref TopicStorageOrders "storage order", i.e., the number of rows for a + * column-major matrix, and the number of columns for a row-major matrix. */ + EIGEN_DEVICE_FUNC + Index innerSize() const + { + return IsVectorAtCompileTime ? this->size() + : int(IsRowMajor) ? this->cols() : this->rows(); + } + + /** Only plain matrices/arrays, not expressions, may be resized; therefore the only useful resize methods are + * Matrix::resize() and Array::resize(). The present method only asserts that the new size equals the old size, and does + * nothing else. + */ + EIGEN_DEVICE_FUNC + void resize(Index newSize) + { + EIGEN_ONLY_USED_FOR_DEBUG(newSize); + eigen_assert(newSize == this->size() + && "DenseBase::resize() does not actually allow to resize."); + } + /** Only plain matrices/arrays, not expressions, may be resized; therefore the only useful resize methods are + * Matrix::resize() and Array::resize(). The present method only asserts that the new size equals the old size, and does + * nothing else. + */ + EIGEN_DEVICE_FUNC + void resize(Index rows, Index cols) + { + EIGEN_ONLY_USED_FOR_DEBUG(rows); + EIGEN_ONLY_USED_FOR_DEBUG(cols); + eigen_assert(rows == this->rows() && cols == this->cols() + && "DenseBase::resize() does not actually allow to resize."); + } + +#ifndef EIGEN_PARSED_BY_DOXYGEN + /** \internal Represents a matrix with all coefficients equal to one another*/ + typedef CwiseNullaryOp,PlainObject> ConstantReturnType; + /** \internal \deprecated Represents a vector with linearly spaced coefficients that allows sequential access only. */ + typedef CwiseNullaryOp,PlainObject> SequentialLinSpacedReturnType; + /** \internal Represents a vector with linearly spaced coefficients that allows random access. */ + typedef CwiseNullaryOp,PlainObject> RandomAccessLinSpacedReturnType; + /** \internal the return type of MatrixBase::eigenvalues() */ + typedef Matrix::Scalar>::Real, internal::traits::ColsAtCompileTime, 1> EigenvaluesReturnType; + +#endif // not EIGEN_PARSED_BY_DOXYGEN + + /** Copies \a other into *this. \returns a reference to *this. */ + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator=(const DenseBase& other); + + /** Special case of the template operator=, in order to prevent the compiler + * from generating a default operator= (issue hit with g++ 4.1) + */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator=(const DenseBase& other); + + template + EIGEN_DEVICE_FUNC + Derived& operator=(const EigenBase &other); + + template + EIGEN_DEVICE_FUNC + Derived& operator+=(const EigenBase &other); + + template + EIGEN_DEVICE_FUNC + Derived& operator-=(const EigenBase &other); + + template + EIGEN_DEVICE_FUNC + Derived& operator=(const ReturnByValue& func); + + /** \internal + * Copies \a other into *this without evaluating other. \returns a reference to *this. + * \deprecated */ + template + EIGEN_DEVICE_FUNC + Derived& lazyAssign(const DenseBase& other); + + EIGEN_DEVICE_FUNC + CommaInitializer operator<< (const Scalar& s); + + /** \deprecated it now returns \c *this */ + template + EIGEN_DEPRECATED + const Derived& flagged() const + { return derived(); } + + template + EIGEN_DEVICE_FUNC + CommaInitializer operator<< (const DenseBase& other); + + typedef Transpose TransposeReturnType; + EIGEN_DEVICE_FUNC + TransposeReturnType transpose(); + typedef typename internal::add_const >::type ConstTransposeReturnType; + EIGEN_DEVICE_FUNC + ConstTransposeReturnType transpose() const; + EIGEN_DEVICE_FUNC + void transposeInPlace(); + + EIGEN_DEVICE_FUNC static const ConstantReturnType + Constant(Index rows, Index cols, const Scalar& value); + EIGEN_DEVICE_FUNC static const ConstantReturnType + Constant(Index size, const Scalar& value); + EIGEN_DEVICE_FUNC static const ConstantReturnType + Constant(const Scalar& value); + + EIGEN_DEVICE_FUNC static const SequentialLinSpacedReturnType + LinSpaced(Sequential_t, Index size, const Scalar& low, const Scalar& high); + EIGEN_DEVICE_FUNC static const RandomAccessLinSpacedReturnType + LinSpaced(Index size, const Scalar& low, const Scalar& high); + EIGEN_DEVICE_FUNC static const SequentialLinSpacedReturnType + LinSpaced(Sequential_t, const Scalar& low, const Scalar& high); + EIGEN_DEVICE_FUNC static const RandomAccessLinSpacedReturnType + LinSpaced(const Scalar& low, const Scalar& high); + + template EIGEN_DEVICE_FUNC + static const CwiseNullaryOp + NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func); + template EIGEN_DEVICE_FUNC + static const CwiseNullaryOp + NullaryExpr(Index size, const CustomNullaryOp& func); + template EIGEN_DEVICE_FUNC + static const CwiseNullaryOp + NullaryExpr(const CustomNullaryOp& func); + + EIGEN_DEVICE_FUNC static const ConstantReturnType Zero(Index rows, Index cols); + EIGEN_DEVICE_FUNC static const ConstantReturnType Zero(Index size); + EIGEN_DEVICE_FUNC static const ConstantReturnType Zero(); + EIGEN_DEVICE_FUNC static const ConstantReturnType Ones(Index rows, Index cols); + EIGEN_DEVICE_FUNC static const ConstantReturnType Ones(Index size); + EIGEN_DEVICE_FUNC static const ConstantReturnType Ones(); + + EIGEN_DEVICE_FUNC void fill(const Scalar& value); + EIGEN_DEVICE_FUNC Derived& setConstant(const Scalar& value); + EIGEN_DEVICE_FUNC Derived& setLinSpaced(Index size, const Scalar& low, const Scalar& high); + EIGEN_DEVICE_FUNC Derived& setLinSpaced(const Scalar& low, const Scalar& high); + EIGEN_DEVICE_FUNC Derived& setZero(); + EIGEN_DEVICE_FUNC Derived& setOnes(); + EIGEN_DEVICE_FUNC Derived& setRandom(); + + template EIGEN_DEVICE_FUNC + bool isApprox(const DenseBase& other, + const RealScalar& prec = NumTraits::dummy_precision()) const; + EIGEN_DEVICE_FUNC + bool isMuchSmallerThan(const RealScalar& other, + const RealScalar& prec = NumTraits::dummy_precision()) const; + template EIGEN_DEVICE_FUNC + bool isMuchSmallerThan(const DenseBase& other, + const RealScalar& prec = NumTraits::dummy_precision()) const; + + EIGEN_DEVICE_FUNC bool isApproxToConstant(const Scalar& value, const RealScalar& prec = NumTraits::dummy_precision()) const; + EIGEN_DEVICE_FUNC bool isConstant(const Scalar& value, const RealScalar& prec = NumTraits::dummy_precision()) const; + EIGEN_DEVICE_FUNC bool isZero(const RealScalar& prec = NumTraits::dummy_precision()) const; + EIGEN_DEVICE_FUNC bool isOnes(const RealScalar& prec = NumTraits::dummy_precision()) const; + + inline bool hasNaN() const; + inline bool allFinite() const; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator*=(const Scalar& other); + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator/=(const Scalar& other); + + typedef typename internal::add_const_on_value_type::type>::type EvalReturnType; + /** \returns the matrix or vector obtained by evaluating this expression. + * + * Notice that in the case of a plain matrix or vector (not an expression) this function just returns + * a const reference, in order to avoid a useless copy. + * + * \warning Be carefull with eval() and the auto C++ keyword, as detailed in this \link TopicPitfalls_auto_keyword page \endlink. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE EvalReturnType eval() const + { + // Even though MSVC does not honor strong inlining when the return type + // is a dynamic matrix, we desperately need strong inlining for fixed + // size types on MSVC. + return typename internal::eval::type(derived()); + } + + /** swaps *this with the expression \a other. + * + */ + template + EIGEN_DEVICE_FUNC + void swap(const DenseBase& other) + { + EIGEN_STATIC_ASSERT(!OtherDerived::IsPlainObjectBase,THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY); + eigen_assert(rows()==other.rows() && cols()==other.cols()); + call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op()); + } + + /** swaps *this with the matrix or array \a other. + * + */ + template + EIGEN_DEVICE_FUNC + void swap(PlainObjectBase& other) + { + eigen_assert(rows()==other.rows() && cols()==other.cols()); + call_assignment(derived(), other.derived(), internal::swap_assign_op()); + } + + EIGEN_DEVICE_FUNC inline const NestByValue nestByValue() const; + EIGEN_DEVICE_FUNC inline const ForceAlignedAccess forceAlignedAccess() const; + EIGEN_DEVICE_FUNC inline ForceAlignedAccess forceAlignedAccess(); + template EIGEN_DEVICE_FUNC + inline const typename internal::conditional,Derived&>::type forceAlignedAccessIf() const; + template EIGEN_DEVICE_FUNC + inline typename internal::conditional,Derived&>::type forceAlignedAccessIf(); + + EIGEN_DEVICE_FUNC Scalar sum() const; + EIGEN_DEVICE_FUNC Scalar mean() const; + EIGEN_DEVICE_FUNC Scalar trace() const; + + EIGEN_DEVICE_FUNC Scalar prod() const; + + EIGEN_DEVICE_FUNC typename internal::traits::Scalar minCoeff() const; + EIGEN_DEVICE_FUNC typename internal::traits::Scalar maxCoeff() const; + + template EIGEN_DEVICE_FUNC + typename internal::traits::Scalar minCoeff(IndexType* row, IndexType* col) const; + template EIGEN_DEVICE_FUNC + typename internal::traits::Scalar maxCoeff(IndexType* row, IndexType* col) const; + template EIGEN_DEVICE_FUNC + typename internal::traits::Scalar minCoeff(IndexType* index) const; + template EIGEN_DEVICE_FUNC + typename internal::traits::Scalar maxCoeff(IndexType* index) const; + + template + EIGEN_DEVICE_FUNC + Scalar redux(const BinaryOp& func) const; + + template + EIGEN_DEVICE_FUNC + void visit(Visitor& func) const; + + /** \returns a WithFormat proxy object allowing to print a matrix the with given + * format \a fmt. + * + * See class IOFormat for some examples. + * + * \sa class IOFormat, class WithFormat + */ + inline const WithFormat format(const IOFormat& fmt) const + { + return WithFormat(derived(), fmt); + } + + /** \returns the unique coefficient of a 1x1 expression */ + EIGEN_DEVICE_FUNC + CoeffReturnType value() const + { + EIGEN_STATIC_ASSERT_SIZE_1x1(Derived) + eigen_assert(this->rows() == 1 && this->cols() == 1); + return derived().coeff(0,0); + } + + EIGEN_DEVICE_FUNC bool all() const; + EIGEN_DEVICE_FUNC bool any() const; + EIGEN_DEVICE_FUNC Index count() const; + + typedef VectorwiseOp RowwiseReturnType; + typedef const VectorwiseOp ConstRowwiseReturnType; + typedef VectorwiseOp ColwiseReturnType; + typedef const VectorwiseOp ConstColwiseReturnType; + + /** \returns a VectorwiseOp wrapper of *this providing additional partial reduction operations + * + * Example: \include MatrixBase_rowwise.cpp + * Output: \verbinclude MatrixBase_rowwise.out + * + * \sa colwise(), class VectorwiseOp, \ref TutorialReductionsVisitorsBroadcasting + */ + //Code moved here due to a CUDA compiler bug + EIGEN_DEVICE_FUNC inline ConstRowwiseReturnType rowwise() const { + return ConstRowwiseReturnType(derived()); + } + EIGEN_DEVICE_FUNC RowwiseReturnType rowwise(); + + /** \returns a VectorwiseOp wrapper of *this providing additional partial reduction operations + * + * Example: \include MatrixBase_colwise.cpp + * Output: \verbinclude MatrixBase_colwise.out + * + * \sa rowwise(), class VectorwiseOp, \ref TutorialReductionsVisitorsBroadcasting + */ + EIGEN_DEVICE_FUNC inline ConstColwiseReturnType colwise() const { + return ConstColwiseReturnType(derived()); + } + EIGEN_DEVICE_FUNC ColwiseReturnType colwise(); + + typedef CwiseNullaryOp,PlainObject> RandomReturnType; + static const RandomReturnType Random(Index rows, Index cols); + static const RandomReturnType Random(Index size); + static const RandomReturnType Random(); + + template + const Select + select(const DenseBase& thenMatrix, + const DenseBase& elseMatrix) const; + + template + inline const Select + select(const DenseBase& thenMatrix, const typename ThenDerived::Scalar& elseScalar) const; + + template + inline const Select + select(const typename ElseDerived::Scalar& thenScalar, const DenseBase& elseMatrix) const; + + template RealScalar lpNorm() const; + + template + EIGEN_DEVICE_FUNC + const Replicate replicate() const; + /** + * \return an expression of the replication of \c *this + * + * Example: \include MatrixBase_replicate_int_int.cpp + * Output: \verbinclude MatrixBase_replicate_int_int.out + * + * \sa VectorwiseOp::replicate(), DenseBase::replicate(), class Replicate + */ + //Code moved here due to a CUDA compiler bug + EIGEN_DEVICE_FUNC + const Replicate replicate(Index rowFactor, Index colFactor) const + { + return Replicate(derived(), rowFactor, colFactor); + } + + typedef Reverse ReverseReturnType; + typedef const Reverse ConstReverseReturnType; + EIGEN_DEVICE_FUNC ReverseReturnType reverse(); + /** This is the const version of reverse(). */ + //Code moved here due to a CUDA compiler bug + EIGEN_DEVICE_FUNC ConstReverseReturnType reverse() const + { + return ConstReverseReturnType(derived()); + } + EIGEN_DEVICE_FUNC void reverseInPlace(); + +#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::DenseBase +#define EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL +#define EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(COND) +#define EIGEN_DOC_UNARY_ADDONS(X,Y) +# include "../plugins/CommonCwiseUnaryOps.h" +# include "../plugins/BlockMethods.h" +# include "../plugins/IndexedViewMethods.h" +# ifdef EIGEN_DENSEBASE_PLUGIN +# include EIGEN_DENSEBASE_PLUGIN +# endif +#undef EIGEN_CURRENT_STORAGE_BASE_CLASS +#undef EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL +#undef EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF +#undef EIGEN_DOC_UNARY_ADDONS + + // disable the use of evalTo for dense objects with a nice compilation error + template + EIGEN_DEVICE_FUNC + inline void evalTo(Dest& ) const + { + EIGEN_STATIC_ASSERT((internal::is_same::value),THE_EVAL_EVALTO_FUNCTION_SHOULD_NEVER_BE_CALLED_FOR_DENSE_OBJECTS); + } + + protected: + /** Default constructor. Do nothing. */ + EIGEN_DEVICE_FUNC DenseBase() + { + /* Just checks for self-consistency of the flags. + * Only do it when debugging Eigen, as this borders on paranoiac and could slow compilation down + */ +#ifdef EIGEN_INTERNAL_DEBUGGING + EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, int(IsRowMajor)) + && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, int(!IsRowMajor))), + INVALID_STORAGE_ORDER_FOR_THIS_VECTOR_EXPRESSION) +#endif + } + + private: + EIGEN_DEVICE_FUNC explicit DenseBase(int); + EIGEN_DEVICE_FUNC DenseBase(int,int); + template EIGEN_DEVICE_FUNC explicit DenseBase(const DenseBase&); +}; + +} // end namespace Eigen + +#endif // EIGEN_DENSEBASE_H diff --git a/Eigen/src/Core/DenseCoeffsBase.h b/Eigen/src/Core/DenseCoeffsBase.h new file mode 100644 index 000000000..c4af48ab6 --- /dev/null +++ b/Eigen/src/Core/DenseCoeffsBase.h @@ -0,0 +1,681 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DENSECOEFFSBASE_H +#define EIGEN_DENSECOEFFSBASE_H + +namespace Eigen { + +namespace internal { +template struct add_const_on_value_type_if_arithmetic +{ + typedef typename conditional::value, T, typename add_const_on_value_type::type>::type type; +}; +} + +/** \brief Base class providing read-only coefficient access to matrices and arrays. + * \ingroup Core_Module + * \tparam Derived Type of the derived class + * \tparam #ReadOnlyAccessors Constant indicating read-only access + * + * This class defines the \c operator() \c const function and friends, which can be used to read specific + * entries of a matrix or array. + * + * \sa DenseCoeffsBase, DenseCoeffsBase, + * \ref TopicClassHierarchy + */ +template +class DenseCoeffsBase : public EigenBase +{ + public: + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::packet_traits::type PacketScalar; + + // Explanation for this CoeffReturnType typedef. + // - This is the return type of the coeff() method. + // - The LvalueBit means exactly that we can offer a coeffRef() method, which means exactly that we can get references + // to coeffs, which means exactly that we can have coeff() return a const reference (as opposed to returning a value). + // - The is_artihmetic check is required since "const int", "const double", etc. will cause warnings on some systems + // while the declaration of "const T", where T is a non arithmetic type does not. Always returning "const Scalar&" is + // not possible, since the underlying expressions might not offer a valid address the reference could be referring to. + typedef typename internal::conditional::Flags&LvalueBit), + const Scalar&, + typename internal::conditional::value, Scalar, const Scalar>::type + >::type CoeffReturnType; + + typedef typename internal::add_const_on_value_type_if_arithmetic< + typename internal::packet_traits::type + >::type PacketReturnType; + + typedef EigenBase Base; + using Base::rows; + using Base::cols; + using Base::size; + using Base::derived; + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index rowIndexByOuterInner(Index outer, Index inner) const + { + return int(Derived::RowsAtCompileTime) == 1 ? 0 + : int(Derived::ColsAtCompileTime) == 1 ? inner + : int(Derived::Flags)&RowMajorBit ? outer + : inner; + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index colIndexByOuterInner(Index outer, Index inner) const + { + return int(Derived::ColsAtCompileTime) == 1 ? 0 + : int(Derived::RowsAtCompileTime) == 1 ? inner + : int(Derived::Flags)&RowMajorBit ? inner + : outer; + } + + /** Short version: don't use this function, use + * \link operator()(Index,Index) const \endlink instead. + * + * Long version: this function is similar to + * \link operator()(Index,Index) const \endlink, but without the assertion. + * Use this for limiting the performance cost of debugging code when doing + * repeated coefficient access. Only use this when it is guaranteed that the + * parameters \a row and \a col are in range. + * + * If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this + * function equivalent to \link operator()(Index,Index) const \endlink. + * + * \sa operator()(Index,Index) const, coeffRef(Index,Index), coeff(Index) const + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType coeff(Index row, Index col) const + { + eigen_internal_assert(row >= 0 && row < rows() + && col >= 0 && col < cols()); + return internal::evaluator(derived()).coeff(row,col); + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType coeffByOuterInner(Index outer, Index inner) const + { + return coeff(rowIndexByOuterInner(outer, inner), + colIndexByOuterInner(outer, inner)); + } + + /** \returns the coefficient at given the given row and column. + * + * \sa operator()(Index,Index), operator[](Index) + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType operator()(Index row, Index col) const + { + eigen_assert(row >= 0 && row < rows() + && col >= 0 && col < cols()); + return coeff(row, col); + } + + /** Short version: don't use this function, use + * \link operator[](Index) const \endlink instead. + * + * Long version: this function is similar to + * \link operator[](Index) const \endlink, but without the assertion. + * Use this for limiting the performance cost of debugging code when doing + * repeated coefficient access. Only use this when it is guaranteed that the + * parameter \a index is in range. + * + * If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this + * function equivalent to \link operator[](Index) const \endlink. + * + * \sa operator[](Index) const, coeffRef(Index), coeff(Index,Index) const + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + coeff(Index index) const + { + EIGEN_STATIC_ASSERT(internal::evaluator::Flags & LinearAccessBit, + THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS) + eigen_internal_assert(index >= 0 && index < size()); + return internal::evaluator(derived()).coeff(index); + } + + + /** \returns the coefficient at given index. + * + * This method is allowed only for vector expressions, and for matrix expressions having the LinearAccessBit. + * + * \sa operator[](Index), operator()(Index,Index) const, x() const, y() const, + * z() const, w() const + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + operator[](Index index) const + { + EIGEN_STATIC_ASSERT(Derived::IsVectorAtCompileTime, + THE_BRACKET_OPERATOR_IS_ONLY_FOR_VECTORS__USE_THE_PARENTHESIS_OPERATOR_INSTEAD) + eigen_assert(index >= 0 && index < size()); + return coeff(index); + } + + /** \returns the coefficient at given index. + * + * This is synonymous to operator[](Index) const. + * + * This method is allowed only for vector expressions, and for matrix expressions having the LinearAccessBit. + * + * \sa operator[](Index), operator()(Index,Index) const, x() const, y() const, + * z() const, w() const + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + operator()(Index index) const + { + eigen_assert(index >= 0 && index < size()); + return coeff(index); + } + + /** equivalent to operator[](0). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + x() const { return (*this)[0]; } + + /** equivalent to operator[](1). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + y() const + { + EIGEN_STATIC_ASSERT(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=2, OUT_OF_RANGE_ACCESS); + return (*this)[1]; + } + + /** equivalent to operator[](2). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + z() const + { + EIGEN_STATIC_ASSERT(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=3, OUT_OF_RANGE_ACCESS); + return (*this)[2]; + } + + /** equivalent to operator[](3). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE CoeffReturnType + w() const + { + EIGEN_STATIC_ASSERT(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=4, OUT_OF_RANGE_ACCESS); + return (*this)[3]; + } + + /** \internal + * \returns the packet of coefficients starting at the given row and column. It is your responsibility + * to ensure that a packet really starts there. This method is only available on expressions having the + * PacketAccessBit. + * + * The \a LoadMode parameter may have the value \a #Aligned or \a #Unaligned. Its effect is to select + * the appropriate vectorization instruction. Aligned access is faster, but is only possible for packets + * starting at an address which is a multiple of the packet size. + */ + + template + EIGEN_STRONG_INLINE PacketReturnType packet(Index row, Index col) const + { + typedef typename internal::packet_traits::type DefaultPacketType; + eigen_internal_assert(row >= 0 && row < rows() && col >= 0 && col < cols()); + return internal::evaluator(derived()).template packet(row,col); + } + + + /** \internal */ + template + EIGEN_STRONG_INLINE PacketReturnType packetByOuterInner(Index outer, Index inner) const + { + return packet(rowIndexByOuterInner(outer, inner), + colIndexByOuterInner(outer, inner)); + } + + /** \internal + * \returns the packet of coefficients starting at the given index. It is your responsibility + * to ensure that a packet really starts there. This method is only available on expressions having the + * PacketAccessBit and the LinearAccessBit. + * + * The \a LoadMode parameter may have the value \a #Aligned or \a #Unaligned. Its effect is to select + * the appropriate vectorization instruction. Aligned access is faster, but is only possible for packets + * starting at an address which is a multiple of the packet size. + */ + + template + EIGEN_STRONG_INLINE PacketReturnType packet(Index index) const + { + EIGEN_STATIC_ASSERT(internal::evaluator::Flags & LinearAccessBit, + THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS) + typedef typename internal::packet_traits::type DefaultPacketType; + eigen_internal_assert(index >= 0 && index < size()); + return internal::evaluator(derived()).template packet(index); + } + + protected: + // explanation: DenseBase is doing "using ..." on the methods from DenseCoeffsBase. + // But some methods are only available in the DirectAccess case. + // So we add dummy methods here with these names, so that "using... " doesn't fail. + // It's not private so that the child class DenseBase can access them, and it's not public + // either since it's an implementation detail, so has to be protected. + void coeffRef(); + void coeffRefByOuterInner(); + void writePacket(); + void writePacketByOuterInner(); + void copyCoeff(); + void copyCoeffByOuterInner(); + void copyPacket(); + void copyPacketByOuterInner(); + void stride(); + void innerStride(); + void outerStride(); + void rowStride(); + void colStride(); +}; + +/** \brief Base class providing read/write coefficient access to matrices and arrays. + * \ingroup Core_Module + * \tparam Derived Type of the derived class + * \tparam #WriteAccessors Constant indicating read/write access + * + * This class defines the non-const \c operator() function and friends, which can be used to write specific + * entries of a matrix or array. This class inherits DenseCoeffsBase which + * defines the const variant for reading specific entries. + * + * \sa DenseCoeffsBase, \ref TopicClassHierarchy + */ +template +class DenseCoeffsBase : public DenseCoeffsBase +{ + public: + + typedef DenseCoeffsBase Base; + + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::packet_traits::type PacketScalar; + typedef typename NumTraits::Real RealScalar; + + using Base::coeff; + using Base::rows; + using Base::cols; + using Base::size; + using Base::derived; + using Base::rowIndexByOuterInner; + using Base::colIndexByOuterInner; + using Base::operator[]; + using Base::operator(); + using Base::x; + using Base::y; + using Base::z; + using Base::w; + + /** Short version: don't use this function, use + * \link operator()(Index,Index) \endlink instead. + * + * Long version: this function is similar to + * \link operator()(Index,Index) \endlink, but without the assertion. + * Use this for limiting the performance cost of debugging code when doing + * repeated coefficient access. Only use this when it is guaranteed that the + * parameters \a row and \a col are in range. + * + * If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this + * function equivalent to \link operator()(Index,Index) \endlink. + * + * \sa operator()(Index,Index), coeff(Index, Index) const, coeffRef(Index) + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& coeffRef(Index row, Index col) + { + eigen_internal_assert(row >= 0 && row < rows() + && col >= 0 && col < cols()); + return internal::evaluator(derived()).coeffRef(row,col); + } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + coeffRefByOuterInner(Index outer, Index inner) + { + return coeffRef(rowIndexByOuterInner(outer, inner), + colIndexByOuterInner(outer, inner)); + } + + /** \returns a reference to the coefficient at given the given row and column. + * + * \sa operator[](Index) + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + operator()(Index row, Index col) + { + eigen_assert(row >= 0 && row < rows() + && col >= 0 && col < cols()); + return coeffRef(row, col); + } + + + /** Short version: don't use this function, use + * \link operator[](Index) \endlink instead. + * + * Long version: this function is similar to + * \link operator[](Index) \endlink, but without the assertion. + * Use this for limiting the performance cost of debugging code when doing + * repeated coefficient access. Only use this when it is guaranteed that the + * parameters \a row and \a col are in range. + * + * If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this + * function equivalent to \link operator[](Index) \endlink. + * + * \sa operator[](Index), coeff(Index) const, coeffRef(Index,Index) + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + coeffRef(Index index) + { + EIGEN_STATIC_ASSERT(internal::evaluator::Flags & LinearAccessBit, + THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS) + eigen_internal_assert(index >= 0 && index < size()); + return internal::evaluator(derived()).coeffRef(index); + } + + /** \returns a reference to the coefficient at given index. + * + * This method is allowed only for vector expressions, and for matrix expressions having the LinearAccessBit. + * + * \sa operator[](Index) const, operator()(Index,Index), x(), y(), z(), w() + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + operator[](Index index) + { + EIGEN_STATIC_ASSERT(Derived::IsVectorAtCompileTime, + THE_BRACKET_OPERATOR_IS_ONLY_FOR_VECTORS__USE_THE_PARENTHESIS_OPERATOR_INSTEAD) + eigen_assert(index >= 0 && index < size()); + return coeffRef(index); + } + + /** \returns a reference to the coefficient at given index. + * + * This is synonymous to operator[](Index). + * + * This method is allowed only for vector expressions, and for matrix expressions having the LinearAccessBit. + * + * \sa operator[](Index) const, operator()(Index,Index), x(), y(), z(), w() + */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + operator()(Index index) + { + eigen_assert(index >= 0 && index < size()); + return coeffRef(index); + } + + /** equivalent to operator[](0). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + x() { return (*this)[0]; } + + /** equivalent to operator[](1). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + y() + { + EIGEN_STATIC_ASSERT(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=2, OUT_OF_RANGE_ACCESS); + return (*this)[1]; + } + + /** equivalent to operator[](2). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + z() + { + EIGEN_STATIC_ASSERT(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=3, OUT_OF_RANGE_ACCESS); + return (*this)[2]; + } + + /** equivalent to operator[](3). */ + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& + w() + { + EIGEN_STATIC_ASSERT(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=4, OUT_OF_RANGE_ACCESS); + return (*this)[3]; + } +}; + +/** \brief Base class providing direct read-only coefficient access to matrices and arrays. + * \ingroup Core_Module + * \tparam Derived Type of the derived class + * \tparam #DirectAccessors Constant indicating direct access + * + * This class defines functions to work with strides which can be used to access entries directly. This class + * inherits DenseCoeffsBase which defines functions to access entries read-only using + * \c operator() . + * + * \sa \blank \ref TopicClassHierarchy + */ +template +class DenseCoeffsBase : public DenseCoeffsBase +{ + public: + + typedef DenseCoeffsBase Base; + typedef typename internal::traits::Scalar Scalar; + typedef typename NumTraits::Real RealScalar; + + using Base::rows; + using Base::cols; + using Base::size; + using Base::derived; + + /** \returns the pointer increment between two consecutive elements within a slice in the inner direction. + * + * \sa outerStride(), rowStride(), colStride() + */ + EIGEN_DEVICE_FUNC + inline Index innerStride() const + { + return derived().innerStride(); + } + + /** \returns the pointer increment between two consecutive inner slices (for example, between two consecutive columns + * in a column-major matrix). + * + * \sa innerStride(), rowStride(), colStride() + */ + EIGEN_DEVICE_FUNC + inline Index outerStride() const + { + return derived().outerStride(); + } + + // FIXME shall we remove it ? + inline Index stride() const + { + return Derived::IsVectorAtCompileTime ? innerStride() : outerStride(); + } + + /** \returns the pointer increment between two consecutive rows. + * + * \sa innerStride(), outerStride(), colStride() + */ + EIGEN_DEVICE_FUNC + inline Index rowStride() const + { + return Derived::IsRowMajor ? outerStride() : innerStride(); + } + + /** \returns the pointer increment between two consecutive columns. + * + * \sa innerStride(), outerStride(), rowStride() + */ + EIGEN_DEVICE_FUNC + inline Index colStride() const + { + return Derived::IsRowMajor ? innerStride() : outerStride(); + } +}; + +/** \brief Base class providing direct read/write coefficient access to matrices and arrays. + * \ingroup Core_Module + * \tparam Derived Type of the derived class + * \tparam #DirectWriteAccessors Constant indicating direct access + * + * This class defines functions to work with strides which can be used to access entries directly. This class + * inherits DenseCoeffsBase which defines functions to access entries read/write using + * \c operator(). + * + * \sa \blank \ref TopicClassHierarchy + */ +template +class DenseCoeffsBase + : public DenseCoeffsBase +{ + public: + + typedef DenseCoeffsBase Base; + typedef typename internal::traits::Scalar Scalar; + typedef typename NumTraits::Real RealScalar; + + using Base::rows; + using Base::cols; + using Base::size; + using Base::derived; + + /** \returns the pointer increment between two consecutive elements within a slice in the inner direction. + * + * \sa outerStride(), rowStride(), colStride() + */ + EIGEN_DEVICE_FUNC + inline Index innerStride() const + { + return derived().innerStride(); + } + + /** \returns the pointer increment between two consecutive inner slices (for example, between two consecutive columns + * in a column-major matrix). + * + * \sa innerStride(), rowStride(), colStride() + */ + EIGEN_DEVICE_FUNC + inline Index outerStride() const + { + return derived().outerStride(); + } + + // FIXME shall we remove it ? + inline Index stride() const + { + return Derived::IsVectorAtCompileTime ? innerStride() : outerStride(); + } + + /** \returns the pointer increment between two consecutive rows. + * + * \sa innerStride(), outerStride(), colStride() + */ + EIGEN_DEVICE_FUNC + inline Index rowStride() const + { + return Derived::IsRowMajor ? outerStride() : innerStride(); + } + + /** \returns the pointer increment between two consecutive columns. + * + * \sa innerStride(), outerStride(), rowStride() + */ + EIGEN_DEVICE_FUNC + inline Index colStride() const + { + return Derived::IsRowMajor ? innerStride() : outerStride(); + } +}; + +namespace internal { + +template +struct first_aligned_impl +{ + static inline Index run(const Derived&) + { return 0; } +}; + +template +struct first_aligned_impl +{ + static inline Index run(const Derived& m) + { + return internal::first_aligned(m.data(), m.size()); + } +}; + +/** \internal \returns the index of the first element of the array stored by \a m that is properly aligned with respect to \a Alignment for vectorization. + * + * \tparam Alignment requested alignment in Bytes. + * + * There is also the variant first_aligned(const Scalar*, Integer) defined in Memory.h. See it for more + * documentation. + */ +template +static inline Index first_aligned(const DenseBase& m) +{ + enum { ReturnZero = (int(evaluator::Alignment) >= Alignment) || !(Derived::Flags & DirectAccessBit) }; + return first_aligned_impl::run(m.derived()); +} + +template +static inline Index first_default_aligned(const DenseBase& m) +{ + typedef typename Derived::Scalar Scalar; + typedef typename packet_traits::type DefaultPacketType; + return internal::first_aligned::alignment),Derived>(m); +} + +template::ret> +struct inner_stride_at_compile_time +{ + enum { ret = traits::InnerStrideAtCompileTime }; +}; + +template +struct inner_stride_at_compile_time +{ + enum { ret = 0 }; +}; + +template::ret> +struct outer_stride_at_compile_time +{ + enum { ret = traits::OuterStrideAtCompileTime }; +}; + +template +struct outer_stride_at_compile_time +{ + enum { ret = 0 }; +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_DENSECOEFFSBASE_H diff --git a/Eigen/src/Core/DenseStorage.h b/Eigen/src/Core/DenseStorage.h new file mode 100644 index 000000000..7958feeb9 --- /dev/null +++ b/Eigen/src/Core/DenseStorage.h @@ -0,0 +1,570 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2006-2009 Benoit Jacob +// Copyright (C) 2010-2013 Hauke Heibel +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MATRIXSTORAGE_H +#define EIGEN_MATRIXSTORAGE_H + +#ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN + #define EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(X) X; EIGEN_DENSE_STORAGE_CTOR_PLUGIN; +#else + #define EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(X) +#endif + +namespace Eigen { + +namespace internal { + +struct constructor_without_unaligned_array_assert {}; + +template +EIGEN_DEVICE_FUNC +void check_static_allocation_size() +{ + // if EIGEN_STACK_ALLOCATION_LIMIT is defined to 0, then no limit + #if EIGEN_STACK_ALLOCATION_LIMIT + EIGEN_STATIC_ASSERT(Size * sizeof(T) <= EIGEN_STACK_ALLOCATION_LIMIT, OBJECT_ALLOCATED_ON_STACK_IS_TOO_BIG); + #endif +} + +/** \internal + * Static array. If the MatrixOrArrayOptions require auto-alignment, the array will be automatically aligned: + * to 16 bytes boundary if the total size is a multiple of 16 bytes. + */ +template ::value > +struct plain_array +{ + T array[Size]; + + EIGEN_DEVICE_FUNC + plain_array() + { + check_static_allocation_size(); + } + + EIGEN_DEVICE_FUNC + plain_array(constructor_without_unaligned_array_assert) + { + check_static_allocation_size(); + } +}; + +#if defined(EIGEN_DISABLE_UNALIGNED_ARRAY_ASSERT) + #define EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(sizemask) +#elif EIGEN_GNUC_AT_LEAST(4,7) + // GCC 4.7 is too aggressive in its optimizations and remove the alignement test based on the fact the array is declared to be aligned. + // See this bug report: http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53900 + // Hiding the origin of the array pointer behind a function argument seems to do the trick even if the function is inlined: + template + EIGEN_ALWAYS_INLINE PtrType eigen_unaligned_array_assert_workaround_gcc47(PtrType array) { return array; } + #define EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(sizemask) \ + eigen_assert((internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (sizemask)) == 0 \ + && "this assertion is explained here: " \ + "http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html" \ + " **** READ THIS WEB PAGE !!! ****"); +#else + #define EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(sizemask) \ + eigen_assert((internal::UIntPtr(array) & (sizemask)) == 0 \ + && "this assertion is explained here: " \ + "http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html" \ + " **** READ THIS WEB PAGE !!! ****"); +#endif + +template +struct plain_array +{ + EIGEN_ALIGN_TO_BOUNDARY(8) T array[Size]; + + EIGEN_DEVICE_FUNC + plain_array() + { + EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(7); + check_static_allocation_size(); + } + + EIGEN_DEVICE_FUNC + plain_array(constructor_without_unaligned_array_assert) + { + check_static_allocation_size(); + } +}; + +template +struct plain_array +{ + EIGEN_ALIGN_TO_BOUNDARY(16) T array[Size]; + + EIGEN_DEVICE_FUNC + plain_array() + { + EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(15); + check_static_allocation_size(); + } + + EIGEN_DEVICE_FUNC + plain_array(constructor_without_unaligned_array_assert) + { + check_static_allocation_size(); + } +}; + +template +struct plain_array +{ + EIGEN_ALIGN_TO_BOUNDARY(32) T array[Size]; + + EIGEN_DEVICE_FUNC + plain_array() + { + EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(31); + check_static_allocation_size(); + } + + EIGEN_DEVICE_FUNC + plain_array(constructor_without_unaligned_array_assert) + { + check_static_allocation_size(); + } +}; + +template +struct plain_array +{ + EIGEN_ALIGN_TO_BOUNDARY(64) T array[Size]; + + EIGEN_DEVICE_FUNC + plain_array() + { + EIGEN_MAKE_UNALIGNED_ARRAY_ASSERT(63); + check_static_allocation_size(); + } + + EIGEN_DEVICE_FUNC + plain_array(constructor_without_unaligned_array_assert) + { + check_static_allocation_size(); + } +}; + +template +struct plain_array +{ + T array[1]; + EIGEN_DEVICE_FUNC plain_array() {} + EIGEN_DEVICE_FUNC plain_array(constructor_without_unaligned_array_assert) {} +}; + +} // end namespace internal + +/** \internal + * + * \class DenseStorage + * \ingroup Core_Module + * + * \brief Stores the data of a matrix + * + * This class stores the data of fixed-size, dynamic-size or mixed matrices + * in a way as compact as possible. + * + * \sa Matrix + */ +template class DenseStorage; + +// purely fixed-size matrix +template class DenseStorage +{ + internal::plain_array m_data; + public: + EIGEN_DEVICE_FUNC DenseStorage() { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(Index size = Size) + } + EIGEN_DEVICE_FUNC + explicit DenseStorage(internal::constructor_without_unaligned_array_assert) + : m_data(internal::constructor_without_unaligned_array_assert()) {} + EIGEN_DEVICE_FUNC + DenseStorage(const DenseStorage& other) : m_data(other.m_data) { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(Index size = Size) + } + EIGEN_DEVICE_FUNC + DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) m_data = other.m_data; + return *this; + } + EIGEN_DEVICE_FUNC DenseStorage(Index size, Index rows, Index cols) { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + eigen_internal_assert(size==rows*cols && rows==_Rows && cols==_Cols); + EIGEN_UNUSED_VARIABLE(size); + EIGEN_UNUSED_VARIABLE(rows); + EIGEN_UNUSED_VARIABLE(cols); + } + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); } + EIGEN_DEVICE_FUNC static Index rows(void) {return _Rows;} + EIGEN_DEVICE_FUNC static Index cols(void) {return _Cols;} + EIGEN_DEVICE_FUNC void conservativeResize(Index,Index,Index) {} + EIGEN_DEVICE_FUNC void resize(Index,Index,Index) {} + EIGEN_DEVICE_FUNC const T *data() const { return m_data.array; } + EIGEN_DEVICE_FUNC T *data() { return m_data.array; } +}; + +// null matrix +template class DenseStorage +{ + public: + EIGEN_DEVICE_FUNC DenseStorage() {} + EIGEN_DEVICE_FUNC explicit DenseStorage(internal::constructor_without_unaligned_array_assert) {} + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage&) {} + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage&) { return *this; } + EIGEN_DEVICE_FUNC DenseStorage(Index,Index,Index) {} + EIGEN_DEVICE_FUNC void swap(DenseStorage& ) {} + EIGEN_DEVICE_FUNC static Index rows(void) {return _Rows;} + EIGEN_DEVICE_FUNC static Index cols(void) {return _Cols;} + EIGEN_DEVICE_FUNC void conservativeResize(Index,Index,Index) {} + EIGEN_DEVICE_FUNC void resize(Index,Index,Index) {} + EIGEN_DEVICE_FUNC const T *data() const { return 0; } + EIGEN_DEVICE_FUNC T *data() { return 0; } +}; + +// more specializations for null matrices; these are necessary to resolve ambiguities +template class DenseStorage +: public DenseStorage { }; + +template class DenseStorage +: public DenseStorage { }; + +template class DenseStorage +: public DenseStorage { }; + +// dynamic-size matrix with fixed-size storage +template class DenseStorage +{ + internal::plain_array m_data; + Index m_rows; + Index m_cols; + public: + EIGEN_DEVICE_FUNC DenseStorage() : m_rows(0), m_cols(0) {} + EIGEN_DEVICE_FUNC explicit DenseStorage(internal::constructor_without_unaligned_array_assert) + : m_data(internal::constructor_without_unaligned_array_assert()), m_rows(0), m_cols(0) {} + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage& other) : m_data(other.m_data), m_rows(other.m_rows), m_cols(other.m_cols) {} + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) + { + m_data = other.m_data; + m_rows = other.m_rows; + m_cols = other.m_cols; + } + return *this; + } + EIGEN_DEVICE_FUNC DenseStorage(Index, Index rows, Index cols) : m_rows(rows), m_cols(cols) {} + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) + { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); std::swap(m_cols,other.m_cols); } + EIGEN_DEVICE_FUNC Index rows() const {return m_rows;} + EIGEN_DEVICE_FUNC Index cols() const {return m_cols;} + EIGEN_DEVICE_FUNC void conservativeResize(Index, Index rows, Index cols) { m_rows = rows; m_cols = cols; } + EIGEN_DEVICE_FUNC void resize(Index, Index rows, Index cols) { m_rows = rows; m_cols = cols; } + EIGEN_DEVICE_FUNC const T *data() const { return m_data.array; } + EIGEN_DEVICE_FUNC T *data() { return m_data.array; } +}; + +// dynamic-size matrix with fixed-size storage and fixed width +template class DenseStorage +{ + internal::plain_array m_data; + Index m_rows; + public: + EIGEN_DEVICE_FUNC DenseStorage() : m_rows(0) {} + EIGEN_DEVICE_FUNC explicit DenseStorage(internal::constructor_without_unaligned_array_assert) + : m_data(internal::constructor_without_unaligned_array_assert()), m_rows(0) {} + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage& other) : m_data(other.m_data), m_rows(other.m_rows) {} + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) + { + m_data = other.m_data; + m_rows = other.m_rows; + } + return *this; + } + EIGEN_DEVICE_FUNC DenseStorage(Index, Index rows, Index) : m_rows(rows) {} + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); } + EIGEN_DEVICE_FUNC Index rows(void) const {return m_rows;} + EIGEN_DEVICE_FUNC Index cols(void) const {return _Cols;} + EIGEN_DEVICE_FUNC void conservativeResize(Index, Index rows, Index) { m_rows = rows; } + EIGEN_DEVICE_FUNC void resize(Index, Index rows, Index) { m_rows = rows; } + EIGEN_DEVICE_FUNC const T *data() const { return m_data.array; } + EIGEN_DEVICE_FUNC T *data() { return m_data.array; } +}; + +// dynamic-size matrix with fixed-size storage and fixed height +template class DenseStorage +{ + internal::plain_array m_data; + Index m_cols; + public: + EIGEN_DEVICE_FUNC DenseStorage() : m_cols(0) {} + EIGEN_DEVICE_FUNC explicit DenseStorage(internal::constructor_without_unaligned_array_assert) + : m_data(internal::constructor_without_unaligned_array_assert()), m_cols(0) {} + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage& other) : m_data(other.m_data), m_cols(other.m_cols) {} + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) + { + m_data = other.m_data; + m_cols = other.m_cols; + } + return *this; + } + EIGEN_DEVICE_FUNC DenseStorage(Index, Index, Index cols) : m_cols(cols) {} + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_cols,other.m_cols); } + EIGEN_DEVICE_FUNC Index rows(void) const {return _Rows;} + EIGEN_DEVICE_FUNC Index cols(void) const {return m_cols;} + void conservativeResize(Index, Index, Index cols) { m_cols = cols; } + void resize(Index, Index, Index cols) { m_cols = cols; } + EIGEN_DEVICE_FUNC const T *data() const { return m_data.array; } + EIGEN_DEVICE_FUNC T *data() { return m_data.array; } +}; + +// purely dynamic matrix. +template class DenseStorage +{ + T *m_data; + Index m_rows; + Index m_cols; + public: + EIGEN_DEVICE_FUNC DenseStorage() : m_data(0), m_rows(0), m_cols(0) {} + EIGEN_DEVICE_FUNC explicit DenseStorage(internal::constructor_without_unaligned_array_assert) + : m_data(0), m_rows(0), m_cols(0) {} + EIGEN_DEVICE_FUNC DenseStorage(Index size, Index rows, Index cols) + : m_data(internal::conditional_aligned_new_auto(size)), m_rows(rows), m_cols(cols) + { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + eigen_internal_assert(size==rows*cols && rows>=0 && cols >=0); + } + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage& other) + : m_data(internal::conditional_aligned_new_auto(other.m_rows*other.m_cols)) + , m_rows(other.m_rows) + , m_cols(other.m_cols) + { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(Index size = m_rows*m_cols) + internal::smart_copy(other.m_data, other.m_data+other.m_rows*other.m_cols, m_data); + } + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) + { + DenseStorage tmp(other); + this->swap(tmp); + } + return *this; + } +#if EIGEN_HAS_RVALUE_REFERENCES + EIGEN_DEVICE_FUNC + DenseStorage(DenseStorage&& other) EIGEN_NOEXCEPT + : m_data(std::move(other.m_data)) + , m_rows(std::move(other.m_rows)) + , m_cols(std::move(other.m_cols)) + { + other.m_data = nullptr; + other.m_rows = 0; + other.m_cols = 0; + } + EIGEN_DEVICE_FUNC + DenseStorage& operator=(DenseStorage&& other) EIGEN_NOEXCEPT + { + using std::swap; + swap(m_data, other.m_data); + swap(m_rows, other.m_rows); + swap(m_cols, other.m_cols); + return *this; + } +#endif + EIGEN_DEVICE_FUNC ~DenseStorage() { internal::conditional_aligned_delete_auto(m_data, m_rows*m_cols); } + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) + { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); std::swap(m_cols,other.m_cols); } + EIGEN_DEVICE_FUNC Index rows(void) const {return m_rows;} + EIGEN_DEVICE_FUNC Index cols(void) const {return m_cols;} + void conservativeResize(Index size, Index rows, Index cols) + { + m_data = internal::conditional_aligned_realloc_new_auto(m_data, size, m_rows*m_cols); + m_rows = rows; + m_cols = cols; + } + EIGEN_DEVICE_FUNC void resize(Index size, Index rows, Index cols) + { + if(size != m_rows*m_cols) + { + internal::conditional_aligned_delete_auto(m_data, m_rows*m_cols); + if (size) + m_data = internal::conditional_aligned_new_auto(size); + else + m_data = 0; + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + } + m_rows = rows; + m_cols = cols; + } + EIGEN_DEVICE_FUNC const T *data() const { return m_data; } + EIGEN_DEVICE_FUNC T *data() { return m_data; } +}; + +// matrix with dynamic width and fixed height (so that matrix has dynamic size). +template class DenseStorage +{ + T *m_data; + Index m_cols; + public: + EIGEN_DEVICE_FUNC DenseStorage() : m_data(0), m_cols(0) {} + explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(0), m_cols(0) {} + EIGEN_DEVICE_FUNC DenseStorage(Index size, Index rows, Index cols) : m_data(internal::conditional_aligned_new_auto(size)), m_cols(cols) + { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + eigen_internal_assert(size==rows*cols && rows==_Rows && cols >=0); + EIGEN_UNUSED_VARIABLE(rows); + } + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage& other) + : m_data(internal::conditional_aligned_new_auto(_Rows*other.m_cols)) + , m_cols(other.m_cols) + { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(Index size = m_cols*_Rows) + internal::smart_copy(other.m_data, other.m_data+_Rows*m_cols, m_data); + } + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) + { + DenseStorage tmp(other); + this->swap(tmp); + } + return *this; + } +#if EIGEN_HAS_RVALUE_REFERENCES + EIGEN_DEVICE_FUNC + DenseStorage(DenseStorage&& other) EIGEN_NOEXCEPT + : m_data(std::move(other.m_data)) + , m_cols(std::move(other.m_cols)) + { + other.m_data = nullptr; + other.m_cols = 0; + } + EIGEN_DEVICE_FUNC + DenseStorage& operator=(DenseStorage&& other) EIGEN_NOEXCEPT + { + using std::swap; + swap(m_data, other.m_data); + swap(m_cols, other.m_cols); + return *this; + } +#endif + EIGEN_DEVICE_FUNC ~DenseStorage() { internal::conditional_aligned_delete_auto(m_data, _Rows*m_cols); } + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_cols,other.m_cols); } + EIGEN_DEVICE_FUNC static Index rows(void) {return _Rows;} + EIGEN_DEVICE_FUNC Index cols(void) const {return m_cols;} + EIGEN_DEVICE_FUNC void conservativeResize(Index size, Index, Index cols) + { + m_data = internal::conditional_aligned_realloc_new_auto(m_data, size, _Rows*m_cols); + m_cols = cols; + } + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void resize(Index size, Index, Index cols) + { + if(size != _Rows*m_cols) + { + internal::conditional_aligned_delete_auto(m_data, _Rows*m_cols); + if (size) + m_data = internal::conditional_aligned_new_auto(size); + else + m_data = 0; + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + } + m_cols = cols; + } + EIGEN_DEVICE_FUNC const T *data() const { return m_data; } + EIGEN_DEVICE_FUNC T *data() { return m_data; } +}; + +// matrix with dynamic height and fixed width (so that matrix has dynamic size). +template class DenseStorage +{ + T *m_data; + Index m_rows; + public: + EIGEN_DEVICE_FUNC DenseStorage() : m_data(0), m_rows(0) {} + explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(0), m_rows(0) {} + EIGEN_DEVICE_FUNC DenseStorage(Index size, Index rows, Index cols) : m_data(internal::conditional_aligned_new_auto(size)), m_rows(rows) + { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + eigen_internal_assert(size==rows*cols && rows>=0 && cols == _Cols); + EIGEN_UNUSED_VARIABLE(cols); + } + EIGEN_DEVICE_FUNC DenseStorage(const DenseStorage& other) + : m_data(internal::conditional_aligned_new_auto(other.m_rows*_Cols)) + , m_rows(other.m_rows) + { + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN(Index size = m_rows*_Cols) + internal::smart_copy(other.m_data, other.m_data+other.m_rows*_Cols, m_data); + } + EIGEN_DEVICE_FUNC DenseStorage& operator=(const DenseStorage& other) + { + if (this != &other) + { + DenseStorage tmp(other); + this->swap(tmp); + } + return *this; + } +#if EIGEN_HAS_RVALUE_REFERENCES + EIGEN_DEVICE_FUNC + DenseStorage(DenseStorage&& other) EIGEN_NOEXCEPT + : m_data(std::move(other.m_data)) + , m_rows(std::move(other.m_rows)) + { + other.m_data = nullptr; + other.m_rows = 0; + } + EIGEN_DEVICE_FUNC + DenseStorage& operator=(DenseStorage&& other) EIGEN_NOEXCEPT + { + using std::swap; + swap(m_data, other.m_data); + swap(m_rows, other.m_rows); + return *this; + } +#endif + EIGEN_DEVICE_FUNC ~DenseStorage() { internal::conditional_aligned_delete_auto(m_data, _Cols*m_rows); } + EIGEN_DEVICE_FUNC void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); } + EIGEN_DEVICE_FUNC Index rows(void) const {return m_rows;} + EIGEN_DEVICE_FUNC static Index cols(void) {return _Cols;} + void conservativeResize(Index size, Index rows, Index) + { + m_data = internal::conditional_aligned_realloc_new_auto(m_data, size, m_rows*_Cols); + m_rows = rows; + } + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void resize(Index size, Index rows, Index) + { + if(size != m_rows*_Cols) + { + internal::conditional_aligned_delete_auto(m_data, _Cols*m_rows); + if (size) + m_data = internal::conditional_aligned_new_auto(size); + else + m_data = 0; + EIGEN_INTERNAL_DENSE_STORAGE_CTOR_PLUGIN({}) + } + m_rows = rows; + } + EIGEN_DEVICE_FUNC const T *data() const { return m_data; } + EIGEN_DEVICE_FUNC T *data() { return m_data; } +}; + +} // end namespace Eigen + +#endif // EIGEN_MATRIX_H diff --git a/Eigen/src/Core/Diagonal.h b/Eigen/src/Core/Diagonal.h new file mode 100644 index 000000000..c62f5ff21 --- /dev/null +++ b/Eigen/src/Core/Diagonal.h @@ -0,0 +1,259 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2007-2009 Benoit Jacob +// Copyright (C) 2009-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DIAGONAL_H +#define EIGEN_DIAGONAL_H + +namespace Eigen { + +/** \class Diagonal + * \ingroup Core_Module + * + * \brief Expression of a diagonal/subdiagonal/superdiagonal in a matrix + * + * \param MatrixType the type of the object in which we are taking a sub/main/super diagonal + * \param DiagIndex the index of the sub/super diagonal. The default is 0 and it means the main diagonal. + * A positive value means a superdiagonal, a negative value means a subdiagonal. + * You can also use DynamicIndex so the index can be set at runtime. + * + * The matrix is not required to be square. + * + * This class represents an expression of the main diagonal, or any sub/super diagonal + * of a square matrix. It is the return type of MatrixBase::diagonal() and MatrixBase::diagonal(Index) and most of the + * time this is the only way it is used. + * + * \sa MatrixBase::diagonal(), MatrixBase::diagonal(Index) + */ + +namespace internal { +template +struct traits > + : traits +{ + typedef typename ref_selector::type MatrixTypeNested; + typedef typename remove_reference::type _MatrixTypeNested; + typedef typename MatrixType::StorageKind StorageKind; + enum { + RowsAtCompileTime = (int(DiagIndex) == DynamicIndex || int(MatrixType::SizeAtCompileTime) == Dynamic) ? Dynamic + : (EIGEN_PLAIN_ENUM_MIN(MatrixType::RowsAtCompileTime - EIGEN_PLAIN_ENUM_MAX(-DiagIndex, 0), + MatrixType::ColsAtCompileTime - EIGEN_PLAIN_ENUM_MAX( DiagIndex, 0))), + ColsAtCompileTime = 1, + MaxRowsAtCompileTime = int(MatrixType::MaxSizeAtCompileTime) == Dynamic ? Dynamic + : DiagIndex == DynamicIndex ? EIGEN_SIZE_MIN_PREFER_FIXED(MatrixType::MaxRowsAtCompileTime, + MatrixType::MaxColsAtCompileTime) + : (EIGEN_PLAIN_ENUM_MIN(MatrixType::MaxRowsAtCompileTime - EIGEN_PLAIN_ENUM_MAX(-DiagIndex, 0), + MatrixType::MaxColsAtCompileTime - EIGEN_PLAIN_ENUM_MAX( DiagIndex, 0))), + MaxColsAtCompileTime = 1, + MaskLvalueBit = is_lvalue::value ? LvalueBit : 0, + Flags = (unsigned int)_MatrixTypeNested::Flags & (RowMajorBit | MaskLvalueBit | DirectAccessBit) & ~RowMajorBit, // FIXME DirectAccessBit should not be handled by expressions + MatrixTypeOuterStride = outer_stride_at_compile_time::ret, + InnerStrideAtCompileTime = MatrixTypeOuterStride == Dynamic ? Dynamic : MatrixTypeOuterStride+1, + OuterStrideAtCompileTime = 0 + }; +}; +} + +template class Diagonal + : public internal::dense_xpr_base< Diagonal >::type +{ + public: + + enum { DiagIndex = _DiagIndex }; + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Diagonal) + + EIGEN_DEVICE_FUNC + explicit inline Diagonal(MatrixType& matrix, Index a_index = DiagIndex) : m_matrix(matrix), m_index(a_index) {} + + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Diagonal) + + EIGEN_DEVICE_FUNC + inline Index rows() const + { + return m_index.value()<0 ? numext::mini(m_matrix.cols(),m_matrix.rows()+m_index.value()) + : numext::mini(m_matrix.rows(),m_matrix.cols()-m_index.value()); + } + + EIGEN_DEVICE_FUNC + inline Index cols() const { return 1; } + + EIGEN_DEVICE_FUNC + inline Index innerStride() const + { + return m_matrix.outerStride() + 1; + } + + EIGEN_DEVICE_FUNC + inline Index outerStride() const + { + return 0; + } + + typedef typename internal::conditional< + internal::is_lvalue::value, + Scalar, + const Scalar + >::type ScalarWithConstIfNotLvalue; + + EIGEN_DEVICE_FUNC + inline ScalarWithConstIfNotLvalue* data() { return &(m_matrix.coeffRef(rowOffset(), colOffset())); } + EIGEN_DEVICE_FUNC + inline const Scalar* data() const { return &(m_matrix.coeffRef(rowOffset(), colOffset())); } + + EIGEN_DEVICE_FUNC + inline Scalar& coeffRef(Index row, Index) + { + EIGEN_STATIC_ASSERT_LVALUE(MatrixType) + return m_matrix.coeffRef(row+rowOffset(), row+colOffset()); + } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index row, Index) const + { + return m_matrix.coeffRef(row+rowOffset(), row+colOffset()); + } + + EIGEN_DEVICE_FUNC + inline CoeffReturnType coeff(Index row, Index) const + { + return m_matrix.coeff(row+rowOffset(), row+colOffset()); + } + + EIGEN_DEVICE_FUNC + inline Scalar& coeffRef(Index idx) + { + EIGEN_STATIC_ASSERT_LVALUE(MatrixType) + return m_matrix.coeffRef(idx+rowOffset(), idx+colOffset()); + } + + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index idx) const + { + return m_matrix.coeffRef(idx+rowOffset(), idx+colOffset()); + } + + EIGEN_DEVICE_FUNC + inline CoeffReturnType coeff(Index idx) const + { + return m_matrix.coeff(idx+rowOffset(), idx+colOffset()); + } + + EIGEN_DEVICE_FUNC + inline const typename internal::remove_all::type& + nestedExpression() const + { + return m_matrix; + } + + EIGEN_DEVICE_FUNC + inline Index index() const + { + return m_index.value(); + } + + protected: + typename internal::ref_selector::non_const_type m_matrix; + const internal::variable_if_dynamicindex m_index; + + private: + // some compilers may fail to optimize std::max etc in case of compile-time constants... + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index absDiagIndex() const { return m_index.value()>0 ? m_index.value() : -m_index.value(); } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index rowOffset() const { return m_index.value()>0 ? 0 : -m_index.value(); } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index colOffset() const { return m_index.value()>0 ? m_index.value() : 0; } + // trigger a compile-time error if someone try to call packet + template typename MatrixType::PacketReturnType packet(Index) const; + template typename MatrixType::PacketReturnType packet(Index,Index) const; +}; + +/** \returns an expression of the main diagonal of the matrix \c *this + * + * \c *this is not required to be square. + * + * Example: \include MatrixBase_diagonal.cpp + * Output: \verbinclude MatrixBase_diagonal.out + * + * \sa class Diagonal */ +template +EIGEN_DEVICE_FUNC inline typename MatrixBase::DiagonalReturnType +MatrixBase::diagonal() +{ + return DiagonalReturnType(derived()); +} + +/** This is the const version of diagonal(). */ +template +EIGEN_DEVICE_FUNC inline typename MatrixBase::ConstDiagonalReturnType +MatrixBase::diagonal() const +{ + return ConstDiagonalReturnType(derived()); +} + +/** \returns an expression of the \a DiagIndex-th sub or super diagonal of the matrix \c *this + * + * \c *this is not required to be square. + * + * The template parameter \a DiagIndex represent a super diagonal if \a DiagIndex > 0 + * and a sub diagonal otherwise. \a DiagIndex == 0 is equivalent to the main diagonal. + * + * Example: \include MatrixBase_diagonal_int.cpp + * Output: \verbinclude MatrixBase_diagonal_int.out + * + * \sa MatrixBase::diagonal(), class Diagonal */ +template +EIGEN_DEVICE_FUNC inline typename MatrixBase::DiagonalDynamicIndexReturnType +MatrixBase::diagonal(Index index) +{ + return DiagonalDynamicIndexReturnType(derived(), index); +} + +/** This is the const version of diagonal(Index). */ +template +EIGEN_DEVICE_FUNC inline typename MatrixBase::ConstDiagonalDynamicIndexReturnType +MatrixBase::diagonal(Index index) const +{ + return ConstDiagonalDynamicIndexReturnType(derived(), index); +} + +/** \returns an expression of the \a DiagIndex-th sub or super diagonal of the matrix \c *this + * + * \c *this is not required to be square. + * + * The template parameter \a DiagIndex represent a super diagonal if \a DiagIndex > 0 + * and a sub diagonal otherwise. \a DiagIndex == 0 is equivalent to the main diagonal. + * + * Example: \include MatrixBase_diagonal_template_int.cpp + * Output: \verbinclude MatrixBase_diagonal_template_int.out + * + * \sa MatrixBase::diagonal(), class Diagonal */ +template +template +EIGEN_DEVICE_FUNC +inline typename MatrixBase::template DiagonalIndexReturnType::Type +MatrixBase::diagonal() +{ + return typename DiagonalIndexReturnType::Type(derived()); +} + +/** This is the const version of diagonal(). */ +template +template +EIGEN_DEVICE_FUNC +inline typename MatrixBase::template ConstDiagonalIndexReturnType::Type +MatrixBase::diagonal() const +{ + return typename ConstDiagonalIndexReturnType::Type(derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_DIAGONAL_H diff --git a/Eigen/src/Core/DiagonalMatrix.h b/Eigen/src/Core/DiagonalMatrix.h new file mode 100644 index 000000000..4e8297ee6 --- /dev/null +++ b/Eigen/src/Core/DiagonalMatrix.h @@ -0,0 +1,343 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// Copyright (C) 2007-2009 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DIAGONALMATRIX_H +#define EIGEN_DIAGONALMATRIX_H + +namespace Eigen { + +#ifndef EIGEN_PARSED_BY_DOXYGEN +template +class DiagonalBase : public EigenBase +{ + public: + typedef typename internal::traits::DiagonalVectorType DiagonalVectorType; + typedef typename DiagonalVectorType::Scalar Scalar; + typedef typename DiagonalVectorType::RealScalar RealScalar; + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::StorageIndex StorageIndex; + + enum { + RowsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, + ColsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, + MaxRowsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, + MaxColsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, + IsVectorAtCompileTime = 0, + Flags = NoPreferredStorageOrderBit + }; + + typedef Matrix DenseMatrixType; + typedef DenseMatrixType DenseType; + typedef DiagonalMatrix PlainObject; + + EIGEN_DEVICE_FUNC + inline const Derived& derived() const { return *static_cast(this); } + EIGEN_DEVICE_FUNC + inline Derived& derived() { return *static_cast(this); } + + EIGEN_DEVICE_FUNC + DenseMatrixType toDenseMatrix() const { return derived(); } + + EIGEN_DEVICE_FUNC + inline const DiagonalVectorType& diagonal() const { return derived().diagonal(); } + EIGEN_DEVICE_FUNC + inline DiagonalVectorType& diagonal() { return derived().diagonal(); } + + EIGEN_DEVICE_FUNC + inline Index rows() const { return diagonal().size(); } + EIGEN_DEVICE_FUNC + inline Index cols() const { return diagonal().size(); } + + template + EIGEN_DEVICE_FUNC + const Product + operator*(const MatrixBase &matrix) const + { + return Product(derived(),matrix.derived()); + } + + typedef DiagonalWrapper, const DiagonalVectorType> > InverseReturnType; + EIGEN_DEVICE_FUNC + inline const InverseReturnType + inverse() const + { + return InverseReturnType(diagonal().cwiseInverse()); + } + + EIGEN_DEVICE_FUNC + inline const DiagonalWrapper + operator*(const Scalar& scalar) const + { + return DiagonalWrapper(diagonal() * scalar); + } + EIGEN_DEVICE_FUNC + friend inline const DiagonalWrapper + operator*(const Scalar& scalar, const DiagonalBase& other) + { + return DiagonalWrapper(scalar * other.diagonal()); + } +}; + +#endif + +/** \class DiagonalMatrix + * \ingroup Core_Module + * + * \brief Represents a diagonal matrix with its storage + * + * \param _Scalar the type of coefficients + * \param SizeAtCompileTime the dimension of the matrix, or Dynamic + * \param MaxSizeAtCompileTime the dimension of the matrix, or Dynamic. This parameter is optional and defaults + * to SizeAtCompileTime. Most of the time, you do not need to specify it. + * + * \sa class DiagonalWrapper + */ + +namespace internal { +template +struct traits > + : traits > +{ + typedef Matrix<_Scalar,SizeAtCompileTime,1,0,MaxSizeAtCompileTime,1> DiagonalVectorType; + typedef DiagonalShape StorageKind; + enum { + Flags = LvalueBit | NoPreferredStorageOrderBit + }; +}; +} +template +class DiagonalMatrix + : public DiagonalBase > +{ + public: + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename internal::traits::DiagonalVectorType DiagonalVectorType; + typedef const DiagonalMatrix& Nested; + typedef _Scalar Scalar; + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::StorageIndex StorageIndex; + #endif + + protected: + + DiagonalVectorType m_diagonal; + + public: + + /** const version of diagonal(). */ + EIGEN_DEVICE_FUNC + inline const DiagonalVectorType& diagonal() const { return m_diagonal; } + /** \returns a reference to the stored vector of diagonal coefficients. */ + EIGEN_DEVICE_FUNC + inline DiagonalVectorType& diagonal() { return m_diagonal; } + + /** Default constructor without initialization */ + EIGEN_DEVICE_FUNC + inline DiagonalMatrix() {} + + /** Constructs a diagonal matrix with given dimension */ + EIGEN_DEVICE_FUNC + explicit inline DiagonalMatrix(Index dim) : m_diagonal(dim) {} + + /** 2D constructor. */ + EIGEN_DEVICE_FUNC + inline DiagonalMatrix(const Scalar& x, const Scalar& y) : m_diagonal(x,y) {} + + /** 3D constructor. */ + EIGEN_DEVICE_FUNC + inline DiagonalMatrix(const Scalar& x, const Scalar& y, const Scalar& z) : m_diagonal(x,y,z) {} + + /** Copy constructor. */ + template + EIGEN_DEVICE_FUNC + inline DiagonalMatrix(const DiagonalBase& other) : m_diagonal(other.diagonal()) {} + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** copy constructor. prevent a default copy constructor from hiding the other templated constructor */ + inline DiagonalMatrix(const DiagonalMatrix& other) : m_diagonal(other.diagonal()) {} + #endif + + /** generic constructor from expression of the diagonal coefficients */ + template + EIGEN_DEVICE_FUNC + explicit inline DiagonalMatrix(const MatrixBase& other) : m_diagonal(other) + {} + + /** Copy operator. */ + template + EIGEN_DEVICE_FUNC + DiagonalMatrix& operator=(const DiagonalBase& other) + { + m_diagonal = other.diagonal(); + return *this; + } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** This is a special case of the templated operator=. Its purpose is to + * prevent a default operator= from hiding the templated operator=. + */ + EIGEN_DEVICE_FUNC + DiagonalMatrix& operator=(const DiagonalMatrix& other) + { + m_diagonal = other.diagonal(); + return *this; + } + #endif + + /** Resizes to given size. */ + EIGEN_DEVICE_FUNC + inline void resize(Index size) { m_diagonal.resize(size); } + /** Sets all coefficients to zero. */ + EIGEN_DEVICE_FUNC + inline void setZero() { m_diagonal.setZero(); } + /** Resizes and sets all coefficients to zero. */ + EIGEN_DEVICE_FUNC + inline void setZero(Index size) { m_diagonal.setZero(size); } + /** Sets this matrix to be the identity matrix of the current size. */ + EIGEN_DEVICE_FUNC + inline void setIdentity() { m_diagonal.setOnes(); } + /** Sets this matrix to be the identity matrix of the given size. */ + EIGEN_DEVICE_FUNC + inline void setIdentity(Index size) { m_diagonal.setOnes(size); } +}; + +/** \class DiagonalWrapper + * \ingroup Core_Module + * + * \brief Expression of a diagonal matrix + * + * \param _DiagonalVectorType the type of the vector of diagonal coefficients + * + * This class is an expression of a diagonal matrix, but not storing its own vector of diagonal coefficients, + * instead wrapping an existing vector expression. It is the return type of MatrixBase::asDiagonal() + * and most of the time this is the only way that it is used. + * + * \sa class DiagonalMatrix, class DiagonalBase, MatrixBase::asDiagonal() + */ + +namespace internal { +template +struct traits > +{ + typedef _DiagonalVectorType DiagonalVectorType; + typedef typename DiagonalVectorType::Scalar Scalar; + typedef typename DiagonalVectorType::StorageIndex StorageIndex; + typedef DiagonalShape StorageKind; + typedef typename traits::XprKind XprKind; + enum { + RowsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, + ColsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, + MaxRowsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, + MaxColsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, + Flags = (traits::Flags & LvalueBit) | NoPreferredStorageOrderBit + }; +}; +} + +template +class DiagonalWrapper + : public DiagonalBase >, internal::no_assignment_operator +{ + public: + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef _DiagonalVectorType DiagonalVectorType; + typedef DiagonalWrapper Nested; + #endif + + /** Constructor from expression of diagonal coefficients to wrap. */ + EIGEN_DEVICE_FUNC + explicit inline DiagonalWrapper(DiagonalVectorType& a_diagonal) : m_diagonal(a_diagonal) {} + + /** \returns a const reference to the wrapped expression of diagonal coefficients. */ + EIGEN_DEVICE_FUNC + const DiagonalVectorType& diagonal() const { return m_diagonal; } + + protected: + typename DiagonalVectorType::Nested m_diagonal; +}; + +/** \returns a pseudo-expression of a diagonal matrix with *this as vector of diagonal coefficients + * + * \only_for_vectors + * + * Example: \include MatrixBase_asDiagonal.cpp + * Output: \verbinclude MatrixBase_asDiagonal.out + * + * \sa class DiagonalWrapper, class DiagonalMatrix, diagonal(), isDiagonal() + **/ +template +EIGEN_DEVICE_FUNC inline const DiagonalWrapper +MatrixBase::asDiagonal() const +{ + return DiagonalWrapper(derived()); +} + +/** \returns true if *this is approximately equal to a diagonal matrix, + * within the precision given by \a prec. + * + * Example: \include MatrixBase_isDiagonal.cpp + * Output: \verbinclude MatrixBase_isDiagonal.out + * + * \sa asDiagonal() + */ +template +bool MatrixBase::isDiagonal(const RealScalar& prec) const +{ + if(cols() != rows()) return false; + RealScalar maxAbsOnDiagonal = static_cast(-1); + for(Index j = 0; j < cols(); ++j) + { + RealScalar absOnDiagonal = numext::abs(coeff(j,j)); + if(absOnDiagonal > maxAbsOnDiagonal) maxAbsOnDiagonal = absOnDiagonal; + } + for(Index j = 0; j < cols(); ++j) + for(Index i = 0; i < j; ++i) + { + if(!internal::isMuchSmallerThan(coeff(i, j), maxAbsOnDiagonal, prec)) return false; + if(!internal::isMuchSmallerThan(coeff(j, i), maxAbsOnDiagonal, prec)) return false; + } + return true; +} + +namespace internal { + +template<> struct storage_kind_to_shape { typedef DiagonalShape Shape; }; + +struct Diagonal2Dense {}; + +template<> struct AssignmentKind { typedef Diagonal2Dense Kind; }; + +// Diagonal matrix to Dense assignment +template< typename DstXprType, typename SrcXprType, typename Functor> +struct Assignment +{ + static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &/*func*/) + { + Index dstRows = src.rows(); + Index dstCols = src.cols(); + if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) + dst.resize(dstRows, dstCols); + + dst.setZero(); + dst.diagonal() = src.diagonal(); + } + + static void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op &/*func*/) + { dst.diagonal() += src.diagonal(); } + + static void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op &/*func*/) + { dst.diagonal() -= src.diagonal(); } +}; + +} // namespace internal + +} // end namespace Eigen + +#endif // EIGEN_DIAGONALMATRIX_H diff --git a/Eigen/src/Core/DiagonalProduct.h b/Eigen/src/Core/DiagonalProduct.h new file mode 100644 index 000000000..7911d1cd1 --- /dev/null +++ b/Eigen/src/Core/DiagonalProduct.h @@ -0,0 +1,28 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2007-2009 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DIAGONALPRODUCT_H +#define EIGEN_DIAGONALPRODUCT_H + +namespace Eigen { + +/** \returns the diagonal matrix product of \c *this by the diagonal matrix \a diagonal. + */ +template +template +EIGEN_DEVICE_FUNC inline const Product +MatrixBase::operator*(const DiagonalBase &a_diagonal) const +{ + return Product(derived(),a_diagonal.derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_DIAGONALPRODUCT_H diff --git a/Eigen/src/Core/Dot.h b/Eigen/src/Core/Dot.h new file mode 100644 index 000000000..bb8e3fecc --- /dev/null +++ b/Eigen/src/Core/Dot.h @@ -0,0 +1,315 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2008, 2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DOT_H +#define EIGEN_DOT_H + +namespace Eigen { + +namespace internal { + +// helper function for dot(). The problem is that if we put that in the body of dot(), then upon calling dot +// with mismatched types, the compiler emits errors about failing to instantiate cwiseProduct BEFORE +// looking at the static assertions. Thus this is a trick to get better compile errors. +template +struct dot_nocheck +{ + typedef scalar_conj_product_op::Scalar,typename traits::Scalar> conj_prod; + typedef typename conj_prod::result_type ResScalar; + EIGEN_DEVICE_FUNC + static inline ResScalar run(const MatrixBase& a, const MatrixBase& b) + { + return a.template binaryExpr(b).sum(); + } +}; + +template +struct dot_nocheck +{ + typedef scalar_conj_product_op::Scalar,typename traits::Scalar> conj_prod; + typedef typename conj_prod::result_type ResScalar; + EIGEN_DEVICE_FUNC + static inline ResScalar run(const MatrixBase& a, const MatrixBase& b) + { + return a.transpose().template binaryExpr(b).sum(); + } +}; + +} // end namespace internal + +/** \fn MatrixBase::dot + * \returns the dot product of *this with other. + * + * \only_for_vectors + * + * \note If the scalar type is complex numbers, then this function returns the hermitian + * (sesquilinear) dot product, conjugate-linear in the first variable and linear in the + * second variable. + * + * \sa squaredNorm(), norm() + */ +template +template +EIGEN_DEVICE_FUNC +typename ScalarBinaryOpTraits::Scalar,typename internal::traits::Scalar>::ReturnType +MatrixBase::dot(const MatrixBase& other) const +{ + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) + EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(Derived,OtherDerived) +#if !(defined(EIGEN_NO_STATIC_ASSERT) && defined(EIGEN_NO_DEBUG)) + typedef internal::scalar_conj_product_op func; + EIGEN_CHECK_BINARY_COMPATIBILIY(func,Scalar,typename OtherDerived::Scalar); +#endif + + eigen_assert(size() == other.size()); + + return internal::dot_nocheck::run(*this, other); +} + +//---------- implementation of L2 norm and related functions ---------- + +/** \returns, for vectors, the squared \em l2 norm of \c *this, and for matrices the Frobenius norm. + * In both cases, it consists in the sum of the square of all the matrix entries. + * For vectors, this is also equals to the dot product of \c *this with itself. + * + * \sa dot(), norm(), lpNorm() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename NumTraits::Scalar>::Real MatrixBase::squaredNorm() const +{ + return numext::real((*this).cwiseAbs2().sum()); +} + +/** \returns, for vectors, the \em l2 norm of \c *this, and for matrices the Frobenius norm. + * In both cases, it consists in the square root of the sum of the square of all the matrix entries. + * For vectors, this is also equals to the square root of the dot product of \c *this with itself. + * + * \sa lpNorm(), dot(), squaredNorm() + */ +template +EIGEN_DEVICE_FUNC inline typename NumTraits::Scalar>::Real MatrixBase::norm() const +{ + return numext::sqrt(squaredNorm()); +} + +/** \returns an expression of the quotient of \c *this by its own norm. + * + * \warning If the input vector is too small (i.e., this->norm()==0), + * then this function returns a copy of the input. + * + * \only_for_vectors + * + * \sa norm(), normalize() + */ +template +EIGEN_DEVICE_FUNC inline const typename MatrixBase::PlainObject +MatrixBase::normalized() const +{ + typedef typename internal::nested_eval::type _Nested; + _Nested n(derived()); + RealScalar z = n.squaredNorm(); + // NOTE: after extensive benchmarking, this conditional does not impact performance, at least on recent x86 CPU + if(z>RealScalar(0)) + return n / numext::sqrt(z); + else + return n; +} + +/** Normalizes the vector, i.e. divides it by its own norm. + * + * \only_for_vectors + * + * \warning If the input vector is too small (i.e., this->norm()==0), then \c *this is left unchanged. + * + * \sa norm(), normalized() + */ +template +EIGEN_DEVICE_FUNC inline void MatrixBase::normalize() +{ + RealScalar z = squaredNorm(); + // NOTE: after extensive benchmarking, this conditional does not impact performance, at least on recent x86 CPU + if(z>RealScalar(0)) + derived() /= numext::sqrt(z); +} + +/** \returns an expression of the quotient of \c *this by its own norm while avoiding underflow and overflow. + * + * \only_for_vectors + * + * This method is analogue to the normalized() method, but it reduces the risk of + * underflow and overflow when computing the norm. + * + * \warning If the input vector is too small (i.e., this->norm()==0), + * then this function returns a copy of the input. + * + * \sa stableNorm(), stableNormalize(), normalized() + */ +template +EIGEN_DEVICE_FUNC inline const typename MatrixBase::PlainObject +MatrixBase::stableNormalized() const +{ + typedef typename internal::nested_eval::type _Nested; + _Nested n(derived()); + RealScalar w = n.cwiseAbs().maxCoeff(); + RealScalar z = (n/w).squaredNorm(); + if(z>RealScalar(0)) + return n / (numext::sqrt(z)*w); + else + return n; +} + +/** Normalizes the vector while avoid underflow and overflow + * + * \only_for_vectors + * + * This method is analogue to the normalize() method, but it reduces the risk of + * underflow and overflow when computing the norm. + * + * \warning If the input vector is too small (i.e., this->norm()==0), then \c *this is left unchanged. + * + * \sa stableNorm(), stableNormalized(), normalize() + */ +template +EIGEN_DEVICE_FUNC inline void MatrixBase::stableNormalize() +{ + RealScalar w = cwiseAbs().maxCoeff(); + RealScalar z = (derived()/w).squaredNorm(); + if(z>RealScalar(0)) + derived() /= numext::sqrt(z)*w; +} + +//---------- implementation of other norms ---------- + +namespace internal { + +template +struct lpNorm_selector +{ + typedef typename NumTraits::Scalar>::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const MatrixBase& m) + { + EIGEN_USING_STD_MATH(pow) + return pow(m.cwiseAbs().array().pow(p).sum(), RealScalar(1)/p); + } +}; + +template +struct lpNorm_selector +{ + EIGEN_DEVICE_FUNC + static inline typename NumTraits::Scalar>::Real run(const MatrixBase& m) + { + return m.cwiseAbs().sum(); + } +}; + +template +struct lpNorm_selector +{ + EIGEN_DEVICE_FUNC + static inline typename NumTraits::Scalar>::Real run(const MatrixBase& m) + { + return m.norm(); + } +}; + +template +struct lpNorm_selector +{ + typedef typename NumTraits::Scalar>::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const MatrixBase& m) + { + if(Derived::SizeAtCompileTime==0 || (Derived::SizeAtCompileTime==Dynamic && m.size()==0)) + return RealScalar(0); + return m.cwiseAbs().maxCoeff(); + } +}; + +} // end namespace internal + +/** \returns the \b coefficient-wise \f$ \ell^p \f$ norm of \c *this, that is, returns the p-th root of the sum of the p-th powers of the absolute values + * of the coefficients of \c *this. If \a p is the special value \a Eigen::Infinity, this function returns the \f$ \ell^\infty \f$ + * norm, that is the maximum of the absolute values of the coefficients of \c *this. + * + * In all cases, if \c *this is empty, then the value 0 is returned. + * + * \note For matrices, this function does not compute the operator-norm. That is, if \c *this is a matrix, then its coefficients are interpreted as a 1D vector. Nonetheless, you can easily compute the 1-norm and \f$\infty\f$-norm matrix operator norms using \link TutorialReductionsVisitorsBroadcastingReductionsNorm partial reductions \endlink. + * + * \sa norm() + */ +template +template +#ifndef EIGEN_PARSED_BY_DOXYGEN +EIGEN_DEVICE_FUNC inline typename NumTraits::Scalar>::Real +#else +EIGEN_DEVICE_FUNC MatrixBase::RealScalar +#endif +MatrixBase::lpNorm() const +{ + return internal::lpNorm_selector::run(*this); +} + +//---------- implementation of isOrthogonal / isUnitary ---------- + +/** \returns true if *this is approximately orthogonal to \a other, + * within the precision given by \a prec. + * + * Example: \include MatrixBase_isOrthogonal.cpp + * Output: \verbinclude MatrixBase_isOrthogonal.out + */ +template +template +bool MatrixBase::isOrthogonal +(const MatrixBase& other, const RealScalar& prec) const +{ + typename internal::nested_eval::type nested(derived()); + typename internal::nested_eval::type otherNested(other.derived()); + return numext::abs2(nested.dot(otherNested)) <= prec * prec * nested.squaredNorm() * otherNested.squaredNorm(); +} + +/** \returns true if *this is approximately an unitary matrix, + * within the precision given by \a prec. In the case where the \a Scalar + * type is real numbers, a unitary matrix is an orthogonal matrix, whence the name. + * + * \note This can be used to check whether a family of vectors forms an orthonormal basis. + * Indeed, \c m.isUnitary() returns true if and only if the columns (equivalently, the rows) of m form an + * orthonormal basis. + * + * Example: \include MatrixBase_isUnitary.cpp + * Output: \verbinclude MatrixBase_isUnitary.out + */ +template +bool MatrixBase::isUnitary(const RealScalar& prec) const +{ + typename internal::nested_eval::type self(derived()); + for(Index i = 0; i < cols(); ++i) + { + if(!internal::isApprox(self.col(i).squaredNorm(), static_cast(1), prec)) + return false; + for(Index j = 0; j < i; ++j) + if(!internal::isMuchSmallerThan(self.col(i).dot(self.col(j)), static_cast(1), prec)) + return false; + } + return true; +} + +} // end namespace Eigen + +#endif // EIGEN_DOT_H diff --git a/Eigen/src/Core/EigenBase.h b/Eigen/src/Core/EigenBase.h new file mode 100644 index 000000000..b195506a9 --- /dev/null +++ b/Eigen/src/Core/EigenBase.h @@ -0,0 +1,159 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Benoit Jacob +// Copyright (C) 2009 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_EIGENBASE_H +#define EIGEN_EIGENBASE_H + +namespace Eigen { + +/** \class EigenBase + * \ingroup Core_Module + * + * Common base class for all classes T such that MatrixBase has an operator=(T) and a constructor MatrixBase(T). + * + * In other words, an EigenBase object is an object that can be copied into a MatrixBase. + * + * Besides MatrixBase-derived classes, this also includes special matrix classes such as diagonal matrices, etc. + * + * Notice that this class is trivial, it is only used to disambiguate overloaded functions. + * + * \sa \blank \ref TopicClassHierarchy + */ +template struct EigenBase +{ +// typedef typename internal::plain_matrix_type::type PlainObject; + + /** \brief The interface type of indices + * \details To change this, \c \#define the preprocessor symbol \c EIGEN_DEFAULT_DENSE_INDEX_TYPE. + * \deprecated Since Eigen 3.3, its usage is deprecated. Use Eigen::Index instead. + * \sa StorageIndex, \ref TopicPreprocessorDirectives. + */ + typedef Eigen::Index Index; + + // FIXME is it needed? + typedef typename internal::traits::StorageKind StorageKind; + + /** \returns a reference to the derived object */ + EIGEN_DEVICE_FUNC + Derived& derived() { return *static_cast(this); } + /** \returns a const reference to the derived object */ + EIGEN_DEVICE_FUNC + const Derived& derived() const { return *static_cast(this); } + + EIGEN_DEVICE_FUNC + inline Derived& const_cast_derived() const + { return *static_cast(const_cast(this)); } + EIGEN_DEVICE_FUNC + inline const Derived& const_derived() const + { return *static_cast(this); } + + /** \returns the number of rows. \sa cols(), RowsAtCompileTime */ + EIGEN_DEVICE_FUNC + inline Index rows() const { return derived().rows(); } + /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/ + EIGEN_DEVICE_FUNC + inline Index cols() const { return derived().cols(); } + /** \returns the number of coefficients, which is rows()*cols(). + * \sa rows(), cols(), SizeAtCompileTime. */ + EIGEN_DEVICE_FUNC + inline Index size() const { return rows() * cols(); } + + /** \internal Don't use it, but do the equivalent: \code dst = *this; \endcode */ + template + EIGEN_DEVICE_FUNC + inline void evalTo(Dest& dst) const + { derived().evalTo(dst); } + + /** \internal Don't use it, but do the equivalent: \code dst += *this; \endcode */ + template + EIGEN_DEVICE_FUNC + inline void addTo(Dest& dst) const + { + // This is the default implementation, + // derived class can reimplement it in a more optimized way. + typename Dest::PlainObject res(rows(),cols()); + evalTo(res); + dst += res; + } + + /** \internal Don't use it, but do the equivalent: \code dst -= *this; \endcode */ + template + EIGEN_DEVICE_FUNC + inline void subTo(Dest& dst) const + { + // This is the default implementation, + // derived class can reimplement it in a more optimized way. + typename Dest::PlainObject res(rows(),cols()); + evalTo(res); + dst -= res; + } + + /** \internal Don't use it, but do the equivalent: \code dst.applyOnTheRight(*this); \endcode */ + template + EIGEN_DEVICE_FUNC inline void applyThisOnTheRight(Dest& dst) const + { + // This is the default implementation, + // derived class can reimplement it in a more optimized way. + dst = dst * this->derived(); + } + + /** \internal Don't use it, but do the equivalent: \code dst.applyOnTheLeft(*this); \endcode */ + template + EIGEN_DEVICE_FUNC inline void applyThisOnTheLeft(Dest& dst) const + { + // This is the default implementation, + // derived class can reimplement it in a more optimized way. + dst = this->derived() * dst; + } + +}; + +/*************************************************************************** +* Implementation of matrix base methods +***************************************************************************/ + +/** \brief Copies the generic expression \a other into *this. + * + * \details The expression must provide a (templated) evalTo(Derived& dst) const + * function which does the actual job. In practice, this allows any user to write + * its own special matrix without having to modify MatrixBase + * + * \returns a reference to *this. + */ +template +template +EIGEN_DEVICE_FUNC +Derived& DenseBase::operator=(const EigenBase &other) +{ + call_assignment(derived(), other.derived()); + return derived(); +} + +template +template +EIGEN_DEVICE_FUNC +Derived& DenseBase::operator+=(const EigenBase &other) +{ + call_assignment(derived(), other.derived(), internal::add_assign_op()); + return derived(); +} + +template +template +EIGEN_DEVICE_FUNC +Derived& DenseBase::operator-=(const EigenBase &other) +{ + call_assignment(derived(), other.derived(), internal::sub_assign_op()); + return derived(); +} + +} // end namespace Eigen + +#endif // EIGEN_EIGENBASE_H diff --git a/Eigen/src/Core/ForceAlignedAccess.h b/Eigen/src/Core/ForceAlignedAccess.h new file mode 100644 index 000000000..7b08b45e6 --- /dev/null +++ b/Eigen/src/Core/ForceAlignedAccess.h @@ -0,0 +1,146 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_FORCEALIGNEDACCESS_H +#define EIGEN_FORCEALIGNEDACCESS_H + +namespace Eigen { + +/** \class ForceAlignedAccess + * \ingroup Core_Module + * + * \brief Enforce aligned packet loads and stores regardless of what is requested + * + * \param ExpressionType the type of the object of which we are forcing aligned packet access + * + * This class is the return type of MatrixBase::forceAlignedAccess() + * and most of the time this is the only way it is used. + * + * \sa MatrixBase::forceAlignedAccess() + */ + +namespace internal { +template +struct traits > : public traits +{}; +} + +template class ForceAlignedAccess + : public internal::dense_xpr_base< ForceAlignedAccess >::type +{ + public: + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(ForceAlignedAccess) + + EIGEN_DEVICE_FUNC explicit inline ForceAlignedAccess(const ExpressionType& matrix) : m_expression(matrix) {} + + EIGEN_DEVICE_FUNC inline Index rows() const { return m_expression.rows(); } + EIGEN_DEVICE_FUNC inline Index cols() const { return m_expression.cols(); } + EIGEN_DEVICE_FUNC inline Index outerStride() const { return m_expression.outerStride(); } + EIGEN_DEVICE_FUNC inline Index innerStride() const { return m_expression.innerStride(); } + + EIGEN_DEVICE_FUNC inline const CoeffReturnType coeff(Index row, Index col) const + { + return m_expression.coeff(row, col); + } + + EIGEN_DEVICE_FUNC inline Scalar& coeffRef(Index row, Index col) + { + return m_expression.const_cast_derived().coeffRef(row, col); + } + + EIGEN_DEVICE_FUNC inline const CoeffReturnType coeff(Index index) const + { + return m_expression.coeff(index); + } + + EIGEN_DEVICE_FUNC inline Scalar& coeffRef(Index index) + { + return m_expression.const_cast_derived().coeffRef(index); + } + + template + inline const PacketScalar packet(Index row, Index col) const + { + return m_expression.template packet(row, col); + } + + template + inline void writePacket(Index row, Index col, const PacketScalar& x) + { + m_expression.const_cast_derived().template writePacket(row, col, x); + } + + template + inline const PacketScalar packet(Index index) const + { + return m_expression.template packet(index); + } + + template + inline void writePacket(Index index, const PacketScalar& x) + { + m_expression.const_cast_derived().template writePacket(index, x); + } + + EIGEN_DEVICE_FUNC operator const ExpressionType&() const { return m_expression; } + + protected: + const ExpressionType& m_expression; + + private: + ForceAlignedAccess& operator=(const ForceAlignedAccess&); +}; + +/** \returns an expression of *this with forced aligned access + * \sa forceAlignedAccessIf(),class ForceAlignedAccess + */ +template +inline const ForceAlignedAccess +MatrixBase::forceAlignedAccess() const +{ + return ForceAlignedAccess(derived()); +} + +/** \returns an expression of *this with forced aligned access + * \sa forceAlignedAccessIf(), class ForceAlignedAccess + */ +template +inline ForceAlignedAccess +MatrixBase::forceAlignedAccess() +{ + return ForceAlignedAccess(derived()); +} + +/** \returns an expression of *this with forced aligned access if \a Enable is true. + * \sa forceAlignedAccess(), class ForceAlignedAccess + */ +template +template +inline typename internal::add_const_on_value_type,Derived&>::type>::type +MatrixBase::forceAlignedAccessIf() const +{ + return derived(); // FIXME This should not work but apparently is never used +} + +/** \returns an expression of *this with forced aligned access if \a Enable is true. + * \sa forceAlignedAccess(), class ForceAlignedAccess + */ +template +template +inline typename internal::conditional,Derived&>::type +MatrixBase::forceAlignedAccessIf() +{ + return derived(); // FIXME This should not work but apparently is never used +} + +} // end namespace Eigen + +#endif // EIGEN_FORCEALIGNEDACCESS_H diff --git a/Eigen/src/Core/Fuzzy.h b/Eigen/src/Core/Fuzzy.h new file mode 100644 index 000000000..43aa49b2b --- /dev/null +++ b/Eigen/src/Core/Fuzzy.h @@ -0,0 +1,155 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2008 Benoit Jacob +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_FUZZY_H +#define EIGEN_FUZZY_H + +namespace Eigen { + +namespace internal +{ + +template::IsInteger> +struct isApprox_selector +{ + EIGEN_DEVICE_FUNC + static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar& prec) + { + typename internal::nested_eval::type nested(x); + typename internal::nested_eval::type otherNested(y); + return (nested - otherNested).cwiseAbs2().sum() <= prec * prec * numext::mini(nested.cwiseAbs2().sum(), otherNested.cwiseAbs2().sum()); + } +}; + +template +struct isApprox_selector +{ + EIGEN_DEVICE_FUNC + static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar&) + { + return x.matrix() == y.matrix(); + } +}; + +template::IsInteger> +struct isMuchSmallerThan_object_selector +{ + EIGEN_DEVICE_FUNC + static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar& prec) + { + return x.cwiseAbs2().sum() <= numext::abs2(prec) * y.cwiseAbs2().sum(); + } +}; + +template +struct isMuchSmallerThan_object_selector +{ + EIGEN_DEVICE_FUNC + static bool run(const Derived& x, const OtherDerived&, const typename Derived::RealScalar&) + { + return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix(); + } +}; + +template::IsInteger> +struct isMuchSmallerThan_scalar_selector +{ + EIGEN_DEVICE_FUNC + static bool run(const Derived& x, const typename Derived::RealScalar& y, const typename Derived::RealScalar& prec) + { + return x.cwiseAbs2().sum() <= numext::abs2(prec * y); + } +}; + +template +struct isMuchSmallerThan_scalar_selector +{ + EIGEN_DEVICE_FUNC + static bool run(const Derived& x, const typename Derived::RealScalar&, const typename Derived::RealScalar&) + { + return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix(); + } +}; + +} // end namespace internal + + +/** \returns \c true if \c *this is approximately equal to \a other, within the precision + * determined by \a prec. + * + * \note The fuzzy compares are done multiplicatively. Two vectors \f$ v \f$ and \f$ w \f$ + * are considered to be approximately equal within precision \f$ p \f$ if + * \f[ \Vert v - w \Vert \leqslant p\,\min(\Vert v\Vert, \Vert w\Vert). \f] + * For matrices, the comparison is done using the Hilbert-Schmidt norm (aka Frobenius norm + * L2 norm). + * + * \note Because of the multiplicativeness of this comparison, one can't use this function + * to check whether \c *this is approximately equal to the zero matrix or vector. + * Indeed, \c isApprox(zero) returns false unless \c *this itself is exactly the zero matrix + * or vector. If you want to test whether \c *this is zero, use internal::isMuchSmallerThan(const + * RealScalar&, RealScalar) instead. + * + * \sa internal::isMuchSmallerThan(const RealScalar&, RealScalar) const + */ +template +template +EIGEN_DEVICE_FUNC bool DenseBase::isApprox( + const DenseBase& other, + const RealScalar& prec +) const +{ + return internal::isApprox_selector::run(derived(), other.derived(), prec); +} + +/** \returns \c true if the norm of \c *this is much smaller than \a other, + * within the precision determined by \a prec. + * + * \note The fuzzy compares are done multiplicatively. A vector \f$ v \f$ is + * considered to be much smaller than \f$ x \f$ within precision \f$ p \f$ if + * \f[ \Vert v \Vert \leqslant p\,\vert x\vert. \f] + * + * For matrices, the comparison is done using the Hilbert-Schmidt norm. For this reason, + * the value of the reference scalar \a other should come from the Hilbert-Schmidt norm + * of a reference matrix of same dimensions. + * + * \sa isApprox(), isMuchSmallerThan(const DenseBase&, RealScalar) const + */ +template +EIGEN_DEVICE_FUNC bool DenseBase::isMuchSmallerThan( + const typename NumTraits::Real& other, + const RealScalar& prec +) const +{ + return internal::isMuchSmallerThan_scalar_selector::run(derived(), other, prec); +} + +/** \returns \c true if the norm of \c *this is much smaller than the norm of \a other, + * within the precision determined by \a prec. + * + * \note The fuzzy compares are done multiplicatively. A vector \f$ v \f$ is + * considered to be much smaller than a vector \f$ w \f$ within precision \f$ p \f$ if + * \f[ \Vert v \Vert \leqslant p\,\Vert w\Vert. \f] + * For matrices, the comparison is done using the Hilbert-Schmidt norm. + * + * \sa isApprox(), isMuchSmallerThan(const RealScalar&, RealScalar) const + */ +template +template +EIGEN_DEVICE_FUNC bool DenseBase::isMuchSmallerThan( + const DenseBase& other, + const RealScalar& prec +) const +{ + return internal::isMuchSmallerThan_object_selector::run(derived(), other.derived(), prec); +} + +} // end namespace Eigen + +#endif // EIGEN_FUZZY_H diff --git a/Eigen/src/Core/GeneralProduct.h b/Eigen/src/Core/GeneralProduct.h new file mode 100644 index 000000000..694f7cbde --- /dev/null +++ b/Eigen/src/Core/GeneralProduct.h @@ -0,0 +1,466 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2008 Benoit Jacob +// Copyright (C) 2008-2011 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_GENERAL_PRODUCT_H +#define EIGEN_GENERAL_PRODUCT_H + +namespace Eigen { + +enum { + Large = 2, + Small = 3 +}; + +// Define the threshold value to fallback from the generic matrix-matrix product +// implementation (heavy) to the lightweight coeff-based product one. +// See generic_product_impl +// in products/GeneralMatrixMatrix.h for more details. +// TODO This threshold should also be used in the compile-time selector below. +#ifndef EIGEN_GEMM_TO_COEFFBASED_THRESHOLD +// This default value has been obtained on a Haswell architecture. +#define EIGEN_GEMM_TO_COEFFBASED_THRESHOLD 20 +#endif + +namespace internal { + +template struct product_type_selector; + +template struct product_size_category +{ + enum { + #ifndef EIGEN_CUDA_ARCH + is_large = MaxSize == Dynamic || + Size >= EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD || + (Size==Dynamic && MaxSize>=EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD), + #else + is_large = 0, + #endif + value = is_large ? Large + : Size == 1 ? 1 + : Small + }; +}; + +template struct product_type +{ + typedef typename remove_all::type _Lhs; + typedef typename remove_all::type _Rhs; + enum { + MaxRows = traits<_Lhs>::MaxRowsAtCompileTime, + Rows = traits<_Lhs>::RowsAtCompileTime, + MaxCols = traits<_Rhs>::MaxColsAtCompileTime, + Cols = traits<_Rhs>::ColsAtCompileTime, + MaxDepth = EIGEN_SIZE_MIN_PREFER_FIXED(traits<_Lhs>::MaxColsAtCompileTime, + traits<_Rhs>::MaxRowsAtCompileTime), + Depth = EIGEN_SIZE_MIN_PREFER_FIXED(traits<_Lhs>::ColsAtCompileTime, + traits<_Rhs>::RowsAtCompileTime) + }; + + // the splitting into different lines of code here, introducing the _select enums and the typedef below, + // is to work around an internal compiler error with gcc 4.1 and 4.2. +private: + enum { + rows_select = product_size_category::value, + cols_select = product_size_category::value, + depth_select = product_size_category::value + }; + typedef product_type_selector selector; + +public: + enum { + value = selector::ret, + ret = selector::ret + }; +#ifdef EIGEN_DEBUG_PRODUCT + static void debug() + { + EIGEN_DEBUG_VAR(Rows); + EIGEN_DEBUG_VAR(Cols); + EIGEN_DEBUG_VAR(Depth); + EIGEN_DEBUG_VAR(rows_select); + EIGEN_DEBUG_VAR(cols_select); + EIGEN_DEBUG_VAR(depth_select); + EIGEN_DEBUG_VAR(value); + } +#endif +}; + +/* The following allows to select the kind of product at compile time + * based on the three dimensions of the product. + * This is a compile time mapping from {1,Small,Large}^3 -> {product types} */ +// FIXME I'm not sure the current mapping is the ideal one. +template struct product_type_selector { enum { ret = OuterProduct }; }; +template struct product_type_selector { enum { ret = LazyCoeffBasedProductMode }; }; +template struct product_type_selector<1, N, 1> { enum { ret = LazyCoeffBasedProductMode }; }; +template struct product_type_selector<1, 1, Depth> { enum { ret = InnerProduct }; }; +template<> struct product_type_selector<1, 1, 1> { enum { ret = InnerProduct }; }; +template<> struct product_type_selector { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector<1, Small,Small> { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = LazyCoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = LazyCoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = LazyCoeffBasedProductMode }; }; +template<> struct product_type_selector<1, Large,Small> { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector<1, Large,Large> { enum { ret = GemvProduct }; }; +template<> struct product_type_selector<1, Small,Large> { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = GemvProduct }; }; +template<> struct product_type_selector { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = GemmProduct }; }; +template<> struct product_type_selector { enum { ret = GemmProduct }; }; +template<> struct product_type_selector { enum { ret = GemmProduct }; }; +template<> struct product_type_selector { enum { ret = GemmProduct }; }; +template<> struct product_type_selector { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = CoeffBasedProductMode }; }; +template<> struct product_type_selector { enum { ret = GemmProduct }; }; + +} // end namespace internal + +/*********************************************************************** +* Implementation of Inner Vector Vector Product +***********************************************************************/ + +// FIXME : maybe the "inner product" could return a Scalar +// instead of a 1x1 matrix ?? +// Pro: more natural for the user +// Cons: this could be a problem if in a meta unrolled algorithm a matrix-matrix +// product ends up to a row-vector times col-vector product... To tackle this use +// case, we could have a specialization for Block with: operator=(Scalar x); + +/*********************************************************************** +* Implementation of Outer Vector Vector Product +***********************************************************************/ + +/*********************************************************************** +* Implementation of General Matrix Vector Product +***********************************************************************/ + +/* According to the shape/flags of the matrix we have to distinghish 3 different cases: + * 1 - the matrix is col-major, BLAS compatible and M is large => call fast BLAS-like colmajor routine + * 2 - the matrix is row-major, BLAS compatible and N is large => call fast BLAS-like rowmajor routine + * 3 - all other cases are handled using a simple loop along the outer-storage direction. + * Therefore we need a lower level meta selector. + * Furthermore, if the matrix is the rhs, then the product has to be transposed. + */ +namespace internal { + +template +struct gemv_dense_selector; + +} // end namespace internal + +namespace internal { + +template struct gemv_static_vector_if; + +template +struct gemv_static_vector_if +{ + EIGEN_STRONG_INLINE Scalar* data() { eigen_internal_assert(false && "should never be called"); return 0; } +}; + +template +struct gemv_static_vector_if +{ + EIGEN_STRONG_INLINE Scalar* data() { return 0; } +}; + +template +struct gemv_static_vector_if +{ + enum { + ForceAlignment = internal::packet_traits::Vectorizable, + PacketSize = internal::packet_traits::size + }; + #if EIGEN_MAX_STATIC_ALIGN_BYTES!=0 + internal::plain_array m_data; + EIGEN_STRONG_INLINE Scalar* data() { return m_data.array; } + #else + // Some architectures cannot align on the stack, + // => let's manually enforce alignment by allocating more data and return the address of the first aligned element. + internal::plain_array m_data; + EIGEN_STRONG_INLINE Scalar* data() { + return ForceAlignment + ? reinterpret_cast((internal::UIntPtr(m_data.array) & ~(std::size_t(EIGEN_MAX_ALIGN_BYTES-1))) + EIGEN_MAX_ALIGN_BYTES) + : m_data.array; + } + #endif +}; + +// The vector is on the left => transposition +template +struct gemv_dense_selector +{ + template + static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) + { + Transpose destT(dest); + enum { OtherStorageOrder = StorageOrder == RowMajor ? ColMajor : RowMajor }; + gemv_dense_selector + ::run(rhs.transpose(), lhs.transpose(), destT, alpha); + } +}; + +template<> struct gemv_dense_selector +{ + template + static inline void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) + { + typedef typename Lhs::Scalar LhsScalar; + typedef typename Rhs::Scalar RhsScalar; + typedef typename Dest::Scalar ResScalar; + typedef typename Dest::RealScalar RealScalar; + + typedef internal::blas_traits LhsBlasTraits; + typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; + typedef internal::blas_traits RhsBlasTraits; + typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; + + typedef Map, EIGEN_PLAIN_ENUM_MIN(AlignedMax,internal::packet_traits::size)> MappedDest; + + ActualLhsType actualLhs = LhsBlasTraits::extract(lhs); + ActualRhsType actualRhs = RhsBlasTraits::extract(rhs); + + ResScalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(lhs) + * RhsBlasTraits::extractScalarFactor(rhs); + + // make sure Dest is a compile-time vector type (bug 1166) + typedef typename conditional::type ActualDest; + + enum { + // FIXME find a way to allow an inner stride on the result if packet_traits::size==1 + // on, the other hand it is good for the cache to pack the vector anyways... + EvalToDestAtCompileTime = (ActualDest::InnerStrideAtCompileTime==1), + ComplexByReal = (NumTraits::IsComplex) && (!NumTraits::IsComplex), + MightCannotUseDest = (!EvalToDestAtCompileTime) || ComplexByReal + }; + + typedef const_blas_data_mapper LhsMapper; + typedef const_blas_data_mapper RhsMapper; + RhsScalar compatibleAlpha = get_factor::run(actualAlpha); + + if(!MightCannotUseDest) + { + // shortcut if we are sure to be able to use dest directly, + // this ease the compiler to generate cleaner and more optimzized code for most common cases + general_matrix_vector_product + ::run( + actualLhs.rows(), actualLhs.cols(), + LhsMapper(actualLhs.data(), actualLhs.outerStride()), + RhsMapper(actualRhs.data(), actualRhs.innerStride()), + dest.data(), 1, + compatibleAlpha); + } + else + { + gemv_static_vector_if static_dest; + + const bool alphaIsCompatible = (!ComplexByReal) || (numext::imag(actualAlpha)==RealScalar(0)); + const bool evalToDest = EvalToDestAtCompileTime && alphaIsCompatible; + + ei_declare_aligned_stack_constructed_variable(ResScalar,actualDestPtr,dest.size(), + evalToDest ? dest.data() : static_dest.data()); + + if(!evalToDest) + { + #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN + Index size = dest.size(); + EIGEN_DENSE_STORAGE_CTOR_PLUGIN + #endif + if(!alphaIsCompatible) + { + MappedDest(actualDestPtr, dest.size()).setZero(); + compatibleAlpha = RhsScalar(1); + } + else + MappedDest(actualDestPtr, dest.size()) = dest; + } + + general_matrix_vector_product + ::run( + actualLhs.rows(), actualLhs.cols(), + LhsMapper(actualLhs.data(), actualLhs.outerStride()), + RhsMapper(actualRhs.data(), actualRhs.innerStride()), + actualDestPtr, 1, + compatibleAlpha); + + if (!evalToDest) + { + if(!alphaIsCompatible) + dest.matrix() += actualAlpha * MappedDest(actualDestPtr, dest.size()); + else + dest = MappedDest(actualDestPtr, dest.size()); + } + } + } +}; + +template<> struct gemv_dense_selector +{ + template + static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) + { + typedef typename Lhs::Scalar LhsScalar; + typedef typename Rhs::Scalar RhsScalar; + typedef typename Dest::Scalar ResScalar; + + typedef internal::blas_traits LhsBlasTraits; + typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; + typedef internal::blas_traits RhsBlasTraits; + typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; + typedef typename internal::remove_all::type ActualRhsTypeCleaned; + + typename add_const::type actualLhs = LhsBlasTraits::extract(lhs); + typename add_const::type actualRhs = RhsBlasTraits::extract(rhs); + + ResScalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(lhs) + * RhsBlasTraits::extractScalarFactor(rhs); + + enum { + // FIXME find a way to allow an inner stride on the result if packet_traits::size==1 + // on, the other hand it is good for the cache to pack the vector anyways... + DirectlyUseRhs = ActualRhsTypeCleaned::InnerStrideAtCompileTime==1 + }; + + gemv_static_vector_if static_rhs; + + ei_declare_aligned_stack_constructed_variable(RhsScalar,actualRhsPtr,actualRhs.size(), + DirectlyUseRhs ? const_cast(actualRhs.data()) : static_rhs.data()); + + if(!DirectlyUseRhs) + { + #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN + Index size = actualRhs.size(); + EIGEN_DENSE_STORAGE_CTOR_PLUGIN + #endif + Map(actualRhsPtr, actualRhs.size()) = actualRhs; + } + + typedef const_blas_data_mapper LhsMapper; + typedef const_blas_data_mapper RhsMapper; + general_matrix_vector_product + ::run( + actualLhs.rows(), actualLhs.cols(), + LhsMapper(actualLhs.data(), actualLhs.outerStride()), + RhsMapper(actualRhsPtr, 1), + dest.data(), dest.col(0).innerStride(), //NOTE if dest is not a vector at compile-time, then dest.innerStride() might be wrong. (bug 1166) + actualAlpha); + } +}; + +template<> struct gemv_dense_selector +{ + template + static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) + { + EIGEN_STATIC_ASSERT((!nested_eval::Evaluate),EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE); + // TODO if rhs is large enough it might be beneficial to make sure that dest is sequentially stored in memory, otherwise use a temp + typename nested_eval::type actual_rhs(rhs); + const Index size = rhs.rows(); + for(Index k=0; k struct gemv_dense_selector +{ + template + static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) + { + EIGEN_STATIC_ASSERT((!nested_eval::Evaluate),EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE); + typename nested_eval::type actual_rhs(rhs); + const Index rows = dest.rows(); + for(Index i=0; i +template +EIGEN_DEVICE_FUNC +inline const Product +MatrixBase::operator*(const MatrixBase &other) const +{ + // A note regarding the function declaration: In MSVC, this function will sometimes + // not be inlined since DenseStorage is an unwindable object for dynamic + // matrices and product types are holding a member to store the result. + // Thus it does not help tagging this function with EIGEN_STRONG_INLINE. + enum { + ProductIsValid = Derived::ColsAtCompileTime==Dynamic + || OtherDerived::RowsAtCompileTime==Dynamic + || int(Derived::ColsAtCompileTime)==int(OtherDerived::RowsAtCompileTime), + AreVectors = Derived::IsVectorAtCompileTime && OtherDerived::IsVectorAtCompileTime, + SameSizes = EIGEN_PREDICATE_SAME_MATRIX_SIZE(Derived,OtherDerived) + }; + // note to the lost user: + // * for a dot product use: v1.dot(v2) + // * for a coeff-wise product use: v1.cwiseProduct(v2) + EIGEN_STATIC_ASSERT(ProductIsValid || !(AreVectors && SameSizes), + INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS) + EIGEN_STATIC_ASSERT(ProductIsValid || !(SameSizes && !AreVectors), + INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION) + EIGEN_STATIC_ASSERT(ProductIsValid || SameSizes, INVALID_MATRIX_PRODUCT) +#ifdef EIGEN_DEBUG_PRODUCT + internal::product_type::debug(); +#endif + + return Product(derived(), other.derived()); +} + +/** \returns an expression of the matrix product of \c *this and \a other without implicit evaluation. + * + * The returned product will behave like any other expressions: the coefficients of the product will be + * computed once at a time as requested. This might be useful in some extremely rare cases when only + * a small and no coherent fraction of the result's coefficients have to be computed. + * + * \warning This version of the matrix product can be much much slower. So use it only if you know + * what you are doing and that you measured a true speed improvement. + * + * \sa operator*(const MatrixBase&) + */ +template +template +const Product +EIGEN_DEVICE_FUNC MatrixBase::lazyProduct(const MatrixBase &other) const +{ + enum { + ProductIsValid = Derived::ColsAtCompileTime==Dynamic + || OtherDerived::RowsAtCompileTime==Dynamic + || int(Derived::ColsAtCompileTime)==int(OtherDerived::RowsAtCompileTime), + AreVectors = Derived::IsVectorAtCompileTime && OtherDerived::IsVectorAtCompileTime, + SameSizes = EIGEN_PREDICATE_SAME_MATRIX_SIZE(Derived,OtherDerived) + }; + // note to the lost user: + // * for a dot product use: v1.dot(v2) + // * for a coeff-wise product use: v1.cwiseProduct(v2) + EIGEN_STATIC_ASSERT(ProductIsValid || !(AreVectors && SameSizes), + INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS) + EIGEN_STATIC_ASSERT(ProductIsValid || !(SameSizes && !AreVectors), + INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION) + EIGEN_STATIC_ASSERT(ProductIsValid || SameSizes, INVALID_MATRIX_PRODUCT) + + return Product(derived(), other.derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_PRODUCT_H diff --git a/Eigen/src/Core/GenericPacketMath.h b/Eigen/src/Core/GenericPacketMath.h new file mode 100644 index 000000000..30878eda6 --- /dev/null +++ b/Eigen/src/Core/GenericPacketMath.h @@ -0,0 +1,598 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_GENERIC_PACKET_MATH_H +#define EIGEN_GENERIC_PACKET_MATH_H + +namespace Eigen { + +namespace internal { + +/** \internal + * \file GenericPacketMath.h + * + * Default implementation for types not supported by the vectorization. + * In practice these functions are provided to make easier the writing + * of generic vectorized code. + */ + +#ifndef EIGEN_DEBUG_ALIGNED_LOAD +#define EIGEN_DEBUG_ALIGNED_LOAD +#endif + +#ifndef EIGEN_DEBUG_UNALIGNED_LOAD +#define EIGEN_DEBUG_UNALIGNED_LOAD +#endif + +#ifndef EIGEN_DEBUG_ALIGNED_STORE +#define EIGEN_DEBUG_ALIGNED_STORE +#endif + +#ifndef EIGEN_DEBUG_UNALIGNED_STORE +#define EIGEN_DEBUG_UNALIGNED_STORE +#endif + +struct default_packet_traits +{ + enum { + HasHalfPacket = 0, + + HasAdd = 1, + HasSub = 1, + HasMul = 1, + HasNegate = 1, + HasAbs = 1, + HasArg = 0, + HasAbs2 = 1, + HasMin = 1, + HasMax = 1, + HasConj = 1, + HasSetLinear = 1, + HasBlend = 0, + + HasDiv = 0, + HasSqrt = 0, + HasRsqrt = 0, + HasExp = 0, + HasExpm1 = 0, + HasLog = 0, + HasLog1p = 0, + HasLog10 = 0, + HasPow = 0, + + HasSin = 0, + HasCos = 0, + HasTan = 0, + HasASin = 0, + HasACos = 0, + HasATan = 0, + HasSinh = 0, + HasCosh = 0, + HasTanh = 0, + HasLGamma = 0, + HasDiGamma = 0, + HasZeta = 0, + HasPolygamma = 0, + HasErf = 0, + HasErfc = 0, + HasIGamma = 0, + HasIGammac = 0, + HasBetaInc = 0, + + HasRound = 0, + HasFloor = 0, + HasCeil = 0, + + HasSign = 0 + }; +}; + +template struct packet_traits : default_packet_traits +{ + typedef T type; + typedef T half; + enum { + Vectorizable = 0, + size = 1, + AlignedOnScalar = 0, + HasHalfPacket = 0 + }; + enum { + HasAdd = 0, + HasSub = 0, + HasMul = 0, + HasNegate = 0, + HasAbs = 0, + HasAbs2 = 0, + HasMin = 0, + HasMax = 0, + HasConj = 0, + HasSetLinear = 0 + }; +}; + +template struct packet_traits : packet_traits { }; + +template struct type_casting_traits { + enum { + VectorizedCast = 0, + SrcCoeffRatio = 1, + TgtCoeffRatio = 1 + }; +}; + + +/** \internal \returns static_cast(a) (coeff-wise) */ +template +EIGEN_DEVICE_FUNC inline TgtPacket +pcast(const SrcPacket& a) { + return static_cast(a); +} +template +EIGEN_DEVICE_FUNC inline TgtPacket +pcast(const SrcPacket& a, const SrcPacket& /*b*/) { + return static_cast(a); +} + +template +EIGEN_DEVICE_FUNC inline TgtPacket +pcast(const SrcPacket& a, const SrcPacket& /*b*/, const SrcPacket& /*c*/, const SrcPacket& /*d*/) { + return static_cast(a); +} + +/** \internal \returns a + b (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +padd(const Packet& a, + const Packet& b) { return a+b; } + +/** \internal \returns a - b (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +psub(const Packet& a, + const Packet& b) { return a-b; } + +/** \internal \returns -a (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +pnegate(const Packet& a) { return -a; } + +/** \internal \returns conj(a) (coeff-wise) */ + +template EIGEN_DEVICE_FUNC inline Packet +pconj(const Packet& a) { return numext::conj(a); } + +/** \internal \returns a * b (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +pmul(const Packet& a, + const Packet& b) { return a*b; } + +/** \internal \returns a / b (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +pdiv(const Packet& a, + const Packet& b) { return a/b; } + +/** \internal \returns the min of \a a and \a b (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +pmin(const Packet& a, + const Packet& b) { return numext::mini(a, b); } + +/** \internal \returns the max of \a a and \a b (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +pmax(const Packet& a, + const Packet& b) { return numext::maxi(a, b); } + +/** \internal \returns the absolute value of \a a */ +template EIGEN_DEVICE_FUNC inline Packet +pabs(const Packet& a) { using std::abs; return abs(a); } + +/** \internal \returns the phase angle of \a a */ +template EIGEN_DEVICE_FUNC inline Packet +parg(const Packet& a) { using numext::arg; return arg(a); } + +/** \internal \returns the bitwise and of \a a and \a b */ +template EIGEN_DEVICE_FUNC inline Packet +pand(const Packet& a, const Packet& b) { return a & b; } + +/** \internal \returns the bitwise or of \a a and \a b */ +template EIGEN_DEVICE_FUNC inline Packet +por(const Packet& a, const Packet& b) { return a | b; } + +/** \internal \returns the bitwise xor of \a a and \a b */ +template EIGEN_DEVICE_FUNC inline Packet +pxor(const Packet& a, const Packet& b) { return a ^ b; } + +/** \internal \returns the bitwise andnot of \a a and \a b */ +template EIGEN_DEVICE_FUNC inline Packet +pandnot(const Packet& a, const Packet& b) { return a & (!b); } + +/** \internal \returns a packet version of \a *from, from must be 16 bytes aligned */ +template EIGEN_DEVICE_FUNC inline Packet +pload(const typename unpacket_traits::type* from) { return *from; } + +/** \internal \returns a packet version of \a *from, (un-aligned load) */ +template EIGEN_DEVICE_FUNC inline Packet +ploadu(const typename unpacket_traits::type* from) { return *from; } + +/** \internal \returns a packet with constant coefficients \a a, e.g.: (a,a,a,a) */ +template EIGEN_DEVICE_FUNC inline Packet +pset1(const typename unpacket_traits::type& a) { return a; } + +/** \internal \returns a packet with constant coefficients \a a[0], e.g.: (a[0],a[0],a[0],a[0]) */ +template EIGEN_DEVICE_FUNC inline Packet +pload1(const typename unpacket_traits::type *a) { return pset1(*a); } + +/** \internal \returns a packet with elements of \a *from duplicated. + * For instance, for a packet of 8 elements, 4 scalars will be read from \a *from and + * duplicated to form: {from[0],from[0],from[1],from[1],from[2],from[2],from[3],from[3]} + * Currently, this function is only used for scalar * complex products. + */ +template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Packet +ploaddup(const typename unpacket_traits::type* from) { return *from; } + +/** \internal \returns a packet with elements of \a *from quadrupled. + * For instance, for a packet of 8 elements, 2 scalars will be read from \a *from and + * replicated to form: {from[0],from[0],from[0],from[0],from[1],from[1],from[1],from[1]} + * Currently, this function is only used in matrix products. + * For packet-size smaller or equal to 4, this function is equivalent to pload1 + */ +template EIGEN_DEVICE_FUNC inline Packet +ploadquad(const typename unpacket_traits::type* from) +{ return pload1(from); } + +/** \internal equivalent to + * \code + * a0 = pload1(a+0); + * a1 = pload1(a+1); + * a2 = pload1(a+2); + * a3 = pload1(a+3); + * \endcode + * \sa pset1, pload1, ploaddup, pbroadcast2 + */ +template EIGEN_DEVICE_FUNC +inline void pbroadcast4(const typename unpacket_traits::type *a, + Packet& a0, Packet& a1, Packet& a2, Packet& a3) +{ + a0 = pload1(a+0); + a1 = pload1(a+1); + a2 = pload1(a+2); + a3 = pload1(a+3); +} + +/** \internal equivalent to + * \code + * a0 = pload1(a+0); + * a1 = pload1(a+1); + * \endcode + * \sa pset1, pload1, ploaddup, pbroadcast4 + */ +template EIGEN_DEVICE_FUNC +inline void pbroadcast2(const typename unpacket_traits::type *a, + Packet& a0, Packet& a1) +{ + a0 = pload1(a+0); + a1 = pload1(a+1); +} + +/** \internal \brief Returns a packet with coefficients (a,a+1,...,a+packet_size-1). */ +template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Packet +plset(const typename unpacket_traits::type& a) { return a; } + +/** \internal copy the packet \a from to \a *to, \a to must be 16 bytes aligned */ +template EIGEN_DEVICE_FUNC inline void pstore(Scalar* to, const Packet& from) +{ (*to) = from; } + +/** \internal copy the packet \a from to \a *to, (un-aligned store) */ +template EIGEN_DEVICE_FUNC inline void pstoreu(Scalar* to, const Packet& from) +{ (*to) = from; } + + template EIGEN_DEVICE_FUNC inline Packet pgather(const Scalar* from, Index /*stride*/) + { return ploadu(from); } + + template EIGEN_DEVICE_FUNC inline void pscatter(Scalar* to, const Packet& from, Index /*stride*/) + { pstore(to, from); } + +/** \internal tries to do cache prefetching of \a addr */ +template EIGEN_DEVICE_FUNC inline void prefetch(const Scalar* addr) +{ +#ifdef EIGEN_CUDA_ARCH +#if defined(__LP64__) + // 64-bit pointer operand constraint for inlined asm + asm(" prefetch.L1 [ %1 ];" : "=l"(addr) : "l"(addr)); +#else + // 32-bit pointer operand constraint for inlined asm + asm(" prefetch.L1 [ %1 ];" : "=r"(addr) : "r"(addr)); +#endif +#elif (!EIGEN_COMP_MSVC) && (EIGEN_COMP_GNUC || EIGEN_COMP_CLANG || EIGEN_COMP_ICC) + __builtin_prefetch(addr); +#endif +} + +/** \internal \returns the first element of a packet */ +template EIGEN_DEVICE_FUNC inline typename unpacket_traits::type pfirst(const Packet& a) +{ return a; } + +/** \internal \returns a packet where the element i contains the sum of the packet of \a vec[i] */ +template EIGEN_DEVICE_FUNC inline Packet +preduxp(const Packet* vecs) { return vecs[0]; } + +/** \internal \returns the sum of the elements of \a a*/ +template EIGEN_DEVICE_FUNC inline typename unpacket_traits::type predux(const Packet& a) +{ return a; } + +/** \internal \returns the sum of the elements of \a a by block of 4 elements. + * For a packet {a0, a1, a2, a3, a4, a5, a6, a7}, it returns a half packet {a0+a4, a1+a5, a2+a6, a3+a7} + * For packet-size smaller or equal to 4, this boils down to a noop. + */ +template EIGEN_DEVICE_FUNC inline +typename conditional<(unpacket_traits::size%8)==0,typename unpacket_traits::half,Packet>::type +predux_downto4(const Packet& a) +{ return a; } + +/** \internal \returns the product of the elements of \a a*/ +template EIGEN_DEVICE_FUNC inline typename unpacket_traits::type predux_mul(const Packet& a) +{ return a; } + +/** \internal \returns the min of the elements of \a a*/ +template EIGEN_DEVICE_FUNC inline typename unpacket_traits::type predux_min(const Packet& a) +{ return a; } + +/** \internal \returns the max of the elements of \a a*/ +template EIGEN_DEVICE_FUNC inline typename unpacket_traits::type predux_max(const Packet& a) +{ return a; } + +/** \internal \returns the reversed elements of \a a*/ +template EIGEN_DEVICE_FUNC inline Packet preverse(const Packet& a) +{ return a; } + +/** \internal \returns \a a with real and imaginary part flipped (for complex type only) */ +template EIGEN_DEVICE_FUNC inline Packet pcplxflip(const Packet& a) +{ + // FIXME: uncomment the following in case we drop the internal imag and real functions. +// using std::imag; +// using std::real; + return Packet(imag(a),real(a)); +} + +/************************** +* Special math functions +***************************/ + +/** \internal \returns the sine of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet psin(const Packet& a) { using std::sin; return sin(a); } + +/** \internal \returns the cosine of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pcos(const Packet& a) { using std::cos; return cos(a); } + +/** \internal \returns the tan of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet ptan(const Packet& a) { using std::tan; return tan(a); } + +/** \internal \returns the arc sine of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pasin(const Packet& a) { using std::asin; return asin(a); } + +/** \internal \returns the arc cosine of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pacos(const Packet& a) { using std::acos; return acos(a); } + +/** \internal \returns the arc tangent of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet patan(const Packet& a) { using std::atan; return atan(a); } + +/** \internal \returns the hyperbolic sine of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet psinh(const Packet& a) { using std::sinh; return sinh(a); } + +/** \internal \returns the hyperbolic cosine of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pcosh(const Packet& a) { using std::cosh; return cosh(a); } + +/** \internal \returns the hyperbolic tan of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet ptanh(const Packet& a) { using std::tanh; return tanh(a); } + +/** \internal \returns the exp of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pexp(const Packet& a) { using std::exp; return exp(a); } + +/** \internal \returns the expm1 of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pexpm1(const Packet& a) { return numext::expm1(a); } + +/** \internal \returns the log of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet plog(const Packet& a) { using std::log; return log(a); } + +/** \internal \returns the log1p of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet plog1p(const Packet& a) { return numext::log1p(a); } + +/** \internal \returns the log10 of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet plog10(const Packet& a) { using std::log10; return log10(a); } + +/** \internal \returns the square-root of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet psqrt(const Packet& a) { using std::sqrt; return sqrt(a); } + +/** \internal \returns the reciprocal square-root of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet prsqrt(const Packet& a) { + return pdiv(pset1(1), psqrt(a)); +} + +/** \internal \returns the rounded value of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pround(const Packet& a) { using numext::round; return round(a); } + +/** \internal \returns the floor of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pfloor(const Packet& a) { using numext::floor; return floor(a); } + +/** \internal \returns the ceil of \a a (coeff-wise) */ +template EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS +Packet pceil(const Packet& a) { using numext::ceil; return ceil(a); } + +/*************************************************************************** +* The following functions might not have to be overwritten for vectorized types +***************************************************************************/ + +/** \internal copy a packet with constant coeficient \a a (e.g., [a,a,a,a]) to \a *to. \a to must be 16 bytes aligned */ +// NOTE: this function must really be templated on the packet type (think about different packet types for the same scalar type) +template +inline void pstore1(typename unpacket_traits::type* to, const typename unpacket_traits::type& a) +{ + pstore(to, pset1(a)); +} + +/** \internal \returns a * b + c (coeff-wise) */ +template EIGEN_DEVICE_FUNC inline Packet +pmadd(const Packet& a, + const Packet& b, + const Packet& c) +{ return padd(pmul(a, b),c); } + +/** \internal \returns a packet version of \a *from. + * The pointer \a from must be aligned on a \a Alignment bytes boundary. */ +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Packet ploadt(const typename unpacket_traits::type* from) +{ + if(Alignment >= unpacket_traits::alignment) + return pload(from); + else + return ploadu(from); +} + +/** \internal copy the packet \a from to \a *to. + * The pointer \a from must be aligned on a \a Alignment bytes boundary. */ +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE void pstoret(Scalar* to, const Packet& from) +{ + if(Alignment >= unpacket_traits::alignment) + pstore(to, from); + else + pstoreu(to, from); +} + +/** \internal \returns a packet version of \a *from. + * Unlike ploadt, ploadt_ro takes advantage of the read-only memory path on the + * hardware if available to speedup the loading of data that won't be modified + * by the current computation. + */ +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Packet ploadt_ro(const typename unpacket_traits::type* from) +{ + return ploadt(from); +} + +/** \internal default implementation of palign() allowing partial specialization */ +template +struct palign_impl +{ + // by default data are aligned, so there is nothing to be done :) + static inline void run(PacketType&, const PacketType&) {} +}; + +/** \internal update \a first using the concatenation of the packet_size minus \a Offset last elements + * of \a first and \a Offset first elements of \a second. + * + * This function is currently only used to optimize matrix-vector products on unligned matrices. + * It takes 2 packets that represent a contiguous memory array, and returns a packet starting + * at the position \a Offset. For instance, for packets of 4 elements, we have: + * Input: + * - first = {f0,f1,f2,f3} + * - second = {s0,s1,s2,s3} + * Output: + * - if Offset==0 then {f0,f1,f2,f3} + * - if Offset==1 then {f1,f2,f3,s0} + * - if Offset==2 then {f2,f3,s0,s1} + * - if Offset==3 then {f3,s0,s1,s3} + */ +template +inline void palign(PacketType& first, const PacketType& second) +{ + palign_impl::run(first,second); +} + +/*************************************************************************** +* Fast complex products (GCC generates a function call which is very slow) +***************************************************************************/ + +// Eigen+CUDA does not support complexes. +#ifndef EIGEN_CUDACC + +template<> inline std::complex pmul(const std::complex& a, const std::complex& b) +{ return std::complex(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); } + +template<> inline std::complex pmul(const std::complex& a, const std::complex& b) +{ return std::complex(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); } + +#endif + + +/*************************************************************************** + * PacketBlock, that is a collection of N packets where the number of words + * in the packet is a multiple of N. +***************************************************************************/ +template ::size> struct PacketBlock { + Packet packet[N]; +}; + +template EIGEN_DEVICE_FUNC inline void +ptranspose(PacketBlock& /*kernel*/) { + // Nothing to do in the scalar case, i.e. a 1x1 matrix. +} + +/*************************************************************************** + * Selector, i.e. vector of N boolean values used to select (i.e. blend) + * words from 2 packets. +***************************************************************************/ +template struct Selector { + bool select[N]; +}; + +template EIGEN_DEVICE_FUNC inline Packet +pblend(const Selector::size>& ifPacket, const Packet& thenPacket, const Packet& elsePacket) { + return ifPacket.select[0] ? thenPacket : elsePacket; +} + +/** \internal \returns \a a with the first coefficient replaced by the scalar b */ +template EIGEN_DEVICE_FUNC inline Packet +pinsertfirst(const Packet& a, typename unpacket_traits::type b) +{ + // Default implementation based on pblend. + // It must be specialized for higher performance. + Selector::size> mask; + mask.select[0] = true; + // This for loop should be optimized away by the compiler. + for(Index i=1; i::size; ++i) + mask.select[i] = false; + return pblend(mask, pset1(b), a); +} + +/** \internal \returns \a a with the last coefficient replaced by the scalar b */ +template EIGEN_DEVICE_FUNC inline Packet +pinsertlast(const Packet& a, typename unpacket_traits::type b) +{ + // Default implementation based on pblend. + // It must be specialized for higher performance. + Selector::size> mask; + // This for loop should be optimized away by the compiler. + for(Index i=0; i::size-1; ++i) + mask.select[i] = false; + mask.select[unpacket_traits::size-1] = true; + return pblend(mask, pset1(b), a); +} + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_GENERIC_PACKET_MATH_H diff --git a/Eigen/src/Core/GlobalFunctions.h b/Eigen/src/Core/GlobalFunctions.h new file mode 100644 index 000000000..50406400b --- /dev/null +++ b/Eigen/src/Core/GlobalFunctions.h @@ -0,0 +1,185 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2010-2016 Gael Guennebaud +// Copyright (C) 2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_GLOBAL_FUNCTIONS_H +#define EIGEN_GLOBAL_FUNCTIONS_H + +#ifdef EIGEN_PARSED_BY_DOXYGEN + +#define EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(NAME,FUNCTOR,DOC_OP,DOC_DETAILS) \ + /** \returns an expression of the coefficient-wise DOC_OP of \a x + + DOC_DETAILS + + \sa Math functions, class CwiseUnaryOp + */ \ + template \ + inline const Eigen::CwiseUnaryOp, const Derived> \ + NAME(const Eigen::ArrayBase& x); + +#else + +#define EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(NAME,FUNCTOR,DOC_OP,DOC_DETAILS) \ + template \ + inline const Eigen::CwiseUnaryOp, const Derived> \ + (NAME)(const Eigen::ArrayBase& x) { \ + return Eigen::CwiseUnaryOp, const Derived>(x.derived()); \ + } + +#endif // EIGEN_PARSED_BY_DOXYGEN + +#define EIGEN_ARRAY_DECLARE_GLOBAL_EIGEN_UNARY(NAME,FUNCTOR) \ + \ + template \ + struct NAME##_retval > \ + { \ + typedef const Eigen::CwiseUnaryOp, const Derived> type; \ + }; \ + template \ + struct NAME##_impl > \ + { \ + static inline typename NAME##_retval >::type run(const Eigen::ArrayBase& x) \ + { \ + return typename NAME##_retval >::type(x.derived()); \ + } \ + }; + +namespace Eigen +{ + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(real,scalar_real_op,real part,\sa ArrayBase::real) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(imag,scalar_imag_op,imaginary part,\sa ArrayBase::imag) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(conj,scalar_conjugate_op,complex conjugate,\sa ArrayBase::conjugate) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(inverse,scalar_inverse_op,inverse,\sa ArrayBase::inverse) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sin,scalar_sin_op,sine,\sa ArrayBase::sin) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(cos,scalar_cos_op,cosine,\sa ArrayBase::cos) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(tan,scalar_tan_op,tangent,\sa ArrayBase::tan) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(atan,scalar_atan_op,arc-tangent,\sa ArrayBase::atan) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(asin,scalar_asin_op,arc-sine,\sa ArrayBase::asin) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(acos,scalar_acos_op,arc-consine,\sa ArrayBase::acos) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sinh,scalar_sinh_op,hyperbolic sine,\sa ArrayBase::sinh) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(cosh,scalar_cosh_op,hyperbolic cosine,\sa ArrayBase::cosh) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(tanh,scalar_tanh_op,hyperbolic tangent,\sa ArrayBase::tanh) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(lgamma,scalar_lgamma_op,natural logarithm of the gamma function,\sa ArrayBase::lgamma) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(digamma,scalar_digamma_op,derivative of lgamma,\sa ArrayBase::digamma) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(erf,scalar_erf_op,error function,\sa ArrayBase::erf) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(erfc,scalar_erfc_op,complement error function,\sa ArrayBase::erfc) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(exp,scalar_exp_op,exponential,\sa ArrayBase::exp) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(expm1,scalar_expm1_op,exponential of a value minus 1,\sa ArrayBase::expm1) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(log,scalar_log_op,natural logarithm,\sa Eigen::log10 DOXCOMMA ArrayBase::log) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(log1p,scalar_log1p_op,natural logarithm of 1 plus the value,\sa ArrayBase::log1p) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(log10,scalar_log10_op,base 10 logarithm,\sa Eigen::log DOXCOMMA ArrayBase::log) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(abs,scalar_abs_op,absolute value,\sa ArrayBase::abs DOXCOMMA MatrixBase::cwiseAbs) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(abs2,scalar_abs2_op,squared absolute value,\sa ArrayBase::abs2 DOXCOMMA MatrixBase::cwiseAbs2) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(arg,scalar_arg_op,complex argument,\sa ArrayBase::arg) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sqrt,scalar_sqrt_op,square root,\sa ArrayBase::sqrt DOXCOMMA MatrixBase::cwiseSqrt) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(rsqrt,scalar_rsqrt_op,reciprocal square root,\sa ArrayBase::rsqrt) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(square,scalar_square_op,square (power 2),\sa Eigen::abs2 DOXCOMMA Eigen::pow DOXCOMMA ArrayBase::square) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(cube,scalar_cube_op,cube (power 3),\sa Eigen::pow DOXCOMMA ArrayBase::cube) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(round,scalar_round_op,nearest integer,\sa Eigen::floor DOXCOMMA Eigen::ceil DOXCOMMA ArrayBase::round) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(floor,scalar_floor_op,nearest integer not greater than the giben value,\sa Eigen::ceil DOXCOMMA ArrayBase::floor) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(ceil,scalar_ceil_op,nearest integer not less than the giben value,\sa Eigen::floor DOXCOMMA ArrayBase::ceil) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isnan,scalar_isnan_op,not-a-number test,\sa Eigen::isinf DOXCOMMA Eigen::isfinite DOXCOMMA ArrayBase::isnan) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isinf,scalar_isinf_op,infinite value test,\sa Eigen::isnan DOXCOMMA Eigen::isfinite DOXCOMMA ArrayBase::isinf) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(isfinite,scalar_isfinite_op,finite value test,\sa Eigen::isinf DOXCOMMA Eigen::isnan DOXCOMMA ArrayBase::isfinite) + EIGEN_ARRAY_DECLARE_GLOBAL_UNARY(sign,scalar_sign_op,sign (or 0),\sa ArrayBase::sign) + + /** \returns an expression of the coefficient-wise power of \a x to the given constant \a exponent. + * + * \tparam ScalarExponent is the scalar type of \a exponent. It must be compatible with the scalar type of the given expression (\c Derived::Scalar). + * + * \sa ArrayBase::pow() + * + * \relates ArrayBase + */ +#ifdef EIGEN_PARSED_BY_DOXYGEN + template + inline const CwiseBinaryOp,Derived,Constant > + pow(const Eigen::ArrayBase& x, const ScalarExponent& exponent); +#else + template + EIGEN_DEVICE_FUNC inline + EIGEN_MSVC10_WORKAROUND_BINARYOP_RETURN_TYPE( + const EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(Derived,typename internal::promote_scalar_arg::type,pow)) + pow(const Eigen::ArrayBase& x, const ScalarExponent& exponent) + { + typedef typename internal::promote_scalar_arg::type PromotedExponent; + return EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(Derived,PromotedExponent,pow)(x.derived(), + typename internal::plain_constant_type::type(x.derived().rows(), x.derived().cols(), internal::scalar_constant_op(exponent))); + } +#endif + + /** \returns an expression of the coefficient-wise power of \a x to the given array of \a exponents. + * + * This function computes the coefficient-wise power. + * + * Example: \include Cwise_array_power_array.cpp + * Output: \verbinclude Cwise_array_power_array.out + * + * \sa ArrayBase::pow() + * + * \relates ArrayBase + */ + template + inline const Eigen::CwiseBinaryOp, const Derived, const ExponentDerived> + pow(const Eigen::ArrayBase& x, const Eigen::ArrayBase& exponents) + { + return Eigen::CwiseBinaryOp, const Derived, const ExponentDerived>( + x.derived(), + exponents.derived() + ); + } + + /** \returns an expression of the coefficient-wise power of the scalar \a x to the given array of \a exponents. + * + * This function computes the coefficient-wise power between a scalar and an array of exponents. + * + * \tparam Scalar is the scalar type of \a x. It must be compatible with the scalar type of the given array expression (\c Derived::Scalar). + * + * Example: \include Cwise_scalar_power_array.cpp + * Output: \verbinclude Cwise_scalar_power_array.out + * + * \sa ArrayBase::pow() + * + * \relates ArrayBase + */ +#ifdef EIGEN_PARSED_BY_DOXYGEN + template + inline const CwiseBinaryOp,Constant,Derived> + pow(const Scalar& x,const Eigen::ArrayBase& x); +#else + template + EIGEN_DEVICE_FUNC inline + EIGEN_MSVC10_WORKAROUND_BINARYOP_RETURN_TYPE( + const EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(typename internal::promote_scalar_arg::type,Derived,pow)) + pow(const Scalar& x, const Eigen::ArrayBase& exponents) { + typedef typename internal::promote_scalar_arg::type PromotedScalar; + return EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(PromotedScalar,Derived,pow)( + typename internal::plain_constant_type::type(exponents.derived().rows(), exponents.derived().cols(), internal::scalar_constant_op(x)), exponents.derived()); + } +#endif + + + namespace internal + { + EIGEN_ARRAY_DECLARE_GLOBAL_EIGEN_UNARY(real,scalar_real_op) + EIGEN_ARRAY_DECLARE_GLOBAL_EIGEN_UNARY(imag,scalar_imag_op) + EIGEN_ARRAY_DECLARE_GLOBAL_EIGEN_UNARY(abs2,scalar_abs2_op) + } +} + +// TODO: cleanly disable those functions that are not supported on Array (numext::real_ref, internal::random, internal::isApprox...) + +#endif // EIGEN_GLOBAL_FUNCTIONS_H diff --git a/Eigen/src/Core/IO.h b/Eigen/src/Core/IO.h new file mode 100644 index 000000000..da7fd6cce --- /dev/null +++ b/Eigen/src/Core/IO.h @@ -0,0 +1,225 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2008 Benoit Jacob +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_IO_H +#define EIGEN_IO_H + +namespace Eigen { + +enum { DontAlignCols = 1 }; +enum { StreamPrecision = -1, + FullPrecision = -2 }; + +namespace internal { +template +std::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat& fmt); +} + +/** \class IOFormat + * \ingroup Core_Module + * + * \brief Stores a set of parameters controlling the way matrices are printed + * + * List of available parameters: + * - \b precision number of digits for floating point values, or one of the special constants \c StreamPrecision and \c FullPrecision. + * The default is the special value \c StreamPrecision which means to use the + * stream's own precision setting, as set for instance using \c cout.precision(3). The other special value + * \c FullPrecision means that the number of digits will be computed to match the full precision of each floating-point + * type. + * - \b flags an OR-ed combination of flags, the default value is 0, the only currently available flag is \c DontAlignCols which + * allows to disable the alignment of columns, resulting in faster code. + * - \b coeffSeparator string printed between two coefficients of the same row + * - \b rowSeparator string printed between two rows + * - \b rowPrefix string printed at the beginning of each row + * - \b rowSuffix string printed at the end of each row + * - \b matPrefix string printed at the beginning of the matrix + * - \b matSuffix string printed at the end of the matrix + * + * Example: \include IOFormat.cpp + * Output: \verbinclude IOFormat.out + * + * \sa DenseBase::format(), class WithFormat + */ +struct IOFormat +{ + /** Default constructor, see class IOFormat for the meaning of the parameters */ + IOFormat(int _precision = StreamPrecision, int _flags = 0, + const std::string& _coeffSeparator = " ", + const std::string& _rowSeparator = "\n", const std::string& _rowPrefix="", const std::string& _rowSuffix="", + const std::string& _matPrefix="", const std::string& _matSuffix="") + : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator), + rowSpacer(""), coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags) + { + // TODO check if rowPrefix, rowSuffix or rowSeparator contains a newline + // don't add rowSpacer if columns are not to be aligned + if((flags & DontAlignCols)) + return; + int i = int(matSuffix.length())-1; + while (i>=0 && matSuffix[i]!='\n') + { + rowSpacer += ' '; + i--; + } + } + std::string matPrefix, matSuffix; + std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer; + std::string coeffSeparator; + int precision; + int flags; +}; + +/** \class WithFormat + * \ingroup Core_Module + * + * \brief Pseudo expression providing matrix output with given format + * + * \tparam ExpressionType the type of the object on which IO stream operations are performed + * + * This class represents an expression with stream operators controlled by a given IOFormat. + * It is the return type of DenseBase::format() + * and most of the time this is the only way it is used. + * + * See class IOFormat for some examples. + * + * \sa DenseBase::format(), class IOFormat + */ +template +class WithFormat +{ + public: + + WithFormat(const ExpressionType& matrix, const IOFormat& format) + : m_matrix(matrix), m_format(format) + {} + + friend std::ostream & operator << (std::ostream & s, const WithFormat& wf) + { + return internal::print_matrix(s, wf.m_matrix.eval(), wf.m_format); + } + + protected: + typename ExpressionType::Nested m_matrix; + IOFormat m_format; +}; + +namespace internal { + +// NOTE: This helper is kept for backward compatibility with previous code specializing +// this internal::significant_decimals_impl structure. In the future we should directly +// call digits10() which has been introduced in July 2016 in 3.3. +template +struct significant_decimals_impl +{ + static inline int run() + { + return NumTraits::digits10(); + } +}; + +/** \internal + * print the matrix \a _m to the output stream \a s using the output format \a fmt */ +template +std::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat& fmt) +{ + if(_m.size() == 0) + { + s << fmt.matPrefix << fmt.matSuffix; + return s; + } + + typename Derived::Nested m = _m; + typedef typename Derived::Scalar Scalar; + + Index width = 0; + + std::streamsize explicit_precision; + if(fmt.precision == StreamPrecision) + { + explicit_precision = 0; + } + else if(fmt.precision == FullPrecision) + { + if (NumTraits::IsInteger) + { + explicit_precision = 0; + } + else + { + explicit_precision = significant_decimals_impl::run(); + } + } + else + { + explicit_precision = fmt.precision; + } + + std::streamsize old_precision = 0; + if(explicit_precision) old_precision = s.precision(explicit_precision); + + bool align_cols = !(fmt.flags & DontAlignCols); + if(align_cols) + { + // compute the largest width + for(Index j = 0; j < m.cols(); ++j) + for(Index i = 0; i < m.rows(); ++i) + { + std::stringstream sstr; + sstr.copyfmt(s); + sstr << m.coeff(i,j); + width = std::max(width, Index(sstr.str().length())); + } + } + s << fmt.matPrefix; + for(Index i = 0; i < m.rows(); ++i) + { + if (i) + s << fmt.rowSpacer; + s << fmt.rowPrefix; + if(width) s.width(width); + s << m.coeff(i, 0); + for(Index j = 1; j < m.cols(); ++j) + { + s << fmt.coeffSeparator; + if (width) s.width(width); + s << m.coeff(i, j); + } + s << fmt.rowSuffix; + if( i < m.rows() - 1) + s << fmt.rowSeparator; + } + s << fmt.matSuffix; + if(explicit_precision) s.precision(old_precision); + return s; +} + +} // end namespace internal + +/** \relates DenseBase + * + * Outputs the matrix, to the given stream. + * + * If you wish to print the matrix with a format different than the default, use DenseBase::format(). + * + * It is also possible to change the default format by defining EIGEN_DEFAULT_IO_FORMAT before including Eigen headers. + * If not defined, this will automatically be defined to Eigen::IOFormat(), that is the Eigen::IOFormat with default parameters. + * + * \sa DenseBase::format() + */ +template +std::ostream & operator << +(std::ostream & s, + const DenseBase & m) +{ + return internal::print_matrix(s, m.eval(), EIGEN_DEFAULT_IO_FORMAT); +} + +} // end namespace Eigen + +#endif // EIGEN_IO_H diff --git a/Eigen/src/Core/IndexedView.h b/Eigen/src/Core/IndexedView.h new file mode 100644 index 000000000..8c57a277c --- /dev/null +++ b/Eigen/src/Core/IndexedView.h @@ -0,0 +1,207 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2017 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_INDEXED_VIEW_H +#define EIGEN_INDEXED_VIEW_H + +namespace Eigen { + +namespace internal { + +template +struct traits > + : traits +{ + enum { + RowsAtCompileTime = int(array_size::value), + ColsAtCompileTime = int(array_size::value), + MaxRowsAtCompileTime = RowsAtCompileTime != Dynamic ? int(RowsAtCompileTime) : int(traits::MaxRowsAtCompileTime), + MaxColsAtCompileTime = ColsAtCompileTime != Dynamic ? int(ColsAtCompileTime) : int(traits::MaxColsAtCompileTime), + + XprTypeIsRowMajor = (int(traits::Flags)&RowMajorBit) != 0, + IsRowMajor = (MaxRowsAtCompileTime==1&&MaxColsAtCompileTime!=1) ? 1 + : (MaxColsAtCompileTime==1&&MaxRowsAtCompileTime!=1) ? 0 + : XprTypeIsRowMajor, + + RowIncr = int(get_compile_time_incr::value), + ColIncr = int(get_compile_time_incr::value), + InnerIncr = IsRowMajor ? ColIncr : RowIncr, + OuterIncr = IsRowMajor ? RowIncr : ColIncr, + + HasSameStorageOrderAsXprType = (IsRowMajor == XprTypeIsRowMajor), + XprInnerStride = HasSameStorageOrderAsXprType ? int(inner_stride_at_compile_time::ret) : int(outer_stride_at_compile_time::ret), + XprOuterstride = HasSameStorageOrderAsXprType ? int(outer_stride_at_compile_time::ret) : int(inner_stride_at_compile_time::ret), + + InnerSize = XprTypeIsRowMajor ? ColsAtCompileTime : RowsAtCompileTime, + IsBlockAlike = InnerIncr==1 && OuterIncr==1, + IsInnerPannel = HasSameStorageOrderAsXprType && is_same,typename conditional::type>::value, + + InnerStrideAtCompileTime = InnerIncr<0 || InnerIncr==DynamicIndex || XprInnerStride==Dynamic ? Dynamic : XprInnerStride * InnerIncr, + OuterStrideAtCompileTime = OuterIncr<0 || OuterIncr==DynamicIndex || XprOuterstride==Dynamic ? Dynamic : XprOuterstride * OuterIncr, + + ReturnAsScalar = is_same::value && is_same::value, + ReturnAsBlock = (!ReturnAsScalar) && IsBlockAlike, + ReturnAsIndexedView = (!ReturnAsScalar) && (!ReturnAsBlock), + + // FIXME we deal with compile-time strides if and only if we have DirectAccessBit flag, + // but this is too strict regarding negative strides... + DirectAccessMask = (int(InnerIncr)!=UndefinedIncr && int(OuterIncr)!=UndefinedIncr && InnerIncr>=0 && OuterIncr>=0) ? DirectAccessBit : 0, + FlagsRowMajorBit = IsRowMajor ? RowMajorBit : 0, + FlagsLvalueBit = is_lvalue::value ? LvalueBit : 0, + Flags = (traits::Flags & (HereditaryBits | DirectAccessMask)) | FlagsLvalueBit | FlagsRowMajorBit + }; + + typedef Block BlockType; +}; + +} + +template +class IndexedViewImpl; + + +/** \class IndexedView + * \ingroup Core_Module + * + * \brief Expression of a non-sequential sub-matrix defined by arbitrary sequences of row and column indices + * + * \tparam XprType the type of the expression in which we are taking the intersections of sub-rows and sub-columns + * \tparam RowIndices the type of the object defining the sequence of row indices + * \tparam ColIndices the type of the object defining the sequence of column indices + * + * This class represents an expression of a sub-matrix (or sub-vector) defined as the intersection + * of sub-sets of rows and columns, that are themself defined by generic sequences of row indices \f$ \{r_0,r_1,..r_{m-1}\} \f$ + * and column indices \f$ \{c_0,c_1,..c_{n-1} \}\f$. Let \f$ A \f$ be the nested matrix, then the resulting matrix \f$ B \f$ has \c m + * rows and \c n columns, and its entries are given by: \f$ B(i,j) = A(r_i,c_j) \f$. + * + * The \c RowIndices and \c ColIndices types must be compatible with the following API: + * \code + * operator[](Index) const; + * Index size() const; + * \endcode + * + * Typical supported types thus include: + * - std::vector + * - std::valarray + * - std::array + * - Plain C arrays: int[N] + * - Eigen::ArrayXi + * - decltype(ArrayXi::LinSpaced(...)) + * - Any view/expressions of the previous types + * - Eigen::ArithmeticSequence + * - Eigen::internal::AllRange (helper for Eigen::all) + * - Eigen::internal::SingleRange (helper for single index) + * - etc. + * + * In typical usages of %Eigen, this class should never be used directly. It is the return type of + * DenseBase::operator()(const RowIndices&, const ColIndices&). + * + * \sa class Block + */ +template +class IndexedView : public IndexedViewImpl::StorageKind> +{ +public: + typedef typename IndexedViewImpl::StorageKind>::Base Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(IndexedView) + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(IndexedView) + + typedef typename internal::ref_selector::non_const_type MatrixTypeNested; + typedef typename internal::remove_all::type NestedExpression; + + template + IndexedView(XprType& xpr, const T0& rowIndices, const T1& colIndices) + : m_xpr(xpr), m_rowIndices(rowIndices), m_colIndices(colIndices) + {} + + /** \returns number of rows */ + Index rows() const { return internal::size(m_rowIndices); } + + /** \returns number of columns */ + Index cols() const { return internal::size(m_colIndices); } + + /** \returns the nested expression */ + const typename internal::remove_all::type& + nestedExpression() const { return m_xpr; } + + /** \returns the nested expression */ + typename internal::remove_reference::type& + nestedExpression() { return m_xpr.const_cast_derived(); } + + /** \returns a const reference to the object storing/generating the row indices */ + const RowIndices& rowIndices() const { return m_rowIndices; } + + /** \returns a const reference to the object storing/generating the column indices */ + const ColIndices& colIndices() const { return m_colIndices; } + +protected: + MatrixTypeNested m_xpr; + RowIndices m_rowIndices; + ColIndices m_colIndices; +}; + + +// Generic API dispatcher +template +class IndexedViewImpl + : public internal::generic_xpr_base >::type +{ +public: + typedef typename internal::generic_xpr_base >::type Base; +}; + +namespace internal { + + +template +struct unary_evaluator, IndexBased> + : evaluator_base > +{ + typedef IndexedView XprType; + + enum { + CoeffReadCost = evaluator::CoeffReadCost /* TODO + cost of row/col index */, + + Flags = (evaluator::Flags & (HereditaryBits /*| LinearAccessBit | DirectAccessBit*/)), + + Alignment = 0 + }; + + EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& xpr) : m_argImpl(xpr.nestedExpression()), m_xpr(xpr) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + CoeffReturnType coeff(Index row, Index col) const + { + return m_argImpl.coeff(m_xpr.rowIndices()[row], m_xpr.colIndices()[col]); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Scalar& coeffRef(Index row, Index col) + { + return m_argImpl.coeffRef(m_xpr.rowIndices()[row], m_xpr.colIndices()[col]); + } + +protected: + + evaluator m_argImpl; + const XprType& m_xpr; + +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_INDEXED_VIEW_H diff --git a/Eigen/src/Core/Inverse.h b/Eigen/src/Core/Inverse.h new file mode 100644 index 000000000..b76f0439d --- /dev/null +++ b/Eigen/src/Core/Inverse.h @@ -0,0 +1,118 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2014 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_INVERSE_H +#define EIGEN_INVERSE_H + +namespace Eigen { + +template class InverseImpl; + +namespace internal { + +template +struct traits > + : traits +{ + typedef typename XprType::PlainObject PlainObject; + typedef traits BaseTraits; + enum { + Flags = BaseTraits::Flags & RowMajorBit + }; +}; + +} // end namespace internal + +/** \class Inverse + * + * \brief Expression of the inverse of another expression + * + * \tparam XprType the type of the expression we are taking the inverse + * + * This class represents an abstract expression of A.inverse() + * and most of the time this is the only way it is used. + * + */ +template +class Inverse : public InverseImpl::StorageKind> +{ +public: + typedef typename XprType::StorageIndex StorageIndex; + typedef typename XprType::PlainObject PlainObject; + typedef typename XprType::Scalar Scalar; + typedef typename internal::ref_selector::type XprTypeNested; + typedef typename internal::remove_all::type XprTypeNestedCleaned; + typedef typename internal::ref_selector::type Nested; + typedef typename internal::remove_all::type NestedExpression; + + explicit EIGEN_DEVICE_FUNC Inverse(const XprType &xpr) + : m_xpr(xpr) + {} + + EIGEN_DEVICE_FUNC Index rows() const { return m_xpr.rows(); } + EIGEN_DEVICE_FUNC Index cols() const { return m_xpr.cols(); } + + EIGEN_DEVICE_FUNC const XprTypeNestedCleaned& nestedExpression() const { return m_xpr; } + +protected: + XprTypeNested m_xpr; +}; + +// Generic API dispatcher +template +class InverseImpl + : public internal::generic_xpr_base >::type +{ +public: + typedef typename internal::generic_xpr_base >::type Base; + typedef typename XprType::Scalar Scalar; +private: + + Scalar coeff(Index row, Index col) const; + Scalar coeff(Index i) const; +}; + +namespace internal { + +/** \internal + * \brief Default evaluator for Inverse expression. + * + * This default evaluator for Inverse expression simply evaluate the inverse into a temporary + * by a call to internal::call_assignment_no_alias. + * Therefore, inverse implementers only have to specialize Assignment, ...> for + * there own nested expression. + * + * \sa class Inverse + */ +template +struct unary_evaluator > + : public evaluator::PlainObject> +{ + typedef Inverse InverseType; + typedef typename InverseType::PlainObject PlainObject; + typedef evaluator Base; + + enum { Flags = Base::Flags | EvalBeforeNestingBit }; + + unary_evaluator(const InverseType& inv_xpr) + : m_result(inv_xpr.rows(), inv_xpr.cols()) + { + ::new (static_cast(this)) Base(m_result); + internal::call_assignment_no_alias(m_result, inv_xpr); + } + +protected: + PlainObject m_result; +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_INVERSE_H diff --git a/Eigen/src/Core/Map.h b/Eigen/src/Core/Map.h new file mode 100644 index 000000000..c437f1a92 --- /dev/null +++ b/Eigen/src/Core/Map.h @@ -0,0 +1,171 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2007-2010 Benoit Jacob +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MAP_H +#define EIGEN_MAP_H + +namespace Eigen { + +namespace internal { +template +struct traits > + : public traits +{ + typedef traits TraitsBase; + enum { + PlainObjectTypeInnerSize = ((traits::Flags&RowMajorBit)==RowMajorBit) + ? PlainObjectType::ColsAtCompileTime + : PlainObjectType::RowsAtCompileTime, + + InnerStrideAtCompileTime = StrideType::InnerStrideAtCompileTime == 0 + ? int(PlainObjectType::InnerStrideAtCompileTime) + : int(StrideType::InnerStrideAtCompileTime), + OuterStrideAtCompileTime = StrideType::OuterStrideAtCompileTime == 0 + ? (InnerStrideAtCompileTime==Dynamic || PlainObjectTypeInnerSize==Dynamic + ? Dynamic + : int(InnerStrideAtCompileTime) * int(PlainObjectTypeInnerSize)) + : int(StrideType::OuterStrideAtCompileTime), + Alignment = int(MapOptions)&int(AlignedMask), + Flags0 = TraitsBase::Flags & (~NestByRefBit), + Flags = is_lvalue::value ? int(Flags0) : (int(Flags0) & ~LvalueBit) + }; +private: + enum { Options }; // Expressions don't have Options +}; +} + +/** \class Map + * \ingroup Core_Module + * + * \brief A matrix or vector expression mapping an existing array of data. + * + * \tparam PlainObjectType the equivalent matrix type of the mapped data + * \tparam MapOptions specifies the pointer alignment in bytes. It can be: \c #Aligned128, , \c #Aligned64, \c #Aligned32, \c #Aligned16, \c #Aligned8 or \c #Unaligned. + * The default is \c #Unaligned. + * \tparam StrideType optionally specifies strides. By default, Map assumes the memory layout + * of an ordinary, contiguous array. This can be overridden by specifying strides. + * The type passed here must be a specialization of the Stride template, see examples below. + * + * This class represents a matrix or vector expression mapping an existing array of data. + * It can be used to let Eigen interface without any overhead with non-Eigen data structures, + * such as plain C arrays or structures from other libraries. By default, it assumes that the + * data is laid out contiguously in memory. You can however override this by explicitly specifying + * inner and outer strides. + * + * Here's an example of simply mapping a contiguous array as a \ref TopicStorageOrders "column-major" matrix: + * \include Map_simple.cpp + * Output: \verbinclude Map_simple.out + * + * If you need to map non-contiguous arrays, you can do so by specifying strides: + * + * Here's an example of mapping an array as a vector, specifying an inner stride, that is, the pointer + * increment between two consecutive coefficients. Here, we're specifying the inner stride as a compile-time + * fixed value. + * \include Map_inner_stride.cpp + * Output: \verbinclude Map_inner_stride.out + * + * Here's an example of mapping an array while specifying an outer stride. Here, since we're mapping + * as a column-major matrix, 'outer stride' means the pointer increment between two consecutive columns. + * Here, we're specifying the outer stride as a runtime parameter. Note that here \c OuterStride<> is + * a short version of \c OuterStride because the default template parameter of OuterStride + * is \c Dynamic + * \include Map_outer_stride.cpp + * Output: \verbinclude Map_outer_stride.out + * + * For more details and for an example of specifying both an inner and an outer stride, see class Stride. + * + * \b Tip: to change the array of data mapped by a Map object, you can use the C++ + * placement new syntax: + * + * Example: \include Map_placement_new.cpp + * Output: \verbinclude Map_placement_new.out + * + * This class is the return type of PlainObjectBase::Map() but can also be used directly. + * + * \sa PlainObjectBase::Map(), \ref TopicStorageOrders + */ +template class Map + : public MapBase > +{ + public: + + typedef MapBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Map) + + typedef typename Base::PointerType PointerType; + typedef PointerType PointerArgType; + EIGEN_DEVICE_FUNC + inline PointerType cast_to_pointer_type(PointerArgType ptr) { return ptr; } + + EIGEN_DEVICE_FUNC + inline Index innerStride() const + { + return StrideType::InnerStrideAtCompileTime != 0 ? m_stride.inner() : 1; + } + + EIGEN_DEVICE_FUNC + inline Index outerStride() const + { + return StrideType::OuterStrideAtCompileTime != 0 ? m_stride.outer() + : internal::traits::OuterStrideAtCompileTime != Dynamic ? Index(internal::traits::OuterStrideAtCompileTime) + : IsVectorAtCompileTime ? (this->size() * innerStride()) + : int(Flags)&RowMajorBit ? (this->cols() * innerStride()) + : (this->rows() * innerStride()); + } + + /** Constructor in the fixed-size case. + * + * \param dataPtr pointer to the array to map + * \param stride optional Stride object, passing the strides. + */ + EIGEN_DEVICE_FUNC + explicit inline Map(PointerArgType dataPtr, const StrideType& stride = StrideType()) + : Base(cast_to_pointer_type(dataPtr)), m_stride(stride) + { + PlainObjectType::Base::_check_template_params(); + } + + /** Constructor in the dynamic-size vector case. + * + * \param dataPtr pointer to the array to map + * \param size the size of the vector expression + * \param stride optional Stride object, passing the strides. + */ + EIGEN_DEVICE_FUNC + inline Map(PointerArgType dataPtr, Index size, const StrideType& stride = StrideType()) + : Base(cast_to_pointer_type(dataPtr), size), m_stride(stride) + { + PlainObjectType::Base::_check_template_params(); + } + + /** Constructor in the dynamic-size matrix case. + * + * \param dataPtr pointer to the array to map + * \param rows the number of rows of the matrix expression + * \param cols the number of columns of the matrix expression + * \param stride optional Stride object, passing the strides. + */ + EIGEN_DEVICE_FUNC + inline Map(PointerArgType dataPtr, Index rows, Index cols, const StrideType& stride = StrideType()) + : Base(cast_to_pointer_type(dataPtr), rows, cols), m_stride(stride) + { + PlainObjectType::Base::_check_template_params(); + } + + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Map) + + protected: + StrideType m_stride; +}; + + +} // end namespace Eigen + +#endif // EIGEN_MAP_H diff --git a/Eigen/src/Core/MapBase.h b/Eigen/src/Core/MapBase.h new file mode 100644 index 000000000..020f939ad --- /dev/null +++ b/Eigen/src/Core/MapBase.h @@ -0,0 +1,299 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2007-2010 Benoit Jacob +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MAPBASE_H +#define EIGEN_MAPBASE_H + +#define EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS(Derived) \ + EIGEN_STATIC_ASSERT((int(internal::evaluator::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime, \ + YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT) + +namespace Eigen { + +/** \ingroup Core_Module + * + * \brief Base class for dense Map and Block expression with direct access + * + * This base class provides the const low-level accessors (e.g. coeff, coeffRef) of dense + * Map and Block objects with direct access. + * Typical users do not have to directly deal with this class. + * + * This class can be extended by through the macro plugin \c EIGEN_MAPBASE_PLUGIN. + * See \link TopicCustomizing_Plugins customizing Eigen \endlink for details. + * + * The \c Derived class has to provide the following two methods describing the memory layout: + * \code Index innerStride() const; \endcode + * \code Index outerStride() const; \endcode + * + * \sa class Map, class Block + */ +template class MapBase + : public internal::dense_xpr_base::type +{ + public: + + typedef typename internal::dense_xpr_base::type Base; + enum { + RowsAtCompileTime = internal::traits::RowsAtCompileTime, + ColsAtCompileTime = internal::traits::ColsAtCompileTime, + SizeAtCompileTime = Base::SizeAtCompileTime + }; + + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::packet_traits::type PacketScalar; + typedef typename NumTraits::Real RealScalar; + typedef typename internal::conditional< + bool(internal::is_lvalue::value), + Scalar *, + const Scalar *>::type + PointerType; + + using Base::derived; +// using Base::RowsAtCompileTime; +// using Base::ColsAtCompileTime; +// using Base::SizeAtCompileTime; + using Base::MaxRowsAtCompileTime; + using Base::MaxColsAtCompileTime; + using Base::MaxSizeAtCompileTime; + using Base::IsVectorAtCompileTime; + using Base::Flags; + using Base::IsRowMajor; + + using Base::rows; + using Base::cols; + using Base::size; + using Base::coeff; + using Base::coeffRef; + using Base::lazyAssign; + using Base::eval; + + using Base::innerStride; + using Base::outerStride; + using Base::rowStride; + using Base::colStride; + + // bug 217 - compile error on ICC 11.1 + using Base::operator=; + + typedef typename Base::CoeffReturnType CoeffReturnType; + + /** \copydoc DenseBase::rows() */ + EIGEN_DEVICE_FUNC inline Index rows() const { return m_rows.value(); } + /** \copydoc DenseBase::cols() */ + EIGEN_DEVICE_FUNC inline Index cols() const { return m_cols.value(); } + + /** Returns a pointer to the first coefficient of the matrix or vector. + * + * \note When addressing this data, make sure to honor the strides returned by innerStride() and outerStride(). + * + * \sa innerStride(), outerStride() + */ + EIGEN_DEVICE_FUNC inline const Scalar* data() const { return m_data; } + + /** \copydoc PlainObjectBase::coeff(Index,Index) const */ + EIGEN_DEVICE_FUNC + inline const Scalar& coeff(Index rowId, Index colId) const + { + return m_data[colId * colStride() + rowId * rowStride()]; + } + + /** \copydoc PlainObjectBase::coeff(Index) const */ + EIGEN_DEVICE_FUNC + inline const Scalar& coeff(Index index) const + { + EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS(Derived) + return m_data[index * innerStride()]; + } + + /** \copydoc PlainObjectBase::coeffRef(Index,Index) const */ + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index rowId, Index colId) const + { + return this->m_data[colId * colStride() + rowId * rowStride()]; + } + + /** \copydoc PlainObjectBase::coeffRef(Index) const */ + EIGEN_DEVICE_FUNC + inline const Scalar& coeffRef(Index index) const + { + EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS(Derived) + return this->m_data[index * innerStride()]; + } + + /** \internal */ + template + inline PacketScalar packet(Index rowId, Index colId) const + { + return internal::ploadt + (m_data + (colId * colStride() + rowId * rowStride())); + } + + /** \internal */ + template + inline PacketScalar packet(Index index) const + { + EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS(Derived) + return internal::ploadt(m_data + index * innerStride()); + } + + /** \internal Constructor for fixed size matrices or vectors */ + EIGEN_DEVICE_FUNC + explicit inline MapBase(PointerType dataPtr) : m_data(dataPtr), m_rows(RowsAtCompileTime), m_cols(ColsAtCompileTime) + { + EIGEN_STATIC_ASSERT_FIXED_SIZE(Derived) + checkSanity(); + } + + /** \internal Constructor for dynamically sized vectors */ + EIGEN_DEVICE_FUNC + inline MapBase(PointerType dataPtr, Index vecSize) + : m_data(dataPtr), + m_rows(RowsAtCompileTime == Dynamic ? vecSize : Index(RowsAtCompileTime)), + m_cols(ColsAtCompileTime == Dynamic ? vecSize : Index(ColsAtCompileTime)) + { + EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) + eigen_assert(vecSize >= 0); + eigen_assert(dataPtr == 0 || SizeAtCompileTime == Dynamic || SizeAtCompileTime == vecSize); + checkSanity(); + } + + /** \internal Constructor for dynamically sized matrices */ + EIGEN_DEVICE_FUNC + inline MapBase(PointerType dataPtr, Index rows, Index cols) + : m_data(dataPtr), m_rows(rows), m_cols(cols) + { + eigen_assert( (dataPtr == 0) + || ( rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows) + && cols >= 0 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols))); + checkSanity(); + } + + #ifdef EIGEN_MAPBASE_PLUGIN + #include EIGEN_MAPBASE_PLUGIN + #endif + + protected: + + template + EIGEN_DEVICE_FUNC + void checkSanity(typename internal::enable_if<(internal::traits::Alignment>0),void*>::type = 0) const + { +#if EIGEN_MAX_ALIGN_BYTES>0 + eigen_assert(( ((internal::UIntPtr(m_data) % internal::traits::Alignment) == 0) + || (cols() * rows() * innerStride() * sizeof(Scalar)) < internal::traits::Alignment ) && "data is not aligned"); +#endif + } + + template + EIGEN_DEVICE_FUNC + void checkSanity(typename internal::enable_if::Alignment==0,void*>::type = 0) const + {} + + PointerType m_data; + const internal::variable_if_dynamic m_rows; + const internal::variable_if_dynamic m_cols; +}; + +/** \ingroup Core_Module + * + * \brief Base class for non-const dense Map and Block expression with direct access + * + * This base class provides the non-const low-level accessors (e.g. coeff and coeffRef) of + * dense Map and Block objects with direct access. + * It inherits MapBase which defines the const variant for reading specific entries. + * + * \sa class Map, class Block + */ +template class MapBase + : public MapBase +{ + typedef MapBase ReadOnlyMapBase; + public: + + typedef MapBase Base; + + typedef typename Base::Scalar Scalar; + typedef typename Base::PacketScalar PacketScalar; + typedef typename Base::StorageIndex StorageIndex; + typedef typename Base::PointerType PointerType; + + using Base::derived; + using Base::rows; + using Base::cols; + using Base::size; + using Base::coeff; + using Base::coeffRef; + + using Base::innerStride; + using Base::outerStride; + using Base::rowStride; + using Base::colStride; + + typedef typename internal::conditional< + internal::is_lvalue::value, + Scalar, + const Scalar + >::type ScalarWithConstIfNotLvalue; + + EIGEN_DEVICE_FUNC + inline const Scalar* data() const { return this->m_data; } + EIGEN_DEVICE_FUNC + inline ScalarWithConstIfNotLvalue* data() { return this->m_data; } // no const-cast here so non-const-correct code will give a compile error + + EIGEN_DEVICE_FUNC + inline ScalarWithConstIfNotLvalue& coeffRef(Index row, Index col) + { + return this->m_data[col * colStride() + row * rowStride()]; + } + + EIGEN_DEVICE_FUNC + inline ScalarWithConstIfNotLvalue& coeffRef(Index index) + { + EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS(Derived) + return this->m_data[index * innerStride()]; + } + + template + inline void writePacket(Index row, Index col, const PacketScalar& val) + { + internal::pstoret + (this->m_data + (col * colStride() + row * rowStride()), val); + } + + template + inline void writePacket(Index index, const PacketScalar& val) + { + EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS(Derived) + internal::pstoret + (this->m_data + index * innerStride(), val); + } + + EIGEN_DEVICE_FUNC explicit inline MapBase(PointerType dataPtr) : Base(dataPtr) {} + EIGEN_DEVICE_FUNC inline MapBase(PointerType dataPtr, Index vecSize) : Base(dataPtr, vecSize) {} + EIGEN_DEVICE_FUNC inline MapBase(PointerType dataPtr, Index rows, Index cols) : Base(dataPtr, rows, cols) {} + + EIGEN_DEVICE_FUNC + Derived& operator=(const MapBase& other) + { + ReadOnlyMapBase::Base::operator=(other); + return derived(); + } + + // In theory we could simply refer to Base:Base::operator=, but MSVC does not like Base::Base, + // see bugs 821 and 920. + using ReadOnlyMapBase::Base::operator=; +}; + +#undef EIGEN_STATIC_ASSERT_INDEX_BASED_ACCESS + +} // end namespace Eigen + +#endif // EIGEN_MAPBASE_H diff --git a/Eigen/src/Core/MathFunctions.h b/Eigen/src/Core/MathFunctions.h new file mode 100644 index 000000000..5ba5293a0 --- /dev/null +++ b/Eigen/src/Core/MathFunctions.h @@ -0,0 +1,1711 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MATHFUNCTIONS_H +#define EIGEN_MATHFUNCTIONS_H + +// source: http://www.geom.uiuc.edu/~huberty/math5337/groupe/digits.html +// TODO this should better be moved to NumTraits +#define EIGEN_PI 3.141592653589793238462643383279502884197169399375105820974944592307816406L + +namespace Eigen { + +// On WINCE, std::abs is defined for int only, so let's defined our own overloads: +// This issue has been confirmed with MSVC 2008 only, but the issue might exist for more recent versions too. +#if EIGEN_OS_WINCE && EIGEN_COMP_MSVC && EIGEN_COMP_MSVC<=1500 +long abs(long x) { return (labs(x)); } +double abs(double x) { return (fabs(x)); } +float abs(float x) { return (fabsf(x)); } +long double abs(long double x) { return (fabsl(x)); } +#endif + +namespace internal { + +/** \internal \class global_math_functions_filtering_base + * + * What it does: + * Defines a typedef 'type' as follows: + * - if type T has a member typedef Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl, then + * global_math_functions_filtering_base::type is a typedef for it. + * - otherwise, global_math_functions_filtering_base::type is a typedef for T. + * + * How it's used: + * To allow to defined the global math functions (like sin...) in certain cases, like the Array expressions. + * When you do sin(array1+array2), the object array1+array2 has a complicated expression type, all what you want to know + * is that it inherits ArrayBase. So we implement a partial specialization of sin_impl for ArrayBase. + * So we must make sure to use sin_impl > and not sin_impl, otherwise our partial specialization + * won't be used. How does sin know that? That's exactly what global_math_functions_filtering_base tells it. + * + * How it's implemented: + * SFINAE in the style of enable_if. Highly susceptible of breaking compilers. With GCC, it sure does work, but if you replace + * the typename dummy by an integer template parameter, it doesn't work anymore! + */ + +template +struct global_math_functions_filtering_base +{ + typedef T type; +}; + +template struct always_void { typedef void type; }; + +template +struct global_math_functions_filtering_base + ::type + > +{ + typedef typename T::Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl type; +}; + +#define EIGEN_MATHFUNC_IMPL(func, scalar) Eigen::internal::func##_impl::type> +#define EIGEN_MATHFUNC_RETVAL(func, scalar) typename Eigen::internal::func##_retval::type>::type + +/**************************************************************************** +* Implementation of real * +****************************************************************************/ + +template::IsComplex> +struct real_default_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + return x; + } +}; + +template +struct real_default_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + using std::real; + return real(x); + } +}; + +template struct real_impl : real_default_impl {}; + +#ifdef EIGEN_CUDA_ARCH +template +struct real_impl > +{ + typedef T RealScalar; + EIGEN_DEVICE_FUNC + static inline T run(const std::complex& x) + { + return x.real(); + } +}; +#endif + +template +struct real_retval +{ + typedef typename NumTraits::Real type; +}; + +/**************************************************************************** +* Implementation of imag * +****************************************************************************/ + +template::IsComplex> +struct imag_default_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar&) + { + return RealScalar(0); + } +}; + +template +struct imag_default_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + using std::imag; + return imag(x); + } +}; + +template struct imag_impl : imag_default_impl {}; + +#ifdef EIGEN_CUDA_ARCH +template +struct imag_impl > +{ + typedef T RealScalar; + EIGEN_DEVICE_FUNC + static inline T run(const std::complex& x) + { + return x.imag(); + } +}; +#endif + +template +struct imag_retval +{ + typedef typename NumTraits::Real type; +}; + +/**************************************************************************** +* Implementation of real_ref * +****************************************************************************/ + +template +struct real_ref_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar& run(Scalar& x) + { + return reinterpret_cast(&x)[0]; + } + EIGEN_DEVICE_FUNC + static inline const RealScalar& run(const Scalar& x) + { + return reinterpret_cast(&x)[0]; + } +}; + +template +struct real_ref_retval +{ + typedef typename NumTraits::Real & type; +}; + +/**************************************************************************** +* Implementation of imag_ref * +****************************************************************************/ + +template +struct imag_ref_default_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar& run(Scalar& x) + { + return reinterpret_cast(&x)[1]; + } + EIGEN_DEVICE_FUNC + static inline const RealScalar& run(const Scalar& x) + { + return reinterpret_cast(&x)[1]; + } +}; + +template +struct imag_ref_default_impl +{ + EIGEN_DEVICE_FUNC + static inline Scalar run(Scalar&) + { + return Scalar(0); + } + EIGEN_DEVICE_FUNC + static inline const Scalar run(const Scalar&) + { + return Scalar(0); + } +}; + +template +struct imag_ref_impl : imag_ref_default_impl::IsComplex> {}; + +template +struct imag_ref_retval +{ + typedef typename NumTraits::Real & type; +}; + +/**************************************************************************** +* Implementation of conj * +****************************************************************************/ + +template::IsComplex> +struct conj_impl +{ + EIGEN_DEVICE_FUNC + static inline Scalar run(const Scalar& x) + { + return x; + } +}; + +template +struct conj_impl +{ + EIGEN_DEVICE_FUNC + static inline Scalar run(const Scalar& x) + { + using std::conj; + return conj(x); + } +}; + +template +struct conj_retval +{ + typedef Scalar type; +}; + +/**************************************************************************** +* Implementation of abs2 * +****************************************************************************/ + +template +struct abs2_impl_default +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + return x*x; + } +}; + +template +struct abs2_impl_default // IsComplex +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + return real(x)*real(x) + imag(x)*imag(x); + } +}; + +template +struct abs2_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + return abs2_impl_default::IsComplex>::run(x); + } +}; + +template +struct abs2_retval +{ + typedef typename NumTraits::Real type; +}; + +/**************************************************************************** +* Implementation of norm1 * +****************************************************************************/ + +template +struct norm1_default_impl +{ + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + EIGEN_USING_STD_MATH(abs); + return abs(real(x)) + abs(imag(x)); + } +}; + +template +struct norm1_default_impl +{ + EIGEN_DEVICE_FUNC + static inline Scalar run(const Scalar& x) + { + EIGEN_USING_STD_MATH(abs); + return abs(x); + } +}; + +template +struct norm1_impl : norm1_default_impl::IsComplex> {}; + +template +struct norm1_retval +{ + typedef typename NumTraits::Real type; +}; + +/**************************************************************************** +* Implementation of hypot * +****************************************************************************/ + +template +struct hypot_impl +{ + typedef typename NumTraits::Real RealScalar; + static inline RealScalar run(const Scalar& x, const Scalar& y) + { + EIGEN_USING_STD_MATH(abs); + EIGEN_USING_STD_MATH(sqrt); + RealScalar _x = abs(x); + RealScalar _y = abs(y); + Scalar p, qp; + if(_x>_y) + { + p = _x; + qp = _y / p; + } + else + { + p = _y; + qp = _x / p; + } + if(p==RealScalar(0)) return RealScalar(0); + return p * sqrt(RealScalar(1) + qp*qp); + } +}; + +template +struct hypot_retval +{ + typedef typename NumTraits::Real type; +}; + +/**************************************************************************** +* Implementation of cast * +****************************************************************************/ + +template +struct cast_impl +{ + EIGEN_DEVICE_FUNC + static inline NewType run(const OldType& x) + { + return static_cast(x); + } +}; + +// here, for once, we're plainly returning NewType: we don't want cast to do weird things. + +template +EIGEN_DEVICE_FUNC +inline NewType cast(const OldType& x) +{ + return cast_impl::run(x); +} + +/**************************************************************************** +* Implementation of round * +****************************************************************************/ + +#if EIGEN_HAS_CXX11_MATH + template + struct round_impl { + static inline Scalar run(const Scalar& x) + { + EIGEN_STATIC_ASSERT((!NumTraits::IsComplex), NUMERIC_TYPE_MUST_BE_REAL) + EIGEN_USING_STD_MATH(round); + return round(x); + } + }; +#else + template + struct round_impl + { + static inline Scalar run(const Scalar& x) + { + EIGEN_STATIC_ASSERT((!NumTraits::IsComplex), NUMERIC_TYPE_MUST_BE_REAL) + EIGEN_USING_STD_MATH(floor); + EIGEN_USING_STD_MATH(ceil); + return (x > Scalar(0)) ? floor(x + Scalar(0.5)) : ceil(x - Scalar(0.5)); + } + }; +#endif + +template +struct round_retval +{ + typedef Scalar type; +}; + +/**************************************************************************** +* Implementation of arg * +****************************************************************************/ + +#if EIGEN_HAS_CXX11_MATH + template + struct arg_impl { + static inline Scalar run(const Scalar& x) + { + EIGEN_USING_STD_MATH(arg); + return arg(x); + } + }; +#else + template::IsComplex> + struct arg_default_impl + { + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + return (x < Scalar(0)) ? Scalar(EIGEN_PI) : Scalar(0); } + }; + + template + struct arg_default_impl + { + typedef typename NumTraits::Real RealScalar; + EIGEN_DEVICE_FUNC + static inline RealScalar run(const Scalar& x) + { + EIGEN_USING_STD_MATH(arg); + return arg(x); + } + }; + + template struct arg_impl : arg_default_impl {}; +#endif + +template +struct arg_retval +{ + typedef typename NumTraits::Real type; +}; + +/**************************************************************************** +* Implementation of expm1 * +****************************************************************************/ + +// This implementation is based on GSL Math's expm1. +namespace std_fallback { + // fallback expm1 implementation in case there is no expm1(Scalar) function in namespace of Scalar, + // or that there is no suitable std::expm1 function available. Implementation + // attributed to Kahan. See: http://www.plunk.org/~hatch/rightway.php. + template + EIGEN_DEVICE_FUNC inline Scalar expm1(const Scalar& x) { + EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar) + typedef typename NumTraits::Real RealScalar; + + EIGEN_USING_STD_MATH(exp); + Scalar u = exp(x); + if (u == Scalar(1)) { + return x; + } + Scalar um1 = u - RealScalar(1); + if (um1 == Scalar(-1)) { + return RealScalar(-1); + } + + EIGEN_USING_STD_MATH(log); + return (u - RealScalar(1)) * x / log(u); + } +} + +template +struct expm1_impl { + EIGEN_DEVICE_FUNC static inline Scalar run(const Scalar& x) + { + EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar) + #if EIGEN_HAS_CXX11_MATH + using std::expm1; + #endif + using std_fallback::expm1; + return expm1(x); + } +}; + + +template +struct expm1_retval +{ + typedef Scalar type; +}; + +/**************************************************************************** +* Implementation of log1p * +****************************************************************************/ + +namespace std_fallback { + // fallback log1p implementation in case there is no log1p(Scalar) function in namespace of Scalar, + // or that there is no suitable std::log1p function available + template + EIGEN_DEVICE_FUNC inline Scalar log1p(const Scalar& x) { + EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar) + typedef typename NumTraits::Real RealScalar; + EIGEN_USING_STD_MATH(log); + Scalar x1p = RealScalar(1) + x; + return ( x1p == Scalar(1) ) ? x : x * ( log(x1p) / (x1p - RealScalar(1)) ); + } +} + +template +struct log1p_impl { + EIGEN_DEVICE_FUNC static inline Scalar run(const Scalar& x) + { + EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar) + #if EIGEN_HAS_CXX11_MATH + using std::log1p; + #endif + using std_fallback::log1p; + return log1p(x); + } +}; + + +template +struct log1p_retval +{ + typedef Scalar type; +}; + +/**************************************************************************** +* Implementation of pow * +****************************************************************************/ + +template::IsInteger&&NumTraits::IsInteger> +struct pow_impl +{ + //typedef Scalar retval; + typedef typename ScalarBinaryOpTraits >::ReturnType result_type; + static EIGEN_DEVICE_FUNC inline result_type run(const ScalarX& x, const ScalarY& y) + { + EIGEN_USING_STD_MATH(pow); + return pow(x, y); + } +}; + +template +struct pow_impl +{ + typedef ScalarX result_type; + static EIGEN_DEVICE_FUNC inline ScalarX run(ScalarX x, ScalarY y) + { + ScalarX res(1); + eigen_assert(!NumTraits::IsSigned || y >= 0); + if(y & 1) res *= x; + y >>= 1; + while(y) + { + x *= x; + if(y&1) res *= x; + y >>= 1; + } + return res; + } +}; + +/**************************************************************************** +* Implementation of random * +****************************************************************************/ + +template +struct random_default_impl {}; + +template +struct random_impl : random_default_impl::IsComplex, NumTraits::IsInteger> {}; + +template +struct random_retval +{ + typedef Scalar type; +}; + +template inline EIGEN_MATHFUNC_RETVAL(random, Scalar) random(const Scalar& x, const Scalar& y); +template inline EIGEN_MATHFUNC_RETVAL(random, Scalar) random(); + +template +struct random_default_impl +{ + static inline Scalar run(const Scalar& x, const Scalar& y) + { + return x + (y-x) * Scalar(std::rand()) / Scalar(RAND_MAX); + } + static inline Scalar run() + { + return run(Scalar(NumTraits::IsSigned ? -1 : 0), Scalar(1)); + } +}; + +enum { + meta_floor_log2_terminate, + meta_floor_log2_move_up, + meta_floor_log2_move_down, + meta_floor_log2_bogus +}; + +template struct meta_floor_log2_selector +{ + enum { middle = (lower + upper) / 2, + value = (upper <= lower + 1) ? int(meta_floor_log2_terminate) + : (n < (1 << middle)) ? int(meta_floor_log2_move_down) + : (n==0) ? int(meta_floor_log2_bogus) + : int(meta_floor_log2_move_up) + }; +}; + +template::value> +struct meta_floor_log2 {}; + +template +struct meta_floor_log2 +{ + enum { value = meta_floor_log2::middle>::value }; +}; + +template +struct meta_floor_log2 +{ + enum { value = meta_floor_log2::middle, upper>::value }; +}; + +template +struct meta_floor_log2 +{ + enum { value = (n >= ((unsigned int)(1) << (lower+1))) ? lower+1 : lower }; +}; + +template +struct meta_floor_log2 +{ + // no value, error at compile time +}; + +template +struct random_default_impl +{ + static inline Scalar run(const Scalar& x, const Scalar& y) + { + typedef typename conditional::IsSigned,std::ptrdiff_t,std::size_t>::type ScalarX; + if(y=x the result converted to an unsigned long is still correct. + std::size_t range = ScalarX(y)-ScalarX(x); + std::size_t offset = 0; + // rejection sampling + std::size_t divisor = 1; + std::size_t multiplier = 1; + if(range range); + return Scalar(ScalarX(x) + offset); + } + + static inline Scalar run() + { +#ifdef EIGEN_MAKING_DOCS + return run(Scalar(NumTraits::IsSigned ? -10 : 0), Scalar(10)); +#else + enum { rand_bits = meta_floor_log2<(unsigned int)(RAND_MAX)+1>::value, + scalar_bits = sizeof(Scalar) * CHAR_BIT, + shift = EIGEN_PLAIN_ENUM_MAX(0, int(rand_bits) - int(scalar_bits)), + offset = NumTraits::IsSigned ? (1 << (EIGEN_PLAIN_ENUM_MIN(rand_bits,scalar_bits)-1)) : 0 + }; + return Scalar((std::rand() >> shift) - offset); +#endif + } +}; + +template +struct random_default_impl +{ + static inline Scalar run(const Scalar& x, const Scalar& y) + { + return Scalar(random(real(x), real(y)), + random(imag(x), imag(y))); + } + static inline Scalar run() + { + typedef typename NumTraits::Real RealScalar; + return Scalar(random(), random()); + } +}; + +template +inline EIGEN_MATHFUNC_RETVAL(random, Scalar) random(const Scalar& x, const Scalar& y) +{ + return EIGEN_MATHFUNC_IMPL(random, Scalar)::run(x, y); +} + +template +inline EIGEN_MATHFUNC_RETVAL(random, Scalar) random() +{ + return EIGEN_MATHFUNC_IMPL(random, Scalar)::run(); +} + +// Implementatin of is* functions + +// std::is* do not work with fast-math and gcc, std::is* are available on MSVC 2013 and newer, as well as in clang. +#if (EIGEN_HAS_CXX11_MATH && !(EIGEN_COMP_GNUC_STRICT && __FINITE_MATH_ONLY__)) || (EIGEN_COMP_MSVC>=1800) || (EIGEN_COMP_CLANG) +#define EIGEN_USE_STD_FPCLASSIFY 1 +#else +#define EIGEN_USE_STD_FPCLASSIFY 0 +#endif + +template +EIGEN_DEVICE_FUNC +typename internal::enable_if::value,bool>::type +isnan_impl(const T&) { return false; } + +template +EIGEN_DEVICE_FUNC +typename internal::enable_if::value,bool>::type +isinf_impl(const T&) { return false; } + +template +EIGEN_DEVICE_FUNC +typename internal::enable_if::value,bool>::type +isfinite_impl(const T&) { return true; } + +template +EIGEN_DEVICE_FUNC +typename internal::enable_if<(!internal::is_integral::value)&&(!NumTraits::IsComplex),bool>::type +isfinite_impl(const T& x) +{ + #ifdef EIGEN_CUDA_ARCH + return (::isfinite)(x); + #elif EIGEN_USE_STD_FPCLASSIFY + using std::isfinite; + return isfinite EIGEN_NOT_A_MACRO (x); + #else + return x<=NumTraits::highest() && x>=NumTraits::lowest(); + #endif +} + +template +EIGEN_DEVICE_FUNC +typename internal::enable_if<(!internal::is_integral::value)&&(!NumTraits::IsComplex),bool>::type +isinf_impl(const T& x) +{ + #ifdef EIGEN_CUDA_ARCH + return (::isinf)(x); + #elif EIGEN_USE_STD_FPCLASSIFY + using std::isinf; + return isinf EIGEN_NOT_A_MACRO (x); + #else + return x>NumTraits::highest() || x::lowest(); + #endif +} + +template +EIGEN_DEVICE_FUNC +typename internal::enable_if<(!internal::is_integral::value)&&(!NumTraits::IsComplex),bool>::type +isnan_impl(const T& x) +{ + #ifdef EIGEN_CUDA_ARCH + return (::isnan)(x); + #elif EIGEN_USE_STD_FPCLASSIFY + using std::isnan; + return isnan EIGEN_NOT_A_MACRO (x); + #else + return x != x; + #endif +} + +#if (!EIGEN_USE_STD_FPCLASSIFY) + +#if EIGEN_COMP_MSVC + +template EIGEN_DEVICE_FUNC bool isinf_msvc_helper(T x) +{ + return _fpclass(x)==_FPCLASS_NINF || _fpclass(x)==_FPCLASS_PINF; +} + +//MSVC defines a _isnan builtin function, but for double only +EIGEN_DEVICE_FUNC inline bool isnan_impl(const long double& x) { return _isnan(x)!=0; } +EIGEN_DEVICE_FUNC inline bool isnan_impl(const double& x) { return _isnan(x)!=0; } +EIGEN_DEVICE_FUNC inline bool isnan_impl(const float& x) { return _isnan(x)!=0; } + +EIGEN_DEVICE_FUNC inline bool isinf_impl(const long double& x) { return isinf_msvc_helper(x); } +EIGEN_DEVICE_FUNC inline bool isinf_impl(const double& x) { return isinf_msvc_helper(x); } +EIGEN_DEVICE_FUNC inline bool isinf_impl(const float& x) { return isinf_msvc_helper(x); } + +#elif (defined __FINITE_MATH_ONLY__ && __FINITE_MATH_ONLY__ && EIGEN_COMP_GNUC) + +#if EIGEN_GNUC_AT_LEAST(5,0) + #define EIGEN_TMP_NOOPT_ATTRIB EIGEN_DEVICE_FUNC inline __attribute__((optimize("no-finite-math-only"))) +#else + // NOTE the inline qualifier and noinline attribute are both needed: the former is to avoid linking issue (duplicate symbol), + // while the second prevent too aggressive optimizations in fast-math mode: + #define EIGEN_TMP_NOOPT_ATTRIB EIGEN_DEVICE_FUNC inline __attribute__((noinline,optimize("no-finite-math-only"))) +#endif + +template<> EIGEN_TMP_NOOPT_ATTRIB bool isnan_impl(const long double& x) { return __builtin_isnan(x); } +template<> EIGEN_TMP_NOOPT_ATTRIB bool isnan_impl(const double& x) { return __builtin_isnan(x); } +template<> EIGEN_TMP_NOOPT_ATTRIB bool isnan_impl(const float& x) { return __builtin_isnan(x); } +template<> EIGEN_TMP_NOOPT_ATTRIB bool isinf_impl(const double& x) { return __builtin_isinf(x); } +template<> EIGEN_TMP_NOOPT_ATTRIB bool isinf_impl(const float& x) { return __builtin_isinf(x); } +template<> EIGEN_TMP_NOOPT_ATTRIB bool isinf_impl(const long double& x) { return __builtin_isinf(x); } + +#undef EIGEN_TMP_NOOPT_ATTRIB + +#endif + +#endif + +// The following overload are defined at the end of this file +template EIGEN_DEVICE_FUNC bool isfinite_impl(const std::complex& x); +template EIGEN_DEVICE_FUNC bool isnan_impl(const std::complex& x); +template EIGEN_DEVICE_FUNC bool isinf_impl(const std::complex& x); + +template T generic_fast_tanh_float(const T& a_x); + +} // end namespace internal + +/**************************************************************************** +* Generic math functions * +****************************************************************************/ + +namespace numext { + +#if !defined(EIGEN_CUDA_ARCH) && !defined(__SYCL_DEVICE_ONLY__) +template +EIGEN_DEVICE_FUNC +EIGEN_ALWAYS_INLINE T mini(const T& x, const T& y) +{ + EIGEN_USING_STD_MATH(min); + return min EIGEN_NOT_A_MACRO (x,y); +} + +template +EIGEN_DEVICE_FUNC +EIGEN_ALWAYS_INLINE T maxi(const T& x, const T& y) +{ + EIGEN_USING_STD_MATH(max); + return max EIGEN_NOT_A_MACRO (x,y); +} + + +#elif defined(__SYCL_DEVICE_ONLY__) +template +EIGEN_ALWAYS_INLINE T mini(const T& x, const T& y) +{ + + return y < x ? y : x; +} + +template +EIGEN_ALWAYS_INLINE T maxi(const T& x, const T& y) +{ + + return x < y ? y : x; +} + +EIGEN_ALWAYS_INLINE int mini(const int& x, const int& y) +{ + return cl::sycl::min(x,y); +} + +EIGEN_ALWAYS_INLINE int maxi(const int& x, const int& y) +{ + return cl::sycl::max(x,y); +} + +EIGEN_ALWAYS_INLINE unsigned int mini(const unsigned int& x, const unsigned int& y) +{ + return cl::sycl::min(x,y); +} + +EIGEN_ALWAYS_INLINE unsigned int maxi(const unsigned int& x, const unsigned int& y) +{ + return cl::sycl::max(x,y); +} + +EIGEN_ALWAYS_INLINE long mini(const long & x, const long & y) +{ + return cl::sycl::min(x,y); +} + +EIGEN_ALWAYS_INLINE long maxi(const long & x, const long & y) +{ + return cl::sycl::max(x,y); +} + +EIGEN_ALWAYS_INLINE unsigned long mini(const unsigned long& x, const unsigned long& y) +{ + return cl::sycl::min(x,y); +} + +EIGEN_ALWAYS_INLINE unsigned long maxi(const unsigned long& x, const unsigned long& y) +{ + return cl::sycl::max(x,y); +} + + +EIGEN_ALWAYS_INLINE float mini(const float& x, const float& y) +{ + return cl::sycl::fmin(x,y); +} + +EIGEN_ALWAYS_INLINE float maxi(const float& x, const float& y) +{ + return cl::sycl::fmax(x,y); +} + +EIGEN_ALWAYS_INLINE double mini(const double& x, const double& y) +{ + return cl::sycl::fmin(x,y); +} + +EIGEN_ALWAYS_INLINE double maxi(const double& x, const double& y) +{ + return cl::sycl::fmax(x,y); +} + +#else +template +EIGEN_DEVICE_FUNC +EIGEN_ALWAYS_INLINE T mini(const T& x, const T& y) +{ + return y < x ? y : x; +} +template<> +EIGEN_DEVICE_FUNC +EIGEN_ALWAYS_INLINE float mini(const float& x, const float& y) +{ + return fminf(x, y); +} +template +EIGEN_DEVICE_FUNC +EIGEN_ALWAYS_INLINE T maxi(const T& x, const T& y) +{ + return x < y ? y : x; +} +template<> +EIGEN_DEVICE_FUNC +EIGEN_ALWAYS_INLINE float maxi(const float& x, const float& y) +{ + return fmaxf(x, y); +} +#endif + + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(real, Scalar) real(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(real, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline typename internal::add_const_on_value_type< EIGEN_MATHFUNC_RETVAL(real_ref, Scalar) >::type real_ref(const Scalar& x) +{ + return internal::real_ref_impl::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(real_ref, Scalar) real_ref(Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(real_ref, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(imag, Scalar) imag(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(imag, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(arg, Scalar) arg(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(arg, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline typename internal::add_const_on_value_type< EIGEN_MATHFUNC_RETVAL(imag_ref, Scalar) >::type imag_ref(const Scalar& x) +{ + return internal::imag_ref_impl::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(imag_ref, Scalar) imag_ref(Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(imag_ref, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(conj, Scalar) conj(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(conj, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(abs2, Scalar) abs2(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(abs2, Scalar)::run(x); +} + +EIGEN_DEVICE_FUNC +inline bool abs2(bool x) { return x; } + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(norm1, Scalar) norm1(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(norm1, Scalar)::run(x); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(hypot, Scalar) hypot(const Scalar& x, const Scalar& y) +{ + return EIGEN_MATHFUNC_IMPL(hypot, Scalar)::run(x, y); +} + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(log1p, Scalar) log1p(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(log1p, Scalar)::run(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float log1p(float x) { return cl::sycl::log1p(x); } +EIGEN_ALWAYS_INLINE double log1p(double x) { return cl::sycl::log1p(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float log1p(const float &x) { return ::log1pf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double log1p(const double &x) { return ::log1p(x); } +#endif + +template +EIGEN_DEVICE_FUNC +inline typename internal::pow_impl::result_type pow(const ScalarX& x, const ScalarY& y) +{ + return internal::pow_impl::run(x, y); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float pow(float x, float y) { return cl::sycl::pow(x, y); } +EIGEN_ALWAYS_INLINE double pow(double x, double y) { return cl::sycl::pow(x, y); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +template EIGEN_DEVICE_FUNC bool (isnan) (const T &x) { return internal::isnan_impl(x); } +template EIGEN_DEVICE_FUNC bool (isinf) (const T &x) { return internal::isinf_impl(x); } +template EIGEN_DEVICE_FUNC bool (isfinite)(const T &x) { return internal::isfinite_impl(x); } + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float isnan(float x) { return cl::sycl::isnan(x); } +EIGEN_ALWAYS_INLINE double isnan(double x) { return cl::sycl::isnan(x); } +EIGEN_ALWAYS_INLINE float isinf(float x) { return cl::sycl::isinf(x); } +EIGEN_ALWAYS_INLINE double isinf(double x) { return cl::sycl::isinf(x); } +EIGEN_ALWAYS_INLINE float isfinite(float x) { return cl::sycl::isfinite(x); } +EIGEN_ALWAYS_INLINE double isfinite(double x) { return cl::sycl::isfinite(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(round, Scalar) round(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(round, Scalar)::run(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float round(float x) { return cl::sycl::round(x); } +EIGEN_ALWAYS_INLINE double round(double x) { return cl::sycl::round(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +template +EIGEN_DEVICE_FUNC +T (floor)(const T& x) +{ + EIGEN_USING_STD_MATH(floor); + return floor(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float floor(float x) { return cl::sycl::floor(x); } +EIGEN_ALWAYS_INLINE double floor(double x) { return cl::sycl::floor(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float floor(const float &x) { return ::floorf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double floor(const double &x) { return ::floor(x); } +#endif + +template +EIGEN_DEVICE_FUNC +T (ceil)(const T& x) +{ + EIGEN_USING_STD_MATH(ceil); + return ceil(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float ceil(float x) { return cl::sycl::ceil(x); } +EIGEN_ALWAYS_INLINE double ceil(double x) { return cl::sycl::ceil(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float ceil(const float &x) { return ::ceilf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double ceil(const double &x) { return ::ceil(x); } +#endif + + +/** Log base 2 for 32 bits positive integers. + * Conveniently returns 0 for x==0. */ +inline int log2(int x) +{ + eigen_assert(x>=0); + unsigned int v(x); + static const int table[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 }; + v |= v >> 1; + v |= v >> 2; + v |= v >> 4; + v |= v >> 8; + v |= v >> 16; + return table[(v * 0x07C4ACDDU) >> 27]; +} + +/** \returns the square root of \a x. + * + * It is essentially equivalent to \code using std::sqrt; return sqrt(x); \endcode, + * but slightly faster for float/double and some compilers (e.g., gcc), thanks to + * specializations when SSE is enabled. + * + * It's usage is justified in performance critical functions, like norm/normalize. + */ +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T sqrt(const T &x) +{ + EIGEN_USING_STD_MATH(sqrt); + return sqrt(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float sqrt(float x) { return cl::sycl::sqrt(x); } +EIGEN_ALWAYS_INLINE double sqrt(double x) { return cl::sycl::sqrt(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T log(const T &x) { + EIGEN_USING_STD_MATH(log); + return log(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float log(float x) { return cl::sycl::log(x); } +EIGEN_ALWAYS_INLINE double log(double x) { return cl::sycl::log(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float log(const float &x) { return ::logf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double log(const double &x) { return ::log(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +typename internal::enable_if::IsSigned || NumTraits::IsComplex,typename NumTraits::Real>::type +abs(const T &x) { + EIGEN_USING_STD_MATH(abs); + return abs(x); +} + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +typename internal::enable_if::IsSigned || NumTraits::IsComplex),typename NumTraits::Real>::type +abs(const T &x) { + return x; +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float abs(float x) { return cl::sycl::fabs(x); } +EIGEN_ALWAYS_INLINE double abs(double x) { return cl::sycl::fabs(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float abs(const float &x) { return ::fabsf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double abs(const double &x) { return ::fabs(x); } + +template <> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float abs(const std::complex& x) { + return ::hypotf(x.real(), x.imag()); +} + +template <> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double abs(const std::complex& x) { + return ::hypot(x.real(), x.imag()); +} +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T exp(const T &x) { + EIGEN_USING_STD_MATH(exp); + return exp(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float exp(float x) { return cl::sycl::exp(x); } +EIGEN_ALWAYS_INLINE double exp(double x) { return cl::sycl::exp(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float exp(const float &x) { return ::expf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double exp(const double &x) { return ::exp(x); } +#endif + +template +EIGEN_DEVICE_FUNC +inline EIGEN_MATHFUNC_RETVAL(expm1, Scalar) expm1(const Scalar& x) +{ + return EIGEN_MATHFUNC_IMPL(expm1, Scalar)::run(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float expm1(float x) { return cl::sycl::expm1(x); } +EIGEN_ALWAYS_INLINE double expm1(double x) { return cl::sycl::expm1(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float expm1(const float &x) { return ::expm1f(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double expm1(const double &x) { return ::expm1(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T cos(const T &x) { + EIGEN_USING_STD_MATH(cos); + return cos(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float cos(float x) { return cl::sycl::cos(x); } +EIGEN_ALWAYS_INLINE double cos(double x) { return cl::sycl::cos(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float cos(const float &x) { return ::cosf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double cos(const double &x) { return ::cos(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T sin(const T &x) { + EIGEN_USING_STD_MATH(sin); + return sin(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float sin(float x) { return cl::sycl::sin(x); } +EIGEN_ALWAYS_INLINE double sin(double x) { return cl::sycl::sin(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float sin(const float &x) { return ::sinf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double sin(const double &x) { return ::sin(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T tan(const T &x) { + EIGEN_USING_STD_MATH(tan); + return tan(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float tan(float x) { return cl::sycl::tan(x); } +EIGEN_ALWAYS_INLINE double tan(double x) { return cl::sycl::tan(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float tan(const float &x) { return ::tanf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double tan(const double &x) { return ::tan(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T acos(const T &x) { + EIGEN_USING_STD_MATH(acos); + return acos(x); +} + +#if EIGEN_HAS_CXX11_MATH +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T acosh(const T &x) { + EIGEN_USING_STD_MATH(acosh); + return acosh(x); +} +#endif + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float acos(float x) { return cl::sycl::acos(x); } +EIGEN_ALWAYS_INLINE double acos(double x) { return cl::sycl::acos(x); } +EIGEN_ALWAYS_INLINE float acosh(float x) { return cl::sycl::acosh(x); } +EIGEN_ALWAYS_INLINE double acosh(double x) { return cl::sycl::acosh(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float acos(const float &x) { return ::acosf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double acos(const double &x) { return ::acos(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T asin(const T &x) { + EIGEN_USING_STD_MATH(asin); + return asin(x); +} + +#if EIGEN_HAS_CXX11_MATH +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T asinh(const T &x) { + EIGEN_USING_STD_MATH(asinh); + return asinh(x); +} +#endif + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float asin(float x) { return cl::sycl::asin(x); } +EIGEN_ALWAYS_INLINE double asin(double x) { return cl::sycl::asin(x); } +EIGEN_ALWAYS_INLINE float asinh(float x) { return cl::sycl::asinh(x); } +EIGEN_ALWAYS_INLINE double asinh(double x) { return cl::sycl::asinh(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float asin(const float &x) { return ::asinf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double asin(const double &x) { return ::asin(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T atan(const T &x) { + EIGEN_USING_STD_MATH(atan); + return atan(x); +} + +#if EIGEN_HAS_CXX11_MATH +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T atanh(const T &x) { + EIGEN_USING_STD_MATH(atanh); + return atanh(x); +} +#endif + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float atan(float x) { return cl::sycl::atan(x); } +EIGEN_ALWAYS_INLINE double atan(double x) { return cl::sycl::atan(x); } +EIGEN_ALWAYS_INLINE float atanh(float x) { return cl::sycl::atanh(x); } +EIGEN_ALWAYS_INLINE double atanh(double x) { return cl::sycl::atanh(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float atan(const float &x) { return ::atanf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double atan(const double &x) { return ::atan(x); } +#endif + + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T cosh(const T &x) { + EIGEN_USING_STD_MATH(cosh); + return cosh(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float cosh(float x) { return cl::sycl::cosh(x); } +EIGEN_ALWAYS_INLINE double cosh(double x) { return cl::sycl::cosh(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float cosh(const float &x) { return ::coshf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double cosh(const double &x) { return ::cosh(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T sinh(const T &x) { + EIGEN_USING_STD_MATH(sinh); + return sinh(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float sinh(float x) { return cl::sycl::sinh(x); } +EIGEN_ALWAYS_INLINE double sinh(double x) { return cl::sycl::sinh(x); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float sinh(const float &x) { return ::sinhf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double sinh(const double &x) { return ::sinh(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T tanh(const T &x) { + EIGEN_USING_STD_MATH(tanh); + return tanh(x); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float tanh(float x) { return cl::sycl::tanh(x); } +EIGEN_ALWAYS_INLINE double tanh(double x) { return cl::sycl::tanh(x); } +#elif (!defined(EIGEN_CUDACC)) && EIGEN_FAST_MATH +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float tanh(float x) { return internal::generic_fast_tanh_float(x); } +#endif + +#ifdef EIGEN_CUDACC +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float tanh(const float &x) { return ::tanhf(x); } + +template<> EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double tanh(const double &x) { return ::tanh(x); } +#endif + +template +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +T fmod(const T& a, const T& b) { + EIGEN_USING_STD_MATH(fmod); + return fmod(a, b); +} + +#if defined(__SYCL_DEVICE_ONLY__) +EIGEN_ALWAYS_INLINE float fmod(float x, float y) { return cl::sycl::fmod(x, y); } +EIGEN_ALWAYS_INLINE double fmod(double x, double y) { return cl::sycl::fmod(x, y); } +#endif // defined(__SYCL_DEVICE_ONLY__) + +#ifdef EIGEN_CUDACC +template <> +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +float fmod(const float& a, const float& b) { + return ::fmodf(a, b); +} + +template <> +EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE +double fmod(const double& a, const double& b) { + return ::fmod(a, b); +} +#endif + +} // end namespace numext + +namespace internal { + +template +EIGEN_DEVICE_FUNC bool isfinite_impl(const std::complex& x) +{ + return (numext::isfinite)(numext::real(x)) && (numext::isfinite)(numext::imag(x)); +} + +template +EIGEN_DEVICE_FUNC bool isnan_impl(const std::complex& x) +{ + return (numext::isnan)(numext::real(x)) || (numext::isnan)(numext::imag(x)); +} + +template +EIGEN_DEVICE_FUNC bool isinf_impl(const std::complex& x) +{ + return ((numext::isinf)(numext::real(x)) || (numext::isinf)(numext::imag(x))) && (!(numext::isnan)(x)); +} + +/**************************************************************************** +* Implementation of fuzzy comparisons * +****************************************************************************/ + +template +struct scalar_fuzzy_default_impl {}; + +template +struct scalar_fuzzy_default_impl +{ + typedef typename NumTraits::Real RealScalar; + template EIGEN_DEVICE_FUNC + static inline bool isMuchSmallerThan(const Scalar& x, const OtherScalar& y, const RealScalar& prec) + { + return numext::abs(x) <= numext::abs(y) * prec; + } + EIGEN_DEVICE_FUNC + static inline bool isApprox(const Scalar& x, const Scalar& y, const RealScalar& prec) + { + return numext::abs(x - y) <= numext::mini(numext::abs(x), numext::abs(y)) * prec; + } + EIGEN_DEVICE_FUNC + static inline bool isApproxOrLessThan(const Scalar& x, const Scalar& y, const RealScalar& prec) + { + return x <= y || isApprox(x, y, prec); + } +}; + +template +struct scalar_fuzzy_default_impl +{ + typedef typename NumTraits::Real RealScalar; + template EIGEN_DEVICE_FUNC + static inline bool isMuchSmallerThan(const Scalar& x, const Scalar&, const RealScalar&) + { + return x == Scalar(0); + } + EIGEN_DEVICE_FUNC + static inline bool isApprox(const Scalar& x, const Scalar& y, const RealScalar&) + { + return x == y; + } + EIGEN_DEVICE_FUNC + static inline bool isApproxOrLessThan(const Scalar& x, const Scalar& y, const RealScalar&) + { + return x <= y; + } +}; + +template +struct scalar_fuzzy_default_impl +{ + typedef typename NumTraits::Real RealScalar; + template EIGEN_DEVICE_FUNC + static inline bool isMuchSmallerThan(const Scalar& x, const OtherScalar& y, const RealScalar& prec) + { + return numext::abs2(x) <= numext::abs2(y) * prec * prec; + } + EIGEN_DEVICE_FUNC + static inline bool isApprox(const Scalar& x, const Scalar& y, const RealScalar& prec) + { + return numext::abs2(x - y) <= numext::mini(numext::abs2(x), numext::abs2(y)) * prec * prec; + } +}; + +template +struct scalar_fuzzy_impl : scalar_fuzzy_default_impl::IsComplex, NumTraits::IsInteger> {}; + +template EIGEN_DEVICE_FUNC +inline bool isMuchSmallerThan(const Scalar& x, const OtherScalar& y, + const typename NumTraits::Real &precision = NumTraits::dummy_precision()) +{ + return scalar_fuzzy_impl::template isMuchSmallerThan(x, y, precision); +} + +template EIGEN_DEVICE_FUNC +inline bool isApprox(const Scalar& x, const Scalar& y, + const typename NumTraits::Real &precision = NumTraits::dummy_precision()) +{ + return scalar_fuzzy_impl::isApprox(x, y, precision); +} + +template EIGEN_DEVICE_FUNC +inline bool isApproxOrLessThan(const Scalar& x, const Scalar& y, + const typename NumTraits::Real &precision = NumTraits::dummy_precision()) +{ + return scalar_fuzzy_impl::isApproxOrLessThan(x, y, precision); +} + +/****************************************** +*** The special case of the bool type *** +******************************************/ + +template<> struct random_impl +{ + static inline bool run() + { + return random(0,1)==0 ? false : true; + } +}; + +template<> struct scalar_fuzzy_impl +{ + typedef bool RealScalar; + + template EIGEN_DEVICE_FUNC + static inline bool isMuchSmallerThan(const bool& x, const bool&, const bool&) + { + return !x; + } + + EIGEN_DEVICE_FUNC + static inline bool isApprox(bool x, bool y, bool) + { + return x == y; + } + + EIGEN_DEVICE_FUNC + static inline bool isApproxOrLessThan(const bool& x, const bool& y, const bool&) + { + return (!x) || y; + } + +}; + + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_MATHFUNCTIONS_H diff --git a/Eigen/src/Core/MathFunctionsImpl.h b/Eigen/src/Core/MathFunctionsImpl.h new file mode 100644 index 000000000..ae1386b4c --- /dev/null +++ b/Eigen/src/Core/MathFunctionsImpl.h @@ -0,0 +1,73 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2014 Pedro Gonnet (pedro.gonnet@gmail.com) +// Copyright (C) 2016 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MATHFUNCTIONSIMPL_H +#define EIGEN_MATHFUNCTIONSIMPL_H + +namespace Eigen { + +namespace internal { + +/** \internal \returns the hyperbolic tan of \a a (coeff-wise) + Doesn't do anything fancy, just a 13/6-degree rational interpolant which + is accurate up to a couple of ulp in the range [-9, 9], outside of which + the tanh(x) = +/-1. + + This implementation works on both scalars and packets. +*/ +template +T generic_fast_tanh_float(const T& a_x) +{ + // Clamp the inputs to the range [-9, 9] since anything outside + // this range is +/-1.0f in single-precision. + const T plus_9 = pset1(9.f); + const T minus_9 = pset1(-9.f); + const T x = pmax(pmin(a_x, plus_9), minus_9); + // The monomial coefficients of the numerator polynomial (odd). + const T alpha_1 = pset1(4.89352455891786e-03f); + const T alpha_3 = pset1(6.37261928875436e-04f); + const T alpha_5 = pset1(1.48572235717979e-05f); + const T alpha_7 = pset1(5.12229709037114e-08f); + const T alpha_9 = pset1(-8.60467152213735e-11f); + const T alpha_11 = pset1(2.00018790482477e-13f); + const T alpha_13 = pset1(-2.76076847742355e-16f); + + // The monomial coefficients of the denominator polynomial (even). + const T beta_0 = pset1(4.89352518554385e-03f); + const T beta_2 = pset1(2.26843463243900e-03f); + const T beta_4 = pset1(1.18534705686654e-04f); + const T beta_6 = pset1(1.19825839466702e-06f); + + // Since the polynomials are odd/even, we need x^2. + const T x2 = pmul(x, x); + + // Evaluate the numerator polynomial p. + T p = pmadd(x2, alpha_13, alpha_11); + p = pmadd(x2, p, alpha_9); + p = pmadd(x2, p, alpha_7); + p = pmadd(x2, p, alpha_5); + p = pmadd(x2, p, alpha_3); + p = pmadd(x2, p, alpha_1); + p = pmul(x, p); + + // Evaluate the denominator polynomial p. + T q = pmadd(x2, beta_6, beta_4); + q = pmadd(x2, q, beta_2); + q = pmadd(x2, q, beta_0); + + // Divide the numerator by the denominator. + return pdiv(p, q); +} + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_MATHFUNCTIONSIMPL_H diff --git a/Eigen/src/Core/Matrix.h b/Eigen/src/Core/Matrix.h new file mode 100644 index 000000000..90c336d8c --- /dev/null +++ b/Eigen/src/Core/Matrix.h @@ -0,0 +1,461 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2010 Benoit Jacob +// Copyright (C) 2008-2009 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MATRIX_H +#define EIGEN_MATRIX_H + +namespace Eigen { + +namespace internal { +template +struct traits > +{ +private: + enum { size = internal::size_at_compile_time<_Rows,_Cols>::ret }; + typedef typename find_best_packet<_Scalar,size>::type PacketScalar; + enum { + row_major_bit = _Options&RowMajor ? RowMajorBit : 0, + is_dynamic_size_storage = _MaxRows==Dynamic || _MaxCols==Dynamic, + max_size = is_dynamic_size_storage ? Dynamic : _MaxRows*_MaxCols, + default_alignment = compute_default_alignment<_Scalar,max_size>::value, + actual_alignment = ((_Options&DontAlign)==0) ? default_alignment : 0, + required_alignment = unpacket_traits::alignment, + packet_access_bit = (packet_traits<_Scalar>::Vectorizable && (EIGEN_UNALIGNED_VECTORIZE || (actual_alignment>=required_alignment))) ? PacketAccessBit : 0 + }; + +public: + typedef _Scalar Scalar; + typedef Dense StorageKind; + typedef Eigen::Index StorageIndex; + typedef MatrixXpr XprKind; + enum { + RowsAtCompileTime = _Rows, + ColsAtCompileTime = _Cols, + MaxRowsAtCompileTime = _MaxRows, + MaxColsAtCompileTime = _MaxCols, + Flags = compute_matrix_flags<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::ret, + Options = _Options, + InnerStrideAtCompileTime = 1, + OuterStrideAtCompileTime = (Options&RowMajor) ? ColsAtCompileTime : RowsAtCompileTime, + + // FIXME, the following flag in only used to define NeedsToAlign in PlainObjectBase + EvaluatorFlags = LinearAccessBit | DirectAccessBit | packet_access_bit | row_major_bit, + Alignment = actual_alignment + }; +}; +} + +/** \class Matrix + * \ingroup Core_Module + * + * \brief The matrix class, also used for vectors and row-vectors + * + * The %Matrix class is the work-horse for all \em dense (\ref dense "note") matrices and vectors within Eigen. + * Vectors are matrices with one column, and row-vectors are matrices with one row. + * + * The %Matrix class encompasses \em both fixed-size and dynamic-size objects (\ref fixedsize "note"). + * + * The first three template parameters are required: + * \tparam _Scalar Numeric type, e.g. float, double, int or std::complex. + * User defined scalar types are supported as well (see \ref user_defined_scalars "here"). + * \tparam _Rows Number of rows, or \b Dynamic + * \tparam _Cols Number of columns, or \b Dynamic + * + * The remaining template parameters are optional -- in most cases you don't have to worry about them. + * \tparam _Options A combination of either \b #RowMajor or \b #ColMajor, and of either + * \b #AutoAlign or \b #DontAlign. + * The former controls \ref TopicStorageOrders "storage order", and defaults to column-major. The latter controls alignment, which is required + * for vectorization. It defaults to aligning matrices except for fixed sizes that aren't a multiple of the packet size. + * \tparam _MaxRows Maximum number of rows. Defaults to \a _Rows (\ref maxrows "note"). + * \tparam _MaxCols Maximum number of columns. Defaults to \a _Cols (\ref maxrows "note"). + * + * Eigen provides a number of typedefs covering the usual cases. Here are some examples: + * + * \li \c Matrix2d is a 2x2 square matrix of doubles (\c Matrix) + * \li \c Vector4f is a vector of 4 floats (\c Matrix) + * \li \c RowVector3i is a row-vector of 3 ints (\c Matrix) + * + * \li \c MatrixXf is a dynamic-size matrix of floats (\c Matrix) + * \li \c VectorXf is a dynamic-size vector of floats (\c Matrix) + * + * \li \c Matrix2Xf is a partially fixed-size (dynamic-size) matrix of floats (\c Matrix) + * \li \c MatrixX3d is a partially dynamic-size (fixed-size) matrix of double (\c Matrix) + * + * See \link matrixtypedefs this page \endlink for a complete list of predefined \em %Matrix and \em Vector typedefs. + * + * You can access elements of vectors and matrices using normal subscripting: + * + * \code + * Eigen::VectorXd v(10); + * v[0] = 0.1; + * v[1] = 0.2; + * v(0) = 0.3; + * v(1) = 0.4; + * + * Eigen::MatrixXi m(10, 10); + * m(0, 1) = 1; + * m(0, 2) = 2; + * m(0, 3) = 3; + * \endcode + * + * This class can be extended with the help of the plugin mechanism described on the page + * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_MATRIX_PLUGIN. + * + * Some notes: + * + *
+ *
\anchor dense Dense versus sparse:
+ *
This %Matrix class handles dense, not sparse matrices and vectors. For sparse matrices and vectors, see the Sparse module. + * + * Dense matrices and vectors are plain usual arrays of coefficients. All the coefficients are stored, in an ordinary contiguous array. + * This is unlike Sparse matrices and vectors where the coefficients are stored as a list of nonzero coefficients.
+ * + *
\anchor fixedsize Fixed-size versus dynamic-size:
+ *
Fixed-size means that the numbers of rows and columns are known are compile-time. In this case, Eigen allocates the array + * of coefficients as a fixed-size array, as a class member. This makes sense for very small matrices, typically up to 4x4, sometimes up + * to 16x16. Larger matrices should be declared as dynamic-size even if one happens to know their size at compile-time. + * + * Dynamic-size means that the numbers of rows or columns are not necessarily known at compile-time. In this case they are runtime + * variables, and the array of coefficients is allocated dynamically on the heap. + * + * Note that \em dense matrices, be they Fixed-size or Dynamic-size, do not expand dynamically in the sense of a std::map. + * If you want this behavior, see the Sparse module.
+ * + *
\anchor maxrows _MaxRows and _MaxCols:
+ *
In most cases, one just leaves these parameters to the default values. + * These parameters mean the maximum size of rows and columns that the matrix may have. They are useful in cases + * when the exact numbers of rows and columns are not known are compile-time, but it is known at compile-time that they cannot + * exceed a certain value. This happens when taking dynamic-size blocks inside fixed-size matrices: in this case _MaxRows and _MaxCols + * are the dimensions of the original matrix, while _Rows and _Cols are Dynamic.
+ *
+ * + * ABI and storage layout + * + * The table below summarizes the ABI of some possible Matrix instances which is fixed thorough the lifetime of Eigen 3. + * + * + * + * + * + * + *
Matrix typeEquivalent C structure
\code Matrix \endcode\code + * struct { + * T *data; // with (size_t(data)%EIGEN_MAX_ALIGN_BYTES)==0 + * Eigen::Index rows, cols; + * }; + * \endcode
\code + * Matrix + * Matrix \endcode\code + * struct { + * T *data; // with (size_t(data)%EIGEN_MAX_ALIGN_BYTES)==0 + * Eigen::Index size; + * }; + * \endcode
\code Matrix \endcode\code + * struct { + * T data[Rows*Cols]; // with (size_t(data)%A(Rows*Cols*sizeof(T)))==0 + * }; + * \endcode
\code Matrix \endcode\code + * struct { + * T data[MaxRows*MaxCols]; // with (size_t(data)%A(MaxRows*MaxCols*sizeof(T)))==0 + * Eigen::Index rows, cols; + * }; + * \endcode
+ * Note that in this table Rows, Cols, MaxRows and MaxCols are all positive integers. A(S) is defined to the largest possible power-of-two + * smaller to EIGEN_MAX_STATIC_ALIGN_BYTES. + * + * \see MatrixBase for the majority of the API methods for matrices, \ref TopicClassHierarchy, + * \ref TopicStorageOrders + */ + +template +class Matrix + : public PlainObjectBase > +{ + public: + + /** \brief Base class typedef. + * \sa PlainObjectBase + */ + typedef PlainObjectBase Base; + + enum { Options = _Options }; + + EIGEN_DENSE_PUBLIC_INTERFACE(Matrix) + + typedef typename Base::PlainObject PlainObject; + + using Base::base; + using Base::coeffRef; + + /** + * \brief Assigns matrices to each other. + * + * \note This is a special case of the templated operator=. Its purpose is + * to prevent a default operator= from hiding the templated operator=. + * + * \callgraph + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix& operator=(const Matrix& other) + { + return Base::_set(other); + } + + /** \internal + * \brief Copies the value of the expression \a other into \c *this with automatic resizing. + * + * *this might be resized to match the dimensions of \a other. If *this was a null matrix (not already initialized), + * it will be initialized. + * + * Note that copying a row-vector into a vector (and conversely) is allowed. + * The resizing, if any, is then done in the appropriate way so that row-vectors + * remain row-vectors and vectors remain vectors. + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix& operator=(const DenseBase& other) + { + return Base::_set(other); + } + + /* Here, doxygen failed to copy the brief information when using \copydoc */ + + /** + * \brief Copies the generic expression \a other into *this. + * \copydetails DenseBase::operator=(const EigenBase &other) + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix& operator=(const EigenBase &other) + { + return Base::operator=(other); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix& operator=(const ReturnByValue& func) + { + return Base::operator=(func); + } + + /** \brief Default constructor. + * + * For fixed-size matrices, does nothing. + * + * For dynamic-size matrices, creates an empty matrix of size 0. Does not allocate any array. Such a matrix + * is called a null matrix. This constructor is the unique way to create null matrices: resizing + * a matrix to 0 is not supported. + * + * \sa resize(Index,Index) + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix() : Base() + { + Base::_check_template_params(); + EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + } + + // FIXME is it still needed + EIGEN_DEVICE_FUNC + explicit Matrix(internal::constructor_without_unaligned_array_assert) + : Base(internal::constructor_without_unaligned_array_assert()) + { Base::_check_template_params(); EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED } + +#if EIGEN_HAS_RVALUE_REFERENCES + EIGEN_DEVICE_FUNC + Matrix(Matrix&& other) EIGEN_NOEXCEPT_IF(std::is_nothrow_move_constructible::value) + : Base(std::move(other)) + { + Base::_check_template_params(); + if (RowsAtCompileTime!=Dynamic && ColsAtCompileTime!=Dynamic) + Base::_set_noalias(other); + } + EIGEN_DEVICE_FUNC + Matrix& operator=(Matrix&& other) EIGEN_NOEXCEPT_IF(std::is_nothrow_move_assignable::value) + { + other.swap(*this); + return *this; + } +#endif + + #ifndef EIGEN_PARSED_BY_DOXYGEN + + // This constructor is for both 1x1 matrices and dynamic vectors + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE explicit Matrix(const T& x) + { + Base::_check_template_params(); + Base::template _init1(x); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix(const T0& x, const T1& y) + { + Base::_check_template_params(); + Base::template _init2(x, y); + } + #else + /** \brief Constructs a fixed-sized matrix initialized with coefficients starting at \a data */ + EIGEN_DEVICE_FUNC + explicit Matrix(const Scalar *data); + + /** \brief Constructs a vector or row-vector with given dimension. \only_for_vectors + * + * This is useful for dynamic-size vectors. For fixed-size vectors, + * it is redundant to pass these parameters, so one should use the default constructor + * Matrix() instead. + * + * \warning This constructor is disabled for fixed-size \c 1x1 matrices. For instance, + * calling Matrix(1) will call the initialization constructor: Matrix(const Scalar&). + * For fixed-size \c 1x1 matrices it is therefore recommended to use the default + * constructor Matrix() instead, especially when using one of the non standard + * \c EIGEN_INITIALIZE_MATRICES_BY_{ZERO,\c NAN} macros (see \ref TopicPreprocessorDirectives). + */ + EIGEN_STRONG_INLINE explicit Matrix(Index dim); + /** \brief Constructs an initialized 1x1 matrix with the given coefficient */ + Matrix(const Scalar& x); + /** \brief Constructs an uninitialized matrix with \a rows rows and \a cols columns. + * + * This is useful for dynamic-size matrices. For fixed-size matrices, + * it is redundant to pass these parameters, so one should use the default constructor + * Matrix() instead. + * + * \warning This constructor is disabled for fixed-size \c 1x2 and \c 2x1 vectors. For instance, + * calling Matrix2f(2,1) will call the initialization constructor: Matrix(const Scalar& x, const Scalar& y). + * For fixed-size \c 1x2 or \c 2x1 vectors it is therefore recommended to use the default + * constructor Matrix() instead, especially when using one of the non standard + * \c EIGEN_INITIALIZE_MATRICES_BY_{ZERO,\c NAN} macros (see \ref TopicPreprocessorDirectives). + */ + EIGEN_DEVICE_FUNC + Matrix(Index rows, Index cols); + + /** \brief Constructs an initialized 2D vector with given coefficients */ + Matrix(const Scalar& x, const Scalar& y); + #endif + + /** \brief Constructs an initialized 3D vector with given coefficients */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix(const Scalar& x, const Scalar& y, const Scalar& z) + { + Base::_check_template_params(); + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(Matrix, 3) + m_storage.data()[0] = x; + m_storage.data()[1] = y; + m_storage.data()[2] = z; + } + /** \brief Constructs an initialized 4D vector with given coefficients */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix(const Scalar& x, const Scalar& y, const Scalar& z, const Scalar& w) + { + Base::_check_template_params(); + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(Matrix, 4) + m_storage.data()[0] = x; + m_storage.data()[1] = y; + m_storage.data()[2] = z; + m_storage.data()[3] = w; + } + + + /** \brief Copy constructor */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix(const Matrix& other) : Base(other) + { } + + /** \brief Copy constructor for generic expressions. + * \sa MatrixBase::operator=(const EigenBase&) + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Matrix(const EigenBase &other) + : Base(other.derived()) + { } + + EIGEN_DEVICE_FUNC inline Index innerStride() const { return 1; } + EIGEN_DEVICE_FUNC inline Index outerStride() const { return this->innerSize(); } + + /////////// Geometry module /////////// + + template + EIGEN_DEVICE_FUNC + explicit Matrix(const RotationBase& r); + template + EIGEN_DEVICE_FUNC + Matrix& operator=(const RotationBase& r); + + // allow to extend Matrix outside Eigen + #ifdef EIGEN_MATRIX_PLUGIN + #include EIGEN_MATRIX_PLUGIN + #endif + + protected: + template + friend struct internal::conservative_resize_like_impl; + + using Base::m_storage; +}; + +/** \defgroup matrixtypedefs Global matrix typedefs + * + * \ingroup Core_Module + * + * Eigen defines several typedef shortcuts for most common matrix and vector types. + * + * The general patterns are the following: + * + * \c MatrixSizeType where \c Size can be \c 2,\c 3,\c 4 for fixed size square matrices or \c X for dynamic size, + * and where \c Type can be \c i for integer, \c f for float, \c d for double, \c cf for complex float, \c cd + * for complex double. + * + * For example, \c Matrix3d is a fixed-size 3x3 matrix type of doubles, and \c MatrixXf is a dynamic-size matrix of floats. + * + * There are also \c VectorSizeType and \c RowVectorSizeType which are self-explanatory. For example, \c Vector4cf is + * a fixed-size vector of 4 complex floats. + * + * \sa class Matrix + */ + +#define EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, Size, SizeSuffix) \ +/** \ingroup matrixtypedefs */ \ +typedef Matrix Matrix##SizeSuffix##TypeSuffix; \ +/** \ingroup matrixtypedefs */ \ +typedef Matrix Vector##SizeSuffix##TypeSuffix; \ +/** \ingroup matrixtypedefs */ \ +typedef Matrix RowVector##SizeSuffix##TypeSuffix; + +#define EIGEN_MAKE_FIXED_TYPEDEFS(Type, TypeSuffix, Size) \ +/** \ingroup matrixtypedefs */ \ +typedef Matrix Matrix##Size##X##TypeSuffix; \ +/** \ingroup matrixtypedefs */ \ +typedef Matrix Matrix##X##Size##TypeSuffix; + +#define EIGEN_MAKE_TYPEDEFS_ALL_SIZES(Type, TypeSuffix) \ +EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 2, 2) \ +EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 3, 3) \ +EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 4, 4) \ +EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, Dynamic, X) \ +EIGEN_MAKE_FIXED_TYPEDEFS(Type, TypeSuffix, 2) \ +EIGEN_MAKE_FIXED_TYPEDEFS(Type, TypeSuffix, 3) \ +EIGEN_MAKE_FIXED_TYPEDEFS(Type, TypeSuffix, 4) + +EIGEN_MAKE_TYPEDEFS_ALL_SIZES(int, i) +EIGEN_MAKE_TYPEDEFS_ALL_SIZES(float, f) +EIGEN_MAKE_TYPEDEFS_ALL_SIZES(double, d) +EIGEN_MAKE_TYPEDEFS_ALL_SIZES(std::complex, cf) +EIGEN_MAKE_TYPEDEFS_ALL_SIZES(std::complex, cd) + +#undef EIGEN_MAKE_TYPEDEFS_ALL_SIZES +#undef EIGEN_MAKE_TYPEDEFS +#undef EIGEN_MAKE_FIXED_TYPEDEFS + +} // end namespace Eigen + +#endif // EIGEN_MATRIX_H diff --git a/Eigen/src/Core/MatrixBase.h b/Eigen/src/Core/MatrixBase.h new file mode 100644 index 000000000..11435903b --- /dev/null +++ b/Eigen/src/Core/MatrixBase.h @@ -0,0 +1,525 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2009 Benoit Jacob +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_MATRIXBASE_H +#define EIGEN_MATRIXBASE_H + +namespace Eigen { + +/** \class MatrixBase + * \ingroup Core_Module + * + * \brief Base class for all dense matrices, vectors, and expressions + * + * This class is the base that is inherited by all matrix, vector, and related expression + * types. Most of the Eigen API is contained in this class, and its base classes. Other important + * classes for the Eigen API are Matrix, and VectorwiseOp. + * + * Note that some methods are defined in other modules such as the \ref LU_Module LU module + * for all functions related to matrix inversions. + * + * \tparam Derived is the derived type, e.g. a matrix type, or an expression, etc. + * + * When writing a function taking Eigen objects as argument, if you want your function + * to take as argument any matrix, vector, or expression, just let it take a + * MatrixBase argument. As an example, here is a function printFirstRow which, given + * a matrix, vector, or expression \a x, prints the first row of \a x. + * + * \code + template + void printFirstRow(const Eigen::MatrixBase& x) + { + cout << x.row(0) << endl; + } + * \endcode + * + * This class can be extended with the help of the plugin mechanism described on the page + * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_MATRIXBASE_PLUGIN. + * + * \sa \blank \ref TopicClassHierarchy + */ +template class MatrixBase + : public DenseBase +{ + public: +#ifndef EIGEN_PARSED_BY_DOXYGEN + typedef MatrixBase StorageBaseType; + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::StorageIndex StorageIndex; + typedef typename internal::traits::Scalar Scalar; + typedef typename internal::packet_traits::type PacketScalar; + typedef typename NumTraits::Real RealScalar; + + typedef DenseBase Base; + using Base::RowsAtCompileTime; + using Base::ColsAtCompileTime; + using Base::SizeAtCompileTime; + using Base::MaxRowsAtCompileTime; + using Base::MaxColsAtCompileTime; + using Base::MaxSizeAtCompileTime; + using Base::IsVectorAtCompileTime; + using Base::Flags; + + using Base::derived; + using Base::const_cast_derived; + using Base::rows; + using Base::cols; + using Base::size; + using Base::coeff; + using Base::coeffRef; + using Base::lazyAssign; + using Base::eval; + using Base::operator-; + using Base::operator+=; + using Base::operator-=; + using Base::operator*=; + using Base::operator/=; + + typedef typename Base::CoeffReturnType CoeffReturnType; + typedef typename Base::ConstTransposeReturnType ConstTransposeReturnType; + typedef typename Base::RowXpr RowXpr; + typedef typename Base::ColXpr ColXpr; +#endif // not EIGEN_PARSED_BY_DOXYGEN + + + +#ifndef EIGEN_PARSED_BY_DOXYGEN + /** type of the equivalent square matrix */ + typedef Matrix SquareMatrixType; +#endif // not EIGEN_PARSED_BY_DOXYGEN + + /** \returns the size of the main diagonal, which is min(rows(),cols()). + * \sa rows(), cols(), SizeAtCompileTime. */ + EIGEN_DEVICE_FUNC + inline Index diagonalSize() const { return (numext::mini)(rows(),cols()); } + + typedef typename Base::PlainObject PlainObject; + +#ifndef EIGEN_PARSED_BY_DOXYGEN + /** \internal Represents a matrix with all coefficients equal to one another*/ + typedef CwiseNullaryOp,PlainObject> ConstantReturnType; + /** \internal the return type of MatrixBase::adjoint() */ + typedef typename internal::conditional::IsComplex, + CwiseUnaryOp, ConstTransposeReturnType>, + ConstTransposeReturnType + >::type AdjointReturnType; + /** \internal Return type of eigenvalues() */ + typedef Matrix, internal::traits::ColsAtCompileTime, 1, ColMajor> EigenvaluesReturnType; + /** \internal the return type of identity */ + typedef CwiseNullaryOp,PlainObject> IdentityReturnType; + /** \internal the return type of unit vectors */ + typedef Block, SquareMatrixType>, + internal::traits::RowsAtCompileTime, + internal::traits::ColsAtCompileTime> BasisReturnType; +#endif // not EIGEN_PARSED_BY_DOXYGEN + +#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::MatrixBase +#define EIGEN_DOC_UNARY_ADDONS(X,Y) +# include "../plugins/CommonCwiseBinaryOps.h" +# include "../plugins/MatrixCwiseUnaryOps.h" +# include "../plugins/MatrixCwiseBinaryOps.h" +# ifdef EIGEN_MATRIXBASE_PLUGIN +# include EIGEN_MATRIXBASE_PLUGIN +# endif +#undef EIGEN_CURRENT_STORAGE_BASE_CLASS +#undef EIGEN_DOC_UNARY_ADDONS + + /** Special case of the template operator=, in order to prevent the compiler + * from generating a default operator= (issue hit with g++ 4.1) + */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator=(const MatrixBase& other); + + // We cannot inherit here via Base::operator= since it is causing + // trouble with MSVC. + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator=(const DenseBase& other); + + template + EIGEN_DEVICE_FUNC + Derived& operator=(const EigenBase& other); + + template + EIGEN_DEVICE_FUNC + Derived& operator=(const ReturnByValue& other); + + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator+=(const MatrixBase& other); + template + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + Derived& operator-=(const MatrixBase& other); + + template + EIGEN_DEVICE_FUNC + const Product + operator*(const MatrixBase &other) const; + + template + EIGEN_DEVICE_FUNC + const Product + lazyProduct(const MatrixBase &other) const; + + template + Derived& operator*=(const EigenBase& other); + + template + void applyOnTheLeft(const EigenBase& other); + + template + void applyOnTheRight(const EigenBase& other); + + template + EIGEN_DEVICE_FUNC + const Product + operator*(const DiagonalBase &diagonal) const; + + template + EIGEN_DEVICE_FUNC + typename ScalarBinaryOpTraits::Scalar,typename internal::traits::Scalar>::ReturnType + dot(const MatrixBase& other) const; + + EIGEN_DEVICE_FUNC RealScalar squaredNorm() const; + EIGEN_DEVICE_FUNC RealScalar norm() const; + RealScalar stableNorm() const; + RealScalar blueNorm() const; + RealScalar hypotNorm() const; + EIGEN_DEVICE_FUNC const PlainObject normalized() const; + EIGEN_DEVICE_FUNC const PlainObject stableNormalized() const; + EIGEN_DEVICE_FUNC void normalize(); + EIGEN_DEVICE_FUNC void stableNormalize(); + + EIGEN_DEVICE_FUNC const AdjointReturnType adjoint() const; + EIGEN_DEVICE_FUNC void adjointInPlace(); + + typedef Diagonal DiagonalReturnType; + EIGEN_DEVICE_FUNC + DiagonalReturnType diagonal(); + + typedef typename internal::add_const >::type ConstDiagonalReturnType; + EIGEN_DEVICE_FUNC + ConstDiagonalReturnType diagonal() const; + + template struct DiagonalIndexReturnType { typedef Diagonal Type; }; + template struct ConstDiagonalIndexReturnType { typedef const Diagonal Type; }; + + template + EIGEN_DEVICE_FUNC + typename DiagonalIndexReturnType::Type diagonal(); + + template + EIGEN_DEVICE_FUNC + typename ConstDiagonalIndexReturnType::Type diagonal() const; + + typedef Diagonal DiagonalDynamicIndexReturnType; + typedef typename internal::add_const >::type ConstDiagonalDynamicIndexReturnType; + + EIGEN_DEVICE_FUNC + DiagonalDynamicIndexReturnType diagonal(Index index); + EIGEN_DEVICE_FUNC + ConstDiagonalDynamicIndexReturnType diagonal(Index index) const; + + template struct TriangularViewReturnType { typedef TriangularView Type; }; + template struct ConstTriangularViewReturnType { typedef const TriangularView Type; }; + + template + EIGEN_DEVICE_FUNC + typename TriangularViewReturnType::Type triangularView(); + template + EIGEN_DEVICE_FUNC + typename ConstTriangularViewReturnType::Type triangularView() const; + + template struct SelfAdjointViewReturnType { typedef SelfAdjointView Type; }; + template struct ConstSelfAdjointViewReturnType { typedef const SelfAdjointView Type; }; + + template + EIGEN_DEVICE_FUNC + typename SelfAdjointViewReturnType::Type selfadjointView(); + template + EIGEN_DEVICE_FUNC + typename ConstSelfAdjointViewReturnType::Type selfadjointView() const; + + const SparseView sparseView(const Scalar& m_reference = Scalar(0), + const typename NumTraits::Real& m_epsilon = NumTraits::dummy_precision()) const; + EIGEN_DEVICE_FUNC static const IdentityReturnType Identity(); + EIGEN_DEVICE_FUNC static const IdentityReturnType Identity(Index rows, Index cols); + EIGEN_DEVICE_FUNC static const BasisReturnType Unit(Index size, Index i); + EIGEN_DEVICE_FUNC static const BasisReturnType Unit(Index i); + EIGEN_DEVICE_FUNC static const BasisReturnType UnitX(); + EIGEN_DEVICE_FUNC static const BasisReturnType UnitY(); + EIGEN_DEVICE_FUNC static const BasisReturnType UnitZ(); + EIGEN_DEVICE_FUNC static const BasisReturnType UnitW(); + + EIGEN_DEVICE_FUNC + const DiagonalWrapper asDiagonal() const; + const PermutationWrapper asPermutation() const; + + EIGEN_DEVICE_FUNC + Derived& setIdentity(); + EIGEN_DEVICE_FUNC + Derived& setIdentity(Index rows, Index cols); + EIGEN_DEVICE_FUNC Derived& setUnit(Index i); + EIGEN_DEVICE_FUNC Derived& setUnit(Index newSize, Index i); + + bool isIdentity(const RealScalar& prec = NumTraits::dummy_precision()) const; + bool isDiagonal(const RealScalar& prec = NumTraits::dummy_precision()) const; + + bool isUpperTriangular(const RealScalar& prec = NumTraits::dummy_precision()) const; + bool isLowerTriangular(const RealScalar& prec = NumTraits::dummy_precision()) const; + + template + bool isOrthogonal(const MatrixBase& other, + const RealScalar& prec = NumTraits::dummy_precision()) const; + bool isUnitary(const RealScalar& prec = NumTraits::dummy_precision()) const; + + /** \returns true if each coefficients of \c *this and \a other are all exactly equal. + * \warning When using floating point scalar values you probably should rather use a + * fuzzy comparison such as isApprox() + * \sa isApprox(), operator!= */ + template + EIGEN_DEVICE_FUNC inline bool operator==(const MatrixBase& other) const + { return cwiseEqual(other).all(); } + + /** \returns true if at least one pair of coefficients of \c *this and \a other are not exactly equal to each other. + * \warning When using floating point scalar values you probably should rather use a + * fuzzy comparison such as isApprox() + * \sa isApprox(), operator== */ + template + EIGEN_DEVICE_FUNC inline bool operator!=(const MatrixBase& other) const + { return cwiseNotEqual(other).any(); } + + NoAlias EIGEN_DEVICE_FUNC noalias(); + + // TODO forceAlignedAccess is temporarily disabled + // Need to find a nicer workaround. + inline const Derived& forceAlignedAccess() const { return derived(); } + inline Derived& forceAlignedAccess() { return derived(); } + template inline const Derived& forceAlignedAccessIf() const { return derived(); } + template inline Derived& forceAlignedAccessIf() { return derived(); } + + EIGEN_DEVICE_FUNC Scalar trace() const; + + template EIGEN_DEVICE_FUNC RealScalar lpNorm() const; + + EIGEN_DEVICE_FUNC MatrixBase& matrix() { return *this; } + EIGEN_DEVICE_FUNC const MatrixBase& matrix() const { return *this; } + + /** \returns an \link Eigen::ArrayBase Array \endlink expression of this matrix + * \sa ArrayBase::matrix() */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE ArrayWrapper array() { return ArrayWrapper(derived()); } + /** \returns a const \link Eigen::ArrayBase Array \endlink expression of this matrix + * \sa ArrayBase::matrix() */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const ArrayWrapper array() const { return ArrayWrapper(derived()); } + +/////////// LU module /////////// + + inline const FullPivLU fullPivLu() const; + inline const PartialPivLU partialPivLu() const; + + inline const PartialPivLU lu() const; + + inline const Inverse inverse() const; + + template + inline void computeInverseAndDetWithCheck( + ResultType& inverse, + typename ResultType::Scalar& determinant, + bool& invertible, + const RealScalar& absDeterminantThreshold = NumTraits::dummy_precision() + ) const; + template + inline void computeInverseWithCheck( + ResultType& inverse, + bool& invertible, + const RealScalar& absDeterminantThreshold = NumTraits::dummy_precision() + ) const; + Scalar determinant() const; + +/////////// Cholesky module /////////// + + inline const LLT llt() const; + inline const LDLT ldlt() const; + +/////////// QR module /////////// + + inline const HouseholderQR householderQr() const; + inline const ColPivHouseholderQR colPivHouseholderQr() const; + inline const FullPivHouseholderQR fullPivHouseholderQr() const; + inline const CompleteOrthogonalDecomposition completeOrthogonalDecomposition() const; + +/////////// Eigenvalues module /////////// + + inline EigenvaluesReturnType eigenvalues() const; + inline RealScalar operatorNorm() const; + +/////////// SVD module /////////// + + inline JacobiSVD jacobiSvd(unsigned int computationOptions = 0) const; + inline BDCSVD bdcSvd(unsigned int computationOptions = 0) const; + +/////////// Geometry module /////////// + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /// \internal helper struct to form the return type of the cross product + template struct cross_product_return_type { + typedef typename ScalarBinaryOpTraits::Scalar,typename internal::traits::Scalar>::ReturnType Scalar; + typedef Matrix type; + }; + #endif // EIGEN_PARSED_BY_DOXYGEN + template + EIGEN_DEVICE_FUNC +#ifndef EIGEN_PARSED_BY_DOXYGEN + inline typename cross_product_return_type::type +#else + inline PlainObject +#endif + cross(const MatrixBase& other) const; + + template + EIGEN_DEVICE_FUNC + inline PlainObject cross3(const MatrixBase& other) const; + + EIGEN_DEVICE_FUNC + inline PlainObject unitOrthogonal(void) const; + + EIGEN_DEVICE_FUNC + inline Matrix eulerAngles(Index a0, Index a1, Index a2) const; + + // put this as separate enum value to work around possible GCC 4.3 bug (?) + enum { HomogeneousReturnTypeDirection = ColsAtCompileTime==1&&RowsAtCompileTime==1 ? ((internal::traits::Flags&RowMajorBit)==RowMajorBit ? Horizontal : Vertical) + : ColsAtCompileTime==1 ? Vertical : Horizontal }; + typedef Homogeneous HomogeneousReturnType; + EIGEN_DEVICE_FUNC + inline HomogeneousReturnType homogeneous() const; + + enum { + SizeMinusOne = SizeAtCompileTime==Dynamic ? Dynamic : SizeAtCompileTime-1 + }; + typedef Block::ColsAtCompileTime==1 ? SizeMinusOne : 1, + internal::traits::ColsAtCompileTime==1 ? 1 : SizeMinusOne> ConstStartMinusOne; + typedef EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(ConstStartMinusOne,Scalar,quotient) HNormalizedReturnType; + EIGEN_DEVICE_FUNC + inline const HNormalizedReturnType hnormalized() const; + +////////// Householder module /////////// + + void makeHouseholderInPlace(Scalar& tau, RealScalar& beta); + template + void makeHouseholder(EssentialPart& essential, + Scalar& tau, RealScalar& beta) const; + template + void applyHouseholderOnTheLeft(const EssentialPart& essential, + const Scalar& tau, + Scalar* workspace); + template + void applyHouseholderOnTheRight(const EssentialPart& essential, + const Scalar& tau, + Scalar* workspace); + +///////// Jacobi module ///////// + + template + EIGEN_DEVICE_FUNC + void applyOnTheLeft(Index p, Index q, const JacobiRotation& j); + template + EIGEN_DEVICE_FUNC + void applyOnTheRight(Index p, Index q, const JacobiRotation& j); + +///////// SparseCore module ///////// + + template + EIGEN_STRONG_INLINE const typename SparseMatrixBase::template CwiseProductDenseReturnType::Type + cwiseProduct(const SparseMatrixBase &other) const + { + return other.cwiseProduct(derived()); + } + +///////// MatrixFunctions module ///////// + + typedef typename internal::stem_function::type StemFunction; + const MatrixExponentialReturnValue exp() const; + const MatrixFunctionReturnValue matrixFunction(StemFunction f) const; + const MatrixFunctionReturnValue cosh() const; + const MatrixFunctionReturnValue sinh() const; + const MatrixFunctionReturnValue cos() const; + const MatrixFunctionReturnValue sin() const; + const MatrixSquareRootReturnValue sqrt() const; + const MatrixLogarithmReturnValue log() const; + const MatrixPowerReturnValue pow(const RealScalar& p) const; + const MatrixComplexPowerReturnValue pow(const std::complex& p) const; + + protected: + EIGEN_DEVICE_FUNC MatrixBase() : Base() {} + + private: + EIGEN_DEVICE_FUNC explicit MatrixBase(int); + EIGEN_DEVICE_FUNC MatrixBase(int,int); + template EIGEN_DEVICE_FUNC explicit MatrixBase(const MatrixBase&); + protected: + // mixing arrays and matrices is not legal + template Derived& operator+=(const ArrayBase& ) + {EIGEN_STATIC_ASSERT(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1,YOU_CANNOT_MIX_ARRAYS_AND_MATRICES); return *this;} + // mixing arrays and matrices is not legal + template Derived& operator-=(const ArrayBase& ) + {EIGEN_STATIC_ASSERT(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1,YOU_CANNOT_MIX_ARRAYS_AND_MATRICES); return *this;} +}; + + +/*************************************************************************** +* Implementation of matrix base methods +***************************************************************************/ + +/** replaces \c *this by \c *this * \a other. + * + * \returns a reference to \c *this + * + * Example: \include MatrixBase_applyOnTheRight.cpp + * Output: \verbinclude MatrixBase_applyOnTheRight.out + */ +template +template +inline Derived& +MatrixBase::operator*=(const EigenBase &other) +{ + other.derived().applyThisOnTheRight(derived()); + return derived(); +} + +/** replaces \c *this by \c *this * \a other. It is equivalent to MatrixBase::operator*=(). + * + * Example: \include MatrixBase_applyOnTheRight.cpp + * Output: \verbinclude MatrixBase_applyOnTheRight.out + */ +template +template +inline void MatrixBase::applyOnTheRight(const EigenBase &other) +{ + other.derived().applyThisOnTheRight(derived()); +} + +/** replaces \c *this by \a other * \c *this. + * + * Example: \include MatrixBase_applyOnTheLeft.cpp + * Output: \verbinclude MatrixBase_applyOnTheLeft.out + */ +template +template +inline void MatrixBase::applyOnTheLeft(const EigenBase &other) +{ + other.derived().applyThisOnTheLeft(derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_MATRIXBASE_H diff --git a/Eigen/src/Core/NestByValue.h b/Eigen/src/Core/NestByValue.h new file mode 100644 index 000000000..01cf192e9 --- /dev/null +++ b/Eigen/src/Core/NestByValue.h @@ -0,0 +1,110 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_NESTBYVALUE_H +#define EIGEN_NESTBYVALUE_H + +namespace Eigen { + +namespace internal { +template +struct traits > : public traits +{}; +} + +/** \class NestByValue + * \ingroup Core_Module + * + * \brief Expression which must be nested by value + * + * \tparam ExpressionType the type of the object of which we are requiring nesting-by-value + * + * This class is the return type of MatrixBase::nestByValue() + * and most of the time this is the only way it is used. + * + * \sa MatrixBase::nestByValue() + */ +template class NestByValue + : public internal::dense_xpr_base< NestByValue >::type +{ + public: + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(NestByValue) + + EIGEN_DEVICE_FUNC explicit inline NestByValue(const ExpressionType& matrix) : m_expression(matrix) {} + + EIGEN_DEVICE_FUNC inline Index rows() const { return m_expression.rows(); } + EIGEN_DEVICE_FUNC inline Index cols() const { return m_expression.cols(); } + EIGEN_DEVICE_FUNC inline Index outerStride() const { return m_expression.outerStride(); } + EIGEN_DEVICE_FUNC inline Index innerStride() const { return m_expression.innerStride(); } + + EIGEN_DEVICE_FUNC inline const CoeffReturnType coeff(Index row, Index col) const + { + return m_expression.coeff(row, col); + } + + EIGEN_DEVICE_FUNC inline Scalar& coeffRef(Index row, Index col) + { + return m_expression.const_cast_derived().coeffRef(row, col); + } + + EIGEN_DEVICE_FUNC inline const CoeffReturnType coeff(Index index) const + { + return m_expression.coeff(index); + } + + EIGEN_DEVICE_FUNC inline Scalar& coeffRef(Index index) + { + return m_expression.const_cast_derived().coeffRef(index); + } + + template + EIGEN_DEVICE_FUNC inline const PacketScalar packet(Index row, Index col) const + { + return m_expression.template packet(row, col); + } + + template + EIGEN_DEVICE_FUNC inline void writePacket(Index row, Index col, const PacketScalar& x) + { + m_expression.const_cast_derived().template writePacket(row, col, x); + } + + template + EIGEN_DEVICE_FUNC inline const PacketScalar packet(Index index) const + { + return m_expression.template packet(index); + } + + template + EIGEN_DEVICE_FUNC inline void writePacket(Index index, const PacketScalar& x) + { + m_expression.const_cast_derived().template writePacket(index, x); + } + + EIGEN_DEVICE_FUNC operator const ExpressionType&() const { return m_expression; } + + protected: + const ExpressionType m_expression; +}; + +/** \returns an expression of the temporary version of *this. + */ +template +EIGEN_DEVICE_FUNC inline const NestByValue +DenseBase::nestByValue() const +{ + return NestByValue(derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_NESTBYVALUE_H diff --git a/Eigen/src/Core/NoAlias.h b/Eigen/src/Core/NoAlias.h new file mode 100644 index 000000000..e94c8ee96 --- /dev/null +++ b/Eigen/src/Core/NoAlias.h @@ -0,0 +1,109 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_NOALIAS_H +#define EIGEN_NOALIAS_H + +namespace Eigen { + +/** \class NoAlias + * \ingroup Core_Module + * + * \brief Pseudo expression providing an operator = assuming no aliasing + * + * \tparam ExpressionType the type of the object on which to do the lazy assignment + * + * This class represents an expression with special assignment operators + * assuming no aliasing between the target expression and the source expression. + * More precisely it alloas to bypass the EvalBeforeAssignBit flag of the source expression. + * It is the return type of MatrixBase::noalias() + * and most of the time this is the only way it is used. + * + * \sa MatrixBase::noalias() + */ +template class StorageBase> +class NoAlias +{ + public: + typedef typename ExpressionType::Scalar Scalar; + + EIGEN_DEVICE_FUNC + explicit NoAlias(ExpressionType& expression) : m_expression(expression) {} + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE ExpressionType& operator=(const StorageBase& other) + { + call_assignment_no_alias(m_expression, other.derived(), internal::assign_op()); + return m_expression; + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE ExpressionType& operator+=(const StorageBase& other) + { + call_assignment_no_alias(m_expression, other.derived(), internal::add_assign_op()); + return m_expression; + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE ExpressionType& operator-=(const StorageBase& other) + { + call_assignment_no_alias(m_expression, other.derived(), internal::sub_assign_op()); + return m_expression; + } + + EIGEN_DEVICE_FUNC + ExpressionType& expression() const + { + return m_expression; + } + + protected: + ExpressionType& m_expression; +}; + +/** \returns a pseudo expression of \c *this with an operator= assuming + * no aliasing between \c *this and the source expression. + * + * More precisely, noalias() allows to bypass the EvalBeforeAssignBit flag. + * Currently, even though several expressions may alias, only product + * expressions have this flag. Therefore, noalias() is only usefull when + * the source expression contains a matrix product. + * + * Here are some examples where noalias is usefull: + * \code + * D.noalias() = A * B; + * D.noalias() += A.transpose() * B; + * D.noalias() -= 2 * A * B.adjoint(); + * \endcode + * + * On the other hand the following example will lead to a \b wrong result: + * \code + * A.noalias() = A * B; + * \endcode + * because the result matrix A is also an operand of the matrix product. Therefore, + * there is no alternative than evaluating A * B in a temporary, that is the default + * behavior when you write: + * \code + * A = A * B; + * \endcode + * + * \sa class NoAlias + */ +template +NoAlias EIGEN_DEVICE_FUNC MatrixBase::noalias() +{ + return NoAlias(derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_NOALIAS_H diff --git a/Eigen/src/Core/NumTraits.h b/Eigen/src/Core/NumTraits.h new file mode 100644 index 000000000..5567d4c90 --- /dev/null +++ b/Eigen/src/Core/NumTraits.h @@ -0,0 +1,282 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_NUMTRAITS_H +#define EIGEN_NUMTRAITS_H + +namespace Eigen { + +namespace internal { + +// default implementation of digits10(), based on numeric_limits if specialized, +// 0 for integer types, and log10(epsilon()) otherwise. +template< typename T, + bool use_numeric_limits = std::numeric_limits::is_specialized, + bool is_integer = NumTraits::IsInteger> +struct default_digits10_impl +{ + static int run() { return std::numeric_limits::digits10; } +}; + +template +struct default_digits10_impl // Floating point +{ + static int run() { + using std::log10; + using std::ceil; + typedef typename NumTraits::Real Real; + return int(ceil(-log10(NumTraits::epsilon()))); + } +}; + +template +struct default_digits10_impl // Integer +{ + static int run() { return 0; } +}; + + +// default implementation of digits(), based on numeric_limits if specialized, +// 0 for integer types, and log2(epsilon()) otherwise. +template< typename T, + bool use_numeric_limits = std::numeric_limits::is_specialized, + bool is_integer = NumTraits::IsInteger> +struct default_digits_impl +{ + static int run() { return std::numeric_limits::digits; } +}; + +template +struct default_digits_impl // Floating point +{ + static int run() { + using std::log; + using std::ceil; + typedef typename NumTraits::Real Real; + return int(ceil(-log(NumTraits::epsilon())/log(static_cast(2)))); + } +}; + +template +struct default_digits_impl // Integer +{ + static int run() { return 0; } +}; + +} // end namespace internal + +/** \class NumTraits + * \ingroup Core_Module + * + * \brief Holds information about the various numeric (i.e. scalar) types allowed by Eigen. + * + * \tparam T the numeric type at hand + * + * This class stores enums, typedefs and static methods giving information about a numeric type. + * + * The provided data consists of: + * \li A typedef \c Real, giving the "real part" type of \a T. If \a T is already real, + * then \c Real is just a typedef to \a T. If \a T is \c std::complex then \c Real + * is a typedef to \a U. + * \li A typedef \c NonInteger, giving the type that should be used for operations producing non-integral values, + * such as quotients, square roots, etc. If \a T is a floating-point type, then this typedef just gives + * \a T again. Note however that many Eigen functions such as internal::sqrt simply refuse to + * take integers. Outside of a few cases, Eigen doesn't do automatic type promotion. Thus, this typedef is + * only intended as a helper for code that needs to explicitly promote types. + * \li A typedef \c Literal giving the type to use for numeric literals such as "2" or "0.5". For instance, for \c std::complex, Literal is defined as \c U. + * Of course, this type must be fully compatible with \a T. In doubt, just use \a T here. + * \li A typedef \a Nested giving the type to use to nest a value inside of the expression tree. If you don't know what + * this means, just use \a T here. + * \li An enum value \a IsComplex. It is equal to 1 if \a T is a \c std::complex + * type, and to 0 otherwise. + * \li An enum value \a IsInteger. It is equal to \c 1 if \a T is an integer type such as \c int, + * and to \c 0 otherwise. + * \li Enum values ReadCost, AddCost and MulCost representing a rough estimate of the number of CPU cycles needed + * to by move / add / mul instructions respectively, assuming the data is already stored in CPU registers. + * Stay vague here. No need to do architecture-specific stuff. If you don't know what this means, just use \c Eigen::HugeCost. + * \li An enum value \a IsSigned. It is equal to \c 1 if \a T is a signed type and to 0 if \a T is unsigned. + * \li An enum value \a RequireInitialization. It is equal to \c 1 if the constructor of the numeric type \a T must + * be called, and to 0 if it is safe not to call it. Default is 0 if \a T is an arithmetic type, and 1 otherwise. + * \li An epsilon() function which, unlike std::numeric_limits::epsilon(), + * it returns a \a Real instead of a \a T. + * \li A dummy_precision() function returning a weak epsilon value. It is mainly used as a default + * value by the fuzzy comparison operators. + * \li highest() and lowest() functions returning the highest and lowest possible values respectively. + * \li digits10() function returning the number of decimal digits that can be represented without change. This is + * the analogue of std::numeric_limits::digits10 + * which is used as the default implementation if specialized. + */ + +template struct GenericNumTraits +{ + enum { + IsInteger = std::numeric_limits::is_integer, + IsSigned = std::numeric_limits::is_signed, + IsComplex = 0, + RequireInitialization = internal::is_arithmetic::value ? 0 : 1, + ReadCost = 1, + AddCost = 1, + MulCost = 1 + }; + + typedef T Real; + typedef typename internal::conditional< + IsInteger, + typename internal::conditional::type, + T + >::type NonInteger; + typedef T Nested; + typedef T Literal; + + EIGEN_DEVICE_FUNC + static inline Real epsilon() + { + return numext::numeric_limits::epsilon(); + } + + EIGEN_DEVICE_FUNC + static inline int digits10() + { + return internal::default_digits10_impl::run(); + } + + EIGEN_DEVICE_FUNC + static inline int digits() + { + return internal::default_digits_impl::run(); + } + + EIGEN_DEVICE_FUNC + static inline Real dummy_precision() + { + // make sure to override this for floating-point types + return Real(0); + } + + + EIGEN_DEVICE_FUNC + static inline T highest() { + return (numext::numeric_limits::max)(); + } + + EIGEN_DEVICE_FUNC + static inline T lowest() { + return IsInteger ? (numext::numeric_limits::min)() : (-(numext::numeric_limits::max)()); + } + + EIGEN_DEVICE_FUNC + static inline T infinity() { + return numext::numeric_limits::infinity(); + } + + EIGEN_DEVICE_FUNC + static inline T quiet_NaN() { + return numext::numeric_limits::quiet_NaN(); + } +}; + +template struct NumTraits : GenericNumTraits +{}; + +template<> struct NumTraits + : GenericNumTraits +{ + EIGEN_DEVICE_FUNC + static inline float dummy_precision() { return 1e-5f; } +}; + +template<> struct NumTraits : GenericNumTraits +{ + EIGEN_DEVICE_FUNC + static inline double dummy_precision() { return 1e-12; } +}; + +template<> struct NumTraits + : GenericNumTraits +{ + static inline long double dummy_precision() { return 1e-15l; } +}; + +template struct NumTraits > + : GenericNumTraits > +{ + typedef _Real Real; + typedef typename NumTraits<_Real>::Literal Literal; + enum { + IsComplex = 1, + RequireInitialization = NumTraits<_Real>::RequireInitialization, + ReadCost = 2 * NumTraits<_Real>::ReadCost, + AddCost = 2 * NumTraits::AddCost, + MulCost = 4 * NumTraits::MulCost + 2 * NumTraits::AddCost + }; + + EIGEN_DEVICE_FUNC + static inline Real epsilon() { return NumTraits::epsilon(); } + EIGEN_DEVICE_FUNC + static inline Real dummy_precision() { return NumTraits::dummy_precision(); } + EIGEN_DEVICE_FUNC + static inline int digits10() { return NumTraits::digits10(); } +}; + +template +struct NumTraits > +{ + typedef Array ArrayType; + typedef typename NumTraits::Real RealScalar; + typedef Array Real; + typedef typename NumTraits::NonInteger NonIntegerScalar; + typedef Array NonInteger; + typedef ArrayType & Nested; + typedef typename NumTraits::Literal Literal; + + enum { + IsComplex = NumTraits::IsComplex, + IsInteger = NumTraits::IsInteger, + IsSigned = NumTraits::IsSigned, + RequireInitialization = 1, + ReadCost = ArrayType::SizeAtCompileTime==Dynamic ? HugeCost : ArrayType::SizeAtCompileTime * NumTraits::ReadCost, + AddCost = ArrayType::SizeAtCompileTime==Dynamic ? HugeCost : ArrayType::SizeAtCompileTime * NumTraits::AddCost, + MulCost = ArrayType::SizeAtCompileTime==Dynamic ? HugeCost : ArrayType::SizeAtCompileTime * NumTraits::MulCost + }; + + EIGEN_DEVICE_FUNC + static inline RealScalar epsilon() { return NumTraits::epsilon(); } + EIGEN_DEVICE_FUNC + static inline RealScalar dummy_precision() { return NumTraits::dummy_precision(); } + + static inline int digits10() { return NumTraits::digits10(); } +}; + +template<> struct NumTraits + : GenericNumTraits +{ + enum { + RequireInitialization = 1, + ReadCost = HugeCost, + AddCost = HugeCost, + MulCost = HugeCost + }; + + static inline int digits10() { return 0; } + +private: + static inline std::string epsilon(); + static inline std::string dummy_precision(); + static inline std::string lowest(); + static inline std::string highest(); + static inline std::string infinity(); + static inline std::string quiet_NaN(); +}; + +// Empty specialization for void to allow template specialization based on NumTraits::Real with T==void and SFINAE. +template<> struct NumTraits {}; + +} // end namespace Eigen + +#endif // EIGEN_NUMTRAITS_H diff --git a/Eigen/src/Core/PermutationMatrix.h b/Eigen/src/Core/PermutationMatrix.h new file mode 100644 index 000000000..b1fb455b9 --- /dev/null +++ b/Eigen/src/Core/PermutationMatrix.h @@ -0,0 +1,633 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009 Benoit Jacob +// Copyright (C) 2009-2015 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_PERMUTATIONMATRIX_H +#define EIGEN_PERMUTATIONMATRIX_H + +namespace Eigen { + +namespace internal { + +enum PermPermProduct_t {PermPermProduct}; + +} // end namespace internal + +/** \class PermutationBase + * \ingroup Core_Module + * + * \brief Base class for permutations + * + * \tparam Derived the derived class + * + * This class is the base class for all expressions representing a permutation matrix, + * internally stored as a vector of integers. + * The convention followed here is that if \f$ \sigma \f$ is a permutation, the corresponding permutation matrix + * \f$ P_\sigma \f$ is such that if \f$ (e_1,\ldots,e_p) \f$ is the canonical basis, we have: + * \f[ P_\sigma(e_i) = e_{\sigma(i)}. \f] + * This convention ensures that for any two permutations \f$ \sigma, \tau \f$, we have: + * \f[ P_{\sigma\circ\tau} = P_\sigma P_\tau. \f] + * + * Permutation matrices are square and invertible. + * + * Notice that in addition to the member functions and operators listed here, there also are non-member + * operator* to multiply any kind of permutation object with any kind of matrix expression (MatrixBase) + * on either side. + * + * \sa class PermutationMatrix, class PermutationWrapper + */ +template +class PermutationBase : public EigenBase +{ + typedef internal::traits Traits; + typedef EigenBase Base; + public: + + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename Traits::IndicesType IndicesType; + enum { + Flags = Traits::Flags, + RowsAtCompileTime = Traits::RowsAtCompileTime, + ColsAtCompileTime = Traits::ColsAtCompileTime, + MaxRowsAtCompileTime = Traits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = Traits::MaxColsAtCompileTime + }; + typedef typename Traits::StorageIndex StorageIndex; + typedef Matrix + DenseMatrixType; + typedef PermutationMatrix + PlainPermutationType; + typedef PlainPermutationType PlainObject; + using Base::derived; + typedef Inverse InverseReturnType; + typedef void Scalar; + #endif + + /** Copies the other permutation into *this */ + template + Derived& operator=(const PermutationBase& other) + { + indices() = other.indices(); + return derived(); + } + + /** Assignment from the Transpositions \a tr */ + template + Derived& operator=(const TranspositionsBase& tr) + { + setIdentity(tr.size()); + for(Index k=size()-1; k>=0; --k) + applyTranspositionOnTheRight(k,tr.coeff(k)); + return derived(); + } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** This is a special case of the templated operator=. Its purpose is to + * prevent a default operator= from hiding the templated operator=. + */ + Derived& operator=(const PermutationBase& other) + { + indices() = other.indices(); + return derived(); + } + #endif + + /** \returns the number of rows */ + inline Index rows() const { return Index(indices().size()); } + + /** \returns the number of columns */ + inline Index cols() const { return Index(indices().size()); } + + /** \returns the size of a side of the respective square matrix, i.e., the number of indices */ + inline Index size() const { return Index(indices().size()); } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + template + void evalTo(MatrixBase& other) const + { + other.setZero(); + for (Index i=0; i=0 && j>=0 && i=0 && j>=0 && i + void assignTranspose(const PermutationBase& other) + { + for (Index i=0; i + void assignProduct(const Lhs& lhs, const Rhs& rhs) + { + eigen_assert(lhs.cols() == rhs.rows()); + for (Index i=0; i + inline PlainPermutationType operator*(const PermutationBase& other) const + { return PlainPermutationType(internal::PermPermProduct, derived(), other.derived()); } + + /** \returns the product of a permutation with another inverse permutation. + * + * \note \blank \note_try_to_help_rvo + */ + template + inline PlainPermutationType operator*(const InverseImpl& other) const + { return PlainPermutationType(internal::PermPermProduct, *this, other.eval()); } + + /** \returns the product of an inverse permutation with another permutation. + * + * \note \blank \note_try_to_help_rvo + */ + template friend + inline PlainPermutationType operator*(const InverseImpl& other, const PermutationBase& perm) + { return PlainPermutationType(internal::PermPermProduct, other.eval(), perm); } + + /** \returns the determinant of the permutation matrix, which is either 1 or -1 depending on the parity of the permutation. + * + * This function is O(\c n) procedure allocating a buffer of \c n booleans. + */ + Index determinant() const + { + Index res = 1; + Index n = size(); + Matrix mask(n); + mask.fill(false); + Index r = 0; + while(r < n) + { + // search for the next seed + while(r=n) + break; + // we got one, let's follow it until we are back to the seed + Index k0 = r++; + mask.coeffRef(k0) = true; + for(Index k=indices().coeff(k0); k!=k0; k=indices().coeff(k)) + { + mask.coeffRef(k) = true; + res = -res; + } + } + return res; + } + + protected: + +}; + +namespace internal { +template +struct traits > + : traits > +{ + typedef PermutationStorage StorageKind; + typedef Matrix<_StorageIndex, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1> IndicesType; + typedef _StorageIndex StorageIndex; + typedef void Scalar; +}; +} + +/** \class PermutationMatrix + * \ingroup Core_Module + * + * \brief Permutation matrix + * + * \tparam SizeAtCompileTime the number of rows/cols, or Dynamic + * \tparam MaxSizeAtCompileTime the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it. + * \tparam _StorageIndex the integer type of the indices + * + * This class represents a permutation matrix, internally stored as a vector of integers. + * + * \sa class PermutationBase, class PermutationWrapper, class DiagonalMatrix + */ +template +class PermutationMatrix : public PermutationBase > +{ + typedef PermutationBase Base; + typedef internal::traits Traits; + public: + + typedef const PermutationMatrix& Nested; + + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename Traits::IndicesType IndicesType; + typedef typename Traits::StorageIndex StorageIndex; + #endif + + inline PermutationMatrix() + {} + + /** Constructs an uninitialized permutation matrix of given size. + */ + explicit inline PermutationMatrix(Index size) : m_indices(size) + { + eigen_internal_assert(size <= NumTraits::highest()); + } + + /** Copy constructor. */ + template + inline PermutationMatrix(const PermutationBase& other) + : m_indices(other.indices()) {} + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** Standard copy constructor. Defined only to prevent a default copy constructor + * from hiding the other templated constructor */ + inline PermutationMatrix(const PermutationMatrix& other) : m_indices(other.indices()) {} + #endif + + /** Generic constructor from expression of the indices. The indices + * array has the meaning that the permutations sends each integer i to indices[i]. + * + * \warning It is your responsibility to check that the indices array that you passes actually + * describes a permutation, i.e., each value between 0 and n-1 occurs exactly once, where n is the + * array's size. + */ + template + explicit inline PermutationMatrix(const MatrixBase& indices) : m_indices(indices) + {} + + /** Convert the Transpositions \a tr to a permutation matrix */ + template + explicit PermutationMatrix(const TranspositionsBase& tr) + : m_indices(tr.size()) + { + *this = tr; + } + + /** Copies the other permutation into *this */ + template + PermutationMatrix& operator=(const PermutationBase& other) + { + m_indices = other.indices(); + return *this; + } + + /** Assignment from the Transpositions \a tr */ + template + PermutationMatrix& operator=(const TranspositionsBase& tr) + { + return Base::operator=(tr.derived()); + } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** This is a special case of the templated operator=. Its purpose is to + * prevent a default operator= from hiding the templated operator=. + */ + PermutationMatrix& operator=(const PermutationMatrix& other) + { + m_indices = other.m_indices; + return *this; + } + #endif + + /** const version of indices(). */ + const IndicesType& indices() const { return m_indices; } + /** \returns a reference to the stored array representing the permutation. */ + IndicesType& indices() { return m_indices; } + + + /**** multiplication helpers to hopefully get RVO ****/ + +#ifndef EIGEN_PARSED_BY_DOXYGEN + template + PermutationMatrix(const InverseImpl& other) + : m_indices(other.derived().nestedExpression().size()) + { + eigen_internal_assert(m_indices.size() <= NumTraits::highest()); + StorageIndex end = StorageIndex(m_indices.size()); + for (StorageIndex i=0; i + PermutationMatrix(internal::PermPermProduct_t, const Lhs& lhs, const Rhs& rhs) + : m_indices(lhs.indices().size()) + { + Base::assignProduct(lhs,rhs); + } +#endif + + protected: + + IndicesType m_indices; +}; + + +namespace internal { +template +struct traits,_PacketAccess> > + : traits > +{ + typedef PermutationStorage StorageKind; + typedef Map, _PacketAccess> IndicesType; + typedef _StorageIndex StorageIndex; + typedef void Scalar; +}; +} + +template +class Map,_PacketAccess> + : public PermutationBase,_PacketAccess> > +{ + typedef PermutationBase Base; + typedef internal::traits Traits; + public: + + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename Traits::IndicesType IndicesType; + typedef typename IndicesType::Scalar StorageIndex; + #endif + + inline Map(const StorageIndex* indicesPtr) + : m_indices(indicesPtr) + {} + + inline Map(const StorageIndex* indicesPtr, Index size) + : m_indices(indicesPtr,size) + {} + + /** Copies the other permutation into *this */ + template + Map& operator=(const PermutationBase& other) + { return Base::operator=(other.derived()); } + + /** Assignment from the Transpositions \a tr */ + template + Map& operator=(const TranspositionsBase& tr) + { return Base::operator=(tr.derived()); } + + #ifndef EIGEN_PARSED_BY_DOXYGEN + /** This is a special case of the templated operator=. Its purpose is to + * prevent a default operator= from hiding the templated operator=. + */ + Map& operator=(const Map& other) + { + m_indices = other.m_indices; + return *this; + } + #endif + + /** const version of indices(). */ + const IndicesType& indices() const { return m_indices; } + /** \returns a reference to the stored array representing the permutation. */ + IndicesType& indices() { return m_indices; } + + protected: + + IndicesType m_indices; +}; + +template class TranspositionsWrapper; +namespace internal { +template +struct traits > +{ + typedef PermutationStorage StorageKind; + typedef void Scalar; + typedef typename _IndicesType::Scalar StorageIndex; + typedef _IndicesType IndicesType; + enum { + RowsAtCompileTime = _IndicesType::SizeAtCompileTime, + ColsAtCompileTime = _IndicesType::SizeAtCompileTime, + MaxRowsAtCompileTime = IndicesType::MaxSizeAtCompileTime, + MaxColsAtCompileTime = IndicesType::MaxSizeAtCompileTime, + Flags = 0 + }; +}; +} + +/** \class PermutationWrapper + * \ingroup Core_Module + * + * \brief Class to view a vector of integers as a permutation matrix + * + * \tparam _IndicesType the type of the vector of integer (can be any compatible expression) + * + * This class allows to view any vector expression of integers as a permutation matrix. + * + * \sa class PermutationBase, class PermutationMatrix + */ +template +class PermutationWrapper : public PermutationBase > +{ + typedef PermutationBase Base; + typedef internal::traits Traits; + public: + + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename Traits::IndicesType IndicesType; + #endif + + inline PermutationWrapper(const IndicesType& indices) + : m_indices(indices) + {} + + /** const version of indices(). */ + const typename internal::remove_all::type& + indices() const { return m_indices; } + + protected: + + typename IndicesType::Nested m_indices; +}; + + +/** \returns the matrix with the permutation applied to the columns. + */ +template +EIGEN_DEVICE_FUNC +const Product +operator*(const MatrixBase &matrix, + const PermutationBase& permutation) +{ + return Product + (matrix.derived(), permutation.derived()); +} + +/** \returns the matrix with the permutation applied to the rows. + */ +template +EIGEN_DEVICE_FUNC +const Product +operator*(const PermutationBase &permutation, + const MatrixBase& matrix) +{ + return Product + (permutation.derived(), matrix.derived()); +} + + +template +class InverseImpl + : public EigenBase > +{ + typedef typename PermutationType::PlainPermutationType PlainPermutationType; + typedef internal::traits PermTraits; + protected: + InverseImpl() {} + public: + typedef Inverse InverseType; + using EigenBase >::derived; + + #ifndef EIGEN_PARSED_BY_DOXYGEN + typedef typename PermutationType::DenseMatrixType DenseMatrixType; + enum { + RowsAtCompileTime = PermTraits::RowsAtCompileTime, + ColsAtCompileTime = PermTraits::ColsAtCompileTime, + MaxRowsAtCompileTime = PermTraits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = PermTraits::MaxColsAtCompileTime + }; + #endif + + #ifndef EIGEN_PARSED_BY_DOXYGEN + template + void evalTo(MatrixBase& other) const + { + other.setZero(); + for (Index i=0; i friend + const Product + operator*(const MatrixBase& matrix, const InverseType& trPerm) + { + return Product(matrix.derived(), trPerm.derived()); + } + + /** \returns the matrix with the inverse permutation applied to the rows. + */ + template + const Product + operator*(const MatrixBase& matrix) const + { + return Product(derived(), matrix.derived()); + } +}; + +template +const PermutationWrapper MatrixBase::asPermutation() const +{ + return derived(); +} + +namespace internal { + +template<> struct AssignmentKind { typedef EigenBase2EigenBase Kind; }; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_PERMUTATIONMATRIX_H diff --git a/Eigen/src/Core/PlainObjectBase.h b/Eigen/src/Core/PlainObjectBase.h new file mode 100644 index 000000000..1dc7e223a --- /dev/null +++ b/Eigen/src/Core/PlainObjectBase.h @@ -0,0 +1,1035 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2009 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_DENSESTORAGEBASE_H +#define EIGEN_DENSESTORAGEBASE_H + +#if defined(EIGEN_INITIALIZE_MATRICES_BY_ZERO) +# define EIGEN_INITIALIZE_COEFFS +# define EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED for(int i=0;i::quiet_NaN(); +#else +# undef EIGEN_INITIALIZE_COEFFS +# define EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED +#endif + +namespace Eigen { + +namespace internal { + +template struct check_rows_cols_for_overflow { + template + EIGEN_DEVICE_FUNC + static EIGEN_ALWAYS_INLINE void run(Index, Index) + { + } +}; + +template<> struct check_rows_cols_for_overflow { + template + EIGEN_DEVICE_FUNC + static EIGEN_ALWAYS_INLINE void run(Index rows, Index cols) + { + // http://hg.mozilla.org/mozilla-central/file/6c8a909977d3/xpcom/ds/CheckedInt.h#l242 + // we assume Index is signed + Index max_index = (std::size_t(1) << (8 * sizeof(Index) - 1)) - 1; // assume Index is signed + bool error = (rows == 0 || cols == 0) ? false + : (rows > max_index / cols); + if (error) + throw_std_bad_alloc(); + } +}; + +template +struct conservative_resize_like_impl; + +template struct matrix_swap_impl; + +} // end namespace internal + +#ifdef EIGEN_PARSED_BY_DOXYGEN +namespace doxygen { + +// This is a workaround to doxygen not being able to understand the inheritance logic +// when it is hidden by the dense_xpr_base helper struct. +// Moreover, doxygen fails to include members that are not documented in the declaration body of +// MatrixBase if we inherits MatrixBase >, +// this is why we simply inherits MatrixBase, though this does not make sense. + +/** This class is just a workaround for Doxygen and it does not not actually exist. */ +template struct dense_xpr_base_dispatcher; +/** This class is just a workaround for Doxygen and it does not not actually exist. */ +template +struct dense_xpr_base_dispatcher > + : public MatrixBase {}; +/** This class is just a workaround for Doxygen and it does not not actually exist. */ +template +struct dense_xpr_base_dispatcher > + : public ArrayBase {}; + +} // namespace doxygen + +/** \class PlainObjectBase + * \ingroup Core_Module + * \brief %Dense storage base class for matrices and arrays. + * + * This class can be extended with the help of the plugin mechanism described on the page + * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_PLAINOBJECTBASE_PLUGIN. + * + * \tparam Derived is the derived type, e.g., a Matrix or Array + * + * \sa \ref TopicClassHierarchy + */ +template +class PlainObjectBase : public doxygen::dense_xpr_base_dispatcher +#else +template +class PlainObjectBase : public internal::dense_xpr_base::type +#endif +{ + public: + enum { Options = internal::traits::Options }; + typedef typename internal::dense_xpr_base::type Base; + + typedef typename internal::traits::StorageKind StorageKind; + typedef typename internal::traits::Scalar Scalar; + + typedef typename internal::packet_traits::type PacketScalar; + typedef typename NumTraits::Real RealScalar; + typedef Derived DenseType; + + using Base::RowsAtCompileTime; + using Base::ColsAtCompileTime; + using Base::SizeAtCompileTime; + using Base::MaxRowsAtCompileTime; + using Base::MaxColsAtCompileTime; + using Base::MaxSizeAtCompileTime; + using Base::IsVectorAtCompileTime; + using Base::Flags; + + template friend class Eigen::Map; + friend class Eigen::Map; + typedef Eigen::Map MapType; + friend class Eigen::Map; + typedef const Eigen::Map ConstMapType; +#if EIGEN_MAX_ALIGN_BYTES>0 + // for EIGEN_MAX_ALIGN_BYTES==0, AlignedMax==Unaligned, and many compilers generate warnings for friend-ing a class twice. + friend class Eigen::Map; + friend class Eigen::Map; +#endif + typedef Eigen::Map AlignedMapType; + typedef const Eigen::Map ConstAlignedMapType; + template struct StridedMapType { typedef Eigen::Map type; }; + template struct StridedConstMapType { typedef Eigen::Map type; }; + template struct StridedAlignedMapType { typedef Eigen::Map type; }; + template struct StridedConstAlignedMapType { typedef Eigen::Map type; }; + + protected: + DenseStorage m_storage; + + public: + enum { NeedsToAlign = (SizeAtCompileTime != Dynamic) && (internal::traits::Alignment>0) }; + EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(NeedsToAlign) + + EIGEN_DEVICE_FUNC + Base& base() { return *static_cast(this); } + EIGEN_DEVICE_FUNC + const Base& base() const { return *static_cast(this); } + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index rows() const { return m_storage.rows(); } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Index cols() const { return m_storage.cols(); } + + /** This is an overloaded version of DenseCoeffsBase::coeff(Index,Index) const + * provided to by-pass the creation of an evaluator of the expression, thus saving compilation efforts. + * + * See DenseCoeffsBase::coeff(Index) const for details. */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE const Scalar& coeff(Index rowId, Index colId) const + { + if(Flags & RowMajorBit) + return m_storage.data()[colId + rowId * m_storage.cols()]; + else // column-major + return m_storage.data()[rowId + colId * m_storage.rows()]; + } + + /** This is an overloaded version of DenseCoeffsBase::coeff(Index) const + * provided to by-pass the creation of an evaluator of the expression, thus saving compilation efforts. + * + * See DenseCoeffsBase::coeff(Index) const for details. */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE const Scalar& coeff(Index index) const + { + return m_storage.data()[index]; + } + + /** This is an overloaded version of DenseCoeffsBase::coeffRef(Index,Index) const + * provided to by-pass the creation of an evaluator of the expression, thus saving compilation efforts. + * + * See DenseCoeffsBase::coeffRef(Index,Index) const for details. */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& coeffRef(Index rowId, Index colId) + { + if(Flags & RowMajorBit) + return m_storage.data()[colId + rowId * m_storage.cols()]; + else // column-major + return m_storage.data()[rowId + colId * m_storage.rows()]; + } + + /** This is an overloaded version of DenseCoeffsBase::coeffRef(Index) const + * provided to by-pass the creation of an evaluator of the expression, thus saving compilation efforts. + * + * See DenseCoeffsBase::coeffRef(Index) const for details. */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Scalar& coeffRef(Index index) + { + return m_storage.data()[index]; + } + + /** This is the const version of coeffRef(Index,Index) which is thus synonym of coeff(Index,Index). + * It is provided for convenience. */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE const Scalar& coeffRef(Index rowId, Index colId) const + { + if(Flags & RowMajorBit) + return m_storage.data()[colId + rowId * m_storage.cols()]; + else // column-major + return m_storage.data()[rowId + colId * m_storage.rows()]; + } + + /** This is the const version of coeffRef(Index) which is thus synonym of coeff(Index). + * It is provided for convenience. */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE const Scalar& coeffRef(Index index) const + { + return m_storage.data()[index]; + } + + /** \internal */ + template + EIGEN_STRONG_INLINE PacketScalar packet(Index rowId, Index colId) const + { + return internal::ploadt + (m_storage.data() + (Flags & RowMajorBit + ? colId + rowId * m_storage.cols() + : rowId + colId * m_storage.rows())); + } + + /** \internal */ + template + EIGEN_STRONG_INLINE PacketScalar packet(Index index) const + { + return internal::ploadt(m_storage.data() + index); + } + + /** \internal */ + template + EIGEN_STRONG_INLINE void writePacket(Index rowId, Index colId, const PacketScalar& val) + { + internal::pstoret + (m_storage.data() + (Flags & RowMajorBit + ? colId + rowId * m_storage.cols() + : rowId + colId * m_storage.rows()), val); + } + + /** \internal */ + template + EIGEN_STRONG_INLINE void writePacket(Index index, const PacketScalar& val) + { + internal::pstoret(m_storage.data() + index, val); + } + + /** \returns a const pointer to the data array of this matrix */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar *data() const + { return m_storage.data(); } + + /** \returns a pointer to the data array of this matrix */ + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar *data() + { return m_storage.data(); } + + /** Resizes \c *this to a \a rows x \a cols matrix. + * + * This method is intended for dynamic-size matrices, although it is legal to call it on any + * matrix as long as fixed dimensions are left unchanged. If you only want to change the number + * of rows and/or of columns, you can use resize(NoChange_t, Index), resize(Index, NoChange_t). + * + * If the current number of coefficients of \c *this exactly matches the + * product \a rows * \a cols, then no memory allocation is performed and + * the current values are left unchanged. In all other cases, including + * shrinking, the data is reallocated and all previous values are lost. + * + * Example: \include Matrix_resize_int_int.cpp + * Output: \verbinclude Matrix_resize_int_int.out + * + * \sa resize(Index) for vectors, resize(NoChange_t, Index), resize(Index, NoChange_t) + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void resize(Index rows, Index cols) + { + eigen_assert( EIGEN_IMPLIES(RowsAtCompileTime!=Dynamic,rows==RowsAtCompileTime) + && EIGEN_IMPLIES(ColsAtCompileTime!=Dynamic,cols==ColsAtCompileTime) + && EIGEN_IMPLIES(RowsAtCompileTime==Dynamic && MaxRowsAtCompileTime!=Dynamic,rows<=MaxRowsAtCompileTime) + && EIGEN_IMPLIES(ColsAtCompileTime==Dynamic && MaxColsAtCompileTime!=Dynamic,cols<=MaxColsAtCompileTime) + && rows>=0 && cols>=0 && "Invalid sizes when resizing a matrix or array."); + internal::check_rows_cols_for_overflow::run(rows, cols); + #ifdef EIGEN_INITIALIZE_COEFFS + Index size = rows*cols; + bool size_changed = size != this->size(); + m_storage.resize(size, rows, cols); + if(size_changed) EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + #else + m_storage.resize(rows*cols, rows, cols); + #endif + } + + /** Resizes \c *this to a vector of length \a size + * + * \only_for_vectors. This method does not work for + * partially dynamic matrices when the static dimension is anything other + * than 1. For example it will not work with Matrix. + * + * Example: \include Matrix_resize_int.cpp + * Output: \verbinclude Matrix_resize_int.out + * + * \sa resize(Index,Index), resize(NoChange_t, Index), resize(Index, NoChange_t) + */ + EIGEN_DEVICE_FUNC + inline void resize(Index size) + { + EIGEN_STATIC_ASSERT_VECTOR_ONLY(PlainObjectBase) + eigen_assert(((SizeAtCompileTime == Dynamic && (MaxSizeAtCompileTime==Dynamic || size<=MaxSizeAtCompileTime)) || SizeAtCompileTime == size) && size>=0); + #ifdef EIGEN_INITIALIZE_COEFFS + bool size_changed = size != this->size(); + #endif + if(RowsAtCompileTime == 1) + m_storage.resize(size, 1, size); + else + m_storage.resize(size, size, 1); + #ifdef EIGEN_INITIALIZE_COEFFS + if(size_changed) EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + #endif + } + + /** Resizes the matrix, changing only the number of columns. For the parameter of type NoChange_t, just pass the special value \c NoChange + * as in the example below. + * + * Example: \include Matrix_resize_NoChange_int.cpp + * Output: \verbinclude Matrix_resize_NoChange_int.out + * + * \sa resize(Index,Index) + */ + EIGEN_DEVICE_FUNC + inline void resize(NoChange_t, Index cols) + { + resize(rows(), cols); + } + + /** Resizes the matrix, changing only the number of rows. For the parameter of type NoChange_t, just pass the special value \c NoChange + * as in the example below. + * + * Example: \include Matrix_resize_int_NoChange.cpp + * Output: \verbinclude Matrix_resize_int_NoChange.out + * + * \sa resize(Index,Index) + */ + EIGEN_DEVICE_FUNC + inline void resize(Index rows, NoChange_t) + { + resize(rows, cols()); + } + + /** Resizes \c *this to have the same dimensions as \a other. + * Takes care of doing all the checking that's needed. + * + * Note that copying a row-vector into a vector (and conversely) is allowed. + * The resizing, if any, is then done in the appropriate way so that row-vectors + * remain row-vectors and vectors remain vectors. + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void resizeLike(const EigenBase& _other) + { + const OtherDerived& other = _other.derived(); + internal::check_rows_cols_for_overflow::run(other.rows(), other.cols()); + const Index othersize = other.rows()*other.cols(); + if(RowsAtCompileTime == 1) + { + eigen_assert(other.rows() == 1 || other.cols() == 1); + resize(1, othersize); + } + else if(ColsAtCompileTime == 1) + { + eigen_assert(other.rows() == 1 || other.cols() == 1); + resize(othersize, 1); + } + else resize(other.rows(), other.cols()); + } + + /** Resizes the matrix to \a rows x \a cols while leaving old values untouched. + * + * The method is intended for matrices of dynamic size. If you only want to change the number + * of rows and/or of columns, you can use conservativeResize(NoChange_t, Index) or + * conservativeResize(Index, NoChange_t). + * + * Matrices are resized relative to the top-left element. In case values need to be + * appended to the matrix they will be uninitialized. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void conservativeResize(Index rows, Index cols) + { + internal::conservative_resize_like_impl::run(*this, rows, cols); + } + + /** Resizes the matrix to \a rows x \a cols while leaving old values untouched. + * + * As opposed to conservativeResize(Index rows, Index cols), this version leaves + * the number of columns unchanged. + * + * In case the matrix is growing, new rows will be uninitialized. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void conservativeResize(Index rows, NoChange_t) + { + // Note: see the comment in conservativeResize(Index,Index) + conservativeResize(rows, cols()); + } + + /** Resizes the matrix to \a rows x \a cols while leaving old values untouched. + * + * As opposed to conservativeResize(Index rows, Index cols), this version leaves + * the number of rows unchanged. + * + * In case the matrix is growing, new columns will be uninitialized. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void conservativeResize(NoChange_t, Index cols) + { + // Note: see the comment in conservativeResize(Index,Index) + conservativeResize(rows(), cols); + } + + /** Resizes the vector to \a size while retaining old values. + * + * \only_for_vectors. This method does not work for + * partially dynamic matrices when the static dimension is anything other + * than 1. For example it will not work with Matrix. + * + * When values are appended, they will be uninitialized. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void conservativeResize(Index size) + { + internal::conservative_resize_like_impl::run(*this, size); + } + + /** Resizes the matrix to \a rows x \a cols of \c other, while leaving old values untouched. + * + * The method is intended for matrices of dynamic size. If you only want to change the number + * of rows and/or of columns, you can use conservativeResize(NoChange_t, Index) or + * conservativeResize(Index, NoChange_t). + * + * Matrices are resized relative to the top-left element. In case values need to be + * appended to the matrix they will copied from \c other. + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void conservativeResizeLike(const DenseBase& other) + { + internal::conservative_resize_like_impl::run(*this, other); + } + + /** This is a special case of the templated operator=. Its purpose is to + * prevent a default operator= from hiding the templated operator=. + */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Derived& operator=(const PlainObjectBase& other) + { + return _set(other); + } + + /** \sa MatrixBase::lazyAssign() */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Derived& lazyAssign(const DenseBase& other) + { + _resize_to_match(other); + return Base::lazyAssign(other.derived()); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Derived& operator=(const ReturnByValue& func) + { + resize(func.rows(), func.cols()); + return Base::operator=(func); + } + + // Prevent user from trying to instantiate PlainObjectBase objects + // by making all its constructor protected. See bug 1074. + protected: + + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE PlainObjectBase() : m_storage() + { +// _check_template_params(); +// EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + } + +#ifndef EIGEN_PARSED_BY_DOXYGEN + // FIXME is it still needed ? + /** \internal */ + EIGEN_DEVICE_FUNC + explicit PlainObjectBase(internal::constructor_without_unaligned_array_assert) + : m_storage(internal::constructor_without_unaligned_array_assert()) + { +// _check_template_params(); EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + } +#endif + +#if EIGEN_HAS_RVALUE_REFERENCES + EIGEN_DEVICE_FUNC + PlainObjectBase(PlainObjectBase&& other) EIGEN_NOEXCEPT + : m_storage( std::move(other.m_storage) ) + { + } + + EIGEN_DEVICE_FUNC + PlainObjectBase& operator=(PlainObjectBase&& other) EIGEN_NOEXCEPT + { + using std::swap; + swap(m_storage, other.m_storage); + return *this; + } +#endif + + /** Copy constructor */ + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE PlainObjectBase(const PlainObjectBase& other) + : Base(), m_storage(other.m_storage) { } + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE PlainObjectBase(Index size, Index rows, Index cols) + : m_storage(size, rows, cols) + { +// _check_template_params(); +// EIGEN_INITIALIZE_COEFFS_IF_THAT_OPTION_IS_ENABLED + } + + /** \sa PlainObjectBase::operator=(const EigenBase&) */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE PlainObjectBase(const DenseBase &other) + : m_storage() + { + _check_template_params(); + resizeLike(other); + _set_noalias(other); + } + + /** \sa PlainObjectBase::operator=(const EigenBase&) */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE PlainObjectBase(const EigenBase &other) + : m_storage() + { + _check_template_params(); + resizeLike(other); + *this = other.derived(); + } + /** \brief Copy constructor with in-place evaluation */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE PlainObjectBase(const ReturnByValue& other) + { + _check_template_params(); + // FIXME this does not automatically transpose vectors if necessary + resize(other.rows(), other.cols()); + other.evalTo(this->derived()); + } + + public: + + /** \brief Copies the generic expression \a other into *this. + * \copydetails DenseBase::operator=(const EigenBase &other) + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Derived& operator=(const EigenBase &other) + { + _resize_to_match(other); + Base::operator=(other.derived()); + return this->derived(); + } + + /** \name Map + * These are convenience functions returning Map objects. The Map() static functions return unaligned Map objects, + * while the AlignedMap() functions return aligned Map objects and thus should be called only with 16-byte-aligned + * \a data pointers. + * + * Here is an example using strides: + * \include Matrix_Map_stride.cpp + * Output: \verbinclude Matrix_Map_stride.out + * + * \see class Map + */ + //@{ + static inline ConstMapType Map(const Scalar* data) + { return ConstMapType(data); } + static inline MapType Map(Scalar* data) + { return MapType(data); } + static inline ConstMapType Map(const Scalar* data, Index size) + { return ConstMapType(data, size); } + static inline MapType Map(Scalar* data, Index size) + { return MapType(data, size); } + static inline ConstMapType Map(const Scalar* data, Index rows, Index cols) + { return ConstMapType(data, rows, cols); } + static inline MapType Map(Scalar* data, Index rows, Index cols) + { return MapType(data, rows, cols); } + + static inline ConstAlignedMapType MapAligned(const Scalar* data) + { return ConstAlignedMapType(data); } + static inline AlignedMapType MapAligned(Scalar* data) + { return AlignedMapType(data); } + static inline ConstAlignedMapType MapAligned(const Scalar* data, Index size) + { return ConstAlignedMapType(data, size); } + static inline AlignedMapType MapAligned(Scalar* data, Index size) + { return AlignedMapType(data, size); } + static inline ConstAlignedMapType MapAligned(const Scalar* data, Index rows, Index cols) + { return ConstAlignedMapType(data, rows, cols); } + static inline AlignedMapType MapAligned(Scalar* data, Index rows, Index cols) + { return AlignedMapType(data, rows, cols); } + + template + static inline typename StridedConstMapType >::type Map(const Scalar* data, const Stride& stride) + { return typename StridedConstMapType >::type(data, stride); } + template + static inline typename StridedMapType >::type Map(Scalar* data, const Stride& stride) + { return typename StridedMapType >::type(data, stride); } + template + static inline typename StridedConstMapType >::type Map(const Scalar* data, Index size, const Stride& stride) + { return typename StridedConstMapType >::type(data, size, stride); } + template + static inline typename StridedMapType >::type Map(Scalar* data, Index size, const Stride& stride) + { return typename StridedMapType >::type(data, size, stride); } + template + static inline typename StridedConstMapType >::type Map(const Scalar* data, Index rows, Index cols, const Stride& stride) + { return typename StridedConstMapType >::type(data, rows, cols, stride); } + template + static inline typename StridedMapType >::type Map(Scalar* data, Index rows, Index cols, const Stride& stride) + { return typename StridedMapType >::type(data, rows, cols, stride); } + + template + static inline typename StridedConstAlignedMapType >::type MapAligned(const Scalar* data, const Stride& stride) + { return typename StridedConstAlignedMapType >::type(data, stride); } + template + static inline typename StridedAlignedMapType >::type MapAligned(Scalar* data, const Stride& stride) + { return typename StridedAlignedMapType >::type(data, stride); } + template + static inline typename StridedConstAlignedMapType >::type MapAligned(const Scalar* data, Index size, const Stride& stride) + { return typename StridedConstAlignedMapType >::type(data, size, stride); } + template + static inline typename StridedAlignedMapType >::type MapAligned(Scalar* data, Index size, const Stride& stride) + { return typename StridedAlignedMapType >::type(data, size, stride); } + template + static inline typename StridedConstAlignedMapType >::type MapAligned(const Scalar* data, Index rows, Index cols, const Stride& stride) + { return typename StridedConstAlignedMapType >::type(data, rows, cols, stride); } + template + static inline typename StridedAlignedMapType >::type MapAligned(Scalar* data, Index rows, Index cols, const Stride& stride) + { return typename StridedAlignedMapType >::type(data, rows, cols, stride); } + //@} + + using Base::setConstant; + EIGEN_DEVICE_FUNC Derived& setConstant(Index size, const Scalar& val); + EIGEN_DEVICE_FUNC Derived& setConstant(Index rows, Index cols, const Scalar& val); + + using Base::setZero; + EIGEN_DEVICE_FUNC Derived& setZero(Index size); + EIGEN_DEVICE_FUNC Derived& setZero(Index rows, Index cols); + + using Base::setOnes; + EIGEN_DEVICE_FUNC Derived& setOnes(Index size); + EIGEN_DEVICE_FUNC Derived& setOnes(Index rows, Index cols); + + using Base::setRandom; + Derived& setRandom(Index size); + Derived& setRandom(Index rows, Index cols); + + #ifdef EIGEN_PLAINOBJECTBASE_PLUGIN + #include EIGEN_PLAINOBJECTBASE_PLUGIN + #endif + + protected: + /** \internal Resizes *this in preparation for assigning \a other to it. + * Takes care of doing all the checking that's needed. + * + * Note that copying a row-vector into a vector (and conversely) is allowed. + * The resizing, if any, is then done in the appropriate way so that row-vectors + * remain row-vectors and vectors remain vectors. + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _resize_to_match(const EigenBase& other) + { + #ifdef EIGEN_NO_AUTOMATIC_RESIZING + eigen_assert((this->size()==0 || (IsVectorAtCompileTime ? (this->size() == other.size()) + : (rows() == other.rows() && cols() == other.cols()))) + && "Size mismatch. Automatic resizing is disabled because EIGEN_NO_AUTOMATIC_RESIZING is defined"); + EIGEN_ONLY_USED_FOR_DEBUG(other); + #else + resizeLike(other); + #endif + } + + /** + * \brief Copies the value of the expression \a other into \c *this with automatic resizing. + * + * *this might be resized to match the dimensions of \a other. If *this was a null matrix (not already initialized), + * it will be initialized. + * + * Note that copying a row-vector into a vector (and conversely) is allowed. + * The resizing, if any, is then done in the appropriate way so that row-vectors + * remain row-vectors and vectors remain vectors. + * + * \sa operator=(const MatrixBase&), _set_noalias() + * + * \internal + */ + // aliasing is dealt once in internall::call_assignment + // so at this stage we have to assume aliasing... and resising has to be done later. + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Derived& _set(const DenseBase& other) + { + internal::call_assignment(this->derived(), other.derived()); + return this->derived(); + } + + /** \internal Like _set() but additionally makes the assumption that no aliasing effect can happen (which + * is the case when creating a new matrix) so one can enforce lazy evaluation. + * + * \sa operator=(const MatrixBase&), _set() + */ + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE Derived& _set_noalias(const DenseBase& other) + { + // I don't think we need this resize call since the lazyAssign will anyways resize + // and lazyAssign will be called by the assign selector. + //_resize_to_match(other); + // the 'false' below means to enforce lazy evaluation. We don't use lazyAssign() because + // it wouldn't allow to copy a row-vector into a column-vector. + internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op()); + return this->derived(); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init2(Index rows, Index cols, typename internal::enable_if::type* = 0) + { + EIGEN_STATIC_ASSERT(bool(NumTraits::IsInteger) && + bool(NumTraits::IsInteger), + FLOATING_POINT_ARGUMENT_PASSED__INTEGER_WAS_EXPECTED) + resize(rows,cols); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init2(const T0& val0, const T1& val1, typename internal::enable_if::type* = 0) + { + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(PlainObjectBase, 2) + m_storage.data()[0] = Scalar(val0); + m_storage.data()[1] = Scalar(val1); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init2(const Index& val0, const Index& val1, + typename internal::enable_if< (!internal::is_same::value) + && (internal::is_same::value) + && (internal::is_same::value) + && Base::SizeAtCompileTime==2,T1>::type* = 0) + { + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(PlainObjectBase, 2) + m_storage.data()[0] = Scalar(val0); + m_storage.data()[1] = Scalar(val1); + } + + // The argument is convertible to the Index type and we either have a non 1x1 Matrix, or a dynamic-sized Array, + // then the argument is meant to be the size of the object. + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(Index size, typename internal::enable_if< (Base::SizeAtCompileTime!=1 || !internal::is_convertible::value) + && ((!internal::is_same::XprKind,ArrayXpr>::value || Base::SizeAtCompileTime==Dynamic)),T>::type* = 0) + { + // NOTE MSVC 2008 complains if we directly put bool(NumTraits::IsInteger) as the EIGEN_STATIC_ASSERT argument. + const bool is_integer = NumTraits::IsInteger; + EIGEN_UNUSED_VARIABLE(is_integer); + EIGEN_STATIC_ASSERT(is_integer, + FLOATING_POINT_ARGUMENT_PASSED__INTEGER_WAS_EXPECTED) + resize(size); + } + + // We have a 1x1 matrix/array => the argument is interpreted as the value of the unique coefficient (case where scalar type can be implicitely converted) + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const Scalar& val0, typename internal::enable_if::value,T>::type* = 0) + { + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(PlainObjectBase, 1) + m_storage.data()[0] = val0; + } + + // We have a 1x1 matrix/array => the argument is interpreted as the value of the unique coefficient (case where scalar type match the index type) + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const Index& val0, + typename internal::enable_if< (!internal::is_same::value) + && (internal::is_same::value) + && Base::SizeAtCompileTime==1 + && internal::is_convertible::value,T*>::type* = 0) + { + EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(PlainObjectBase, 1) + m_storage.data()[0] = Scalar(val0); + } + + // Initialize a fixed size matrix from a pointer to raw data + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const Scalar* data){ + this->_set_noalias(ConstMapType(data)); + } + + // Initialize an arbitrary matrix from a dense expression + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const DenseBase& other){ + this->_set_noalias(other); + } + + // Initialize an arbitrary matrix from an object convertible to the Derived type. + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const Derived& other){ + this->_set_noalias(other); + } + + // Initialize an arbitrary matrix from a generic Eigen expression + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const EigenBase& other){ + this->derived() = other; + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const ReturnByValue& other) + { + resize(other.rows(), other.cols()); + other.evalTo(this->derived()); + } + + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const RotationBase& r) + { + this->derived() = r; + } + + // For fixed-size Array + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const Scalar& val0, + typename internal::enable_if< Base::SizeAtCompileTime!=Dynamic + && Base::SizeAtCompileTime!=1 + && internal::is_convertible::value + && internal::is_same::XprKind,ArrayXpr>::value,T>::type* = 0) + { + Base::setConstant(val0); + } + + // For fixed-size Array + template + EIGEN_DEVICE_FUNC + EIGEN_STRONG_INLINE void _init1(const Index& val0, + typename internal::enable_if< (!internal::is_same::value) + && (internal::is_same::value) + && Base::SizeAtCompileTime!=Dynamic + && Base::SizeAtCompileTime!=1 + && internal::is_convertible::value + && internal::is_same::XprKind,ArrayXpr>::value,T*>::type* = 0) + { + Base::setConstant(val0); + } + + template + friend struct internal::matrix_swap_impl; + + public: + +#ifndef EIGEN_PARSED_BY_DOXYGEN + /** \internal + * \brief Override DenseBase::swap() since for dynamic-sized matrices + * of same type it is enough to swap the data pointers. + */ + template + EIGEN_DEVICE_FUNC + void swap(DenseBase & other) + { + enum { SwapPointers = internal::is_same::value && Base::SizeAtCompileTime==Dynamic }; + internal::matrix_swap_impl::run(this->derived(), other.derived()); + } + + /** \internal + * \brief const version forwarded to DenseBase::swap + */ + template + EIGEN_DEVICE_FUNC + void swap(DenseBase const & other) + { Base::swap(other.derived()); } + + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE void _check_template_params() + { + EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) + && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) + && ((RowsAtCompileTime == Dynamic) || (RowsAtCompileTime >= 0)) + && ((ColsAtCompileTime == Dynamic) || (ColsAtCompileTime >= 0)) + && ((MaxRowsAtCompileTime == Dynamic) || (MaxRowsAtCompileTime >= 0)) + && ((MaxColsAtCompileTime == Dynamic) || (MaxColsAtCompileTime >= 0)) + && (MaxRowsAtCompileTime == RowsAtCompileTime || RowsAtCompileTime==Dynamic) + && (MaxColsAtCompileTime == ColsAtCompileTime || ColsAtCompileTime==Dynamic) + && (Options & (DontAlign|RowMajor)) == Options), + INVALID_MATRIX_TEMPLATE_PARAMETERS) + } + + enum { IsPlainObjectBase = 1 }; +#endif +}; + +namespace internal { + +template +struct conservative_resize_like_impl +{ + static void run(DenseBase& _this, Index rows, Index cols) + { + if (_this.rows() == rows && _this.cols() == cols) return; + EIGEN_STATIC_ASSERT_DYNAMIC_SIZE(Derived) + + if ( ( Derived::IsRowMajor && _this.cols() == cols) || // row-major and we change only the number of rows + (!Derived::IsRowMajor && _this.rows() == rows) ) // column-major and we change only the number of columns + { + internal::check_rows_cols_for_overflow::run(rows, cols); + _this.derived().m_storage.conservativeResize(rows*cols,rows,cols); + } + else + { + // The storage order does not allow us to use reallocation. + typename Derived::PlainObject tmp(rows,cols); + const Index common_rows = numext::mini(rows, _this.rows()); + const Index common_cols = numext::mini(cols, _this.cols()); + tmp.block(0,0,common_rows,common_cols) = _this.block(0,0,common_rows,common_cols); + _this.derived().swap(tmp); + } + } + + static void run(DenseBase& _this, const DenseBase& other) + { + if (_this.rows() == other.rows() && _this.cols() == other.cols()) return; + + // Note: Here is space for improvement. Basically, for conservativeResize(Index,Index), + // neither RowsAtCompileTime or ColsAtCompileTime must be Dynamic. If only one of the + // dimensions is dynamic, one could use either conservativeResize(Index rows, NoChange_t) or + // conservativeResize(NoChange_t, Index cols). For these methods new static asserts like + // EIGEN_STATIC_ASSERT_DYNAMIC_ROWS and EIGEN_STATIC_ASSERT_DYNAMIC_COLS would be good. + EIGEN_STATIC_ASSERT_DYNAMIC_SIZE(Derived) + EIGEN_STATIC_ASSERT_DYNAMIC_SIZE(OtherDerived) + + if ( ( Derived::IsRowMajor && _this.cols() == other.cols()) || // row-major and we change only the number of rows + (!Derived::IsRowMajor && _this.rows() == other.rows()) ) // column-major and we change only the number of columns + { + const Index new_rows = other.rows() - _this.rows(); + const Index new_cols = other.cols() - _this.cols(); + _this.derived().m_storage.conservativeResize(other.size(),other.rows(),other.cols()); + if (new_rows>0) + _this.bottomRightCorner(new_rows, other.cols()) = other.bottomRows(new_rows); + else if (new_cols>0) + _this.bottomRightCorner(other.rows(), new_cols) = other.rightCols(new_cols); + } + else + { + // The storage order does not allow us to use reallocation. + typename Derived::PlainObject tmp(other); + const Index common_rows = numext::mini(tmp.rows(), _this.rows()); + const Index common_cols = numext::mini(tmp.cols(), _this.cols()); + tmp.block(0,0,common_rows,common_cols) = _this.block(0,0,common_rows,common_cols); + _this.derived().swap(tmp); + } + } +}; + +// Here, the specialization for vectors inherits from the general matrix case +// to allow calling .conservativeResize(rows,cols) on vectors. +template +struct conservative_resize_like_impl + : conservative_resize_like_impl +{ + using conservative_resize_like_impl::run; + + static void run(DenseBase& _this, Index size) + { + const Index new_rows = Derived::RowsAtCompileTime==1 ? 1 : size; + const Index new_cols = Derived::RowsAtCompileTime==1 ? size : 1; + _this.derived().m_storage.conservativeResize(size,new_rows,new_cols); + } + + static void run(DenseBase& _this, const DenseBase& other) + { + if (_this.rows() == other.rows() && _this.cols() == other.cols()) return; + + const Index num_new_elements = other.size() - _this.size(); + + const Index new_rows = Derived::RowsAtCompileTime==1 ? 1 : other.rows(); + const Index new_cols = Derived::RowsAtCompileTime==1 ? other.cols() : 1; + _this.derived().m_storage.conservativeResize(other.size(),new_rows,new_cols); + + if (num_new_elements > 0) + _this.tail(num_new_elements) = other.tail(num_new_elements); + } +}; + +template +struct matrix_swap_impl +{ + EIGEN_DEVICE_FUNC + static inline void run(MatrixTypeA& a, MatrixTypeB& b) + { + a.base().swap(b); + } +}; + +template +struct matrix_swap_impl +{ + EIGEN_DEVICE_FUNC + static inline void run(MatrixTypeA& a, MatrixTypeB& b) + { + static_cast(a).m_storage.swap(static_cast(b).m_storage); + } +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_DENSESTORAGEBASE_H diff --git a/Eigen/src/Core/Product.h b/Eigen/src/Core/Product.h new file mode 100644 index 000000000..ae0c94b38 --- /dev/null +++ b/Eigen/src/Core/Product.h @@ -0,0 +1,186 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2011 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_PRODUCT_H +#define EIGEN_PRODUCT_H + +namespace Eigen { + +template class ProductImpl; + +namespace internal { + +template +struct traits > +{ + typedef typename remove_all::type LhsCleaned; + typedef typename remove_all::type RhsCleaned; + typedef traits LhsTraits; + typedef traits RhsTraits; + + typedef MatrixXpr XprKind; + + typedef typename ScalarBinaryOpTraits::Scalar, typename traits::Scalar>::ReturnType Scalar; + typedef typename product_promote_storage_type::ret>::ret StorageKind; + typedef typename promote_index_type::type StorageIndex; + + enum { + RowsAtCompileTime = LhsTraits::RowsAtCompileTime, + ColsAtCompileTime = RhsTraits::ColsAtCompileTime, + MaxRowsAtCompileTime = LhsTraits::MaxRowsAtCompileTime, + MaxColsAtCompileTime = RhsTraits::MaxColsAtCompileTime, + + // FIXME: only needed by GeneralMatrixMatrixTriangular + InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(LhsTraits::ColsAtCompileTime, RhsTraits::RowsAtCompileTime), + + // The storage order is somewhat arbitrary here. The correct one will be determined through the evaluator. + Flags = (MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1) ? RowMajorBit + : (MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1) ? 0 + : ( ((LhsTraits::Flags&NoPreferredStorageOrderBit) && (RhsTraits::Flags&RowMajorBit)) + || ((RhsTraits::Flags&NoPreferredStorageOrderBit) && (LhsTraits::Flags&RowMajorBit)) ) ? RowMajorBit + : NoPreferredStorageOrderBit + }; +}; + +} // end namespace internal + +/** \class Product + * \ingroup Core_Module + * + * \brief Expression of the product of two arbitrary matrices or vectors + * + * \tparam _Lhs the type of the left-hand side expression + * \tparam _Rhs the type of the right-hand side expression + * + * This class represents an expression of the product of two arbitrary matrices. + * + * The other template parameters are: + * \tparam Option can be DefaultProduct, AliasFreeProduct, or LazyProduct + * + */ +template +class Product : public ProductImpl<_Lhs,_Rhs,Option, + typename internal::product_promote_storage_type::StorageKind, + typename internal::traits<_Rhs>::StorageKind, + internal::product_type<_Lhs,_Rhs>::ret>::ret> +{ + public: + + typedef _Lhs Lhs; + typedef _Rhs Rhs; + + typedef typename ProductImpl< + Lhs, Rhs, Option, + typename internal::product_promote_storage_type::StorageKind, + typename internal::traits::StorageKind, + internal::product_type::ret>::ret>::Base Base; + EIGEN_GENERIC_PUBLIC_INTERFACE(Product) + + typedef typename internal::ref_selector::type LhsNested; + typedef typename internal::ref_selector::type RhsNested; + typedef typename internal::remove_all::type LhsNestedCleaned; + typedef typename internal::remove_all::type RhsNestedCleaned; + + EIGEN_DEVICE_FUNC Product(const Lhs& lhs, const Rhs& rhs) : m_lhs(lhs), m_rhs(rhs) + { + eigen_assert(lhs.cols() == rhs.rows() + && "invalid matrix product" + && "if you wanted a coeff-wise or a dot product use the respective explicit functions"); + } + + EIGEN_DEVICE_FUNC inline Index rows() const { return m_lhs.rows(); } + EIGEN_DEVICE_FUNC inline Index cols() const { return m_rhs.cols(); } + + EIGEN_DEVICE_FUNC const LhsNestedCleaned& lhs() const { return m_lhs; } + EIGEN_DEVICE_FUNC const RhsNestedCleaned& rhs() const { return m_rhs; } + + protected: + + LhsNested m_lhs; + RhsNested m_rhs; +}; + +namespace internal { + +template::ret> +class dense_product_base + : public internal::dense_xpr_base >::type +{}; + +/** Convertion to scalar for inner-products */ +template +class dense_product_base + : public internal::dense_xpr_base >::type +{ + typedef Product ProductXpr; + typedef typename internal::dense_xpr_base::type Base; +public: + using Base::derived; + typedef typename Base::Scalar Scalar; + + operator const Scalar() const + { + return internal::evaluator(derived()).coeff(0,0); + } +}; + +} // namespace internal + +// Generic API dispatcher +template +class ProductImpl : public internal::generic_xpr_base, MatrixXpr, StorageKind>::type +{ + public: + typedef typename internal::generic_xpr_base, MatrixXpr, StorageKind>::type Base; +}; + +template +class ProductImpl + : public internal::dense_product_base +{ + typedef Product Derived; + + public: + + typedef typename internal::dense_product_base Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Derived) + protected: + enum { + IsOneByOne = (RowsAtCompileTime == 1 || RowsAtCompileTime == Dynamic) && + (ColsAtCompileTime == 1 || ColsAtCompileTime == Dynamic), + EnableCoeff = IsOneByOne || Option==LazyProduct + }; + + public: + + EIGEN_DEVICE_FUNC Scalar coeff(Index row, Index col) const + { + EIGEN_STATIC_ASSERT(EnableCoeff, THIS_METHOD_IS_ONLY_FOR_INNER_OR_LAZY_PRODUCTS); + eigen_assert( (Option==LazyProduct) || (this->rows() == 1 && this->cols() == 1) ); + + return internal::evaluator(derived()).coeff(row,col); + } + + EIGEN_DEVICE_FUNC Scalar coeff(Index i) const + { + EIGEN_STATIC_ASSERT(EnableCoeff, THIS_METHOD_IS_ONLY_FOR_INNER_OR_LAZY_PRODUCTS); + eigen_assert( (Option==LazyProduct) || (this->rows() == 1 && this->cols() == 1) ); + + return internal::evaluator(derived()).coeff(i); + } + + +}; + +} // end namespace Eigen + +#endif // EIGEN_PRODUCT_H diff --git a/Eigen/src/Core/ProductEvaluators.h b/Eigen/src/Core/ProductEvaluators.h new file mode 100644 index 000000000..86966abdb --- /dev/null +++ b/Eigen/src/Core/ProductEvaluators.h @@ -0,0 +1,1105 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2008 Benoit Jacob +// Copyright (C) 2008-2010 Gael Guennebaud +// Copyright (C) 2011 Jitse Niesen +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + + +#ifndef EIGEN_PRODUCTEVALUATORS_H +#define EIGEN_PRODUCTEVALUATORS_H + +namespace Eigen { + +namespace internal { + +/** \internal + * Evaluator of a product expression. + * Since products require special treatments to handle all possible cases, + * we simply deffer the evaluation logic to a product_evaluator class + * which offers more partial specialization possibilities. + * + * \sa class product_evaluator + */ +template +struct evaluator > + : public product_evaluator > +{ + typedef Product XprType; + typedef product_evaluator Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) : Base(xpr) {} +}; + +// Catch "scalar * ( A * B )" and transform it to "(A*scalar) * B" +// TODO we should apply that rule only if that's really helpful +template +struct evaluator_assume_aliasing, + const CwiseNullaryOp, Plain1>, + const Product > > +{ + static const bool value = true; +}; +template +struct evaluator, + const CwiseNullaryOp, Plain1>, + const Product > > + : public evaluator > +{ + typedef CwiseBinaryOp, + const CwiseNullaryOp, Plain1>, + const Product > XprType; + typedef evaluator > Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) + : Base(xpr.lhs().functor().m_other * xpr.rhs().lhs() * xpr.rhs().rhs()) + {} +}; + + +template +struct evaluator, DiagIndex> > + : public evaluator, DiagIndex> > +{ + typedef Diagonal, DiagIndex> XprType; + typedef evaluator, DiagIndex> > Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) + : Base(Diagonal, DiagIndex>( + Product(xpr.nestedExpression().lhs(), xpr.nestedExpression().rhs()), + xpr.index() )) + {} +}; + + +// Helper class to perform a matrix product with the destination at hand. +// Depending on the sizes of the factors, there are different evaluation strategies +// as controlled by internal::product_type. +template< typename Lhs, typename Rhs, + typename LhsShape = typename evaluator_traits::Shape, + typename RhsShape = typename evaluator_traits::Shape, + int ProductType = internal::product_type::value> +struct generic_product_impl; + +template +struct evaluator_assume_aliasing > { + static const bool value = true; +}; + +// This is the default evaluator implementation for products: +// It creates a temporary and call generic_product_impl +template +struct product_evaluator, ProductTag, LhsShape, RhsShape> + : public evaluator::PlainObject> +{ + typedef Product XprType; + typedef typename XprType::PlainObject PlainObject; + typedef evaluator Base; + enum { + Flags = Base::Flags | EvalBeforeNestingBit + }; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + explicit product_evaluator(const XprType& xpr) + : m_result(xpr.rows(), xpr.cols()) + { + ::new (static_cast(this)) Base(m_result); + +// FIXME shall we handle nested_eval here?, +// if so, then we must take care at removing the call to nested_eval in the specializations (e.g., in permutation_matrix_product, transposition_matrix_product, etc.) +// typedef typename internal::nested_eval::type LhsNested; +// typedef typename internal::nested_eval::type RhsNested; +// typedef typename internal::remove_all::type LhsNestedCleaned; +// typedef typename internal::remove_all::type RhsNestedCleaned; +// +// const LhsNested lhs(xpr.lhs()); +// const RhsNested rhs(xpr.rhs()); +// +// generic_product_impl::evalTo(m_result, lhs, rhs); + + generic_product_impl::evalTo(m_result, xpr.lhs(), xpr.rhs()); + } + +protected: + PlainObject m_result; +}; + +// The following three shortcuts are enabled only if the scalar types match excatly. +// TODO: we could enable them for different scalar types when the product is not vectorized. + +// Dense = Product +template< typename DstXprType, typename Lhs, typename Rhs, int Options, typename Scalar> +struct Assignment, internal::assign_op, Dense2Dense, + typename enable_if<(Options==DefaultProduct || Options==AliasFreeProduct)>::type> +{ + typedef Product SrcXprType; + static EIGEN_STRONG_INLINE + void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) + { + Index dstRows = src.rows(); + Index dstCols = src.cols(); + if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) + dst.resize(dstRows, dstCols); + // FIXME shall we handle nested_eval here? + generic_product_impl::evalTo(dst, src.lhs(), src.rhs()); + } +}; + +// Dense += Product +template< typename DstXprType, typename Lhs, typename Rhs, int Options, typename Scalar> +struct Assignment, internal::add_assign_op, Dense2Dense, + typename enable_if<(Options==DefaultProduct || Options==AliasFreeProduct)>::type> +{ + typedef Product SrcXprType; + static EIGEN_STRONG_INLINE + void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op &) + { + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); + // FIXME shall we handle nested_eval here? + generic_product_impl::addTo(dst, src.lhs(), src.rhs()); + } +}; + +// Dense -= Product +template< typename DstXprType, typename Lhs, typename Rhs, int Options, typename Scalar> +struct Assignment, internal::sub_assign_op, Dense2Dense, + typename enable_if<(Options==DefaultProduct || Options==AliasFreeProduct)>::type> +{ + typedef Product SrcXprType; + static EIGEN_STRONG_INLINE + void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op &) + { + eigen_assert(dst.rows() == src.rows() && dst.cols() == src.cols()); + // FIXME shall we handle nested_eval here? + generic_product_impl::subTo(dst, src.lhs(), src.rhs()); + } +}; + + +// Dense ?= scalar * Product +// TODO we should apply that rule if that's really helpful +// for instance, this is not good for inner products +template< typename DstXprType, typename Lhs, typename Rhs, typename AssignFunc, typename Scalar, typename ScalarBis, typename Plain> +struct Assignment, const CwiseNullaryOp,Plain>, + const Product >, AssignFunc, Dense2Dense> +{ + typedef CwiseBinaryOp, + const CwiseNullaryOp,Plain>, + const Product > SrcXprType; + static EIGEN_STRONG_INLINE + void run(DstXprType &dst, const SrcXprType &src, const AssignFunc& func) + { + call_assignment_no_alias(dst, (src.lhs().functor().m_other * src.rhs().lhs())*src.rhs().rhs(), func); + } +}; + +//---------------------------------------- +// Catch "Dense ?= xpr + Product<>" expression to save one temporary +// FIXME we could probably enable these rules for any product, i.e., not only Dense and DefaultProduct + +template +struct evaluator_assume_aliasing::Scalar>, const OtherXpr, + const Product >, DenseShape > { + static const bool value = true; +}; + +template +struct evaluator_assume_aliasing::Scalar>, const OtherXpr, + const Product >, DenseShape > { + static const bool value = true; +}; + +template +struct assignment_from_xpr_op_product +{ + template + static EIGEN_STRONG_INLINE + void run(DstXprType &dst, const SrcXprType &src, const InitialFunc& /*func*/) + { + call_assignment_no_alias(dst, src.lhs(), Func1()); + call_assignment_no_alias(dst, src.rhs(), Func2()); + } +}; + +#define EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(ASSIGN_OP,BINOP,ASSIGN_OP2) \ + template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> \ + struct Assignment, const OtherXpr, \ + const Product >, internal::ASSIGN_OP, Dense2Dense> \ + : assignment_from_xpr_op_product, internal::ASSIGN_OP, internal::ASSIGN_OP2 > \ + {} + +EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(assign_op, scalar_sum_op,add_assign_op); +EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(add_assign_op,scalar_sum_op,add_assign_op); +EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(sub_assign_op,scalar_sum_op,sub_assign_op); + +EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(assign_op, scalar_difference_op,sub_assign_op); +EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(add_assign_op,scalar_difference_op,sub_assign_op); +EIGEN_CATCH_ASSIGN_XPR_OP_PRODUCT(sub_assign_op,scalar_difference_op,add_assign_op); + +//---------------------------------------- + +template +struct generic_product_impl +{ + template + static inline void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + dst.coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum(); + } + + template + static inline void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + dst.coeffRef(0,0) += (lhs.transpose().cwiseProduct(rhs)).sum(); + } + + template + static void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { dst.coeffRef(0,0) -= (lhs.transpose().cwiseProduct(rhs)).sum(); } +}; + + +/*********************************************************************** +* Implementation of outer dense * dense vector product +***********************************************************************/ + +// Column major result +template +void outer_product_selector_run(Dst& dst, const Lhs &lhs, const Rhs &rhs, const Func& func, const false_type&) +{ + evaluator rhsEval(rhs); + typename nested_eval::type actual_lhs(lhs); + // FIXME if cols is large enough, then it might be useful to make sure that lhs is sequentially stored + // FIXME not very good if rhs is real and lhs complex while alpha is real too + const Index cols = dst.cols(); + for (Index j=0; j +void outer_product_selector_run(Dst& dst, const Lhs &lhs, const Rhs &rhs, const Func& func, const true_type&) +{ + evaluator lhsEval(lhs); + typename nested_eval::type actual_rhs(rhs); + // FIXME if rows is large enough, then it might be useful to make sure that rhs is sequentially stored + // FIXME not very good if lhs is real and rhs complex while alpha is real too + const Index rows = dst.rows(); + for (Index i=0; i +struct generic_product_impl +{ + template struct is_row_major : internal::conditional<(int(T::Flags)&RowMajorBit), internal::true_type, internal::false_type>::type {}; + typedef typename Product::Scalar Scalar; + + // TODO it would be nice to be able to exploit our *_assign_op functors for that purpose + struct set { template void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() = src; } }; + struct add { template void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() += src; } }; + struct sub { template void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() -= src; } }; + struct adds { + Scalar m_scale; + explicit adds(const Scalar& s) : m_scale(s) {} + template void operator()(const Dst& dst, const Src& src) const { + dst.const_cast_derived() += m_scale * src; + } + }; + + template + static inline void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + internal::outer_product_selector_run(dst, lhs, rhs, set(), is_row_major()); + } + + template + static inline void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + internal::outer_product_selector_run(dst, lhs, rhs, add(), is_row_major()); + } + + template + static inline void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + internal::outer_product_selector_run(dst, lhs, rhs, sub(), is_row_major()); + } + + template + static inline void scaleAndAddTo(Dst& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { + internal::outer_product_selector_run(dst, lhs, rhs, adds(alpha), is_row_major()); + } + +}; + + +// This base class provides default implementations for evalTo, addTo, subTo, in terms of scaleAndAddTo +template +struct generic_product_impl_base +{ + typedef typename Product::Scalar Scalar; + + template + static EIGEN_STRONG_INLINE void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); } + + template + static EIGEN_STRONG_INLINE void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { scaleAndAddTo(dst,lhs, rhs, Scalar(1)); } + + template + static EIGEN_STRONG_INLINE void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); } + + template + static EIGEN_STRONG_INLINE void scaleAndAddTo(Dst& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); } + +}; + +template +struct generic_product_impl + : generic_product_impl_base > +{ + typedef typename nested_eval::type LhsNested; + typedef typename nested_eval::type RhsNested; + typedef typename Product::Scalar Scalar; + enum { Side = Lhs::IsVectorAtCompileTime ? OnTheLeft : OnTheRight }; + typedef typename internal::remove_all::type>::type MatrixType; + + template + static EIGEN_STRONG_INLINE void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { + LhsNested actual_lhs(lhs); + RhsNested actual_rhs(rhs); + internal::gemv_dense_selector::HasUsableDirectAccess) + >::run(actual_lhs, actual_rhs, dst, alpha); + } +}; + +template +struct generic_product_impl +{ + typedef typename Product::Scalar Scalar; + + template + static EIGEN_STRONG_INLINE void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + // Same as: dst.noalias() = lhs.lazyProduct(rhs); + // but easier on the compiler side + call_assignment_no_alias(dst, lhs.lazyProduct(rhs), internal::assign_op()); + } + + template + static EIGEN_STRONG_INLINE void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + // dst.noalias() += lhs.lazyProduct(rhs); + call_assignment_no_alias(dst, lhs.lazyProduct(rhs), internal::add_assign_op()); + } + + template + static EIGEN_STRONG_INLINE void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) + { + // dst.noalias() -= lhs.lazyProduct(rhs); + call_assignment_no_alias(dst, lhs.lazyProduct(rhs), internal::sub_assign_op()); + } + +// template +// static inline void scaleAndAddTo(Dst& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) +// { dst.noalias() += alpha * lhs.lazyProduct(rhs); } +}; + +// This specialization enforces the use of a coefficient-based evaluation strategy +template +struct generic_product_impl + : generic_product_impl {}; + +// Case 2: Evaluate coeff by coeff +// +// This is mostly taken from CoeffBasedProduct.h +// The main difference is that we add an extra argument to the etor_product_*_impl::run() function +// for the inner dimension of the product, because evaluator object do not know their size. + +template +struct etor_product_coeff_impl; + +template +struct etor_product_packet_impl; + +template +struct product_evaluator, ProductTag, DenseShape, DenseShape> + : evaluator_base > +{ + typedef Product XprType; + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE + explicit product_evaluator(const XprType& xpr) + : m_lhs(xpr.lhs()), + m_rhs(xpr.rhs()), + m_lhsImpl(m_lhs), // FIXME the creation of the evaluator objects should result in a no-op, but check that! + m_rhsImpl(m_rhs), // Moreover, they are only useful for the packet path, so we could completely disable them when not needed, + // or perhaps declare them on the fly on the packet method... We have experiment to check what's best. + m_innerDim(xpr.lhs().cols()) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(NumTraits::MulCost); + EIGEN_INTERNAL_CHECK_COST_VALUE(NumTraits::AddCost); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); +#if 0 + std::cerr << "LhsOuterStrideBytes= " << LhsOuterStrideBytes << "\n"; + std::cerr << "RhsOuterStrideBytes= " << RhsOuterStrideBytes << "\n"; + std::cerr << "LhsAlignment= " << LhsAlignment << "\n"; + std::cerr << "RhsAlignment= " << RhsAlignment << "\n"; + std::cerr << "CanVectorizeLhs= " << CanVectorizeLhs << "\n"; + std::cerr << "CanVectorizeRhs= " << CanVectorizeRhs << "\n"; + std::cerr << "CanVectorizeInner= " << CanVectorizeInner << "\n"; + std::cerr << "EvalToRowMajor= " << EvalToRowMajor << "\n"; + std::cerr << "Alignment= " << Alignment << "\n"; + std::cerr << "Flags= " << Flags << "\n"; +#endif + } + + // Everything below here is taken from CoeffBasedProduct.h + + typedef typename internal::nested_eval::type LhsNested; + typedef typename internal::nested_eval::type RhsNested; + + typedef typename internal::remove_all::type LhsNestedCleaned; + typedef typename internal::remove_all::type RhsNestedCleaned; + + typedef evaluator LhsEtorType; + typedef evaluator RhsEtorType; + + enum { + RowsAtCompileTime = LhsNestedCleaned::RowsAtCompileTime, + ColsAtCompileTime = RhsNestedCleaned::ColsAtCompileTime, + InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(LhsNestedCleaned::ColsAtCompileTime, RhsNestedCleaned::RowsAtCompileTime), + MaxRowsAtCompileTime = LhsNestedCleaned::MaxRowsAtCompileTime, + MaxColsAtCompileTime = RhsNestedCleaned::MaxColsAtCompileTime + }; + + typedef typename find_best_packet::type LhsVecPacketType; + typedef typename find_best_packet::type RhsVecPacketType; + + enum { + + LhsCoeffReadCost = LhsEtorType::CoeffReadCost, + RhsCoeffReadCost = RhsEtorType::CoeffReadCost, + CoeffReadCost = InnerSize==0 ? NumTraits::ReadCost + : InnerSize == Dynamic ? HugeCost + : InnerSize * (NumTraits::MulCost + LhsCoeffReadCost + RhsCoeffReadCost) + + (InnerSize - 1) * NumTraits::AddCost, + + Unroll = CoeffReadCost <= EIGEN_UNROLLING_LIMIT, + + LhsFlags = LhsEtorType::Flags, + RhsFlags = RhsEtorType::Flags, + + LhsRowMajor = LhsFlags & RowMajorBit, + RhsRowMajor = RhsFlags & RowMajorBit, + + LhsVecPacketSize = unpacket_traits::size, + RhsVecPacketSize = unpacket_traits::size, + + // Here, we don't care about alignment larger than the usable packet size. + LhsAlignment = EIGEN_PLAIN_ENUM_MIN(LhsEtorType::Alignment,LhsVecPacketSize*int(sizeof(typename LhsNestedCleaned::Scalar))), + RhsAlignment = EIGEN_PLAIN_ENUM_MIN(RhsEtorType::Alignment,RhsVecPacketSize*int(sizeof(typename RhsNestedCleaned::Scalar))), + + SameType = is_same::value, + + CanVectorizeRhs = bool(RhsRowMajor) && (RhsFlags & PacketAccessBit) && (ColsAtCompileTime!=1), + CanVectorizeLhs = (!LhsRowMajor) && (LhsFlags & PacketAccessBit) && (RowsAtCompileTime!=1), + + EvalToRowMajor = (MaxRowsAtCompileTime==1&&MaxColsAtCompileTime!=1) ? 1 + : (MaxColsAtCompileTime==1&&MaxRowsAtCompileTime!=1) ? 0 + : (bool(RhsRowMajor) && !CanVectorizeLhs), + + Flags = ((unsigned int)(LhsFlags | RhsFlags) & HereditaryBits & ~RowMajorBit) + | (EvalToRowMajor ? RowMajorBit : 0) + // TODO enable vectorization for mixed types + | (SameType && (CanVectorizeLhs || CanVectorizeRhs) ? PacketAccessBit : 0) + | (XprType::IsVectorAtCompileTime ? LinearAccessBit : 0), + + LhsOuterStrideBytes = int(LhsNestedCleaned::OuterStrideAtCompileTime) * int(sizeof(typename LhsNestedCleaned::Scalar)), + RhsOuterStrideBytes = int(RhsNestedCleaned::OuterStrideAtCompileTime) * int(sizeof(typename RhsNestedCleaned::Scalar)), + + Alignment = bool(CanVectorizeLhs) ? (LhsOuterStrideBytes<=0 || (int(LhsOuterStrideBytes) % EIGEN_PLAIN_ENUM_MAX(1,LhsAlignment))!=0 ? 0 : LhsAlignment) + : bool(CanVectorizeRhs) ? (RhsOuterStrideBytes<=0 || (int(RhsOuterStrideBytes) % EIGEN_PLAIN_ENUM_MAX(1,RhsAlignment))!=0 ? 0 : RhsAlignment) + : 0, + + /* CanVectorizeInner deserves special explanation. It does not affect the product flags. It is not used outside + * of Product. If the Product itself is not a packet-access expression, there is still a chance that the inner + * loop of the product might be vectorized. This is the meaning of CanVectorizeInner. Since it doesn't affect + * the Flags, it is safe to make this value depend on ActualPacketAccessBit, that doesn't affect the ABI. + */ + CanVectorizeInner = SameType + && LhsRowMajor + && (!RhsRowMajor) + && (LhsFlags & RhsFlags & ActualPacketAccessBit) + && (InnerSize % packet_traits::size == 0) + }; + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const CoeffReturnType coeff(Index row, Index col) const + { + return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum(); + } + + /* Allow index-based non-packet access. It is impossible though to allow index-based packed access, + * which is why we don't set the LinearAccessBit. + * TODO: this seems possible when the result is a vector + */ + EIGEN_DEVICE_FUNC const CoeffReturnType coeff(Index index) const + { + const Index row = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? 0 : index; + const Index col = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? index : 0; + return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum(); + } + + template + const PacketType packet(Index row, Index col) const + { + PacketType res; + typedef etor_product_packet_impl PacketImpl; + PacketImpl::run(row, col, m_lhsImpl, m_rhsImpl, m_innerDim, res); + return res; + } + + template + const PacketType packet(Index index) const + { + const Index row = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? 0 : index; + const Index col = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? index : 0; + return packet(row,col); + } + +protected: + typename internal::add_const_on_value_type::type m_lhs; + typename internal::add_const_on_value_type::type m_rhs; + + LhsEtorType m_lhsImpl; + RhsEtorType m_rhsImpl; + + // TODO: Get rid of m_innerDim if known at compile time + Index m_innerDim; +}; + +template +struct product_evaluator, LazyCoeffBasedProductMode, DenseShape, DenseShape> + : product_evaluator, CoeffBasedProductMode, DenseShape, DenseShape> +{ + typedef Product XprType; + typedef Product BaseProduct; + typedef product_evaluator Base; + enum { + Flags = Base::Flags | EvalBeforeNestingBit + }; + EIGEN_DEVICE_FUNC explicit product_evaluator(const XprType& xpr) + : Base(BaseProduct(xpr.lhs(),xpr.rhs())) + {} +}; + +/**************************************** +*** Coeff based product, Packet path *** +****************************************/ + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet &res) + { + etor_product_packet_impl::run(row, col, lhs, rhs, innerDim, res); + res = pmadd(pset1(lhs.coeff(row, Index(UnrollingIndex-1))), rhs.template packet(Index(UnrollingIndex-1), col), res); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet &res) + { + etor_product_packet_impl::run(row, col, lhs, rhs, innerDim, res); + res = pmadd(lhs.template packet(row, Index(UnrollingIndex-1)), pset1(rhs.coeff(Index(UnrollingIndex-1), col)), res); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index /*innerDim*/, Packet &res) + { + res = pmul(pset1(lhs.coeff(row, Index(0))),rhs.template packet(Index(0), col)); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index /*innerDim*/, Packet &res) + { + res = pmul(lhs.template packet(row, Index(0)), pset1(rhs.coeff(Index(0), col))); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index /*row*/, Index /*col*/, const Lhs& /*lhs*/, const Rhs& /*rhs*/, Index /*innerDim*/, Packet &res) + { + res = pset1(typename unpacket_traits::type(0)); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index /*row*/, Index /*col*/, const Lhs& /*lhs*/, const Rhs& /*rhs*/, Index /*innerDim*/, Packet &res) + { + res = pset1(typename unpacket_traits::type(0)); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet& res) + { + res = pset1(typename unpacket_traits::type(0)); + for(Index i = 0; i < innerDim; ++i) + res = pmadd(pset1(lhs.coeff(row, i)), rhs.template packet(i, col), res); + } +}; + +template +struct etor_product_packet_impl +{ + static EIGEN_STRONG_INLINE void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet& res) + { + res = pset1(typename unpacket_traits::type(0)); + for(Index i = 0; i < innerDim; ++i) + res = pmadd(lhs.template packet(row, i), pset1(rhs.coeff(i, col)), res); + } +}; + + +/*************************************************************************** +* Triangular products +***************************************************************************/ +template +struct triangular_product_impl; + +template +struct generic_product_impl + : generic_product_impl_base > +{ + typedef typename Product::Scalar Scalar; + + template + static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { + triangular_product_impl + ::run(dst, lhs.nestedExpression(), rhs, alpha); + } +}; + +template +struct generic_product_impl +: generic_product_impl_base > +{ + typedef typename Product::Scalar Scalar; + + template + static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { + triangular_product_impl::run(dst, lhs, rhs.nestedExpression(), alpha); + } +}; + + +/*************************************************************************** +* SelfAdjoint products +***************************************************************************/ +template +struct selfadjoint_product_impl; + +template +struct generic_product_impl + : generic_product_impl_base > +{ + typedef typename Product::Scalar Scalar; + + template + static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { + selfadjoint_product_impl::run(dst, lhs.nestedExpression(), rhs, alpha); + } +}; + +template +struct generic_product_impl +: generic_product_impl_base > +{ + typedef typename Product::Scalar Scalar; + + template + static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) + { + selfadjoint_product_impl::run(dst, lhs, rhs.nestedExpression(), alpha); + } +}; + + +/*************************************************************************** +* Diagonal products +***************************************************************************/ + +template +struct diagonal_product_evaluator_base + : evaluator_base +{ + typedef typename ScalarBinaryOpTraits::ReturnType Scalar; +public: + enum { + CoeffReadCost = NumTraits::MulCost + evaluator::CoeffReadCost + evaluator::CoeffReadCost, + + MatrixFlags = evaluator::Flags, + DiagFlags = evaluator::Flags, + _StorageOrder = MatrixFlags & RowMajorBit ? RowMajor : ColMajor, + _ScalarAccessOnDiag = !((int(_StorageOrder) == ColMajor && int(ProductOrder) == OnTheLeft) + ||(int(_StorageOrder) == RowMajor && int(ProductOrder) == OnTheRight)), + _SameTypes = is_same::value, + // FIXME currently we need same types, but in the future the next rule should be the one + //_Vectorizable = bool(int(MatrixFlags)&PacketAccessBit) && ((!_PacketOnDiag) || (_SameTypes && bool(int(DiagFlags)&PacketAccessBit))), + _Vectorizable = bool(int(MatrixFlags)&PacketAccessBit) && _SameTypes && (_ScalarAccessOnDiag || (bool(int(DiagFlags)&PacketAccessBit))), + _LinearAccessMask = (MatrixType::RowsAtCompileTime==1 || MatrixType::ColsAtCompileTime==1) ? LinearAccessBit : 0, + Flags = ((HereditaryBits|_LinearAccessMask) & (unsigned int)(MatrixFlags)) | (_Vectorizable ? PacketAccessBit : 0), + Alignment = evaluator::Alignment + }; + + diagonal_product_evaluator_base(const MatrixType &mat, const DiagonalType &diag) + : m_diagImpl(diag), m_matImpl(mat) + { + EIGEN_INTERNAL_CHECK_COST_VALUE(NumTraits::MulCost); + EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(Index idx) const + { + return m_diagImpl.coeff(idx) * m_matImpl.coeff(idx); + } + +protected: + template + EIGEN_STRONG_INLINE PacketType packet_impl(Index row, Index col, Index id, internal::true_type) const + { + return internal::pmul(m_matImpl.template packet(row, col), + internal::pset1(m_diagImpl.coeff(id))); + } + + template + EIGEN_STRONG_INLINE PacketType packet_impl(Index row, Index col, Index id, internal::false_type) const + { + enum { + InnerSize = (MatrixType::Flags & RowMajorBit) ? MatrixType::ColsAtCompileTime : MatrixType::RowsAtCompileTime, + DiagonalPacketLoadMode = EIGEN_PLAIN_ENUM_MIN(LoadMode,((InnerSize%16) == 0) ? int(Aligned16) : int(evaluator::Alignment)) // FIXME hardcoded 16!! + }; + return internal::pmul(m_matImpl.template packet(row, col), + m_diagImpl.template packet(id)); + } + + evaluator m_diagImpl; + evaluator m_matImpl; +}; + +// diagonal * dense +template +struct product_evaluator, ProductTag, DiagonalShape, DenseShape> + : diagonal_product_evaluator_base, OnTheLeft> +{ + typedef diagonal_product_evaluator_base, OnTheLeft> Base; + using Base::m_diagImpl; + using Base::m_matImpl; + using Base::coeff; + typedef typename Base::Scalar Scalar; + + typedef Product XprType; + typedef typename XprType::PlainObject PlainObject; + + enum { + StorageOrder = int(Rhs::Flags) & RowMajorBit ? RowMajor : ColMajor + }; + + EIGEN_DEVICE_FUNC explicit product_evaluator(const XprType& xpr) + : Base(xpr.rhs(), xpr.lhs().diagonal()) + { + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const + { + return m_diagImpl.coeff(row) * m_matImpl.coeff(row, col); + } + +#ifndef EIGEN_CUDACC + template + EIGEN_STRONG_INLINE PacketType packet(Index row, Index col) const + { + // FIXME: NVCC used to complain about the template keyword, but we have to check whether this is still the case. + // See also similar calls below. + return this->template packet_impl(row,col, row, + typename internal::conditional::type()); + } + + template + EIGEN_STRONG_INLINE PacketType packet(Index idx) const + { + return packet(int(StorageOrder)==ColMajor?idx:0,int(StorageOrder)==ColMajor?0:idx); + } +#endif +}; + +// dense * diagonal +template +struct product_evaluator, ProductTag, DenseShape, DiagonalShape> + : diagonal_product_evaluator_base, OnTheRight> +{ + typedef diagonal_product_evaluator_base, OnTheRight> Base; + using Base::m_diagImpl; + using Base::m_matImpl; + using Base::coeff; + typedef typename Base::Scalar Scalar; + + typedef Product XprType; + typedef typename XprType::PlainObject PlainObject; + + enum { StorageOrder = int(Lhs::Flags) & RowMajorBit ? RowMajor : ColMajor }; + + EIGEN_DEVICE_FUNC explicit product_evaluator(const XprType& xpr) + : Base(xpr.lhs(), xpr.rhs().diagonal()) + { + } + + EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const + { + return m_matImpl.coeff(row, col) * m_diagImpl.coeff(col); + } + +#ifndef EIGEN_CUDACC + template + EIGEN_STRONG_INLINE PacketType packet(Index row, Index col) const + { + return this->template packet_impl(row,col, col, + typename internal::conditional::type()); + } + + template + EIGEN_STRONG_INLINE PacketType packet(Index idx) const + { + return packet(int(StorageOrder)==ColMajor?idx:0,int(StorageOrder)==ColMajor?0:idx); + } +#endif +}; + +/*************************************************************************** +* Products with permutation matrices +***************************************************************************/ + +/** \internal + * \class permutation_matrix_product + * Internal helper class implementing the product between a permutation matrix and a matrix. + * This class is specialized for DenseShape below and for SparseShape in SparseCore/SparsePermutation.h + */ +template +struct permutation_matrix_product; + +template +struct permutation_matrix_product +{ + typedef typename nested_eval::type MatrixType; + typedef typename remove_all::type MatrixTypeCleaned; + + template + static inline void run(Dest& dst, const PermutationType& perm, const ExpressionType& xpr) + { + MatrixType mat(xpr); + const Index n = Side==OnTheLeft ? mat.rows() : mat.cols(); + // FIXME we need an is_same for expression that is not sensitive to constness. For instance + // is_same_xpr, Block >::value should be true. + //if(is_same::value && extract_data(dst) == extract_data(mat)) + if(is_same_dense(dst, mat)) + { + // apply the permutation inplace + Matrix mask(perm.size()); + mask.fill(false); + Index r = 0; + while(r < perm.size()) + { + // search for the next seed + while(r=perm.size()) + break; + // we got one, let's follow it until we are back to the seed + Index k0 = r++; + Index kPrev = k0; + mask.coeffRef(k0) = true; + for(Index k=perm.indices().coeff(k0); k!=k0; k=perm.indices().coeff(k)) + { + Block(dst, k) + .swap(Block + (dst,((Side==OnTheLeft) ^ Transposed) ? k0 : kPrev)); + + mask.coeffRef(k) = true; + kPrev = k; + } + } + } + else + { + for(Index i = 0; i < n; ++i) + { + Block + (dst, ((Side==OnTheLeft) ^ Transposed) ? perm.indices().coeff(i) : i) + + = + + Block + (mat, ((Side==OnTheRight) ^ Transposed) ? perm.indices().coeff(i) : i); + } + } + } +}; + +template +struct generic_product_impl +{ + template + static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) + { + permutation_matrix_product::run(dst, lhs, rhs); + } +}; + +template +struct generic_product_impl +{ + template + static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) + { + permutation_matrix_product::run(dst, rhs, lhs); + } +}; + +template +struct generic_product_impl, Rhs, PermutationShape, MatrixShape, ProductTag> +{ + template + static void evalTo(Dest& dst, const Inverse& lhs, const Rhs& rhs) + { + permutation_matrix_product::run(dst, lhs.nestedExpression(), rhs); + } +}; + +template +struct generic_product_impl, MatrixShape, PermutationShape, ProductTag> +{ + template + static void evalTo(Dest& dst, const Lhs& lhs, const Inverse& rhs) + { + permutation_matrix_product::run(dst, rhs.nestedExpression(), lhs); + } +}; + + +/*************************************************************************** +* Products with transpositions matrices +***************************************************************************/ + +// FIXME could we unify Transpositions and Permutation into a single "shape"?? + +/** \internal + * \class transposition_matrix_product + * Internal helper class implementing the product between a permutation matrix and a matrix. + */ +template +struct transposition_matrix_product +{ + typedef typename nested_eval::type MatrixType; + typedef typename remove_all::type MatrixTypeCleaned; + + template + static inline void run(Dest& dst, const TranspositionType& tr, const ExpressionType& xpr) + { + MatrixType mat(xpr); + typedef typename TranspositionType::StorageIndex StorageIndex; + const Index size = tr.size(); + StorageIndex j = 0; + + if(!is_same_dense(dst,mat)) + dst = mat; + + for(Index k=(Transposed?size-1:0) ; Transposed?k>=0:k +struct generic_product_impl +{ + template + static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) + { + transposition_matrix_product::run(dst, lhs, rhs); + } +}; + +template +struct generic_product_impl +{ + template + static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) + { + transposition_matrix_product::run(dst, rhs, lhs); + } +}; + + +template +struct generic_product_impl, Rhs, TranspositionsShape, MatrixShape, ProductTag> +{ + template + static void evalTo(Dest& dst, const Transpose& lhs, const Rhs& rhs) + { + transposition_matrix_product::run(dst, lhs.nestedExpression(), rhs); + } +}; + +template +struct generic_product_impl, MatrixShape, TranspositionsShape, ProductTag> +{ + template + static void evalTo(Dest& dst, const Lhs& lhs, const Transpose& rhs) + { + transposition_matrix_product::run(dst, rhs.nestedExpression(), lhs); + } +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_PRODUCT_EVALUATORS_H diff --git a/Eigen/src/Core/Random.h b/Eigen/src/Core/Random.h new file mode 100644 index 000000000..486e9ed52 --- /dev/null +++ b/Eigen/src/Core/Random.h @@ -0,0 +1,182 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_RANDOM_H +#define EIGEN_RANDOM_H + +namespace Eigen { + +namespace internal { + +template struct scalar_random_op { + EIGEN_EMPTY_STRUCT_CTOR(scalar_random_op) + inline const Scalar operator() () const { return random(); } +}; + +template +struct functor_traits > +{ enum { Cost = 5 * NumTraits::MulCost, PacketAccess = false, IsRepeatable = false }; }; + +} // end namespace internal + +/** \returns a random matrix expression + * + * Numbers are uniformly spread through their whole definition range for integer types, + * and in the [-1:1] range for floating point scalar types. + * + * The parameters \a rows and \a cols are the number of rows and of columns of + * the returned matrix. Must be compatible with this MatrixBase type. + * + * \not_reentrant + * + * This variant is meant to be used for dynamic-size matrix types. For fixed-size types, + * it is redundant to pass \a rows and \a cols as arguments, so Random() should be used + * instead. + * + * + * Example: \include MatrixBase_random_int_int.cpp + * Output: \verbinclude MatrixBase_random_int_int.out + * + * This expression has the "evaluate before nesting" flag so that it will be evaluated into + * a temporary matrix whenever it is nested in a larger expression. This prevents unexpected + * behavior with expressions involving random matrices. + * + * See DenseBase::NullaryExpr(Index, const CustomNullaryOp&) for an example using C++11 random generators. + * + * \sa DenseBase::setRandom(), DenseBase::Random(Index), DenseBase::Random() + */ +template +inline const typename DenseBase::RandomReturnType +DenseBase::Random(Index rows, Index cols) +{ + return NullaryExpr(rows, cols, internal::scalar_random_op()); +} + +/** \returns a random vector expression + * + * Numbers are uniformly spread through their whole definition range for integer types, + * and in the [-1:1] range for floating point scalar types. + * + * The parameter \a size is the size of the returned vector. + * Must be compatible with this MatrixBase type. + * + * \only_for_vectors + * \not_reentrant + * + * This variant is meant to be used for dynamic-size vector types. For fixed-size types, + * it is redundant to pass \a size as argument, so Random() should be used + * instead. + * + * Example: \include MatrixBase_random_int.cpp + * Output: \verbinclude MatrixBase_random_int.out + * + * This expression has the "evaluate before nesting" flag so that it will be evaluated into + * a temporary vector whenever it is nested in a larger expression. This prevents unexpected + * behavior with expressions involving random matrices. + * + * \sa DenseBase::setRandom(), DenseBase::Random(Index,Index), DenseBase::Random() + */ +template +inline const typename DenseBase::RandomReturnType +DenseBase::Random(Index size) +{ + return NullaryExpr(size, internal::scalar_random_op()); +} + +/** \returns a fixed-size random matrix or vector expression + * + * Numbers are uniformly spread through their whole definition range for integer types, + * and in the [-1:1] range for floating point scalar types. + * + * This variant is only for fixed-size MatrixBase types. For dynamic-size types, you + * need to use the variants taking size arguments. + * + * Example: \include MatrixBase_random.cpp + * Output: \verbinclude MatrixBase_random.out + * + * This expression has the "evaluate before nesting" flag so that it will be evaluated into + * a temporary matrix whenever it is nested in a larger expression. This prevents unexpected + * behavior with expressions involving random matrices. + * + * \not_reentrant + * + * \sa DenseBase::setRandom(), DenseBase::Random(Index,Index), DenseBase::Random(Index) + */ +template +inline const typename DenseBase::RandomReturnType +DenseBase::Random() +{ + return NullaryExpr(RowsAtCompileTime, ColsAtCompileTime, internal::scalar_random_op()); +} + +/** Sets all coefficients in this expression to random values. + * + * Numbers are uniformly spread through their whole definition range for integer types, + * and in the [-1:1] range for floating point scalar types. + * + * \not_reentrant + * + * Example: \include MatrixBase_setRandom.cpp + * Output: \verbinclude MatrixBase_setRandom.out + * + * \sa class CwiseNullaryOp, setRandom(Index), setRandom(Index,Index) + */ +template +EIGEN_DEVICE_FUNC inline Derived& DenseBase::setRandom() +{ + return *this = Random(rows(), cols()); +} + +/** Resizes to the given \a newSize, and sets all coefficients in this expression to random values. + * + * Numbers are uniformly spread through their whole definition range for integer types, + * and in the [-1:1] range for floating point scalar types. + * + * \only_for_vectors + * \not_reentrant + * + * Example: \include Matrix_setRandom_int.cpp + * Output: \verbinclude Matrix_setRandom_int.out + * + * \sa DenseBase::setRandom(), setRandom(Index,Index), class CwiseNullaryOp, DenseBase::Random() + */ +template +EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setRandom(Index newSize) +{ + resize(newSize); + return setRandom(); +} + +/** Resizes to the given size, and sets all coefficients in this expression to random values. + * + * Numbers are uniformly spread through their whole definition range for integer types, + * and in the [-1:1] range for floating point scalar types. + * + * \not_reentrant + * + * \param rows the new number of rows + * \param cols the new number of columns + * + * Example: \include Matrix_setRandom_int_int.cpp + * Output: \verbinclude Matrix_setRandom_int_int.out + * + * \sa DenseBase::setRandom(), setRandom(Index), class CwiseNullaryOp, DenseBase::Random() + */ +template +EIGEN_STRONG_INLINE Derived& +PlainObjectBase::setRandom(Index rows, Index cols) +{ + resize(rows, cols); + return setRandom(); +} + +} // end namespace Eigen + +#endif // EIGEN_RANDOM_H diff --git a/Eigen/src/Core/Redux.h b/Eigen/src/Core/Redux.h new file mode 100644 index 000000000..2b5b73bf7 --- /dev/null +++ b/Eigen/src/Core/Redux.h @@ -0,0 +1,505 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008 Gael Guennebaud +// Copyright (C) 2006-2008 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_REDUX_H +#define EIGEN_REDUX_H + +namespace Eigen { + +namespace internal { + +// TODO +// * implement other kind of vectorization +// * factorize code + +/*************************************************************************** +* Part 1 : the logic deciding a strategy for vectorization and unrolling +***************************************************************************/ + +template +struct redux_traits +{ +public: + typedef typename find_best_packet::type PacketType; + enum { + PacketSize = unpacket_traits::size, + InnerMaxSize = int(Derived::IsRowMajor) + ? Derived::MaxColsAtCompileTime + : Derived::MaxRowsAtCompileTime + }; + + enum { + MightVectorize = (int(Derived::Flags)&ActualPacketAccessBit) + && (functor_traits::PacketAccess), + MayLinearVectorize = bool(MightVectorize) && (int(Derived::Flags)&LinearAccessBit), + MaySliceVectorize = bool(MightVectorize) && int(InnerMaxSize)>=3*PacketSize + }; + +public: + enum { + Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal) + : int(MaySliceVectorize) ? int(SliceVectorizedTraversal) + : int(DefaultTraversal) + }; + +public: + enum { + Cost = Derived::SizeAtCompileTime == Dynamic ? HugeCost + : Derived::SizeAtCompileTime * Derived::CoeffReadCost + (Derived::SizeAtCompileTime-1) * functor_traits::Cost, + UnrollingLimit = EIGEN_UNROLLING_LIMIT * (int(Traversal) == int(DefaultTraversal) ? 1 : int(PacketSize)) + }; + +public: + enum { + Unrolling = Cost <= UnrollingLimit ? CompleteUnrolling : NoUnrolling + }; + +#ifdef EIGEN_DEBUG_ASSIGN + static void debug() + { + std::cerr << "Xpr: " << typeid(typename Derived::XprType).name() << std::endl; + std::cerr.setf(std::ios::hex, std::ios::basefield); + EIGEN_DEBUG_VAR(Derived::Flags) + std::cerr.unsetf(std::ios::hex); + EIGEN_DEBUG_VAR(InnerMaxSize) + EIGEN_DEBUG_VAR(PacketSize) + EIGEN_DEBUG_VAR(MightVectorize) + EIGEN_DEBUG_VAR(MayLinearVectorize) + EIGEN_DEBUG_VAR(MaySliceVectorize) + EIGEN_DEBUG_VAR(Traversal) + EIGEN_DEBUG_VAR(UnrollingLimit) + EIGEN_DEBUG_VAR(Unrolling) + std::cerr << std::endl; + } +#endif +}; + +/*************************************************************************** +* Part 2 : unrollers +***************************************************************************/ + +/*** no vectorization ***/ + +template +struct redux_novec_unroller +{ + enum { + HalfLength = Length/2 + }; + + typedef typename Derived::Scalar Scalar; + + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE Scalar run(const Derived &mat, const Func& func) + { + return func(redux_novec_unroller::run(mat,func), + redux_novec_unroller::run(mat,func)); + } +}; + +template +struct redux_novec_unroller +{ + enum { + outer = Start / Derived::InnerSizeAtCompileTime, + inner = Start % Derived::InnerSizeAtCompileTime + }; + + typedef typename Derived::Scalar Scalar; + + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE Scalar run(const Derived &mat, const Func&) + { + return mat.coeffByOuterInner(outer, inner); + } +}; + +// This is actually dead code and will never be called. It is required +// to prevent false warnings regarding failed inlining though +// for 0 length run() will never be called at all. +template +struct redux_novec_unroller +{ + typedef typename Derived::Scalar Scalar; + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE Scalar run(const Derived&, const Func&) { return Scalar(); } +}; + +/*** vectorization ***/ + +template +struct redux_vec_unroller +{ + enum { + PacketSize = redux_traits::PacketSize, + HalfLength = Length/2 + }; + + typedef typename Derived::Scalar Scalar; + typedef typename redux_traits::PacketType PacketScalar; + + static EIGEN_STRONG_INLINE PacketScalar run(const Derived &mat, const Func& func) + { + return func.packetOp( + redux_vec_unroller::run(mat,func), + redux_vec_unroller::run(mat,func) ); + } +}; + +template +struct redux_vec_unroller +{ + enum { + index = Start * redux_traits::PacketSize, + outer = index / int(Derived::InnerSizeAtCompileTime), + inner = index % int(Derived::InnerSizeAtCompileTime), + alignment = Derived::Alignment + }; + + typedef typename Derived::Scalar Scalar; + typedef typename redux_traits::PacketType PacketScalar; + + static EIGEN_STRONG_INLINE PacketScalar run(const Derived &mat, const Func&) + { + return mat.template packetByOuterInner(outer, inner); + } +}; + +/*************************************************************************** +* Part 3 : implementation of all cases +***************************************************************************/ + +template::Traversal, + int Unrolling = redux_traits::Unrolling +> +struct redux_impl; + +template +struct redux_impl +{ + typedef typename Derived::Scalar Scalar; + EIGEN_DEVICE_FUNC + static EIGEN_STRONG_INLINE Scalar run(const Derived &mat, const Func& func) + { + eigen_assert(mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix"); + Scalar res; + res = mat.coeffByOuterInner(0, 0); + for(Index i = 1; i < mat.innerSize(); ++i) + res = func(res, mat.coeffByOuterInner(0, i)); + for(Index i = 1; i < mat.outerSize(); ++i) + for(Index j = 0; j < mat.innerSize(); ++j) + res = func(res, mat.coeffByOuterInner(i, j)); + return res; + } +}; + +template +struct redux_impl + : public redux_novec_unroller +{}; + +template +struct redux_impl +{ + typedef typename Derived::Scalar Scalar; + typedef typename redux_traits::PacketType PacketScalar; + + static Scalar run(const Derived &mat, const Func& func) + { + const Index size = mat.size(); + + const Index packetSize = redux_traits::PacketSize; + const int packetAlignment = unpacket_traits::alignment; + enum { + alignment0 = (bool(Derived::Flags & DirectAccessBit) && bool(packet_traits::AlignedOnScalar)) ? int(packetAlignment) : int(Unaligned), + alignment = EIGEN_PLAIN_ENUM_MAX(alignment0, Derived::Alignment) + }; + const Index alignedStart = internal::first_default_aligned(mat.nestedExpression()); + const Index alignedSize2 = ((size-alignedStart)/(2*packetSize))*(2*packetSize); + const Index alignedSize = ((size-alignedStart)/(packetSize))*(packetSize); + const Index alignedEnd2 = alignedStart + alignedSize2; + const Index alignedEnd = alignedStart + alignedSize; + Scalar res; + if(alignedSize) + { + PacketScalar packet_res0 = mat.template packet(alignedStart); + if(alignedSize>packetSize) // we have at least two packets to partly unroll the loop + { + PacketScalar packet_res1 = mat.template packet(alignedStart+packetSize); + for(Index index = alignedStart + 2*packetSize; index < alignedEnd2; index += 2*packetSize) + { + packet_res0 = func.packetOp(packet_res0, mat.template packet(index)); + packet_res1 = func.packetOp(packet_res1, mat.template packet(index+packetSize)); + } + + packet_res0 = func.packetOp(packet_res0,packet_res1); + if(alignedEnd>alignedEnd2) + packet_res0 = func.packetOp(packet_res0, mat.template packet(alignedEnd2)); + } + res = func.predux(packet_res0); + + for(Index index = 0; index < alignedStart; ++index) + res = func(res,mat.coeff(index)); + + for(Index index = alignedEnd; index < size; ++index) + res = func(res,mat.coeff(index)); + } + else // too small to vectorize anything. + // since this is dynamic-size hence inefficient anyway for such small sizes, don't try to optimize. + { + res = mat.coeff(0); + for(Index index = 1; index < size; ++index) + res = func(res,mat.coeff(index)); + } + + return res; + } +}; + +// NOTE: for SliceVectorizedTraversal we simply bypass unrolling +template +struct redux_impl +{ + typedef typename Derived::Scalar Scalar; + typedef typename redux_traits::PacketType PacketType; + + EIGEN_DEVICE_FUNC static Scalar run(const Derived &mat, const Func& func) + { + eigen_assert(mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix"); + const Index innerSize = mat.innerSize(); + const Index outerSize = mat.outerSize(); + enum { + packetSize = redux_traits::PacketSize + }; + const Index packetedInnerSize = ((innerSize)/packetSize)*packetSize; + Scalar res; + if(packetedInnerSize) + { + PacketType packet_res = mat.template packet(0,0); + for(Index j=0; j(j,i)); + + res = func.predux(packet_res); + for(Index j=0; j::run(mat, func); + } + + return res; + } +}; + +template +struct redux_impl +{ + typedef typename Derived::Scalar Scalar; + + typedef typename redux_traits::PacketType PacketScalar; + enum { + PacketSize = redux_traits::PacketSize, + Size = Derived::SizeAtCompileTime, + VectorizedSize = (Size / PacketSize) * PacketSize + }; + EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Scalar run(const Derived &mat, const Func& func) + { + eigen_assert(mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix"); + if (VectorizedSize > 0) { + Scalar res = func.predux(redux_vec_unroller::run(mat,func)); + if (VectorizedSize != Size) + res = func(res,redux_novec_unroller::run(mat,func)); + return res; + } + else { + return redux_novec_unroller::run(mat,func); + } + } +}; + +// evaluator adaptor +template +class redux_evaluator +{ +public: + typedef _XprType XprType; + EIGEN_DEVICE_FUNC explicit redux_evaluator(const XprType &xpr) : m_evaluator(xpr), m_xpr(xpr) {} + + typedef typename XprType::Scalar Scalar; + typedef typename XprType::CoeffReturnType CoeffReturnType; + typedef typename XprType::PacketScalar PacketScalar; + typedef typename XprType::PacketReturnType PacketReturnType; + + enum { + MaxRowsAtCompileTime = XprType::MaxRowsAtCompileTime, + MaxColsAtCompileTime = XprType::MaxColsAtCompileTime, + // TODO we should not remove DirectAccessBit and rather find an elegant way to query the alignment offset at runtime from the evaluator + Flags = evaluator::Flags & ~DirectAccessBit, + IsRowMajor = XprType::IsRowMajor, + SizeAtCompileTime = XprType::SizeAtCompileTime, + InnerSizeAtCompileTime = XprType::InnerSizeAtCompileTime, + CoeffReadCost = evaluator::CoeffReadCost, + Alignment = evaluator::Alignment + }; + + EIGEN_DEVICE_FUNC Index rows() const { return m_xpr.rows(); } + EIGEN_DEVICE_FUNC Index cols() const { return m_xpr.cols(); } + EIGEN_DEVICE_FUNC Index size() const { return m_xpr.size(); } + EIGEN_DEVICE_FUNC Index innerSize() const { return m_xpr.innerSize(); } + EIGEN_DEVICE_FUNC Index outerSize() const { return m_xpr.outerSize(); } + + EIGEN_DEVICE_FUNC + CoeffReturnType coeff(Index row, Index col) const + { return m_evaluator.coeff(row, col); } + + EIGEN_DEVICE_FUNC + CoeffReturnType coeff(Index index) const + { return m_evaluator.coeff(index); } + + template + PacketType packet(Index row, Index col) const + { return m_evaluator.template packet(row, col); } + + template + PacketType packet(Index index) const + { return m_evaluator.template packet(index); } + + EIGEN_DEVICE_FUNC + CoeffReturnType coeffByOuterInner(Index outer, Index inner) const + { return m_evaluator.coeff(IsRowMajor ? outer : inner, IsRowMajor ? inner : outer); } + + template + PacketType packetByOuterInner(Index outer, Index inner) const + { return m_evaluator.template packet(IsRowMajor ? outer : inner, IsRowMajor ? inner : outer); } + + const XprType & nestedExpression() const { return m_xpr; } + +protected: + internal::evaluator m_evaluator; + const XprType &m_xpr; +}; + +} // end namespace internal + +/*************************************************************************** +* Part 4 : public API +***************************************************************************/ + + +/** \returns the result of a full redux operation on the whole matrix or vector using \a func + * + * The template parameter \a BinaryOp is the type of the functor \a func which must be + * an associative operator. Both current C++98 and C++11 functor styles are handled. + * + * \sa DenseBase::sum(), DenseBase::minCoeff(), DenseBase::maxCoeff(), MatrixBase::colwise(), MatrixBase::rowwise() + */ +template +template +EIGEN_DEVICE_FUNC typename internal::traits::Scalar +DenseBase::redux(const Func& func) const +{ + eigen_assert(this->rows()>0 && this->cols()>0 && "you are using an empty matrix"); + + typedef typename internal::redux_evaluator ThisEvaluator; + ThisEvaluator thisEval(derived()); + + return internal::redux_impl::run(thisEval, func); +} + +/** \returns the minimum of all coefficients of \c *this. + * \warning the result is undefined if \c *this contains NaN. + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::traits::Scalar +DenseBase::minCoeff() const +{ + return derived().redux(Eigen::internal::scalar_min_op()); +} + +/** \returns the maximum of all coefficients of \c *this. + * \warning the result is undefined if \c *this contains NaN. + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::traits::Scalar +DenseBase::maxCoeff() const +{ + return derived().redux(Eigen::internal::scalar_max_op()); +} + +/** \returns the sum of all coefficients of \c *this + * + * If \c *this is empty, then the value 0 is returned. + * + * \sa trace(), prod(), mean() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::traits::Scalar +DenseBase::sum() const +{ + if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0)) + return Scalar(0); + return derived().redux(Eigen::internal::scalar_sum_op()); +} + +/** \returns the mean of all coefficients of *this +* +* \sa trace(), prod(), sum() +*/ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::traits::Scalar +DenseBase::mean() const +{ +#ifdef __INTEL_COMPILER + #pragma warning push + #pragma warning ( disable : 2259 ) +#endif + return Scalar(derived().redux(Eigen::internal::scalar_sum_op())) / Scalar(this->size()); +#ifdef __INTEL_COMPILER + #pragma warning pop +#endif +} + +/** \returns the product of all coefficients of *this + * + * Example: \include MatrixBase_prod.cpp + * Output: \verbinclude MatrixBase_prod.out + * + * \sa sum(), mean(), trace() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::traits::Scalar +DenseBase::prod() const +{ + if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0)) + return Scalar(1); + return derived().redux(Eigen::internal::scalar_product_op()); +} + +/** \returns the trace of \c *this, i.e. the sum of the coefficients on the main diagonal. + * + * \c *this can be any matrix, not necessarily square. + * + * \sa diagonal(), sum() + */ +template +EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::traits::Scalar +MatrixBase::trace() const +{ + return derived().diagonal().sum(); +} + +} // end namespace Eigen + +#endif // EIGEN_REDUX_H diff --git a/Eigen/src/Core/Ref.h b/Eigen/src/Core/Ref.h new file mode 100644 index 000000000..ac9502bc4 --- /dev/null +++ b/Eigen/src/Core/Ref.h @@ -0,0 +1,285 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2012 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_REF_H +#define EIGEN_REF_H + +namespace Eigen { + +namespace internal { + +template +struct traits > + : public traits > +{ + typedef _PlainObjectType PlainObjectType; + typedef _StrideType StrideType; + enum { + Options = _Options, + Flags = traits >::Flags | NestByRefBit, + Alignment = traits >::Alignment + }; + + template struct match { + enum { + HasDirectAccess = internal::has_direct_access::ret, + StorageOrderMatch = PlainObjectType::IsVectorAtCompileTime || Derived::IsVectorAtCompileTime || ((PlainObjectType::Flags&RowMajorBit)==(Derived::Flags&RowMajorBit)), + InnerStrideMatch = int(StrideType::InnerStrideAtCompileTime)==int(Dynamic) + || int(StrideType::InnerStrideAtCompileTime)==int(Derived::InnerStrideAtCompileTime) + || (int(StrideType::InnerStrideAtCompileTime)==0 && int(Derived::InnerStrideAtCompileTime)==1), + OuterStrideMatch = Derived::IsVectorAtCompileTime + || int(StrideType::OuterStrideAtCompileTime)==int(Dynamic) || int(StrideType::OuterStrideAtCompileTime)==int(Derived::OuterStrideAtCompileTime), + // NOTE, this indirection of evaluator::Alignment is needed + // to workaround a very strange bug in MSVC related to the instantiation + // of has_*ary_operator in evaluator. + // This line is surprisingly very sensitive. For instance, simply adding parenthesis + // as "DerivedAlignment = (int(evaluator::Alignment))," will make MSVC fail... + DerivedAlignment = int(evaluator::Alignment), + AlignmentMatch = (int(traits::Alignment)==int(Unaligned)) || (DerivedAlignment >= int(Alignment)), // FIXME the first condition is not very clear, it should be replaced by the required alignment + ScalarTypeMatch = internal::is_same::value, + MatchAtCompileTime = HasDirectAccess && StorageOrderMatch && InnerStrideMatch && OuterStrideMatch && AlignmentMatch && ScalarTypeMatch + }; + typedef typename internal::conditional::type type; + }; + +}; + +template +struct traits > : public traits {}; + +} + +template class RefBase + : public MapBase +{ + typedef typename internal::traits::PlainObjectType PlainObjectType; + typedef typename internal::traits::StrideType StrideType; + +public: + + typedef MapBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(RefBase) + + EIGEN_DEVICE_FUNC inline Index innerStride() const + { + return StrideType::InnerStrideAtCompileTime != 0 ? m_stride.inner() : 1; + } + + EIGEN_DEVICE_FUNC inline Index outerStride() const + { + return StrideType::OuterStrideAtCompileTime != 0 ? m_stride.outer() + : IsVectorAtCompileTime ? this->size() + : int(Flags)&RowMajorBit ? this->cols() + : this->rows(); + } + + EIGEN_DEVICE_FUNC RefBase() + : Base(0,RowsAtCompileTime==Dynamic?0:RowsAtCompileTime,ColsAtCompileTime==Dynamic?0:ColsAtCompileTime), + // Stride<> does not allow default ctor for Dynamic strides, so let' initialize it with dummy values: + m_stride(StrideType::OuterStrideAtCompileTime==Dynamic?0:StrideType::OuterStrideAtCompileTime, + StrideType::InnerStrideAtCompileTime==Dynamic?0:StrideType::InnerStrideAtCompileTime) + {} + + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(RefBase) + +protected: + + typedef Stride StrideBase; + + template + EIGEN_DEVICE_FUNC void construct(Expression& expr) + { + EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(PlainObjectType,Expression); + + if(PlainObjectType::RowsAtCompileTime==1) + { + eigen_assert(expr.rows()==1 || expr.cols()==1); + ::new (static_cast(this)) Base(expr.data(), 1, expr.size()); + } + else if(PlainObjectType::ColsAtCompileTime==1) + { + eigen_assert(expr.rows()==1 || expr.cols()==1); + ::new (static_cast(this)) Base(expr.data(), expr.size(), 1); + } + else + ::new (static_cast(this)) Base(expr.data(), expr.rows(), expr.cols()); + + if(Expression::IsVectorAtCompileTime && (!PlainObjectType::IsVectorAtCompileTime) && ((Expression::Flags&RowMajorBit)!=(PlainObjectType::Flags&RowMajorBit))) + ::new (&m_stride) StrideBase(expr.innerStride(), StrideType::InnerStrideAtCompileTime==0?0:1); + else + ::new (&m_stride) StrideBase(StrideType::OuterStrideAtCompileTime==0?0:expr.outerStride(), + StrideType::InnerStrideAtCompileTime==0?0:expr.innerStride()); + } + + StrideBase m_stride; +}; + +/** \class Ref + * \ingroup Core_Module + * + * \brief A matrix or vector expression mapping an existing expression + * + * \tparam PlainObjectType the equivalent matrix type of the mapped data + * \tparam Options specifies the pointer alignment in bytes. It can be: \c #Aligned128, , \c #Aligned64, \c #Aligned32, \c #Aligned16, \c #Aligned8 or \c #Unaligned. + * The default is \c #Unaligned. + * \tparam StrideType optionally specifies strides. By default, Ref implies a contiguous storage along the inner dimension (inner stride==1), + * but accepts a variable outer stride (leading dimension). + * This can be overridden by specifying strides. + * The type passed here must be a specialization of the Stride template, see examples below. + * + * This class provides a way to write non-template functions taking Eigen objects as parameters while limiting the number of copies. + * A Ref<> object can represent either a const expression or a l-value: + * \code + * // in-out argument: + * void foo1(Ref x); + * + * // read-only const argument: + * void foo2(const Ref& x); + * \endcode + * + * In the in-out case, the input argument must satisfy the constraints of the actual Ref<> type, otherwise a compilation issue will be triggered. + * By default, a Ref can reference any dense vector expression of float having a contiguous memory layout. + * Likewise, a Ref can reference any column-major dense matrix expression of float whose column's elements are contiguously stored with + * the possibility to have a constant space in-between each column, i.e. the inner stride must be equal to 1, but the outer stride (or leading dimension) + * can be greater than the number of rows. + * + * In the const case, if the input expression does not match the above requirement, then it is evaluated into a temporary before being passed to the function. + * Here are some examples: + * \code + * MatrixXf A; + * VectorXf a; + * foo1(a.head()); // OK + * foo1(A.col()); // OK + * foo1(A.row()); // Compilation error because here innerstride!=1 + * foo2(A.row()); // Compilation error because A.row() is a 1xN object while foo2 is expecting a Nx1 object + * foo2(A.row().transpose()); // The row is copied into a contiguous temporary + * foo2(2*a); // The expression is evaluated into a temporary + * foo2(A.col().segment(2,4)); // No temporary + * \endcode + * + * The range of inputs that can be referenced without temporary can be enlarged using the last two template parameters. + * Here is an example accepting an innerstride!=1: + * \code + * // in-out argument: + * void foo3(Ref > x); + * foo3(A.row()); // OK + * \endcode + * The downside here is that the function foo3 might be significantly slower than foo1 because it won't be able to exploit vectorization, and will involve more + * expensive address computations even if the input is contiguously stored in memory. To overcome this issue, one might propose to overload internally calling a + * template function, e.g.: + * \code + * // in the .h: + * void foo(const Ref& A); + * void foo(const Ref >& A); + * + * // in the .cpp: + * template void foo_impl(const TypeOfA& A) { + * ... // crazy code goes here + * } + * void foo(const Ref& A) { foo_impl(A); } + * void foo(const Ref >& A) { foo_impl(A); } + * \endcode + * + * See also the following stackoverflow questions for further references: + * - Correct usage of the Eigen::Ref<> class + * + * \sa PlainObjectBase::Map(), \ref TopicStorageOrders + */ +template class Ref + : public RefBase > +{ + private: + typedef internal::traits Traits; + template + EIGEN_DEVICE_FUNC inline Ref(const PlainObjectBase& expr, + typename internal::enable_if::MatchAtCompileTime),Derived>::type* = 0); + public: + + typedef RefBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Ref) + + + #ifndef EIGEN_PARSED_BY_DOXYGEN + template + EIGEN_DEVICE_FUNC inline Ref(PlainObjectBase& expr, + typename internal::enable_if::MatchAtCompileTime),Derived>::type* = 0) + { + EIGEN_STATIC_ASSERT(bool(Traits::template match::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); + Base::construct(expr.derived()); + } + template + EIGEN_DEVICE_FUNC inline Ref(const DenseBase& expr, + typename internal::enable_if::MatchAtCompileTime),Derived>::type* = 0) + #else + /** Implicit constructor from any dense expression */ + template + inline Ref(DenseBase& expr) + #endif + { + EIGEN_STATIC_ASSERT(bool(internal::is_lvalue::value), THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY); + EIGEN_STATIC_ASSERT(bool(Traits::template match::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); + EIGEN_STATIC_ASSERT(!Derived::IsPlainObjectBase,THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY); + Base::construct(expr.const_cast_derived()); + } + + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Ref) + +}; + +// this is the const ref version +template class Ref + : public RefBase > +{ + typedef internal::traits Traits; + public: + + typedef RefBase Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Ref) + + template + EIGEN_DEVICE_FUNC inline Ref(const DenseBase& expr, + typename internal::enable_if::ScalarTypeMatch),Derived>::type* = 0) + { +// std::cout << match_helper::HasDirectAccess << "," << match_helper::OuterStrideMatch << "," << match_helper::InnerStrideMatch << "\n"; +// std::cout << int(StrideType::OuterStrideAtCompileTime) << " - " << int(Derived::OuterStrideAtCompileTime) << "\n"; +// std::cout << int(StrideType::InnerStrideAtCompileTime) << " - " << int(Derived::InnerStrideAtCompileTime) << "\n"; + construct(expr.derived(), typename Traits::template match::type()); + } + + EIGEN_DEVICE_FUNC inline Ref(const Ref& other) : Base(other) { + // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy + } + + template + EIGEN_DEVICE_FUNC inline Ref(const RefBase& other) { + construct(other.derived(), typename Traits::template match::type()); + } + + protected: + + template + EIGEN_DEVICE_FUNC void construct(const Expression& expr,internal::true_type) + { + Base::construct(expr); + } + + template + EIGEN_DEVICE_FUNC void construct(const Expression& expr, internal::false_type) + { + internal::call_assignment_no_alias(m_object,expr,internal::assign_op()); + Base::construct(m_object); + } + + protected: + TPlainObjectType m_object; +}; + +} // end namespace Eigen + +#endif // EIGEN_REF_H diff --git a/Eigen/src/Core/Replicate.h b/Eigen/src/Core/Replicate.h new file mode 100644 index 000000000..0b2d6d743 --- /dev/null +++ b/Eigen/src/Core/Replicate.h @@ -0,0 +1,142 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_REPLICATE_H +#define EIGEN_REPLICATE_H + +namespace Eigen { + +namespace internal { +template +struct traits > + : traits +{ + typedef typename MatrixType::Scalar Scalar; + typedef typename traits::StorageKind StorageKind; + typedef typename traits::XprKind XprKind; + typedef typename ref_selector::type MatrixTypeNested; + typedef typename remove_reference::type _MatrixTypeNested; + enum { + RowsAtCompileTime = RowFactor==Dynamic || int(MatrixType::RowsAtCompileTime)==Dynamic + ? Dynamic + : RowFactor * MatrixType::RowsAtCompileTime, + ColsAtCompileTime = ColFactor==Dynamic || int(MatrixType::ColsAtCompileTime)==Dynamic + ? Dynamic + : ColFactor * MatrixType::ColsAtCompileTime, + //FIXME we don't propagate the max sizes !!! + MaxRowsAtCompileTime = RowsAtCompileTime, + MaxColsAtCompileTime = ColsAtCompileTime, + IsRowMajor = MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1 ? 1 + : MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1 ? 0 + : (MatrixType::Flags & RowMajorBit) ? 1 : 0, + + // FIXME enable DirectAccess with negative strides? + Flags = IsRowMajor ? RowMajorBit : 0 + }; +}; +} + +/** + * \class Replicate + * \ingroup Core_Module + * + * \brief Expression of the multiple replication of a matrix or vector + * + * \tparam MatrixType the type of the object we are replicating + * \tparam RowFactor number of repetitions at compile time along the vertical direction, can be Dynamic. + * \tparam ColFactor number of repetitions at compile time along the horizontal direction, can be Dynamic. + * + * This class represents an expression of the multiple replication of a matrix or vector. + * It is the return type of DenseBase::replicate() and most of the time + * this is the only way it is used. + * + * \sa DenseBase::replicate() + */ +template class Replicate + : public internal::dense_xpr_base< Replicate >::type +{ + typedef typename internal::traits::MatrixTypeNested MatrixTypeNested; + typedef typename internal::traits::_MatrixTypeNested _MatrixTypeNested; + public: + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Replicate) + typedef typename internal::remove_all::type NestedExpression; + + template + EIGEN_DEVICE_FUNC + inline explicit Replicate(const OriginalMatrixType& matrix) + : m_matrix(matrix), m_rowFactor(RowFactor), m_colFactor(ColFactor) + { + EIGEN_STATIC_ASSERT((internal::is_same::type,OriginalMatrixType>::value), + THE_MATRIX_OR_EXPRESSION_THAT_YOU_PASSED_DOES_NOT_HAVE_THE_EXPECTED_TYPE) + eigen_assert(RowFactor!=Dynamic && ColFactor!=Dynamic); + } + + template + EIGEN_DEVICE_FUNC + inline Replicate(const OriginalMatrixType& matrix, Index rowFactor, Index colFactor) + : m_matrix(matrix), m_rowFactor(rowFactor), m_colFactor(colFactor) + { + EIGEN_STATIC_ASSERT((internal::is_same::type,OriginalMatrixType>::value), + THE_MATRIX_OR_EXPRESSION_THAT_YOU_PASSED_DOES_NOT_HAVE_THE_EXPECTED_TYPE) + } + + EIGEN_DEVICE_FUNC + inline Index rows() const { return m_matrix.rows() * m_rowFactor.value(); } + EIGEN_DEVICE_FUNC + inline Index cols() const { return m_matrix.cols() * m_colFactor.value(); } + + EIGEN_DEVICE_FUNC + const _MatrixTypeNested& nestedExpression() const + { + return m_matrix; + } + + protected: + MatrixTypeNested m_matrix; + const internal::variable_if_dynamic m_rowFactor; + const internal::variable_if_dynamic m_colFactor; +}; + +/** + * \return an expression of the replication of \c *this + * + * Example: \include MatrixBase_replicate.cpp + * Output: \verbinclude MatrixBase_replicate.out + * + * \sa VectorwiseOp::replicate(), DenseBase::replicate(Index,Index), class Replicate + */ +template +template +EIGEN_DEVICE_FUNC const Replicate +DenseBase::replicate() const +{ + return Replicate(derived()); +} + +/** + * \return an expression of the replication of each column (or row) of \c *this + * + * Example: \include DirectionWise_replicate_int.cpp + * Output: \verbinclude DirectionWise_replicate_int.out + * + * \sa VectorwiseOp::replicate(), DenseBase::replicate(), class Replicate + */ +template +EIGEN_DEVICE_FUNC const typename VectorwiseOp::ReplicateReturnType +VectorwiseOp::replicate(Index factor) const +{ + return typename VectorwiseOp::ReplicateReturnType + (_expression(),Direction==Vertical?factor:1,Direction==Horizontal?factor:1); +} + +} // end namespace Eigen + +#endif // EIGEN_REPLICATE_H diff --git a/Eigen/src/Core/ReturnByValue.h b/Eigen/src/Core/ReturnByValue.h new file mode 100644 index 000000000..11dc86d07 --- /dev/null +++ b/Eigen/src/Core/ReturnByValue.h @@ -0,0 +1,117 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2009-2010 Gael Guennebaud +// Copyright (C) 2009-2010 Benoit Jacob +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_RETURNBYVALUE_H +#define EIGEN_RETURNBYVALUE_H + +namespace Eigen { + +namespace internal { + +template +struct traits > + : public traits::ReturnType> +{ + enum { + // We're disabling the DirectAccess because e.g. the constructor of + // the Block-with-DirectAccess expression requires to have a coeffRef method. + // Also, we don't want to have to implement the stride stuff. + Flags = (traits::ReturnType>::Flags + | EvalBeforeNestingBit) & ~DirectAccessBit + }; +}; + +/* The ReturnByValue object doesn't even have a coeff() method. + * So the only way that nesting it in an expression can work, is by evaluating it into a plain matrix. + * So internal::nested always gives the plain return matrix type. + * + * FIXME: I don't understand why we need this specialization: isn't this taken care of by the EvalBeforeNestingBit ?? + * Answer: EvalBeforeNestingBit should be deprecated since we have the evaluators + */ +template +struct nested_eval, n, PlainObject> +{ + typedef typename traits::ReturnType type; +}; + +} // end namespace internal + +/** \class ReturnByValue + * \ingroup Core_Module + * + */ +template class ReturnByValue + : public internal::dense_xpr_base< ReturnByValue >::type, internal::no_assignment_operator +{ + public: + typedef typename internal::traits::ReturnType ReturnType; + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(ReturnByValue) + + template + EIGEN_DEVICE_FUNC + inline void evalTo(Dest& dst) const + { static_cast(this)->evalTo(dst); } + EIGEN_DEVICE_FUNC inline Index rows() const { return static_cast(this)->rows(); } + EIGEN_DEVICE_FUNC inline Index cols() const { return static_cast(this)->cols(); } + +#ifndef EIGEN_PARSED_BY_DOXYGEN +#define Unusable YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT + class Unusable{ + Unusable(const Unusable&) {} + Unusable& operator=(const Unusable&) {return *this;} + }; + const Unusable& coeff(Index) const { return *reinterpret_cast(this); } + const Unusable& coeff(Index,Index) const { return *reinterpret_cast(this); } + Unusable& coeffRef(Index) { return *reinterpret_cast(this); } + Unusable& coeffRef(Index,Index) { return *reinterpret_cast(this); } +#undef Unusable +#endif +}; + +template +template +EIGEN_DEVICE_FUNC Derived& DenseBase::operator=(const ReturnByValue& other) +{ + other.evalTo(derived()); + return derived(); +} + +namespace internal { + +// Expression is evaluated in a temporary; default implementation of Assignment is bypassed so that +// when a ReturnByValue expression is assigned, the evaluator is not constructed. +// TODO: Finalize port to new regime; ReturnByValue should not exist in the expression world + +template +struct evaluator > + : public evaluator::ReturnType> +{ + typedef ReturnByValue XprType; + typedef typename internal::traits::ReturnType PlainObject; + typedef evaluator Base; + + EIGEN_DEVICE_FUNC explicit evaluator(const XprType& xpr) + : m_result(xpr.rows(), xpr.cols()) + { + ::new (static_cast(this)) Base(m_result); + xpr.evalTo(m_result); + } + +protected: + PlainObject m_result; +}; + +} // end namespace internal + +} // end namespace Eigen + +#endif // EIGEN_RETURNBYVALUE_H diff --git a/Eigen/src/Core/Reverse.h b/Eigen/src/Core/Reverse.h new file mode 100644 index 000000000..8b6b3ab03 --- /dev/null +++ b/Eigen/src/Core/Reverse.h @@ -0,0 +1,211 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2006-2008 Benoit Jacob +// Copyright (C) 2009 Ricard Marxer +// Copyright (C) 2009-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_REVERSE_H +#define EIGEN_REVERSE_H + +namespace Eigen { + +namespace internal { + +template +struct traits > + : traits +{ + typedef typename MatrixType::Scalar Scalar; + typedef typename traits::StorageKind StorageKind; + typedef typename traits::XprKind XprKind; + typedef typename ref_selector::type MatrixTypeNested; + typedef typename remove_reference::type _MatrixTypeNested; + enum { + RowsAtCompileTime = MatrixType::RowsAtCompileTime, + ColsAtCompileTime = MatrixType::ColsAtCompileTime, + MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, + MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, + Flags = _MatrixTypeNested::Flags & (RowMajorBit | LvalueBit) + }; +}; + +template struct reverse_packet_cond +{ + static inline PacketType run(const PacketType& x) { return preverse(x); } +}; + +template struct reverse_packet_cond +{ + static inline PacketType run(const PacketType& x) { return x; } +}; + +} // end namespace internal + +/** \class Reverse + * \ingroup Core_Module + * + * \brief Expression of the reverse of a vector or matrix + * + * \tparam MatrixType the type of the object of which we are taking the reverse + * \tparam Direction defines the direction of the reverse operation, can be Vertical, Horizontal, or BothDirections + * + * This class represents an expression of the reverse of a vector. + * It is the return type of MatrixBase::reverse() and VectorwiseOp::reverse() + * and most of the time this is the only way it is used. + * + * \sa MatrixBase::reverse(), VectorwiseOp::reverse() + */ +template class Reverse + : public internal::dense_xpr_base< Reverse >::type +{ + public: + + typedef typename internal::dense_xpr_base::type Base; + EIGEN_DENSE_PUBLIC_INTERFACE(Reverse) + typedef typename internal::remove_all::type NestedExpression; + using Base::IsRowMajor; + + protected: + enum { + PacketSize = internal::packet_traits::size, + IsColMajor = !IsRowMajor, + ReverseRow = (Direction == Vertical) || (Direction == BothDirections), + ReverseCol = (Direction == Horizontal) || (Direction == BothDirections), + OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1, + OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1, + ReversePacket = (Direction == BothDirections) + || ((Direction == Vertical) && IsColMajor) + || ((Direction == Horizontal) && IsRowMajor) + }; + typedef internal::reverse_packet_cond reverse_packet; + public: + + EIGEN_DEVICE_FUNC explicit inline Reverse(const MatrixType& matrix) : m_matrix(matrix) { } + + EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Reverse) + + EIGEN_DEVICE_FUNC inline Index rows() const { return m_matrix.rows(); } + EIGEN_DEVICE_FUNC inline Index cols() const { return m_matrix.cols(); } + + EIGEN_DEVICE_FUNC inline Index innerStride() const + { + return -m_matrix.innerStride(); + } + + EIGEN_DEVICE_FUNC const typename internal::remove_all::type& + nestedExpression() const + { + return m_matrix; + } + + protected: + typename MatrixType::Nested m_matrix; +}; + +/** \returns an expression of the reverse of *this. + * + * Example: \include MatrixBase_reverse.cpp + * Output: \verbinclude MatrixBase_reverse.out + * + */ +template +EIGEN_DEVICE_FUNC inline typename DenseBase::ReverseReturnType +DenseBase::reverse() +{ + return ReverseReturnType(derived()); +} + + +//reverse const overload moved DenseBase.h due to a CUDA compiler bug + +/** This is the "in place" version of reverse: it reverses \c *this. + * + * In most cases it is probably better to simply use the reversed expression + * of a matrix. However, when reversing the matrix data itself is really needed, + * then this "in-place" version is probably the right choice because it provides + * the following additional benefits: + * - less error prone: doing the same operation with .reverse() requires special care: + * \code m = m.reverse().eval(); \endcode + * - this API enables reverse operations without the need for a temporary + * - it allows future optimizations (cache friendliness, etc.) + * + * \sa VectorwiseOp::reverseInPlace(), reverse() */ +template +EIGEN_DEVICE_FUNC inline void DenseBase::reverseInPlace() +{ + if(cols()>rows()) + { + Index half = cols()/2; + leftCols(half).swap(rightCols(half).reverse()); + if((cols()%2)==1) + { + Index half2 = rows()/2; + col(half).head(half2).swap(col(half).tail(half2).reverse()); + } + } + else + { + Index half = rows()/2; + topRows(half).swap(bottomRows(half).reverse()); + if((rows()%2)==1) + { + Index half2 = cols()/2; + row(half).head(half2).swap(row(half).tail(half2).reverse()); + } + } +} + +namespace internal { + +template +struct vectorwise_reverse_inplace_impl; + +template<> +struct vectorwise_reverse_inplace_impl +{ + template + static void run(ExpressionType &xpr) + { + Index half = xpr.rows()/2; + xpr.topRows(half).swap(xpr.bottomRows(half).colwise().reverse()); + } +}; + +template<> +struct vectorwise_reverse_inplace_impl +{ + template + static void run(ExpressionType &xpr) + { + Index half = xpr.cols()/2; + xpr.leftCols(half).swap(xpr.rightCols(half).rowwise().reverse()); + } +}; + +} // end namespace internal + +/** This is the "in place" version of VectorwiseOp::reverse: it reverses each column or row of \c *this. + * + * In most cases it is probably better to simply use the reversed expression + * of a matrix. However, when reversing the matrix data itself is really needed, + * then this "in-place" version is probably the right choice because it provides + * the following additional benefits: + * - less error prone: doing the same operation with .reverse() requires special care: + * \code m = m.reverse().eval(); \endcode + * - this API enables reverse operations without the need for a temporary + * + * \sa DenseBase::reverseInPlace(), reverse() */ +template +EIGEN_DEVICE_FUNC void VectorwiseOp::reverseInPlace() +{ + internal::vectorwise_reverse_inplace_impl::run(_expression().const_cast_derived()); +} + +} // end namespace Eigen + +#endif // EIGEN_REVERSE_H diff --git a/Eigen/src/Core/Select.h b/Eigen/src/Core/Select.h new file mode 100644 index 000000000..79eec1b5b --- /dev/null +++ b/Eigen/src/Core/Select.h @@ -0,0 +1,162 @@ +// This file is part of Eigen, a lightweight C++ template library +// for linear algebra. +// +// Copyright (C) 2008-2010 Gael Guennebaud +// +// This Source Code Form is subject to the terms of the Mozilla +// Public License v. 2.0. If a copy of the MPL was not distributed +// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. + +#ifndef EIGEN_SELECT_H +#define EIGEN_SELECT_H + +namespace Eigen { + +/** \class Select + * \ingroup Core_Module + * + * \brief Expression of a coefficient wise version of the C++ ternary operator ?: + * + * \param ConditionMatrixType the type of the \em condition expression which must be a boolean matrix + * \param ThenMatrixType the type of the \em then expression + * \param ElseMatrixType the type of the \em else expression + * + * This class represents an expression of a coefficient wise version of the C++ ternary operator ?:. + * It is the return type of DenseBase::select() and most of the time this is the only way it is used. + * + * \sa DenseBase::select(const DenseBase&, const DenseBase&) const + */ + +namespace internal { +template +struct traits > + : traits +{ + typedef typename traits::Scalar Scalar; + typedef Dense StorageKind; + typedef typename traits::XprKind XprKind; + typedef typename ConditionMatrixType::Nested ConditionMatrixNested; + typedef typename ThenMatrixType::Nested ThenMatrixNested; + typedef typename ElseMatrixType::Nested ElseMatrixNested; + enum { + RowsAtCompileTime = ConditionMatrixType::RowsAtCompileTime, + ColsAtCompileTime = ConditionMatrixType::ColsAtCompileTime, + MaxRowsAtCompileTime = ConditionMatrixType::MaxRowsAtCompileTime, + MaxColsAtCompileTime = ConditionMatrixType::MaxColsAtCompileTime, + Flags = (unsigned int)ThenMatrixType::Flags & ElseMatrixType::Flags & RowMajorBit + }; +}; +} + +template +class Select : public internal::dense_xpr_base< Select >::type, + internal::no_assignment_operator +{ + public: + + typedef typename internal::dense_xpr_base::type Base; - EIGEN_DENSE_PUBLIC_INTERFACE(Select) - - inline EIGEN_DEVICE_FUNC - Select(const ConditionMatrixType& a_conditionMatrix, - const ThenMatrixType& a_thenMatrix, - const ElseMatrixType& a_elseMatrix) - : m_condition(a_conditionMatrix), m_then(a_thenMatrix), m_else(a_elseMatrix) - { - eigen_assert(m_condition.rows() == m_then.rows() && m_condition.rows() == m_else.rows()); - eigen_assert(m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols()); - } - - inline EIGEN_DEVICE_FUNC Index rows() const { return m_condition.rows(); } - inline EIGEN_DEVICE_FUNC Index cols() const { return m_condition.cols(); } - - inline EIGEN_DEVICE_FUNC - const Scalar coeff(Index i, Index j) const - { - if (m_condition.coeff(i,j)) - return m_then.coeff(i,j); - else - return m_else.coeff(i,j); - } - - inline EIGEN_DEVICE_FUNC - const Scalar coeff(Index i) const - { - if (m_condition.coeff(i)) - return m_then.coeff(i); - else - return m_else.coeff(i); - } - - inline EIGEN_DEVICE_FUNC const ConditionMatrixType& conditionMatrix() const - { - return m_condition; - } - - inline EIGEN_DEVICE_FUNC const ThenMatrixType& thenMatrix() const - { - return m_then; - } - - inline EIGEN_DEVICE_FUNC const ElseMatrixType& elseMatrix() const - { - return m_else; - } - - protected: - typename ConditionMatrixType::Nested m_condition; - typename ThenMatrixType::Nested m_then; - typename ElseMatrixType::Nested m_else; -}; - - -/** \returns a matrix where each coefficient (i,j) is equal to \a thenMatrix(i,j) - * if \c *this(i,j), and \a elseMatrix(i,j) otherwise. - * - * Example: \include MatrixBase_select.cpp - * Output: \verbinclude MatrixBase_select.out - * - * \sa class Select - */ -template -template -inline const Select -DenseBase::select(const DenseBase& thenMatrix, - const DenseBase& elseMatrix) const -{ - return Select(derived(), thenMatrix.derived(), elseMatrix.derived()); -} - -/** Version of DenseBase::select(const DenseBase&, const DenseBase&) with - * the \em else expression being a scalar value. - * - * \sa DenseBase::select(const DenseBase&, const DenseBase&) const, class Select - */ -template -template -inline const Select -DenseBase::select(const DenseBase& thenMatrix, - const typename ThenDerived::Scalar& elseScalar) const -{ - return Select( - derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar)); -} - -/** Version of DenseBase::select(const DenseBase&, const DenseBase&) with - * the \em then expression being a scalar value. - * - * \sa DenseBase::select(const DenseBase&, const DenseBase&) const, class Select - */ -template -template -inline const Select -DenseBase::select(const typename ElseDerived::Scalar& thenScalar, - const DenseBase& elseMatrix) const -{ - return Select( - derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_SELECT_H diff --git a/Eigen/src/Core/SelfAdjointView.h b/Eigen/src/Core/SelfAdjointView.h deleted file mode 100644 index be219726b..000000000 --- a/Eigen/src/Core/SelfAdjointView.h +++ /dev/null @@ -1,352 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFADJOINTMATRIX_H -#define EIGEN_SELFADJOINTMATRIX_H - -namespace Eigen { - -/** \class SelfAdjointView - * \ingroup Core_Module - * - * - * \brief Expression of a selfadjoint matrix from a triangular part of a dense matrix - * - * \param MatrixType the type of the dense matrix storing the coefficients - * \param TriangularPart can be either \c #Lower or \c #Upper - * - * This class is an expression of a sefladjoint matrix from a triangular part of a matrix - * with given dense storage of the coefficients. It is the return type of MatrixBase::selfadjointView() - * and most of the time this is the only way that it is used. - * - * \sa class TriangularBase, MatrixBase::selfadjointView() - */ - -namespace internal { -template -struct traits > : traits -{ - typedef typename ref_selector::non_const_type MatrixTypeNested; - typedef typename remove_all::type MatrixTypeNestedCleaned; - typedef MatrixType ExpressionType; - typedef typename MatrixType::PlainObject FullMatrixType; - enum { - Mode = UpLo | SelfAdjoint, - FlagsLvalueBit = is_lvalue::value ? LvalueBit : 0, - Flags = MatrixTypeNestedCleaned::Flags & (HereditaryBits|FlagsLvalueBit) - & (~(PacketAccessBit | DirectAccessBit | LinearAccessBit)) // FIXME these flags should be preserved - }; -}; -} - - -template class SelfAdjointView - : public TriangularBase > -{ - public: - - typedef _MatrixType MatrixType; - typedef TriangularBase Base; - typedef typename internal::traits::MatrixTypeNested MatrixTypeNested; - typedef typename internal::traits::MatrixTypeNestedCleaned MatrixTypeNestedCleaned; - typedef MatrixTypeNestedCleaned NestedExpression; - - /** \brief The type of coefficients in this matrix */ - typedef typename internal::traits::Scalar Scalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef typename internal::remove_all::type MatrixConjugateReturnType; - - enum { - Mode = internal::traits::Mode, - Flags = internal::traits::Flags, - TransposeMode = ((Mode & Upper) ? Lower : 0) | ((Mode & Lower) ? Upper : 0) - }; - typedef typename MatrixType::PlainObject PlainObject; - - EIGEN_DEVICE_FUNC - explicit inline SelfAdjointView(MatrixType& matrix) : m_matrix(matrix) - { - EIGEN_STATIC_ASSERT(UpLo==Lower || UpLo==Upper,SELFADJOINTVIEW_ACCEPTS_UPPER_AND_LOWER_MODE_ONLY); - } - - EIGEN_DEVICE_FUNC - inline Index rows() const { return m_matrix.rows(); } - EIGEN_DEVICE_FUNC - inline Index cols() const { return m_matrix.cols(); } - EIGEN_DEVICE_FUNC - inline Index outerStride() const { return m_matrix.outerStride(); } - EIGEN_DEVICE_FUNC - inline Index innerStride() const { return m_matrix.innerStride(); } - - /** \sa MatrixBase::coeff() - * \warning the coordinates must fit into the referenced triangular part - */ - EIGEN_DEVICE_FUNC - inline Scalar coeff(Index row, Index col) const - { - Base::check_coordinates_internal(row, col); - return m_matrix.coeff(row, col); - } - - /** \sa MatrixBase::coeffRef() - * \warning the coordinates must fit into the referenced triangular part - */ - EIGEN_DEVICE_FUNC - inline Scalar& coeffRef(Index row, Index col) - { - EIGEN_STATIC_ASSERT_LVALUE(SelfAdjointView); - Base::check_coordinates_internal(row, col); - return m_matrix.coeffRef(row, col); - } - - /** \internal */ - EIGEN_DEVICE_FUNC - const MatrixTypeNestedCleaned& _expression() const { return m_matrix; } - - EIGEN_DEVICE_FUNC - const MatrixTypeNestedCleaned& nestedExpression() const { return m_matrix; } - EIGEN_DEVICE_FUNC - MatrixTypeNestedCleaned& nestedExpression() { return m_matrix; } - - /** Efficient triangular matrix times vector/matrix product */ - template - EIGEN_DEVICE_FUNC - const Product - operator*(const MatrixBase& rhs) const - { - return Product(*this, rhs.derived()); - } - - /** Efficient vector/matrix times triangular matrix product */ - template friend - EIGEN_DEVICE_FUNC - const Product - operator*(const MatrixBase& lhs, const SelfAdjointView& rhs) - { - return Product(lhs.derived(),rhs); - } - - friend EIGEN_DEVICE_FUNC - const SelfAdjointView - operator*(const Scalar& s, const SelfAdjointView& mat) - { - return (s*mat.nestedExpression()).template selfadjointView(); - } - - /** Perform a symmetric rank 2 update of the selfadjoint matrix \c *this: - * \f$ this = this + \alpha u v^* + conj(\alpha) v u^* \f$ - * \returns a reference to \c *this - * - * The vectors \a u and \c v \b must be column vectors, however they can be - * a adjoint expression without any overhead. Only the meaningful triangular - * part of the matrix is updated, the rest is left unchanged. - * - * \sa rankUpdate(const MatrixBase&, Scalar) - */ - template - EIGEN_DEVICE_FUNC - SelfAdjointView& rankUpdate(const MatrixBase& u, const MatrixBase& v, const Scalar& alpha = Scalar(1)); - - /** Perform a symmetric rank K update of the selfadjoint matrix \c *this: - * \f$ this = this + \alpha ( u u^* ) \f$ where \a u is a vector or matrix. - * - * \returns a reference to \c *this - * - * Note that to perform \f$ this = this + \alpha ( u^* u ) \f$ you can simply - * call this function with u.adjoint(). - * - * \sa rankUpdate(const MatrixBase&, const MatrixBase&, Scalar) - */ - template - EIGEN_DEVICE_FUNC - SelfAdjointView& rankUpdate(const MatrixBase& u, const Scalar& alpha = Scalar(1)); - - /** \returns an expression of a triangular view extracted from the current selfadjoint view of a given triangular part - * - * The parameter \a TriMode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper, - * \c #Lower, \c #StrictlyLower, \c #UnitLower. - * - * If \c TriMode references the same triangular part than \c *this, then this method simply return a \c TriangularView of the nested expression, - * otherwise, the nested expression is first transposed, thus returning a \c TriangularView> object. - * - * \sa MatrixBase::triangularView(), class TriangularView - */ - template - EIGEN_DEVICE_FUNC - typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), - TriangularView, - TriangularView >::type - triangularView() const - { - typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), MatrixType&, typename MatrixType::ConstTransposeReturnType>::type tmp1(m_matrix); - typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), MatrixType&, typename MatrixType::AdjointReturnType>::type tmp2(tmp1); - return typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), - TriangularView, - TriangularView >::type(tmp2); - } - - typedef SelfAdjointView ConjugateReturnType; - /** \sa MatrixBase::conjugate() const */ - EIGEN_DEVICE_FUNC - inline const ConjugateReturnType conjugate() const - { return ConjugateReturnType(m_matrix.conjugate()); } - - typedef SelfAdjointView AdjointReturnType; - /** \sa MatrixBase::adjoint() const */ - EIGEN_DEVICE_FUNC - inline const AdjointReturnType adjoint() const - { return AdjointReturnType(m_matrix.adjoint()); } - - typedef SelfAdjointView TransposeReturnType; - /** \sa MatrixBase::transpose() */ - EIGEN_DEVICE_FUNC - inline TransposeReturnType transpose() - { - EIGEN_STATIC_ASSERT_LVALUE(MatrixType) - typename MatrixType::TransposeReturnType tmp(m_matrix); - return TransposeReturnType(tmp); - } - - typedef SelfAdjointView ConstTransposeReturnType; - /** \sa MatrixBase::transpose() const */ - EIGEN_DEVICE_FUNC - inline const ConstTransposeReturnType transpose() const - { - return ConstTransposeReturnType(m_matrix.transpose()); - } - - /** \returns a const expression of the main diagonal of the matrix \c *this - * - * This method simply returns the diagonal of the nested expression, thus by-passing the SelfAdjointView decorator. - * - * \sa MatrixBase::diagonal(), class Diagonal */ - EIGEN_DEVICE_FUNC - typename MatrixType::ConstDiagonalReturnType diagonal() const - { - return typename MatrixType::ConstDiagonalReturnType(m_matrix); - } - -/////////// Cholesky module /////////// - - const LLT llt() const; - const LDLT ldlt() const; - -/////////// Eigenvalue module /////////// - - /** Real part of #Scalar */ - typedef typename NumTraits::Real RealScalar; - /** Return type of eigenvalues() */ - typedef Matrix::ColsAtCompileTime, 1> EigenvaluesReturnType; - - EIGEN_DEVICE_FUNC - EigenvaluesReturnType eigenvalues() const; - EIGEN_DEVICE_FUNC - RealScalar operatorNorm() const; - - protected: - MatrixTypeNested m_matrix; -}; - - -// template -// internal::selfadjoint_matrix_product_returntype > -// operator*(const MatrixBase& lhs, const SelfAdjointView& rhs) -// { -// return internal::matrix_selfadjoint_product_returntype >(lhs.derived(),rhs); -// } - -// selfadjoint to dense matrix - -namespace internal { - -// TODO currently a selfadjoint expression has the form SelfAdjointView<.,.> -// in the future selfadjoint-ness should be defined by the expression traits -// such that Transpose > is valid. (currently TriangularBase::transpose() is overloaded to make it work) -template -struct evaluator_traits > -{ - typedef typename storage_kind_to_evaluator_kind::Kind Kind; - typedef SelfAdjointShape Shape; -}; - -template -class triangular_dense_assignment_kernel - : public generic_dense_assignment_kernel -{ -protected: - typedef generic_dense_assignment_kernel Base; - typedef typename Base::DstXprType DstXprType; - typedef typename Base::SrcXprType SrcXprType; - using Base::m_dst; - using Base::m_src; - using Base::m_functor; -public: - - typedef typename Base::DstEvaluatorType DstEvaluatorType; - typedef typename Base::SrcEvaluatorType SrcEvaluatorType; - typedef typename Base::Scalar Scalar; - typedef typename Base::AssignmentTraits AssignmentTraits; - - - EIGEN_DEVICE_FUNC triangular_dense_assignment_kernel(DstEvaluatorType &dst, const SrcEvaluatorType &src, const Functor &func, DstXprType& dstExpr) - : Base(dst, src, func, dstExpr) - {} - - EIGEN_DEVICE_FUNC void assignCoeff(Index row, Index col) - { - eigen_internal_assert(row!=col); - Scalar tmp = m_src.coeff(row,col); - m_functor.assignCoeff(m_dst.coeffRef(row,col), tmp); - m_functor.assignCoeff(m_dst.coeffRef(col,row), numext::conj(tmp)); - } - - EIGEN_DEVICE_FUNC void assignDiagonalCoeff(Index id) - { - Base::assignCoeff(id,id); - } - - EIGEN_DEVICE_FUNC void assignOppositeCoeff(Index, Index) - { eigen_internal_assert(false && "should never be called"); } -}; - -} // end namespace internal - -/*************************************************************************** -* Implementation of MatrixBase methods -***************************************************************************/ - -/** This is the const version of MatrixBase::selfadjointView() */ -template -template -EIGEN_DEVICE_FUNC typename MatrixBase::template ConstSelfAdjointViewReturnType::Type -MatrixBase::selfadjointView() const -{ - return typename ConstSelfAdjointViewReturnType::Type(derived()); -} - -/** \returns an expression of a symmetric/self-adjoint view extracted from the upper or lower triangular part of the current matrix - * - * The parameter \a UpLo can be either \c #Upper or \c #Lower - * - * Example: \include MatrixBase_selfadjointView.cpp - * Output: \verbinclude MatrixBase_selfadjointView.out - * - * \sa class SelfAdjointView - */ -template -template -EIGEN_DEVICE_FUNC typename MatrixBase::template SelfAdjointViewReturnType::Type -MatrixBase::selfadjointView() -{ - return typename SelfAdjointViewReturnType::Type(derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINTMATRIX_H diff --git a/Eigen/src/Core/SelfCwiseBinaryOp.h b/Eigen/src/Core/SelfCwiseBinaryOp.h deleted file mode 100644 index 50099df82..000000000 --- a/Eigen/src/Core/SelfCwiseBinaryOp.h +++ /dev/null @@ -1,51 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFCWISEBINARYOP_H -#define EIGEN_SELFCWISEBINARYOP_H - -namespace Eigen { - -// TODO generalize the scalar type of 'other' - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::operator*=(const Scalar& other) -{ - typedef typename Derived::PlainObject PlainObject; - internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op()); - return derived(); -} - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& ArrayBase::operator+=(const Scalar& other) -{ - typedef typename Derived::PlainObject PlainObject; - internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::add_assign_op()); - return derived(); -} - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& ArrayBase::operator-=(const Scalar& other) -{ - typedef typename Derived::PlainObject PlainObject; - internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op()); - return derived(); -} - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& DenseBase::operator/=(const Scalar& other) -{ - typedef typename Derived::PlainObject PlainObject; - internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op()); - return derived(); -} - -} // end namespace Eigen - -#endif // EIGEN_SELFCWISEBINARYOP_H diff --git a/Eigen/src/Core/Solve.h b/Eigen/src/Core/Solve.h deleted file mode 100644 index a8daea511..000000000 --- a/Eigen/src/Core/Solve.h +++ /dev/null @@ -1,188 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SOLVE_H -#define EIGEN_SOLVE_H - -namespace Eigen { - -template class SolveImpl; - -/** \class Solve - * \ingroup Core_Module - * - * \brief Pseudo expression representing a solving operation - * - * \tparam Decomposition the type of the matrix or decomposion object - * \tparam Rhstype the type of the right-hand side - * - * This class represents an expression of A.solve(B) - * and most of the time this is the only way it is used. - * - */ -namespace internal { - -// this solve_traits class permits to determine the evaluation type with respect to storage kind (Dense vs Sparse) -template struct solve_traits; - -template -struct solve_traits -{ - typedef typename make_proper_matrix_type::type PlainObject; -}; - -template -struct traits > - : traits::StorageKind>::PlainObject> -{ - typedef typename solve_traits::StorageKind>::PlainObject PlainObject; - typedef typename promote_index_type::type StorageIndex; - typedef traits BaseTraits; - enum { - Flags = BaseTraits::Flags & RowMajorBit, - CoeffReadCost = HugeCost - }; -}; - -} - - -template -class Solve : public SolveImpl::StorageKind> -{ -public: - typedef typename internal::traits::PlainObject PlainObject; - typedef typename internal::traits::StorageIndex StorageIndex; - - Solve(const Decomposition &dec, const RhsType &rhs) - : m_dec(dec), m_rhs(rhs) - {} - - EIGEN_DEVICE_FUNC Index rows() const { return m_dec.cols(); } - EIGEN_DEVICE_FUNC Index cols() const { return m_rhs.cols(); } - - EIGEN_DEVICE_FUNC const Decomposition& dec() const { return m_dec; } - EIGEN_DEVICE_FUNC const RhsType& rhs() const { return m_rhs; } - -protected: - const Decomposition &m_dec; - const RhsType &m_rhs; -}; - - -// Specialization of the Solve expression for dense results -template -class SolveImpl - : public MatrixBase > -{ - typedef Solve Derived; - -public: - - typedef MatrixBase > Base; - EIGEN_DENSE_PUBLIC_INTERFACE(Derived) - -private: - - Scalar coeff(Index row, Index col) const; - Scalar coeff(Index i) const; -}; - -// Generic API dispatcher -template -class SolveImpl : public internal::generic_xpr_base, MatrixXpr, StorageKind>::type -{ - public: - typedef typename internal::generic_xpr_base, MatrixXpr, StorageKind>::type Base; -}; - -namespace internal { - -// Evaluator of Solve -> eval into a temporary -template -struct evaluator > - : public evaluator::PlainObject> -{ - typedef Solve SolveType; - typedef typename SolveType::PlainObject PlainObject; - typedef evaluator Base; - - enum { Flags = Base::Flags | EvalBeforeNestingBit }; - - EIGEN_DEVICE_FUNC explicit evaluator(const SolveType& solve) - : m_result(solve.rows(), solve.cols()) - { - ::new (static_cast(this)) Base(m_result); - solve.dec()._solve_impl(solve.rhs(), m_result); - } - -protected: - PlainObject m_result; -}; - -// Specialization for "dst = dec.solve(rhs)" -// NOTE we need to specialize it for Dense2Dense to avoid ambiguous specialization error and a Sparse2Sparse specialization must exist somewhere -template -struct Assignment, internal::assign_op, Dense2Dense> -{ - typedef Solve SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - src.dec()._solve_impl(src.rhs(), dst); - } -}; - -// Specialization for "dst = dec.transpose().solve(rhs)" -template -struct Assignment,RhsType>, internal::assign_op, Dense2Dense> -{ - typedef Solve,RhsType> SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - src.dec().nestedExpression().template _solve_impl_transposed(src.rhs(), dst); - } -}; - -// Specialization for "dst = dec.adjoint().solve(rhs)" -template -struct Assignment, const Transpose >,RhsType>, - internal::assign_op, Dense2Dense> -{ - typedef Solve, const Transpose >,RhsType> SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - src.dec().nestedExpression().nestedExpression().template _solve_impl_transposed(src.rhs(), dst); - } -}; - -} // end namepsace internal - -} // end namespace Eigen - -#endif // EIGEN_SOLVE_H diff --git a/Eigen/src/Core/SolveTriangular.h b/Eigen/src/Core/SolveTriangular.h deleted file mode 100644 index a0011d4f9..000000000 --- a/Eigen/src/Core/SolveTriangular.h +++ /dev/null @@ -1,232 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SOLVETRIANGULAR_H -#define EIGEN_SOLVETRIANGULAR_H - -namespace Eigen { - -namespace internal { - -// Forward declarations: -// The following two routines are implemented in the products/TriangularSolver*.h files -template -struct triangular_solve_vector; - -template -struct triangular_solve_matrix; - -// small helper struct extracting some traits on the underlying solver operation -template -class trsolve_traits -{ - private: - enum { - RhsIsVectorAtCompileTime = (Side==OnTheLeft ? Rhs::ColsAtCompileTime : Rhs::RowsAtCompileTime)==1 - }; - public: - enum { - Unrolling = (RhsIsVectorAtCompileTime && Rhs::SizeAtCompileTime != Dynamic && Rhs::SizeAtCompileTime <= 8) - ? CompleteUnrolling : NoUnrolling, - RhsVectors = RhsIsVectorAtCompileTime ? 1 : Dynamic - }; -}; - -template::Unrolling, - int RhsVectors = trsolve_traits::RhsVectors - > -struct triangular_solver_selector; - -template -struct triangular_solver_selector -{ - typedef typename Lhs::Scalar LhsScalar; - typedef typename Rhs::Scalar RhsScalar; - typedef blas_traits LhsProductTraits; - typedef typename LhsProductTraits::ExtractType ActualLhsType; - typedef Map, Aligned> MappedRhs; - static void run(const Lhs& lhs, Rhs& rhs) - { - ActualLhsType actualLhs = LhsProductTraits::extract(lhs); - - // FIXME find a way to allow an inner stride if packet_traits::size==1 - - bool useRhsDirectly = Rhs::InnerStrideAtCompileTime==1 || rhs.innerStride()==1; - - ei_declare_aligned_stack_constructed_variable(RhsScalar,actualRhs,rhs.size(), - (useRhsDirectly ? rhs.data() : 0)); - - if(!useRhsDirectly) - MappedRhs(actualRhs,rhs.size()) = rhs; - - triangular_solve_vector - ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs); - - if(!useRhsDirectly) - rhs = MappedRhs(actualRhs, rhs.size()); - } -}; - -// the rhs is a matrix -template -struct triangular_solver_selector -{ - typedef typename Rhs::Scalar Scalar; - typedef blas_traits LhsProductTraits; - typedef typename LhsProductTraits::DirectLinearAccessType ActualLhsType; - - static void run(const Lhs& lhs, Rhs& rhs) - { - typename internal::add_const_on_value_type::type actualLhs = LhsProductTraits::extract(lhs); - - const Index size = lhs.rows(); - const Index othersize = Side==OnTheLeft? rhs.cols() : rhs.rows(); - - typedef internal::gemm_blocking_space<(Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar, - Rhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxRowsAtCompileTime,4> BlockingType; - - BlockingType blocking(rhs.rows(), rhs.cols(), size, 1, false); - - triangular_solve_matrix - ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.outerStride(), blocking); - } -}; - -/*************************************************************************** -* meta-unrolling implementation -***************************************************************************/ - -template -struct triangular_solver_unroller; - -template -struct triangular_solver_unroller { - enum { - IsLower = ((Mode&Lower)==Lower), - DiagIndex = IsLower ? LoopIndex : Size - LoopIndex - 1, - StartIndex = IsLower ? 0 : DiagIndex+1 - }; - static void run(const Lhs& lhs, Rhs& rhs) - { - if (LoopIndex>0) - rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment(StartIndex).transpose() - .cwiseProduct(rhs.template segment(StartIndex)).sum(); - - if(!(Mode & UnitDiag)) - rhs.coeffRef(DiagIndex) /= lhs.coeff(DiagIndex,DiagIndex); - - triangular_solver_unroller::run(lhs,rhs); - } -}; - -template -struct triangular_solver_unroller { - static void run(const Lhs&, Rhs&) {} -}; - -template -struct triangular_solver_selector { - static void run(const Lhs& lhs, Rhs& rhs) - { triangular_solver_unroller::run(lhs,rhs); } -}; - -template -struct triangular_solver_selector { - static void run(const Lhs& lhs, Rhs& rhs) - { - Transpose trLhs(lhs); - Transpose trRhs(rhs); - - triangular_solver_unroller,Transpose, - ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag), - 0,Rhs::SizeAtCompileTime>::run(trLhs,trRhs); - } -}; - -} // end namespace internal - -/*************************************************************************** -* TriangularView methods -***************************************************************************/ - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -EIGEN_DEVICE_FUNC void TriangularViewImpl::solveInPlace(const MatrixBase& _other) const -{ - OtherDerived& other = _other.const_cast_derived(); - eigen_assert( derived().cols() == derived().rows() && ((Side==OnTheLeft && derived().cols() == other.rows()) || (Side==OnTheRight && derived().cols() == other.cols())) ); - eigen_assert((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower))); - - enum { copy = (internal::traits::Flags & RowMajorBit) && OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime!=1}; - typedef typename internal::conditional::type, OtherDerived&>::type OtherCopy; - OtherCopy otherCopy(other); - - internal::triangular_solver_selector::type, - Side, Mode>::run(derived().nestedExpression(), otherCopy); - - if (copy) - other = otherCopy; -} - -template -template -const internal::triangular_solve_retval,Other> -TriangularViewImpl::solve(const MatrixBase& other) const -{ - return internal::triangular_solve_retval(derived(), other.derived()); -} -#endif - -namespace internal { - - -template -struct traits > -{ - typedef typename internal::plain_matrix_type_column_major::type ReturnType; -}; - -template struct triangular_solve_retval - : public ReturnByValue > -{ - typedef typename remove_all::type RhsNestedCleaned; - typedef ReturnByValue Base; - - triangular_solve_retval(const TriangularType& tri, const Rhs& rhs) - : m_triangularMatrix(tri), m_rhs(rhs) - {} - - inline Index rows() const { return m_rhs.rows(); } - inline Index cols() const { return m_rhs.cols(); } - - template inline void evalTo(Dest& dst) const - { - if(!is_same_dense(dst,m_rhs)) - dst = m_rhs; - m_triangularMatrix.template solveInPlace(dst); - } - - protected: - const TriangularType& m_triangularMatrix; - typename Rhs::Nested m_rhs; -}; - -} // namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SOLVETRIANGULAR_H diff --git a/Eigen/src/Core/SolverBase.h b/Eigen/src/Core/SolverBase.h deleted file mode 100644 index 8a4adc229..000000000 --- a/Eigen/src/Core/SolverBase.h +++ /dev/null @@ -1,130 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SOLVERBASE_H -#define EIGEN_SOLVERBASE_H - -namespace Eigen { - -namespace internal { - - - -} // end namespace internal - -/** \class SolverBase - * \brief A base class for matrix decomposition and solvers - * - * \tparam Derived the actual type of the decomposition/solver. - * - * Any matrix decomposition inheriting this base class provide the following API: - * - * \code - * MatrixType A, b, x; - * DecompositionType dec(A); - * x = dec.solve(b); // solve A * x = b - * x = dec.transpose().solve(b); // solve A^T * x = b - * x = dec.adjoint().solve(b); // solve A' * x = b - * \endcode - * - * \warning Currently, any other usage of transpose() and adjoint() are not supported and will produce compilation errors. - * - * \sa class PartialPivLU, class FullPivLU - */ -template -class SolverBase : public EigenBase -{ - public: - - typedef EigenBase Base; - typedef typename internal::traits::Scalar Scalar; - typedef Scalar CoeffReturnType; - - enum { - RowsAtCompileTime = internal::traits::RowsAtCompileTime, - ColsAtCompileTime = internal::traits::ColsAtCompileTime, - SizeAtCompileTime = (internal::size_at_compile_time::RowsAtCompileTime, - internal::traits::ColsAtCompileTime>::ret), - MaxRowsAtCompileTime = internal::traits::MaxRowsAtCompileTime, - MaxColsAtCompileTime = internal::traits::MaxColsAtCompileTime, - MaxSizeAtCompileTime = (internal::size_at_compile_time::MaxRowsAtCompileTime, - internal::traits::MaxColsAtCompileTime>::ret), - IsVectorAtCompileTime = internal::traits::MaxRowsAtCompileTime == 1 - || internal::traits::MaxColsAtCompileTime == 1 - }; - - /** Default constructor */ - SolverBase() - {} - - ~SolverBase() - {} - - using Base::derived; - - /** \returns an expression of the solution x of \f$ A x = b \f$ using the current decomposition of A. - */ - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b"); - return Solve(derived(), b.derived()); - } - - /** \internal the return type of transpose() */ - typedef typename internal::add_const >::type ConstTransposeReturnType; - /** \returns an expression of the transposed of the factored matrix. - * - * A typical usage is to solve for the transposed problem A^T x = b: - * \code x = dec.transpose().solve(b); \endcode - * - * \sa adjoint(), solve() - */ - inline ConstTransposeReturnType transpose() const - { - return ConstTransposeReturnType(derived()); - } - - /** \internal the return type of adjoint() */ - typedef typename internal::conditional::IsComplex, - CwiseUnaryOp, ConstTransposeReturnType>, - ConstTransposeReturnType - >::type AdjointReturnType; - /** \returns an expression of the adjoint of the factored matrix - * - * A typical usage is to solve for the adjoint problem A' x = b: - * \code x = dec.adjoint().solve(b); \endcode - * - * For real scalar types, this function is equivalent to transpose(). - * - * \sa transpose(), solve() - */ - inline AdjointReturnType adjoint() const - { - return AdjointReturnType(derived().transpose()); - } - - protected: -}; - -namespace internal { - -template -struct generic_xpr_base -{ - typedef SolverBase type; - -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SOLVERBASE_H diff --git a/Eigen/src/Core/StableNorm.h b/Eigen/src/Core/StableNorm.h deleted file mode 100644 index e0e7a0c8f..000000000 --- a/Eigen/src/Core/StableNorm.h +++ /dev/null @@ -1,221 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STABLENORM_H -#define EIGEN_STABLENORM_H - -namespace Eigen { - -namespace internal { - -template -inline void stable_norm_kernel(const ExpressionType& bl, Scalar& ssq, Scalar& scale, Scalar& invScale) -{ - Scalar maxCoeff = bl.cwiseAbs().maxCoeff(); - - if(maxCoeff>scale) - { - ssq = ssq * numext::abs2(scale/maxCoeff); - Scalar tmp = Scalar(1)/maxCoeff; - if(tmp > NumTraits::highest()) - { - invScale = NumTraits::highest(); - scale = Scalar(1)/invScale; - } - else if(maxCoeff>NumTraits::highest()) // we got a INF - { - invScale = Scalar(1); - scale = maxCoeff; - } - else - { - scale = maxCoeff; - invScale = tmp; - } - } - else if(maxCoeff!=maxCoeff) // we got a NaN - { - scale = maxCoeff; - } - - // TODO if the maxCoeff is much much smaller than the current scale, - // then we can neglect this sub vector - if(scale>Scalar(0)) // if scale==0, then bl is 0 - ssq += (bl*invScale).squaredNorm(); -} - -template -inline typename NumTraits::Scalar>::Real -blueNorm_impl(const EigenBase& _vec) -{ - typedef typename Derived::RealScalar RealScalar; - using std::pow; - using std::sqrt; - using std::abs; - const Derived& vec(_vec.derived()); - static bool initialized = false; - static RealScalar b1, b2, s1m, s2m, rbig, relerr; - if(!initialized) - { - int ibeta, it, iemin, iemax, iexp; - RealScalar eps; - // This program calculates the machine-dependent constants - // bl, b2, slm, s2m, relerr overfl - // from the "basic" machine-dependent numbers - // nbig, ibeta, it, iemin, iemax, rbig. - // The following define the basic machine-dependent constants. - // For portability, the PORT subprograms "ilmaeh" and "rlmach" - // are used. For any specific computer, each of the assignment - // statements can be replaced - ibeta = std::numeric_limits::radix; // base for floating-point numbers - it = NumTraits::digits(); // number of base-beta digits in mantissa - iemin = std::numeric_limits::min_exponent; // minimum exponent - iemax = std::numeric_limits::max_exponent; // maximum exponent - rbig = (std::numeric_limits::max)(); // largest floating-point number - - iexp = -((1-iemin)/2); - b1 = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); // lower boundary of midrange - iexp = (iemax + 1 - it)/2; - b2 = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); // upper boundary of midrange - - iexp = (2-iemin)/2; - s1m = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); // scaling factor for lower range - iexp = - ((iemax+it)/2); - s2m = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); // scaling factor for upper range - - eps = RealScalar(pow(double(ibeta), 1-it)); - relerr = sqrt(eps); // tolerance for neglecting asml - initialized = true; - } - Index n = vec.size(); - RealScalar ab2 = b2 / RealScalar(n); - RealScalar asml = RealScalar(0); - RealScalar amed = RealScalar(0); - RealScalar abig = RealScalar(0); - for(typename Derived::InnerIterator it(vec, 0); it; ++it) - { - RealScalar ax = abs(it.value()); - if(ax > ab2) abig += numext::abs2(ax*s2m); - else if(ax < b1) asml += numext::abs2(ax*s1m); - else amed += numext::abs2(ax); - } - if(amed!=amed) - return amed; // we got a NaN - if(abig > RealScalar(0)) - { - abig = sqrt(abig); - if(abig > rbig) // overflow, or *this contains INF values - return abig; // return INF - if(amed > RealScalar(0)) - { - abig = abig/s2m; - amed = sqrt(amed); - } - else - return abig/s2m; - } - else if(asml > RealScalar(0)) - { - if (amed > RealScalar(0)) - { - abig = sqrt(amed); - amed = sqrt(asml) / s1m; - } - else - return sqrt(asml)/s1m; - } - else - return sqrt(amed); - asml = numext::mini(abig, amed); - abig = numext::maxi(abig, amed); - if(asml <= abig*relerr) - return abig; - else - return abig * sqrt(RealScalar(1) + numext::abs2(asml/abig)); -} - -} // end namespace internal - -/** \returns the \em l2 norm of \c *this avoiding underflow and overflow. - * This version use a blockwise two passes algorithm: - * 1 - find the absolute largest coefficient \c s - * 2 - compute \f$ s \Vert \frac{*this}{s} \Vert \f$ in a standard way - * - * For architecture/scalar types supporting vectorization, this version - * is faster than blueNorm(). Otherwise the blueNorm() is much faster. - * - * \sa norm(), blueNorm(), hypotNorm() - */ -template -inline typename NumTraits::Scalar>::Real -MatrixBase::stableNorm() const -{ - using std::sqrt; - using std::abs; - const Index blockSize = 4096; - RealScalar scale(0); - RealScalar invScale(1); - RealScalar ssq(0); // sum of square - - typedef typename internal::nested_eval::type DerivedCopy; - typedef typename internal::remove_all::type DerivedCopyClean; - const DerivedCopy copy(derived()); - - enum { - CanAlign = ( (int(DerivedCopyClean::Flags)&DirectAccessBit) - || (int(internal::evaluator::Alignment)>0) // FIXME Alignment)>0 might not be enough - ) && (blockSize*sizeof(Scalar)*20) // if we cannot allocate on the stack, then let's not bother about this optimization - }; - typedef typename internal::conditional, internal::evaluator::Alignment>, - typename DerivedCopyClean::ConstSegmentReturnType>::type SegmentWrapper; - Index n = size(); - - if(n==1) - return abs(this->coeff(0)); - - Index bi = internal::first_default_aligned(copy); - if (bi>0) - internal::stable_norm_kernel(copy.head(bi), ssq, scale, invScale); - for (; bi -inline typename NumTraits::Scalar>::Real -MatrixBase::blueNorm() const -{ - return internal::blueNorm_impl(*this); -} - -/** \returns the \em l2 norm of \c *this avoiding undeflow and overflow. - * This version use a concatenation of hypot() calls, and it is very slow. - * - * \sa norm(), stableNorm() - */ -template -inline typename NumTraits::Scalar>::Real -MatrixBase::hypotNorm() const -{ - return this->cwiseAbs().redux(internal::scalar_hypot_op()); -} - -} // end namespace Eigen - -#endif // EIGEN_STABLENORM_H diff --git a/Eigen/src/Core/Stride.h b/Eigen/src/Core/Stride.h deleted file mode 100644 index 513742f34..000000000 --- a/Eigen/src/Core/Stride.h +++ /dev/null @@ -1,111 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STRIDE_H -#define EIGEN_STRIDE_H - -namespace Eigen { - -/** \class Stride - * \ingroup Core_Module - * - * \brief Holds strides information for Map - * - * This class holds the strides information for mapping arrays with strides with class Map. - * - * It holds two values: the inner stride and the outer stride. - * - * The inner stride is the pointer increment between two consecutive entries within a given row of a - * row-major matrix or within a given column of a column-major matrix. - * - * The outer stride is the pointer increment between two consecutive rows of a row-major matrix or - * between two consecutive columns of a column-major matrix. - * - * These two values can be passed either at compile-time as template parameters, or at runtime as - * arguments to the constructor. - * - * Indeed, this class takes two template parameters: - * \tparam _OuterStrideAtCompileTime the outer stride, or Dynamic if you want to specify it at runtime. - * \tparam _InnerStrideAtCompileTime the inner stride, or Dynamic if you want to specify it at runtime. - * - * Here is an example: - * \include Map_general_stride.cpp - * Output: \verbinclude Map_general_stride.out - * - * \sa class InnerStride, class OuterStride, \ref TopicStorageOrders - */ -template -class Stride -{ - public: - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - enum { - InnerStrideAtCompileTime = _InnerStrideAtCompileTime, - OuterStrideAtCompileTime = _OuterStrideAtCompileTime - }; - - /** Default constructor, for use when strides are fixed at compile time */ - EIGEN_DEVICE_FUNC - Stride() - : m_outer(OuterStrideAtCompileTime), m_inner(InnerStrideAtCompileTime) - { - eigen_assert(InnerStrideAtCompileTime != Dynamic && OuterStrideAtCompileTime != Dynamic); - } - - /** Constructor allowing to pass the strides at runtime */ - EIGEN_DEVICE_FUNC - Stride(Index outerStride, Index innerStride) - : m_outer(outerStride), m_inner(innerStride) - { - eigen_assert(innerStride>=0 && outerStride>=0); - } - - /** Copy constructor */ - EIGEN_DEVICE_FUNC - Stride(const Stride& other) - : m_outer(other.outer()), m_inner(other.inner()) - {} - - /** \returns the outer stride */ - EIGEN_DEVICE_FUNC - inline Index outer() const { return m_outer.value(); } - /** \returns the inner stride */ - EIGEN_DEVICE_FUNC - inline Index inner() const { return m_inner.value(); } - - protected: - internal::variable_if_dynamic m_outer; - internal::variable_if_dynamic m_inner; -}; - -/** \brief Convenience specialization of Stride to specify only an inner stride - * See class Map for some examples */ -template -class InnerStride : public Stride<0, Value> -{ - typedef Stride<0, Value> Base; - public: - EIGEN_DEVICE_FUNC InnerStride() : Base() {} - EIGEN_DEVICE_FUNC InnerStride(Index v) : Base(0, v) {} // FIXME making this explicit could break valid code -}; - -/** \brief Convenience specialization of Stride to specify only an outer stride - * See class Map for some examples */ -template -class OuterStride : public Stride -{ - typedef Stride Base; - public: - EIGEN_DEVICE_FUNC OuterStride() : Base() {} - EIGEN_DEVICE_FUNC OuterStride(Index v) : Base(v,0) {} // FIXME making this explicit could break valid code -}; - -} // end namespace Eigen - -#endif // EIGEN_STRIDE_H diff --git a/Eigen/src/Core/Swap.h b/Eigen/src/Core/Swap.h deleted file mode 100644 index d70200918..000000000 --- a/Eigen/src/Core/Swap.h +++ /dev/null @@ -1,67 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SWAP_H -#define EIGEN_SWAP_H - -namespace Eigen { - -namespace internal { - -// Overload default assignPacket behavior for swapping them -template -class generic_dense_assignment_kernel, Specialized> - : public generic_dense_assignment_kernel, BuiltIn> -{ -protected: - typedef generic_dense_assignment_kernel, BuiltIn> Base; - using Base::m_dst; - using Base::m_src; - using Base::m_functor; - -public: - typedef typename Base::Scalar Scalar; - typedef typename Base::DstXprType DstXprType; - typedef swap_assign_op Functor; - - EIGEN_DEVICE_FUNC generic_dense_assignment_kernel(DstEvaluatorTypeT &dst, const SrcEvaluatorTypeT &src, const Functor &func, DstXprType& dstExpr) - : Base(dst, src, func, dstExpr) - {} - - template - void assignPacket(Index row, Index col) - { - PacketType tmp = m_src.template packet(row,col); - const_cast(m_src).template writePacket(row,col, m_dst.template packet(row,col)); - m_dst.template writePacket(row,col,tmp); - } - - template - void assignPacket(Index index) - { - PacketType tmp = m_src.template packet(index); - const_cast(m_src).template writePacket(index, m_dst.template packet(index)); - m_dst.template writePacket(index,tmp); - } - - // TODO find a simple way not to have to copy/paste this function from generic_dense_assignment_kernel, by simple I mean no CRTP (Gael) - template - void assignPacketByOuterInner(Index outer, Index inner) - { - Index row = Base::rowIndexByOuterInner(outer, inner); - Index col = Base::colIndexByOuterInner(outer, inner); - assignPacket(row, col); - } -}; - -} // namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SWAP_H diff --git a/Eigen/src/Core/Transpose.h b/Eigen/src/Core/Transpose.h deleted file mode 100644 index ba7d6e629..000000000 --- a/Eigen/src/Core/Transpose.h +++ /dev/null @@ -1,403 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2006-2008 Benoit Jacob -// Copyright (C) 2009-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRANSPOSE_H -#define EIGEN_TRANSPOSE_H - -namespace Eigen { - -namespace internal { -template -struct traits > : public traits -{ - typedef typename ref_selector::type MatrixTypeNested; - typedef typename remove_reference::type MatrixTypeNestedPlain; - enum { - RowsAtCompileTime = MatrixType::ColsAtCompileTime, - ColsAtCompileTime = MatrixType::RowsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - FlagsLvalueBit = is_lvalue::value ? LvalueBit : 0, - Flags0 = traits::Flags & ~(LvalueBit | NestByRefBit), - Flags1 = Flags0 | FlagsLvalueBit, - Flags = Flags1 ^ RowMajorBit, - InnerStrideAtCompileTime = inner_stride_at_compile_time::ret, - OuterStrideAtCompileTime = outer_stride_at_compile_time::ret - }; -}; -} - -template class TransposeImpl; - -/** \class Transpose - * \ingroup Core_Module - * - * \brief Expression of the transpose of a matrix - * - * \tparam MatrixType the type of the object of which we are taking the transpose - * - * This class represents an expression of the transpose of a matrix. - * It is the return type of MatrixBase::transpose() and MatrixBase::adjoint() - * and most of the time this is the only way it is used. - * - * \sa MatrixBase::transpose(), MatrixBase::adjoint() - */ -template class Transpose - : public TransposeImpl::StorageKind> -{ - public: - - typedef typename internal::ref_selector::non_const_type MatrixTypeNested; - - typedef typename TransposeImpl::StorageKind>::Base Base; - EIGEN_GENERIC_PUBLIC_INTERFACE(Transpose) - typedef typename internal::remove_all::type NestedExpression; - - EIGEN_DEVICE_FUNC - explicit inline Transpose(MatrixType& matrix) : m_matrix(matrix) {} - - EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Transpose) - - EIGEN_DEVICE_FUNC inline Index rows() const { return m_matrix.cols(); } - EIGEN_DEVICE_FUNC inline Index cols() const { return m_matrix.rows(); } - - /** \returns the nested expression */ - EIGEN_DEVICE_FUNC - const typename internal::remove_all::type& - nestedExpression() const { return m_matrix; } - - /** \returns the nested expression */ - EIGEN_DEVICE_FUNC - typename internal::remove_reference::type& - nestedExpression() { return m_matrix; } - - /** \internal */ - void resize(Index nrows, Index ncols) { - m_matrix.resize(ncols,nrows); - } - - protected: - typename internal::ref_selector::non_const_type m_matrix; -}; - -namespace internal { - -template::ret> -struct TransposeImpl_base -{ - typedef typename dense_xpr_base >::type type; -}; - -template -struct TransposeImpl_base -{ - typedef typename dense_xpr_base >::type type; -}; - -} // end namespace internal - -// Generic API dispatcher -template -class TransposeImpl - : public internal::generic_xpr_base >::type -{ -public: - typedef typename internal::generic_xpr_base >::type Base; -}; - -template class TransposeImpl - : public internal::TransposeImpl_base::type -{ - public: - - typedef typename internal::TransposeImpl_base::type Base; - using Base::coeffRef; - EIGEN_DENSE_PUBLIC_INTERFACE(Transpose) - EIGEN_INHERIT_ASSIGNMENT_OPERATORS(TransposeImpl) - - EIGEN_DEVICE_FUNC inline Index innerStride() const { return derived().nestedExpression().innerStride(); } - EIGEN_DEVICE_FUNC inline Index outerStride() const { return derived().nestedExpression().outerStride(); } - - typedef typename internal::conditional< - internal::is_lvalue::value, - Scalar, - const Scalar - >::type ScalarWithConstIfNotLvalue; - - EIGEN_DEVICE_FUNC inline ScalarWithConstIfNotLvalue* data() { return derived().nestedExpression().data(); } - EIGEN_DEVICE_FUNC inline const Scalar* data() const { return derived().nestedExpression().data(); } - - // FIXME: shall we keep the const version of coeffRef? - EIGEN_DEVICE_FUNC - inline const Scalar& coeffRef(Index rowId, Index colId) const - { - return derived().nestedExpression().coeffRef(colId, rowId); - } - - EIGEN_DEVICE_FUNC - inline const Scalar& coeffRef(Index index) const - { - return derived().nestedExpression().coeffRef(index); - } -}; - -/** \returns an expression of the transpose of *this. - * - * Example: \include MatrixBase_transpose.cpp - * Output: \verbinclude MatrixBase_transpose.out - * - * \warning If you want to replace a matrix by its own transpose, do \b NOT do this: - * \code - * m = m.transpose(); // bug!!! caused by aliasing effect - * \endcode - * Instead, use the transposeInPlace() method: - * \code - * m.transposeInPlace(); - * \endcode - * which gives Eigen good opportunities for optimization, or alternatively you can also do: - * \code - * m = m.transpose().eval(); - * \endcode - * - * \sa transposeInPlace(), adjoint() */ -template -EIGEN_DEVICE_FUNC inline Transpose -DenseBase::transpose() -{ - return TransposeReturnType(derived()); -} - -/** This is the const version of transpose(). - * - * Make sure you read the warning for transpose() ! - * - * \sa transposeInPlace(), adjoint() */ -template -EIGEN_DEVICE_FUNC inline typename DenseBase::ConstTransposeReturnType -DenseBase::transpose() const -{ - return ConstTransposeReturnType(derived()); -} - -/** \returns an expression of the adjoint (i.e. conjugate transpose) of *this. - * - * Example: \include MatrixBase_adjoint.cpp - * Output: \verbinclude MatrixBase_adjoint.out - * - * \warning If you want to replace a matrix by its own adjoint, do \b NOT do this: - * \code - * m = m.adjoint(); // bug!!! caused by aliasing effect - * \endcode - * Instead, use the adjointInPlace() method: - * \code - * m.adjointInPlace(); - * \endcode - * which gives Eigen good opportunities for optimization, or alternatively you can also do: - * \code - * m = m.adjoint().eval(); - * \endcode - * - * \sa adjointInPlace(), transpose(), conjugate(), class Transpose, class internal::scalar_conjugate_op */ -template -EIGEN_DEVICE_FUNC inline const typename MatrixBase::AdjointReturnType -MatrixBase::adjoint() const -{ - return AdjointReturnType(this->transpose()); -} - -/*************************************************************************** -* "in place" transpose implementation -***************************************************************************/ - -namespace internal { - -template::size)) - && (internal::evaluator::Flags&PacketAccessBit) > -struct inplace_transpose_selector; - -template -struct inplace_transpose_selector { // square matrix - static void run(MatrixType& m) { - m.matrix().template triangularView().swap(m.matrix().transpose()); - } -}; - -// TODO: vectorized path is currently limited to LargestPacketSize x LargestPacketSize cases only. -template -struct inplace_transpose_selector { // PacketSize x PacketSize - static void run(MatrixType& m) { - typedef typename MatrixType::Scalar Scalar; - typedef typename internal::packet_traits::type Packet; - const Index PacketSize = internal::packet_traits::size; - const Index Alignment = internal::evaluator::Alignment; - PacketBlock A; - for (Index i=0; i(i,0); - internal::ptranspose(A); - for (Index i=0; i(m.rowIndexByOuterInner(i,0), m.colIndexByOuterInner(i,0), A.packet[i]); - } -}; - -template -struct inplace_transpose_selector { // non square matrix - static void run(MatrixType& m) { - if (m.rows()==m.cols()) - m.matrix().template triangularView().swap(m.matrix().transpose()); - else - m = m.transpose().eval(); - } -}; - -} // end namespace internal - -/** This is the "in place" version of transpose(): it replaces \c *this by its own transpose. - * Thus, doing - * \code - * m.transposeInPlace(); - * \endcode - * has the same effect on m as doing - * \code - * m = m.transpose().eval(); - * \endcode - * and is faster and also safer because in the latter line of code, forgetting the eval() results - * in a bug caused by \ref TopicAliasing "aliasing". - * - * Notice however that this method is only useful if you want to replace a matrix by its own transpose. - * If you just need the transpose of a matrix, use transpose(). - * - * \note if the matrix is not square, then \c *this must be a resizable matrix. - * This excludes (non-square) fixed-size matrices, block-expressions and maps. - * - * \sa transpose(), adjoint(), adjointInPlace() */ -template -EIGEN_DEVICE_FUNC inline void DenseBase::transposeInPlace() -{ - eigen_assert((rows() == cols() || (RowsAtCompileTime == Dynamic && ColsAtCompileTime == Dynamic)) - && "transposeInPlace() called on a non-square non-resizable matrix"); - internal::inplace_transpose_selector::run(derived()); -} - -/*************************************************************************** -* "in place" adjoint implementation -***************************************************************************/ - -/** This is the "in place" version of adjoint(): it replaces \c *this by its own transpose. - * Thus, doing - * \code - * m.adjointInPlace(); - * \endcode - * has the same effect on m as doing - * \code - * m = m.adjoint().eval(); - * \endcode - * and is faster and also safer because in the latter line of code, forgetting the eval() results - * in a bug caused by aliasing. - * - * Notice however that this method is only useful if you want to replace a matrix by its own adjoint. - * If you just need the adjoint of a matrix, use adjoint(). - * - * \note if the matrix is not square, then \c *this must be a resizable matrix. - * This excludes (non-square) fixed-size matrices, block-expressions and maps. - * - * \sa transpose(), adjoint(), transposeInPlace() */ -template -EIGEN_DEVICE_FUNC inline void MatrixBase::adjointInPlace() -{ - derived() = adjoint().eval(); -} - -#ifndef EIGEN_NO_DEBUG - -// The following is to detect aliasing problems in most common cases. - -namespace internal { - -template -struct check_transpose_aliasing_compile_time_selector -{ - enum { ret = bool(blas_traits::IsTransposed) != DestIsTransposed }; -}; - -template -struct check_transpose_aliasing_compile_time_selector > -{ - enum { ret = bool(blas_traits::IsTransposed) != DestIsTransposed - || bool(blas_traits::IsTransposed) != DestIsTransposed - }; -}; - -template -struct check_transpose_aliasing_run_time_selector -{ - static bool run(const Scalar* dest, const OtherDerived& src) - { - return (bool(blas_traits::IsTransposed) != DestIsTransposed) && (dest!=0 && dest==(const Scalar*)extract_data(src)); - } -}; - -template -struct check_transpose_aliasing_run_time_selector > -{ - static bool run(const Scalar* dest, const CwiseBinaryOp& src) - { - return ((blas_traits::IsTransposed != DestIsTransposed) && (dest!=0 && dest==(const Scalar*)extract_data(src.lhs()))) - || ((blas_traits::IsTransposed != DestIsTransposed) && (dest!=0 && dest==(const Scalar*)extract_data(src.rhs()))); - } -}; - -// the following selector, checkTransposeAliasing_impl, based on MightHaveTransposeAliasing, -// is because when the condition controlling the assert is known at compile time, ICC emits a warning. -// This is actually a good warning: in expressions that don't have any transposing, the condition is -// known at compile time to be false, and using that, we can avoid generating the code of the assert again -// and again for all these expressions that don't need it. - -template::IsTransposed,OtherDerived>::ret - > -struct checkTransposeAliasing_impl -{ - static void run(const Derived& dst, const OtherDerived& other) - { - eigen_assert((!check_transpose_aliasing_run_time_selector - ::IsTransposed,OtherDerived> - ::run(extract_data(dst), other)) - && "aliasing detected during transposition, use transposeInPlace() " - "or evaluate the rhs into a temporary using .eval()"); - - } -}; - -template -struct checkTransposeAliasing_impl -{ - static void run(const Derived&, const OtherDerived&) - { - } -}; - -template -void check_for_aliasing(const Dst &dst, const Src &src) -{ - internal::checkTransposeAliasing_impl::run(dst, src); -} - -} // end namespace internal - -#endif // EIGEN_NO_DEBUG - -} // end namespace Eigen - -#endif // EIGEN_TRANSPOSE_H diff --git a/Eigen/src/Core/Transpositions.h b/Eigen/src/Core/Transpositions.h deleted file mode 100644 index 19c17bb4a..000000000 --- a/Eigen/src/Core/Transpositions.h +++ /dev/null @@ -1,407 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010-2011 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRANSPOSITIONS_H -#define EIGEN_TRANSPOSITIONS_H - -namespace Eigen { - -template -class TranspositionsBase -{ - typedef internal::traits Traits; - - public: - - typedef typename Traits::IndicesType IndicesType; - typedef typename IndicesType::Scalar StorageIndex; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - Derived& derived() { return *static_cast(this); } - const Derived& derived() const { return *static_cast(this); } - - /** Copies the \a other transpositions into \c *this */ - template - Derived& operator=(const TranspositionsBase& other) - { - indices() = other.indices(); - return derived(); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** This is a special case of the templated operator=. Its purpose is to - * prevent a default operator= from hiding the templated operator=. - */ - Derived& operator=(const TranspositionsBase& other) - { - indices() = other.indices(); - return derived(); - } - #endif - - /** \returns the number of transpositions */ - Index size() const { return indices().size(); } - /** \returns the number of rows of the equivalent permutation matrix */ - Index rows() const { return indices().size(); } - /** \returns the number of columns of the equivalent permutation matrix */ - Index cols() const { return indices().size(); } - - /** Direct access to the underlying index vector */ - inline const StorageIndex& coeff(Index i) const { return indices().coeff(i); } - /** Direct access to the underlying index vector */ - inline StorageIndex& coeffRef(Index i) { return indices().coeffRef(i); } - /** Direct access to the underlying index vector */ - inline const StorageIndex& operator()(Index i) const { return indices()(i); } - /** Direct access to the underlying index vector */ - inline StorageIndex& operator()(Index i) { return indices()(i); } - /** Direct access to the underlying index vector */ - inline const StorageIndex& operator[](Index i) const { return indices()(i); } - /** Direct access to the underlying index vector */ - inline StorageIndex& operator[](Index i) { return indices()(i); } - - /** const version of indices(). */ - const IndicesType& indices() const { return derived().indices(); } - /** \returns a reference to the stored array representing the transpositions. */ - IndicesType& indices() { return derived().indices(); } - - /** Resizes to given size. */ - inline void resize(Index newSize) - { - indices().resize(newSize); - } - - /** Sets \c *this to represents an identity transformation */ - void setIdentity() - { - for(StorageIndex i = 0; i < indices().size(); ++i) - coeffRef(i) = i; - } - - // FIXME: do we want such methods ? - // might be usefull when the target matrix expression is complex, e.g.: - // object.matrix().block(..,..,..,..) = trans * object.matrix().block(..,..,..,..); - /* - template - void applyForwardToRows(MatrixType& mat) const - { - for(Index k=0 ; k - void applyBackwardToRows(MatrixType& mat) const - { - for(Index k=size()-1 ; k>=0 ; --k) - if(m_indices(k)!=k) - mat.row(k).swap(mat.row(m_indices(k))); - } - */ - - /** \returns the inverse transformation */ - inline Transpose inverse() const - { return Transpose(derived()); } - - /** \returns the tranpose transformation */ - inline Transpose transpose() const - { return Transpose(derived()); } - - protected: -}; - -namespace internal { -template -struct traits > - : traits > -{ - typedef Matrix<_StorageIndex, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1> IndicesType; - typedef TranspositionsStorage StorageKind; -}; -} - -/** \class Transpositions - * \ingroup Core_Module - * - * \brief Represents a sequence of transpositions (row/column interchange) - * - * \tparam SizeAtCompileTime the number of transpositions, or Dynamic - * \tparam MaxSizeAtCompileTime the maximum number of transpositions, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it. - * - * This class represents a permutation transformation as a sequence of \em n transpositions - * \f$[T_{n-1} \ldots T_{i} \ldots T_{0}]\f$. It is internally stored as a vector of integers \c indices. - * Each transposition \f$ T_{i} \f$ applied on the left of a matrix (\f$ T_{i} M\f$) interchanges - * the rows \c i and \c indices[i] of the matrix \c M. - * A transposition applied on the right (e.g., \f$ M T_{i}\f$) yields a column interchange. - * - * Compared to the class PermutationMatrix, such a sequence of transpositions is what is - * computed during a decomposition with pivoting, and it is faster when applying the permutation in-place. - * - * To apply a sequence of transpositions to a matrix, simply use the operator * as in the following example: - * \code - * Transpositions tr; - * MatrixXf mat; - * mat = tr * mat; - * \endcode - * In this example, we detect that the matrix appears on both side, and so the transpositions - * are applied in-place without any temporary or extra copy. - * - * \sa class PermutationMatrix - */ - -template -class Transpositions : public TranspositionsBase > -{ - typedef internal::traits Traits; - public: - - typedef TranspositionsBase Base; - typedef typename Traits::IndicesType IndicesType; - typedef typename IndicesType::Scalar StorageIndex; - - inline Transpositions() {} - - /** Copy constructor. */ - template - inline Transpositions(const TranspositionsBase& other) - : m_indices(other.indices()) {} - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** Standard copy constructor. Defined only to prevent a default copy constructor - * from hiding the other templated constructor */ - inline Transpositions(const Transpositions& other) : m_indices(other.indices()) {} - #endif - - /** Generic constructor from expression of the transposition indices. */ - template - explicit inline Transpositions(const MatrixBase& indices) : m_indices(indices) - {} - - /** Copies the \a other transpositions into \c *this */ - template - Transpositions& operator=(const TranspositionsBase& other) - { - return Base::operator=(other); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** This is a special case of the templated operator=. Its purpose is to - * prevent a default operator= from hiding the templated operator=. - */ - Transpositions& operator=(const Transpositions& other) - { - m_indices = other.m_indices; - return *this; - } - #endif - - /** Constructs an uninitialized permutation matrix of given size. - */ - inline Transpositions(Index size) : m_indices(size) - {} - - /** const version of indices(). */ - const IndicesType& indices() const { return m_indices; } - /** \returns a reference to the stored array representing the transpositions. */ - IndicesType& indices() { return m_indices; } - - protected: - - IndicesType m_indices; -}; - - -namespace internal { -template -struct traits,_PacketAccess> > - : traits > -{ - typedef Map, _PacketAccess> IndicesType; - typedef _StorageIndex StorageIndex; - typedef TranspositionsStorage StorageKind; -}; -} - -template -class Map,PacketAccess> - : public TranspositionsBase,PacketAccess> > -{ - typedef internal::traits Traits; - public: - - typedef TranspositionsBase Base; - typedef typename Traits::IndicesType IndicesType; - typedef typename IndicesType::Scalar StorageIndex; - - explicit inline Map(const StorageIndex* indicesPtr) - : m_indices(indicesPtr) - {} - - inline Map(const StorageIndex* indicesPtr, Index size) - : m_indices(indicesPtr,size) - {} - - /** Copies the \a other transpositions into \c *this */ - template - Map& operator=(const TranspositionsBase& other) - { - return Base::operator=(other); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** This is a special case of the templated operator=. Its purpose is to - * prevent a default operator= from hiding the templated operator=. - */ - Map& operator=(const Map& other) - { - m_indices = other.m_indices; - return *this; - } - #endif - - /** const version of indices(). */ - const IndicesType& indices() const { return m_indices; } - - /** \returns a reference to the stored array representing the transpositions. */ - IndicesType& indices() { return m_indices; } - - protected: - - IndicesType m_indices; -}; - -namespace internal { -template -struct traits > - : traits > -{ - typedef TranspositionsStorage StorageKind; -}; -} - -template -class TranspositionsWrapper - : public TranspositionsBase > -{ - typedef internal::traits Traits; - public: - - typedef TranspositionsBase Base; - typedef typename Traits::IndicesType IndicesType; - typedef typename IndicesType::Scalar StorageIndex; - - explicit inline TranspositionsWrapper(IndicesType& indices) - : m_indices(indices) - {} - - /** Copies the \a other transpositions into \c *this */ - template - TranspositionsWrapper& operator=(const TranspositionsBase& other) - { - return Base::operator=(other); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** This is a special case of the templated operator=. Its purpose is to - * prevent a default operator= from hiding the templated operator=. - */ - TranspositionsWrapper& operator=(const TranspositionsWrapper& other) - { - m_indices = other.m_indices; - return *this; - } - #endif - - /** const version of indices(). */ - const IndicesType& indices() const { return m_indices; } - - /** \returns a reference to the stored array representing the transpositions. */ - IndicesType& indices() { return m_indices; } - - protected: - - typename IndicesType::Nested m_indices; -}; - - - -/** \returns the \a matrix with the \a transpositions applied to the columns. - */ -template -EIGEN_DEVICE_FUNC -const Product -operator*(const MatrixBase &matrix, - const TranspositionsBase& transpositions) -{ - return Product - (matrix.derived(), transpositions.derived()); -} - -/** \returns the \a matrix with the \a transpositions applied to the rows. - */ -template -EIGEN_DEVICE_FUNC -const Product -operator*(const TranspositionsBase &transpositions, - const MatrixBase& matrix) -{ - return Product - (transpositions.derived(), matrix.derived()); -} - -// Template partial specialization for transposed/inverse transpositions - -namespace internal { - -template -struct traits > > - : traits -{}; - -} // end namespace internal - -template -class Transpose > -{ - typedef TranspositionsDerived TranspositionType; - typedef typename TranspositionType::IndicesType IndicesType; - public: - - explicit Transpose(const TranspositionType& t) : m_transpositions(t) {} - - Index size() const { return m_transpositions.size(); } - Index rows() const { return m_transpositions.size(); } - Index cols() const { return m_transpositions.size(); } - - /** \returns the \a matrix with the inverse transpositions applied to the columns. - */ - template friend - const Product - operator*(const MatrixBase& matrix, const Transpose& trt) - { - return Product(matrix.derived(), trt.derived()); - } - - /** \returns the \a matrix with the inverse transpositions applied to the rows. - */ - template - const Product - operator*(const MatrixBase& matrix) const - { - return Product(*this, matrix.derived()); - } - - const TranspositionType& nestedExpression() const { return m_transpositions; } - - protected: - const TranspositionType& m_transpositions; -}; - -} // end namespace Eigen - -#endif // EIGEN_TRANSPOSITIONS_H diff --git a/Eigen/src/Core/TriangularMatrix.h b/Eigen/src/Core/TriangularMatrix.h deleted file mode 100644 index ed80da36a..000000000 --- a/Eigen/src/Core/TriangularMatrix.h +++ /dev/null @@ -1,984 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Benoit Jacob -// Copyright (C) 2008-2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRIANGULARMATRIX_H -#define EIGEN_TRIANGULARMATRIX_H - -namespace Eigen { - -namespace internal { - -template struct triangular_solve_retval; - -} - -/** \class TriangularBase - * \ingroup Core_Module - * - * \brief Base class for triangular part in a matrix - */ -template class TriangularBase : public EigenBase -{ - public: - - enum { - Mode = internal::traits::Mode, - RowsAtCompileTime = internal::traits::RowsAtCompileTime, - ColsAtCompileTime = internal::traits::ColsAtCompileTime, - MaxRowsAtCompileTime = internal::traits::MaxRowsAtCompileTime, - MaxColsAtCompileTime = internal::traits::MaxColsAtCompileTime, - - SizeAtCompileTime = (internal::size_at_compile_time::RowsAtCompileTime, - internal::traits::ColsAtCompileTime>::ret), - /**< This is equal to the number of coefficients, i.e. the number of - * rows times the number of columns, or to \a Dynamic if this is not - * known at compile-time. \sa RowsAtCompileTime, ColsAtCompileTime */ - - MaxSizeAtCompileTime = (internal::size_at_compile_time::MaxRowsAtCompileTime, - internal::traits::MaxColsAtCompileTime>::ret) - - }; - typedef typename internal::traits::Scalar Scalar; - typedef typename internal::traits::StorageKind StorageKind; - typedef typename internal::traits::StorageIndex StorageIndex; - typedef typename internal::traits::FullMatrixType DenseMatrixType; - typedef DenseMatrixType DenseType; - typedef Derived const& Nested; - - EIGEN_DEVICE_FUNC - inline TriangularBase() { eigen_assert(!((Mode&UnitDiag) && (Mode&ZeroDiag))); } - - EIGEN_DEVICE_FUNC - inline Index rows() const { return derived().rows(); } - EIGEN_DEVICE_FUNC - inline Index cols() const { return derived().cols(); } - EIGEN_DEVICE_FUNC - inline Index outerStride() const { return derived().outerStride(); } - EIGEN_DEVICE_FUNC - inline Index innerStride() const { return derived().innerStride(); } - - // dummy resize function - void resize(Index rows, Index cols) - { - EIGEN_UNUSED_VARIABLE(rows); - EIGEN_UNUSED_VARIABLE(cols); - eigen_assert(rows==this->rows() && cols==this->cols()); - } - - EIGEN_DEVICE_FUNC - inline Scalar coeff(Index row, Index col) const { return derived().coeff(row,col); } - EIGEN_DEVICE_FUNC - inline Scalar& coeffRef(Index row, Index col) { return derived().coeffRef(row,col); } - - /** \see MatrixBase::copyCoeff(row,col) - */ - template - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE void copyCoeff(Index row, Index col, Other& other) - { - derived().coeffRef(row, col) = other.coeff(row, col); - } - - EIGEN_DEVICE_FUNC - inline Scalar operator()(Index row, Index col) const - { - check_coordinates(row, col); - return coeff(row,col); - } - EIGEN_DEVICE_FUNC - inline Scalar& operator()(Index row, Index col) - { - check_coordinates(row, col); - return coeffRef(row,col); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - EIGEN_DEVICE_FUNC - inline const Derived& derived() const { return *static_cast(this); } - EIGEN_DEVICE_FUNC - inline Derived& derived() { return *static_cast(this); } - #endif // not EIGEN_PARSED_BY_DOXYGEN - - template - EIGEN_DEVICE_FUNC - void evalTo(MatrixBase &other) const; - template - EIGEN_DEVICE_FUNC - void evalToLazy(MatrixBase &other) const; - - EIGEN_DEVICE_FUNC - DenseMatrixType toDenseMatrix() const - { - DenseMatrixType res(rows(), cols()); - evalToLazy(res); - return res; - } - - protected: - - void check_coordinates(Index row, Index col) const - { - EIGEN_ONLY_USED_FOR_DEBUG(row); - EIGEN_ONLY_USED_FOR_DEBUG(col); - eigen_assert(col>=0 && col=0 && row=row) - || (mode==Lower && col<=row) - || ((mode==StrictlyUpper || mode==UnitUpper) && col>row) - || ((mode==StrictlyLower || mode==UnitLower) && col -struct traits > : traits -{ - typedef typename ref_selector::non_const_type MatrixTypeNested; - typedef typename remove_reference::type MatrixTypeNestedNonRef; - typedef typename remove_all::type MatrixTypeNestedCleaned; - typedef typename MatrixType::PlainObject FullMatrixType; - typedef MatrixType ExpressionType; - enum { - Mode = _Mode, - FlagsLvalueBit = is_lvalue::value ? LvalueBit : 0, - Flags = (MatrixTypeNestedCleaned::Flags & (HereditaryBits | FlagsLvalueBit) & (~(PacketAccessBit | DirectAccessBit | LinearAccessBit))) - }; -}; -} - -template class TriangularViewImpl; - -template class TriangularView - : public TriangularViewImpl<_MatrixType, _Mode, typename internal::traits<_MatrixType>::StorageKind > -{ - public: - - typedef TriangularViewImpl<_MatrixType, _Mode, typename internal::traits<_MatrixType>::StorageKind > Base; - typedef typename internal::traits::Scalar Scalar; - typedef _MatrixType MatrixType; - - protected: - typedef typename internal::traits::MatrixTypeNested MatrixTypeNested; - typedef typename internal::traits::MatrixTypeNestedNonRef MatrixTypeNestedNonRef; - - typedef typename internal::remove_all::type MatrixConjugateReturnType; - - public: - - typedef typename internal::traits::StorageKind StorageKind; - typedef typename internal::traits::MatrixTypeNestedCleaned NestedExpression; - - enum { - Mode = _Mode, - Flags = internal::traits::Flags, - TransposeMode = (Mode & Upper ? Lower : 0) - | (Mode & Lower ? Upper : 0) - | (Mode & (UnitDiag)) - | (Mode & (ZeroDiag)), - IsVectorAtCompileTime = false - }; - - EIGEN_DEVICE_FUNC - explicit inline TriangularView(MatrixType& matrix) : m_matrix(matrix) - {} - - using Base::operator=; - TriangularView& operator=(const TriangularView &other) - { return Base::operator=(other); } - - /** \copydoc EigenBase::rows() */ - EIGEN_DEVICE_FUNC - inline Index rows() const { return m_matrix.rows(); } - /** \copydoc EigenBase::cols() */ - EIGEN_DEVICE_FUNC - inline Index cols() const { return m_matrix.cols(); } - - /** \returns a const reference to the nested expression */ - EIGEN_DEVICE_FUNC - const NestedExpression& nestedExpression() const { return m_matrix; } - - /** \returns a reference to the nested expression */ - EIGEN_DEVICE_FUNC - NestedExpression& nestedExpression() { return m_matrix; } - - typedef TriangularView ConjugateReturnType; - /** \sa MatrixBase::conjugate() const */ - EIGEN_DEVICE_FUNC - inline const ConjugateReturnType conjugate() const - { return ConjugateReturnType(m_matrix.conjugate()); } - - typedef TriangularView AdjointReturnType; - /** \sa MatrixBase::adjoint() const */ - EIGEN_DEVICE_FUNC - inline const AdjointReturnType adjoint() const - { return AdjointReturnType(m_matrix.adjoint()); } - - typedef TriangularView TransposeReturnType; - /** \sa MatrixBase::transpose() */ - EIGEN_DEVICE_FUNC - inline TransposeReturnType transpose() - { - EIGEN_STATIC_ASSERT_LVALUE(MatrixType) - typename MatrixType::TransposeReturnType tmp(m_matrix); - return TransposeReturnType(tmp); - } - - typedef TriangularView ConstTransposeReturnType; - /** \sa MatrixBase::transpose() const */ - EIGEN_DEVICE_FUNC - inline const ConstTransposeReturnType transpose() const - { - return ConstTransposeReturnType(m_matrix.transpose()); - } - - template - EIGEN_DEVICE_FUNC - inline const Solve - solve(const MatrixBase& other) const - { return Solve(*this, other.derived()); } - - // workaround MSVC ICE - #if EIGEN_COMP_MSVC - template - EIGEN_DEVICE_FUNC - inline const internal::triangular_solve_retval - solve(const MatrixBase& other) const - { return Base::template solve(other); } - #else - using Base::solve; - #endif - - /** \returns a selfadjoint view of the referenced triangular part which must be either \c #Upper or \c #Lower. - * - * This is a shortcut for \code this->nestedExpression().selfadjointView<(*this)::Mode>() \endcode - * \sa MatrixBase::selfadjointView() */ - EIGEN_DEVICE_FUNC - SelfAdjointView selfadjointView() - { - EIGEN_STATIC_ASSERT((Mode&(UnitDiag|ZeroDiag))==0,PROGRAMMING_ERROR); - return SelfAdjointView(m_matrix); - } - - /** This is the const version of selfadjointView() */ - EIGEN_DEVICE_FUNC - const SelfAdjointView selfadjointView() const - { - EIGEN_STATIC_ASSERT((Mode&(UnitDiag|ZeroDiag))==0,PROGRAMMING_ERROR); - return SelfAdjointView(m_matrix); - } - - - /** \returns the determinant of the triangular matrix - * \sa MatrixBase::determinant() */ - EIGEN_DEVICE_FUNC - Scalar determinant() const - { - if (Mode & UnitDiag) - return 1; - else if (Mode & ZeroDiag) - return 0; - else - return m_matrix.diagonal().prod(); - } - - protected: - - MatrixTypeNested m_matrix; -}; - -/** \ingroup Core_Module - * - * \brief Base class for a triangular part in a \b dense matrix - * - * This class is an abstract base class of class TriangularView, and objects of type TriangularViewImpl cannot be instantiated. - * It extends class TriangularView with additional methods which available for dense expressions only. - * - * \sa class TriangularView, MatrixBase::triangularView() - */ -template class TriangularViewImpl<_MatrixType,_Mode,Dense> - : public TriangularBase > -{ - public: - - typedef TriangularView<_MatrixType, _Mode> TriangularViewType; - typedef TriangularBase Base; - typedef typename internal::traits::Scalar Scalar; - - typedef _MatrixType MatrixType; - typedef typename MatrixType::PlainObject DenseMatrixType; - typedef DenseMatrixType PlainObject; - - public: - using Base::evalToLazy; - using Base::derived; - - typedef typename internal::traits::StorageKind StorageKind; - - enum { - Mode = _Mode, - Flags = internal::traits::Flags - }; - - /** \returns the outer-stride of the underlying dense matrix - * \sa DenseCoeffsBase::outerStride() */ - EIGEN_DEVICE_FUNC - inline Index outerStride() const { return derived().nestedExpression().outerStride(); } - /** \returns the inner-stride of the underlying dense matrix - * \sa DenseCoeffsBase::innerStride() */ - EIGEN_DEVICE_FUNC - inline Index innerStride() const { return derived().nestedExpression().innerStride(); } - - /** \sa MatrixBase::operator+=() */ - template - EIGEN_DEVICE_FUNC - TriangularViewType& operator+=(const DenseBase& other) { - internal::call_assignment_no_alias(derived(), other.derived(), internal::add_assign_op()); - return derived(); - } - /** \sa MatrixBase::operator-=() */ - template - EIGEN_DEVICE_FUNC - TriangularViewType& operator-=(const DenseBase& other) { - internal::call_assignment_no_alias(derived(), other.derived(), internal::sub_assign_op()); - return derived(); - } - - /** \sa MatrixBase::operator*=() */ - EIGEN_DEVICE_FUNC - TriangularViewType& operator*=(const typename internal::traits::Scalar& other) { return *this = derived().nestedExpression() * other; } - /** \sa DenseBase::operator/=() */ - EIGEN_DEVICE_FUNC - TriangularViewType& operator/=(const typename internal::traits::Scalar& other) { return *this = derived().nestedExpression() / other; } - - /** \sa MatrixBase::fill() */ - EIGEN_DEVICE_FUNC - void fill(const Scalar& value) { setConstant(value); } - /** \sa MatrixBase::setConstant() */ - EIGEN_DEVICE_FUNC - TriangularViewType& setConstant(const Scalar& value) - { return *this = MatrixType::Constant(derived().rows(), derived().cols(), value); } - /** \sa MatrixBase::setZero() */ - EIGEN_DEVICE_FUNC - TriangularViewType& setZero() { return setConstant(Scalar(0)); } - /** \sa MatrixBase::setOnes() */ - EIGEN_DEVICE_FUNC - TriangularViewType& setOnes() { return setConstant(Scalar(1)); } - - /** \sa MatrixBase::coeff() - * \warning the coordinates must fit into the referenced triangular part - */ - EIGEN_DEVICE_FUNC - inline Scalar coeff(Index row, Index col) const - { - Base::check_coordinates_internal(row, col); - return derived().nestedExpression().coeff(row, col); - } - - /** \sa MatrixBase::coeffRef() - * \warning the coordinates must fit into the referenced triangular part - */ - EIGEN_DEVICE_FUNC - inline Scalar& coeffRef(Index row, Index col) - { - EIGEN_STATIC_ASSERT_LVALUE(TriangularViewType); - Base::check_coordinates_internal(row, col); - return derived().nestedExpression().coeffRef(row, col); - } - - /** Assigns a triangular matrix to a triangular part of a dense matrix */ - template - EIGEN_DEVICE_FUNC - TriangularViewType& operator=(const TriangularBase& other); - - /** Shortcut for\code *this = other.other.triangularView<(*this)::Mode>() \endcode */ - template - EIGEN_DEVICE_FUNC - TriangularViewType& operator=(const MatrixBase& other); - -#ifndef EIGEN_PARSED_BY_DOXYGEN - EIGEN_DEVICE_FUNC - TriangularViewType& operator=(const TriangularViewImpl& other) - { return *this = other.derived().nestedExpression(); } - - /** \deprecated */ - template - EIGEN_DEVICE_FUNC - void lazyAssign(const TriangularBase& other); - - /** \deprecated */ - template - EIGEN_DEVICE_FUNC - void lazyAssign(const MatrixBase& other); -#endif - - /** Efficient triangular matrix times vector/matrix product */ - template - EIGEN_DEVICE_FUNC - const Product - operator*(const MatrixBase& rhs) const - { - return Product(derived(), rhs.derived()); - } - - /** Efficient vector/matrix times triangular matrix product */ - template friend - EIGEN_DEVICE_FUNC - const Product - operator*(const MatrixBase& lhs, const TriangularViewImpl& rhs) - { - return Product(lhs.derived(),rhs.derived()); - } - - /** \returns the product of the inverse of \c *this with \a other, \a *this being triangular. - * - * This function computes the inverse-matrix matrix product inverse(\c *this) * \a other if - * \a Side==OnTheLeft (the default), or the right-inverse-multiply \a other * inverse(\c *this) if - * \a Side==OnTheRight. - * - * Note that the template parameter \c Side can be ommitted, in which case \c Side==OnTheLeft - * - * The matrix \c *this must be triangular and invertible (i.e., all the coefficients of the - * diagonal must be non zero). It works as a forward (resp. backward) substitution if \c *this - * is an upper (resp. lower) triangular matrix. - * - * Example: \include Triangular_solve.cpp - * Output: \verbinclude Triangular_solve.out - * - * This function returns an expression of the inverse-multiply and can works in-place if it is assigned - * to the same matrix or vector \a other. - * - * For users coming from BLAS, this function (and more specifically solveInPlace()) offer - * all the operations supported by the \c *TRSV and \c *TRSM BLAS routines. - * - * \sa TriangularView::solveInPlace() - */ - template - inline const internal::triangular_solve_retval - solve(const MatrixBase& other) const; - - /** "in-place" version of TriangularView::solve() where the result is written in \a other - * - * \warning The parameter is only marked 'const' to make the C++ compiler accept a temporary expression here. - * This function will const_cast it, so constness isn't honored here. - * - * Note that the template parameter \c Side can be ommitted, in which case \c Side==OnTheLeft - * - * See TriangularView:solve() for the details. - */ - template - EIGEN_DEVICE_FUNC - void solveInPlace(const MatrixBase& other) const; - - template - EIGEN_DEVICE_FUNC - void solveInPlace(const MatrixBase& other) const - { return solveInPlace(other); } - - /** Swaps the coefficients of the common triangular parts of two matrices */ - template - EIGEN_DEVICE_FUNC -#ifdef EIGEN_PARSED_BY_DOXYGEN - void swap(TriangularBase &other) -#else - void swap(TriangularBase const & other) -#endif - { - EIGEN_STATIC_ASSERT_LVALUE(OtherDerived); - call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op()); - } - - /** \deprecated - * Shortcut for \code (*this).swap(other.triangularView<(*this)::Mode>()) \endcode */ - template - EIGEN_DEVICE_FUNC - void swap(MatrixBase const & other) - { - EIGEN_STATIC_ASSERT_LVALUE(OtherDerived); - call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op()); - } - - template - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE void _solve_impl(const RhsType &rhs, DstType &dst) const { - if(!internal::is_same_dense(dst,rhs)) - dst = rhs; - this->solveInPlace(dst); - } - - template - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE TriangularViewType& _assignProduct(const ProductType& prod, const Scalar& alpha, bool beta); -}; - -/*************************************************************************** -* Implementation of triangular evaluation/assignment -***************************************************************************/ - -#ifndef EIGEN_PARSED_BY_DOXYGEN -// FIXME should we keep that possibility -template -template -EIGEN_DEVICE_FUNC inline TriangularView& -TriangularViewImpl::operator=(const MatrixBase& other) -{ - internal::call_assignment_no_alias(derived(), other.derived(), internal::assign_op()); - return derived(); -} - -// FIXME should we keep that possibility -template -template -EIGEN_DEVICE_FUNC void TriangularViewImpl::lazyAssign(const MatrixBase& other) -{ - internal::call_assignment_no_alias(derived(), other.template triangularView()); -} - - - -template -template -EIGEN_DEVICE_FUNC inline TriangularView& -TriangularViewImpl::operator=(const TriangularBase& other) -{ - eigen_assert(Mode == int(OtherDerived::Mode)); - internal::call_assignment(derived(), other.derived()); - return derived(); -} - -template -template -EIGEN_DEVICE_FUNC void TriangularViewImpl::lazyAssign(const TriangularBase& other) -{ - eigen_assert(Mode == int(OtherDerived::Mode)); - internal::call_assignment_no_alias(derived(), other.derived()); -} -#endif - -/*************************************************************************** -* Implementation of TriangularBase methods -***************************************************************************/ - -/** Assigns a triangular or selfadjoint matrix to a dense matrix. - * If the matrix is triangular, the opposite part is set to zero. */ -template -template -EIGEN_DEVICE_FUNC void TriangularBase::evalTo(MatrixBase &other) const -{ - evalToLazy(other.derived()); -} - -/*************************************************************************** -* Implementation of TriangularView methods -***************************************************************************/ - -/*************************************************************************** -* Implementation of MatrixBase methods -***************************************************************************/ - -/** - * \returns an expression of a triangular view extracted from the current matrix - * - * The parameter \a Mode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper, - * \c #Lower, \c #StrictlyLower, \c #UnitLower. - * - * Example: \include MatrixBase_triangularView.cpp - * Output: \verbinclude MatrixBase_triangularView.out - * - * \sa class TriangularView - */ -template -template -EIGEN_DEVICE_FUNC -typename MatrixBase::template TriangularViewReturnType::Type -MatrixBase::triangularView() -{ - return typename TriangularViewReturnType::Type(derived()); -} - -/** This is the const version of MatrixBase::triangularView() */ -template -template -EIGEN_DEVICE_FUNC -typename MatrixBase::template ConstTriangularViewReturnType::Type -MatrixBase::triangularView() const -{ - return typename ConstTriangularViewReturnType::Type(derived()); -} - -/** \returns true if *this is approximately equal to an upper triangular matrix, - * within the precision given by \a prec. - * - * \sa isLowerTriangular() - */ -template -bool MatrixBase::isUpperTriangular(const RealScalar& prec) const -{ - RealScalar maxAbsOnUpperPart = static_cast(-1); - for(Index j = 0; j < cols(); ++j) - { - Index maxi = numext::mini(j, rows()-1); - for(Index i = 0; i <= maxi; ++i) - { - RealScalar absValue = numext::abs(coeff(i,j)); - if(absValue > maxAbsOnUpperPart) maxAbsOnUpperPart = absValue; - } - } - RealScalar threshold = maxAbsOnUpperPart * prec; - for(Index j = 0; j < cols(); ++j) - for(Index i = j+1; i < rows(); ++i) - if(numext::abs(coeff(i, j)) > threshold) return false; - return true; -} - -/** \returns true if *this is approximately equal to a lower triangular matrix, - * within the precision given by \a prec. - * - * \sa isUpperTriangular() - */ -template -bool MatrixBase::isLowerTriangular(const RealScalar& prec) const -{ - RealScalar maxAbsOnLowerPart = static_cast(-1); - for(Index j = 0; j < cols(); ++j) - for(Index i = j; i < rows(); ++i) - { - RealScalar absValue = numext::abs(coeff(i,j)); - if(absValue > maxAbsOnLowerPart) maxAbsOnLowerPart = absValue; - } - RealScalar threshold = maxAbsOnLowerPart * prec; - for(Index j = 1; j < cols(); ++j) - { - Index maxi = numext::mini(j, rows()-1); - for(Index i = 0; i < maxi; ++i) - if(numext::abs(coeff(i, j)) > threshold) return false; - } - return true; -} - - -/*************************************************************************** -**************************************************************************** -* Evaluators and Assignment of triangular expressions -*************************************************************************** -***************************************************************************/ - -namespace internal { - - -// TODO currently a triangular expression has the form TriangularView<.,.> -// in the future triangular-ness should be defined by the expression traits -// such that Transpose > is valid. (currently TriangularBase::transpose() is overloaded to make it work) -template -struct evaluator_traits > -{ - typedef typename storage_kind_to_evaluator_kind::Kind Kind; - typedef typename glue_shapes::Shape, TriangularShape>::type Shape; -}; - -template -struct unary_evaluator, IndexBased> - : evaluator::type> -{ - typedef TriangularView XprType; - typedef evaluator::type> Base; - unary_evaluator(const XprType &xpr) : Base(xpr.nestedExpression()) {} -}; - -// Additional assignment kinds: -struct Triangular2Triangular {}; -struct Triangular2Dense {}; -struct Dense2Triangular {}; - - -template struct triangular_assignment_loop; - - -/** \internal Specialization of the dense assignment kernel for triangular matrices. - * The main difference is that the triangular, diagonal, and opposite parts are processed through three different functions. - * \tparam UpLo must be either Lower or Upper - * \tparam Mode must be either 0, UnitDiag, ZeroDiag, or SelfAdjoint - */ -template -class triangular_dense_assignment_kernel : public generic_dense_assignment_kernel -{ -protected: - typedef generic_dense_assignment_kernel Base; - typedef typename Base::DstXprType DstXprType; - typedef typename Base::SrcXprType SrcXprType; - using Base::m_dst; - using Base::m_src; - using Base::m_functor; -public: - - typedef typename Base::DstEvaluatorType DstEvaluatorType; - typedef typename Base::SrcEvaluatorType SrcEvaluatorType; - typedef typename Base::Scalar Scalar; - typedef typename Base::AssignmentTraits AssignmentTraits; - - - EIGEN_DEVICE_FUNC triangular_dense_assignment_kernel(DstEvaluatorType &dst, const SrcEvaluatorType &src, const Functor &func, DstXprType& dstExpr) - : Base(dst, src, func, dstExpr) - {} - -#ifdef EIGEN_INTERNAL_DEBUGGING - EIGEN_DEVICE_FUNC void assignCoeff(Index row, Index col) - { - eigen_internal_assert(row!=col); - Base::assignCoeff(row,col); - } -#else - using Base::assignCoeff; -#endif - - EIGEN_DEVICE_FUNC void assignDiagonalCoeff(Index id) - { - if(Mode==UnitDiag && SetOpposite) m_functor.assignCoeff(m_dst.coeffRef(id,id), Scalar(1)); - else if(Mode==ZeroDiag && SetOpposite) m_functor.assignCoeff(m_dst.coeffRef(id,id), Scalar(0)); - else if(Mode==0) Base::assignCoeff(id,id); - } - - EIGEN_DEVICE_FUNC void assignOppositeCoeff(Index row, Index col) - { - eigen_internal_assert(row!=col); - if(SetOpposite) - m_functor.assignCoeff(m_dst.coeffRef(row,col), Scalar(0)); - } -}; - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -void call_triangular_assignment_loop(DstXprType& dst, const SrcXprType& src, const Functor &func) -{ - typedef evaluator DstEvaluatorType; - typedef evaluator SrcEvaluatorType; - - SrcEvaluatorType srcEvaluator(src); - - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - DstEvaluatorType dstEvaluator(dst); - - typedef triangular_dense_assignment_kernel< Mode&(Lower|Upper),Mode&(UnitDiag|ZeroDiag|SelfAdjoint),SetOpposite, - DstEvaluatorType,SrcEvaluatorType,Functor> Kernel; - Kernel kernel(dstEvaluator, srcEvaluator, func, dst.const_cast_derived()); - - enum { - unroll = DstXprType::SizeAtCompileTime != Dynamic - && SrcEvaluatorType::CoeffReadCost < HugeCost - && DstXprType::SizeAtCompileTime * (DstEvaluatorType::CoeffReadCost+SrcEvaluatorType::CoeffReadCost) / 2 <= EIGEN_UNROLLING_LIMIT - }; - - triangular_assignment_loop::run(kernel); -} - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -void call_triangular_assignment_loop(DstXprType& dst, const SrcXprType& src) -{ - call_triangular_assignment_loop(dst, src, internal::assign_op()); -} - -template<> struct AssignmentKind { typedef Triangular2Triangular Kind; }; -template<> struct AssignmentKind { typedef Triangular2Dense Kind; }; -template<> struct AssignmentKind { typedef Dense2Triangular Kind; }; - - -template< typename DstXprType, typename SrcXprType, typename Functor> -struct Assignment -{ - EIGEN_DEVICE_FUNC static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) - { - eigen_assert(int(DstXprType::Mode) == int(SrcXprType::Mode)); - - call_triangular_assignment_loop(dst, src, func); - } -}; - -template< typename DstXprType, typename SrcXprType, typename Functor> -struct Assignment -{ - EIGEN_DEVICE_FUNC static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) - { - call_triangular_assignment_loop(dst, src, func); - } -}; - -template< typename DstXprType, typename SrcXprType, typename Functor> -struct Assignment -{ - EIGEN_DEVICE_FUNC static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) - { - call_triangular_assignment_loop(dst, src, func); - } -}; - - -template -struct triangular_assignment_loop -{ - // FIXME: this is not very clean, perhaps this information should be provided by the kernel? - typedef typename Kernel::DstEvaluatorType DstEvaluatorType; - typedef typename DstEvaluatorType::XprType DstXprType; - - enum { - col = (UnrollCount-1) / DstXprType::RowsAtCompileTime, - row = (UnrollCount-1) % DstXprType::RowsAtCompileTime - }; - - typedef typename Kernel::Scalar Scalar; - - EIGEN_DEVICE_FUNC - static inline void run(Kernel &kernel) - { - triangular_assignment_loop::run(kernel); - - if(row==col) - kernel.assignDiagonalCoeff(row); - else if( ((Mode&Lower) && row>col) || ((Mode&Upper) && row -struct triangular_assignment_loop -{ - EIGEN_DEVICE_FUNC - static inline void run(Kernel &) {} -}; - - - -// TODO: experiment with a recursive assignment procedure splitting the current -// triangular part into one rectangular and two triangular parts. - - -template -struct triangular_assignment_loop -{ - typedef typename Kernel::Scalar Scalar; - EIGEN_DEVICE_FUNC - static inline void run(Kernel &kernel) - { - for(Index j = 0; j < kernel.cols(); ++j) - { - Index maxi = numext::mini(j, kernel.rows()); - Index i = 0; - if (((Mode&Lower) && SetOpposite) || (Mode&Upper)) - { - for(; i < maxi; ++i) - if(Mode&Upper) kernel.assignCoeff(i, j); - else kernel.assignOppositeCoeff(i, j); - } - else - i = maxi; - - if(i -template -EIGEN_DEVICE_FUNC void TriangularBase::evalToLazy(MatrixBase &other) const -{ - other.derived().resize(this->rows(), this->cols()); - internal::call_triangular_assignment_loop(other.derived(), derived().nestedExpression()); -} - -namespace internal { - -// Triangular = Product -template< typename DstXprType, typename Lhs, typename Rhs, typename Scalar> -struct Assignment, internal::assign_op::Scalar>, Dense2Triangular> -{ - typedef Product SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - dst._assignProduct(src, 1, 0); - } -}; - -// Triangular += Product -template< typename DstXprType, typename Lhs, typename Rhs, typename Scalar> -struct Assignment, internal::add_assign_op::Scalar>, Dense2Triangular> -{ - typedef Product SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op &) - { - dst._assignProduct(src, 1, 1); - } -}; - -// Triangular -= Product -template< typename DstXprType, typename Lhs, typename Rhs, typename Scalar> -struct Assignment, internal::sub_assign_op::Scalar>, Dense2Triangular> -{ - typedef Product SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op &) - { - dst._assignProduct(src, -1, 1); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULARMATRIX_H diff --git a/Eigen/src/Core/VectorBlock.h b/Eigen/src/Core/VectorBlock.h deleted file mode 100644 index d72fbf7e9..000000000 --- a/Eigen/src/Core/VectorBlock.h +++ /dev/null @@ -1,96 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_VECTORBLOCK_H -#define EIGEN_VECTORBLOCK_H - -namespace Eigen { - -namespace internal { -template -struct traits > - : public traits::Flags & RowMajorBit ? 1 : Size, - traits::Flags & RowMajorBit ? Size : 1> > -{ -}; -} - -/** \class VectorBlock - * \ingroup Core_Module - * - * \brief Expression of a fixed-size or dynamic-size sub-vector - * - * \tparam VectorType the type of the object in which we are taking a sub-vector - * \tparam Size size of the sub-vector we are taking at compile time (optional) - * - * This class represents an expression of either a fixed-size or dynamic-size sub-vector. - * It is the return type of DenseBase::segment(Index,Index) and DenseBase::segment(Index) and - * most of the time this is the only way it is used. - * - * However, if you want to directly maniputate sub-vector expressions, - * for instance if you want to write a function returning such an expression, you - * will need to use this class. - * - * Here is an example illustrating the dynamic case: - * \include class_VectorBlock.cpp - * Output: \verbinclude class_VectorBlock.out - * - * \note Even though this expression has dynamic size, in the case where \a VectorType - * has fixed size, this expression inherits a fixed maximal size which means that evaluating - * it does not cause a dynamic memory allocation. - * - * Here is an example illustrating the fixed-size case: - * \include class_FixedVectorBlock.cpp - * Output: \verbinclude class_FixedVectorBlock.out - * - * \sa class Block, DenseBase::segment(Index,Index,Index,Index), DenseBase::segment(Index,Index) - */ -template class VectorBlock - : public Block::Flags & RowMajorBit ? 1 : Size, - internal::traits::Flags & RowMajorBit ? Size : 1> -{ - typedef Block::Flags & RowMajorBit ? 1 : Size, - internal::traits::Flags & RowMajorBit ? Size : 1> Base; - enum { - IsColVector = !(internal::traits::Flags & RowMajorBit) - }; - public: - EIGEN_DENSE_PUBLIC_INTERFACE(VectorBlock) - - using Base::operator=; - - /** Dynamic-size constructor - */ - EIGEN_DEVICE_FUNC - inline VectorBlock(VectorType& vector, Index start, Index size) - : Base(vector, - IsColVector ? start : 0, IsColVector ? 0 : start, - IsColVector ? size : 1, IsColVector ? 1 : size) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(VectorBlock); - } - - /** Fixed-size constructor - */ - EIGEN_DEVICE_FUNC - inline VectorBlock(VectorType& vector, Index start) - : Base(vector, IsColVector ? start : 0, IsColVector ? 0 : start) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(VectorBlock); - } -}; - - -} // end namespace Eigen - -#endif // EIGEN_VECTORBLOCK_H diff --git a/Eigen/src/Core/VectorwiseOp.h b/Eigen/src/Core/VectorwiseOp.h deleted file mode 100644 index 893bc796f..000000000 --- a/Eigen/src/Core/VectorwiseOp.h +++ /dev/null @@ -1,695 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PARTIAL_REDUX_H -#define EIGEN_PARTIAL_REDUX_H - -namespace Eigen { - -/** \class PartialReduxExpr - * \ingroup Core_Module - * - * \brief Generic expression of a partially reduxed matrix - * - * \tparam MatrixType the type of the matrix we are applying the redux operation - * \tparam MemberOp type of the member functor - * \tparam Direction indicates the direction of the redux (#Vertical or #Horizontal) - * - * This class represents an expression of a partial redux operator of a matrix. - * It is the return type of some VectorwiseOp functions, - * and most of the time this is the only way it is used. - * - * \sa class VectorwiseOp - */ - -template< typename MatrixType, typename MemberOp, int Direction> -class PartialReduxExpr; - -namespace internal { -template -struct traits > - : traits -{ - typedef typename MemberOp::result_type Scalar; - typedef typename traits::StorageKind StorageKind; - typedef typename traits::XprKind XprKind; - typedef typename MatrixType::Scalar InputScalar; - enum { - RowsAtCompileTime = Direction==Vertical ? 1 : MatrixType::RowsAtCompileTime, - ColsAtCompileTime = Direction==Horizontal ? 1 : MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = Direction==Vertical ? 1 : MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = Direction==Horizontal ? 1 : MatrixType::MaxColsAtCompileTime, - Flags = RowsAtCompileTime == 1 ? RowMajorBit : 0, - TraversalSize = Direction==Vertical ? MatrixType::RowsAtCompileTime : MatrixType::ColsAtCompileTime - }; -}; -} - -template< typename MatrixType, typename MemberOp, int Direction> -class PartialReduxExpr : public internal::dense_xpr_base< PartialReduxExpr >::type, - internal::no_assignment_operator -{ - public: - - typedef typename internal::dense_xpr_base::type Base; - EIGEN_DENSE_PUBLIC_INTERFACE(PartialReduxExpr) - - EIGEN_DEVICE_FUNC - explicit PartialReduxExpr(const MatrixType& mat, const MemberOp& func = MemberOp()) - : m_matrix(mat), m_functor(func) {} - - EIGEN_DEVICE_FUNC - Index rows() const { return (Direction==Vertical ? 1 : m_matrix.rows()); } - EIGEN_DEVICE_FUNC - Index cols() const { return (Direction==Horizontal ? 1 : m_matrix.cols()); } - - EIGEN_DEVICE_FUNC - typename MatrixType::Nested nestedExpression() const { return m_matrix; } - - EIGEN_DEVICE_FUNC - const MemberOp& functor() const { return m_functor; } - - protected: - typename MatrixType::Nested m_matrix; - const MemberOp m_functor; -}; - -#define EIGEN_MEMBER_FUNCTOR(MEMBER,COST) \ - template \ - struct member_##MEMBER { \ - EIGEN_EMPTY_STRUCT_CTOR(member_##MEMBER) \ - typedef ResultType result_type; \ - template struct Cost \ - { enum { value = COST }; }; \ - template \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE \ - ResultType operator()(const XprType& mat) const \ - { return mat.MEMBER(); } \ - } - -namespace internal { - -EIGEN_MEMBER_FUNCTOR(squaredNorm, Size * NumTraits::MulCost + (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(norm, (Size+5) * NumTraits::MulCost + (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(stableNorm, (Size+5) * NumTraits::MulCost + (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(blueNorm, (Size+5) * NumTraits::MulCost + (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(hypotNorm, (Size-1) * functor_traits >::Cost ); -EIGEN_MEMBER_FUNCTOR(sum, (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(mean, (Size-1)*NumTraits::AddCost + NumTraits::MulCost); -EIGEN_MEMBER_FUNCTOR(minCoeff, (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(maxCoeff, (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(all, (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(any, (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(count, (Size-1)*NumTraits::AddCost); -EIGEN_MEMBER_FUNCTOR(prod, (Size-1)*NumTraits::MulCost); - -template -struct member_lpnorm { - typedef ResultType result_type; - template struct Cost - { enum { value = (Size+5) * NumTraits::MulCost + (Size-1)*NumTraits::AddCost }; }; - EIGEN_DEVICE_FUNC member_lpnorm() {} - template - EIGEN_DEVICE_FUNC inline ResultType operator()(const XprType& mat) const - { return mat.template lpNorm

(); } -}; - -template -struct member_redux { - typedef typename result_of< - BinaryOp(const Scalar&,const Scalar&) - >::type result_type; - template struct Cost - { enum { value = (Size-1) * functor_traits::Cost }; }; - EIGEN_DEVICE_FUNC explicit member_redux(const BinaryOp func) : m_functor(func) {} - template - EIGEN_DEVICE_FUNC inline result_type operator()(const DenseBase& mat) const - { return mat.redux(m_functor); } - const BinaryOp m_functor; -}; -} - -/** \class VectorwiseOp - * \ingroup Core_Module - * - * \brief Pseudo expression providing partial reduction operations - * - * \tparam ExpressionType the type of the object on which to do partial reductions - * \tparam Direction indicates the direction of the redux (#Vertical or #Horizontal) - * - * This class represents a pseudo expression with partial reduction features. - * It is the return type of DenseBase::colwise() and DenseBase::rowwise() - * and most of the time this is the only way it is used. - * - * Example: \include MatrixBase_colwise.cpp - * Output: \verbinclude MatrixBase_colwise.out - * - * \sa DenseBase::colwise(), DenseBase::rowwise(), class PartialReduxExpr - */ -template class VectorwiseOp -{ - public: - - typedef typename ExpressionType::Scalar Scalar; - typedef typename ExpressionType::RealScalar RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - typedef typename internal::ref_selector::non_const_type ExpressionTypeNested; - typedef typename internal::remove_all::type ExpressionTypeNestedCleaned; - - template class Functor, - typename Scalar_=Scalar> struct ReturnType - { - typedef PartialReduxExpr, - Direction - > Type; - }; - - template struct ReduxReturnType - { - typedef PartialReduxExpr, - Direction - > Type; - }; - - enum { - isVertical = (Direction==Vertical) ? 1 : 0, - isHorizontal = (Direction==Horizontal) ? 1 : 0 - }; - - protected: - - typedef typename internal::conditional::type SubVector; - /** \internal - * \returns the i-th subvector according to the \c Direction */ - EIGEN_DEVICE_FUNC - SubVector subVector(Index i) - { - return SubVector(m_matrix.derived(),i); - } - - /** \internal - * \returns the number of subvectors in the direction \c Direction */ - EIGEN_DEVICE_FUNC - Index subVectors() const - { return isVertical?m_matrix.cols():m_matrix.rows(); } - - template struct ExtendedType { - typedef Replicate Type; - }; - - /** \internal - * Replicates a vector to match the size of \c *this */ - template - EIGEN_DEVICE_FUNC - typename ExtendedType::Type - extendedTo(const DenseBase& other) const - { - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(isVertical, OtherDerived::MaxColsAtCompileTime==1), - YOU_PASSED_A_ROW_VECTOR_BUT_A_COLUMN_VECTOR_WAS_EXPECTED) - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(isHorizontal, OtherDerived::MaxRowsAtCompileTime==1), - YOU_PASSED_A_COLUMN_VECTOR_BUT_A_ROW_VECTOR_WAS_EXPECTED) - return typename ExtendedType::Type - (other.derived(), - isVertical ? 1 : m_matrix.rows(), - isHorizontal ? 1 : m_matrix.cols()); - } - - template struct OppositeExtendedType { - typedef Replicate Type; - }; - - /** \internal - * Replicates a vector in the opposite direction to match the size of \c *this */ - template - EIGEN_DEVICE_FUNC - typename OppositeExtendedType::Type - extendedToOpposite(const DenseBase& other) const - { - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(isHorizontal, OtherDerived::MaxColsAtCompileTime==1), - YOU_PASSED_A_ROW_VECTOR_BUT_A_COLUMN_VECTOR_WAS_EXPECTED) - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(isVertical, OtherDerived::MaxRowsAtCompileTime==1), - YOU_PASSED_A_COLUMN_VECTOR_BUT_A_ROW_VECTOR_WAS_EXPECTED) - return typename OppositeExtendedType::Type - (other.derived(), - isHorizontal ? 1 : m_matrix.rows(), - isVertical ? 1 : m_matrix.cols()); - } - - public: - EIGEN_DEVICE_FUNC - explicit inline VectorwiseOp(ExpressionType& matrix) : m_matrix(matrix) {} - - /** \internal */ - EIGEN_DEVICE_FUNC - inline const ExpressionType& _expression() const { return m_matrix; } - - /** \returns a row or column vector expression of \c *this reduxed by \a func - * - * The template parameter \a BinaryOp is the type of the functor - * of the custom redux operator. Note that func must be an associative operator. - * - * \sa class VectorwiseOp, DenseBase::colwise(), DenseBase::rowwise() - */ - template - EIGEN_DEVICE_FUNC - const typename ReduxReturnType::Type - redux(const BinaryOp& func = BinaryOp()) const - { return typename ReduxReturnType::Type(_expression(), internal::member_redux(func)); } - - typedef typename ReturnType::Type MinCoeffReturnType; - typedef typename ReturnType::Type MaxCoeffReturnType; - typedef typename ReturnType::Type SquaredNormReturnType; - typedef typename ReturnType::Type NormReturnType; - typedef typename ReturnType::Type BlueNormReturnType; - typedef typename ReturnType::Type StableNormReturnType; - typedef typename ReturnType::Type HypotNormReturnType; - typedef typename ReturnType::Type SumReturnType; - typedef typename ReturnType::Type MeanReturnType; - typedef typename ReturnType::Type AllReturnType; - typedef typename ReturnType::Type AnyReturnType; - typedef PartialReduxExpr, Direction> CountReturnType; - typedef typename ReturnType::Type ProdReturnType; - typedef Reverse ConstReverseReturnType; - typedef Reverse ReverseReturnType; - - template struct LpNormReturnType { - typedef PartialReduxExpr,Direction> Type; - }; - - /** \returns a row (or column) vector expression of the smallest coefficient - * of each column (or row) of the referenced expression. - * - * \warning the result is undefined if \c *this contains NaN. - * - * Example: \include PartialRedux_minCoeff.cpp - * Output: \verbinclude PartialRedux_minCoeff.out - * - * \sa DenseBase::minCoeff() */ - EIGEN_DEVICE_FUNC - const MinCoeffReturnType minCoeff() const - { return MinCoeffReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the largest coefficient - * of each column (or row) of the referenced expression. - * - * \warning the result is undefined if \c *this contains NaN. - * - * Example: \include PartialRedux_maxCoeff.cpp - * Output: \verbinclude PartialRedux_maxCoeff.out - * - * \sa DenseBase::maxCoeff() */ - EIGEN_DEVICE_FUNC - const MaxCoeffReturnType maxCoeff() const - { return MaxCoeffReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the squared norm - * of each column (or row) of the referenced expression. - * This is a vector with real entries, even if the original matrix has complex entries. - * - * Example: \include PartialRedux_squaredNorm.cpp - * Output: \verbinclude PartialRedux_squaredNorm.out - * - * \sa DenseBase::squaredNorm() */ - EIGEN_DEVICE_FUNC - const SquaredNormReturnType squaredNorm() const - { return SquaredNormReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the norm - * of each column (or row) of the referenced expression. - * This is a vector with real entries, even if the original matrix has complex entries. - * - * Example: \include PartialRedux_norm.cpp - * Output: \verbinclude PartialRedux_norm.out - * - * \sa DenseBase::norm() */ - EIGEN_DEVICE_FUNC - const NormReturnType norm() const - { return NormReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the norm - * of each column (or row) of the referenced expression. - * This is a vector with real entries, even if the original matrix has complex entries. - * - * Example: \include PartialRedux_norm.cpp - * Output: \verbinclude PartialRedux_norm.out - * - * \sa DenseBase::norm() */ - template - EIGEN_DEVICE_FUNC - const typename LpNormReturnType

::Type lpNorm() const - { return typename LpNormReturnType

::Type(_expression()); } - - - /** \returns a row (or column) vector expression of the norm - * of each column (or row) of the referenced expression, using - * Blue's algorithm. - * This is a vector with real entries, even if the original matrix has complex entries. - * - * \sa DenseBase::blueNorm() */ - EIGEN_DEVICE_FUNC - const BlueNormReturnType blueNorm() const - { return BlueNormReturnType(_expression()); } - - - /** \returns a row (or column) vector expression of the norm - * of each column (or row) of the referenced expression, avoiding - * underflow and overflow. - * This is a vector with real entries, even if the original matrix has complex entries. - * - * \sa DenseBase::stableNorm() */ - EIGEN_DEVICE_FUNC - const StableNormReturnType stableNorm() const - { return StableNormReturnType(_expression()); } - - - /** \returns a row (or column) vector expression of the norm - * of each column (or row) of the referenced expression, avoiding - * underflow and overflow using a concatenation of hypot() calls. - * This is a vector with real entries, even if the original matrix has complex entries. - * - * \sa DenseBase::hypotNorm() */ - EIGEN_DEVICE_FUNC - const HypotNormReturnType hypotNorm() const - { return HypotNormReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the sum - * of each column (or row) of the referenced expression. - * - * Example: \include PartialRedux_sum.cpp - * Output: \verbinclude PartialRedux_sum.out - * - * \sa DenseBase::sum() */ - EIGEN_DEVICE_FUNC - const SumReturnType sum() const - { return SumReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the mean - * of each column (or row) of the referenced expression. - * - * \sa DenseBase::mean() */ - EIGEN_DEVICE_FUNC - const MeanReturnType mean() const - { return MeanReturnType(_expression()); } - - /** \returns a row (or column) vector expression representing - * whether \b all coefficients of each respective column (or row) are \c true. - * This expression can be assigned to a vector with entries of type \c bool. - * - * \sa DenseBase::all() */ - EIGEN_DEVICE_FUNC - const AllReturnType all() const - { return AllReturnType(_expression()); } - - /** \returns a row (or column) vector expression representing - * whether \b at \b least one coefficient of each respective column (or row) is \c true. - * This expression can be assigned to a vector with entries of type \c bool. - * - * \sa DenseBase::any() */ - EIGEN_DEVICE_FUNC - const AnyReturnType any() const - { return AnyReturnType(_expression()); } - - /** \returns a row (or column) vector expression representing - * the number of \c true coefficients of each respective column (or row). - * This expression can be assigned to a vector whose entries have the same type as is used to - * index entries of the original matrix; for dense matrices, this is \c std::ptrdiff_t . - * - * Example: \include PartialRedux_count.cpp - * Output: \verbinclude PartialRedux_count.out - * - * \sa DenseBase::count() */ - EIGEN_DEVICE_FUNC - const CountReturnType count() const - { return CountReturnType(_expression()); } - - /** \returns a row (or column) vector expression of the product - * of each column (or row) of the referenced expression. - * - * Example: \include PartialRedux_prod.cpp - * Output: \verbinclude PartialRedux_prod.out - * - * \sa DenseBase::prod() */ - EIGEN_DEVICE_FUNC - const ProdReturnType prod() const - { return ProdReturnType(_expression()); } - - - /** \returns a matrix expression - * where each column (or row) are reversed. - * - * Example: \include Vectorwise_reverse.cpp - * Output: \verbinclude Vectorwise_reverse.out - * - * \sa DenseBase::reverse() */ - EIGEN_DEVICE_FUNC - const ConstReverseReturnType reverse() const - { return ConstReverseReturnType( _expression() ); } - - /** \returns a writable matrix expression - * where each column (or row) are reversed. - * - * \sa reverse() const */ - EIGEN_DEVICE_FUNC - ReverseReturnType reverse() - { return ReverseReturnType( _expression() ); } - - typedef Replicate ReplicateReturnType; - EIGEN_DEVICE_FUNC - const ReplicateReturnType replicate(Index factor) const; - - /** - * \return an expression of the replication of each column (or row) of \c *this - * - * Example: \include DirectionWise_replicate.cpp - * Output: \verbinclude DirectionWise_replicate.out - * - * \sa VectorwiseOp::replicate(Index), DenseBase::replicate(), class Replicate - */ - // NOTE implemented here because of sunstudio's compilation errors - // isVertical*Factor+isHorizontal instead of (isVertical?Factor:1) to handle CUDA bug with ternary operator - template const Replicate - EIGEN_DEVICE_FUNC - replicate(Index factor = Factor) const - { - return Replicate - (_expression(),isVertical?factor:1,isHorizontal?factor:1); - } - -/////////// Artithmetic operators /////////// - - /** Copies the vector \a other to each subvector of \c *this */ - template - EIGEN_DEVICE_FUNC - ExpressionType& operator=(const DenseBase& other) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - //eigen_assert((m_matrix.isNull()) == (other.isNull())); FIXME - return const_cast(m_matrix = extendedTo(other.derived())); - } - - /** Adds the vector \a other to each subvector of \c *this */ - template - EIGEN_DEVICE_FUNC - ExpressionType& operator+=(const DenseBase& other) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - return const_cast(m_matrix += extendedTo(other.derived())); - } - - /** Substracts the vector \a other to each subvector of \c *this */ - template - EIGEN_DEVICE_FUNC - ExpressionType& operator-=(const DenseBase& other) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - return const_cast(m_matrix -= extendedTo(other.derived())); - } - - /** Multiples each subvector of \c *this by the vector \a other */ - template - EIGEN_DEVICE_FUNC - ExpressionType& operator*=(const DenseBase& other) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_ARRAYXPR(ExpressionType) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - m_matrix *= extendedTo(other.derived()); - return const_cast(m_matrix); - } - - /** Divides each subvector of \c *this by the vector \a other */ - template - EIGEN_DEVICE_FUNC - ExpressionType& operator/=(const DenseBase& other) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_ARRAYXPR(ExpressionType) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - m_matrix /= extendedTo(other.derived()); - return const_cast(m_matrix); - } - - /** Returns the expression of the sum of the vector \a other to each subvector of \c *this */ - template EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC - CwiseBinaryOp, - const ExpressionTypeNestedCleaned, - const typename ExtendedType::Type> - operator+(const DenseBase& other) const - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - return m_matrix + extendedTo(other.derived()); - } - - /** Returns the expression of the difference between each subvector of \c *this and the vector \a other */ - template - EIGEN_DEVICE_FUNC - CwiseBinaryOp, - const ExpressionTypeNestedCleaned, - const typename ExtendedType::Type> - operator-(const DenseBase& other) const - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - return m_matrix - extendedTo(other.derived()); - } - - /** Returns the expression where each subvector is the product of the vector \a other - * by the corresponding subvector of \c *this */ - template EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC - CwiseBinaryOp, - const ExpressionTypeNestedCleaned, - const typename ExtendedType::Type> - EIGEN_DEVICE_FUNC - operator*(const DenseBase& other) const - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_ARRAYXPR(ExpressionType) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - return m_matrix * extendedTo(other.derived()); - } - - /** Returns the expression where each subvector is the quotient of the corresponding - * subvector of \c *this by the vector \a other */ - template - EIGEN_DEVICE_FUNC - CwiseBinaryOp, - const ExpressionTypeNestedCleaned, - const typename ExtendedType::Type> - operator/(const DenseBase& other) const - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_ARRAYXPR(ExpressionType) - EIGEN_STATIC_ASSERT_SAME_XPR_KIND(ExpressionType, OtherDerived) - return m_matrix / extendedTo(other.derived()); - } - - /** \returns an expression where each column (or row) of the referenced matrix are normalized. - * The referenced matrix is \b not modified. - * \sa MatrixBase::normalized(), normalize() - */ - EIGEN_DEVICE_FUNC - CwiseBinaryOp, - const ExpressionTypeNestedCleaned, - const typename OppositeExtendedType::Type>::Type> - normalized() const { return m_matrix.cwiseQuotient(extendedToOpposite(this->norm())); } - - - /** Normalize in-place each row or columns of the referenced matrix. - * \sa MatrixBase::normalize(), normalized() - */ - EIGEN_DEVICE_FUNC void normalize() { - m_matrix = this->normalized(); - } - - EIGEN_DEVICE_FUNC inline void reverseInPlace(); - -/////////// Geometry module /////////// - - typedef Homogeneous HomogeneousReturnType; - EIGEN_DEVICE_FUNC - HomogeneousReturnType homogeneous() const; - - typedef typename ExpressionType::PlainObject CrossReturnType; - template - EIGEN_DEVICE_FUNC - const CrossReturnType cross(const MatrixBase& other) const; - - enum { - HNormalized_Size = Direction==Vertical ? internal::traits::RowsAtCompileTime - : internal::traits::ColsAtCompileTime, - HNormalized_SizeMinusOne = HNormalized_Size==Dynamic ? Dynamic : HNormalized_Size-1 - }; - typedef Block::RowsAtCompileTime), - Direction==Horizontal ? int(HNormalized_SizeMinusOne) - : int(internal::traits::ColsAtCompileTime)> - HNormalized_Block; - typedef Block::RowsAtCompileTime), - Direction==Horizontal ? 1 : int(internal::traits::ColsAtCompileTime)> - HNormalized_Factors; - typedef CwiseBinaryOp::Scalar>, - const HNormalized_Block, - const Replicate > - HNormalizedReturnType; - - EIGEN_DEVICE_FUNC - const HNormalizedReturnType hnormalized() const; - - protected: - ExpressionTypeNested m_matrix; -}; - -//const colwise moved to DenseBase.h due to CUDA compiler bug - - -/** \returns a writable VectorwiseOp wrapper of *this providing additional partial reduction operations - * - * \sa rowwise(), class VectorwiseOp, \ref TutorialReductionsVisitorsBroadcasting - */ -template -EIGEN_DEVICE_FUNC inline typename DenseBase::ColwiseReturnType -DenseBase::colwise() -{ - return ColwiseReturnType(derived()); -} - -//const rowwise moved to DenseBase.h due to CUDA compiler bug - - -/** \returns a writable VectorwiseOp wrapper of *this providing additional partial reduction operations - * - * \sa colwise(), class VectorwiseOp, \ref TutorialReductionsVisitorsBroadcasting - */ -template -EIGEN_DEVICE_FUNC inline typename DenseBase::RowwiseReturnType -DenseBase::rowwise() -{ - return RowwiseReturnType(derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_PARTIAL_REDUX_H diff --git a/Eigen/src/Core/Visitor.h b/Eigen/src/Core/Visitor.h deleted file mode 100644 index 54c1883d9..000000000 --- a/Eigen/src/Core/Visitor.h +++ /dev/null @@ -1,273 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_VISITOR_H -#define EIGEN_VISITOR_H - -namespace Eigen { - -namespace internal { - -template -struct visitor_impl -{ - enum { - col = (UnrollCount-1) / Derived::RowsAtCompileTime, - row = (UnrollCount-1) % Derived::RowsAtCompileTime - }; - - EIGEN_DEVICE_FUNC - static inline void run(const Derived &mat, Visitor& visitor) - { - visitor_impl::run(mat, visitor); - visitor(mat.coeff(row, col), row, col); - } -}; - -template -struct visitor_impl -{ - EIGEN_DEVICE_FUNC - static inline void run(const Derived &mat, Visitor& visitor) - { - return visitor.init(mat.coeff(0, 0), 0, 0); - } -}; - -template -struct visitor_impl -{ - EIGEN_DEVICE_FUNC - static inline void run(const Derived& mat, Visitor& visitor) - { - visitor.init(mat.coeff(0,0), 0, 0); - for(Index i = 1; i < mat.rows(); ++i) - visitor(mat.coeff(i, 0), i, 0); - for(Index j = 1; j < mat.cols(); ++j) - for(Index i = 0; i < mat.rows(); ++i) - visitor(mat.coeff(i, j), i, j); - } -}; - -// evaluator adaptor -template -class visitor_evaluator -{ -public: - EIGEN_DEVICE_FUNC - explicit visitor_evaluator(const XprType &xpr) : m_evaluator(xpr), m_xpr(xpr) {} - - typedef typename XprType::Scalar Scalar; - typedef typename XprType::CoeffReturnType CoeffReturnType; - - enum { - RowsAtCompileTime = XprType::RowsAtCompileTime, - CoeffReadCost = internal::evaluator::CoeffReadCost - }; - - EIGEN_DEVICE_FUNC Index rows() const { return m_xpr.rows(); } - EIGEN_DEVICE_FUNC Index cols() const { return m_xpr.cols(); } - EIGEN_DEVICE_FUNC Index size() const { return m_xpr.size(); } - - EIGEN_DEVICE_FUNC CoeffReturnType coeff(Index row, Index col) const - { return m_evaluator.coeff(row, col); } - -protected: - internal::evaluator m_evaluator; - const XprType &m_xpr; -}; -} // end namespace internal - -/** Applies the visitor \a visitor to the whole coefficients of the matrix or vector. - * - * The template parameter \a Visitor is the type of the visitor and provides the following interface: - * \code - * struct MyVisitor { - * // called for the first coefficient - * void init(const Scalar& value, Index i, Index j); - * // called for all other coefficients - * void operator() (const Scalar& value, Index i, Index j); - * }; - * \endcode - * - * \note compared to one or two \em for \em loops, visitors offer automatic - * unrolling for small fixed size matrix. - * - * \sa minCoeff(Index*,Index*), maxCoeff(Index*,Index*), DenseBase::redux() - */ -template -template -EIGEN_DEVICE_FUNC -void DenseBase::visit(Visitor& visitor) const -{ - typedef typename internal::visitor_evaluator ThisEvaluator; - ThisEvaluator thisEval(derived()); - - enum { - unroll = SizeAtCompileTime != Dynamic - && SizeAtCompileTime * ThisEvaluator::CoeffReadCost + (SizeAtCompileTime-1) * internal::functor_traits::Cost <= EIGEN_UNROLLING_LIMIT - }; - return internal::visitor_impl::run(thisEval, visitor); -} - -namespace internal { - -/** \internal - * \brief Base class to implement min and max visitors - */ -template -struct coeff_visitor -{ - typedef typename Derived::Scalar Scalar; - Index row, col; - Scalar res; - EIGEN_DEVICE_FUNC - inline void init(const Scalar& value, Index i, Index j) - { - res = value; - row = i; - col = j; - } -}; - -/** \internal - * \brief Visitor computing the min coefficient with its value and coordinates - * - * \sa DenseBase::minCoeff(Index*, Index*) - */ -template -struct min_coeff_visitor : coeff_visitor -{ - typedef typename Derived::Scalar Scalar; - EIGEN_DEVICE_FUNC - void operator() (const Scalar& value, Index i, Index j) - { - if(value < this->res) - { - this->res = value; - this->row = i; - this->col = j; - } - } -}; - -template -struct functor_traits > { - enum { - Cost = NumTraits::AddCost - }; -}; - -/** \internal - * \brief Visitor computing the max coefficient with its value and coordinates - * - * \sa DenseBase::maxCoeff(Index*, Index*) - */ -template -struct max_coeff_visitor : coeff_visitor -{ - typedef typename Derived::Scalar Scalar; - EIGEN_DEVICE_FUNC - void operator() (const Scalar& value, Index i, Index j) - { - if(value > this->res) - { - this->res = value; - this->row = i; - this->col = j; - } - } -}; - -template -struct functor_traits > { - enum { - Cost = NumTraits::AddCost - }; -}; - -} // end namespace internal - -/** \fn DenseBase::minCoeff(IndexType* rowId, IndexType* colId) const - * \returns the minimum of all coefficients of *this and puts in *row and *col its location. - * \warning the result is undefined if \c *this contains NaN. - * - * \sa DenseBase::minCoeff(Index*), DenseBase::maxCoeff(Index*,Index*), DenseBase::visit(), DenseBase::minCoeff() - */ -template -template -EIGEN_DEVICE_FUNC -typename internal::traits::Scalar -DenseBase::minCoeff(IndexType* rowId, IndexType* colId) const -{ - internal::min_coeff_visitor minVisitor; - this->visit(minVisitor); - *rowId = minVisitor.row; - if (colId) *colId = minVisitor.col; - return minVisitor.res; -} - -/** \returns the minimum of all coefficients of *this and puts in *index its location. - * \warning the result is undefined if \c *this contains NaN. - * - * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::visit(), DenseBase::minCoeff() - */ -template -template -EIGEN_DEVICE_FUNC -typename internal::traits::Scalar -DenseBase::minCoeff(IndexType* index) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - internal::min_coeff_visitor minVisitor; - this->visit(minVisitor); - *index = IndexType((RowsAtCompileTime==1) ? minVisitor.col : minVisitor.row); - return minVisitor.res; -} - -/** \fn DenseBase::maxCoeff(IndexType* rowId, IndexType* colId) const - * \returns the maximum of all coefficients of *this and puts in *row and *col its location. - * \warning the result is undefined if \c *this contains NaN. - * - * \sa DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visit(), DenseBase::maxCoeff() - */ -template -template -EIGEN_DEVICE_FUNC -typename internal::traits::Scalar -DenseBase::maxCoeff(IndexType* rowPtr, IndexType* colPtr) const -{ - internal::max_coeff_visitor maxVisitor; - this->visit(maxVisitor); - *rowPtr = maxVisitor.row; - if (colPtr) *colPtr = maxVisitor.col; - return maxVisitor.res; -} - -/** \returns the maximum of all coefficients of *this and puts in *index its location. - * \warning the result is undefined if \c *this contains NaN. - * - * \sa DenseBase::maxCoeff(IndexType*,IndexType*), DenseBase::minCoeff(IndexType*,IndexType*), DenseBase::visitor(), DenseBase::maxCoeff() - */ -template -template -EIGEN_DEVICE_FUNC -typename internal::traits::Scalar -DenseBase::maxCoeff(IndexType* index) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - internal::max_coeff_visitor maxVisitor; - this->visit(maxVisitor); - *index = (RowsAtCompileTime==1) ? maxVisitor.col : maxVisitor.row; - return maxVisitor.res; -} - -} // end namespace Eigen - -#endif // EIGEN_VISITOR_H diff --git a/Eigen/src/Core/arch/AVX/Complex.h b/Eigen/src/Core/arch/AVX/Complex.h deleted file mode 100644 index 7fa61969d..000000000 --- a/Eigen/src/Core/arch/AVX/Complex.h +++ /dev/null @@ -1,451 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Benoit Steiner (benoit.steiner.goog@gmail.com) -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX_AVX_H -#define EIGEN_COMPLEX_AVX_H - -namespace Eigen { - -namespace internal { - -//---------- float ---------- -struct Packet4cf -{ - EIGEN_STRONG_INLINE Packet4cf() {} - EIGEN_STRONG_INLINE explicit Packet4cf(const __m256& a) : v(a) {} - __m256 v; -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet4cf type; - typedef Packet2cf half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 4, - HasHalfPacket = 1, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=4, alignment=Aligned32}; typedef Packet2cf half; }; - -template<> EIGEN_STRONG_INLINE Packet4cf padd(const Packet4cf& a, const Packet4cf& b) { return Packet4cf(_mm256_add_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet4cf psub(const Packet4cf& a, const Packet4cf& b) { return Packet4cf(_mm256_sub_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet4cf pnegate(const Packet4cf& a) -{ - return Packet4cf(pnegate(a.v)); -} -template<> EIGEN_STRONG_INLINE Packet4cf pconj(const Packet4cf& a) -{ - const __m256 mask = _mm256_castsi256_ps(_mm256_setr_epi32(0x00000000,0x80000000,0x00000000,0x80000000,0x00000000,0x80000000,0x00000000,0x80000000)); - return Packet4cf(_mm256_xor_ps(a.v,mask)); -} - -template<> EIGEN_STRONG_INLINE Packet4cf pmul(const Packet4cf& a, const Packet4cf& b) -{ - __m256 tmp1 = _mm256_mul_ps(_mm256_moveldup_ps(a.v), b.v); - __m256 tmp2 = _mm256_mul_ps(_mm256_movehdup_ps(a.v), _mm256_permute_ps(b.v, _MM_SHUFFLE(2,3,0,1))); - __m256 result = _mm256_addsub_ps(tmp1, tmp2); - return Packet4cf(result); -} - -template<> EIGEN_STRONG_INLINE Packet4cf pand (const Packet4cf& a, const Packet4cf& b) { return Packet4cf(_mm256_and_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet4cf por (const Packet4cf& a, const Packet4cf& b) { return Packet4cf(_mm256_or_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet4cf pxor (const Packet4cf& a, const Packet4cf& b) { return Packet4cf(_mm256_xor_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet4cf pandnot(const Packet4cf& a, const Packet4cf& b) { return Packet4cf(_mm256_andnot_ps(a.v,b.v)); } - -template<> EIGEN_STRONG_INLINE Packet4cf pload (const std::complex* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet4cf(pload(&numext::real_ref(*from))); } -template<> EIGEN_STRONG_INLINE Packet4cf ploadu(const std::complex* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet4cf(ploadu(&numext::real_ref(*from))); } - - -template<> EIGEN_STRONG_INLINE Packet4cf pset1(const std::complex& from) -{ - return Packet4cf(_mm256_castpd_ps(_mm256_broadcast_sd((const double*)(const void*)&from))); -} - -template<> EIGEN_STRONG_INLINE Packet4cf ploaddup(const std::complex* from) -{ - // FIXME The following might be optimized using _mm256_movedup_pd - Packet2cf a = ploaddup(from); - Packet2cf b = ploaddup(from+1); - return Packet4cf(_mm256_insertf128_ps(_mm256_castps128_ps256(a.v), b.v, 1)); -} - -template<> EIGEN_STRONG_INLINE void pstore >(std::complex* to, const Packet4cf& from) { EIGEN_DEBUG_ALIGNED_STORE pstore(&numext::real_ref(*to), from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex* to, const Packet4cf& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu(&numext::real_ref(*to), from.v); } - -template<> EIGEN_DEVICE_FUNC inline Packet4cf pgather, Packet4cf>(const std::complex* from, Index stride) -{ - return Packet4cf(_mm256_set_ps(std::imag(from[3*stride]), std::real(from[3*stride]), - std::imag(from[2*stride]), std::real(from[2*stride]), - std::imag(from[1*stride]), std::real(from[1*stride]), - std::imag(from[0*stride]), std::real(from[0*stride]))); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet4cf>(std::complex* to, const Packet4cf& from, Index stride) -{ - __m128 low = _mm256_extractf128_ps(from.v, 0); - to[stride*0] = std::complex(_mm_cvtss_f32(_mm_shuffle_ps(low, low, 0)), - _mm_cvtss_f32(_mm_shuffle_ps(low, low, 1))); - to[stride*1] = std::complex(_mm_cvtss_f32(_mm_shuffle_ps(low, low, 2)), - _mm_cvtss_f32(_mm_shuffle_ps(low, low, 3))); - - __m128 high = _mm256_extractf128_ps(from.v, 1); - to[stride*2] = std::complex(_mm_cvtss_f32(_mm_shuffle_ps(high, high, 0)), - _mm_cvtss_f32(_mm_shuffle_ps(high, high, 1))); - to[stride*3] = std::complex(_mm_cvtss_f32(_mm_shuffle_ps(high, high, 2)), - _mm_cvtss_f32(_mm_shuffle_ps(high, high, 3))); - -} - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet4cf& a) -{ - return pfirst(Packet2cf(_mm256_castps256_ps128(a.v))); -} - -template<> EIGEN_STRONG_INLINE Packet4cf preverse(const Packet4cf& a) { - __m128 low = _mm256_extractf128_ps(a.v, 0); - __m128 high = _mm256_extractf128_ps(a.v, 1); - __m128d lowd = _mm_castps_pd(low); - __m128d highd = _mm_castps_pd(high); - low = _mm_castpd_ps(_mm_shuffle_pd(lowd,lowd,0x1)); - high = _mm_castpd_ps(_mm_shuffle_pd(highd,highd,0x1)); - __m256 result = _mm256_setzero_ps(); - result = _mm256_insertf128_ps(result, low, 1); - result = _mm256_insertf128_ps(result, high, 0); - return Packet4cf(result); -} - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet4cf& a) -{ - return predux(padd(Packet2cf(_mm256_extractf128_ps(a.v,0)), - Packet2cf(_mm256_extractf128_ps(a.v,1)))); -} - -template<> EIGEN_STRONG_INLINE Packet4cf preduxp(const Packet4cf* vecs) -{ - Packet8f t0 = _mm256_shuffle_ps(vecs[0].v, vecs[0].v, _MM_SHUFFLE(3, 1, 2 ,0)); - Packet8f t1 = _mm256_shuffle_ps(vecs[1].v, vecs[1].v, _MM_SHUFFLE(3, 1, 2 ,0)); - t0 = _mm256_hadd_ps(t0,t1); - Packet8f t2 = _mm256_shuffle_ps(vecs[2].v, vecs[2].v, _MM_SHUFFLE(3, 1, 2 ,0)); - Packet8f t3 = _mm256_shuffle_ps(vecs[3].v, vecs[3].v, _MM_SHUFFLE(3, 1, 2 ,0)); - t2 = _mm256_hadd_ps(t2,t3); - - t1 = _mm256_permute2f128_ps(t0,t2, 0 + (2<<4)); - t3 = _mm256_permute2f128_ps(t0,t2, 1 + (3<<4)); - - return Packet4cf(_mm256_add_ps(t1,t3)); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet4cf& a) -{ - return predux_mul(pmul(Packet2cf(_mm256_extractf128_ps(a.v, 0)), - Packet2cf(_mm256_extractf128_ps(a.v, 1)))); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4cf& first, const Packet4cf& second) - { - if (Offset==0) return; - palign_impl::run(first.v, second.v); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet4cf pmadd(const Packet4cf& x, const Packet4cf& y, const Packet4cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet4cf pmul(const Packet4cf& a, const Packet4cf& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet4cf pmadd(const Packet4cf& x, const Packet4cf& y, const Packet4cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet4cf pmul(const Packet4cf& a, const Packet4cf& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet4cf pmadd(const Packet4cf& x, const Packet4cf& y, const Packet4cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet4cf pmul(const Packet4cf& a, const Packet4cf& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet4cf,Packet8f) - -template<> EIGEN_STRONG_INLINE Packet4cf pdiv(const Packet4cf& a, const Packet4cf& b) -{ - Packet4cf num = pmul(a, pconj(b)); - __m256 tmp = _mm256_mul_ps(b.v, b.v); - __m256 tmp2 = _mm256_shuffle_ps(tmp,tmp,0xB1); - __m256 denom = _mm256_add_ps(tmp, tmp2); - return Packet4cf(_mm256_div_ps(num.v, denom)); -} - -template<> EIGEN_STRONG_INLINE Packet4cf pcplxflip(const Packet4cf& x) -{ - return Packet4cf(_mm256_shuffle_ps(x.v, x.v, _MM_SHUFFLE(2, 3, 0 ,1))); -} - -//---------- double ---------- -struct Packet2cd -{ - EIGEN_STRONG_INLINE Packet2cd() {} - EIGEN_STRONG_INLINE explicit Packet2cd(const __m256d& a) : v(a) {} - __m256d v; -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet2cd type; - typedef Packet1cd half; - enum { - Vectorizable = 1, - AlignedOnScalar = 0, - size = 2, - HasHalfPacket = 1, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=2, alignment=Aligned32}; typedef Packet1cd half; }; - -template<> EIGEN_STRONG_INLINE Packet2cd padd(const Packet2cd& a, const Packet2cd& b) { return Packet2cd(_mm256_add_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cd psub(const Packet2cd& a, const Packet2cd& b) { return Packet2cd(_mm256_sub_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cd pnegate(const Packet2cd& a) { return Packet2cd(pnegate(a.v)); } -template<> EIGEN_STRONG_INLINE Packet2cd pconj(const Packet2cd& a) -{ - const __m256d mask = _mm256_castsi256_pd(_mm256_set_epi32(0x80000000,0x0,0x0,0x0,0x80000000,0x0,0x0,0x0)); - return Packet2cd(_mm256_xor_pd(a.v,mask)); -} - -template<> EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& a, const Packet2cd& b) -{ - __m256d tmp1 = _mm256_shuffle_pd(a.v,a.v,0x0); - __m256d even = _mm256_mul_pd(tmp1, b.v); - __m256d tmp2 = _mm256_shuffle_pd(a.v,a.v,0xF); - __m256d tmp3 = _mm256_shuffle_pd(b.v,b.v,0x5); - __m256d odd = _mm256_mul_pd(tmp2, tmp3); - return Packet2cd(_mm256_addsub_pd(even, odd)); -} - -template<> EIGEN_STRONG_INLINE Packet2cd pand (const Packet2cd& a, const Packet2cd& b) { return Packet2cd(_mm256_and_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cd por (const Packet2cd& a, const Packet2cd& b) { return Packet2cd(_mm256_or_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cd pxor (const Packet2cd& a, const Packet2cd& b) { return Packet2cd(_mm256_xor_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cd pandnot(const Packet2cd& a, const Packet2cd& b) { return Packet2cd(_mm256_andnot_pd(a.v,b.v)); } - -template<> EIGEN_STRONG_INLINE Packet2cd pload (const std::complex* from) -{ EIGEN_DEBUG_ALIGNED_LOAD return Packet2cd(pload((const double*)from)); } -template<> EIGEN_STRONG_INLINE Packet2cd ploadu(const std::complex* from) -{ EIGEN_DEBUG_UNALIGNED_LOAD return Packet2cd(ploadu((const double*)from)); } - -template<> EIGEN_STRONG_INLINE Packet2cd pset1(const std::complex& from) -{ - // in case casting to a __m128d* is really not safe, then we can still fallback to this version: (much slower though) -// return Packet2cd(_mm256_loadu2_m128d((const double*)&from,(const double*)&from)); - return Packet2cd(_mm256_broadcast_pd((const __m128d*)(const void*)&from)); -} - -template<> EIGEN_STRONG_INLINE Packet2cd ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet2cd& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((double*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet2cd& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((double*)to, from.v); } - -template<> EIGEN_DEVICE_FUNC inline Packet2cd pgather, Packet2cd>(const std::complex* from, Index stride) -{ - return Packet2cd(_mm256_set_pd(std::imag(from[1*stride]), std::real(from[1*stride]), - std::imag(from[0*stride]), std::real(from[0*stride]))); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet2cd>(std::complex* to, const Packet2cd& from, Index stride) -{ - __m128d low = _mm256_extractf128_pd(from.v, 0); - to[stride*0] = std::complex(_mm_cvtsd_f64(low), _mm_cvtsd_f64(_mm_shuffle_pd(low, low, 1))); - __m128d high = _mm256_extractf128_pd(from.v, 1); - to[stride*1] = std::complex(_mm_cvtsd_f64(high), _mm_cvtsd_f64(_mm_shuffle_pd(high, high, 1))); -} - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet2cd& a) -{ - __m128d low = _mm256_extractf128_pd(a.v, 0); - EIGEN_ALIGN16 double res[2]; - _mm_store_pd(res, low); - return std::complex(res[0],res[1]); -} - -template<> EIGEN_STRONG_INLINE Packet2cd preverse(const Packet2cd& a) { - __m256d result = _mm256_permute2f128_pd(a.v, a.v, 1); - return Packet2cd(result); -} - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet2cd& a) -{ - return predux(padd(Packet1cd(_mm256_extractf128_pd(a.v,0)), - Packet1cd(_mm256_extractf128_pd(a.v,1)))); -} - -template<> EIGEN_STRONG_INLINE Packet2cd preduxp(const Packet2cd* vecs) -{ - Packet4d t0 = _mm256_permute2f128_pd(vecs[0].v,vecs[1].v, 0 + (2<<4)); - Packet4d t1 = _mm256_permute2f128_pd(vecs[0].v,vecs[1].v, 1 + (3<<4)); - - return Packet2cd(_mm256_add_pd(t0,t1)); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet2cd& a) -{ - return predux(pmul(Packet1cd(_mm256_extractf128_pd(a.v,0)), - Packet1cd(_mm256_extractf128_pd(a.v,1)))); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2cd& first, const Packet2cd& second) - { - if (Offset==0) return; - palign_impl::run(first.v, second.v); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cd pmadd(const Packet2cd& x, const Packet2cd& y, const Packet2cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& a, const Packet2cd& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cd pmadd(const Packet2cd& x, const Packet2cd& y, const Packet2cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& a, const Packet2cd& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cd pmadd(const Packet2cd& x, const Packet2cd& y, const Packet2cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cd pmul(const Packet2cd& a, const Packet2cd& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cd,Packet4d) - -template<> EIGEN_STRONG_INLINE Packet2cd pdiv(const Packet2cd& a, const Packet2cd& b) -{ - Packet2cd num = pmul(a, pconj(b)); - __m256d tmp = _mm256_mul_pd(b.v, b.v); - __m256d denom = _mm256_hadd_pd(tmp, tmp); - return Packet2cd(_mm256_div_pd(num.v, denom)); -} - -template<> EIGEN_STRONG_INLINE Packet2cd pcplxflip(const Packet2cd& x) -{ - return Packet2cd(_mm256_shuffle_pd(x.v, x.v, 0x5)); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m256d P0 = _mm256_castps_pd(kernel.packet[0].v); - __m256d P1 = _mm256_castps_pd(kernel.packet[1].v); - __m256d P2 = _mm256_castps_pd(kernel.packet[2].v); - __m256d P3 = _mm256_castps_pd(kernel.packet[3].v); - - __m256d T0 = _mm256_shuffle_pd(P0, P1, 15); - __m256d T1 = _mm256_shuffle_pd(P0, P1, 0); - __m256d T2 = _mm256_shuffle_pd(P2, P3, 15); - __m256d T3 = _mm256_shuffle_pd(P2, P3, 0); - - kernel.packet[1].v = _mm256_castpd_ps(_mm256_permute2f128_pd(T0, T2, 32)); - kernel.packet[3].v = _mm256_castpd_ps(_mm256_permute2f128_pd(T0, T2, 49)); - kernel.packet[0].v = _mm256_castpd_ps(_mm256_permute2f128_pd(T1, T3, 32)); - kernel.packet[2].v = _mm256_castpd_ps(_mm256_permute2f128_pd(T1, T3, 49)); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m256d tmp = _mm256_permute2f128_pd(kernel.packet[0].v, kernel.packet[1].v, 0+(2<<4)); - kernel.packet[1].v = _mm256_permute2f128_pd(kernel.packet[0].v, kernel.packet[1].v, 1+(3<<4)); - kernel.packet[0].v = tmp; -} - -template<> EIGEN_STRONG_INLINE Packet4cf pinsertfirst(const Packet4cf& a, std::complex b) -{ - return Packet4cf(_mm256_blend_ps(a.v,pset1(b).v,1|2)); -} - -template<> EIGEN_STRONG_INLINE Packet2cd pinsertfirst(const Packet2cd& a, std::complex b) -{ - return Packet2cd(_mm256_blend_pd(a.v,pset1(b).v,1|2)); -} - -template<> EIGEN_STRONG_INLINE Packet4cf pinsertlast(const Packet4cf& a, std::complex b) -{ - return Packet4cf(_mm256_blend_ps(a.v,pset1(b).v,(1<<7)|(1<<6))); -} - -template<> EIGEN_STRONG_INLINE Packet2cd pinsertlast(const Packet2cd& a, std::complex b) -{ - return Packet2cd(_mm256_blend_pd(a.v,pset1(b).v,(1<<3)|(1<<2))); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX_AVX_H diff --git a/Eigen/src/Core/arch/AVX/MathFunctions.h b/Eigen/src/Core/arch/AVX/MathFunctions.h deleted file mode 100644 index 6af67ce2d..000000000 --- a/Eigen/src/Core/arch/AVX/MathFunctions.h +++ /dev/null @@ -1,439 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Pedro Gonnet (pedro.gonnet@gmail.com) -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MATH_FUNCTIONS_AVX_H -#define EIGEN_MATH_FUNCTIONS_AVX_H - -/* The sin, cos, exp, and log functions of this file are loosely derived from - * Julien Pommier's sse math library: http://gruntthepeon.free.fr/ssemath/ - */ - -namespace Eigen { - -namespace internal { - -inline Packet8i pshiftleft(Packet8i v, int n) -{ -#ifdef EIGEN_VECTORIZE_AVX2 - return _mm256_slli_epi32(v, n); -#else - __m128i lo = _mm_slli_epi32(_mm256_extractf128_si256(v, 0), n); - __m128i hi = _mm_slli_epi32(_mm256_extractf128_si256(v, 1), n); - return _mm256_insertf128_si256(_mm256_castsi128_si256(lo), (hi), 1); -#endif -} - -inline Packet8f pshiftright(Packet8f v, int n) -{ -#ifdef EIGEN_VECTORIZE_AVX2 - return _mm256_cvtepi32_ps(_mm256_srli_epi32(_mm256_castps_si256(v), n)); -#else - __m128i lo = _mm_srli_epi32(_mm256_extractf128_si256(_mm256_castps_si256(v), 0), n); - __m128i hi = _mm_srli_epi32(_mm256_extractf128_si256(_mm256_castps_si256(v), 1), n); - return _mm256_cvtepi32_ps(_mm256_insertf128_si256(_mm256_castsi128_si256(lo), (hi), 1)); -#endif -} - -// Sine function -// Computes sin(x) by wrapping x to the interval [-Pi/4,3*Pi/4] and -// evaluating interpolants in [-Pi/4,Pi/4] or [Pi/4,3*Pi/4]. The interpolants -// are (anti-)symmetric and thus have only odd/even coefficients -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8f -psin(const Packet8f& _x) { - Packet8f x = _x; - - // Some useful values. - _EIGEN_DECLARE_CONST_Packet8i(one, 1); - _EIGEN_DECLARE_CONST_Packet8f(one, 1.0f); - _EIGEN_DECLARE_CONST_Packet8f(two, 2.0f); - _EIGEN_DECLARE_CONST_Packet8f(one_over_four, 0.25f); - _EIGEN_DECLARE_CONST_Packet8f(one_over_pi, 3.183098861837907e-01f); - _EIGEN_DECLARE_CONST_Packet8f(neg_pi_first, -3.140625000000000e+00f); - _EIGEN_DECLARE_CONST_Packet8f(neg_pi_second, -9.670257568359375e-04f); - _EIGEN_DECLARE_CONST_Packet8f(neg_pi_third, -6.278329571784980e-07f); - _EIGEN_DECLARE_CONST_Packet8f(four_over_pi, 1.273239544735163e+00f); - - // Map x from [-Pi/4,3*Pi/4] to z in [-1,3] and subtract the shifted period. - Packet8f z = pmul(x, p8f_one_over_pi); - Packet8f shift = _mm256_floor_ps(padd(z, p8f_one_over_four)); - x = pmadd(shift, p8f_neg_pi_first, x); - x = pmadd(shift, p8f_neg_pi_second, x); - x = pmadd(shift, p8f_neg_pi_third, x); - z = pmul(x, p8f_four_over_pi); - - // Make a mask for the entries that need flipping, i.e. wherever the shift - // is odd. - Packet8i shift_ints = _mm256_cvtps_epi32(shift); - Packet8i shift_isodd = _mm256_castps_si256(_mm256_and_ps(_mm256_castsi256_ps(shift_ints), _mm256_castsi256_ps(p8i_one))); - Packet8i sign_flip_mask = pshiftleft(shift_isodd, 31); - - // Create a mask for which interpolant to use, i.e. if z > 1, then the mask - // is set to ones for that entry. - Packet8f ival_mask = _mm256_cmp_ps(z, p8f_one, _CMP_GT_OQ); - - // Evaluate the polynomial for the interval [1,3] in z. - _EIGEN_DECLARE_CONST_Packet8f(coeff_right_0, 9.999999724233232e-01f); - _EIGEN_DECLARE_CONST_Packet8f(coeff_right_2, -3.084242535619928e-01f); - _EIGEN_DECLARE_CONST_Packet8f(coeff_right_4, 1.584991525700324e-02f); - _EIGEN_DECLARE_CONST_Packet8f(coeff_right_6, -3.188805084631342e-04f); - Packet8f z_minus_two = psub(z, p8f_two); - Packet8f z_minus_two2 = pmul(z_minus_two, z_minus_two); - Packet8f right = pmadd(p8f_coeff_right_6, z_minus_two2, p8f_coeff_right_4); - right = pmadd(right, z_minus_two2, p8f_coeff_right_2); - right = pmadd(right, z_minus_two2, p8f_coeff_right_0); - - // Evaluate the polynomial for the interval [-1,1] in z. - _EIGEN_DECLARE_CONST_Packet8f(coeff_left_1, 7.853981525427295e-01f); - _EIGEN_DECLARE_CONST_Packet8f(coeff_left_3, -8.074536727092352e-02f); - _EIGEN_DECLARE_CONST_Packet8f(coeff_left_5, 2.489871967827018e-03f); - _EIGEN_DECLARE_CONST_Packet8f(coeff_left_7, -3.587725841214251e-05f); - Packet8f z2 = pmul(z, z); - Packet8f left = pmadd(p8f_coeff_left_7, z2, p8f_coeff_left_5); - left = pmadd(left, z2, p8f_coeff_left_3); - left = pmadd(left, z2, p8f_coeff_left_1); - left = pmul(left, z); - - // Assemble the results, i.e. select the left and right polynomials. - left = _mm256_andnot_ps(ival_mask, left); - right = _mm256_and_ps(ival_mask, right); - Packet8f res = _mm256_or_ps(left, right); - - // Flip the sign on the odd intervals and return the result. - res = _mm256_xor_ps(res, _mm256_castsi256_ps(sign_flip_mask)); - return res; -} - -// Natural logarithm -// Computes log(x) as log(2^e * m) = C*e + log(m), where the constant C =log(2) -// and m is in the range [sqrt(1/2),sqrt(2)). In this range, the logarithm can -// be easily approximated by a polynomial centered on m=1 for stability. -// TODO(gonnet): Further reduce the interval allowing for lower-degree -// polynomial interpolants -> ... -> profit! -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8f -plog(const Packet8f& _x) { - Packet8f x = _x; - _EIGEN_DECLARE_CONST_Packet8f(1, 1.0f); - _EIGEN_DECLARE_CONST_Packet8f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet8f(126f, 126.0f); - - _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(inv_mant_mask, ~0x7f800000); - - // The smallest non denormalized float number. - _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(min_norm_pos, 0x00800000); - _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(minus_inf, 0xff800000); - - // Polynomial coefficients. - _EIGEN_DECLARE_CONST_Packet8f(cephes_SQRTHF, 0.707106781186547524f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p0, 7.0376836292E-2f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p1, -1.1514610310E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p2, 1.1676998740E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p3, -1.2420140846E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p4, +1.4249322787E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p5, -1.6668057665E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p6, +2.0000714765E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p7, -2.4999993993E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_p8, +3.3333331174E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_q1, -2.12194440e-4f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_log_q2, 0.693359375f); - - Packet8f invalid_mask = _mm256_cmp_ps(x, _mm256_setzero_ps(), _CMP_NGE_UQ); // not greater equal is true if x is NaN - Packet8f iszero_mask = _mm256_cmp_ps(x, _mm256_setzero_ps(), _CMP_EQ_OQ); - - // Truncate input values to the minimum positive normal. - x = pmax(x, p8f_min_norm_pos); - - Packet8f emm0 = pshiftright(x,23); - Packet8f e = _mm256_sub_ps(emm0, p8f_126f); - - // Set the exponents to -1, i.e. x are in the range [0.5,1). - x = _mm256_and_ps(x, p8f_inv_mant_mask); - x = _mm256_or_ps(x, p8f_half); - - // part2: Shift the inputs from the range [0.5,1) to [sqrt(1/2),sqrt(2)) - // and shift by -1. The values are then centered around 0, which improves - // the stability of the polynomial evaluation. - // if( x < SQRTHF ) { - // e -= 1; - // x = x + x - 1.0; - // } else { x = x - 1.0; } - Packet8f mask = _mm256_cmp_ps(x, p8f_cephes_SQRTHF, _CMP_LT_OQ); - Packet8f tmp = _mm256_and_ps(x, mask); - x = psub(x, p8f_1); - e = psub(e, _mm256_and_ps(p8f_1, mask)); - x = padd(x, tmp); - - Packet8f x2 = pmul(x, x); - Packet8f x3 = pmul(x2, x); - - // Evaluate the polynomial approximant of degree 8 in three parts, probably - // to improve instruction-level parallelism. - Packet8f y, y1, y2; - y = pmadd(p8f_cephes_log_p0, x, p8f_cephes_log_p1); - y1 = pmadd(p8f_cephes_log_p3, x, p8f_cephes_log_p4); - y2 = pmadd(p8f_cephes_log_p6, x, p8f_cephes_log_p7); - y = pmadd(y, x, p8f_cephes_log_p2); - y1 = pmadd(y1, x, p8f_cephes_log_p5); - y2 = pmadd(y2, x, p8f_cephes_log_p8); - y = pmadd(y, x3, y1); - y = pmadd(y, x3, y2); - y = pmul(y, x3); - - // Add the logarithm of the exponent back to the result of the interpolation. - y1 = pmul(e, p8f_cephes_log_q1); - tmp = pmul(x2, p8f_half); - y = padd(y, y1); - x = psub(x, tmp); - y2 = pmul(e, p8f_cephes_log_q2); - x = padd(x, y); - x = padd(x, y2); - - // Filter out invalid inputs, i.e. negative arg will be NAN, 0 will be -INF. - return _mm256_or_ps( - _mm256_andnot_ps(iszero_mask, _mm256_or_ps(x, invalid_mask)), - _mm256_and_ps(iszero_mask, p8f_minus_inf)); -} - -// Exponential function. Works by writing "x = m*log(2) + r" where -// "m = floor(x/log(2)+1/2)" and "r" is the remainder. The result is then -// "exp(x) = 2^m*exp(r)" where exp(r) is in the range [-1,1). -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8f -pexp(const Packet8f& _x) { - _EIGEN_DECLARE_CONST_Packet8f(1, 1.0f); - _EIGEN_DECLARE_CONST_Packet8f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet8f(127, 127.0f); - - _EIGEN_DECLARE_CONST_Packet8f(exp_hi, 88.3762626647950f); - _EIGEN_DECLARE_CONST_Packet8f(exp_lo, -88.3762626647949f); - - _EIGEN_DECLARE_CONST_Packet8f(cephes_LOG2EF, 1.44269504088896341f); - - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_p0, 1.9875691500E-4f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_p1, 1.3981999507E-3f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_p2, 8.3334519073E-3f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_p3, 4.1665795894E-2f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_p4, 1.6666665459E-1f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_p5, 5.0000001201E-1f); - - // Clamp x. - Packet8f x = pmax(pmin(_x, p8f_exp_hi), p8f_exp_lo); - - // Express exp(x) as exp(m*ln(2) + r), start by extracting - // m = floor(x/ln(2) + 0.5). - Packet8f m = _mm256_floor_ps(pmadd(x, p8f_cephes_LOG2EF, p8f_half)); - -// Get r = x - m*ln(2). If no FMA instructions are available, m*ln(2) is -// subtracted out in two parts, m*C1+m*C2 = m*ln(2), to avoid accumulating -// truncation errors. Note that we don't use the "pmadd" function here to -// ensure that a precision-preserving FMA instruction is used. -#ifdef EIGEN_VECTORIZE_FMA - _EIGEN_DECLARE_CONST_Packet8f(nln2, -0.6931471805599453f); - Packet8f r = _mm256_fmadd_ps(m, p8f_nln2, x); -#else - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_C1, 0.693359375f); - _EIGEN_DECLARE_CONST_Packet8f(cephes_exp_C2, -2.12194440e-4f); - Packet8f r = psub(x, pmul(m, p8f_cephes_exp_C1)); - r = psub(r, pmul(m, p8f_cephes_exp_C2)); -#endif - - Packet8f r2 = pmul(r, r); - - // TODO(gonnet): Split into odd/even polynomials and try to exploit - // instruction-level parallelism. - Packet8f y = p8f_cephes_exp_p0; - y = pmadd(y, r, p8f_cephes_exp_p1); - y = pmadd(y, r, p8f_cephes_exp_p2); - y = pmadd(y, r, p8f_cephes_exp_p3); - y = pmadd(y, r, p8f_cephes_exp_p4); - y = pmadd(y, r, p8f_cephes_exp_p5); - y = pmadd(y, r2, r); - y = padd(y, p8f_1); - - // Build emm0 = 2^m. - Packet8i emm0 = _mm256_cvttps_epi32(padd(m, p8f_127)); - emm0 = pshiftleft(emm0, 23); - - // Return 2^m * exp(r). - return pmax(pmul(y, _mm256_castsi256_ps(emm0)), _x); -} - -// Hyperbolic Tangent function. -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8f -ptanh(const Packet8f& x) { - return internal::generic_fast_tanh_float(x); -} - -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet4d -pexp(const Packet4d& _x) { - Packet4d x = _x; - - _EIGEN_DECLARE_CONST_Packet4d(1, 1.0); - _EIGEN_DECLARE_CONST_Packet4d(2, 2.0); - _EIGEN_DECLARE_CONST_Packet4d(half, 0.5); - - _EIGEN_DECLARE_CONST_Packet4d(exp_hi, 709.437); - _EIGEN_DECLARE_CONST_Packet4d(exp_lo, -709.436139303); - - _EIGEN_DECLARE_CONST_Packet4d(cephes_LOG2EF, 1.4426950408889634073599); - - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_p0, 1.26177193074810590878e-4); - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_p1, 3.02994407707441961300e-2); - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_p2, 9.99999999999999999910e-1); - - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_q0, 3.00198505138664455042e-6); - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_q1, 2.52448340349684104192e-3); - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_q2, 2.27265548208155028766e-1); - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_q3, 2.00000000000000000009e0); - - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_C1, 0.693145751953125); - _EIGEN_DECLARE_CONST_Packet4d(cephes_exp_C2, 1.42860682030941723212e-6); - _EIGEN_DECLARE_CONST_Packet4i(1023, 1023); - - Packet4d tmp, fx; - - // clamp x - x = pmax(pmin(x, p4d_exp_hi), p4d_exp_lo); - // Express exp(x) as exp(g + n*log(2)). - fx = pmadd(p4d_cephes_LOG2EF, x, p4d_half); - - // Get the integer modulus of log(2), i.e. the "n" described above. - fx = _mm256_floor_pd(fx); - - // Get the remainder modulo log(2), i.e. the "g" described above. Subtract - // n*log(2) out in two steps, i.e. n*C1 + n*C2, C1+C2=log2 to get the last - // digits right. - tmp = pmul(fx, p4d_cephes_exp_C1); - Packet4d z = pmul(fx, p4d_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - Packet4d x2 = pmul(x, x); - - // Evaluate the numerator polynomial of the rational interpolant. - Packet4d px = p4d_cephes_exp_p0; - px = pmadd(px, x2, p4d_cephes_exp_p1); - px = pmadd(px, x2, p4d_cephes_exp_p2); - px = pmul(px, x); - - // Evaluate the denominator polynomial of the rational interpolant. - Packet4d qx = p4d_cephes_exp_q0; - qx = pmadd(qx, x2, p4d_cephes_exp_q1); - qx = pmadd(qx, x2, p4d_cephes_exp_q2); - qx = pmadd(qx, x2, p4d_cephes_exp_q3); - - // I don't really get this bit, copied from the SSE2 routines, so... - // TODO(gonnet): Figure out what is going on here, perhaps find a better - // rational interpolant? - x = _mm256_div_pd(px, psub(qx, px)); - x = pmadd(p4d_2, x, p4d_1); - - // Build e=2^n by constructing the exponents in a 128-bit vector and - // shifting them to where they belong in double-precision values. - __m128i emm0 = _mm256_cvtpd_epi32(fx); - emm0 = _mm_add_epi32(emm0, p4i_1023); - emm0 = _mm_shuffle_epi32(emm0, _MM_SHUFFLE(3, 1, 2, 0)); - __m128i lo = _mm_slli_epi64(emm0, 52); - __m128i hi = _mm_slli_epi64(_mm_srli_epi64(emm0, 32), 52); - __m256i e = _mm256_insertf128_si256(_mm256_setzero_si256(), lo, 0); - e = _mm256_insertf128_si256(e, hi, 1); - - // Construct the result 2^n * exp(g) = e * x. The max is used to catch - // non-finite values in the input. - return pmax(pmul(x, _mm256_castsi256_pd(e)), _x); -} - -// Functions for sqrt. -// The EIGEN_FAST_MATH version uses the _mm_rsqrt_ps approximation and one step -// of Newton's method, at a cost of 1-2 bits of precision as opposed to the -// exact solution. It does not handle +inf, or denormalized numbers correctly. -// The main advantage of this approach is not just speed, but also the fact that -// it can be inlined and pipelined with other computations, further reducing its -// effective latency. This is similar to Quake3's fast inverse square root. -// For detail see here: http://www.beyond3d.com/content/articles/8/ -#if EIGEN_FAST_MATH -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8f -psqrt(const Packet8f& _x) { - Packet8f half = pmul(_x, pset1(.5f)); - Packet8f denormal_mask = _mm256_and_ps( - _mm256_cmp_ps(_x, pset1((std::numeric_limits::min)()), - _CMP_LT_OQ), - _mm256_cmp_ps(_x, _mm256_setzero_ps(), _CMP_GE_OQ)); - - // Compute approximate reciprocal sqrt. - Packet8f x = _mm256_rsqrt_ps(_x); - // Do a single step of Newton's iteration. - x = pmul(x, psub(pset1(1.5f), pmul(half, pmul(x,x)))); - // Flush results for denormals to zero. - return _mm256_andnot_ps(denormal_mask, pmul(_x,x)); -} -#else -template <> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet8f psqrt(const Packet8f& x) { - return _mm256_sqrt_ps(x); -} -#endif -template <> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4d psqrt(const Packet4d& x) { - return _mm256_sqrt_pd(x); -} -#if EIGEN_FAST_MATH - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet8f prsqrt(const Packet8f& _x) { - _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(inf, 0x7f800000); - _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(nan, 0x7fc00000); - _EIGEN_DECLARE_CONST_Packet8f(one_point_five, 1.5f); - _EIGEN_DECLARE_CONST_Packet8f(minus_half, -0.5f); - _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(flt_min, 0x00800000); - - Packet8f neg_half = pmul(_x, p8f_minus_half); - - // select only the inverse sqrt of positive normal inputs (denormals are - // flushed to zero and cause infs as well). - Packet8f le_zero_mask = _mm256_cmp_ps(_x, p8f_flt_min, _CMP_LT_OQ); - Packet8f x = _mm256_andnot_ps(le_zero_mask, _mm256_rsqrt_ps(_x)); - - // Fill in NaNs and Infs for the negative/zero entries. - Packet8f neg_mask = _mm256_cmp_ps(_x, _mm256_setzero_ps(), _CMP_LT_OQ); - Packet8f zero_mask = _mm256_andnot_ps(neg_mask, le_zero_mask); - Packet8f infs_and_nans = _mm256_or_ps(_mm256_and_ps(neg_mask, p8f_nan), - _mm256_and_ps(zero_mask, p8f_inf)); - - // Do a single step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p8f_one_point_five)); - - // Insert NaNs and Infs in all the right places. - return _mm256_or_ps(x, infs_and_nans); -} - -#else -template <> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet8f prsqrt(const Packet8f& x) { - _EIGEN_DECLARE_CONST_Packet8f(one, 1.0f); - return _mm256_div_ps(p8f_one, _mm256_sqrt_ps(x)); -} -#endif - -template <> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4d prsqrt(const Packet4d& x) { - _EIGEN_DECLARE_CONST_Packet4d(one, 1.0); - return _mm256_div_pd(p4d_one, _mm256_sqrt_pd(x)); -} - - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_MATH_FUNCTIONS_AVX_H diff --git a/Eigen/src/Core/arch/AVX/PacketMath.h b/Eigen/src/Core/arch/AVX/PacketMath.h deleted file mode 100644 index 636230944..000000000 --- a/Eigen/src/Core/arch/AVX/PacketMath.h +++ /dev/null @@ -1,643 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Benoit Steiner (benoit.steiner.goog@gmail.com) -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_AVX_H -#define EIGEN_PACKET_MATH_AVX_H - -namespace Eigen { - -namespace internal { - -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 8 -#endif - -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS (2*sizeof(void*)) -#endif - -#ifdef __FMA__ -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#endif -#endif - -typedef __m256 Packet8f; -typedef __m256i Packet8i; -typedef __m256d Packet4d; - -template<> struct is_arithmetic<__m256> { enum { value = true }; }; -template<> struct is_arithmetic<__m256i> { enum { value = true }; }; -template<> struct is_arithmetic<__m256d> { enum { value = true }; }; - -#define _EIGEN_DECLARE_CONST_Packet8f(NAME,X) \ - const Packet8f p8f_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet4d(NAME,X) \ - const Packet4d p4d_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet8f_FROM_INT(NAME,X) \ - const Packet8f p8f_##NAME = _mm256_castsi256_ps(pset1(X)) - -#define _EIGEN_DECLARE_CONST_Packet8i(NAME,X) \ - const Packet8i p8i_##NAME = pset1(X) - -// Use the packet_traits defined in AVX512/PacketMath.h instead if we're going -// to leverage AVX512 instructions. -#ifndef EIGEN_VECTORIZE_AVX512 -template<> struct packet_traits : default_packet_traits -{ - typedef Packet8f type; - typedef Packet4f half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=8, - HasHalfPacket = 1, - - HasDiv = 1, - HasSin = EIGEN_FAST_MATH, - HasCos = 0, - HasLog = 1, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasTanh = EIGEN_FAST_MATH, - HasBlend = 1, - HasRound = 1, - HasFloor = 1, - HasCeil = 1 - }; -}; -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4d type; - typedef Packet2d half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - HasHalfPacket = 1, - - HasDiv = 1, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasBlend = 1, - HasRound = 1, - HasFloor = 1, - HasCeil = 1 - }; -}; -#endif - -template<> struct scalar_div_cost { enum { value = 14 }; }; -template<> struct scalar_div_cost { enum { value = 16 }; }; - -/* Proper support for integers is only provided by AVX2. In the meantime, we'll - use SSE instructions and packets to deal with integers. -template<> struct packet_traits : default_packet_traits -{ - typedef Packet8i type; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=8 - }; -}; -*/ - -template<> struct unpacket_traits { typedef float type; typedef Packet4f half; enum {size=8, alignment=Aligned32}; }; -template<> struct unpacket_traits { typedef double type; typedef Packet2d half; enum {size=4, alignment=Aligned32}; }; -template<> struct unpacket_traits { typedef int type; typedef Packet4i half; enum {size=8, alignment=Aligned32}; }; - -template<> EIGEN_STRONG_INLINE Packet8f pset1(const float& from) { return _mm256_set1_ps(from); } -template<> EIGEN_STRONG_INLINE Packet4d pset1(const double& from) { return _mm256_set1_pd(from); } -template<> EIGEN_STRONG_INLINE Packet8i pset1(const int& from) { return _mm256_set1_epi32(from); } - -template<> EIGEN_STRONG_INLINE Packet8f pload1(const float* from) { return _mm256_broadcast_ss(from); } -template<> EIGEN_STRONG_INLINE Packet4d pload1(const double* from) { return _mm256_broadcast_sd(from); } - -template<> EIGEN_STRONG_INLINE Packet8f plset(const float& a) { return _mm256_add_ps(_mm256_set1_ps(a), _mm256_set_ps(7.0,6.0,5.0,4.0,3.0,2.0,1.0,0.0)); } -template<> EIGEN_STRONG_INLINE Packet4d plset(const double& a) { return _mm256_add_pd(_mm256_set1_pd(a), _mm256_set_pd(3.0,2.0,1.0,0.0)); } - -template<> EIGEN_STRONG_INLINE Packet8f padd(const Packet8f& a, const Packet8f& b) { return _mm256_add_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d padd(const Packet4d& a, const Packet4d& b) { return _mm256_add_pd(a,b); } - -template<> EIGEN_STRONG_INLINE Packet8f psub(const Packet8f& a, const Packet8f& b) { return _mm256_sub_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d psub(const Packet4d& a, const Packet4d& b) { return _mm256_sub_pd(a,b); } - -template<> EIGEN_STRONG_INLINE Packet8f pnegate(const Packet8f& a) -{ - return _mm256_sub_ps(_mm256_set1_ps(0.0),a); -} -template<> EIGEN_STRONG_INLINE Packet4d pnegate(const Packet4d& a) -{ - return _mm256_sub_pd(_mm256_set1_pd(0.0),a); -} - -template<> EIGEN_STRONG_INLINE Packet8f pconj(const Packet8f& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet4d pconj(const Packet4d& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet8i pconj(const Packet8i& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet8f pmul(const Packet8f& a, const Packet8f& b) { return _mm256_mul_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d pmul(const Packet4d& a, const Packet4d& b) { return _mm256_mul_pd(a,b); } - - -template<> EIGEN_STRONG_INLINE Packet8f pdiv(const Packet8f& a, const Packet8f& b) { return _mm256_div_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d pdiv(const Packet4d& a, const Packet4d& b) { return _mm256_div_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet8i pdiv(const Packet8i& /*a*/, const Packet8i& /*b*/) -{ eigen_assert(false && "packet integer division are not supported by AVX"); - return pset1(0); -} - -#ifdef __FMA__ -template<> EIGEN_STRONG_INLINE Packet8f pmadd(const Packet8f& a, const Packet8f& b, const Packet8f& c) { -#if ( EIGEN_COMP_GNUC_STRICT || (EIGEN_COMP_CLANG && (EIGEN_COMP_CLANG<308)) ) - // clang stupidly generates a vfmadd213ps instruction plus some vmovaps on registers, - // and gcc stupidly generates a vfmadd132ps instruction, - // so let's enforce it to generate a vfmadd231ps instruction since the most common use case is to accumulate - // the result of the product. - Packet8f res = c; - __asm__("vfmadd231ps %[a], %[b], %[c]" : [c] "+x" (res) : [a] "x" (a), [b] "x" (b)); - return res; -#else - return _mm256_fmadd_ps(a,b,c); -#endif -} -template<> EIGEN_STRONG_INLINE Packet4d pmadd(const Packet4d& a, const Packet4d& b, const Packet4d& c) { -#if ( EIGEN_COMP_GNUC_STRICT || (EIGEN_COMP_CLANG && (EIGEN_COMP_CLANG<308)) ) - // see above - Packet4d res = c; - __asm__("vfmadd231pd %[a], %[b], %[c]" : [c] "+x" (res) : [a] "x" (a), [b] "x" (b)); - return res; -#else - return _mm256_fmadd_pd(a,b,c); -#endif -} -#endif - -template<> EIGEN_STRONG_INLINE Packet8f pmin(const Packet8f& a, const Packet8f& b) { - // Arguments are swapped to match NaN propagation behavior of std::min. - return _mm256_min_ps(b,a); -} -template<> EIGEN_STRONG_INLINE Packet4d pmin(const Packet4d& a, const Packet4d& b) { - // Arguments are swapped to match NaN propagation behavior of std::min. - return _mm256_min_pd(b,a); -} -template<> EIGEN_STRONG_INLINE Packet8f pmax(const Packet8f& a, const Packet8f& b) { - // Arguments are swapped to match NaN propagation behavior of std::max. - return _mm256_max_ps(b,a); -} -template<> EIGEN_STRONG_INLINE Packet4d pmax(const Packet4d& a, const Packet4d& b) { - // Arguments are swapped to match NaN propagation behavior of std::max. - return _mm256_max_pd(b,a); -} -template<> EIGEN_STRONG_INLINE Packet8f pround(const Packet8f& a) { return _mm256_round_ps(a, _MM_FROUND_CUR_DIRECTION); } -template<> EIGEN_STRONG_INLINE Packet4d pround(const Packet4d& a) { return _mm256_round_pd(a, _MM_FROUND_CUR_DIRECTION); } - -template<> EIGEN_STRONG_INLINE Packet8f pceil(const Packet8f& a) { return _mm256_ceil_ps(a); } -template<> EIGEN_STRONG_INLINE Packet4d pceil(const Packet4d& a) { return _mm256_ceil_pd(a); } - -template<> EIGEN_STRONG_INLINE Packet8f pfloor(const Packet8f& a) { return _mm256_floor_ps(a); } -template<> EIGEN_STRONG_INLINE Packet4d pfloor(const Packet4d& a) { return _mm256_floor_pd(a); } - -template<> EIGEN_STRONG_INLINE Packet8f pand(const Packet8f& a, const Packet8f& b) { return _mm256_and_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d pand(const Packet4d& a, const Packet4d& b) { return _mm256_and_pd(a,b); } - -template<> EIGEN_STRONG_INLINE Packet8f por(const Packet8f& a, const Packet8f& b) { return _mm256_or_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d por(const Packet4d& a, const Packet4d& b) { return _mm256_or_pd(a,b); } - -template<> EIGEN_STRONG_INLINE Packet8f pxor(const Packet8f& a, const Packet8f& b) { return _mm256_xor_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d pxor(const Packet4d& a, const Packet4d& b) { return _mm256_xor_pd(a,b); } - -template<> EIGEN_STRONG_INLINE Packet8f pandnot(const Packet8f& a, const Packet8f& b) { return _mm256_andnot_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet4d pandnot(const Packet4d& a, const Packet4d& b) { return _mm256_andnot_pd(a,b); } - -template<> EIGEN_STRONG_INLINE Packet8f pload(const float* from) { EIGEN_DEBUG_ALIGNED_LOAD return _mm256_load_ps(from); } -template<> EIGEN_STRONG_INLINE Packet4d pload(const double* from) { EIGEN_DEBUG_ALIGNED_LOAD return _mm256_load_pd(from); } -template<> EIGEN_STRONG_INLINE Packet8i pload(const int* from) { EIGEN_DEBUG_ALIGNED_LOAD return _mm256_load_si256(reinterpret_cast(from)); } - -template<> EIGEN_STRONG_INLINE Packet8f ploadu(const float* from) { EIGEN_DEBUG_UNALIGNED_LOAD return _mm256_loadu_ps(from); } -template<> EIGEN_STRONG_INLINE Packet4d ploadu(const double* from) { EIGEN_DEBUG_UNALIGNED_LOAD return _mm256_loadu_pd(from); } -template<> EIGEN_STRONG_INLINE Packet8i ploadu(const int* from) { EIGEN_DEBUG_UNALIGNED_LOAD return _mm256_loadu_si256(reinterpret_cast(from)); } - -// Loads 4 floats from memory a returns the packet {a0, a0 a1, a1, a2, a2, a3, a3} -template<> EIGEN_STRONG_INLINE Packet8f ploaddup(const float* from) -{ - // TODO try to find a way to avoid the need of a temporary register -// Packet8f tmp = _mm256_castps128_ps256(_mm_loadu_ps(from)); -// tmp = _mm256_insertf128_ps(tmp, _mm_movehl_ps(_mm256_castps256_ps128(tmp),_mm256_castps256_ps128(tmp)), 1); -// return _mm256_unpacklo_ps(tmp,tmp); - - // _mm256_insertf128_ps is very slow on Haswell, thus: - Packet8f tmp = _mm256_broadcast_ps((const __m128*)(const void*)from); - // mimic an "inplace" permutation of the lower 128bits using a blend - tmp = _mm256_blend_ps(tmp,_mm256_castps128_ps256(_mm_permute_ps( _mm256_castps256_ps128(tmp), _MM_SHUFFLE(1,0,1,0))), 15); - // then we can perform a consistent permutation on the global register to get everything in shape: - return _mm256_permute_ps(tmp, _MM_SHUFFLE(3,3,2,2)); -} -// Loads 2 doubles from memory a returns the packet {a0, a0 a1, a1} -template<> EIGEN_STRONG_INLINE Packet4d ploaddup(const double* from) -{ - Packet4d tmp = _mm256_broadcast_pd((const __m128d*)(const void*)from); - return _mm256_permute_pd(tmp, 3<<2); -} - -// Loads 2 floats from memory a returns the packet {a0, a0 a0, a0, a1, a1, a1, a1} -template<> EIGEN_STRONG_INLINE Packet8f ploadquad(const float* from) -{ - Packet8f tmp = _mm256_castps128_ps256(_mm_broadcast_ss(from)); - return _mm256_insertf128_ps(tmp, _mm_broadcast_ss(from+1), 1); -} - -template<> EIGEN_STRONG_INLINE void pstore(float* to, const Packet8f& from) { EIGEN_DEBUG_ALIGNED_STORE _mm256_store_ps(to, from); } -template<> EIGEN_STRONG_INLINE void pstore(double* to, const Packet4d& from) { EIGEN_DEBUG_ALIGNED_STORE _mm256_store_pd(to, from); } -template<> EIGEN_STRONG_INLINE void pstore(int* to, const Packet8i& from) { EIGEN_DEBUG_ALIGNED_STORE _mm256_storeu_si256(reinterpret_cast<__m256i*>(to), from); } - -template<> EIGEN_STRONG_INLINE void pstoreu(float* to, const Packet8f& from) { EIGEN_DEBUG_UNALIGNED_STORE _mm256_storeu_ps(to, from); } -template<> EIGEN_STRONG_INLINE void pstoreu(double* to, const Packet4d& from) { EIGEN_DEBUG_UNALIGNED_STORE _mm256_storeu_pd(to, from); } -template<> EIGEN_STRONG_INLINE void pstoreu(int* to, const Packet8i& from) { EIGEN_DEBUG_UNALIGNED_STORE _mm256_storeu_si256(reinterpret_cast<__m256i*>(to), from); } - -// NOTE: leverage _mm256_i32gather_ps and _mm256_i32gather_pd if AVX2 instructions are available -// NOTE: for the record the following seems to be slower: return _mm256_i32gather_ps(from, _mm256_set1_epi32(stride), 4); -template<> EIGEN_DEVICE_FUNC inline Packet8f pgather(const float* from, Index stride) -{ - return _mm256_set_ps(from[7*stride], from[6*stride], from[5*stride], from[4*stride], - from[3*stride], from[2*stride], from[1*stride], from[0*stride]); -} -template<> EIGEN_DEVICE_FUNC inline Packet4d pgather(const double* from, Index stride) -{ - return _mm256_set_pd(from[3*stride], from[2*stride], from[1*stride], from[0*stride]); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const Packet8f& from, Index stride) -{ - __m128 low = _mm256_extractf128_ps(from, 0); - to[stride*0] = _mm_cvtss_f32(low); - to[stride*1] = _mm_cvtss_f32(_mm_shuffle_ps(low, low, 1)); - to[stride*2] = _mm_cvtss_f32(_mm_shuffle_ps(low, low, 2)); - to[stride*3] = _mm_cvtss_f32(_mm_shuffle_ps(low, low, 3)); - - __m128 high = _mm256_extractf128_ps(from, 1); - to[stride*4] = _mm_cvtss_f32(high); - to[stride*5] = _mm_cvtss_f32(_mm_shuffle_ps(high, high, 1)); - to[stride*6] = _mm_cvtss_f32(_mm_shuffle_ps(high, high, 2)); - to[stride*7] = _mm_cvtss_f32(_mm_shuffle_ps(high, high, 3)); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(double* to, const Packet4d& from, Index stride) -{ - __m128d low = _mm256_extractf128_pd(from, 0); - to[stride*0] = _mm_cvtsd_f64(low); - to[stride*1] = _mm_cvtsd_f64(_mm_shuffle_pd(low, low, 1)); - __m128d high = _mm256_extractf128_pd(from, 1); - to[stride*2] = _mm_cvtsd_f64(high); - to[stride*3] = _mm_cvtsd_f64(_mm_shuffle_pd(high, high, 1)); -} - -template<> EIGEN_STRONG_INLINE void pstore1(float* to, const float& a) -{ - Packet8f pa = pset1(a); - pstore(to, pa); -} -template<> EIGEN_STRONG_INLINE void pstore1(double* to, const double& a) -{ - Packet4d pa = pset1(a); - pstore(to, pa); -} -template<> EIGEN_STRONG_INLINE void pstore1(int* to, const int& a) -{ - Packet8i pa = pset1(a); - pstore(to, pa); -} - -#ifndef EIGEN_VECTORIZE_AVX512 -template<> EIGEN_STRONG_INLINE void prefetch(const float* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -template<> EIGEN_STRONG_INLINE void prefetch(const double* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -template<> EIGEN_STRONG_INLINE void prefetch(const int* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -#endif - -template<> EIGEN_STRONG_INLINE float pfirst(const Packet8f& a) { - return _mm_cvtss_f32(_mm256_castps256_ps128(a)); -} -template<> EIGEN_STRONG_INLINE double pfirst(const Packet4d& a) { - return _mm_cvtsd_f64(_mm256_castpd256_pd128(a)); -} -template<> EIGEN_STRONG_INLINE int pfirst(const Packet8i& a) { - return _mm_cvtsi128_si32(_mm256_castsi256_si128(a)); -} - - -template<> EIGEN_STRONG_INLINE Packet8f preverse(const Packet8f& a) -{ - __m256 tmp = _mm256_shuffle_ps(a,a,0x1b); - return _mm256_permute2f128_ps(tmp, tmp, 1); -} -template<> EIGEN_STRONG_INLINE Packet4d preverse(const Packet4d& a) -{ - __m256d tmp = _mm256_shuffle_pd(a,a,5); - return _mm256_permute2f128_pd(tmp, tmp, 1); - - __m256d swap_halves = _mm256_permute2f128_pd(a,a,1); - return _mm256_permute_pd(swap_halves,5); -} - -// pabs should be ok -template<> EIGEN_STRONG_INLINE Packet8f pabs(const Packet8f& a) -{ - const Packet8f mask = _mm256_castsi256_ps(_mm256_setr_epi32(0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF)); - return _mm256_and_ps(a,mask); -} -template<> EIGEN_STRONG_INLINE Packet4d pabs(const Packet4d& a) -{ - const Packet4d mask = _mm256_castsi256_pd(_mm256_setr_epi32(0xFFFFFFFF,0x7FFFFFFF,0xFFFFFFFF,0x7FFFFFFF,0xFFFFFFFF,0x7FFFFFFF,0xFFFFFFFF,0x7FFFFFFF)); - return _mm256_and_pd(a,mask); -} - -// preduxp should be ok -// FIXME: why is this ok? why isn't the simply implementation working as expected? -template<> EIGEN_STRONG_INLINE Packet8f preduxp(const Packet8f* vecs) -{ - __m256 hsum1 = _mm256_hadd_ps(vecs[0], vecs[1]); - __m256 hsum2 = _mm256_hadd_ps(vecs[2], vecs[3]); - __m256 hsum3 = _mm256_hadd_ps(vecs[4], vecs[5]); - __m256 hsum4 = _mm256_hadd_ps(vecs[6], vecs[7]); - - __m256 hsum5 = _mm256_hadd_ps(hsum1, hsum1); - __m256 hsum6 = _mm256_hadd_ps(hsum2, hsum2); - __m256 hsum7 = _mm256_hadd_ps(hsum3, hsum3); - __m256 hsum8 = _mm256_hadd_ps(hsum4, hsum4); - - __m256 perm1 = _mm256_permute2f128_ps(hsum5, hsum5, 0x23); - __m256 perm2 = _mm256_permute2f128_ps(hsum6, hsum6, 0x23); - __m256 perm3 = _mm256_permute2f128_ps(hsum7, hsum7, 0x23); - __m256 perm4 = _mm256_permute2f128_ps(hsum8, hsum8, 0x23); - - __m256 sum1 = _mm256_add_ps(perm1, hsum5); - __m256 sum2 = _mm256_add_ps(perm2, hsum6); - __m256 sum3 = _mm256_add_ps(perm3, hsum7); - __m256 sum4 = _mm256_add_ps(perm4, hsum8); - - __m256 blend1 = _mm256_blend_ps(sum1, sum2, 0xcc); - __m256 blend2 = _mm256_blend_ps(sum3, sum4, 0xcc); - - __m256 final = _mm256_blend_ps(blend1, blend2, 0xf0); - return final; -} -template<> EIGEN_STRONG_INLINE Packet4d preduxp(const Packet4d* vecs) -{ - Packet4d tmp0, tmp1; - - tmp0 = _mm256_hadd_pd(vecs[0], vecs[1]); - tmp0 = _mm256_add_pd(tmp0, _mm256_permute2f128_pd(tmp0, tmp0, 1)); - - tmp1 = _mm256_hadd_pd(vecs[2], vecs[3]); - tmp1 = _mm256_add_pd(tmp1, _mm256_permute2f128_pd(tmp1, tmp1, 1)); - - return _mm256_blend_pd(tmp0, tmp1, 0xC); -} - -template<> EIGEN_STRONG_INLINE float predux(const Packet8f& a) -{ - return predux(Packet4f(_mm_add_ps(_mm256_castps256_ps128(a),_mm256_extractf128_ps(a,1)))); -} -template<> EIGEN_STRONG_INLINE double predux(const Packet4d& a) -{ - return predux(Packet2d(_mm_add_pd(_mm256_castpd256_pd128(a),_mm256_extractf128_pd(a,1)))); -} - -template<> EIGEN_STRONG_INLINE Packet4f predux_downto4(const Packet8f& a) -{ - return _mm_add_ps(_mm256_castps256_ps128(a),_mm256_extractf128_ps(a,1)); -} - -template<> EIGEN_STRONG_INLINE float predux_mul(const Packet8f& a) -{ - Packet8f tmp; - tmp = _mm256_mul_ps(a, _mm256_permute2f128_ps(a,a,1)); - tmp = _mm256_mul_ps(tmp, _mm256_shuffle_ps(tmp,tmp,_MM_SHUFFLE(1,0,3,2))); - return pfirst(_mm256_mul_ps(tmp, _mm256_shuffle_ps(tmp,tmp,1))); -} -template<> EIGEN_STRONG_INLINE double predux_mul(const Packet4d& a) -{ - Packet4d tmp; - tmp = _mm256_mul_pd(a, _mm256_permute2f128_pd(a,a,1)); - return pfirst(_mm256_mul_pd(tmp, _mm256_shuffle_pd(tmp,tmp,1))); -} - -template<> EIGEN_STRONG_INLINE float predux_min(const Packet8f& a) -{ - Packet8f tmp = _mm256_min_ps(a, _mm256_permute2f128_ps(a,a,1)); - tmp = _mm256_min_ps(tmp, _mm256_shuffle_ps(tmp,tmp,_MM_SHUFFLE(1,0,3,2))); - return pfirst(_mm256_min_ps(tmp, _mm256_shuffle_ps(tmp,tmp,1))); -} -template<> EIGEN_STRONG_INLINE double predux_min(const Packet4d& a) -{ - Packet4d tmp = _mm256_min_pd(a, _mm256_permute2f128_pd(a,a,1)); - return pfirst(_mm256_min_pd(tmp, _mm256_shuffle_pd(tmp, tmp, 1))); -} - -template<> EIGEN_STRONG_INLINE float predux_max(const Packet8f& a) -{ - Packet8f tmp = _mm256_max_ps(a, _mm256_permute2f128_ps(a,a,1)); - tmp = _mm256_max_ps(tmp, _mm256_shuffle_ps(tmp,tmp,_MM_SHUFFLE(1,0,3,2))); - return pfirst(_mm256_max_ps(tmp, _mm256_shuffle_ps(tmp,tmp,1))); -} - -template<> EIGEN_STRONG_INLINE double predux_max(const Packet4d& a) -{ - Packet4d tmp = _mm256_max_pd(a, _mm256_permute2f128_pd(a,a,1)); - return pfirst(_mm256_max_pd(tmp, _mm256_shuffle_pd(tmp, tmp, 1))); -} - - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet8f& first, const Packet8f& second) - { - if (Offset==1) - { - first = _mm256_blend_ps(first, second, 1); - Packet8f tmp1 = _mm256_permute_ps (first, _MM_SHUFFLE(0,3,2,1)); - Packet8f tmp2 = _mm256_permute2f128_ps (tmp1, tmp1, 1); - first = _mm256_blend_ps(tmp1, tmp2, 0x88); - } - else if (Offset==2) - { - first = _mm256_blend_ps(first, second, 3); - Packet8f tmp1 = _mm256_permute_ps (first, _MM_SHUFFLE(1,0,3,2)); - Packet8f tmp2 = _mm256_permute2f128_ps (tmp1, tmp1, 1); - first = _mm256_blend_ps(tmp1, tmp2, 0xcc); - } - else if (Offset==3) - { - first = _mm256_blend_ps(first, second, 7); - Packet8f tmp1 = _mm256_permute_ps (first, _MM_SHUFFLE(2,1,0,3)); - Packet8f tmp2 = _mm256_permute2f128_ps (tmp1, tmp1, 1); - first = _mm256_blend_ps(tmp1, tmp2, 0xee); - } - else if (Offset==4) - { - first = _mm256_blend_ps(first, second, 15); - Packet8f tmp1 = _mm256_permute_ps (first, _MM_SHUFFLE(3,2,1,0)); - Packet8f tmp2 = _mm256_permute2f128_ps (tmp1, tmp1, 1); - first = _mm256_permute_ps(tmp2, _MM_SHUFFLE(3,2,1,0)); - } - else if (Offset==5) - { - first = _mm256_blend_ps(first, second, 31); - first = _mm256_permute2f128_ps(first, first, 1); - Packet8f tmp = _mm256_permute_ps (first, _MM_SHUFFLE(0,3,2,1)); - first = _mm256_permute2f128_ps(tmp, tmp, 1); - first = _mm256_blend_ps(tmp, first, 0x88); - } - else if (Offset==6) - { - first = _mm256_blend_ps(first, second, 63); - first = _mm256_permute2f128_ps(first, first, 1); - Packet8f tmp = _mm256_permute_ps (first, _MM_SHUFFLE(1,0,3,2)); - first = _mm256_permute2f128_ps(tmp, tmp, 1); - first = _mm256_blend_ps(tmp, first, 0xcc); - } - else if (Offset==7) - { - first = _mm256_blend_ps(first, second, 127); - first = _mm256_permute2f128_ps(first, first, 1); - Packet8f tmp = _mm256_permute_ps (first, _MM_SHUFFLE(2,1,0,3)); - first = _mm256_permute2f128_ps(tmp, tmp, 1); - first = _mm256_blend_ps(tmp, first, 0xee); - } - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4d& first, const Packet4d& second) - { - if (Offset==1) - { - first = _mm256_blend_pd(first, second, 1); - __m256d tmp = _mm256_permute_pd(first, 5); - first = _mm256_permute2f128_pd(tmp, tmp, 1); - first = _mm256_blend_pd(tmp, first, 0xA); - } - else if (Offset==2) - { - first = _mm256_blend_pd(first, second, 3); - first = _mm256_permute2f128_pd(first, first, 1); - } - else if (Offset==3) - { - first = _mm256_blend_pd(first, second, 7); - __m256d tmp = _mm256_permute_pd(first, 5); - first = _mm256_permute2f128_pd(tmp, tmp, 1); - first = _mm256_blend_pd(tmp, first, 5); - } - } -}; - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m256 T0 = _mm256_unpacklo_ps(kernel.packet[0], kernel.packet[1]); - __m256 T1 = _mm256_unpackhi_ps(kernel.packet[0], kernel.packet[1]); - __m256 T2 = _mm256_unpacklo_ps(kernel.packet[2], kernel.packet[3]); - __m256 T3 = _mm256_unpackhi_ps(kernel.packet[2], kernel.packet[3]); - __m256 T4 = _mm256_unpacklo_ps(kernel.packet[4], kernel.packet[5]); - __m256 T5 = _mm256_unpackhi_ps(kernel.packet[4], kernel.packet[5]); - __m256 T6 = _mm256_unpacklo_ps(kernel.packet[6], kernel.packet[7]); - __m256 T7 = _mm256_unpackhi_ps(kernel.packet[6], kernel.packet[7]); - __m256 S0 = _mm256_shuffle_ps(T0,T2,_MM_SHUFFLE(1,0,1,0)); - __m256 S1 = _mm256_shuffle_ps(T0,T2,_MM_SHUFFLE(3,2,3,2)); - __m256 S2 = _mm256_shuffle_ps(T1,T3,_MM_SHUFFLE(1,0,1,0)); - __m256 S3 = _mm256_shuffle_ps(T1,T3,_MM_SHUFFLE(3,2,3,2)); - __m256 S4 = _mm256_shuffle_ps(T4,T6,_MM_SHUFFLE(1,0,1,0)); - __m256 S5 = _mm256_shuffle_ps(T4,T6,_MM_SHUFFLE(3,2,3,2)); - __m256 S6 = _mm256_shuffle_ps(T5,T7,_MM_SHUFFLE(1,0,1,0)); - __m256 S7 = _mm256_shuffle_ps(T5,T7,_MM_SHUFFLE(3,2,3,2)); - kernel.packet[0] = _mm256_permute2f128_ps(S0, S4, 0x20); - kernel.packet[1] = _mm256_permute2f128_ps(S1, S5, 0x20); - kernel.packet[2] = _mm256_permute2f128_ps(S2, S6, 0x20); - kernel.packet[3] = _mm256_permute2f128_ps(S3, S7, 0x20); - kernel.packet[4] = _mm256_permute2f128_ps(S0, S4, 0x31); - kernel.packet[5] = _mm256_permute2f128_ps(S1, S5, 0x31); - kernel.packet[6] = _mm256_permute2f128_ps(S2, S6, 0x31); - kernel.packet[7] = _mm256_permute2f128_ps(S3, S7, 0x31); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m256 T0 = _mm256_unpacklo_ps(kernel.packet[0], kernel.packet[1]); - __m256 T1 = _mm256_unpackhi_ps(kernel.packet[0], kernel.packet[1]); - __m256 T2 = _mm256_unpacklo_ps(kernel.packet[2], kernel.packet[3]); - __m256 T3 = _mm256_unpackhi_ps(kernel.packet[2], kernel.packet[3]); - - __m256 S0 = _mm256_shuffle_ps(T0,T2,_MM_SHUFFLE(1,0,1,0)); - __m256 S1 = _mm256_shuffle_ps(T0,T2,_MM_SHUFFLE(3,2,3,2)); - __m256 S2 = _mm256_shuffle_ps(T1,T3,_MM_SHUFFLE(1,0,1,0)); - __m256 S3 = _mm256_shuffle_ps(T1,T3,_MM_SHUFFLE(3,2,3,2)); - - kernel.packet[0] = _mm256_permute2f128_ps(S0, S1, 0x20); - kernel.packet[1] = _mm256_permute2f128_ps(S2, S3, 0x20); - kernel.packet[2] = _mm256_permute2f128_ps(S0, S1, 0x31); - kernel.packet[3] = _mm256_permute2f128_ps(S2, S3, 0x31); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m256d T0 = _mm256_shuffle_pd(kernel.packet[0], kernel.packet[1], 15); - __m256d T1 = _mm256_shuffle_pd(kernel.packet[0], kernel.packet[1], 0); - __m256d T2 = _mm256_shuffle_pd(kernel.packet[2], kernel.packet[3], 15); - __m256d T3 = _mm256_shuffle_pd(kernel.packet[2], kernel.packet[3], 0); - - kernel.packet[1] = _mm256_permute2f128_pd(T0, T2, 32); - kernel.packet[3] = _mm256_permute2f128_pd(T0, T2, 49); - kernel.packet[0] = _mm256_permute2f128_pd(T1, T3, 32); - kernel.packet[2] = _mm256_permute2f128_pd(T1, T3, 49); -} - -template<> EIGEN_STRONG_INLINE Packet8f pblend(const Selector<8>& ifPacket, const Packet8f& thenPacket, const Packet8f& elsePacket) { - const __m256 zero = _mm256_setzero_ps(); - const __m256 select = _mm256_set_ps(ifPacket.select[7], ifPacket.select[6], ifPacket.select[5], ifPacket.select[4], ifPacket.select[3], ifPacket.select[2], ifPacket.select[1], ifPacket.select[0]); - __m256 false_mask = _mm256_cmp_ps(select, zero, _CMP_EQ_UQ); - return _mm256_blendv_ps(thenPacket, elsePacket, false_mask); -} -template<> EIGEN_STRONG_INLINE Packet4d pblend(const Selector<4>& ifPacket, const Packet4d& thenPacket, const Packet4d& elsePacket) { - const __m256d zero = _mm256_setzero_pd(); - const __m256d select = _mm256_set_pd(ifPacket.select[3], ifPacket.select[2], ifPacket.select[1], ifPacket.select[0]); - __m256d false_mask = _mm256_cmp_pd(select, zero, _CMP_EQ_UQ); - return _mm256_blendv_pd(thenPacket, elsePacket, false_mask); -} - -template<> EIGEN_STRONG_INLINE Packet8f pinsertfirst(const Packet8f& a, float b) -{ - return _mm256_blend_ps(a,pset1(b),1); -} - -template<> EIGEN_STRONG_INLINE Packet4d pinsertfirst(const Packet4d& a, double b) -{ - return _mm256_blend_pd(a,pset1(b),1); -} - -template<> EIGEN_STRONG_INLINE Packet8f pinsertlast(const Packet8f& a, float b) -{ - return _mm256_blend_ps(a,pset1(b),(1<<7)); -} - -template<> EIGEN_STRONG_INLINE Packet4d pinsertlast(const Packet4d& a, double b) -{ - return _mm256_blend_pd(a,pset1(b),(1<<3)); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PACKET_MATH_AVX_H diff --git a/Eigen/src/Core/arch/AVX/TypeCasting.h b/Eigen/src/Core/arch/AVX/TypeCasting.h deleted file mode 100644 index 83bfdc604..000000000 --- a/Eigen/src/Core/arch/AVX/TypeCasting.h +++ /dev/null @@ -1,51 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TYPE_CASTING_AVX_H -#define EIGEN_TYPE_CASTING_AVX_H - -namespace Eigen { - -namespace internal { - -// For now we use SSE to handle integers, so we can't use AVX instructions to cast -// from int to float -template <> -struct type_casting_traits { - enum { - VectorizedCast = 0, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 0, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - - - -template<> EIGEN_STRONG_INLINE Packet8i pcast(const Packet8f& a) { - return _mm256_cvtps_epi32(a); -} - -template<> EIGEN_STRONG_INLINE Packet8f pcast(const Packet8i& a) { - return _mm256_cvtepi32_ps(a); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TYPE_CASTING_AVX_H diff --git a/Eigen/src/Core/arch/AVX512/MathFunctions.h b/Eigen/src/Core/arch/AVX512/MathFunctions.h deleted file mode 100644 index 399be0ee4..000000000 --- a/Eigen/src/Core/arch/AVX512/MathFunctions.h +++ /dev/null @@ -1,396 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2016 Pedro Gonnet (pedro.gonnet@gmail.com) -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef THIRD_PARTY_EIGEN3_EIGEN_SRC_CORE_ARCH_AVX512_MATHFUNCTIONS_H_ -#define THIRD_PARTY_EIGEN3_EIGEN_SRC_CORE_ARCH_AVX512_MATHFUNCTIONS_H_ - -namespace Eigen { - -namespace internal { - -// Disable the code for older versions of gcc that don't support many of the required avx512 instrinsics. -#if EIGEN_GNUC_AT_LEAST(5, 3) - -#define _EIGEN_DECLARE_CONST_Packet16f(NAME, X) \ - const Packet16f p16f_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(NAME, X) \ - const Packet16f p16f_##NAME = (__m512)pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet8d(NAME, X) \ - const Packet8d p8d_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet8d_FROM_INT64(NAME, X) \ - const Packet8d p8d_##NAME = _mm512_castsi512_pd(_mm512_set1_epi64(X)) - -// Natural logarithm -// Computes log(x) as log(2^e * m) = C*e + log(m), where the constant C =log(2) -// and m is in the range [sqrt(1/2),sqrt(2)). In this range, the logarithm can -// be easily approximated by a polynomial centered on m=1 for stability. -#if defined(EIGEN_VECTORIZE_AVX512DQ) -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet16f -plog(const Packet16f& _x) { - Packet16f x = _x; - _EIGEN_DECLARE_CONST_Packet16f(1, 1.0f); - _EIGEN_DECLARE_CONST_Packet16f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet16f(126f, 126.0f); - - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(inv_mant_mask, ~0x7f800000); - - // The smallest non denormalized float number. - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(min_norm_pos, 0x00800000); - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(minus_inf, 0xff800000); - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(nan, 0x7fc00000); - - // Polynomial coefficients. - _EIGEN_DECLARE_CONST_Packet16f(cephes_SQRTHF, 0.707106781186547524f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p0, 7.0376836292E-2f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p1, -1.1514610310E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p2, 1.1676998740E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p3, -1.2420140846E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p4, +1.4249322787E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p5, -1.6668057665E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p6, +2.0000714765E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p7, -2.4999993993E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_p8, +3.3333331174E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_q1, -2.12194440e-4f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_log_q2, 0.693359375f); - - // invalid_mask is set to true when x is NaN - __mmask16 invalid_mask = - _mm512_cmp_ps_mask(x, _mm512_setzero_ps(), _CMP_NGE_UQ); - __mmask16 iszero_mask = - _mm512_cmp_ps_mask(x, _mm512_setzero_ps(), _CMP_EQ_UQ); - - // Truncate input values to the minimum positive normal. - x = pmax(x, p16f_min_norm_pos); - - // Extract the shifted exponents. - Packet16f emm0 = _mm512_cvtepi32_ps(_mm512_srli_epi32((__m512i)x, 23)); - Packet16f e = _mm512_sub_ps(emm0, p16f_126f); - - // Set the exponents to -1, i.e. x are in the range [0.5,1). - x = _mm512_and_ps(x, p16f_inv_mant_mask); - x = _mm512_or_ps(x, p16f_half); - - // part2: Shift the inputs from the range [0.5,1) to [sqrt(1/2),sqrt(2)) - // and shift by -1. The values are then centered around 0, which improves - // the stability of the polynomial evaluation. - // if( x < SQRTHF ) { - // e -= 1; - // x = x + x - 1.0; - // } else { x = x - 1.0; } - __mmask16 mask = _mm512_cmp_ps_mask(x, p16f_cephes_SQRTHF, _CMP_LT_OQ); - Packet16f tmp = _mm512_mask_blend_ps(mask, x, _mm512_setzero_ps()); - x = psub(x, p16f_1); - e = psub(e, _mm512_mask_blend_ps(mask, p16f_1, _mm512_setzero_ps())); - x = padd(x, tmp); - - Packet16f x2 = pmul(x, x); - Packet16f x3 = pmul(x2, x); - - // Evaluate the polynomial approximant of degree 8 in three parts, probably - // to improve instruction-level parallelism. - Packet16f y, y1, y2; - y = pmadd(p16f_cephes_log_p0, x, p16f_cephes_log_p1); - y1 = pmadd(p16f_cephes_log_p3, x, p16f_cephes_log_p4); - y2 = pmadd(p16f_cephes_log_p6, x, p16f_cephes_log_p7); - y = pmadd(y, x, p16f_cephes_log_p2); - y1 = pmadd(y1, x, p16f_cephes_log_p5); - y2 = pmadd(y2, x, p16f_cephes_log_p8); - y = pmadd(y, x3, y1); - y = pmadd(y, x3, y2); - y = pmul(y, x3); - - // Add the logarithm of the exponent back to the result of the interpolation. - y1 = pmul(e, p16f_cephes_log_q1); - tmp = pmul(x2, p16f_half); - y = padd(y, y1); - x = psub(x, tmp); - y2 = pmul(e, p16f_cephes_log_q2); - x = padd(x, y); - x = padd(x, y2); - - // Filter out invalid inputs, i.e. negative arg will be NAN, 0 will be -INF. - return _mm512_mask_blend_ps(iszero_mask, p16f_minus_inf, - _mm512_mask_blend_ps(invalid_mask, p16f_nan, x)); -} -#endif - -// Exponential function. Works by writing "x = m*log(2) + r" where -// "m = floor(x/log(2)+1/2)" and "r" is the remainder. The result is then -// "exp(x) = 2^m*exp(r)" where exp(r) is in the range [-1,1). -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet16f -pexp(const Packet16f& _x) { - _EIGEN_DECLARE_CONST_Packet16f(1, 1.0f); - _EIGEN_DECLARE_CONST_Packet16f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet16f(127, 127.0f); - - _EIGEN_DECLARE_CONST_Packet16f(exp_hi, 88.3762626647950f); - _EIGEN_DECLARE_CONST_Packet16f(exp_lo, -88.3762626647949f); - - _EIGEN_DECLARE_CONST_Packet16f(cephes_LOG2EF, 1.44269504088896341f); - - _EIGEN_DECLARE_CONST_Packet16f(cephes_exp_p0, 1.9875691500E-4f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_exp_p1, 1.3981999507E-3f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_exp_p2, 8.3334519073E-3f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_exp_p3, 4.1665795894E-2f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_exp_p4, 1.6666665459E-1f); - _EIGEN_DECLARE_CONST_Packet16f(cephes_exp_p5, 5.0000001201E-1f); - - // Clamp x. - Packet16f x = pmax(pmin(_x, p16f_exp_hi), p16f_exp_lo); - - // Express exp(x) as exp(m*ln(2) + r), start by extracting - // m = floor(x/ln(2) + 0.5). - Packet16f m = _mm512_floor_ps(pmadd(x, p16f_cephes_LOG2EF, p16f_half)); - - // Get r = x - m*ln(2). Note that we can do this without losing more than one - // ulp precision due to the FMA instruction. - _EIGEN_DECLARE_CONST_Packet16f(nln2, -0.6931471805599453f); - Packet16f r = _mm512_fmadd_ps(m, p16f_nln2, x); - Packet16f r2 = pmul(r, r); - - // TODO(gonnet): Split into odd/even polynomials and try to exploit - // instruction-level parallelism. - Packet16f y = p16f_cephes_exp_p0; - y = pmadd(y, r, p16f_cephes_exp_p1); - y = pmadd(y, r, p16f_cephes_exp_p2); - y = pmadd(y, r, p16f_cephes_exp_p3); - y = pmadd(y, r, p16f_cephes_exp_p4); - y = pmadd(y, r, p16f_cephes_exp_p5); - y = pmadd(y, r2, r); - y = padd(y, p16f_1); - - // Build emm0 = 2^m. - Packet16i emm0 = _mm512_cvttps_epi32(padd(m, p16f_127)); - emm0 = _mm512_slli_epi32(emm0, 23); - - // Return 2^m * exp(r). - return pmax(pmul(y, _mm512_castsi512_ps(emm0)), _x); -} - -/*template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8d -pexp(const Packet8d& _x) { - Packet8d x = _x; - - _EIGEN_DECLARE_CONST_Packet8d(1, 1.0); - _EIGEN_DECLARE_CONST_Packet8d(2, 2.0); - - _EIGEN_DECLARE_CONST_Packet8d(exp_hi, 709.437); - _EIGEN_DECLARE_CONST_Packet8d(exp_lo, -709.436139303); - - _EIGEN_DECLARE_CONST_Packet8d(cephes_LOG2EF, 1.4426950408889634073599); - - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_p0, 1.26177193074810590878e-4); - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_p1, 3.02994407707441961300e-2); - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_p2, 9.99999999999999999910e-1); - - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_q0, 3.00198505138664455042e-6); - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_q1, 2.52448340349684104192e-3); - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_q2, 2.27265548208155028766e-1); - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_q3, 2.00000000000000000009e0); - - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_C1, 0.693145751953125); - _EIGEN_DECLARE_CONST_Packet8d(cephes_exp_C2, 1.42860682030941723212e-6); - - // clamp x - x = pmax(pmin(x, p8d_exp_hi), p8d_exp_lo); - - // Express exp(x) as exp(g + n*log(2)). - const Packet8d n = - _mm512_mul_round_pd(p8d_cephes_LOG2EF, x, _MM_FROUND_TO_NEAREST_INT); - - // Get the remainder modulo log(2), i.e. the "g" described above. Subtract - // n*log(2) out in two steps, i.e. n*C1 + n*C2, C1+C2=log2 to get the last - // digits right. - const Packet8d nC1 = pmul(n, p8d_cephes_exp_C1); - const Packet8d nC2 = pmul(n, p8d_cephes_exp_C2); - x = psub(x, nC1); - x = psub(x, nC2); - - const Packet8d x2 = pmul(x, x); - - // Evaluate the numerator polynomial of the rational interpolant. - Packet8d px = p8d_cephes_exp_p0; - px = pmadd(px, x2, p8d_cephes_exp_p1); - px = pmadd(px, x2, p8d_cephes_exp_p2); - px = pmul(px, x); - - // Evaluate the denominator polynomial of the rational interpolant. - Packet8d qx = p8d_cephes_exp_q0; - qx = pmadd(qx, x2, p8d_cephes_exp_q1); - qx = pmadd(qx, x2, p8d_cephes_exp_q2); - qx = pmadd(qx, x2, p8d_cephes_exp_q3); - - // I don't really get this bit, copied from the SSE2 routines, so... - // TODO(gonnet): Figure out what is going on here, perhaps find a better - // rational interpolant? - x = _mm512_div_pd(px, psub(qx, px)); - x = pmadd(p8d_2, x, p8d_1); - - // Build e=2^n. - const Packet8d e = _mm512_castsi512_pd(_mm512_slli_epi64( - _mm512_add_epi64(_mm512_cvtpd_epi64(n), _mm512_set1_epi64(1023)), 52)); - - // Construct the result 2^n * exp(g) = e * x. The max is used to catch - // non-finite values in the input. - return pmax(pmul(x, e), _x); - }*/ - -// Functions for sqrt. -// The EIGEN_FAST_MATH version uses the _mm_rsqrt_ps approximation and one step -// of Newton's method, at a cost of 1-2 bits of precision as opposed to the -// exact solution. The main advantage of this approach is not just speed, but -// also the fact that it can be inlined and pipelined with other computations, -// further reducing its effective latency. -#if EIGEN_FAST_MATH -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet16f -psqrt(const Packet16f& _x) { - _EIGEN_DECLARE_CONST_Packet16f(one_point_five, 1.5f); - _EIGEN_DECLARE_CONST_Packet16f(minus_half, -0.5f); - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(flt_min, 0x00800000); - - Packet16f neg_half = pmul(_x, p16f_minus_half); - - // select only the inverse sqrt of positive normal inputs (denormals are - // flushed to zero and cause infs as well). - __mmask16 non_zero_mask = _mm512_cmp_ps_mask(_x, p16f_flt_min, _CMP_GE_OQ); - Packet16f x = _mm512_mask_blend_ps(non_zero_mask, _mm512_rsqrt14_ps(_x), - _mm512_setzero_ps()); - - // Do a single step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p16f_one_point_five)); - - // Multiply the original _x by it's reciprocal square root to extract the - // square root. - return pmul(_x, x); -} - -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8d -psqrt(const Packet8d& _x) { - _EIGEN_DECLARE_CONST_Packet8d(one_point_five, 1.5); - _EIGEN_DECLARE_CONST_Packet8d(minus_half, -0.5); - _EIGEN_DECLARE_CONST_Packet8d_FROM_INT64(dbl_min, 0x0010000000000000LL); - - Packet8d neg_half = pmul(_x, p8d_minus_half); - - // select only the inverse sqrt of positive normal inputs (denormals are - // flushed to zero and cause infs as well). - __mmask8 non_zero_mask = _mm512_cmp_pd_mask(_x, p8d_dbl_min, _CMP_GE_OQ); - Packet8d x = _mm512_mask_blend_pd(non_zero_mask, _mm512_rsqrt14_pd(_x), - _mm512_setzero_pd()); - - // Do a first step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p8d_one_point_five)); - - // Do a second step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p8d_one_point_five)); - - // Multiply the original _x by it's reciprocal square root to extract the - // square root. - return pmul(_x, x); -} -#else -template <> -EIGEN_STRONG_INLINE Packet16f psqrt(const Packet16f& x) { - return _mm512_sqrt_ps(x); -} -template <> -EIGEN_STRONG_INLINE Packet8d psqrt(const Packet8d& x) { - return _mm512_sqrt_pd(x); -} -#endif - -// Functions for rsqrt. -// Almost identical to the sqrt routine, just leave out the last multiplication -// and fill in NaN/Inf where needed. Note that this function only exists as an -// iterative version for doubles since there is no instruction for diretly -// computing the reciprocal square root in AVX-512. -#ifdef EIGEN_FAST_MATH -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet16f -prsqrt(const Packet16f& _x) { - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(inf, 0x7f800000); - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(nan, 0x7fc00000); - _EIGEN_DECLARE_CONST_Packet16f(one_point_five, 1.5f); - _EIGEN_DECLARE_CONST_Packet16f(minus_half, -0.5f); - _EIGEN_DECLARE_CONST_Packet16f_FROM_INT(flt_min, 0x00800000); - - Packet16f neg_half = pmul(_x, p16f_minus_half); - - // select only the inverse sqrt of positive normal inputs (denormals are - // flushed to zero and cause infs as well). - __mmask16 le_zero_mask = _mm512_cmp_ps_mask(_x, p16f_flt_min, _CMP_LT_OQ); - Packet16f x = _mm512_mask_blend_ps(le_zero_mask, _mm512_setzero_ps(), - _mm512_rsqrt14_ps(_x)); - - // Fill in NaNs and Infs for the negative/zero entries. - __mmask16 neg_mask = _mm512_cmp_ps_mask(_x, _mm512_setzero_ps(), _CMP_LT_OQ); - Packet16f infs_and_nans = _mm512_mask_blend_ps( - neg_mask, p16f_nan, - _mm512_mask_blend_ps(le_zero_mask, p16f_inf, _mm512_setzero_ps())); - - // Do a single step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p16f_one_point_five)); - - // Insert NaNs and Infs in all the right places. - return _mm512_mask_blend_ps(le_zero_mask, infs_and_nans, x); -} - -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet8d -prsqrt(const Packet8d& _x) { - _EIGEN_DECLARE_CONST_Packet8d_FROM_INT64(inf, 0x7ff0000000000000LL); - _EIGEN_DECLARE_CONST_Packet8d_FROM_INT64(nan, 0x7ff1000000000000LL); - _EIGEN_DECLARE_CONST_Packet8d(one_point_five, 1.5); - _EIGEN_DECLARE_CONST_Packet8d(minus_half, -0.5); - _EIGEN_DECLARE_CONST_Packet8d_FROM_INT64(dbl_min, 0x0010000000000000LL); - - Packet8d neg_half = pmul(_x, p8d_minus_half); - - // select only the inverse sqrt of positive normal inputs (denormals are - // flushed to zero and cause infs as well). - __mmask8 le_zero_mask = _mm512_cmp_pd_mask(_x, p8d_dbl_min, _CMP_LT_OQ); - Packet8d x = _mm512_mask_blend_pd(le_zero_mask, _mm512_setzero_pd(), - _mm512_rsqrt14_pd(_x)); - - // Fill in NaNs and Infs for the negative/zero entries. - __mmask8 neg_mask = _mm512_cmp_pd_mask(_x, _mm512_setzero_pd(), _CMP_LT_OQ); - Packet8d infs_and_nans = _mm512_mask_blend_pd( - neg_mask, p8d_nan, - _mm512_mask_blend_pd(le_zero_mask, p8d_inf, _mm512_setzero_pd())); - - // Do a first step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p8d_one_point_five)); - - // Do a second step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p8d_one_point_five)); - - // Insert NaNs and Infs in all the right places. - return _mm512_mask_blend_pd(le_zero_mask, infs_and_nans, x); -} -#else -template <> -EIGEN_STRONG_INLINE Packet16f prsqrt(const Packet16f& x) { - return _mm512_rsqrt28_ps(x); -} -#endif -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // THIRD_PARTY_EIGEN3_EIGEN_SRC_CORE_ARCH_AVX512_MATHFUNCTIONS_H_ diff --git a/Eigen/src/Core/arch/AVX512/PacketMath.h b/Eigen/src/Core/arch/AVX512/PacketMath.h deleted file mode 100644 index 12b897572..000000000 --- a/Eigen/src/Core/arch/AVX512/PacketMath.h +++ /dev/null @@ -1,1286 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2016 Benoit Steiner (benoit.steiner.goog@gmail.com) -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_AVX512_H -#define EIGEN_PACKET_MATH_AVX512_H - -namespace Eigen { - -namespace internal { - -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 8 -#endif - -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS (2*sizeof(void*)) -#endif - -#ifdef __FMA__ -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#endif -#endif - -typedef __m512 Packet16f; -typedef __m512i Packet16i; -typedef __m512d Packet8d; - -template <> -struct is_arithmetic<__m512> { - enum { value = true }; -}; -template <> -struct is_arithmetic<__m512i> { - enum { value = true }; -}; -template <> -struct is_arithmetic<__m512d> { - enum { value = true }; -}; - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet16f type; - typedef Packet8f half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 16, - HasHalfPacket = 1, -#if EIGEN_GNUC_AT_LEAST(5, 3) -#ifdef EIGEN_VECTORIZE_AVX512DQ - HasLog = 1, -#endif - HasExp = 1, - HasSqrt = EIGEN_FAST_MATH, - HasRsqrt = EIGEN_FAST_MATH, -#endif - HasDiv = 1 - }; - }; -template<> struct packet_traits : default_packet_traits -{ - typedef Packet8d type; - typedef Packet4d half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 8, - HasHalfPacket = 1, -#if EIGEN_GNUC_AT_LEAST(5, 3) - HasSqrt = EIGEN_FAST_MATH, - HasRsqrt = EIGEN_FAST_MATH, -#endif - HasDiv = 1 - }; -}; - -/* TODO Implement AVX512 for integers -template<> struct packet_traits : default_packet_traits -{ - typedef Packet16i type; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=8 - }; -}; -*/ - -template <> -struct unpacket_traits { - typedef float type; - typedef Packet8f half; - enum { size = 16, alignment=Aligned64 }; -}; -template <> -struct unpacket_traits { - typedef double type; - typedef Packet4d half; - enum { size = 8, alignment=Aligned64 }; -}; -template <> -struct unpacket_traits { - typedef int type; - typedef Packet8i half; - enum { size = 16, alignment=Aligned64 }; -}; - -template <> -EIGEN_STRONG_INLINE Packet16f pset1(const float& from) { - return _mm512_set1_ps(from); -} -template <> -EIGEN_STRONG_INLINE Packet8d pset1(const double& from) { - return _mm512_set1_pd(from); -} -template <> -EIGEN_STRONG_INLINE Packet16i pset1(const int& from) { - return _mm512_set1_epi32(from); -} - -template <> -EIGEN_STRONG_INLINE Packet16f pload1(const float* from) { - return _mm512_broadcastss_ps(_mm_load_ps1(from)); -} -template <> -EIGEN_STRONG_INLINE Packet8d pload1(const double* from) { - return _mm512_broadcastsd_pd(_mm_load_pd1(from)); -} - -template <> -EIGEN_STRONG_INLINE Packet16f plset(const float& a) { - return _mm512_add_ps( - _mm512_set1_ps(a), - _mm512_set_ps(15.0f, 14.0f, 13.0f, 12.0f, 11.0f, 10.0f, 9.0f, 8.0f, 7.0f, 6.0f, 5.0f, - 4.0f, 3.0f, 2.0f, 1.0f, 0.0f)); -} -template <> -EIGEN_STRONG_INLINE Packet8d plset(const double& a) { - return _mm512_add_pd(_mm512_set1_pd(a), - _mm512_set_pd(7.0, 6.0, 5.0, 4.0, 3.0, 2.0, 1.0, 0.0)); -} - -template <> -EIGEN_STRONG_INLINE Packet16f padd(const Packet16f& a, - const Packet16f& b) { - return _mm512_add_ps(a, b); -} -template <> -EIGEN_STRONG_INLINE Packet8d padd(const Packet8d& a, - const Packet8d& b) { - return _mm512_add_pd(a, b); -} - -template <> -EIGEN_STRONG_INLINE Packet16f psub(const Packet16f& a, - const Packet16f& b) { - return _mm512_sub_ps(a, b); -} -template <> -EIGEN_STRONG_INLINE Packet8d psub(const Packet8d& a, - const Packet8d& b) { - return _mm512_sub_pd(a, b); -} - -template <> -EIGEN_STRONG_INLINE Packet16f pnegate(const Packet16f& a) { - return _mm512_sub_ps(_mm512_set1_ps(0.0), a); -} -template <> -EIGEN_STRONG_INLINE Packet8d pnegate(const Packet8d& a) { - return _mm512_sub_pd(_mm512_set1_pd(0.0), a); -} - -template <> -EIGEN_STRONG_INLINE Packet16f pconj(const Packet16f& a) { - return a; -} -template <> -EIGEN_STRONG_INLINE Packet8d pconj(const Packet8d& a) { - return a; -} -template <> -EIGEN_STRONG_INLINE Packet16i pconj(const Packet16i& a) { - return a; -} - -template <> -EIGEN_STRONG_INLINE Packet16f pmul(const Packet16f& a, - const Packet16f& b) { - return _mm512_mul_ps(a, b); -} -template <> -EIGEN_STRONG_INLINE Packet8d pmul(const Packet8d& a, - const Packet8d& b) { - return _mm512_mul_pd(a, b); -} - -template <> -EIGEN_STRONG_INLINE Packet16f pdiv(const Packet16f& a, - const Packet16f& b) { - return _mm512_div_ps(a, b); -} -template <> -EIGEN_STRONG_INLINE Packet8d pdiv(const Packet8d& a, - const Packet8d& b) { - return _mm512_div_pd(a, b); -} - -#ifdef __FMA__ -template <> -EIGEN_STRONG_INLINE Packet16f pmadd(const Packet16f& a, const Packet16f& b, - const Packet16f& c) { - return _mm512_fmadd_ps(a, b, c); -} -template <> -EIGEN_STRONG_INLINE Packet8d pmadd(const Packet8d& a, const Packet8d& b, - const Packet8d& c) { - return _mm512_fmadd_pd(a, b, c); -} -#endif - -template <> -EIGEN_STRONG_INLINE Packet16f pmin(const Packet16f& a, - const Packet16f& b) { - // Arguments are reversed to match NaN propagation behavior of std::min. - return _mm512_min_ps(b, a); -} -template <> -EIGEN_STRONG_INLINE Packet8d pmin(const Packet8d& a, - const Packet8d& b) { - // Arguments are reversed to match NaN propagation behavior of std::min. - return _mm512_min_pd(b, a); -} - -template <> -EIGEN_STRONG_INLINE Packet16f pmax(const Packet16f& a, - const Packet16f& b) { - // Arguments are reversed to match NaN propagation behavior of std::max. - return _mm512_max_ps(b, a); -} -template <> -EIGEN_STRONG_INLINE Packet8d pmax(const Packet8d& a, - const Packet8d& b) { - // Arguments are reversed to match NaN propagation behavior of std::max. - return _mm512_max_pd(b, a); -} - -template <> -EIGEN_STRONG_INLINE Packet16f pand(const Packet16f& a, - const Packet16f& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_and_ps(a, b); -#else - Packet16f res = _mm512_undefined_ps(); - Packet4f lane0_a = _mm512_extractf32x4_ps(a, 0); - Packet4f lane0_b = _mm512_extractf32x4_ps(b, 0); - res = _mm512_insertf32x4(res, _mm_and_ps(lane0_a, lane0_b), 0); - - Packet4f lane1_a = _mm512_extractf32x4_ps(a, 1); - Packet4f lane1_b = _mm512_extractf32x4_ps(b, 1); - res = _mm512_insertf32x4(res, _mm_and_ps(lane1_a, lane1_b), 1); - - Packet4f lane2_a = _mm512_extractf32x4_ps(a, 2); - Packet4f lane2_b = _mm512_extractf32x4_ps(b, 2); - res = _mm512_insertf32x4(res, _mm_and_ps(lane2_a, lane2_b), 2); - - Packet4f lane3_a = _mm512_extractf32x4_ps(a, 3); - Packet4f lane3_b = _mm512_extractf32x4_ps(b, 3); - res = _mm512_insertf32x4(res, _mm_and_ps(lane3_a, lane3_b), 3); - - return res; -#endif -} -template <> -EIGEN_STRONG_INLINE Packet8d pand(const Packet8d& a, - const Packet8d& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_and_pd(a, b); -#else - Packet8d res = _mm512_undefined_pd(); - Packet4d lane0_a = _mm512_extractf64x4_pd(a, 0); - Packet4d lane0_b = _mm512_extractf64x4_pd(b, 0); - res = _mm512_insertf64x4(res, _mm256_and_pd(lane0_a, lane0_b), 0); - - Packet4d lane1_a = _mm512_extractf64x4_pd(a, 1); - Packet4d lane1_b = _mm512_extractf64x4_pd(b, 1); - res = _mm512_insertf64x4(res, _mm256_and_pd(lane1_a, lane1_b), 1); - - return res; -#endif -} -template <> -EIGEN_STRONG_INLINE Packet16f por(const Packet16f& a, - const Packet16f& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_or_ps(a, b); -#else - Packet16f res = _mm512_undefined_ps(); - Packet4f lane0_a = _mm512_extractf32x4_ps(a, 0); - Packet4f lane0_b = _mm512_extractf32x4_ps(b, 0); - res = _mm512_insertf32x4(res, _mm_or_ps(lane0_a, lane0_b), 0); - - Packet4f lane1_a = _mm512_extractf32x4_ps(a, 1); - Packet4f lane1_b = _mm512_extractf32x4_ps(b, 1); - res = _mm512_insertf32x4(res, _mm_or_ps(lane1_a, lane1_b), 1); - - Packet4f lane2_a = _mm512_extractf32x4_ps(a, 2); - Packet4f lane2_b = _mm512_extractf32x4_ps(b, 2); - res = _mm512_insertf32x4(res, _mm_or_ps(lane2_a, lane2_b), 2); - - Packet4f lane3_a = _mm512_extractf32x4_ps(a, 3); - Packet4f lane3_b = _mm512_extractf32x4_ps(b, 3); - res = _mm512_insertf32x4(res, _mm_or_ps(lane3_a, lane3_b), 3); - - return res; -#endif -} - -template <> -EIGEN_STRONG_INLINE Packet8d por(const Packet8d& a, - const Packet8d& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_or_pd(a, b); -#else - Packet8d res = _mm512_undefined_pd(); - Packet4d lane0_a = _mm512_extractf64x4_pd(a, 0); - Packet4d lane0_b = _mm512_extractf64x4_pd(b, 0); - res = _mm512_insertf64x4(res, _mm256_or_pd(lane0_a, lane0_b), 0); - - Packet4d lane1_a = _mm512_extractf64x4_pd(a, 1); - Packet4d lane1_b = _mm512_extractf64x4_pd(b, 1); - res = _mm512_insertf64x4(res, _mm256_or_pd(lane1_a, lane1_b), 1); - - return res; -#endif -} - -template <> -EIGEN_STRONG_INLINE Packet16f pxor(const Packet16f& a, - const Packet16f& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_xor_ps(a, b); -#else - Packet16f res = _mm512_undefined_ps(); - Packet4f lane0_a = _mm512_extractf32x4_ps(a, 0); - Packet4f lane0_b = _mm512_extractf32x4_ps(b, 0); - res = _mm512_insertf32x4(res, _mm_xor_ps(lane0_a, lane0_b), 0); - - Packet4f lane1_a = _mm512_extractf32x4_ps(a, 1); - Packet4f lane1_b = _mm512_extractf32x4_ps(b, 1); - res = _mm512_insertf32x4(res, _mm_xor_ps(lane1_a, lane1_b), 1); - - Packet4f lane2_a = _mm512_extractf32x4_ps(a, 2); - Packet4f lane2_b = _mm512_extractf32x4_ps(b, 2); - res = _mm512_insertf32x4(res, _mm_xor_ps(lane2_a, lane2_b), 2); - - Packet4f lane3_a = _mm512_extractf32x4_ps(a, 3); - Packet4f lane3_b = _mm512_extractf32x4_ps(b, 3); - res = _mm512_insertf32x4(res, _mm_xor_ps(lane3_a, lane3_b), 3); - - return res; -#endif -} -template <> -EIGEN_STRONG_INLINE Packet8d pxor(const Packet8d& a, - const Packet8d& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_xor_pd(a, b); -#else - Packet8d res = _mm512_undefined_pd(); - Packet4d lane0_a = _mm512_extractf64x4_pd(a, 0); - Packet4d lane0_b = _mm512_extractf64x4_pd(b, 0); - res = _mm512_insertf64x4(res, _mm256_xor_pd(lane0_a, lane0_b), 0); - - Packet4d lane1_a = _mm512_extractf64x4_pd(a, 1); - Packet4d lane1_b = _mm512_extractf64x4_pd(b, 1); - res = _mm512_insertf64x4(res, _mm256_xor_pd(lane1_a, lane1_b), 1); - - return res; -#endif -} - -template <> -EIGEN_STRONG_INLINE Packet16f pandnot(const Packet16f& a, - const Packet16f& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_andnot_ps(a, b); -#else - Packet16f res = _mm512_undefined_ps(); - Packet4f lane0_a = _mm512_extractf32x4_ps(a, 0); - Packet4f lane0_b = _mm512_extractf32x4_ps(b, 0); - res = _mm512_insertf32x4(res, _mm_andnot_ps(lane0_a, lane0_b), 0); - - Packet4f lane1_a = _mm512_extractf32x4_ps(a, 1); - Packet4f lane1_b = _mm512_extractf32x4_ps(b, 1); - res = _mm512_insertf32x4(res, _mm_andnot_ps(lane1_a, lane1_b), 1); - - Packet4f lane2_a = _mm512_extractf32x4_ps(a, 2); - Packet4f lane2_b = _mm512_extractf32x4_ps(b, 2); - res = _mm512_insertf32x4(res, _mm_andnot_ps(lane2_a, lane2_b), 2); - - Packet4f lane3_a = _mm512_extractf32x4_ps(a, 3); - Packet4f lane3_b = _mm512_extractf32x4_ps(b, 3); - res = _mm512_insertf32x4(res, _mm_andnot_ps(lane3_a, lane3_b), 3); - - return res; -#endif -} -template <> -EIGEN_STRONG_INLINE Packet8d pandnot(const Packet8d& a, - const Packet8d& b) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - return _mm512_andnot_pd(a, b); -#else - Packet8d res = _mm512_undefined_pd(); - Packet4d lane0_a = _mm512_extractf64x4_pd(a, 0); - Packet4d lane0_b = _mm512_extractf64x4_pd(b, 0); - res = _mm512_insertf64x4(res, _mm256_andnot_pd(lane0_a, lane0_b), 0); - - Packet4d lane1_a = _mm512_extractf64x4_pd(a, 1); - Packet4d lane1_b = _mm512_extractf64x4_pd(b, 1); - res = _mm512_insertf64x4(res, _mm256_andnot_pd(lane1_a, lane1_b), 1); - - return res; -#endif -} - -template <> -EIGEN_STRONG_INLINE Packet16f pload(const float* from) { - EIGEN_DEBUG_ALIGNED_LOAD return _mm512_load_ps(from); -} -template <> -EIGEN_STRONG_INLINE Packet8d pload(const double* from) { - EIGEN_DEBUG_ALIGNED_LOAD return _mm512_load_pd(from); -} -template <> -EIGEN_STRONG_INLINE Packet16i pload(const int* from) { - EIGEN_DEBUG_ALIGNED_LOAD return _mm512_load_si512( - reinterpret_cast(from)); -} - -template <> -EIGEN_STRONG_INLINE Packet16f ploadu(const float* from) { - EIGEN_DEBUG_UNALIGNED_LOAD return _mm512_loadu_ps(from); -} -template <> -EIGEN_STRONG_INLINE Packet8d ploadu(const double* from) { - EIGEN_DEBUG_UNALIGNED_LOAD return _mm512_loadu_pd(from); -} -template <> -EIGEN_STRONG_INLINE Packet16i ploadu(const int* from) { - EIGEN_DEBUG_UNALIGNED_LOAD return _mm512_loadu_si512( - reinterpret_cast(from)); -} - -// Loads 8 floats from memory a returns the packet -// {a0, a0 a1, a1, a2, a2, a3, a3, a4, a4, a5, a5, a6, a6, a7, a7} -template <> -EIGEN_STRONG_INLINE Packet16f ploaddup(const float* from) { - __m256i low_half = _mm256_load_si256(reinterpret_cast(from)); - __m512 even_elements = _mm512_castsi512_ps(_mm512_cvtepu32_epi64(low_half)); - __m512 pairs = _mm512_permute_ps(even_elements, _MM_SHUFFLE(2, 2, 0, 0)); - return pairs; -} -// Loads 4 doubles from memory a returns the packet {a0, a0 a1, a1, a2, a2, a3, -// a3} -template <> -EIGEN_STRONG_INLINE Packet8d ploaddup(const double* from) { - __m512d x = _mm512_setzero_pd(); - x = _mm512_insertf64x2(x, _mm_loaddup_pd(&from[0]), 0); - x = _mm512_insertf64x2(x, _mm_loaddup_pd(&from[1]), 1); - x = _mm512_insertf64x2(x, _mm_loaddup_pd(&from[2]), 2); - x = _mm512_insertf64x2(x, _mm_loaddup_pd(&from[3]), 3); - return x; -} - -// Loads 4 floats from memory a returns the packet -// {a0, a0 a0, a0, a1, a1, a1, a1, a2, a2, a2, a2, a3, a3, a3, a3} -template <> -EIGEN_STRONG_INLINE Packet16f ploadquad(const float* from) { - Packet16f tmp = _mm512_undefined_ps(); - tmp = _mm512_insertf32x4(tmp, _mm_load_ps1(from), 0); - tmp = _mm512_insertf32x4(tmp, _mm_load_ps1(from + 1), 1); - tmp = _mm512_insertf32x4(tmp, _mm_load_ps1(from + 2), 2); - tmp = _mm512_insertf32x4(tmp, _mm_load_ps1(from + 3), 3); - return tmp; -} -// Loads 2 doubles from memory a returns the packet -// {a0, a0 a0, a0, a1, a1, a1, a1} -template <> -EIGEN_STRONG_INLINE Packet8d ploadquad(const double* from) { - __m128d tmp0 = _mm_load_pd1(from); - __m256d lane0 = _mm256_broadcastsd_pd(tmp0); - __m128d tmp1 = _mm_load_pd1(from + 1); - __m256d lane1 = _mm256_broadcastsd_pd(tmp1); - __m512d tmp = _mm512_undefined_pd(); - tmp = _mm512_insertf64x4(tmp, lane0, 0); - return _mm512_insertf64x4(tmp, lane1, 1); -} - -template <> -EIGEN_STRONG_INLINE void pstore(float* to, const Packet16f& from) { - EIGEN_DEBUG_ALIGNED_STORE _mm512_store_ps(to, from); -} -template <> -EIGEN_STRONG_INLINE void pstore(double* to, const Packet8d& from) { - EIGEN_DEBUG_ALIGNED_STORE _mm512_store_pd(to, from); -} -template <> -EIGEN_STRONG_INLINE void pstore(int* to, const Packet16i& from) { - EIGEN_DEBUG_ALIGNED_STORE _mm512_storeu_si512(reinterpret_cast<__m512i*>(to), - from); -} - -template <> -EIGEN_STRONG_INLINE void pstoreu(float* to, const Packet16f& from) { - EIGEN_DEBUG_UNALIGNED_STORE _mm512_storeu_ps(to, from); -} -template <> -EIGEN_STRONG_INLINE void pstoreu(double* to, const Packet8d& from) { - EIGEN_DEBUG_UNALIGNED_STORE _mm512_storeu_pd(to, from); -} -template <> -EIGEN_STRONG_INLINE void pstoreu(int* to, const Packet16i& from) { - EIGEN_DEBUG_UNALIGNED_STORE _mm512_storeu_si512( - reinterpret_cast<__m512i*>(to), from); -} - -template <> -EIGEN_DEVICE_FUNC inline Packet16f pgather(const float* from, - Index stride) { - Packet16i stride_vector = _mm512_set1_epi32(stride); - Packet16i stride_multiplier = - _mm512_set_epi32(15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0); - Packet16i indices = _mm512_mullo_epi32(stride_vector, stride_multiplier); - - return _mm512_i32gather_ps(indices, from, 4); -} -template <> -EIGEN_DEVICE_FUNC inline Packet8d pgather(const double* from, - Index stride) { - Packet8i stride_vector = _mm256_set1_epi32(stride); - Packet8i stride_multiplier = _mm256_set_epi32(7, 6, 5, 4, 3, 2, 1, 0); - Packet8i indices = _mm256_mullo_epi32(stride_vector, stride_multiplier); - - return _mm512_i32gather_pd(indices, from, 8); -} - -template <> -EIGEN_DEVICE_FUNC inline void pscatter(float* to, - const Packet16f& from, - Index stride) { - Packet16i stride_vector = _mm512_set1_epi32(stride); - Packet16i stride_multiplier = - _mm512_set_epi32(15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0); - Packet16i indices = _mm512_mullo_epi32(stride_vector, stride_multiplier); - _mm512_i32scatter_ps(to, indices, from, 4); -} -template <> -EIGEN_DEVICE_FUNC inline void pscatter(double* to, - const Packet8d& from, - Index stride) { - Packet8i stride_vector = _mm256_set1_epi32(stride); - Packet8i stride_multiplier = _mm256_set_epi32(7, 6, 5, 4, 3, 2, 1, 0); - Packet8i indices = _mm256_mullo_epi32(stride_vector, stride_multiplier); - _mm512_i32scatter_pd(to, indices, from, 8); -} - -template <> -EIGEN_STRONG_INLINE void pstore1(float* to, const float& a) { - Packet16f pa = pset1(a); - pstore(to, pa); -} -template <> -EIGEN_STRONG_INLINE void pstore1(double* to, const double& a) { - Packet8d pa = pset1(a); - pstore(to, pa); -} -template <> -EIGEN_STRONG_INLINE void pstore1(int* to, const int& a) { - Packet16i pa = pset1(a); - pstore(to, pa); -} - -template<> EIGEN_STRONG_INLINE void prefetch(const float* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -template<> EIGEN_STRONG_INLINE void prefetch(const double* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -template<> EIGEN_STRONG_INLINE void prefetch(const int* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } - -template <> -EIGEN_STRONG_INLINE float pfirst(const Packet16f& a) { - return _mm_cvtss_f32(_mm512_extractf32x4_ps(a, 0)); -} -template <> -EIGEN_STRONG_INLINE double pfirst(const Packet8d& a) { - return _mm_cvtsd_f64(_mm256_extractf128_pd(_mm512_extractf64x4_pd(a, 0), 0)); -} -template <> -EIGEN_STRONG_INLINE int pfirst(const Packet16i& a) { - return _mm_extract_epi32(_mm512_extracti32x4_epi32(a, 0), 0); -} - -template<> EIGEN_STRONG_INLINE Packet16f preverse(const Packet16f& a) -{ - return _mm512_permutexvar_ps(_mm512_set_epi32(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15), a); -} - -template<> EIGEN_STRONG_INLINE Packet8d preverse(const Packet8d& a) -{ - return _mm512_permutexvar_pd(_mm512_set_epi32(0, 0, 0, 1, 0, 2, 0, 3, 0, 4, 0, 5, 0, 6, 0, 7), a); -} - -template<> EIGEN_STRONG_INLINE Packet16f pabs(const Packet16f& a) -{ - // _mm512_abs_ps intrinsic not found, so hack around it - return (__m512)_mm512_and_si512((__m512i)a, _mm512_set1_epi32(0x7fffffff)); -} -template <> -EIGEN_STRONG_INLINE Packet8d pabs(const Packet8d& a) { - // _mm512_abs_ps intrinsic not found, so hack around it - return (__m512d)_mm512_and_si512((__m512i)a, - _mm512_set1_epi64(0x7fffffffffffffff)); -} - -#ifdef EIGEN_VECTORIZE_AVX512DQ -// AVX512F does not define _mm512_extractf32x8_ps to extract _m256 from _m512 -#define EIGEN_EXTRACT_8f_FROM_16f(INPUT, OUTPUT) \ - __m256 OUTPUT##_0 = _mm512_extractf32x8_ps(INPUT, 0); \ - __m256 OUTPUT##_1 = _mm512_extractf32x8_ps(INPUT, 1) -#else -#define EIGEN_EXTRACT_8f_FROM_16f(INPUT, OUTPUT) \ - __m256 OUTPUT##_0 = _mm256_insertf128_ps( \ - _mm256_castps128_ps256(_mm512_extractf32x4_ps(INPUT, 0)), \ - _mm512_extractf32x4_ps(INPUT, 1), 1); \ - __m256 OUTPUT##_1 = _mm256_insertf128_ps( \ - _mm256_castps128_ps256(_mm512_extractf32x4_ps(INPUT, 2)), \ - _mm512_extractf32x4_ps(INPUT, 3), 1); -#endif - -#ifdef EIGEN_VECTORIZE_AVX512DQ -#define EIGEN_INSERT_8f_INTO_16f(OUTPUT, INPUTA, INPUTB) \ - OUTPUT = _mm512_insertf32x8(OUTPUT, INPUTA, 0); \ - OUTPUT = _mm512_insertf32x8(OUTPUT, INPUTB, 1); -#else -#define EIGEN_INSERT_8f_INTO_16f(OUTPUT, INPUTA, INPUTB) \ - OUTPUT = _mm512_insertf32x4(OUTPUT, _mm256_extractf128_ps(INPUTA, 0), 0); \ - OUTPUT = _mm512_insertf32x4(OUTPUT, _mm256_extractf128_ps(INPUTA, 1), 1); \ - OUTPUT = _mm512_insertf32x4(OUTPUT, _mm256_extractf128_ps(INPUTB, 0), 2); \ - OUTPUT = _mm512_insertf32x4(OUTPUT, _mm256_extractf128_ps(INPUTB, 1), 3); -#endif -template<> EIGEN_STRONG_INLINE Packet16f preduxp(const Packet16f* -vecs) -{ - EIGEN_EXTRACT_8f_FROM_16f(vecs[0], vecs0); - EIGEN_EXTRACT_8f_FROM_16f(vecs[1], vecs1); - EIGEN_EXTRACT_8f_FROM_16f(vecs[2], vecs2); - EIGEN_EXTRACT_8f_FROM_16f(vecs[3], vecs3); - EIGEN_EXTRACT_8f_FROM_16f(vecs[4], vecs4); - EIGEN_EXTRACT_8f_FROM_16f(vecs[5], vecs5); - EIGEN_EXTRACT_8f_FROM_16f(vecs[6], vecs6); - EIGEN_EXTRACT_8f_FROM_16f(vecs[7], vecs7); - EIGEN_EXTRACT_8f_FROM_16f(vecs[8], vecs8); - EIGEN_EXTRACT_8f_FROM_16f(vecs[9], vecs9); - EIGEN_EXTRACT_8f_FROM_16f(vecs[10], vecs10); - EIGEN_EXTRACT_8f_FROM_16f(vecs[11], vecs11); - EIGEN_EXTRACT_8f_FROM_16f(vecs[12], vecs12); - EIGEN_EXTRACT_8f_FROM_16f(vecs[13], vecs13); - EIGEN_EXTRACT_8f_FROM_16f(vecs[14], vecs14); - EIGEN_EXTRACT_8f_FROM_16f(vecs[15], vecs15); - - __m256 hsum1 = _mm256_hadd_ps(vecs0_0, vecs1_0); - __m256 hsum2 = _mm256_hadd_ps(vecs2_0, vecs3_0); - __m256 hsum3 = _mm256_hadd_ps(vecs4_0, vecs5_0); - __m256 hsum4 = _mm256_hadd_ps(vecs6_0, vecs7_0); - - __m256 hsum5 = _mm256_hadd_ps(hsum1, hsum1); - __m256 hsum6 = _mm256_hadd_ps(hsum2, hsum2); - __m256 hsum7 = _mm256_hadd_ps(hsum3, hsum3); - __m256 hsum8 = _mm256_hadd_ps(hsum4, hsum4); - - __m256 perm1 = _mm256_permute2f128_ps(hsum5, hsum5, 0x23); - __m256 perm2 = _mm256_permute2f128_ps(hsum6, hsum6, 0x23); - __m256 perm3 = _mm256_permute2f128_ps(hsum7, hsum7, 0x23); - __m256 perm4 = _mm256_permute2f128_ps(hsum8, hsum8, 0x23); - - __m256 sum1 = _mm256_add_ps(perm1, hsum5); - __m256 sum2 = _mm256_add_ps(perm2, hsum6); - __m256 sum3 = _mm256_add_ps(perm3, hsum7); - __m256 sum4 = _mm256_add_ps(perm4, hsum8); - - __m256 blend1 = _mm256_blend_ps(sum1, sum2, 0xcc); - __m256 blend2 = _mm256_blend_ps(sum3, sum4, 0xcc); - - __m256 final = _mm256_blend_ps(blend1, blend2, 0xf0); - - hsum1 = _mm256_hadd_ps(vecs0_1, vecs1_1); - hsum2 = _mm256_hadd_ps(vecs2_1, vecs3_1); - hsum3 = _mm256_hadd_ps(vecs4_1, vecs5_1); - hsum4 = _mm256_hadd_ps(vecs6_1, vecs7_1); - - hsum5 = _mm256_hadd_ps(hsum1, hsum1); - hsum6 = _mm256_hadd_ps(hsum2, hsum2); - hsum7 = _mm256_hadd_ps(hsum3, hsum3); - hsum8 = _mm256_hadd_ps(hsum4, hsum4); - - perm1 = _mm256_permute2f128_ps(hsum5, hsum5, 0x23); - perm2 = _mm256_permute2f128_ps(hsum6, hsum6, 0x23); - perm3 = _mm256_permute2f128_ps(hsum7, hsum7, 0x23); - perm4 = _mm256_permute2f128_ps(hsum8, hsum8, 0x23); - - sum1 = _mm256_add_ps(perm1, hsum5); - sum2 = _mm256_add_ps(perm2, hsum6); - sum3 = _mm256_add_ps(perm3, hsum7); - sum4 = _mm256_add_ps(perm4, hsum8); - - blend1 = _mm256_blend_ps(sum1, sum2, 0xcc); - blend2 = _mm256_blend_ps(sum3, sum4, 0xcc); - - final = _mm256_add_ps(final, _mm256_blend_ps(blend1, blend2, 0xf0)); - - hsum1 = _mm256_hadd_ps(vecs8_0, vecs9_0); - hsum2 = _mm256_hadd_ps(vecs10_0, vecs11_0); - hsum3 = _mm256_hadd_ps(vecs12_0, vecs13_0); - hsum4 = _mm256_hadd_ps(vecs14_0, vecs15_0); - - hsum5 = _mm256_hadd_ps(hsum1, hsum1); - hsum6 = _mm256_hadd_ps(hsum2, hsum2); - hsum7 = _mm256_hadd_ps(hsum3, hsum3); - hsum8 = _mm256_hadd_ps(hsum4, hsum4); - - perm1 = _mm256_permute2f128_ps(hsum5, hsum5, 0x23); - perm2 = _mm256_permute2f128_ps(hsum6, hsum6, 0x23); - perm3 = _mm256_permute2f128_ps(hsum7, hsum7, 0x23); - perm4 = _mm256_permute2f128_ps(hsum8, hsum8, 0x23); - - sum1 = _mm256_add_ps(perm1, hsum5); - sum2 = _mm256_add_ps(perm2, hsum6); - sum3 = _mm256_add_ps(perm3, hsum7); - sum4 = _mm256_add_ps(perm4, hsum8); - - blend1 = _mm256_blend_ps(sum1, sum2, 0xcc); - blend2 = _mm256_blend_ps(sum3, sum4, 0xcc); - - __m256 final_1 = _mm256_blend_ps(blend1, blend2, 0xf0); - - hsum1 = _mm256_hadd_ps(vecs8_1, vecs9_1); - hsum2 = _mm256_hadd_ps(vecs10_1, vecs11_1); - hsum3 = _mm256_hadd_ps(vecs12_1, vecs13_1); - hsum4 = _mm256_hadd_ps(vecs14_1, vecs15_1); - - hsum5 = _mm256_hadd_ps(hsum1, hsum1); - hsum6 = _mm256_hadd_ps(hsum2, hsum2); - hsum7 = _mm256_hadd_ps(hsum3, hsum3); - hsum8 = _mm256_hadd_ps(hsum4, hsum4); - - perm1 = _mm256_permute2f128_ps(hsum5, hsum5, 0x23); - perm2 = _mm256_permute2f128_ps(hsum6, hsum6, 0x23); - perm3 = _mm256_permute2f128_ps(hsum7, hsum7, 0x23); - perm4 = _mm256_permute2f128_ps(hsum8, hsum8, 0x23); - - sum1 = _mm256_add_ps(perm1, hsum5); - sum2 = _mm256_add_ps(perm2, hsum6); - sum3 = _mm256_add_ps(perm3, hsum7); - sum4 = _mm256_add_ps(perm4, hsum8); - - blend1 = _mm256_blend_ps(sum1, sum2, 0xcc); - blend2 = _mm256_blend_ps(sum3, sum4, 0xcc); - - final_1 = _mm256_add_ps(final_1, _mm256_blend_ps(blend1, blend2, 0xf0)); - - __m512 final_output; - - EIGEN_INSERT_8f_INTO_16f(final_output, final, final_1); - return final_output; -} - -template<> EIGEN_STRONG_INLINE Packet8d preduxp(const Packet8d* vecs) -{ - Packet4d vecs0_0 = _mm512_extractf64x4_pd(vecs[0], 0); - Packet4d vecs0_1 = _mm512_extractf64x4_pd(vecs[0], 1); - - Packet4d vecs1_0 = _mm512_extractf64x4_pd(vecs[1], 0); - Packet4d vecs1_1 = _mm512_extractf64x4_pd(vecs[1], 1); - - Packet4d vecs2_0 = _mm512_extractf64x4_pd(vecs[2], 0); - Packet4d vecs2_1 = _mm512_extractf64x4_pd(vecs[2], 1); - - Packet4d vecs3_0 = _mm512_extractf64x4_pd(vecs[3], 0); - Packet4d vecs3_1 = _mm512_extractf64x4_pd(vecs[3], 1); - - Packet4d vecs4_0 = _mm512_extractf64x4_pd(vecs[4], 0); - Packet4d vecs4_1 = _mm512_extractf64x4_pd(vecs[4], 1); - - Packet4d vecs5_0 = _mm512_extractf64x4_pd(vecs[5], 0); - Packet4d vecs5_1 = _mm512_extractf64x4_pd(vecs[5], 1); - - Packet4d vecs6_0 = _mm512_extractf64x4_pd(vecs[6], 0); - Packet4d vecs6_1 = _mm512_extractf64x4_pd(vecs[6], 1); - - Packet4d vecs7_0 = _mm512_extractf64x4_pd(vecs[7], 0); - Packet4d vecs7_1 = _mm512_extractf64x4_pd(vecs[7], 1); - - Packet4d tmp0, tmp1; - - tmp0 = _mm256_hadd_pd(vecs0_0, vecs1_0); - tmp0 = _mm256_add_pd(tmp0, _mm256_permute2f128_pd(tmp0, tmp0, 1)); - - tmp1 = _mm256_hadd_pd(vecs2_0, vecs3_0); - tmp1 = _mm256_add_pd(tmp1, _mm256_permute2f128_pd(tmp1, tmp1, 1)); - - __m256d final_0 = _mm256_blend_pd(tmp0, tmp1, 0xC); - - tmp0 = _mm256_hadd_pd(vecs0_1, vecs1_1); - tmp0 = _mm256_add_pd(tmp0, _mm256_permute2f128_pd(tmp0, tmp0, 1)); - - tmp1 = _mm256_hadd_pd(vecs2_1, vecs3_1); - tmp1 = _mm256_add_pd(tmp1, _mm256_permute2f128_pd(tmp1, tmp1, 1)); - - final_0 = _mm256_add_pd(final_0, _mm256_blend_pd(tmp0, tmp1, 0xC)); - - tmp0 = _mm256_hadd_pd(vecs4_0, vecs5_0); - tmp0 = _mm256_add_pd(tmp0, _mm256_permute2f128_pd(tmp0, tmp0, 1)); - - tmp1 = _mm256_hadd_pd(vecs6_0, vecs7_0); - tmp1 = _mm256_add_pd(tmp1, _mm256_permute2f128_pd(tmp1, tmp1, 1)); - - __m256d final_1 = _mm256_blend_pd(tmp0, tmp1, 0xC); - - tmp0 = _mm256_hadd_pd(vecs4_1, vecs5_1); - tmp0 = _mm256_add_pd(tmp0, _mm256_permute2f128_pd(tmp0, tmp0, 1)); - - tmp1 = _mm256_hadd_pd(vecs6_1, vecs7_1); - tmp1 = _mm256_add_pd(tmp1, _mm256_permute2f128_pd(tmp1, tmp1, 1)); - - final_1 = _mm256_add_pd(final_1, _mm256_blend_pd(tmp0, tmp1, 0xC)); - - __m512d final_output = _mm512_insertf64x4(final_output, final_0, 0); - - return _mm512_insertf64x4(final_output, final_1, 1); -} - -template <> -EIGEN_STRONG_INLINE float predux(const Packet16f& a) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - __m256 lane0 = _mm512_extractf32x8_ps(a, 0); - __m256 lane1 = _mm512_extractf32x8_ps(a, 1); - Packet8f x = _mm256_add_ps(lane0, lane1); - return predux(x); -#else - __m128 lane0 = _mm512_extractf32x4_ps(a, 0); - __m128 lane1 = _mm512_extractf32x4_ps(a, 1); - __m128 lane2 = _mm512_extractf32x4_ps(a, 2); - __m128 lane3 = _mm512_extractf32x4_ps(a, 3); - __m128 sum = _mm_add_ps(_mm_add_ps(lane0, lane1), _mm_add_ps(lane2, lane3)); - sum = _mm_hadd_ps(sum, sum); - sum = _mm_hadd_ps(sum, _mm_permute_ps(sum, 1)); - return _mm_cvtss_f32(sum); -#endif -} -template <> -EIGEN_STRONG_INLINE double predux(const Packet8d& a) { - __m256d lane0 = _mm512_extractf64x4_pd(a, 0); - __m256d lane1 = _mm512_extractf64x4_pd(a, 1); - __m256d sum = _mm256_add_pd(lane0, lane1); - __m256d tmp0 = _mm256_hadd_pd(sum, _mm256_permute2f128_pd(sum, sum, 1)); - return _mm_cvtsd_f64(_mm256_castpd256_pd128(_mm256_hadd_pd(tmp0, tmp0))); -} - -template <> -EIGEN_STRONG_INLINE Packet8f predux_downto4(const Packet16f& a) { -#ifdef EIGEN_VECTORIZE_AVX512DQ - __m256 lane0 = _mm512_extractf32x8_ps(a, 0); - __m256 lane1 = _mm512_extractf32x8_ps(a, 1); - return _mm256_add_ps(lane0, lane1); -#else - __m128 lane0 = _mm512_extractf32x4_ps(a, 0); - __m128 lane1 = _mm512_extractf32x4_ps(a, 1); - __m128 lane2 = _mm512_extractf32x4_ps(a, 2); - __m128 lane3 = _mm512_extractf32x4_ps(a, 3); - __m128 sum0 = _mm_add_ps(lane0, lane2); - __m128 sum1 = _mm_add_ps(lane1, lane3); - return _mm256_insertf128_ps(_mm256_castps128_ps256(sum0), sum1, 1); -#endif -} -template <> -EIGEN_STRONG_INLINE Packet4d predux_downto4(const Packet8d& a) { - __m256d lane0 = _mm512_extractf64x4_pd(a, 0); - __m256d lane1 = _mm512_extractf64x4_pd(a, 1); - __m256d res = _mm256_add_pd(lane0, lane1); - return res; -} - -template <> -EIGEN_STRONG_INLINE float predux_mul(const Packet16f& a) { -//#ifdef EIGEN_VECTORIZE_AVX512DQ -#if 0 - Packet8f lane0 = _mm512_extractf32x8_ps(a, 0); - Packet8f lane1 = _mm512_extractf32x8_ps(a, 1); - Packet8f res = pmul(lane0, lane1); - res = pmul(res, _mm256_permute2f128_ps(res, res, 1)); - res = pmul(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 3, 2))); - return pfirst(pmul(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 0, 1)))); -#else - __m128 lane0 = _mm512_extractf32x4_ps(a, 0); - __m128 lane1 = _mm512_extractf32x4_ps(a, 1); - __m128 lane2 = _mm512_extractf32x4_ps(a, 2); - __m128 lane3 = _mm512_extractf32x4_ps(a, 3); - __m128 res = pmul(pmul(lane0, lane1), pmul(lane2, lane3)); - res = pmul(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 3, 2))); - return pfirst(pmul(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 0, 1)))); -#endif -} -template <> -EIGEN_STRONG_INLINE double predux_mul(const Packet8d& a) { - __m256d lane0 = _mm512_extractf64x4_pd(a, 0); - __m256d lane1 = _mm512_extractf64x4_pd(a, 1); - __m256d res = pmul(lane0, lane1); - res = pmul(res, _mm256_permute2f128_pd(res, res, 1)); - return pfirst(pmul(res, _mm256_shuffle_pd(res, res, 1))); -} - -template <> -EIGEN_STRONG_INLINE float predux_min(const Packet16f& a) { - __m128 lane0 = _mm512_extractf32x4_ps(a, 0); - __m128 lane1 = _mm512_extractf32x4_ps(a, 1); - __m128 lane2 = _mm512_extractf32x4_ps(a, 2); - __m128 lane3 = _mm512_extractf32x4_ps(a, 3); - __m128 res = _mm_min_ps(_mm_min_ps(lane0, lane1), _mm_min_ps(lane2, lane3)); - res = _mm_min_ps(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 3, 2))); - return pfirst(_mm_min_ps(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 0, 1)))); -} -template <> -EIGEN_STRONG_INLINE double predux_min(const Packet8d& a) { - __m256d lane0 = _mm512_extractf64x4_pd(a, 0); - __m256d lane1 = _mm512_extractf64x4_pd(a, 1); - __m256d res = _mm256_min_pd(lane0, lane1); - res = _mm256_min_pd(res, _mm256_permute2f128_pd(res, res, 1)); - return pfirst(_mm256_min_pd(res, _mm256_shuffle_pd(res, res, 1))); -} - -template <> -EIGEN_STRONG_INLINE float predux_max(const Packet16f& a) { - __m128 lane0 = _mm512_extractf32x4_ps(a, 0); - __m128 lane1 = _mm512_extractf32x4_ps(a, 1); - __m128 lane2 = _mm512_extractf32x4_ps(a, 2); - __m128 lane3 = _mm512_extractf32x4_ps(a, 3); - __m128 res = _mm_max_ps(_mm_max_ps(lane0, lane1), _mm_max_ps(lane2, lane3)); - res = _mm_max_ps(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 3, 2))); - return pfirst(_mm_max_ps(res, _mm_permute_ps(res, _MM_SHUFFLE(0, 0, 0, 1)))); -} - -template <> -EIGEN_STRONG_INLINE double predux_max(const Packet8d& a) { - __m256d lane0 = _mm512_extractf64x4_pd(a, 0); - __m256d lane1 = _mm512_extractf64x4_pd(a, 1); - __m256d res = _mm256_max_pd(lane0, lane1); - res = _mm256_max_pd(res, _mm256_permute2f128_pd(res, res, 1)); - return pfirst(_mm256_max_pd(res, _mm256_shuffle_pd(res, res, 1))); -} - -template -struct palign_impl { - static EIGEN_STRONG_INLINE void run(Packet16f& first, - const Packet16f& second) { - if (Offset != 0) { - __m512i first_idx = _mm512_set_epi32( - Offset + 15, Offset + 14, Offset + 13, Offset + 12, Offset + 11, - Offset + 10, Offset + 9, Offset + 8, Offset + 7, Offset + 6, - Offset + 5, Offset + 4, Offset + 3, Offset + 2, Offset + 1, Offset); - - __m512i second_idx = - _mm512_set_epi32(Offset - 1, Offset - 2, Offset - 3, Offset - 4, - Offset - 5, Offset - 6, Offset - 7, Offset - 8, - Offset - 9, Offset - 10, Offset - 11, Offset - 12, - Offset - 13, Offset - 14, Offset - 15, Offset - 16); - - unsigned short mask = 0xFFFF; - mask <<= (16 - Offset); - - first = _mm512_permutexvar_ps(first_idx, first); - Packet16f tmp = _mm512_permutexvar_ps(second_idx, second); - first = _mm512_mask_blend_ps(mask, first, tmp); - } - } -}; -template -struct palign_impl { - static EIGEN_STRONG_INLINE void run(Packet8d& first, const Packet8d& second) { - if (Offset != 0) { - __m512i first_idx = _mm512_set_epi32( - 0, Offset + 7, 0, Offset + 6, 0, Offset + 5, 0, Offset + 4, 0, - Offset + 3, 0, Offset + 2, 0, Offset + 1, 0, Offset); - - __m512i second_idx = _mm512_set_epi32( - 0, Offset - 1, 0, Offset - 2, 0, Offset - 3, 0, Offset - 4, 0, - Offset - 5, 0, Offset - 6, 0, Offset - 7, 0, Offset - 8); - - unsigned char mask = 0xFF; - mask <<= (8 - Offset); - - first = _mm512_permutexvar_pd(first_idx, first); - Packet8d tmp = _mm512_permutexvar_pd(second_idx, second); - first = _mm512_mask_blend_pd(mask, first, tmp); - } - } -}; - - -#define PACK_OUTPUT(OUTPUT, INPUT, INDEX, STRIDE) \ - EIGEN_INSERT_8f_INTO_16f(OUTPUT[INDEX], INPUT[INDEX], INPUT[INDEX + STRIDE]); - -EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock& kernel) { - __m512 T0 = _mm512_unpacklo_ps(kernel.packet[0], kernel.packet[1]); - __m512 T1 = _mm512_unpackhi_ps(kernel.packet[0], kernel.packet[1]); - __m512 T2 = _mm512_unpacklo_ps(kernel.packet[2], kernel.packet[3]); - __m512 T3 = _mm512_unpackhi_ps(kernel.packet[2], kernel.packet[3]); - __m512 T4 = _mm512_unpacklo_ps(kernel.packet[4], kernel.packet[5]); - __m512 T5 = _mm512_unpackhi_ps(kernel.packet[4], kernel.packet[5]); - __m512 T6 = _mm512_unpacklo_ps(kernel.packet[6], kernel.packet[7]); - __m512 T7 = _mm512_unpackhi_ps(kernel.packet[6], kernel.packet[7]); - __m512 T8 = _mm512_unpacklo_ps(kernel.packet[8], kernel.packet[9]); - __m512 T9 = _mm512_unpackhi_ps(kernel.packet[8], kernel.packet[9]); - __m512 T10 = _mm512_unpacklo_ps(kernel.packet[10], kernel.packet[11]); - __m512 T11 = _mm512_unpackhi_ps(kernel.packet[10], kernel.packet[11]); - __m512 T12 = _mm512_unpacklo_ps(kernel.packet[12], kernel.packet[13]); - __m512 T13 = _mm512_unpackhi_ps(kernel.packet[12], kernel.packet[13]); - __m512 T14 = _mm512_unpacklo_ps(kernel.packet[14], kernel.packet[15]); - __m512 T15 = _mm512_unpackhi_ps(kernel.packet[14], kernel.packet[15]); - __m512 S0 = _mm512_shuffle_ps(T0, T2, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S1 = _mm512_shuffle_ps(T0, T2, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S2 = _mm512_shuffle_ps(T1, T3, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S3 = _mm512_shuffle_ps(T1, T3, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S4 = _mm512_shuffle_ps(T4, T6, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S5 = _mm512_shuffle_ps(T4, T6, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S6 = _mm512_shuffle_ps(T5, T7, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S7 = _mm512_shuffle_ps(T5, T7, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S8 = _mm512_shuffle_ps(T8, T10, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S9 = _mm512_shuffle_ps(T8, T10, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S10 = _mm512_shuffle_ps(T9, T11, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S11 = _mm512_shuffle_ps(T9, T11, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S12 = _mm512_shuffle_ps(T12, T14, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S13 = _mm512_shuffle_ps(T12, T14, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S14 = _mm512_shuffle_ps(T13, T15, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S15 = _mm512_shuffle_ps(T13, T15, _MM_SHUFFLE(3, 2, 3, 2)); - - EIGEN_EXTRACT_8f_FROM_16f(S0, S0); - EIGEN_EXTRACT_8f_FROM_16f(S1, S1); - EIGEN_EXTRACT_8f_FROM_16f(S2, S2); - EIGEN_EXTRACT_8f_FROM_16f(S3, S3); - EIGEN_EXTRACT_8f_FROM_16f(S4, S4); - EIGEN_EXTRACT_8f_FROM_16f(S5, S5); - EIGEN_EXTRACT_8f_FROM_16f(S6, S6); - EIGEN_EXTRACT_8f_FROM_16f(S7, S7); - EIGEN_EXTRACT_8f_FROM_16f(S8, S8); - EIGEN_EXTRACT_8f_FROM_16f(S9, S9); - EIGEN_EXTRACT_8f_FROM_16f(S10, S10); - EIGEN_EXTRACT_8f_FROM_16f(S11, S11); - EIGEN_EXTRACT_8f_FROM_16f(S12, S12); - EIGEN_EXTRACT_8f_FROM_16f(S13, S13); - EIGEN_EXTRACT_8f_FROM_16f(S14, S14); - EIGEN_EXTRACT_8f_FROM_16f(S15, S15); - - PacketBlock tmp; - - tmp.packet[0] = _mm256_permute2f128_ps(S0_0, S4_0, 0x20); - tmp.packet[1] = _mm256_permute2f128_ps(S1_0, S5_0, 0x20); - tmp.packet[2] = _mm256_permute2f128_ps(S2_0, S6_0, 0x20); - tmp.packet[3] = _mm256_permute2f128_ps(S3_0, S7_0, 0x20); - tmp.packet[4] = _mm256_permute2f128_ps(S0_0, S4_0, 0x31); - tmp.packet[5] = _mm256_permute2f128_ps(S1_0, S5_0, 0x31); - tmp.packet[6] = _mm256_permute2f128_ps(S2_0, S6_0, 0x31); - tmp.packet[7] = _mm256_permute2f128_ps(S3_0, S7_0, 0x31); - - tmp.packet[8] = _mm256_permute2f128_ps(S0_1, S4_1, 0x20); - tmp.packet[9] = _mm256_permute2f128_ps(S1_1, S5_1, 0x20); - tmp.packet[10] = _mm256_permute2f128_ps(S2_1, S6_1, 0x20); - tmp.packet[11] = _mm256_permute2f128_ps(S3_1, S7_1, 0x20); - tmp.packet[12] = _mm256_permute2f128_ps(S0_1, S4_1, 0x31); - tmp.packet[13] = _mm256_permute2f128_ps(S1_1, S5_1, 0x31); - tmp.packet[14] = _mm256_permute2f128_ps(S2_1, S6_1, 0x31); - tmp.packet[15] = _mm256_permute2f128_ps(S3_1, S7_1, 0x31); - - // Second set of _m256 outputs - tmp.packet[16] = _mm256_permute2f128_ps(S8_0, S12_0, 0x20); - tmp.packet[17] = _mm256_permute2f128_ps(S9_0, S13_0, 0x20); - tmp.packet[18] = _mm256_permute2f128_ps(S10_0, S14_0, 0x20); - tmp.packet[19] = _mm256_permute2f128_ps(S11_0, S15_0, 0x20); - tmp.packet[20] = _mm256_permute2f128_ps(S8_0, S12_0, 0x31); - tmp.packet[21] = _mm256_permute2f128_ps(S9_0, S13_0, 0x31); - tmp.packet[22] = _mm256_permute2f128_ps(S10_0, S14_0, 0x31); - tmp.packet[23] = _mm256_permute2f128_ps(S11_0, S15_0, 0x31); - - tmp.packet[24] = _mm256_permute2f128_ps(S8_1, S12_1, 0x20); - tmp.packet[25] = _mm256_permute2f128_ps(S9_1, S13_1, 0x20); - tmp.packet[26] = _mm256_permute2f128_ps(S10_1, S14_1, 0x20); - tmp.packet[27] = _mm256_permute2f128_ps(S11_1, S15_1, 0x20); - tmp.packet[28] = _mm256_permute2f128_ps(S8_1, S12_1, 0x31); - tmp.packet[29] = _mm256_permute2f128_ps(S9_1, S13_1, 0x31); - tmp.packet[30] = _mm256_permute2f128_ps(S10_1, S14_1, 0x31); - tmp.packet[31] = _mm256_permute2f128_ps(S11_1, S15_1, 0x31); - - // Pack them into the output - PACK_OUTPUT(kernel.packet, tmp.packet, 0, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 1, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 2, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 3, 16); - - PACK_OUTPUT(kernel.packet, tmp.packet, 4, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 5, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 6, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 7, 16); - - PACK_OUTPUT(kernel.packet, tmp.packet, 8, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 9, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 10, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 11, 16); - - PACK_OUTPUT(kernel.packet, tmp.packet, 12, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 13, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 14, 16); - PACK_OUTPUT(kernel.packet, tmp.packet, 15, 16); -} -#define PACK_OUTPUT_2(OUTPUT, INPUT, INDEX, STRIDE) \ - EIGEN_INSERT_8f_INTO_16f(OUTPUT[INDEX], INPUT[2 * INDEX], \ - INPUT[2 * INDEX + STRIDE]); - -EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock& kernel) { - __m512 T0 = _mm512_unpacklo_ps(kernel.packet[0], kernel.packet[1]); - __m512 T1 = _mm512_unpackhi_ps(kernel.packet[0], kernel.packet[1]); - __m512 T2 = _mm512_unpacklo_ps(kernel.packet[2], kernel.packet[3]); - __m512 T3 = _mm512_unpackhi_ps(kernel.packet[2], kernel.packet[3]); - - __m512 S0 = _mm512_shuffle_ps(T0, T2, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S1 = _mm512_shuffle_ps(T0, T2, _MM_SHUFFLE(3, 2, 3, 2)); - __m512 S2 = _mm512_shuffle_ps(T1, T3, _MM_SHUFFLE(1, 0, 1, 0)); - __m512 S3 = _mm512_shuffle_ps(T1, T3, _MM_SHUFFLE(3, 2, 3, 2)); - - EIGEN_EXTRACT_8f_FROM_16f(S0, S0); - EIGEN_EXTRACT_8f_FROM_16f(S1, S1); - EIGEN_EXTRACT_8f_FROM_16f(S2, S2); - EIGEN_EXTRACT_8f_FROM_16f(S3, S3); - - PacketBlock tmp; - - tmp.packet[0] = _mm256_permute2f128_ps(S0_0, S1_0, 0x20); - tmp.packet[1] = _mm256_permute2f128_ps(S2_0, S3_0, 0x20); - tmp.packet[2] = _mm256_permute2f128_ps(S0_0, S1_0, 0x31); - tmp.packet[3] = _mm256_permute2f128_ps(S2_0, S3_0, 0x31); - - tmp.packet[4] = _mm256_permute2f128_ps(S0_1, S1_1, 0x20); - tmp.packet[5] = _mm256_permute2f128_ps(S2_1, S3_1, 0x20); - tmp.packet[6] = _mm256_permute2f128_ps(S0_1, S1_1, 0x31); - tmp.packet[7] = _mm256_permute2f128_ps(S2_1, S3_1, 0x31); - - PACK_OUTPUT_2(kernel.packet, tmp.packet, 0, 1); - PACK_OUTPUT_2(kernel.packet, tmp.packet, 1, 1); - PACK_OUTPUT_2(kernel.packet, tmp.packet, 2, 1); - PACK_OUTPUT_2(kernel.packet, tmp.packet, 3, 1); -} - -#define PACK_OUTPUT_SQ_D(OUTPUT, INPUT, INDEX, STRIDE) \ - OUTPUT[INDEX] = _mm512_insertf64x4(OUTPUT[INDEX], INPUT[INDEX], 0); \ - OUTPUT[INDEX] = _mm512_insertf64x4(OUTPUT[INDEX], INPUT[INDEX + STRIDE], 1); - -#define PACK_OUTPUT_D(OUTPUT, INPUT, INDEX, STRIDE) \ - OUTPUT[INDEX] = _mm512_insertf64x4(OUTPUT[INDEX], INPUT[(2 * INDEX)], 0); \ - OUTPUT[INDEX] = \ - _mm512_insertf64x4(OUTPUT[INDEX], INPUT[(2 * INDEX) + STRIDE], 1); - -EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock& kernel) { - __m512d T0 = _mm512_shuffle_pd(kernel.packet[0], kernel.packet[1], 0); - __m512d T1 = _mm512_shuffle_pd(kernel.packet[0], kernel.packet[1], 0xff); - __m512d T2 = _mm512_shuffle_pd(kernel.packet[2], kernel.packet[3], 0); - __m512d T3 = _mm512_shuffle_pd(kernel.packet[2], kernel.packet[3], 0xff); - - PacketBlock tmp; - - tmp.packet[0] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 0), - _mm512_extractf64x4_pd(T2, 0), 0x20); - tmp.packet[1] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 0), - _mm512_extractf64x4_pd(T3, 0), 0x20); - tmp.packet[2] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 0), - _mm512_extractf64x4_pd(T2, 0), 0x31); - tmp.packet[3] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 0), - _mm512_extractf64x4_pd(T3, 0), 0x31); - - tmp.packet[4] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 1), - _mm512_extractf64x4_pd(T2, 1), 0x20); - tmp.packet[5] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 1), - _mm512_extractf64x4_pd(T3, 1), 0x20); - tmp.packet[6] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 1), - _mm512_extractf64x4_pd(T2, 1), 0x31); - tmp.packet[7] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 1), - _mm512_extractf64x4_pd(T3, 1), 0x31); - - PACK_OUTPUT_D(kernel.packet, tmp.packet, 0, 1); - PACK_OUTPUT_D(kernel.packet, tmp.packet, 1, 1); - PACK_OUTPUT_D(kernel.packet, tmp.packet, 2, 1); - PACK_OUTPUT_D(kernel.packet, tmp.packet, 3, 1); -} - -EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock& kernel) { - __m512d T0 = _mm512_unpacklo_pd(kernel.packet[0], kernel.packet[1]); - __m512d T1 = _mm512_unpackhi_pd(kernel.packet[0], kernel.packet[1]); - __m512d T2 = _mm512_unpacklo_pd(kernel.packet[2], kernel.packet[3]); - __m512d T3 = _mm512_unpackhi_pd(kernel.packet[2], kernel.packet[3]); - __m512d T4 = _mm512_unpacklo_pd(kernel.packet[4], kernel.packet[5]); - __m512d T5 = _mm512_unpackhi_pd(kernel.packet[4], kernel.packet[5]); - __m512d T6 = _mm512_unpacklo_pd(kernel.packet[6], kernel.packet[7]); - __m512d T7 = _mm512_unpackhi_pd(kernel.packet[6], kernel.packet[7]); - - PacketBlock tmp; - - tmp.packet[0] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 0), - _mm512_extractf64x4_pd(T2, 0), 0x20); - tmp.packet[1] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 0), - _mm512_extractf64x4_pd(T3, 0), 0x20); - tmp.packet[2] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 0), - _mm512_extractf64x4_pd(T2, 0), 0x31); - tmp.packet[3] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 0), - _mm512_extractf64x4_pd(T3, 0), 0x31); - - tmp.packet[4] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 1), - _mm512_extractf64x4_pd(T2, 1), 0x20); - tmp.packet[5] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 1), - _mm512_extractf64x4_pd(T3, 1), 0x20); - tmp.packet[6] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T0, 1), - _mm512_extractf64x4_pd(T2, 1), 0x31); - tmp.packet[7] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T1, 1), - _mm512_extractf64x4_pd(T3, 1), 0x31); - - tmp.packet[8] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T4, 0), - _mm512_extractf64x4_pd(T6, 0), 0x20); - tmp.packet[9] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T5, 0), - _mm512_extractf64x4_pd(T7, 0), 0x20); - tmp.packet[10] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T4, 0), - _mm512_extractf64x4_pd(T6, 0), 0x31); - tmp.packet[11] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T5, 0), - _mm512_extractf64x4_pd(T7, 0), 0x31); - - tmp.packet[12] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T4, 1), - _mm512_extractf64x4_pd(T6, 1), 0x20); - tmp.packet[13] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T5, 1), - _mm512_extractf64x4_pd(T7, 1), 0x20); - tmp.packet[14] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T4, 1), - _mm512_extractf64x4_pd(T6, 1), 0x31); - tmp.packet[15] = _mm256_permute2f128_pd(_mm512_extractf64x4_pd(T5, 1), - _mm512_extractf64x4_pd(T7, 1), 0x31); - - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 0, 8); - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 1, 8); - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 2, 8); - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 3, 8); - - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 4, 8); - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 5, 8); - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 6, 8); - PACK_OUTPUT_SQ_D(kernel.packet, tmp.packet, 7, 8); -} -template <> -EIGEN_STRONG_INLINE Packet16f pblend(const Selector<16>& /*ifPacket*/, - const Packet16f& /*thenPacket*/, - const Packet16f& /*elsePacket*/) { - assert(false && "To be implemented"); - return Packet16f(); -} -template <> -EIGEN_STRONG_INLINE Packet8d pblend(const Selector<8>& /*ifPacket*/, - const Packet8d& /*thenPacket*/, - const Packet8d& /*elsePacket*/) { - assert(false && "To be implemented"); - return Packet8d(); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PACKET_MATH_AVX512_H diff --git a/Eigen/src/Core/arch/AltiVec/Complex.h b/Eigen/src/Core/arch/AltiVec/Complex.h deleted file mode 100644 index 3e665730c..000000000 --- a/Eigen/src/Core/arch/AltiVec/Complex.h +++ /dev/null @@ -1,430 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Gael Guennebaud -// Copyright (C) 2010-2016 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX32_ALTIVEC_H -#define EIGEN_COMPLEX32_ALTIVEC_H - -namespace Eigen { - -namespace internal { - -static Packet4ui p4ui_CONJ_XOR = vec_mergeh((Packet4ui)p4i_ZERO, (Packet4ui)p4f_MZERO);//{ 0x00000000, 0x80000000, 0x00000000, 0x80000000 }; -#ifdef __VSX__ -#if defined(_BIG_ENDIAN) -static Packet2ul p2ul_CONJ_XOR1 = (Packet2ul) vec_sld((Packet4ui) p2d_MZERO, (Packet4ui) p2l_ZERO, 8);//{ 0x8000000000000000, 0x0000000000000000 }; -static Packet2ul p2ul_CONJ_XOR2 = (Packet2ul) vec_sld((Packet4ui) p2l_ZERO, (Packet4ui) p2d_MZERO, 8);//{ 0x8000000000000000, 0x0000000000000000 }; -#else -static Packet2ul p2ul_CONJ_XOR1 = (Packet2ul) vec_sld((Packet4ui) p2l_ZERO, (Packet4ui) p2d_MZERO, 8);//{ 0x8000000000000000, 0x0000000000000000 }; -static Packet2ul p2ul_CONJ_XOR2 = (Packet2ul) vec_sld((Packet4ui) p2d_MZERO, (Packet4ui) p2l_ZERO, 8);//{ 0x8000000000000000, 0x0000000000000000 }; -#endif -#endif - -//---------- float ---------- -struct Packet2cf -{ - EIGEN_STRONG_INLINE explicit Packet2cf() : v(p4f_ZERO) {} - EIGEN_STRONG_INLINE explicit Packet2cf(const Packet4f& a) : v(a) {} - Packet4f v; -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet2cf type; - typedef Packet2cf half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 2, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, -#ifdef __VSX__ - HasBlend = 1, -#endif - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=2, alignment=Aligned16}; typedef Packet2cf half; }; - -template<> EIGEN_STRONG_INLINE Packet2cf pset1(const std::complex& from) -{ - Packet2cf res; - if((std::ptrdiff_t(&from) % 16) == 0) - res.v = pload((const float *)&from); - else - res.v = ploadu((const float *)&from); - res.v = vec_perm(res.v, res.v, p16uc_PSET64_HI); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet2cf pload(const std::complex* from) { return Packet2cf(pload((const float *) from)); } -template<> EIGEN_STRONG_INLINE Packet2cf ploadu(const std::complex* from) { return Packet2cf(ploadu((const float*) from)); } -template<> EIGEN_STRONG_INLINE Packet2cf ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet2cf& from) { pstore((float*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet2cf& from) { pstoreu((float*)to, from.v); } - -template<> EIGEN_DEVICE_FUNC inline Packet2cf pgather, Packet2cf>(const std::complex* from, Index stride) -{ - std::complex EIGEN_ALIGN16 af[2]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - return pload(af); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet2cf>(std::complex* to, const Packet2cf& from, Index stride) -{ - std::complex EIGEN_ALIGN16 af[2]; - pstore >((std::complex *) af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; -} - -template<> EIGEN_STRONG_INLINE Packet2cf padd(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(a.v + b.v); } -template<> EIGEN_STRONG_INLINE Packet2cf psub(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(a.v - b.v); } -template<> EIGEN_STRONG_INLINE Packet2cf pnegate(const Packet2cf& a) { return Packet2cf(pnegate(a.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pconj(const Packet2cf& a) { return Packet2cf(pxor(a.v, reinterpret_cast(p4ui_CONJ_XOR))); } - -template<> EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) -{ - Packet4f v1, v2; - - // Permute and multiply the real parts of a and b - v1 = vec_perm(a.v, a.v, p16uc_PSET32_WODD); - // Get the imaginary parts of a - v2 = vec_perm(a.v, a.v, p16uc_PSET32_WEVEN); - // multiply a_re * b - v1 = vec_madd(v1, b.v, p4f_ZERO); - // multiply a_im * b and get the conjugate result - v2 = vec_madd(v2, b.v, p4f_ZERO); - v2 = reinterpret_cast(pxor(v2, reinterpret_cast(p4ui_CONJ_XOR))); - // permute back to a proper order - v2 = vec_perm(v2, v2, p16uc_COMPLEX32_REV); - - return Packet2cf(padd(v1, v2)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pand (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(pand(a.v, b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf por (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(por(a.v, b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pxor (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(pxor(a.v, b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pandnot(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(pandnot(a.v, b.v)); } - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { EIGEN_PPC_PREFETCH(addr); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet2cf& a) -{ - std::complex EIGEN_ALIGN16 res[2]; - pstore((float *)&res, a.v); - - return res[0]; -} - -template<> EIGEN_STRONG_INLINE Packet2cf preverse(const Packet2cf& a) -{ - Packet4f rev_a; - rev_a = vec_perm(a.v, a.v, p16uc_COMPLEX32_REV2); - return Packet2cf(rev_a); -} - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet2cf& a) -{ - Packet4f b; - b = vec_sld(a.v, a.v, 8); - b = padd(a.v, b); - return pfirst(Packet2cf(b)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf preduxp(const Packet2cf* vecs) -{ - Packet4f b1, b2; -#ifdef _BIG_ENDIAN - b1 = vec_sld(vecs[0].v, vecs[1].v, 8); - b2 = vec_sld(vecs[1].v, vecs[0].v, 8); -#else - b1 = vec_sld(vecs[1].v, vecs[0].v, 8); - b2 = vec_sld(vecs[0].v, vecs[1].v, 8); -#endif - b2 = vec_sld(b2, b2, 8); - b2 = padd(b1, b2); - - return Packet2cf(b2); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet2cf& a) -{ - Packet4f b; - Packet2cf prod; - b = vec_sld(a.v, a.v, 8); - prod = pmul(a, Packet2cf(b)); - - return pfirst(prod); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2cf& first, const Packet2cf& second) - { - if (Offset==1) - { -#ifdef _BIG_ENDIAN - first.v = vec_sld(first.v, second.v, 8); -#else - first.v = vec_sld(second.v, first.v, 8); -#endif - } - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) - -template<> EIGEN_STRONG_INLINE Packet2cf pdiv(const Packet2cf& a, const Packet2cf& b) -{ - // TODO optimize it for AltiVec - Packet2cf res = conj_helper().pmul(a, b); - Packet4f s = pmul(b.v, b.v); - return Packet2cf(pdiv(res.v, padd(s, vec_perm(s, s, p16uc_COMPLEX32_REV)))); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pcplxflip(const Packet2cf& x) -{ - return Packet2cf(vec_perm(x.v, x.v, p16uc_COMPLEX32_REV)); -} - -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel) -{ - Packet4f tmp = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_HI); - kernel.packet[1].v = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_LO); - kernel.packet[0].v = tmp; -} - -#ifdef __VSX__ -template<> EIGEN_STRONG_INLINE Packet2cf pblend(const Selector<2>& ifPacket, const Packet2cf& thenPacket, const Packet2cf& elsePacket) { - Packet2cf result; - result.v = reinterpret_cast(pblend(ifPacket, reinterpret_cast(thenPacket.v), reinterpret_cast(elsePacket.v))); - return result; -} -#endif - -//---------- double ---------- -#ifdef __VSX__ -struct Packet1cd -{ - EIGEN_STRONG_INLINE Packet1cd() {} - EIGEN_STRONG_INLINE explicit Packet1cd(const Packet2d& a) : v(a) {} - Packet2d v; -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet1cd type; - typedef Packet1cd half; - enum { - Vectorizable = 1, - AlignedOnScalar = 0, - size = 1, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=1, alignment=Aligned16}; typedef Packet1cd half; }; - -template<> EIGEN_STRONG_INLINE Packet1cd pload (const std::complex* from) { return Packet1cd(pload((const double*)from)); } -template<> EIGEN_STRONG_INLINE Packet1cd ploadu(const std::complex* from) { return Packet1cd(ploadu((const double*)from)); } -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet1cd& from) { pstore((double*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet1cd& from) { pstoreu((double*)to, from.v); } - -template<> EIGEN_STRONG_INLINE Packet1cd pset1(const std::complex& from) -{ /* here we really have to use unaligned loads :( */ return ploadu(&from); } - -template<> EIGEN_DEVICE_FUNC inline Packet1cd pgather, Packet1cd>(const std::complex* from, Index stride) -{ - std::complex EIGEN_ALIGN16 af[2]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - return pload(af); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet1cd>(std::complex* to, const Packet1cd& from, Index stride) -{ - std::complex EIGEN_ALIGN16 af[2]; - pstore >(af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; -} - -template<> EIGEN_STRONG_INLINE Packet1cd padd(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(a.v + b.v); } -template<> EIGEN_STRONG_INLINE Packet1cd psub(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(a.v - b.v); } -template<> EIGEN_STRONG_INLINE Packet1cd pnegate(const Packet1cd& a) { return Packet1cd(pnegate(Packet2d(a.v))); } -template<> EIGEN_STRONG_INLINE Packet1cd pconj(const Packet1cd& a) { return Packet1cd(pxor(a.v, reinterpret_cast(p2ul_CONJ_XOR2))); } - -template<> EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) -{ - Packet2d a_re, a_im, v1, v2; - - // Permute and multiply the real parts of a and b - a_re = vec_perm(a.v, a.v, p16uc_PSET64_HI); - // Get the imaginary parts of a - a_im = vec_perm(a.v, a.v, p16uc_PSET64_LO); - // multiply a_re * b - v1 = vec_madd(a_re, b.v, p2d_ZERO); - // multiply a_im * b and get the conjugate result - v2 = vec_madd(a_im, b.v, p2d_ZERO); - v2 = reinterpret_cast(vec_sld(reinterpret_cast(v2), reinterpret_cast(v2), 8)); - v2 = pxor(v2, reinterpret_cast(p2ul_CONJ_XOR1)); - - return Packet1cd(padd(v1, v2)); -} - -template<> EIGEN_STRONG_INLINE Packet1cd pand (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(pand(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd por (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(por(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pxor (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(pxor(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pandnot(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(pandnot(a.v, b.v)); } - -template<> EIGEN_STRONG_INLINE Packet1cd ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { EIGEN_PPC_PREFETCH(addr); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet1cd& a) -{ - std::complex EIGEN_ALIGN16 res[2]; - pstore >(res, a); - - return res[0]; -} - -template<> EIGEN_STRONG_INLINE Packet1cd preverse(const Packet1cd& a) { return a; } - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet1cd& a) { return pfirst(a); } -template<> EIGEN_STRONG_INLINE Packet1cd preduxp(const Packet1cd* vecs) { return vecs[0]; } - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet1cd& a) { return pfirst(a); } - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet1cd& /*first*/, const Packet1cd& /*second*/) - { - // FIXME is it sure we never have to align a Packet1cd? - // Even though a std::complex has 16 bytes, it is not necessarily aligned on a 16 bytes boundary... - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) - -template<> EIGEN_STRONG_INLINE Packet1cd pdiv(const Packet1cd& a, const Packet1cd& b) -{ - // TODO optimize it for AltiVec - Packet1cd res = conj_helper().pmul(a,b); - Packet2d s = pmul(b.v, b.v); - return Packet1cd(pdiv(res.v, padd(s, vec_perm(s, s, p16uc_REVERSE64)))); -} - -EIGEN_STRONG_INLINE Packet1cd pcplxflip/**/(const Packet1cd& x) -{ - return Packet1cd(preverse(Packet2d(x.v))); -} - -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel) -{ - Packet2d tmp = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_HI); - kernel.packet[1].v = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_LO); - kernel.packet[0].v = tmp; -} -#endif // __VSX__ -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX32_ALTIVEC_H diff --git a/Eigen/src/Core/arch/AltiVec/MathFunctions.h b/Eigen/src/Core/arch/AltiVec/MathFunctions.h deleted file mode 100644 index c5e4bede7..000000000 --- a/Eigen/src/Core/arch/AltiVec/MathFunctions.h +++ /dev/null @@ -1,322 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2007 Julien Pommier -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2016 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* The sin, cos, exp, and log functions of this file come from - * Julien Pommier's sse math library: http://gruntthepeon.free.fr/ssemath/ - */ - -#ifndef EIGEN_MATH_FUNCTIONS_ALTIVEC_H -#define EIGEN_MATH_FUNCTIONS_ALTIVEC_H - -namespace Eigen { - -namespace internal { - -static _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); -static _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); -static _EIGEN_DECLARE_CONST_Packet4i(0x7f, 0x7f); -static _EIGEN_DECLARE_CONST_Packet4i(23, 23); - -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(inv_mant_mask, ~0x7f800000); - -/* the smallest non denormalized float number */ -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(min_norm_pos, 0x00800000); -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(minus_inf, 0xff800000); // -1.f/0.f -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(minus_nan, 0xffffffff); - -/* natural logarithm computed for 4 simultaneous float - return NaN for x <= 0 -*/ -static _EIGEN_DECLARE_CONST_Packet4f(cephes_SQRTHF, 0.707106781186547524f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p0, 7.0376836292E-2f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p1, - 1.1514610310E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p2, 1.1676998740E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p3, - 1.2420140846E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p4, + 1.4249322787E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p5, - 1.6668057665E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p6, + 2.0000714765E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p7, - 2.4999993993E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p8, + 3.3333331174E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q1, -2.12194440e-4f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q2, 0.693359375f); - -static _EIGEN_DECLARE_CONST_Packet4f(exp_hi, 88.3762626647950f); -static _EIGEN_DECLARE_CONST_Packet4f(exp_lo, -88.3762626647949f); - -static _EIGEN_DECLARE_CONST_Packet4f(cephes_LOG2EF, 1.44269504088896341f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C1, 0.693359375f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C2, -2.12194440e-4f); - -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p0, 1.9875691500E-4f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p1, 1.3981999507E-3f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p2, 8.3334519073E-3f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p3, 4.1665795894E-2f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p4, 1.6666665459E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p5, 5.0000001201E-1f); - -#ifdef __VSX__ -static _EIGEN_DECLARE_CONST_Packet2d(1 , 1.0); -static _EIGEN_DECLARE_CONST_Packet2d(2 , 2.0); -static _EIGEN_DECLARE_CONST_Packet2d(half, 0.5); - -static _EIGEN_DECLARE_CONST_Packet2d(exp_hi, 709.437); -static _EIGEN_DECLARE_CONST_Packet2d(exp_lo, -709.436139303); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_LOG2EF, 1.4426950408889634073599); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p0, 1.26177193074810590878e-4); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p1, 3.02994407707441961300e-2); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p2, 9.99999999999999999910e-1); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q0, 3.00198505138664455042e-6); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q1, 2.52448340349684104192e-3); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q2, 2.27265548208155028766e-1); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q3, 2.00000000000000000009e0); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_C1, 0.693145751953125); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_C2, 1.42860682030941723212e-6); - -#ifdef __POWER8_VECTOR__ -static Packet2l p2l_1023 = { 1023, 1023 }; -static Packet2ul p2ul_52 = { 52, 52 }; -#endif - -#endif - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f plog(const Packet4f& _x) -{ - Packet4f x = _x; - - Packet4i emm0; - - /* isvalid_mask is 0 if x < 0 or x is NaN. */ - Packet4ui isvalid_mask = reinterpret_cast(vec_cmpge(x, p4f_ZERO)); - Packet4ui iszero_mask = reinterpret_cast(vec_cmpeq(x, p4f_ZERO)); - - x = pmax(x, p4f_min_norm_pos); /* cut off denormalized stuff */ - emm0 = vec_sr(reinterpret_cast(x), - reinterpret_cast(p4i_23)); - - /* keep only the fractional part */ - x = pand(x, p4f_inv_mant_mask); - x = por(x, p4f_half); - - emm0 = psub(emm0, p4i_0x7f); - Packet4f e = padd(vec_ctf(emm0, 0), p4f_1); - - /* part2: - if( x < SQRTHF ) { - e -= 1; - x = x + x - 1.0; - } else { x = x - 1.0; } - */ - Packet4f mask = reinterpret_cast(vec_cmplt(x, p4f_cephes_SQRTHF)); - Packet4f tmp = pand(x, mask); - x = psub(x, p4f_1); - e = psub(e, pand(p4f_1, mask)); - x = padd(x, tmp); - - Packet4f x2 = pmul(x,x); - Packet4f x3 = pmul(x2,x); - - Packet4f y, y1, y2; - y = pmadd(p4f_cephes_log_p0, x, p4f_cephes_log_p1); - y1 = pmadd(p4f_cephes_log_p3, x, p4f_cephes_log_p4); - y2 = pmadd(p4f_cephes_log_p6, x, p4f_cephes_log_p7); - y = pmadd(y , x, p4f_cephes_log_p2); - y1 = pmadd(y1, x, p4f_cephes_log_p5); - y2 = pmadd(y2, x, p4f_cephes_log_p8); - y = pmadd(y, x3, y1); - y = pmadd(y, x3, y2); - y = pmul(y, x3); - - y1 = pmul(e, p4f_cephes_log_q1); - tmp = pmul(x2, p4f_half); - y = padd(y, y1); - x = psub(x, tmp); - y2 = pmul(e, p4f_cephes_log_q2); - x = padd(x, y); - x = padd(x, y2); - // negative arg will be NAN, 0 will be -INF - x = vec_sel(x, p4f_minus_inf, iszero_mask); - x = vec_sel(p4f_minus_nan, x, isvalid_mask); - return x; -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f pexp(const Packet4f& _x) -{ - Packet4f x = _x; - - Packet4f tmp, fx; - Packet4i emm0; - - // clamp x - x = pmax(pmin(x, p4f_exp_hi), p4f_exp_lo); - - // express exp(x) as exp(g + n*log(2)) - fx = pmadd(x, p4f_cephes_LOG2EF, p4f_half); - - fx = pfloor(fx); - - tmp = pmul(fx, p4f_cephes_exp_C1); - Packet4f z = pmul(fx, p4f_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - z = pmul(x,x); - - Packet4f y = p4f_cephes_exp_p0; - y = pmadd(y, x, p4f_cephes_exp_p1); - y = pmadd(y, x, p4f_cephes_exp_p2); - y = pmadd(y, x, p4f_cephes_exp_p3); - y = pmadd(y, x, p4f_cephes_exp_p4); - y = pmadd(y, x, p4f_cephes_exp_p5); - y = pmadd(y, z, x); - y = padd(y, p4f_1); - - // build 2^n - emm0 = vec_cts(fx, 0); - emm0 = vec_add(emm0, p4i_0x7f); - emm0 = vec_sl(emm0, reinterpret_cast(p4i_23)); - - // Altivec's max & min operators just drop silent NaNs. Check NaNs in - // inputs and return them unmodified. - Packet4ui isnumber_mask = reinterpret_cast(vec_cmpeq(_x, _x)); - return vec_sel(_x, pmax(pmul(y, reinterpret_cast(emm0)), _x), - isnumber_mask); -} - -#ifndef EIGEN_COMP_CLANG -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f prsqrt(const Packet4f& x) -{ - return vec_rsqrt(x); -} -#endif - -#ifdef __VSX__ -#ifndef EIGEN_COMP_CLANG -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d prsqrt(const Packet2d& x) -{ - return vec_rsqrt(x); -} -#endif - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f psqrt(const Packet4f& x) -{ - return vec_sqrt(x); -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d psqrt(const Packet2d& x) -{ - return vec_sqrt(x); -} - -// VSX support varies between different compilers and even different -// versions of the same compiler. For gcc version >= 4.9.3, we can use -// vec_cts to efficiently convert Packet2d to Packet2l. Otherwise, use -// a slow version that works with older compilers. -// Update: apparently vec_cts/vec_ctf intrinsics for 64-bit doubles -// are buggy, https://gcc.gnu.org/bugzilla/show_bug.cgi?id=70963 -static inline Packet2l ConvertToPacket2l(const Packet2d& x) { -#if EIGEN_GNUC_AT_LEAST(5, 4) || \ - (EIGEN_GNUC_AT(6, 1) && __GNUC_PATCHLEVEL__ >= 1) - return vec_cts(x, 0); // TODO: check clang version. -#else - double tmp[2]; - memcpy(tmp, &x, sizeof(tmp)); - Packet2l l = { static_cast(tmp[0]), - static_cast(tmp[1]) }; - return l; -#endif -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d pexp(const Packet2d& _x) -{ - Packet2d x = _x; - - Packet2d tmp, fx; - Packet2l emm0; - - // clamp x - x = pmax(pmin(x, p2d_exp_hi), p2d_exp_lo); - - /* express exp(x) as exp(g + n*log(2)) */ - fx = pmadd(x, p2d_cephes_LOG2EF, p2d_half); - - fx = pfloor(fx); - - tmp = pmul(fx, p2d_cephes_exp_C1); - Packet2d z = pmul(fx, p2d_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - Packet2d x2 = pmul(x,x); - - Packet2d px = p2d_cephes_exp_p0; - px = pmadd(px, x2, p2d_cephes_exp_p1); - px = pmadd(px, x2, p2d_cephes_exp_p2); - px = pmul (px, x); - - Packet2d qx = p2d_cephes_exp_q0; - qx = pmadd(qx, x2, p2d_cephes_exp_q1); - qx = pmadd(qx, x2, p2d_cephes_exp_q2); - qx = pmadd(qx, x2, p2d_cephes_exp_q3); - - x = pdiv(px,psub(qx,px)); - x = pmadd(p2d_2,x,p2d_1); - - // build 2^n - emm0 = ConvertToPacket2l(fx); - -#ifdef __POWER8_VECTOR__ - emm0 = vec_add(emm0, p2l_1023); - emm0 = vec_sl(emm0, p2ul_52); -#else - // Code is a bit complex for POWER7. There is actually a - // vec_xxsldi intrinsic but it is not supported by some gcc versions. - // So we shift (52-32) bits and do a word swap with zeros. - _EIGEN_DECLARE_CONST_Packet4i(1023, 1023); - _EIGEN_DECLARE_CONST_Packet4i(20, 20); // 52 - 32 - - Packet4i emm04i = reinterpret_cast(emm0); - emm04i = vec_add(emm04i, p4i_1023); - emm04i = vec_sl(emm04i, reinterpret_cast(p4i_20)); - static const Packet16uc perm = { - 0x14, 0x15, 0x16, 0x17, 0x00, 0x01, 0x02, 0x03, - 0x1c, 0x1d, 0x1e, 0x1f, 0x08, 0x09, 0x0a, 0x0b }; -#ifdef _BIG_ENDIAN - emm0 = reinterpret_cast(vec_perm(p4i_ZERO, emm04i, perm)); -#else - emm0 = reinterpret_cast(vec_perm(emm04i, p4i_ZERO, perm)); -#endif - -#endif - - // Altivec's max & min operators just drop silent NaNs. Check NaNs in - // inputs and return them unmodified. - Packet2ul isnumber_mask = reinterpret_cast(vec_cmpeq(_x, _x)); - return vec_sel(_x, pmax(pmul(x, reinterpret_cast(emm0)), _x), - isnumber_mask); -} -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_MATH_FUNCTIONS_ALTIVEC_H diff --git a/Eigen/src/Core/arch/AltiVec/PacketMath.h b/Eigen/src/Core/arch/AltiVec/PacketMath.h deleted file mode 100755 index b3f1ea199..000000000 --- a/Eigen/src/Core/arch/AltiVec/PacketMath.h +++ /dev/null @@ -1,1033 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2016 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_ALTIVEC_H -#define EIGEN_PACKET_MATH_ALTIVEC_H - -namespace Eigen { - -namespace internal { - -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 4 -#endif - -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#endif - -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD -#endif - -// NOTE Altivec has 32 registers, but Eigen only accepts a value of 8 or 16 -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS 32 -#endif - -typedef __vector float Packet4f; -typedef __vector int Packet4i; -typedef __vector unsigned int Packet4ui; -typedef __vector __bool int Packet4bi; -typedef __vector short int Packet8i; -typedef __vector unsigned char Packet16uc; - -// We don't want to write the same code all the time, but we need to reuse the constants -// and it doesn't really work to declare them global, so we define macros instead - -#define _EIGEN_DECLARE_CONST_FAST_Packet4f(NAME,X) \ - Packet4f p4f_##NAME = reinterpret_cast(vec_splat_s32(X)) - -#define _EIGEN_DECLARE_CONST_FAST_Packet4i(NAME,X) \ - Packet4i p4i_##NAME = vec_splat_s32(X) - -#define _EIGEN_DECLARE_CONST_Packet4f(NAME,X) \ - Packet4f p4f_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet4i(NAME,X) \ - Packet4i p4i_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet2d(NAME,X) \ - Packet2d p2d_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet2l(NAME,X) \ - Packet2l p2l_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(NAME,X) \ - const Packet4f p4f_##NAME = reinterpret_cast(pset1(X)) - -#define DST_CHAN 1 -#define DST_CTRL(size, count, stride) (((size) << 24) | ((count) << 16) | (stride)) - - -// These constants are endian-agnostic -static _EIGEN_DECLARE_CONST_FAST_Packet4f(ZERO, 0); //{ 0.0, 0.0, 0.0, 0.0} -static _EIGEN_DECLARE_CONST_FAST_Packet4i(ZERO, 0); //{ 0, 0, 0, 0,} -static _EIGEN_DECLARE_CONST_FAST_Packet4i(ONE,1); //{ 1, 1, 1, 1} -static _EIGEN_DECLARE_CONST_FAST_Packet4i(MINUS16,-16); //{ -16, -16, -16, -16} -static _EIGEN_DECLARE_CONST_FAST_Packet4i(MINUS1,-1); //{ -1, -1, -1, -1} -static Packet4f p4f_MZERO = (Packet4f) vec_sl((Packet4ui)p4i_MINUS1, (Packet4ui)p4i_MINUS1); //{ 0x80000000, 0x80000000, 0x80000000, 0x80000000} -#ifndef __VSX__ -static Packet4f p4f_ONE = vec_ctf(p4i_ONE, 0); //{ 1.0, 1.0, 1.0, 1.0} -#endif - -static Packet4f p4f_COUNTDOWN = { 0.0, 1.0, 2.0, 3.0 }; -static Packet4i p4i_COUNTDOWN = { 0, 1, 2, 3 }; - -static Packet16uc p16uc_REVERSE32 = { 12,13,14,15, 8,9,10,11, 4,5,6,7, 0,1,2,3 }; -static Packet16uc p16uc_DUPLICATE32_HI = { 0,1,2,3, 0,1,2,3, 4,5,6,7, 4,5,6,7 }; - -// Mask alignment -#ifdef __PPC64__ -#define _EIGEN_MASK_ALIGNMENT 0xfffffffffffffff0 -#else -#define _EIGEN_MASK_ALIGNMENT 0xfffffff0 -#endif - -#define _EIGEN_ALIGNED_PTR(x) ((std::ptrdiff_t)(x) & _EIGEN_MASK_ALIGNMENT) - -// Handle endianness properly while loading constants -// Define global static constants: -#ifdef _BIG_ENDIAN -static Packet16uc p16uc_FORWARD = vec_lvsl(0, (float*)0); -#ifdef __VSX__ -static Packet16uc p16uc_REVERSE64 = { 8,9,10,11, 12,13,14,15, 0,1,2,3, 4,5,6,7 }; -#endif -static Packet16uc p16uc_PSET32_WODD = vec_sld((Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 0), (Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 2), 8);//{ 0,1,2,3, 0,1,2,3, 8,9,10,11, 8,9,10,11 }; -static Packet16uc p16uc_PSET32_WEVEN = vec_sld(p16uc_DUPLICATE32_HI, (Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 3), 8);//{ 4,5,6,7, 4,5,6,7, 12,13,14,15, 12,13,14,15 }; -static Packet16uc p16uc_HALF64_0_16 = vec_sld((Packet16uc)p4i_ZERO, vec_splat((Packet16uc) vec_abs(p4i_MINUS16), 3), 8); //{ 0,0,0,0, 0,0,0,0, 16,16,16,16, 16,16,16,16}; -#else -static Packet16uc p16uc_FORWARD = p16uc_REVERSE32; -static Packet16uc p16uc_REVERSE64 = { 8,9,10,11, 12,13,14,15, 0,1,2,3, 4,5,6,7 }; -static Packet16uc p16uc_PSET32_WODD = vec_sld((Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 1), (Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 3), 8);//{ 0,1,2,3, 0,1,2,3, 8,9,10,11, 8,9,10,11 }; -static Packet16uc p16uc_PSET32_WEVEN = vec_sld((Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 0), (Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 2), 8);//{ 4,5,6,7, 4,5,6,7, 12,13,14,15, 12,13,14,15 }; -static Packet16uc p16uc_HALF64_0_16 = vec_sld(vec_splat((Packet16uc) vec_abs(p4i_MINUS16), 0), (Packet16uc)p4i_ZERO, 8); //{ 0,0,0,0, 0,0,0,0, 16,16,16,16, 16,16,16,16}; -#endif // _BIG_ENDIAN - -static Packet16uc p16uc_PSET64_HI = (Packet16uc) vec_mergeh((Packet4ui)p16uc_PSET32_WODD, (Packet4ui)p16uc_PSET32_WEVEN); //{ 0,1,2,3, 4,5,6,7, 0,1,2,3, 4,5,6,7 }; -static Packet16uc p16uc_PSET64_LO = (Packet16uc) vec_mergel((Packet4ui)p16uc_PSET32_WODD, (Packet4ui)p16uc_PSET32_WEVEN); //{ 8,9,10,11, 12,13,14,15, 8,9,10,11, 12,13,14,15 }; -static Packet16uc p16uc_TRANSPOSE64_HI = p16uc_PSET64_HI + p16uc_HALF64_0_16; //{ 0,1,2,3, 4,5,6,7, 16,17,18,19, 20,21,22,23}; -static Packet16uc p16uc_TRANSPOSE64_LO = p16uc_PSET64_LO + p16uc_HALF64_0_16; //{ 8,9,10,11, 12,13,14,15, 24,25,26,27, 28,29,30,31}; - -static Packet16uc p16uc_COMPLEX32_REV = vec_sld(p16uc_REVERSE32, p16uc_REVERSE32, 8); //{ 4,5,6,7, 0,1,2,3, 12,13,14,15, 8,9,10,11 }; - -#ifdef _BIG_ENDIAN -static Packet16uc p16uc_COMPLEX32_REV2 = vec_sld(p16uc_FORWARD, p16uc_FORWARD, 8); //{ 8,9,10,11, 12,13,14,15, 0,1,2,3, 4,5,6,7 }; -#else -static Packet16uc p16uc_COMPLEX32_REV2 = vec_sld(p16uc_PSET64_HI, p16uc_PSET64_LO, 8); //{ 8,9,10,11, 12,13,14,15, 0,1,2,3, 4,5,6,7 }; -#endif // _BIG_ENDIAN - -#if EIGEN_HAS_BUILTIN(__builtin_prefetch) || EIGEN_COMP_GNUC - #define EIGEN_PPC_PREFETCH(ADDR) __builtin_prefetch(ADDR); -#else - #define EIGEN_PPC_PREFETCH(ADDR) asm( " dcbt [%[addr]]\n" :: [addr] "r" (ADDR) : "cc" ); -#endif - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4f type; - typedef Packet4f half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - HasHalfPacket = 1, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasMin = 1, - HasMax = 1, - HasAbs = 1, - HasSin = 0, - HasCos = 0, - HasLog = 0, - HasExp = 1, -#ifdef __VSX__ - HasSqrt = 1, -#if !EIGEN_COMP_CLANG - HasRsqrt = 1, -#else - HasRsqrt = 0, -#endif -#else - HasSqrt = 0, - HasRsqrt = 0, -#endif - HasRound = 1, - HasFloor = 1, - HasCeil = 1, - HasNegate = 1, - HasBlend = 1 - }; -}; -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4i type; - typedef Packet4i half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 4, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 0, - HasBlend = 1 - }; -}; - - -template<> struct unpacket_traits { typedef float type; enum {size=4, alignment=Aligned16}; typedef Packet4f half; }; -template<> struct unpacket_traits { typedef int type; enum {size=4, alignment=Aligned16}; typedef Packet4i half; }; - -inline std::ostream & operator <<(std::ostream & s, const Packet16uc & v) -{ - union { - Packet16uc v; - unsigned char n[16]; - } vt; - vt.v = v; - for (int i=0; i< 16; i++) - s << (int)vt.n[i] << ", "; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet4f & v) -{ - union { - Packet4f v; - float n[4]; - } vt; - vt.v = v; - s << vt.n[0] << ", " << vt.n[1] << ", " << vt.n[2] << ", " << vt.n[3]; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet4i & v) -{ - union { - Packet4i v; - int n[4]; - } vt; - vt.v = v; - s << vt.n[0] << ", " << vt.n[1] << ", " << vt.n[2] << ", " << vt.n[3]; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet4ui & v) -{ - union { - Packet4ui v; - unsigned int n[4]; - } vt; - vt.v = v; - s << vt.n[0] << ", " << vt.n[1] << ", " << vt.n[2] << ", " << vt.n[3]; - return s; -} - -// Need to define them first or we get specialization after instantiation errors -template<> EIGEN_STRONG_INLINE Packet4f pload(const float* from) -{ - EIGEN_DEBUG_ALIGNED_LOAD -#ifdef __VSX__ - return vec_vsx_ld(0, from); -#else - return vec_ld(0, from); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4i pload(const int* from) -{ - EIGEN_DEBUG_ALIGNED_LOAD -#ifdef __VSX__ - return vec_vsx_ld(0, from); -#else - return vec_ld(0, from); -#endif -} - -template<> EIGEN_STRONG_INLINE void pstore(float* to, const Packet4f& from) -{ - EIGEN_DEBUG_ALIGNED_STORE -#ifdef __VSX__ - vec_vsx_st(from, 0, to); -#else - vec_st(from, 0, to); -#endif -} - -template<> EIGEN_STRONG_INLINE void pstore(int* to, const Packet4i& from) -{ - EIGEN_DEBUG_ALIGNED_STORE -#ifdef __VSX__ - vec_vsx_st(from, 0, to); -#else - vec_st(from, 0, to); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4f pset1(const float& from) { - Packet4f v = {from, from, from, from}; - return v; -} - -template<> EIGEN_STRONG_INLINE Packet4i pset1(const int& from) { - Packet4i v = {from, from, from, from}; - return v; -} -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const float *a, - Packet4f& a0, Packet4f& a1, Packet4f& a2, Packet4f& a3) -{ - a3 = pload(a); - a0 = vec_splat(a3, 0); - a1 = vec_splat(a3, 1); - a2 = vec_splat(a3, 2); - a3 = vec_splat(a3, 3); -} -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const int *a, - Packet4i& a0, Packet4i& a1, Packet4i& a2, Packet4i& a3) -{ - a3 = pload(a); - a0 = vec_splat(a3, 0); - a1 = vec_splat(a3, 1); - a2 = vec_splat(a3, 2); - a3 = vec_splat(a3, 3); -} - -template<> EIGEN_DEVICE_FUNC inline Packet4f pgather(const float* from, Index stride) -{ - float EIGEN_ALIGN16 af[4]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - af[2] = from[2*stride]; - af[3] = from[3*stride]; - return pload(af); -} -template<> EIGEN_DEVICE_FUNC inline Packet4i pgather(const int* from, Index stride) -{ - int EIGEN_ALIGN16 ai[4]; - ai[0] = from[0*stride]; - ai[1] = from[1*stride]; - ai[2] = from[2*stride]; - ai[3] = from[3*stride]; - return pload(ai); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const Packet4f& from, Index stride) -{ - float EIGEN_ALIGN16 af[4]; - pstore(af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; - to[2*stride] = af[2]; - to[3*stride] = af[3]; -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(int* to, const Packet4i& from, Index stride) -{ - int EIGEN_ALIGN16 ai[4]; - pstore((int *)ai, from); - to[0*stride] = ai[0]; - to[1*stride] = ai[1]; - to[2*stride] = ai[2]; - to[3*stride] = ai[3]; -} - -template<> EIGEN_STRONG_INLINE Packet4f plset(const float& a) { return pset1(a) + p4f_COUNTDOWN; } -template<> EIGEN_STRONG_INLINE Packet4i plset(const int& a) { return pset1(a) + p4i_COUNTDOWN; } - -template<> EIGEN_STRONG_INLINE Packet4f padd(const Packet4f& a, const Packet4f& b) { return a + b; } -template<> EIGEN_STRONG_INLINE Packet4i padd(const Packet4i& a, const Packet4i& b) { return a + b; } - -template<> EIGEN_STRONG_INLINE Packet4f psub(const Packet4f& a, const Packet4f& b) { return a - b; } -template<> EIGEN_STRONG_INLINE Packet4i psub(const Packet4i& a, const Packet4i& b) { return a - b; } - -template<> EIGEN_STRONG_INLINE Packet4f pnegate(const Packet4f& a) { return p4f_ZERO - a; } -template<> EIGEN_STRONG_INLINE Packet4i pnegate(const Packet4i& a) { return p4i_ZERO - a; } - -template<> EIGEN_STRONG_INLINE Packet4f pconj(const Packet4f& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet4i pconj(const Packet4i& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet4f pmul(const Packet4f& a, const Packet4f& b) { return vec_madd(a,b, p4f_MZERO); } -template<> EIGEN_STRONG_INLINE Packet4i pmul(const Packet4i& a, const Packet4i& b) { return a * b; } - -template<> EIGEN_STRONG_INLINE Packet4f pdiv(const Packet4f& a, const Packet4f& b) -{ -#ifndef __VSX__ // VSX actually provides a div instruction - Packet4f t, y_0, y_1; - - // Altivec does not offer a divide instruction, we have to do a reciprocal approximation - y_0 = vec_re(b); - - // Do one Newton-Raphson iteration to get the needed accuracy - t = vec_nmsub(y_0, b, p4f_ONE); - y_1 = vec_madd(y_0, t, y_0); - - return vec_madd(a, y_1, p4f_MZERO); -#else - return vec_div(a, b); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4i pdiv(const Packet4i& /*a*/, const Packet4i& /*b*/) -{ eigen_assert(false && "packet integer division are not supported by AltiVec"); - return pset1(0); -} - -// for some weird raisons, it has to be overloaded for packet of integers -template<> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) { return vec_madd(a,b,c); } -template<> EIGEN_STRONG_INLINE Packet4i pmadd(const Packet4i& a, const Packet4i& b, const Packet4i& c) { return a*b + c; } - -template<> EIGEN_STRONG_INLINE Packet4f pmin(const Packet4f& a, const Packet4f& b) { return vec_min(a, b); } -template<> EIGEN_STRONG_INLINE Packet4i pmin(const Packet4i& a, const Packet4i& b) { return vec_min(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4f pmax(const Packet4f& a, const Packet4f& b) { return vec_max(a, b); } -template<> EIGEN_STRONG_INLINE Packet4i pmax(const Packet4i& a, const Packet4i& b) { return vec_max(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4f pand(const Packet4f& a, const Packet4f& b) { return vec_and(a, b); } -template<> EIGEN_STRONG_INLINE Packet4i pand(const Packet4i& a, const Packet4i& b) { return vec_and(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4f por(const Packet4f& a, const Packet4f& b) { return vec_or(a, b); } -template<> EIGEN_STRONG_INLINE Packet4i por(const Packet4i& a, const Packet4i& b) { return vec_or(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4f pxor(const Packet4f& a, const Packet4f& b) { return vec_xor(a, b); } -template<> EIGEN_STRONG_INLINE Packet4i pxor(const Packet4i& a, const Packet4i& b) { return vec_xor(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4f pandnot(const Packet4f& a, const Packet4f& b) { return vec_and(a, vec_nor(b, b)); } -template<> EIGEN_STRONG_INLINE Packet4i pandnot(const Packet4i& a, const Packet4i& b) { return vec_and(a, vec_nor(b, b)); } - -template<> EIGEN_STRONG_INLINE Packet4f pround(const Packet4f& a) { return vec_round(a); } -template<> EIGEN_STRONG_INLINE Packet4f pceil(const Packet4f& a) { return vec_ceil(a); } -template<> EIGEN_STRONG_INLINE Packet4f pfloor(const Packet4f& a) { return vec_floor(a); } - -#ifdef _BIG_ENDIAN -template<> EIGEN_STRONG_INLINE Packet4f ploadu(const float* from) -{ - EIGEN_DEBUG_ALIGNED_LOAD - Packet16uc MSQ, LSQ; - Packet16uc mask; - MSQ = vec_ld(0, (unsigned char *)from); // most significant quadword - LSQ = vec_ld(15, (unsigned char *)from); // least significant quadword - mask = vec_lvsl(0, from); // create the permute mask - return (Packet4f) vec_perm(MSQ, LSQ, mask); // align the data - -} -template<> EIGEN_STRONG_INLINE Packet4i ploadu(const int* from) -{ - EIGEN_DEBUG_ALIGNED_LOAD - // Taken from http://developer.apple.com/hardwaredrivers/ve/alignment.html - Packet16uc MSQ, LSQ; - Packet16uc mask; - MSQ = vec_ld(0, (unsigned char *)from); // most significant quadword - LSQ = vec_ld(15, (unsigned char *)from); // least significant quadword - mask = vec_lvsl(0, from); // create the permute mask - return (Packet4i) vec_perm(MSQ, LSQ, mask); // align the data -} -#else -// We also need ot redefine little endian loading of Packet4i/Packet4f using VSX -template<> EIGEN_STRONG_INLINE Packet4i ploadu(const int* from) -{ - EIGEN_DEBUG_UNALIGNED_LOAD - return (Packet4i) vec_vsx_ld((long)from & 15, (const int*) _EIGEN_ALIGNED_PTR(from)); -} -template<> EIGEN_STRONG_INLINE Packet4f ploadu(const float* from) -{ - EIGEN_DEBUG_UNALIGNED_LOAD - return (Packet4f) vec_vsx_ld((long)from & 15, (const float*) _EIGEN_ALIGNED_PTR(from)); -} -#endif - -template<> EIGEN_STRONG_INLINE Packet4f ploaddup(const float* from) -{ - Packet4f p; - if((std::ptrdiff_t(from) % 16) == 0) p = pload(from); - else p = ploadu(from); - return vec_perm(p, p, p16uc_DUPLICATE32_HI); -} -template<> EIGEN_STRONG_INLINE Packet4i ploaddup(const int* from) -{ - Packet4i p; - if((std::ptrdiff_t(from) % 16) == 0) p = pload(from); - else p = ploadu(from); - return vec_perm(p, p, p16uc_DUPLICATE32_HI); -} - -#ifdef _BIG_ENDIAN -template<> EIGEN_STRONG_INLINE void pstoreu(float* to, const Packet4f& from) -{ - EIGEN_DEBUG_UNALIGNED_STORE - // Taken from http://developer.apple.com/hardwaredrivers/ve/alignment.html - // Warning: not thread safe! - Packet16uc MSQ, LSQ, edges; - Packet16uc edgeAlign, align; - - MSQ = vec_ld(0, (unsigned char *)to); // most significant quadword - LSQ = vec_ld(15, (unsigned char *)to); // least significant quadword - edgeAlign = vec_lvsl(0, to); // permute map to extract edges - edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges - align = vec_lvsr( 0, to ); // permute map to misalign data - MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ) - LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ) - vec_st( LSQ, 15, (unsigned char *)to ); // Store the LSQ part first - vec_st( MSQ, 0, (unsigned char *)to ); // Store the MSQ part -} -template<> EIGEN_STRONG_INLINE void pstoreu(int* to, const Packet4i& from) -{ - EIGEN_DEBUG_UNALIGNED_STORE - // Taken from http://developer.apple.com/hardwaredrivers/ve/alignment.html - // Warning: not thread safe! - Packet16uc MSQ, LSQ, edges; - Packet16uc edgeAlign, align; - - MSQ = vec_ld(0, (unsigned char *)to); // most significant quadword - LSQ = vec_ld(15, (unsigned char *)to); // least significant quadword - edgeAlign = vec_lvsl(0, to); // permute map to extract edges - edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges - align = vec_lvsr( 0, to ); // permute map to misalign data - MSQ = vec_perm(edges, (Packet16uc) from, align); // misalign the data (MSQ) - LSQ = vec_perm((Packet16uc) from, edges, align); // misalign the data (LSQ) - vec_st( LSQ, 15, (unsigned char *)to ); // Store the LSQ part first - vec_st( MSQ, 0, (unsigned char *)to ); // Store the MSQ part -} -#else -// We also need ot redefine little endian loading of Packet4i/Packet4f using VSX -template<> EIGEN_STRONG_INLINE void pstoreu(int* to, const Packet4i& from) -{ - EIGEN_DEBUG_ALIGNED_STORE - vec_vsx_st(from, (long)to & 15, (int*) _EIGEN_ALIGNED_PTR(to)); -} -template<> EIGEN_STRONG_INLINE void pstoreu(float* to, const Packet4f& from) -{ - EIGEN_DEBUG_ALIGNED_STORE - vec_vsx_st(from, (long)to & 15, (float*) _EIGEN_ALIGNED_PTR(to)); -} -#endif - -template<> EIGEN_STRONG_INLINE void prefetch(const float* addr) { EIGEN_PPC_PREFETCH(addr); } -template<> EIGEN_STRONG_INLINE void prefetch(const int* addr) { EIGEN_PPC_PREFETCH(addr); } - -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { float EIGEN_ALIGN16 x; vec_ste(a, 0, &x); return x; } -template<> EIGEN_STRONG_INLINE int pfirst(const Packet4i& a) { int EIGEN_ALIGN16 x; vec_ste(a, 0, &x); return x; } - -template<> EIGEN_STRONG_INLINE Packet4f preverse(const Packet4f& a) -{ - return reinterpret_cast(vec_perm(reinterpret_cast(a), reinterpret_cast(a), p16uc_REVERSE32)); -} -template<> EIGEN_STRONG_INLINE Packet4i preverse(const Packet4i& a) -{ - return reinterpret_cast(vec_perm(reinterpret_cast(a), reinterpret_cast(a), p16uc_REVERSE32)); } - -template<> EIGEN_STRONG_INLINE Packet4f pabs(const Packet4f& a) { return vec_abs(a); } -template<> EIGEN_STRONG_INLINE Packet4i pabs(const Packet4i& a) { return vec_abs(a); } - -template<> EIGEN_STRONG_INLINE float predux(const Packet4f& a) -{ - Packet4f b, sum; - b = vec_sld(a, a, 8); - sum = a + b; - b = vec_sld(sum, sum, 4); - sum += b; - return pfirst(sum); -} - -template<> EIGEN_STRONG_INLINE Packet4f preduxp(const Packet4f* vecs) -{ - Packet4f v[4], sum[4]; - - // It's easier and faster to transpose then add as columns - // Check: http://www.freevec.org/function/matrix_4x4_transpose_floats for explanation - // Do the transpose, first set of moves - v[0] = vec_mergeh(vecs[0], vecs[2]); - v[1] = vec_mergel(vecs[0], vecs[2]); - v[2] = vec_mergeh(vecs[1], vecs[3]); - v[3] = vec_mergel(vecs[1], vecs[3]); - // Get the resulting vectors - sum[0] = vec_mergeh(v[0], v[2]); - sum[1] = vec_mergel(v[0], v[2]); - sum[2] = vec_mergeh(v[1], v[3]); - sum[3] = vec_mergel(v[1], v[3]); - - // Now do the summation: - // Lines 0+1 - sum[0] = sum[0] + sum[1]; - // Lines 2+3 - sum[1] = sum[2] + sum[3]; - // Add the results - sum[0] = sum[0] + sum[1]; - - return sum[0]; -} - -template<> EIGEN_STRONG_INLINE int predux(const Packet4i& a) -{ - Packet4i sum; - sum = vec_sums(a, p4i_ZERO); -#ifdef _BIG_ENDIAN - sum = vec_sld(sum, p4i_ZERO, 12); -#else - sum = vec_sld(p4i_ZERO, sum, 4); -#endif - return pfirst(sum); -} - -template<> EIGEN_STRONG_INLINE Packet4i preduxp(const Packet4i* vecs) -{ - Packet4i v[4], sum[4]; - - // It's easier and faster to transpose then add as columns - // Check: http://www.freevec.org/function/matrix_4x4_transpose_floats for explanation - // Do the transpose, first set of moves - v[0] = vec_mergeh(vecs[0], vecs[2]); - v[1] = vec_mergel(vecs[0], vecs[2]); - v[2] = vec_mergeh(vecs[1], vecs[3]); - v[3] = vec_mergel(vecs[1], vecs[3]); - // Get the resulting vectors - sum[0] = vec_mergeh(v[0], v[2]); - sum[1] = vec_mergel(v[0], v[2]); - sum[2] = vec_mergeh(v[1], v[3]); - sum[3] = vec_mergel(v[1], v[3]); - - // Now do the summation: - // Lines 0+1 - sum[0] = sum[0] + sum[1]; - // Lines 2+3 - sum[1] = sum[2] + sum[3]; - // Add the results - sum[0] = sum[0] + sum[1]; - - return sum[0]; -} - -// Other reduction functions: -// mul -template<> EIGEN_STRONG_INLINE float predux_mul(const Packet4f& a) -{ - Packet4f prod; - prod = pmul(a, vec_sld(a, a, 8)); - return pfirst(pmul(prod, vec_sld(prod, prod, 4))); -} - -template<> EIGEN_STRONG_INLINE int predux_mul(const Packet4i& a) -{ - EIGEN_ALIGN16 int aux[4]; - pstore(aux, a); - return aux[0] * aux[1] * aux[2] * aux[3]; -} - -// min -template<> EIGEN_STRONG_INLINE float predux_min(const Packet4f& a) -{ - Packet4f b, res; - b = vec_min(a, vec_sld(a, a, 8)); - res = vec_min(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -template<> EIGEN_STRONG_INLINE int predux_min(const Packet4i& a) -{ - Packet4i b, res; - b = vec_min(a, vec_sld(a, a, 8)); - res = vec_min(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -// max -template<> EIGEN_STRONG_INLINE float predux_max(const Packet4f& a) -{ - Packet4f b, res; - b = vec_max(a, vec_sld(a, a, 8)); - res = vec_max(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -template<> EIGEN_STRONG_INLINE int predux_max(const Packet4i& a) -{ - Packet4i b, res; - b = vec_max(a, vec_sld(a, a, 8)); - res = vec_max(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4f& first, const Packet4f& second) - { -#ifdef _BIG_ENDIAN - switch (Offset % 4) { - case 1: - first = vec_sld(first, second, 4); break; - case 2: - first = vec_sld(first, second, 8); break; - case 3: - first = vec_sld(first, second, 12); break; - } -#else - switch (Offset % 4) { - case 1: - first = vec_sld(second, first, 12); break; - case 2: - first = vec_sld(second, first, 8); break; - case 3: - first = vec_sld(second, first, 4); break; - } -#endif - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4i& first, const Packet4i& second) - { -#ifdef _BIG_ENDIAN - switch (Offset % 4) { - case 1: - first = vec_sld(first, second, 4); break; - case 2: - first = vec_sld(first, second, 8); break; - case 3: - first = vec_sld(first, second, 12); break; - } -#else - switch (Offset % 4) { - case 1: - first = vec_sld(second, first, 12); break; - case 2: - first = vec_sld(second, first, 8); break; - case 3: - first = vec_sld(second, first, 4); break; - } -#endif - } -}; - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet4f t0, t1, t2, t3; - t0 = vec_mergeh(kernel.packet[0], kernel.packet[2]); - t1 = vec_mergel(kernel.packet[0], kernel.packet[2]); - t2 = vec_mergeh(kernel.packet[1], kernel.packet[3]); - t3 = vec_mergel(kernel.packet[1], kernel.packet[3]); - kernel.packet[0] = vec_mergeh(t0, t2); - kernel.packet[1] = vec_mergel(t0, t2); - kernel.packet[2] = vec_mergeh(t1, t3); - kernel.packet[3] = vec_mergel(t1, t3); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet4i t0, t1, t2, t3; - t0 = vec_mergeh(kernel.packet[0], kernel.packet[2]); - t1 = vec_mergel(kernel.packet[0], kernel.packet[2]); - t2 = vec_mergeh(kernel.packet[1], kernel.packet[3]); - t3 = vec_mergel(kernel.packet[1], kernel.packet[3]); - kernel.packet[0] = vec_mergeh(t0, t2); - kernel.packet[1] = vec_mergel(t0, t2); - kernel.packet[2] = vec_mergeh(t1, t3); - kernel.packet[3] = vec_mergel(t1, t3); -} - -template<> EIGEN_STRONG_INLINE Packet4i pblend(const Selector<4>& ifPacket, const Packet4i& thenPacket, const Packet4i& elsePacket) { - Packet4ui select = { ifPacket.select[0], ifPacket.select[1], ifPacket.select[2], ifPacket.select[3] }; - Packet4ui mask = reinterpret_cast(vec_cmpeq(reinterpret_cast(select), reinterpret_cast(p4i_ONE))); - return vec_sel(elsePacket, thenPacket, mask); -} - -template<> EIGEN_STRONG_INLINE Packet4f pblend(const Selector<4>& ifPacket, const Packet4f& thenPacket, const Packet4f& elsePacket) { - Packet4ui select = { ifPacket.select[0], ifPacket.select[1], ifPacket.select[2], ifPacket.select[3] }; - Packet4ui mask = reinterpret_cast(vec_cmpeq(reinterpret_cast(select), reinterpret_cast(p4i_ONE))); - return vec_sel(elsePacket, thenPacket, mask); -} - - -//---------- double ---------- -#ifdef __VSX__ -typedef __vector double Packet2d; -typedef __vector unsigned long long Packet2ul; -typedef __vector long long Packet2l; -#if EIGEN_COMP_CLANG -typedef Packet2ul Packet2bl; -#else -typedef __vector __bool long Packet2bl; -#endif - -static Packet2l p2l_ONE = { 1, 1 }; -static Packet2l p2l_ZERO = reinterpret_cast(p4i_ZERO); -static Packet2d p2d_ONE = { 1.0, 1.0 }; -static Packet2d p2d_ZERO = reinterpret_cast(p4f_ZERO); -static Packet2d p2d_MZERO = { -0.0, -0.0 }; - -#ifdef _BIG_ENDIAN -static Packet2d p2d_COUNTDOWN = reinterpret_cast(vec_sld(reinterpret_cast(p2d_ZERO), reinterpret_cast(p2d_ONE), 8)); -#else -static Packet2d p2d_COUNTDOWN = reinterpret_cast(vec_sld(reinterpret_cast(p2d_ONE), reinterpret_cast(p2d_ZERO), 8)); -#endif - -template Packet2d vec_splat_dbl(Packet2d& a); - -template<> EIGEN_STRONG_INLINE Packet2d vec_splat_dbl<0>(Packet2d& a) -{ - return reinterpret_cast(vec_perm(a, a, p16uc_PSET64_HI)); -} - -template<> EIGEN_STRONG_INLINE Packet2d vec_splat_dbl<1>(Packet2d& a) -{ - return reinterpret_cast(vec_perm(a, a, p16uc_PSET64_LO)); -} - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet2d type; - typedef Packet2d half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=2, - HasHalfPacket = 1, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasMin = 1, - HasMax = 1, - HasAbs = 1, - HasSin = 0, - HasCos = 0, - HasLog = 0, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasRound = 1, - HasFloor = 1, - HasCeil = 1, - HasNegate = 1, - HasBlend = 1 - }; -}; - -template<> struct unpacket_traits { typedef double type; enum {size=2, alignment=Aligned16}; typedef Packet2d half; }; - -inline std::ostream & operator <<(std::ostream & s, const Packet2l & v) -{ - union { - Packet2l v; - int64_t n[2]; - } vt; - vt.v = v; - s << vt.n[0] << ", " << vt.n[1]; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet2d & v) -{ - union { - Packet2d v; - double n[2]; - } vt; - vt.v = v; - s << vt.n[0] << ", " << vt.n[1]; - return s; -} - -// Need to define them first or we get specialization after instantiation errors -template<> EIGEN_STRONG_INLINE Packet2d pload(const double* from) -{ - EIGEN_DEBUG_ALIGNED_LOAD -#ifdef __VSX__ - return vec_vsx_ld(0, from); -#else - return vec_ld(0, from); -#endif -} - -template<> EIGEN_STRONG_INLINE void pstore(double* to, const Packet2d& from) -{ - EIGEN_DEBUG_ALIGNED_STORE -#ifdef __VSX__ - vec_vsx_st(from, 0, to); -#else - vec_st(from, 0, to); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet2d pset1(const double& from) { - Packet2d v = {from, from}; - return v; -} - -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const double *a, - Packet2d& a0, Packet2d& a1, Packet2d& a2, Packet2d& a3) -{ - a1 = pload(a); - a0 = vec_splat_dbl<0>(a1); - a1 = vec_splat_dbl<1>(a1); - a3 = pload(a+2); - a2 = vec_splat_dbl<0>(a3); - a3 = vec_splat_dbl<1>(a3); -} - -template<> EIGEN_DEVICE_FUNC inline Packet2d pgather(const double* from, Index stride) -{ - double EIGEN_ALIGN16 af[2]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - return pload(af); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(double* to, const Packet2d& from, Index stride) -{ - double EIGEN_ALIGN16 af[2]; - pstore(af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; -} - -template<> EIGEN_STRONG_INLINE Packet2d plset(const double& a) { return pset1(a) + p2d_COUNTDOWN; } - -template<> EIGEN_STRONG_INLINE Packet2d padd(const Packet2d& a, const Packet2d& b) { return a + b; } - -template<> EIGEN_STRONG_INLINE Packet2d psub(const Packet2d& a, const Packet2d& b) { return a - b; } - -template<> EIGEN_STRONG_INLINE Packet2d pnegate(const Packet2d& a) { return p2d_ZERO - a; } - -template<> EIGEN_STRONG_INLINE Packet2d pconj(const Packet2d& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet2d pmul(const Packet2d& a, const Packet2d& b) { return vec_madd(a,b,p2d_MZERO); } -template<> EIGEN_STRONG_INLINE Packet2d pdiv(const Packet2d& a, const Packet2d& b) { return vec_div(a,b); } - -// for some weird raisons, it has to be overloaded for packet of integers -template<> EIGEN_STRONG_INLINE Packet2d pmadd(const Packet2d& a, const Packet2d& b, const Packet2d& c) { return vec_madd(a, b, c); } - -template<> EIGEN_STRONG_INLINE Packet2d pmin(const Packet2d& a, const Packet2d& b) { return vec_min(a, b); } - -template<> EIGEN_STRONG_INLINE Packet2d pmax(const Packet2d& a, const Packet2d& b) { return vec_max(a, b); } - -template<> EIGEN_STRONG_INLINE Packet2d pand(const Packet2d& a, const Packet2d& b) { return vec_and(a, b); } - -template<> EIGEN_STRONG_INLINE Packet2d por(const Packet2d& a, const Packet2d& b) { return vec_or(a, b); } - -template<> EIGEN_STRONG_INLINE Packet2d pxor(const Packet2d& a, const Packet2d& b) { return vec_xor(a, b); } - -template<> EIGEN_STRONG_INLINE Packet2d pandnot(const Packet2d& a, const Packet2d& b) { return vec_and(a, vec_nor(b, b)); } - -template<> EIGEN_STRONG_INLINE Packet2d pround(const Packet2d& a) { return vec_round(a); } -template<> EIGEN_STRONG_INLINE Packet2d pceil(const Packet2d& a) { return vec_ceil(a); } -template<> EIGEN_STRONG_INLINE Packet2d pfloor(const Packet2d& a) { return vec_floor(a); } - -template<> EIGEN_STRONG_INLINE Packet2d ploadu(const double* from) -{ - EIGEN_DEBUG_ALIGNED_LOAD - return (Packet2d) vec_vsx_ld((long)from & 15, (const double*) _EIGEN_ALIGNED_PTR(from)); -} - -template<> EIGEN_STRONG_INLINE Packet2d ploaddup(const double* from) -{ - Packet2d p; - if((std::ptrdiff_t(from) % 16) == 0) p = pload(from); - else p = ploadu(from); - return vec_splat_dbl<0>(p); -} - -template<> EIGEN_STRONG_INLINE void pstoreu(double* to, const Packet2d& from) -{ - EIGEN_DEBUG_ALIGNED_STORE - vec_vsx_st((Packet4f)from, (long)to & 15, (float*) _EIGEN_ALIGNED_PTR(to)); -} - -template<> EIGEN_STRONG_INLINE void prefetch(const double* addr) { EIGEN_PPC_PREFETCH(addr); } - -template<> EIGEN_STRONG_INLINE double pfirst(const Packet2d& a) { double EIGEN_ALIGN16 x[2]; pstore(x, a); return x[0]; } - -template<> EIGEN_STRONG_INLINE Packet2d preverse(const Packet2d& a) -{ - return reinterpret_cast(vec_perm(reinterpret_cast(a), reinterpret_cast(a), p16uc_REVERSE64)); -} -template<> EIGEN_STRONG_INLINE Packet2d pabs(const Packet2d& a) { return vec_abs(a); } - -template<> EIGEN_STRONG_INLINE double predux(const Packet2d& a) -{ - Packet2d b, sum; - b = reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)); - sum = a + b; - return pfirst(sum); -} - -template<> EIGEN_STRONG_INLINE Packet2d preduxp(const Packet2d* vecs) -{ - Packet2d v[2], sum; - v[0] = vecs[0] + reinterpret_cast(vec_sld(reinterpret_cast(vecs[0]), reinterpret_cast(vecs[0]), 8)); - v[1] = vecs[1] + reinterpret_cast(vec_sld(reinterpret_cast(vecs[1]), reinterpret_cast(vecs[1]), 8)); - -#ifdef _BIG_ENDIAN - sum = reinterpret_cast(vec_sld(reinterpret_cast(v[0]), reinterpret_cast(v[1]), 8)); -#else - sum = reinterpret_cast(vec_sld(reinterpret_cast(v[1]), reinterpret_cast(v[0]), 8)); -#endif - - return sum; -} -// Other reduction functions: -// mul -template<> EIGEN_STRONG_INLINE double predux_mul(const Packet2d& a) -{ - return pfirst(pmul(a, reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)))); -} - -// min -template<> EIGEN_STRONG_INLINE double predux_min(const Packet2d& a) -{ - return pfirst(pmin(a, reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)))); -} - -// max -template<> EIGEN_STRONG_INLINE double predux_max(const Packet2d& a) -{ - return pfirst(pmax(a, reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)))); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2d& first, const Packet2d& second) - { - if (Offset == 1) -#ifdef _BIG_ENDIAN - first = reinterpret_cast(vec_sld(reinterpret_cast(first), reinterpret_cast(second), 8)); -#else - first = reinterpret_cast(vec_sld(reinterpret_cast(second), reinterpret_cast(first), 8)); -#endif - } -}; - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet2d t0, t1; - t0 = vec_perm(kernel.packet[0], kernel.packet[1], p16uc_TRANSPOSE64_HI); - t1 = vec_perm(kernel.packet[0], kernel.packet[1], p16uc_TRANSPOSE64_LO); - kernel.packet[0] = t0; - kernel.packet[1] = t1; -} - -template<> EIGEN_STRONG_INLINE Packet2d pblend(const Selector<2>& ifPacket, const Packet2d& thenPacket, const Packet2d& elsePacket) { - Packet2l select = { ifPacket.select[0], ifPacket.select[1] }; - Packet2bl mask = vec_cmpeq(reinterpret_cast(select), reinterpret_cast(p2l_ONE)); - return vec_sel(elsePacket, thenPacket, mask); -} -#endif // __VSX__ -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PACKET_MATH_ALTIVEC_H diff --git a/Eigen/src/Core/arch/CUDA/Complex.h b/Eigen/src/Core/arch/CUDA/Complex.h deleted file mode 100644 index 57d1201f4..000000000 --- a/Eigen/src/Core/arch/CUDA/Complex.h +++ /dev/null @@ -1,103 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX_CUDA_H -#define EIGEN_COMPLEX_CUDA_H - -// clang-format off - -namespace Eigen { - -namespace internal { - -#if defined(EIGEN_CUDACC) && defined(EIGEN_USE_GPU) - -// Many std::complex methods such as operator+, operator-, operator* and -// operator/ are not constexpr. Due to this, clang does not treat them as device -// functions and thus Eigen functors making use of these operators fail to -// compile. Here, we manually specialize these functors for complex types when -// building for CUDA to avoid non-constexpr methods. - -// Sum -template struct scalar_sum_op, const std::complex > : binary_op_base, const std::complex > { - typedef typename std::complex result_type; - - EIGEN_EMPTY_STRUCT_CTOR(scalar_sum_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE std::complex operator() (const std::complex& a, const std::complex& b) const { - return std::complex(numext::real(a) + numext::real(b), - numext::imag(a) + numext::imag(b)); - } -}; - -template struct scalar_sum_op, std::complex > : scalar_sum_op, const std::complex > {}; - - -// Difference -template struct scalar_difference_op, const std::complex > : binary_op_base, const std::complex > { - typedef typename std::complex result_type; - - EIGEN_EMPTY_STRUCT_CTOR(scalar_difference_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE std::complex operator() (const std::complex& a, const std::complex& b) const { - return std::complex(numext::real(a) - numext::real(b), - numext::imag(a) - numext::imag(b)); - } -}; - -template struct scalar_difference_op, std::complex > : scalar_difference_op, const std::complex > {}; - - -// Product -template struct scalar_product_op, const std::complex > : binary_op_base, const std::complex > { - enum { - Vectorizable = packet_traits >::HasMul - }; - typedef typename std::complex result_type; - - EIGEN_EMPTY_STRUCT_CTOR(scalar_product_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE std::complex operator() (const std::complex& a, const std::complex& b) const { - const T a_real = numext::real(a); - const T a_imag = numext::imag(a); - const T b_real = numext::real(b); - const T b_imag = numext::imag(b); - return std::complex(a_real * b_real - a_imag * b_imag, - a_real * b_imag + a_imag * b_real); - } -}; - -template struct scalar_product_op, std::complex > : scalar_product_op, const std::complex > {}; - - -// Quotient -template struct scalar_quotient_op, const std::complex > : binary_op_base, const std::complex > { - enum { - Vectorizable = packet_traits >::HasDiv - }; - typedef typename std::complex result_type; - - EIGEN_EMPTY_STRUCT_CTOR(scalar_quotient_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE std::complex operator() (const std::complex& a, const std::complex& b) const { - const T a_real = numext::real(a); - const T a_imag = numext::imag(a); - const T b_real = numext::real(b); - const T b_imag = numext::imag(b); - const T norm = T(1) / (b_real * b_real + b_imag * b_imag); - return std::complex((a_real * b_real + a_imag * b_imag) * norm, - (a_imag * b_real - a_real * b_imag) * norm); - } -}; - -template struct scalar_quotient_op, std::complex > : scalar_quotient_op, const std::complex > {}; - -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX_CUDA_H diff --git a/Eigen/src/Core/arch/CUDA/Half.h b/Eigen/src/Core/arch/CUDA/Half.h deleted file mode 100644 index bfda39df5..000000000 --- a/Eigen/src/Core/arch/CUDA/Half.h +++ /dev/null @@ -1,666 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. -// -// The conversion routines are Copyright (c) Fabian Giesen, 2016. -// The original license follows: -// -// Copyright (c) Fabian Giesen, 2016 -// All rights reserved. -// Redistribution and use in source and binary forms, with or without -// modification, are permitted. -// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - -// Standard 16-bit float type, mostly useful for GPUs. Defines a new -// type Eigen::half (inheriting from CUDA's __half struct) with -// operator overloads such that it behaves basically as an arithmetic -// type. It will be quite slow on CPUs (so it is recommended to stay -// in fp32 for CPUs, except for simple parameter conversions, I/O -// to disk and the likes), but fast on GPUs. - - -#ifndef EIGEN_HALF_CUDA_H -#define EIGEN_HALF_CUDA_H - -#if __cplusplus > 199711L -#define EIGEN_EXPLICIT_CAST(tgt_type) explicit operator tgt_type() -#else -#define EIGEN_EXPLICIT_CAST(tgt_type) operator tgt_type() -#endif - - -namespace Eigen { - -struct half; - -namespace half_impl { - -#if !defined(EIGEN_HAS_CUDA_FP16) -// Make our own __half_raw definition that is similar to CUDA's. -struct __half_raw { - EIGEN_DEVICE_FUNC __half_raw() : x(0) {} - explicit EIGEN_DEVICE_FUNC __half_raw(unsigned short raw) : x(raw) {} - unsigned short x; -}; -#elif defined(EIGEN_CUDACC_VER) && EIGEN_CUDACC_VER < 90000 -// In CUDA < 9.0, __half is the equivalent of CUDA 9's __half_raw -typedef __half __half_raw; -#endif - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC __half_raw raw_uint16_to_half(unsigned short x); -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC __half_raw float_to_half_rtne(float ff); -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC float half_to_float(__half_raw h); - -struct half_base : public __half_raw { - EIGEN_DEVICE_FUNC half_base() {} - EIGEN_DEVICE_FUNC half_base(const half_base& h) : __half_raw(h) {} - EIGEN_DEVICE_FUNC half_base(const __half_raw& h) : __half_raw(h) {} -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDACC_VER) && EIGEN_CUDACC_VER >= 90000 - EIGEN_DEVICE_FUNC half_base(const __half& h) : __half_raw(*(__half_raw*)&h) {} -#endif -}; - -} // namespace half_impl - -// Class definition. -struct half : public half_impl::half_base { - #if !defined(EIGEN_HAS_CUDA_FP16) || (defined(EIGEN_CUDACC_VER) && EIGEN_CUDACC_VER < 90000) - typedef half_impl::__half_raw __half_raw; - #endif - - EIGEN_DEVICE_FUNC half() {} - - EIGEN_DEVICE_FUNC half(const __half_raw& h) : half_impl::half_base(h) {} - EIGEN_DEVICE_FUNC half(const half& h) : half_impl::half_base(h) {} -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDACC_VER) && EIGEN_CUDACC_VER >= 90000 - EIGEN_DEVICE_FUNC half(const __half& h) : half_impl::half_base(h) {} -#endif - - explicit EIGEN_DEVICE_FUNC half(bool b) - : half_impl::half_base(half_impl::raw_uint16_to_half(b ? 0x3c00 : 0)) {} - template - explicit EIGEN_DEVICE_FUNC half(const T& val) - : half_impl::half_base(half_impl::float_to_half_rtne(static_cast(val))) {} - explicit EIGEN_DEVICE_FUNC half(float f) - : half_impl::half_base(half_impl::float_to_half_rtne(f)) {} - - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(bool) const { - // +0.0 and -0.0 become false, everything else becomes true. - return (x & 0x7fff) != 0; - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(signed char) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(unsigned char) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(short) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(unsigned short) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(int) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(unsigned int) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(long) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(unsigned long) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(long long) const { - return static_cast(half_impl::half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(unsigned long long) const { - return static_cast(half_to_float(*this)); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(float) const { - return half_impl::half_to_float(*this); - } - EIGEN_DEVICE_FUNC EIGEN_EXPLICIT_CAST(double) const { - return static_cast(half_impl::half_to_float(*this)); - } - - EIGEN_DEVICE_FUNC half& operator=(const half& other) { - x = other.x; - return *this; - } -}; - -namespace half_impl { - -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 530 - -// Intrinsics for native fp16 support. Note that on current hardware, -// these are no faster than fp32 arithmetic (you need to use the half2 -// versions to get the ALU speed increased), but you do save the -// conversion steps back and forth. - -EIGEN_STRONG_INLINE __device__ half operator + (const half& a, const half& b) { - return __hadd(a, b); -} -EIGEN_STRONG_INLINE __device__ half operator * (const half& a, const half& b) { - return __hmul(a, b); -} -EIGEN_STRONG_INLINE __device__ half operator - (const half& a, const half& b) { - return __hsub(a, b); -} -EIGEN_STRONG_INLINE __device__ half operator / (const half& a, const half& b) { - float num = __half2float(a); - float denom = __half2float(b); - return __float2half(num / denom); -} -EIGEN_STRONG_INLINE __device__ half operator - (const half& a) { - return __hneg(a); -} -EIGEN_STRONG_INLINE __device__ half& operator += (half& a, const half& b) { - a = a + b; - return a; -} -EIGEN_STRONG_INLINE __device__ half& operator *= (half& a, const half& b) { - a = a * b; - return a; -} -EIGEN_STRONG_INLINE __device__ half& operator -= (half& a, const half& b) { - a = a - b; - return a; -} -EIGEN_STRONG_INLINE __device__ half& operator /= (half& a, const half& b) { - a = a / b; - return a; -} -EIGEN_STRONG_INLINE __device__ bool operator == (const half& a, const half& b) { - return __heq(a, b); -} -EIGEN_STRONG_INLINE __device__ bool operator != (const half& a, const half& b) { - return __hne(a, b); -} -EIGEN_STRONG_INLINE __device__ bool operator < (const half& a, const half& b) { - return __hlt(a, b); -} -EIGEN_STRONG_INLINE __device__ bool operator <= (const half& a, const half& b) { - return __hle(a, b); -} -EIGEN_STRONG_INLINE __device__ bool operator > (const half& a, const half& b) { - return __hgt(a, b); -} -EIGEN_STRONG_INLINE __device__ bool operator >= (const half& a, const half& b) { - return __hge(a, b); -} - -#else // Emulate support for half floats - -// Definitions for CPUs and older CUDA, mostly working through conversion -// to/from fp32. - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half operator + (const half& a, const half& b) { - return half(float(a) + float(b)); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half operator * (const half& a, const half& b) { - return half(float(a) * float(b)); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half operator - (const half& a, const half& b) { - return half(float(a) - float(b)); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half operator / (const half& a, const half& b) { - return half(float(a) / float(b)); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half operator - (const half& a) { - half result; - result.x = a.x ^ 0x8000; - return result; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half& operator += (half& a, const half& b) { - a = half(float(a) + float(b)); - return a; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half& operator *= (half& a, const half& b) { - a = half(float(a) * float(b)); - return a; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half& operator -= (half& a, const half& b) { - a = half(float(a) - float(b)); - return a; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half& operator /= (half& a, const half& b) { - a = half(float(a) / float(b)); - return a; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool operator == (const half& a, const half& b) { - return float(a) == float(b); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool operator != (const half& a, const half& b) { - return float(a) != float(b); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool operator < (const half& a, const half& b) { - return float(a) < float(b); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool operator <= (const half& a, const half& b) { - return float(a) <= float(b); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool operator > (const half& a, const half& b) { - return float(a) > float(b); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool operator >= (const half& a, const half& b) { - return float(a) >= float(b); -} - -#endif // Emulate support for half floats - -// Division by an index. Do it in full float precision to avoid accuracy -// issues in converting the denominator to half. -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half operator / (const half& a, Index b) { - return half(static_cast(a) / static_cast(b)); -} - -// Conversion routines, including fallbacks for the host or older CUDA. -// Note that newer Intel CPUs (Haswell or newer) have vectorized versions of -// these in hardware. If we need more performance on older/other CPUs, they are -// also possible to vectorize directly. - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC __half_raw raw_uint16_to_half(unsigned short x) { - __half_raw h; - h.x = x; - return h; -} - -union FP32 { - unsigned int u; - float f; -}; - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC __half_raw float_to_half_rtne(float ff) { -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - __half tmp_ff = __float2half(ff); - return *(__half_raw*)&tmp_ff; - -#elif defined(EIGEN_HAS_FP16_C) - __half_raw h; - h.x = _cvtss_sh(ff, 0); - return h; - -#else - FP32 f; f.f = ff; - - const FP32 f32infty = { 255 << 23 }; - const FP32 f16max = { (127 + 16) << 23 }; - const FP32 denorm_magic = { ((127 - 15) + (23 - 10) + 1) << 23 }; - unsigned int sign_mask = 0x80000000u; - __half_raw o; - o.x = static_cast(0x0u); - - unsigned int sign = f.u & sign_mask; - f.u ^= sign; - - // NOTE all the integer compares in this function can be safely - // compiled into signed compares since all operands are below - // 0x80000000. Important if you want fast straight SSE2 code - // (since there's no unsigned PCMPGTD). - - if (f.u >= f16max.u) { // result is Inf or NaN (all exponent bits set) - o.x = (f.u > f32infty.u) ? 0x7e00 : 0x7c00; // NaN->qNaN and Inf->Inf - } else { // (De)normalized number or zero - if (f.u < (113 << 23)) { // resulting FP16 is subnormal or zero - // use a magic value to align our 10 mantissa bits at the bottom of - // the float. as long as FP addition is round-to-nearest-even this - // just works. - f.f += denorm_magic.f; - - // and one integer subtract of the bias later, we have our final float! - o.x = static_cast(f.u - denorm_magic.u); - } else { - unsigned int mant_odd = (f.u >> 13) & 1; // resulting mantissa is odd - - // update exponent, rounding bias part 1 - f.u += ((unsigned int)(15 - 127) << 23) + 0xfff; - // rounding bias part 2 - f.u += mant_odd; - // take the bits! - o.x = static_cast(f.u >> 13); - } - } - - o.x |= static_cast(sign >> 16); - return o; -#endif -} - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC float half_to_float(__half_raw h) { -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - return __half2float(h); - -#elif defined(EIGEN_HAS_FP16_C) - return _cvtsh_ss(h.x); - -#else - const FP32 magic = { 113 << 23 }; - const unsigned int shifted_exp = 0x7c00 << 13; // exponent mask after shift - FP32 o; - - o.u = (h.x & 0x7fff) << 13; // exponent/mantissa bits - unsigned int exp = shifted_exp & o.u; // just the exponent - o.u += (127 - 15) << 23; // exponent adjust - - // handle exponent special cases - if (exp == shifted_exp) { // Inf/NaN? - o.u += (128 - 16) << 23; // extra exp adjust - } else if (exp == 0) { // Zero/Denormal? - o.u += 1 << 23; // extra exp adjust - o.f -= magic.f; // renormalize - } - - o.u |= (h.x & 0x8000) << 16; // sign bit - return o.f; -#endif -} - -// --- standard functions --- - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool (isinf)(const half& a) { - return (a.x & 0x7fff) == 0x7c00; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool (isnan)(const half& a) { -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 530 - return __hisnan(a); -#else - return (a.x & 0x7fff) > 0x7c00; -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC bool (isfinite)(const half& a) { - return !(isinf EIGEN_NOT_A_MACRO (a)) && !(isnan EIGEN_NOT_A_MACRO (a)); -} - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half abs(const half& a) { - half result; - result.x = a.x & 0x7FFF; - return result; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half exp(const half& a) { -#if EIGEN_CUDACC_VER >= 80000 && defined EIGEN_CUDA_ARCH && EIGEN_CUDA_ARCH >= 530 - return half(hexp(a)); -#else - return half(::expf(float(a))); -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half expm1(const half& a) { - return half(numext::expm1(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half log(const half& a) { -#if defined(EIGEN_HAS_CUDA_FP16) && EIGEN_CUDACC_VER >= 80000 && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 530 - return half(::hlog(a)); -#else - return half(::logf(float(a))); -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half log1p(const half& a) { - return half(numext::log1p(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half log10(const half& a) { - return half(::log10f(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half sqrt(const half& a) { -#if EIGEN_CUDACC_VER >= 80000 && defined EIGEN_CUDA_ARCH && EIGEN_CUDA_ARCH >= 530 - return half(hsqrt(a)); -#else - return half(::sqrtf(float(a))); -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half pow(const half& a, const half& b) { - return half(::powf(float(a), float(b))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half sin(const half& a) { - return half(::sinf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half cos(const half& a) { - return half(::cosf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half tan(const half& a) { - return half(::tanf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half tanh(const half& a) { - return half(::tanhf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half floor(const half& a) { -#if EIGEN_CUDACC_VER >= 80000 && defined EIGEN_CUDA_ARCH && EIGEN_CUDA_ARCH >= 300 - return half(hfloor(a)); -#else - return half(::floorf(float(a))); -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half ceil(const half& a) { -#if EIGEN_CUDACC_VER >= 80000 && defined EIGEN_CUDA_ARCH && EIGEN_CUDA_ARCH >= 300 - return half(hceil(a)); -#else - return half(::ceilf(float(a))); -#endif -} - -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half (min)(const half& a, const half& b) { -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 530 - return __hlt(b, a) ? b : a; -#else - const float f1 = static_cast(a); - const float f2 = static_cast(b); - return f2 < f1 ? b : a; -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC half (max)(const half& a, const half& b) { -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 530 - return __hlt(a, b) ? b : a; -#else - const float f1 = static_cast(a); - const float f2 = static_cast(b); - return f1 < f2 ? b : a; -#endif -} - -EIGEN_ALWAYS_INLINE std::ostream& operator << (std::ostream& os, const half& v) { - os << static_cast(v); - return os; -} - -} // end namespace half_impl - -// import Eigen::half_impl::half into Eigen namespace -// using half_impl::half; - -namespace internal { - -template<> -struct random_default_impl -{ - static inline half run(const half& x, const half& y) - { - return x + (y-x) * half(float(std::rand()) / float(RAND_MAX)); - } - static inline half run() - { - return run(half(-1.f), half(1.f)); - } -}; - -template<> struct is_arithmetic { enum { value = true }; }; - -} // end namespace internal - -} // end namespace Eigen - -namespace std { -template<> -struct numeric_limits { - static const bool is_specialized = true; - static const bool is_signed = true; - static const bool is_integer = false; - static const bool is_exact = false; - static const bool has_infinity = true; - static const bool has_quiet_NaN = true; - static const bool has_signaling_NaN = true; - static const float_denorm_style has_denorm = denorm_present; - static const bool has_denorm_loss = false; - static const std::float_round_style round_style = std::round_to_nearest; - static const bool is_iec559 = false; - static const bool is_bounded = false; - static const bool is_modulo = false; - static const int digits = 11; - static const int digits10 = 3; // according to http://half.sourceforge.net/structstd_1_1numeric__limits_3_01half__float_1_1half_01_4.html - static const int max_digits10 = 5; // according to http://half.sourceforge.net/structstd_1_1numeric__limits_3_01half__float_1_1half_01_4.html - static const int radix = 2; - static const int min_exponent = -13; - static const int min_exponent10 = -4; - static const int max_exponent = 16; - static const int max_exponent10 = 4; - static const bool traps = true; - static const bool tinyness_before = false; - - static Eigen::half (min)() { return Eigen::half_impl::raw_uint16_to_half(0x400); } - static Eigen::half lowest() { return Eigen::half_impl::raw_uint16_to_half(0xfbff); } - static Eigen::half (max)() { return Eigen::half_impl::raw_uint16_to_half(0x7bff); } - static Eigen::half epsilon() { return Eigen::half_impl::raw_uint16_to_half(0x0800); } - static Eigen::half round_error() { return Eigen::half(0.5); } - static Eigen::half infinity() { return Eigen::half_impl::raw_uint16_to_half(0x7c00); } - static Eigen::half quiet_NaN() { return Eigen::half_impl::raw_uint16_to_half(0x7e00); } - static Eigen::half signaling_NaN() { return Eigen::half_impl::raw_uint16_to_half(0x7e00); } - static Eigen::half denorm_min() { return Eigen::half_impl::raw_uint16_to_half(0x1); } -}; -} - -namespace Eigen { - -template<> struct NumTraits - : GenericNumTraits -{ - enum { - IsSigned = true, - IsInteger = false, - IsComplex = false, - RequireInitialization = false - }; - - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Eigen::half epsilon() { - return half_impl::raw_uint16_to_half(0x0800); - } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Eigen::half dummy_precision() { return Eigen::half(1e-2f); } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Eigen::half highest() { - return half_impl::raw_uint16_to_half(0x7bff); - } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Eigen::half lowest() { - return half_impl::raw_uint16_to_half(0xfbff); - } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Eigen::half infinity() { - return half_impl::raw_uint16_to_half(0x7c00); - } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Eigen::half quiet_NaN() { - return half_impl::raw_uint16_to_half(0x7c01); - } -}; - -} // end namespace Eigen - -// C-like standard mathematical functions and trancendentals. -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half fabsh(const Eigen::half& a) { - Eigen::half result; - result.x = a.x & 0x7FFF; - return result; -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half exph(const Eigen::half& a) { - return Eigen::half(::expf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half logh(const Eigen::half& a) { -#if EIGEN_CUDACC_VER >= 80000 && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 530 - return Eigen::half(::hlog(a)); -#else - return Eigen::half(::logf(float(a))); -#endif -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half sqrth(const Eigen::half& a) { - return Eigen::half(::sqrtf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half powh(const Eigen::half& a, const Eigen::half& b) { - return Eigen::half(::powf(float(a), float(b))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half floorh(const Eigen::half& a) { - return Eigen::half(::floorf(float(a))); -} -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half ceilh(const Eigen::half& a) { - return Eigen::half(::ceilf(float(a))); -} - -namespace std { - -#if __cplusplus > 199711L -template <> -struct hash { - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE std::size_t operator()(const Eigen::half& a) const { - return static_cast(a.x); - } -}; -#endif - -} // end namespace std - - -// Add the missing shfl_xor intrinsic -#if defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 -__device__ EIGEN_STRONG_INLINE Eigen::half __shfl_xor(Eigen::half var, int laneMask, int width=warpSize) { - #if EIGEN_CUDACC_VER < 90000 - return static_cast(__shfl_xor(static_cast(var), laneMask, width)); - #else - return static_cast(__shfl_xor_sync(0xFFFFFFFF, static_cast(var), laneMask, width)); - #endif -} -#endif - -// ldg() has an overload for __half_raw, but we also need one for Eigen::half. -#if defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 350 -EIGEN_STRONG_INLINE EIGEN_DEVICE_FUNC Eigen::half __ldg(const Eigen::half* ptr) { - return Eigen::half_impl::raw_uint16_to_half( - __ldg(reinterpret_cast(ptr))); -} -#endif - - -#if defined(EIGEN_CUDA_ARCH) -namespace Eigen { -namespace numext { - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE -bool (isnan)(const Eigen::half& h) { - return (half_impl::isnan)(h); -} - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE -bool (isinf)(const Eigen::half& h) { - return (half_impl::isinf)(h); -} - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE -bool (isfinite)(const Eigen::half& h) { - return (half_impl::isfinite)(h); -} - -} // namespace Eigen -} // namespace numext -#endif - -#endif // EIGEN_HALF_CUDA_H diff --git a/Eigen/src/Core/arch/CUDA/MathFunctions.h b/Eigen/src/Core/arch/CUDA/MathFunctions.h deleted file mode 100644 index ff6256ce0..000000000 --- a/Eigen/src/Core/arch/CUDA/MathFunctions.h +++ /dev/null @@ -1,103 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MATH_FUNCTIONS_CUDA_H -#define EIGEN_MATH_FUNCTIONS_CUDA_H - -namespace Eigen { - -namespace internal { - -// Make sure this is only available when targeting a GPU: we don't want to -// introduce conflicts between these packet_traits definitions and the ones -// we'll use on the host side (SSE, AVX, ...) -#if defined(EIGEN_CUDACC) && defined(EIGEN_USE_GPU) -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -float4 plog(const float4& a) -{ - return make_float4(logf(a.x), logf(a.y), logf(a.z), logf(a.w)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -double2 plog(const double2& a) -{ - using ::log; - return make_double2(log(a.x), log(a.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -float4 plog1p(const float4& a) -{ - return make_float4(log1pf(a.x), log1pf(a.y), log1pf(a.z), log1pf(a.w)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -double2 plog1p(const double2& a) -{ - return make_double2(log1p(a.x), log1p(a.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -float4 pexp(const float4& a) -{ - return make_float4(expf(a.x), expf(a.y), expf(a.z), expf(a.w)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -double2 pexp(const double2& a) -{ - using ::exp; - return make_double2(exp(a.x), exp(a.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -float4 pexpm1(const float4& a) -{ - return make_float4(expm1f(a.x), expm1f(a.y), expm1f(a.z), expm1f(a.w)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -double2 pexpm1(const double2& a) -{ - return make_double2(expm1(a.x), expm1(a.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -float4 psqrt(const float4& a) -{ - return make_float4(sqrtf(a.x), sqrtf(a.y), sqrtf(a.z), sqrtf(a.w)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -double2 psqrt(const double2& a) -{ - using ::sqrt; - return make_double2(sqrt(a.x), sqrt(a.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -float4 prsqrt(const float4& a) -{ - return make_float4(rsqrtf(a.x), rsqrtf(a.y), rsqrtf(a.z), rsqrtf(a.w)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE -double2 prsqrt(const double2& a) -{ - return make_double2(rsqrt(a.x), rsqrt(a.y)); -} - - -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_MATH_FUNCTIONS_CUDA_H diff --git a/Eigen/src/Core/arch/CUDA/PacketMath.h b/Eigen/src/Core/arch/CUDA/PacketMath.h deleted file mode 100644 index 97a8abe59..000000000 --- a/Eigen/src/Core/arch/CUDA/PacketMath.h +++ /dev/null @@ -1,333 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_CUDA_H -#define EIGEN_PACKET_MATH_CUDA_H - -namespace Eigen { - -namespace internal { - -// Make sure this is only available when targeting a GPU: we don't want to -// introduce conflicts between these packet_traits definitions and the ones -// we'll use on the host side (SSE, AVX, ...) -#if defined(EIGEN_CUDACC) && defined(EIGEN_USE_GPU) -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; - -template<> struct packet_traits : default_packet_traits -{ - typedef float4 type; - typedef float4 half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - HasHalfPacket = 0, - - HasDiv = 1, - HasSin = 0, - HasCos = 0, - HasLog = 1, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasLGamma = 1, - HasDiGamma = 1, - HasZeta = 1, - HasPolygamma = 1, - HasErf = 1, - HasErfc = 1, - HasIGamma = 1, - HasIGammac = 1, - HasBetaInc = 1, - - HasBlend = 0, - }; -}; - -template<> struct packet_traits : default_packet_traits -{ - typedef double2 type; - typedef double2 half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=2, - HasHalfPacket = 0, - - HasDiv = 1, - HasLog = 1, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasLGamma = 1, - HasDiGamma = 1, - HasZeta = 1, - HasPolygamma = 1, - HasErf = 1, - HasErfc = 1, - HasIGamma = 1, - HasIGammac = 1, - HasBetaInc = 1, - - HasBlend = 0, - }; -}; - - -template<> struct unpacket_traits { typedef float type; enum {size=4, alignment=Aligned16}; typedef float4 half; }; -template<> struct unpacket_traits { typedef double type; enum {size=2, alignment=Aligned16}; typedef double2 half; }; - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pset1(const float& from) { - return make_float4(from, from, from, from); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pset1(const double& from) { - return make_double2(from, from); -} - - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 plset(const float& a) { - return make_float4(a, a+1, a+2, a+3); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 plset(const double& a) { - return make_double2(a, a+1); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 padd(const float4& a, const float4& b) { - return make_float4(a.x+b.x, a.y+b.y, a.z+b.z, a.w+b.w); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 padd(const double2& a, const double2& b) { - return make_double2(a.x+b.x, a.y+b.y); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 psub(const float4& a, const float4& b) { - return make_float4(a.x-b.x, a.y-b.y, a.z-b.z, a.w-b.w); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 psub(const double2& a, const double2& b) { - return make_double2(a.x-b.x, a.y-b.y); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pnegate(const float4& a) { - return make_float4(-a.x, -a.y, -a.z, -a.w); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pnegate(const double2& a) { - return make_double2(-a.x, -a.y); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pconj(const float4& a) { return a; } -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pconj(const double2& a) { return a; } - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pmul(const float4& a, const float4& b) { - return make_float4(a.x*b.x, a.y*b.y, a.z*b.z, a.w*b.w); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pmul(const double2& a, const double2& b) { - return make_double2(a.x*b.x, a.y*b.y); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pdiv(const float4& a, const float4& b) { - return make_float4(a.x/b.x, a.y/b.y, a.z/b.z, a.w/b.w); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pdiv(const double2& a, const double2& b) { - return make_double2(a.x/b.x, a.y/b.y); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pmin(const float4& a, const float4& b) { - return make_float4(fminf(a.x, b.x), fminf(a.y, b.y), fminf(a.z, b.z), fminf(a.w, b.w)); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pmin(const double2& a, const double2& b) { - return make_double2(fmin(a.x, b.x), fmin(a.y, b.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pmax(const float4& a, const float4& b) { - return make_float4(fmaxf(a.x, b.x), fmaxf(a.y, b.y), fmaxf(a.z, b.z), fmaxf(a.w, b.w)); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pmax(const double2& a, const double2& b) { - return make_double2(fmax(a.x, b.x), fmax(a.y, b.y)); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pload(const float* from) { - return *reinterpret_cast(from); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 pload(const double* from) { - return *reinterpret_cast(from); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 ploadu(const float* from) { - return make_float4(from[0], from[1], from[2], from[3]); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 ploadu(const double* from) { - return make_double2(from[0], from[1]); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 ploaddup(const float* from) { - return make_float4(from[0], from[0], from[1], from[1]); -} -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE double2 ploaddup(const double* from) { - return make_double2(from[0], from[0]); -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstore(float* to, const float4& from) { - *reinterpret_cast(to) = from; -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstore(double* to, const double2& from) { - *reinterpret_cast(to) = from; -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstoreu(float* to, const float4& from) { - to[0] = from.x; - to[1] = from.y; - to[2] = from.z; - to[3] = from.w; -} - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void pstoreu(double* to, const double2& from) { - to[0] = from.x; - to[1] = from.y; -} - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE float4 ploadt_ro(const float* from) { -#if defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 350 - return __ldg((const float4*)from); -#else - return make_float4(from[0], from[1], from[2], from[3]); -#endif -} -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE double2 ploadt_ro(const double* from) { -#if defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 350 - return __ldg((const double2*)from); -#else - return make_double2(from[0], from[1]); -#endif -} - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE float4 ploadt_ro(const float* from) { -#if defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 350 - return make_float4(__ldg(from+0), __ldg(from+1), __ldg(from+2), __ldg(from+3)); -#else - return make_float4(from[0], from[1], from[2], from[3]); -#endif -} -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE double2 ploadt_ro(const double* from) { -#if defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 350 - return make_double2(__ldg(from+0), __ldg(from+1)); -#else - return make_double2(from[0], from[1]); -#endif -} - -template<> EIGEN_DEVICE_FUNC inline float4 pgather(const float* from, Index stride) { - return make_float4(from[0*stride], from[1*stride], from[2*stride], from[3*stride]); -} - -template<> EIGEN_DEVICE_FUNC inline double2 pgather(const double* from, Index stride) { - return make_double2(from[0*stride], from[1*stride]); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const float4& from, Index stride) { - to[stride*0] = from.x; - to[stride*1] = from.y; - to[stride*2] = from.z; - to[stride*3] = from.w; -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(double* to, const double2& from, Index stride) { - to[stride*0] = from.x; - to[stride*1] = from.y; -} - -template<> EIGEN_DEVICE_FUNC inline float pfirst(const float4& a) { - return a.x; -} -template<> EIGEN_DEVICE_FUNC inline double pfirst(const double2& a) { - return a.x; -} - -template<> EIGEN_DEVICE_FUNC inline float predux(const float4& a) { - return a.x + a.y + a.z + a.w; -} -template<> EIGEN_DEVICE_FUNC inline double predux(const double2& a) { - return a.x + a.y; -} - -template<> EIGEN_DEVICE_FUNC inline float predux_max(const float4& a) { - return fmaxf(fmaxf(a.x, a.y), fmaxf(a.z, a.w)); -} -template<> EIGEN_DEVICE_FUNC inline double predux_max(const double2& a) { - return fmax(a.x, a.y); -} - -template<> EIGEN_DEVICE_FUNC inline float predux_min(const float4& a) { - return fminf(fminf(a.x, a.y), fminf(a.z, a.w)); -} -template<> EIGEN_DEVICE_FUNC inline double predux_min(const double2& a) { - return fmin(a.x, a.y); -} - -template<> EIGEN_DEVICE_FUNC inline float predux_mul(const float4& a) { - return a.x * a.y * a.z * a.w; -} -template<> EIGEN_DEVICE_FUNC inline double predux_mul(const double2& a) { - return a.x * a.y; -} - -template<> EIGEN_DEVICE_FUNC inline float4 pabs(const float4& a) { - return make_float4(fabsf(a.x), fabsf(a.y), fabsf(a.z), fabsf(a.w)); -} -template<> EIGEN_DEVICE_FUNC inline double2 pabs(const double2& a) { - return make_double2(fabs(a.x), fabs(a.y)); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - float tmp = kernel.packet[0].y; - kernel.packet[0].y = kernel.packet[1].x; - kernel.packet[1].x = tmp; - - tmp = kernel.packet[0].z; - kernel.packet[0].z = kernel.packet[2].x; - kernel.packet[2].x = tmp; - - tmp = kernel.packet[0].w; - kernel.packet[0].w = kernel.packet[3].x; - kernel.packet[3].x = tmp; - - tmp = kernel.packet[1].z; - kernel.packet[1].z = kernel.packet[2].y; - kernel.packet[2].y = tmp; - - tmp = kernel.packet[1].w; - kernel.packet[1].w = kernel.packet[3].y; - kernel.packet[3].y = tmp; - - tmp = kernel.packet[2].w; - kernel.packet[2].w = kernel.packet[3].z; - kernel.packet[3].z = tmp; -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - double tmp = kernel.packet[0].y; - kernel.packet[0].y = kernel.packet[1].x; - kernel.packet[1].x = tmp; -} - -#endif - -} // end namespace internal - -} // end namespace Eigen - - -#endif // EIGEN_PACKET_MATH_CUDA_H diff --git a/Eigen/src/Core/arch/CUDA/PacketMathHalf.h b/Eigen/src/Core/arch/CUDA/PacketMathHalf.h deleted file mode 100644 index 8a6f209c4..000000000 --- a/Eigen/src/Core/arch/CUDA/PacketMathHalf.h +++ /dev/null @@ -1,1133 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2016 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_HALF_CUDA_H -#define EIGEN_PACKET_MATH_HALF_CUDA_H - - -namespace Eigen { -namespace internal { - -// Most of the following operations require arch >= 3.0 -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDACC) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - -template<> struct is_arithmetic { enum { value = true }; }; - -template<> struct packet_traits : default_packet_traits -{ - typedef half2 type; - typedef half2 half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=2, - HasHalfPacket = 0, - HasAdd = 1, - HasMul = 1, - HasDiv = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasExp = 1, - HasExpm1 = 1, - HasLog = 1, - HasLog1p = 1 - }; -}; - -template<> struct unpacket_traits { typedef Eigen::half type; enum {size=2, alignment=Aligned16}; typedef half2 half; }; - -template<> __device__ EIGEN_STRONG_INLINE half2 pset1(const Eigen::half& from) { - return __half2half2(from); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pload(const Eigen::half* from) { - return *reinterpret_cast(from); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 ploadu(const Eigen::half* from) { - return __halves2half2(from[0], from[1]); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 ploaddup(const Eigen::half* from) { - return __halves2half2(from[0], from[0]); -} - -template<> __device__ EIGEN_STRONG_INLINE void pstore(Eigen::half* to, const half2& from) { - *reinterpret_cast(to) = from; -} - -template<> __device__ EIGEN_STRONG_INLINE void pstoreu(Eigen::half* to, const half2& from) { - to[0] = __low2half(from); - to[1] = __high2half(from); -} - -template<> - __device__ EIGEN_ALWAYS_INLINE half2 ploadt_ro(const Eigen::half* from) { -#if EIGEN_CUDA_ARCH >= 350 - return __ldg((const half2*)from); -#else - return __halves2half2(*(from+0), *(from+1)); -#endif -} - -template<> -__device__ EIGEN_ALWAYS_INLINE half2 ploadt_ro(const Eigen::half* from) { -#if EIGEN_CUDA_ARCH >= 350 - return __halves2half2(__ldg(from+0), __ldg(from+1)); -#else - return __halves2half2(*(from+0), *(from+1)); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pgather(const Eigen::half* from, Index stride) { - return __halves2half2(from[0*stride], from[1*stride]); -} - -template<> __device__ EIGEN_STRONG_INLINE void pscatter(Eigen::half* to, const half2& from, Index stride) { - to[stride*0] = __low2half(from); - to[stride*1] = __high2half(from); -} - -template<> __device__ EIGEN_STRONG_INLINE Eigen::half pfirst(const half2& a) { - return __low2half(a); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pabs(const half2& a) { - half2 result; - unsigned temp = *(reinterpret_cast(&(a))); - *(reinterpret_cast(&(result))) = temp & 0x7FFF7FFF; - return result; -} - - -__device__ EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - __half a1 = __low2half(kernel.packet[0]); - __half a2 = __high2half(kernel.packet[0]); - __half b1 = __low2half(kernel.packet[1]); - __half b2 = __high2half(kernel.packet[1]); - kernel.packet[0] = __halves2half2(a1, b1); - kernel.packet[1] = __halves2half2(a2, b2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 plset(const Eigen::half& a) { -#if EIGEN_CUDA_ARCH >= 530 - return __halves2half2(a, __hadd(a, __float2half(1.0f))); -#else - float f = __half2float(a) + 1.0f; - return __halves2half2(a, __float2half(f)); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 padd(const half2& a, const half2& b) { -#if EIGEN_CUDA_ARCH >= 530 - return __hadd2(a, b); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - float r1 = a1 + b1; - float r2 = a2 + b2; - return __floats2half2_rn(r1, r2); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 psub(const half2& a, const half2& b) { -#if EIGEN_CUDA_ARCH >= 530 - return __hsub2(a, b); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - float r1 = a1 - b1; - float r2 = a2 - b2; - return __floats2half2_rn(r1, r2); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pnegate(const half2& a) { -#if EIGEN_CUDA_ARCH >= 530 - return __hneg2(a); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - return __floats2half2_rn(-a1, -a2); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pconj(const half2& a) { return a; } - -template<> __device__ EIGEN_STRONG_INLINE half2 pmul(const half2& a, const half2& b) { -#if EIGEN_CUDA_ARCH >= 530 - return __hmul2(a, b); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - float r1 = a1 * b1; - float r2 = a2 * b2; - return __floats2half2_rn(r1, r2); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pmadd(const half2& a, const half2& b, const half2& c) { -#if EIGEN_CUDA_ARCH >= 530 - return __hfma2(a, b, c); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - float c1 = __low2float(c); - float c2 = __high2float(c); - float r1 = a1 * b1 + c1; - float r2 = a2 * b2 + c2; - return __floats2half2_rn(r1, r2); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pdiv(const half2& a, const half2& b) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - float r1 = a1 / b1; - float r2 = a2 / b2; - return __floats2half2_rn(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pmin(const half2& a, const half2& b) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - __half r1 = a1 < b1 ? __low2half(a) : __low2half(b); - __half r2 = a2 < b2 ? __high2half(a) : __high2half(b); - return __halves2half2(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pmax(const half2& a, const half2& b) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float b1 = __low2float(b); - float b2 = __high2float(b); - __half r1 = a1 > b1 ? __low2half(a) : __low2half(b); - __half r2 = a2 > b2 ? __high2half(a) : __high2half(b); - return __halves2half2(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE Eigen::half predux(const half2& a) { -#if EIGEN_CUDA_ARCH >= 530 - return __hadd(__low2half(a), __high2half(a)); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - return Eigen::half(__float2half(a1 + a2)); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE Eigen::half predux_max(const half2& a) { -#if EIGEN_CUDA_ARCH >= 530 - __half first = __low2half(a); - __half second = __high2half(a); - return __hgt(first, second) ? first : second; -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - return a1 > a2 ? __low2half(a) : __high2half(a); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE Eigen::half predux_min(const half2& a) { -#if EIGEN_CUDA_ARCH >= 530 - __half first = __low2half(a); - __half second = __high2half(a); - return __hlt(first, second) ? first : second; -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - return a1 < a2 ? __low2half(a) : __high2half(a); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE Eigen::half predux_mul(const half2& a) { -#if EIGEN_CUDA_ARCH >= 530 - return __hmul(__low2half(a), __high2half(a)); -#else - float a1 = __low2float(a); - float a2 = __high2float(a); - return Eigen::half(__float2half(a1 * a2)); -#endif -} - -template<> __device__ EIGEN_STRONG_INLINE half2 plog1p(const half2& a) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float r1 = log1pf(a1); - float r2 = log1pf(a2); - return __floats2half2_rn(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pexpm1(const half2& a) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float r1 = expm1f(a1); - float r2 = expm1f(a2); - return __floats2half2_rn(r1, r2); -} - -#if EIGEN_CUDACC_VER >= 80000 && defined EIGEN_CUDA_ARCH && EIGEN_CUDA_ARCH >= 530 - -template<> __device__ EIGEN_STRONG_INLINE -half2 plog(const half2& a) { - return h2log(a); -} - -template<> __device__ EIGEN_STRONG_INLINE -half2 pexp(const half2& a) { - return h2exp(a); -} - -template<> __device__ EIGEN_STRONG_INLINE -half2 psqrt(const half2& a) { - return h2sqrt(a); -} - -template<> __device__ EIGEN_STRONG_INLINE -half2 prsqrt(const half2& a) { - return h2rsqrt(a); -} - -#else - -template<> __device__ EIGEN_STRONG_INLINE half2 plog(const half2& a) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float r1 = logf(a1); - float r2 = logf(a2); - return __floats2half2_rn(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 pexp(const half2& a) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float r1 = expf(a1); - float r2 = expf(a2); - return __floats2half2_rn(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 psqrt(const half2& a) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float r1 = sqrtf(a1); - float r2 = sqrtf(a2); - return __floats2half2_rn(r1, r2); -} - -template<> __device__ EIGEN_STRONG_INLINE half2 prsqrt(const half2& a) { - float a1 = __low2float(a); - float a2 = __high2float(a); - float r1 = rsqrtf(a1); - float r2 = rsqrtf(a2); - return __floats2half2_rn(r1, r2); -} - -#endif - -#elif defined EIGEN_VECTORIZE_AVX512 - -typedef struct { - __m256i x; -} Packet16h; - - -template<> struct is_arithmetic { enum { value = true }; }; - -template <> -struct packet_traits : default_packet_traits { - typedef Packet16h type; - // There is no half-size packet for Packet16h. - typedef Packet16h half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 16, - HasHalfPacket = 0, - HasAdd = 0, - HasSub = 0, - HasMul = 0, - HasNegate = 0, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasConj = 0, - HasSetLinear = 0, - HasDiv = 0, - HasSqrt = 0, - HasRsqrt = 0, - HasExp = 0, - HasLog = 0, - HasBlend = 0 - }; -}; - - -template<> struct unpacket_traits { typedef Eigen::half type; enum {size=16, alignment=Aligned32}; typedef Packet16h half; }; - -template<> EIGEN_STRONG_INLINE Packet16h pset1(const Eigen::half& from) { - Packet16h result; - result.x = _mm256_set1_epi16(from.x); - return result; -} - -template<> EIGEN_STRONG_INLINE Eigen::half pfirst(const Packet16h& from) { - return half_impl::raw_uint16_to_half(static_cast(_mm256_extract_epi16(from.x, 0))); -} - -template<> EIGEN_STRONG_INLINE Packet16h pload(const Eigen::half* from) { - Packet16h result; - result.x = _mm256_load_si256(reinterpret_cast(from)); - return result; -} - -template<> EIGEN_STRONG_INLINE Packet16h ploadu(const Eigen::half* from) { - Packet16h result; - result.x = _mm256_loadu_si256(reinterpret_cast(from)); - return result; -} - -template<> EIGEN_STRONG_INLINE void pstore(Eigen::half* to, const Packet16h& from) { - _mm256_store_si256((__m256i*)to, from.x); -} - -template<> EIGEN_STRONG_INLINE void pstoreu(Eigen::half* to, const Packet16h& from) { - _mm256_storeu_si256((__m256i*)to, from.x); -} - -template<> EIGEN_STRONG_INLINE Packet16h -ploadquad(const Eigen::half* from) { - Packet16h result; - unsigned short a = from[0].x; - unsigned short b = from[1].x; - unsigned short c = from[2].x; - unsigned short d = from[3].x; - result.x = _mm256_set_epi16(d, d, d, d, c, c, c, c, b, b, b, b, a, a, a, a); - return result; -} - -EIGEN_STRONG_INLINE Packet16f half2float(const Packet16h& a) { -#ifdef EIGEN_HAS_FP16_C - return _mm512_cvtph_ps(a.x); -#else - EIGEN_ALIGN64 half aux[16]; - pstore(aux, a); - float f0(aux[0]); - float f1(aux[1]); - float f2(aux[2]); - float f3(aux[3]); - float f4(aux[4]); - float f5(aux[5]); - float f6(aux[6]); - float f7(aux[7]); - float f8(aux[8]); - float f9(aux[9]); - float fa(aux[10]); - float fb(aux[11]); - float fc(aux[12]); - float fd(aux[13]); - float fe(aux[14]); - float ff(aux[15]); - - return _mm512_set_ps( - ff, fe, fd, fc, fb, fa, f9, f8, f7, f6, f5, f4, f3, f2, f1, f0); -#endif -} - -EIGEN_STRONG_INLINE Packet16h float2half(const Packet16f& a) { -#ifdef EIGEN_HAS_FP16_C - Packet16h result; - result.x = _mm512_cvtps_ph(a, _MM_FROUND_TO_NEAREST_INT|_MM_FROUND_NO_EXC); - return result; -#else - EIGEN_ALIGN64 float aux[16]; - pstore(aux, a); - half h0(aux[0]); - half h1(aux[1]); - half h2(aux[2]); - half h3(aux[3]); - half h4(aux[4]); - half h5(aux[5]); - half h6(aux[6]); - half h7(aux[7]); - half h8(aux[8]); - half h9(aux[9]); - half ha(aux[10]); - half hb(aux[11]); - half hc(aux[12]); - half hd(aux[13]); - half he(aux[14]); - half hf(aux[15]); - - Packet16h result; - result.x = _mm256_set_epi16( - hf.x, he.x, hd.x, hc.x, hb.x, ha.x, h9.x, h8.x, - h7.x, h6.x, h5.x, h4.x, h3.x, h2.x, h1.x, h0.x); - return result; -#endif -} - -template<> EIGEN_STRONG_INLINE Packet16h padd(const Packet16h& a, const Packet16h& b) { - Packet16f af = half2float(a); - Packet16f bf = half2float(b); - Packet16f rf = padd(af, bf); - return float2half(rf); -} - -template<> EIGEN_STRONG_INLINE Packet16h pmul(const Packet16h& a, const Packet16h& b) { - Packet16f af = half2float(a); - Packet16f bf = half2float(b); - Packet16f rf = pmul(af, bf); - return float2half(rf); -} - -template<> EIGEN_STRONG_INLINE half predux(const Packet16h& from) { - Packet16f from_float = half2float(from); - return half(predux(from_float)); -} - -template<> EIGEN_STRONG_INLINE Packet16h pgather(const Eigen::half* from, Index stride) -{ - Packet16h result; - result.x = _mm256_set_epi16( - from[15*stride].x, from[14*stride].x, from[13*stride].x, from[12*stride].x, - from[11*stride].x, from[10*stride].x, from[9*stride].x, from[8*stride].x, - from[7*stride].x, from[6*stride].x, from[5*stride].x, from[4*stride].x, - from[3*stride].x, from[2*stride].x, from[1*stride].x, from[0*stride].x); - return result; -} - -template<> EIGEN_STRONG_INLINE void pscatter(half* to, const Packet16h& from, Index stride) -{ - EIGEN_ALIGN64 half aux[16]; - pstore(aux, from); - to[stride*0].x = aux[0].x; - to[stride*1].x = aux[1].x; - to[stride*2].x = aux[2].x; - to[stride*3].x = aux[3].x; - to[stride*4].x = aux[4].x; - to[stride*5].x = aux[5].x; - to[stride*6].x = aux[6].x; - to[stride*7].x = aux[7].x; - to[stride*8].x = aux[8].x; - to[stride*9].x = aux[9].x; - to[stride*10].x = aux[10].x; - to[stride*11].x = aux[11].x; - to[stride*12].x = aux[12].x; - to[stride*13].x = aux[13].x; - to[stride*14].x = aux[14].x; - to[stride*15].x = aux[15].x; -} - -EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - __m256i a = kernel.packet[0].x; - __m256i b = kernel.packet[1].x; - __m256i c = kernel.packet[2].x; - __m256i d = kernel.packet[3].x; - __m256i e = kernel.packet[4].x; - __m256i f = kernel.packet[5].x; - __m256i g = kernel.packet[6].x; - __m256i h = kernel.packet[7].x; - __m256i i = kernel.packet[8].x; - __m256i j = kernel.packet[9].x; - __m256i k = kernel.packet[10].x; - __m256i l = kernel.packet[11].x; - __m256i m = kernel.packet[12].x; - __m256i n = kernel.packet[13].x; - __m256i o = kernel.packet[14].x; - __m256i p = kernel.packet[15].x; - - __m256i ab_07 = _mm256_unpacklo_epi16(a, b); - __m256i cd_07 = _mm256_unpacklo_epi16(c, d); - __m256i ef_07 = _mm256_unpacklo_epi16(e, f); - __m256i gh_07 = _mm256_unpacklo_epi16(g, h); - __m256i ij_07 = _mm256_unpacklo_epi16(i, j); - __m256i kl_07 = _mm256_unpacklo_epi16(k, l); - __m256i mn_07 = _mm256_unpacklo_epi16(m, n); - __m256i op_07 = _mm256_unpacklo_epi16(o, p); - - __m256i ab_8f = _mm256_unpackhi_epi16(a, b); - __m256i cd_8f = _mm256_unpackhi_epi16(c, d); - __m256i ef_8f = _mm256_unpackhi_epi16(e, f); - __m256i gh_8f = _mm256_unpackhi_epi16(g, h); - __m256i ij_8f = _mm256_unpackhi_epi16(i, j); - __m256i kl_8f = _mm256_unpackhi_epi16(k, l); - __m256i mn_8f = _mm256_unpackhi_epi16(m, n); - __m256i op_8f = _mm256_unpackhi_epi16(o, p); - - __m256i abcd_03 = _mm256_unpacklo_epi32(ab_07, cd_07); - __m256i abcd_47 = _mm256_unpackhi_epi32(ab_07, cd_07); - __m256i efgh_03 = _mm256_unpacklo_epi32(ef_07, gh_07); - __m256i efgh_47 = _mm256_unpackhi_epi32(ef_07, gh_07); - __m256i ijkl_03 = _mm256_unpacklo_epi32(ij_07, kl_07); - __m256i ijkl_47 = _mm256_unpackhi_epi32(ij_07, kl_07); - __m256i mnop_03 = _mm256_unpacklo_epi32(mn_07, op_07); - __m256i mnop_47 = _mm256_unpackhi_epi32(mn_07, op_07); - - __m256i abcd_8b = _mm256_unpacklo_epi32(ab_8f, cd_8f); - __m256i abcd_cf = _mm256_unpackhi_epi32(ab_8f, cd_8f); - __m256i efgh_8b = _mm256_unpacklo_epi32(ef_8f, gh_8f); - __m256i efgh_cf = _mm256_unpackhi_epi32(ef_8f, gh_8f); - __m256i ijkl_8b = _mm256_unpacklo_epi32(ij_8f, kl_8f); - __m256i ijkl_cf = _mm256_unpackhi_epi32(ij_8f, kl_8f); - __m256i mnop_8b = _mm256_unpacklo_epi32(mn_8f, op_8f); - __m256i mnop_cf = _mm256_unpackhi_epi32(mn_8f, op_8f); - - __m256i abcdefgh_01 = _mm256_unpacklo_epi64(abcd_03, efgh_03); - __m256i abcdefgh_23 = _mm256_unpackhi_epi64(abcd_03, efgh_03); - __m256i ijklmnop_01 = _mm256_unpacklo_epi64(ijkl_03, mnop_03); - __m256i ijklmnop_23 = _mm256_unpackhi_epi64(ijkl_03, mnop_03); - __m256i abcdefgh_45 = _mm256_unpacklo_epi64(abcd_47, efgh_47); - __m256i abcdefgh_67 = _mm256_unpackhi_epi64(abcd_47, efgh_47); - __m256i ijklmnop_45 = _mm256_unpacklo_epi64(ijkl_47, mnop_47); - __m256i ijklmnop_67 = _mm256_unpackhi_epi64(ijkl_47, mnop_47); - __m256i abcdefgh_89 = _mm256_unpacklo_epi64(abcd_8b, efgh_8b); - __m256i abcdefgh_ab = _mm256_unpackhi_epi64(abcd_8b, efgh_8b); - __m256i ijklmnop_89 = _mm256_unpacklo_epi64(ijkl_8b, mnop_8b); - __m256i ijklmnop_ab = _mm256_unpackhi_epi64(ijkl_8b, mnop_8b); - __m256i abcdefgh_cd = _mm256_unpacklo_epi64(abcd_cf, efgh_cf); - __m256i abcdefgh_ef = _mm256_unpackhi_epi64(abcd_cf, efgh_cf); - __m256i ijklmnop_cd = _mm256_unpacklo_epi64(ijkl_cf, mnop_cf); - __m256i ijklmnop_ef = _mm256_unpackhi_epi64(ijkl_cf, mnop_cf); - - // NOTE: no unpacklo/hi instr in this case, so using permute instr. - __m256i a_p_0 = _mm256_permute2x128_si256(abcdefgh_01, ijklmnop_01, 0x20); - __m256i a_p_1 = _mm256_permute2x128_si256(abcdefgh_01, ijklmnop_01, 0x31); - __m256i a_p_2 = _mm256_permute2x128_si256(abcdefgh_23, ijklmnop_23, 0x20); - __m256i a_p_3 = _mm256_permute2x128_si256(abcdefgh_23, ijklmnop_23, 0x31); - __m256i a_p_4 = _mm256_permute2x128_si256(abcdefgh_45, ijklmnop_45, 0x20); - __m256i a_p_5 = _mm256_permute2x128_si256(abcdefgh_45, ijklmnop_45, 0x31); - __m256i a_p_6 = _mm256_permute2x128_si256(abcdefgh_67, ijklmnop_67, 0x20); - __m256i a_p_7 = _mm256_permute2x128_si256(abcdefgh_67, ijklmnop_67, 0x31); - __m256i a_p_8 = _mm256_permute2x128_si256(abcdefgh_89, ijklmnop_89, 0x20); - __m256i a_p_9 = _mm256_permute2x128_si256(abcdefgh_89, ijklmnop_89, 0x31); - __m256i a_p_a = _mm256_permute2x128_si256(abcdefgh_ab, ijklmnop_ab, 0x20); - __m256i a_p_b = _mm256_permute2x128_si256(abcdefgh_ab, ijklmnop_ab, 0x31); - __m256i a_p_c = _mm256_permute2x128_si256(abcdefgh_cd, ijklmnop_cd, 0x20); - __m256i a_p_d = _mm256_permute2x128_si256(abcdefgh_cd, ijklmnop_cd, 0x31); - __m256i a_p_e = _mm256_permute2x128_si256(abcdefgh_ef, ijklmnop_ef, 0x20); - __m256i a_p_f = _mm256_permute2x128_si256(abcdefgh_ef, ijklmnop_ef, 0x31); - - kernel.packet[0].x = a_p_0; - kernel.packet[1].x = a_p_1; - kernel.packet[2].x = a_p_2; - kernel.packet[3].x = a_p_3; - kernel.packet[4].x = a_p_4; - kernel.packet[5].x = a_p_5; - kernel.packet[6].x = a_p_6; - kernel.packet[7].x = a_p_7; - kernel.packet[8].x = a_p_8; - kernel.packet[9].x = a_p_9; - kernel.packet[10].x = a_p_a; - kernel.packet[11].x = a_p_b; - kernel.packet[12].x = a_p_c; - kernel.packet[13].x = a_p_d; - kernel.packet[14].x = a_p_e; - kernel.packet[15].x = a_p_f; -} - -EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - EIGEN_ALIGN64 half in[8][16]; - pstore(in[0], kernel.packet[0]); - pstore(in[1], kernel.packet[1]); - pstore(in[2], kernel.packet[2]); - pstore(in[3], kernel.packet[3]); - pstore(in[4], kernel.packet[4]); - pstore(in[5], kernel.packet[5]); - pstore(in[6], kernel.packet[6]); - pstore(in[7], kernel.packet[7]); - - EIGEN_ALIGN64 half out[8][16]; - - for (int i = 0; i < 8; ++i) { - for (int j = 0; j < 8; ++j) { - out[i][j] = in[j][2*i]; - } - for (int j = 0; j < 8; ++j) { - out[i][j+8] = in[j][2*i+1]; - } - } - - kernel.packet[0] = pload(out[0]); - kernel.packet[1] = pload(out[1]); - kernel.packet[2] = pload(out[2]); - kernel.packet[3] = pload(out[3]); - kernel.packet[4] = pload(out[4]); - kernel.packet[5] = pload(out[5]); - kernel.packet[6] = pload(out[6]); - kernel.packet[7] = pload(out[7]); -} - -EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - EIGEN_ALIGN64 half in[4][16]; - pstore(in[0], kernel.packet[0]); - pstore(in[1], kernel.packet[1]); - pstore(in[2], kernel.packet[2]); - pstore(in[3], kernel.packet[3]); - - EIGEN_ALIGN64 half out[4][16]; - - for (int i = 0; i < 4; ++i) { - for (int j = 0; j < 4; ++j) { - out[i][j] = in[j][4*i]; - } - for (int j = 0; j < 4; ++j) { - out[i][j+4] = in[j][4*i+1]; - } - for (int j = 0; j < 4; ++j) { - out[i][j+8] = in[j][4*i+2]; - } - for (int j = 0; j < 4; ++j) { - out[i][j+12] = in[j][4*i+3]; - } - } - - kernel.packet[0] = pload(out[0]); - kernel.packet[1] = pload(out[1]); - kernel.packet[2] = pload(out[2]); - kernel.packet[3] = pload(out[3]); -} - - -#elif defined EIGEN_VECTORIZE_AVX - -typedef struct { - __m128i x; -} Packet8h; - - -template<> struct is_arithmetic { enum { value = true }; }; - -template <> -struct packet_traits : default_packet_traits { - typedef Packet8h type; - // There is no half-size packet for Packet8h. - typedef Packet8h half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 8, - HasHalfPacket = 0, - HasAdd = 0, - HasSub = 0, - HasMul = 0, - HasNegate = 0, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasConj = 0, - HasSetLinear = 0, - HasDiv = 0, - HasSqrt = 0, - HasRsqrt = 0, - HasExp = 0, - HasLog = 0, - HasBlend = 0 - }; -}; - - -template<> struct unpacket_traits { typedef Eigen::half type; enum {size=8, alignment=Aligned16}; typedef Packet8h half; }; - -template<> EIGEN_STRONG_INLINE Packet8h pset1(const Eigen::half& from) { - Packet8h result; - result.x = _mm_set1_epi16(from.x); - return result; -} - -template<> EIGEN_STRONG_INLINE Eigen::half pfirst(const Packet8h& from) { - return half_impl::raw_uint16_to_half(static_cast(_mm_extract_epi16(from.x, 0))); -} - -template<> EIGEN_STRONG_INLINE Packet8h pload(const Eigen::half* from) { - Packet8h result; - result.x = _mm_load_si128(reinterpret_cast(from)); - return result; -} - -template<> EIGEN_STRONG_INLINE Packet8h ploadu(const Eigen::half* from) { - Packet8h result; - result.x = _mm_loadu_si128(reinterpret_cast(from)); - return result; -} - -template<> EIGEN_STRONG_INLINE void pstore(Eigen::half* to, const Packet8h& from) { - _mm_store_si128(reinterpret_cast<__m128i*>(to), from.x); -} - -template<> EIGEN_STRONG_INLINE void pstoreu(Eigen::half* to, const Packet8h& from) { - _mm_storeu_si128(reinterpret_cast<__m128i*>(to), from.x); -} - -template<> EIGEN_STRONG_INLINE Packet8h -ploadquad(const Eigen::half* from) { - Packet8h result; - unsigned short a = from[0].x; - unsigned short b = from[1].x; - result.x = _mm_set_epi16(b, b, b, b, a, a, a, a); - return result; -} - -EIGEN_STRONG_INLINE Packet8f half2float(const Packet8h& a) { -#ifdef EIGEN_HAS_FP16_C - return _mm256_cvtph_ps(a.x); -#else - EIGEN_ALIGN32 Eigen::half aux[8]; - pstore(aux, a); - float f0(aux[0]); - float f1(aux[1]); - float f2(aux[2]); - float f3(aux[3]); - float f4(aux[4]); - float f5(aux[5]); - float f6(aux[6]); - float f7(aux[7]); - - return _mm256_set_ps(f7, f6, f5, f4, f3, f2, f1, f0); -#endif -} - -EIGEN_STRONG_INLINE Packet8h float2half(const Packet8f& a) { -#ifdef EIGEN_HAS_FP16_C - Packet8h result; - result.x = _mm256_cvtps_ph(a, _MM_FROUND_TO_NEAREST_INT|_MM_FROUND_NO_EXC); - return result; -#else - EIGEN_ALIGN32 float aux[8]; - pstore(aux, a); - Eigen::half h0(aux[0]); - Eigen::half h1(aux[1]); - Eigen::half h2(aux[2]); - Eigen::half h3(aux[3]); - Eigen::half h4(aux[4]); - Eigen::half h5(aux[5]); - Eigen::half h6(aux[6]); - Eigen::half h7(aux[7]); - - Packet8h result; - result.x = _mm_set_epi16(h7.x, h6.x, h5.x, h4.x, h3.x, h2.x, h1.x, h0.x); - return result; -#endif -} - -template<> EIGEN_STRONG_INLINE Packet8h pconj(const Packet8h& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet8h padd(const Packet8h& a, const Packet8h& b) { - Packet8f af = half2float(a); - Packet8f bf = half2float(b); - Packet8f rf = padd(af, bf); - return float2half(rf); -} - -template<> EIGEN_STRONG_INLINE Packet8h pmul(const Packet8h& a, const Packet8h& b) { - Packet8f af = half2float(a); - Packet8f bf = half2float(b); - Packet8f rf = pmul(af, bf); - return float2half(rf); -} - -template<> EIGEN_STRONG_INLINE Packet8h pgather(const Eigen::half* from, Index stride) -{ - Packet8h result; - result.x = _mm_set_epi16(from[7*stride].x, from[6*stride].x, from[5*stride].x, from[4*stride].x, from[3*stride].x, from[2*stride].x, from[1*stride].x, from[0*stride].x); - return result; -} - -template<> EIGEN_STRONG_INLINE void pscatter(Eigen::half* to, const Packet8h& from, Index stride) -{ - EIGEN_ALIGN32 Eigen::half aux[8]; - pstore(aux, from); - to[stride*0].x = aux[0].x; - to[stride*1].x = aux[1].x; - to[stride*2].x = aux[2].x; - to[stride*3].x = aux[3].x; - to[stride*4].x = aux[4].x; - to[stride*5].x = aux[5].x; - to[stride*6].x = aux[6].x; - to[stride*7].x = aux[7].x; -} - -template<> EIGEN_STRONG_INLINE Eigen::half predux(const Packet8h& a) { - Packet8f af = half2float(a); - float reduced = predux(af); - return Eigen::half(reduced); -} - -template<> EIGEN_STRONG_INLINE Eigen::half predux_max(const Packet8h& a) { - Packet8f af = half2float(a); - float reduced = predux_max(af); - return Eigen::half(reduced); -} - -template<> EIGEN_STRONG_INLINE Eigen::half predux_min(const Packet8h& a) { - Packet8f af = half2float(a); - float reduced = predux_min(af); - return Eigen::half(reduced); -} - -template<> EIGEN_STRONG_INLINE Eigen::half predux_mul(const Packet8h& a) { - Packet8f af = half2float(a); - float reduced = predux_mul(af); - return Eigen::half(reduced); -} - -EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - __m128i a = kernel.packet[0].x; - __m128i b = kernel.packet[1].x; - __m128i c = kernel.packet[2].x; - __m128i d = kernel.packet[3].x; - __m128i e = kernel.packet[4].x; - __m128i f = kernel.packet[5].x; - __m128i g = kernel.packet[6].x; - __m128i h = kernel.packet[7].x; - - __m128i a03b03 = _mm_unpacklo_epi16(a, b); - __m128i c03d03 = _mm_unpacklo_epi16(c, d); - __m128i e03f03 = _mm_unpacklo_epi16(e, f); - __m128i g03h03 = _mm_unpacklo_epi16(g, h); - __m128i a47b47 = _mm_unpackhi_epi16(a, b); - __m128i c47d47 = _mm_unpackhi_epi16(c, d); - __m128i e47f47 = _mm_unpackhi_epi16(e, f); - __m128i g47h47 = _mm_unpackhi_epi16(g, h); - - __m128i a01b01c01d01 = _mm_unpacklo_epi32(a03b03, c03d03); - __m128i a23b23c23d23 = _mm_unpackhi_epi32(a03b03, c03d03); - __m128i e01f01g01h01 = _mm_unpacklo_epi32(e03f03, g03h03); - __m128i e23f23g23h23 = _mm_unpackhi_epi32(e03f03, g03h03); - __m128i a45b45c45d45 = _mm_unpacklo_epi32(a47b47, c47d47); - __m128i a67b67c67d67 = _mm_unpackhi_epi32(a47b47, c47d47); - __m128i e45f45g45h45 = _mm_unpacklo_epi32(e47f47, g47h47); - __m128i e67f67g67h67 = _mm_unpackhi_epi32(e47f47, g47h47); - - __m128i a0b0c0d0e0f0g0h0 = _mm_unpacklo_epi64(a01b01c01d01, e01f01g01h01); - __m128i a1b1c1d1e1f1g1h1 = _mm_unpackhi_epi64(a01b01c01d01, e01f01g01h01); - __m128i a2b2c2d2e2f2g2h2 = _mm_unpacklo_epi64(a23b23c23d23, e23f23g23h23); - __m128i a3b3c3d3e3f3g3h3 = _mm_unpackhi_epi64(a23b23c23d23, e23f23g23h23); - __m128i a4b4c4d4e4f4g4h4 = _mm_unpacklo_epi64(a45b45c45d45, e45f45g45h45); - __m128i a5b5c5d5e5f5g5h5 = _mm_unpackhi_epi64(a45b45c45d45, e45f45g45h45); - __m128i a6b6c6d6e6f6g6h6 = _mm_unpacklo_epi64(a67b67c67d67, e67f67g67h67); - __m128i a7b7c7d7e7f7g7h7 = _mm_unpackhi_epi64(a67b67c67d67, e67f67g67h67); - - kernel.packet[0].x = a0b0c0d0e0f0g0h0; - kernel.packet[1].x = a1b1c1d1e1f1g1h1; - kernel.packet[2].x = a2b2c2d2e2f2g2h2; - kernel.packet[3].x = a3b3c3d3e3f3g3h3; - kernel.packet[4].x = a4b4c4d4e4f4g4h4; - kernel.packet[5].x = a5b5c5d5e5f5g5h5; - kernel.packet[6].x = a6b6c6d6e6f6g6h6; - kernel.packet[7].x = a7b7c7d7e7f7g7h7; -} - -EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - EIGEN_ALIGN32 Eigen::half in[4][8]; - pstore(in[0], kernel.packet[0]); - pstore(in[1], kernel.packet[1]); - pstore(in[2], kernel.packet[2]); - pstore(in[3], kernel.packet[3]); - - EIGEN_ALIGN32 Eigen::half out[4][8]; - - for (int i = 0; i < 4; ++i) { - for (int j = 0; j < 4; ++j) { - out[i][j] = in[j][2*i]; - } - for (int j = 0; j < 4; ++j) { - out[i][j+4] = in[j][2*i+1]; - } - } - - kernel.packet[0] = pload(out[0]); - kernel.packet[1] = pload(out[1]); - kernel.packet[2] = pload(out[2]); - kernel.packet[3] = pload(out[3]); -} - - -// Disable the following code since it's broken on too many platforms / compilers. -//#elif defined(EIGEN_VECTORIZE_SSE) && (!EIGEN_ARCH_x86_64) && (!EIGEN_COMP_MSVC) -#elif 0 - -typedef struct { - __m64 x; -} Packet4h; - - -template<> struct is_arithmetic { enum { value = true }; }; - -template <> -struct packet_traits : default_packet_traits { - typedef Packet4h type; - // There is no half-size packet for Packet4h. - typedef Packet4h half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 4, - HasHalfPacket = 0, - HasAdd = 0, - HasSub = 0, - HasMul = 0, - HasNegate = 0, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasConj = 0, - HasSetLinear = 0, - HasDiv = 0, - HasSqrt = 0, - HasRsqrt = 0, - HasExp = 0, - HasLog = 0, - HasBlend = 0 - }; -}; - - -template<> struct unpacket_traits { typedef Eigen::half type; enum {size=4, alignment=Aligned16}; typedef Packet4h half; }; - -template<> EIGEN_STRONG_INLINE Packet4h pset1(const Eigen::half& from) { - Packet4h result; - result.x = _mm_set1_pi16(from.x); - return result; -} - -template<> EIGEN_STRONG_INLINE Eigen::half pfirst(const Packet4h& from) { - return half_impl::raw_uint16_to_half(static_cast(_mm_cvtsi64_si32(from.x))); -} - -template<> EIGEN_STRONG_INLINE Packet4h pconj(const Packet4h& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet4h padd(const Packet4h& a, const Packet4h& b) { - __int64_t a64 = _mm_cvtm64_si64(a.x); - __int64_t b64 = _mm_cvtm64_si64(b.x); - - Eigen::half h[4]; - - Eigen::half ha = half_impl::raw_uint16_to_half(static_cast(a64)); - Eigen::half hb = half_impl::raw_uint16_to_half(static_cast(b64)); - h[0] = ha + hb; - ha = half_impl::raw_uint16_to_half(static_cast(a64 >> 16)); - hb = half_impl::raw_uint16_to_half(static_cast(b64 >> 16)); - h[1] = ha + hb; - ha = half_impl::raw_uint16_to_half(static_cast(a64 >> 32)); - hb = half_impl::raw_uint16_to_half(static_cast(b64 >> 32)); - h[2] = ha + hb; - ha = half_impl::raw_uint16_to_half(static_cast(a64 >> 48)); - hb = half_impl::raw_uint16_to_half(static_cast(b64 >> 48)); - h[3] = ha + hb; - Packet4h result; - result.x = _mm_set_pi16(h[3].x, h[2].x, h[1].x, h[0].x); - return result; -} - -template<> EIGEN_STRONG_INLINE Packet4h pmul(const Packet4h& a, const Packet4h& b) { - __int64_t a64 = _mm_cvtm64_si64(a.x); - __int64_t b64 = _mm_cvtm64_si64(b.x); - - Eigen::half h[4]; - - Eigen::half ha = half_impl::raw_uint16_to_half(static_cast(a64)); - Eigen::half hb = half_impl::raw_uint16_to_half(static_cast(b64)); - h[0] = ha * hb; - ha = half_impl::raw_uint16_to_half(static_cast(a64 >> 16)); - hb = half_impl::raw_uint16_to_half(static_cast(b64 >> 16)); - h[1] = ha * hb; - ha = half_impl::raw_uint16_to_half(static_cast(a64 >> 32)); - hb = half_impl::raw_uint16_to_half(static_cast(b64 >> 32)); - h[2] = ha * hb; - ha = half_impl::raw_uint16_to_half(static_cast(a64 >> 48)); - hb = half_impl::raw_uint16_to_half(static_cast(b64 >> 48)); - h[3] = ha * hb; - Packet4h result; - result.x = _mm_set_pi16(h[3].x, h[2].x, h[1].x, h[0].x); - return result; -} - -template<> EIGEN_STRONG_INLINE Packet4h pload(const Eigen::half* from) { - Packet4h result; - result.x = _mm_cvtsi64_m64(*reinterpret_cast(from)); - return result; -} - -template<> EIGEN_STRONG_INLINE Packet4h ploadu(const Eigen::half* from) { - Packet4h result; - result.x = _mm_cvtsi64_m64(*reinterpret_cast(from)); - return result; -} - -template<> EIGEN_STRONG_INLINE void pstore(Eigen::half* to, const Packet4h& from) { - __int64_t r = _mm_cvtm64_si64(from.x); - *(reinterpret_cast<__int64_t*>(to)) = r; -} - -template<> EIGEN_STRONG_INLINE void pstoreu(Eigen::half* to, const Packet4h& from) { - __int64_t r = _mm_cvtm64_si64(from.x); - *(reinterpret_cast<__int64_t*>(to)) = r; -} - -template<> EIGEN_STRONG_INLINE Packet4h -ploadquad(const Eigen::half* from) { - return pset1(*from); -} - -template<> EIGEN_STRONG_INLINE Packet4h pgather(const Eigen::half* from, Index stride) -{ - Packet4h result; - result.x = _mm_set_pi16(from[3*stride].x, from[2*stride].x, from[1*stride].x, from[0*stride].x); - return result; -} - -template<> EIGEN_STRONG_INLINE void pscatter(Eigen::half* to, const Packet4h& from, Index stride) -{ - __int64_t a = _mm_cvtm64_si64(from.x); - to[stride*0].x = static_cast(a); - to[stride*1].x = static_cast(a >> 16); - to[stride*2].x = static_cast(a >> 32); - to[stride*3].x = static_cast(a >> 48); -} - -EIGEN_STRONG_INLINE void -ptranspose(PacketBlock& kernel) { - __m64 T0 = _mm_unpacklo_pi16(kernel.packet[0].x, kernel.packet[1].x); - __m64 T1 = _mm_unpacklo_pi16(kernel.packet[2].x, kernel.packet[3].x); - __m64 T2 = _mm_unpackhi_pi16(kernel.packet[0].x, kernel.packet[1].x); - __m64 T3 = _mm_unpackhi_pi16(kernel.packet[2].x, kernel.packet[3].x); - - kernel.packet[0].x = _mm_unpacklo_pi32(T0, T1); - kernel.packet[1].x = _mm_unpackhi_pi32(T0, T1); - kernel.packet[2].x = _mm_unpacklo_pi32(T2, T3); - kernel.packet[3].x = _mm_unpackhi_pi32(T2, T3); -} - -#endif - -} -} - -#endif // EIGEN_PACKET_MATH_HALF_CUDA_H diff --git a/Eigen/src/Core/arch/CUDA/TypeCasting.h b/Eigen/src/Core/arch/CUDA/TypeCasting.h deleted file mode 100644 index 30f870c3d..000000000 --- a/Eigen/src/Core/arch/CUDA/TypeCasting.h +++ /dev/null @@ -1,212 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2016 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TYPE_CASTING_CUDA_H -#define EIGEN_TYPE_CASTING_CUDA_H - -namespace Eigen { - -namespace internal { - -template<> -struct scalar_cast_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cast_op) - typedef Eigen::half result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Eigen::half operator() (const float& a) const { - #if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - return __float2half(a); - #else - return Eigen::half(a); - #endif - } -}; - -template<> -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false }; }; - - -template<> -struct scalar_cast_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cast_op) - typedef Eigen::half result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Eigen::half operator() (const int& a) const { - #if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - return __float2half(static_cast(a)); - #else - return Eigen::half(static_cast(a)); - #endif - } -}; - -template<> -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false }; }; - - -template<> -struct scalar_cast_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cast_op) - typedef float result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float operator() (const Eigen::half& a) const { - #if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - return __half2float(a); - #else - return static_cast(a); - #endif - } -}; - -template<> -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false }; }; - - - -#if defined(EIGEN_HAS_CUDA_FP16) && defined(EIGEN_CUDA_ARCH) && EIGEN_CUDA_ARCH >= 300 - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 2, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE float4 pcast(const half2& a, const half2& b) { - float2 r1 = __half22float2(a); - float2 r2 = __half22float2(b); - return make_float4(r1.x, r1.y, r2.x, r2.y); -} - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 2 - }; -}; - -template<> EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE half2 pcast(const float4& a) { - // Simply discard the second half of the input - return __floats2half2_rn(a.x, a.y); -} - -#elif defined EIGEN_VECTORIZE_AVX512 -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet16f pcast(const Packet16h& a) { - return half2float(a); -} - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet16h pcast(const Packet16f& a) { - return float2half(a); -} - -#elif defined EIGEN_VECTORIZE_AVX - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet8f pcast(const Packet8h& a) { - return half2float(a); -} - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet8h pcast(const Packet8f& a) { - return float2half(a); -} - -// Disable the following code since it's broken on too many platforms / compilers. -//#elif defined(EIGEN_VECTORIZE_SSE) && (!EIGEN_ARCH_x86_64) && (!EIGEN_COMP_MSVC) -#elif 0 - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet4f pcast(const Packet4h& a) { - __int64_t a64 = _mm_cvtm64_si64(a.x); - Eigen::half h = raw_uint16_to_half(static_cast(a64)); - float f1 = static_cast(h); - h = raw_uint16_to_half(static_cast(a64 >> 16)); - float f2 = static_cast(h); - h = raw_uint16_to_half(static_cast(a64 >> 32)); - float f3 = static_cast(h); - h = raw_uint16_to_half(static_cast(a64 >> 48)); - float f4 = static_cast(h); - return _mm_set_ps(f4, f3, f2, f1); -} - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet4h pcast(const Packet4f& a) { - EIGEN_ALIGN16 float aux[4]; - pstore(aux, a); - Eigen::half h0(aux[0]); - Eigen::half h1(aux[1]); - Eigen::half h2(aux[2]); - Eigen::half h3(aux[3]); - - Packet4h result; - result.x = _mm_set_pi16(h3.x, h2.x, h1.x, h0.x); - return result; -} - -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TYPE_CASTING_CUDA_H diff --git a/Eigen/src/Core/arch/Default/ConjHelper.h b/Eigen/src/Core/arch/Default/ConjHelper.h deleted file mode 100644 index 4cfe34e05..000000000 --- a/Eigen/src/Core/arch/Default/ConjHelper.h +++ /dev/null @@ -1,29 +0,0 @@ - -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2017 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ARCH_CONJ_HELPER_H -#define EIGEN_ARCH_CONJ_HELPER_H - -#define EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(PACKET_CPLX, PACKET_REAL) \ - template<> struct conj_helper { \ - EIGEN_STRONG_INLINE PACKET_CPLX pmadd(const PACKET_REAL& x, const PACKET_CPLX& y, const PACKET_CPLX& c) const \ - { return padd(c, pmul(x,y)); } \ - EIGEN_STRONG_INLINE PACKET_CPLX pmul(const PACKET_REAL& x, const PACKET_CPLX& y) const \ - { return PACKET_CPLX(Eigen::internal::pmul(x, y.v)); } \ - }; \ - \ - template<> struct conj_helper { \ - EIGEN_STRONG_INLINE PACKET_CPLX pmadd(const PACKET_CPLX& x, const PACKET_REAL& y, const PACKET_CPLX& c) const \ - { return padd(c, pmul(x,y)); } \ - EIGEN_STRONG_INLINE PACKET_CPLX pmul(const PACKET_CPLX& x, const PACKET_REAL& y) const \ - { return PACKET_CPLX(Eigen::internal::pmul(x.v, y)); } \ - }; - -#endif // EIGEN_ARCH_CONJ_HELPER_H diff --git a/Eigen/src/Core/arch/Default/Settings.h b/Eigen/src/Core/arch/Default/Settings.h deleted file mode 100644 index 097373c84..000000000 --- a/Eigen/src/Core/arch/Default/Settings.h +++ /dev/null @@ -1,49 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -/* All the parameters defined in this file can be specialized in the - * architecture specific files, and/or by the user. - * More to come... */ - -#ifndef EIGEN_DEFAULT_SETTINGS_H -#define EIGEN_DEFAULT_SETTINGS_H - -/** Defines the maximal loop size to enable meta unrolling of loops. - * Note that the value here is expressed in Eigen's own notion of "number of FLOPS", - * it does not correspond to the number of iterations or the number of instructions - */ -#ifndef EIGEN_UNROLLING_LIMIT -#define EIGEN_UNROLLING_LIMIT 100 -#endif - -/** Defines the threshold between a "small" and a "large" matrix. - * This threshold is mainly used to select the proper product implementation. - */ -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 8 -#endif - -/** Defines the maximal width of the blocks used in the triangular product and solver - * for vectors (level 2 blas xTRMV and xTRSV). The default is 8. - */ -#ifndef EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH -#define EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH 8 -#endif - - -/** Defines the default number of registers available for that architecture. - * Currently it must be 8 or 16. Other values will fail. - */ -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS 8 -#endif - -#endif // EIGEN_DEFAULT_SETTINGS_H diff --git a/Eigen/src/Core/arch/NEON/Complex.h b/Eigen/src/Core/arch/NEON/Complex.h deleted file mode 100644 index ef50ba303..000000000 --- a/Eigen/src/Core/arch/NEON/Complex.h +++ /dev/null @@ -1,490 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Gael Guennebaud -// Copyright (C) 2010 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX_NEON_H -#define EIGEN_COMPLEX_NEON_H - -namespace Eigen { - -namespace internal { - -inline uint32x4_t p4ui_CONJ_XOR() { -// See bug 1325, clang fails to call vld1q_u64. -#if EIGEN_COMP_CLANG - uint32x4_t ret = { 0x00000000, 0x80000000, 0x00000000, 0x80000000 }; - return ret; -#else - static const uint32_t conj_XOR_DATA[] = { 0x00000000, 0x80000000, 0x00000000, 0x80000000 }; - return vld1q_u32( conj_XOR_DATA ); -#endif -} - -inline uint32x2_t p2ui_CONJ_XOR() { - static const uint32_t conj_XOR_DATA[] = { 0x00000000, 0x80000000 }; - return vld1_u32( conj_XOR_DATA ); -} - -//---------- float ---------- -struct Packet2cf -{ - EIGEN_STRONG_INLINE Packet2cf() {} - EIGEN_STRONG_INLINE explicit Packet2cf(const Packet4f& a) : v(a) {} - Packet4f v; -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet2cf type; - typedef Packet2cf half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 2, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=2, alignment=Aligned16}; typedef Packet2cf half; }; - -template<> EIGEN_STRONG_INLINE Packet2cf pset1(const std::complex& from) -{ - float32x2_t r64; - r64 = vld1_f32((float *)&from); - - return Packet2cf(vcombine_f32(r64, r64)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf padd(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(padd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf psub(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(psub(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pnegate(const Packet2cf& a) { return Packet2cf(pnegate(a.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pconj(const Packet2cf& a) -{ - Packet4ui b = vreinterpretq_u32_f32(a.v); - return Packet2cf(vreinterpretq_f32_u32(veorq_u32(b, p4ui_CONJ_XOR()))); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) -{ - Packet4f v1, v2; - - // Get the real values of a | a1_re | a1_re | a2_re | a2_re | - v1 = vcombine_f32(vdup_lane_f32(vget_low_f32(a.v), 0), vdup_lane_f32(vget_high_f32(a.v), 0)); - // Get the imag values of a | a1_im | a1_im | a2_im | a2_im | - v2 = vcombine_f32(vdup_lane_f32(vget_low_f32(a.v), 1), vdup_lane_f32(vget_high_f32(a.v), 1)); - // Multiply the real a with b - v1 = vmulq_f32(v1, b.v); - // Multiply the imag a with b - v2 = vmulq_f32(v2, b.v); - // Conjugate v2 - v2 = vreinterpretq_f32_u32(veorq_u32(vreinterpretq_u32_f32(v2), p4ui_CONJ_XOR())); - // Swap real/imag elements in v2. - v2 = vrev64q_f32(v2); - // Add and return the result - return Packet2cf(vaddq_f32(v1, v2)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pand (const Packet2cf& a, const Packet2cf& b) -{ - return Packet2cf(vreinterpretq_f32_u32(vandq_u32(vreinterpretq_u32_f32(a.v),vreinterpretq_u32_f32(b.v)))); -} -template<> EIGEN_STRONG_INLINE Packet2cf por (const Packet2cf& a, const Packet2cf& b) -{ - return Packet2cf(vreinterpretq_f32_u32(vorrq_u32(vreinterpretq_u32_f32(a.v),vreinterpretq_u32_f32(b.v)))); -} -template<> EIGEN_STRONG_INLINE Packet2cf pxor (const Packet2cf& a, const Packet2cf& b) -{ - return Packet2cf(vreinterpretq_f32_u32(veorq_u32(vreinterpretq_u32_f32(a.v),vreinterpretq_u32_f32(b.v)))); -} -template<> EIGEN_STRONG_INLINE Packet2cf pandnot(const Packet2cf& a, const Packet2cf& b) -{ - return Packet2cf(vreinterpretq_f32_u32(vbicq_u32(vreinterpretq_u32_f32(a.v),vreinterpretq_u32_f32(b.v)))); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pload(const std::complex* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet2cf(pload((const float*)from)); } -template<> EIGEN_STRONG_INLINE Packet2cf ploadu(const std::complex* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet2cf(ploadu((const float*)from)); } - -template<> EIGEN_STRONG_INLINE Packet2cf ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet2cf& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((float*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet2cf& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((float*)to, from.v); } - -template<> EIGEN_DEVICE_FUNC inline Packet2cf pgather, Packet2cf>(const std::complex* from, Index stride) -{ - Packet4f res = pset1(0.f); - res = vsetq_lane_f32(std::real(from[0*stride]), res, 0); - res = vsetq_lane_f32(std::imag(from[0*stride]), res, 1); - res = vsetq_lane_f32(std::real(from[1*stride]), res, 2); - res = vsetq_lane_f32(std::imag(from[1*stride]), res, 3); - return Packet2cf(res); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet2cf>(std::complex* to, const Packet2cf& from, Index stride) -{ - to[stride*0] = std::complex(vgetq_lane_f32(from.v, 0), vgetq_lane_f32(from.v, 1)); - to[stride*1] = std::complex(vgetq_lane_f32(from.v, 2), vgetq_lane_f32(from.v, 3)); -} - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { EIGEN_ARM_PREFETCH((float *)addr); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet2cf& a) -{ - std::complex EIGEN_ALIGN16 x[2]; - vst1q_f32((float *)x, a.v); - return x[0]; -} - -template<> EIGEN_STRONG_INLINE Packet2cf preverse(const Packet2cf& a) -{ - float32x2_t a_lo, a_hi; - Packet4f a_r128; - - a_lo = vget_low_f32(a.v); - a_hi = vget_high_f32(a.v); - a_r128 = vcombine_f32(a_hi, a_lo); - - return Packet2cf(a_r128); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pcplxflip(const Packet2cf& a) -{ - return Packet2cf(vrev64q_f32(a.v)); -} - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet2cf& a) -{ - float32x2_t a1, a2; - std::complex s; - - a1 = vget_low_f32(a.v); - a2 = vget_high_f32(a.v); - a2 = vadd_f32(a1, a2); - vst1_f32((float *)&s, a2); - - return s; -} - -template<> EIGEN_STRONG_INLINE Packet2cf preduxp(const Packet2cf* vecs) -{ - Packet4f sum1, sum2, sum; - - // Add the first two 64-bit float32x2_t of vecs[0] - sum1 = vcombine_f32(vget_low_f32(vecs[0].v), vget_low_f32(vecs[1].v)); - sum2 = vcombine_f32(vget_high_f32(vecs[0].v), vget_high_f32(vecs[1].v)); - sum = vaddq_f32(sum1, sum2); - - return Packet2cf(sum); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet2cf& a) -{ - float32x2_t a1, a2, v1, v2, prod; - std::complex s; - - a1 = vget_low_f32(a.v); - a2 = vget_high_f32(a.v); - // Get the real values of a | a1_re | a1_re | a2_re | a2_re | - v1 = vdup_lane_f32(a1, 0); - // Get the real values of a | a1_im | a1_im | a2_im | a2_im | - v2 = vdup_lane_f32(a1, 1); - // Multiply the real a with b - v1 = vmul_f32(v1, a2); - // Multiply the imag a with b - v2 = vmul_f32(v2, a2); - // Conjugate v2 - v2 = vreinterpret_f32_u32(veor_u32(vreinterpret_u32_f32(v2), p2ui_CONJ_XOR())); - // Swap real/imag elements in v2. - v2 = vrev64_f32(v2); - // Add v1, v2 - prod = vadd_f32(v1, v2); - - vst1_f32((float *)&s, prod); - - return s; -} - -template -struct palign_impl -{ - EIGEN_STRONG_INLINE static void run(Packet2cf& first, const Packet2cf& second) - { - if (Offset==1) - { - first.v = vextq_f32(first.v, second.v, 2); - } - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) - -template<> EIGEN_STRONG_INLINE Packet2cf pdiv(const Packet2cf& a, const Packet2cf& b) -{ - // TODO optimize it for NEON - Packet2cf res = conj_helper().pmul(a,b); - Packet4f s, rev_s; - - // this computes the norm - s = vmulq_f32(b.v, b.v); - rev_s = vrev64q_f32(s); - - return Packet2cf(pdiv(res.v, vaddq_f32(s,rev_s))); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet4f tmp = vcombine_f32(vget_high_f32(kernel.packet[0].v), vget_high_f32(kernel.packet[1].v)); - kernel.packet[0].v = vcombine_f32(vget_low_f32(kernel.packet[0].v), vget_low_f32(kernel.packet[1].v)); - kernel.packet[1].v = tmp; -} - -//---------- double ---------- -#if EIGEN_ARCH_ARM64 && !EIGEN_APPLE_DOUBLE_NEON_BUG - -// See bug 1325, clang fails to call vld1q_u64. -#if EIGEN_COMP_CLANG - static uint64x2_t p2ul_CONJ_XOR = {0x0, 0x8000000000000000}; -#else - const uint64_t p2ul_conj_XOR_DATA[] = { 0x0, 0x8000000000000000 }; - static uint64x2_t p2ul_CONJ_XOR = vld1q_u64( p2ul_conj_XOR_DATA ); -#endif - -struct Packet1cd -{ - EIGEN_STRONG_INLINE Packet1cd() {} - EIGEN_STRONG_INLINE explicit Packet1cd(const Packet2d& a) : v(a) {} - Packet2d v; -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet1cd type; - typedef Packet1cd half; - enum { - Vectorizable = 1, - AlignedOnScalar = 0, - size = 1, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=1, alignment=Aligned16}; typedef Packet1cd half; }; - -template<> EIGEN_STRONG_INLINE Packet1cd pload(const std::complex* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet1cd(pload((const double*)from)); } -template<> EIGEN_STRONG_INLINE Packet1cd ploadu(const std::complex* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet1cd(ploadu((const double*)from)); } - -template<> EIGEN_STRONG_INLINE Packet1cd pset1(const std::complex& from) -{ /* here we really have to use unaligned loads :( */ return ploadu(&from); } - -template<> EIGEN_STRONG_INLINE Packet1cd padd(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(padd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd psub(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(psub(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pnegate(const Packet1cd& a) { return Packet1cd(pnegate(a.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pconj(const Packet1cd& a) { return Packet1cd(vreinterpretq_f64_u64(veorq_u64(vreinterpretq_u64_f64(a.v), p2ul_CONJ_XOR))); } - -template<> EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) -{ - Packet2d v1, v2; - - // Get the real values of a - v1 = vdupq_lane_f64(vget_low_f64(a.v), 0); - // Get the imag values of a - v2 = vdupq_lane_f64(vget_high_f64(a.v), 0); - // Multiply the real a with b - v1 = vmulq_f64(v1, b.v); - // Multiply the imag a with b - v2 = vmulq_f64(v2, b.v); - // Conjugate v2 - v2 = vreinterpretq_f64_u64(veorq_u64(vreinterpretq_u64_f64(v2), p2ul_CONJ_XOR)); - // Swap real/imag elements in v2. - v2 = preverse(v2); - // Add and return the result - return Packet1cd(vaddq_f64(v1, v2)); -} - -template<> EIGEN_STRONG_INLINE Packet1cd pand (const Packet1cd& a, const Packet1cd& b) -{ - return Packet1cd(vreinterpretq_f64_u64(vandq_u64(vreinterpretq_u64_f64(a.v),vreinterpretq_u64_f64(b.v)))); -} -template<> EIGEN_STRONG_INLINE Packet1cd por (const Packet1cd& a, const Packet1cd& b) -{ - return Packet1cd(vreinterpretq_f64_u64(vorrq_u64(vreinterpretq_u64_f64(a.v),vreinterpretq_u64_f64(b.v)))); -} -template<> EIGEN_STRONG_INLINE Packet1cd pxor (const Packet1cd& a, const Packet1cd& b) -{ - return Packet1cd(vreinterpretq_f64_u64(veorq_u64(vreinterpretq_u64_f64(a.v),vreinterpretq_u64_f64(b.v)))); -} -template<> EIGEN_STRONG_INLINE Packet1cd pandnot(const Packet1cd& a, const Packet1cd& b) -{ - return Packet1cd(vreinterpretq_f64_u64(vbicq_u64(vreinterpretq_u64_f64(a.v),vreinterpretq_u64_f64(b.v)))); -} - -template<> EIGEN_STRONG_INLINE Packet1cd ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet1cd& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((double*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet1cd& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((double*)to, from.v); } - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { EIGEN_ARM_PREFETCH((double *)addr); } - -template<> EIGEN_DEVICE_FUNC inline Packet1cd pgather, Packet1cd>(const std::complex* from, Index stride) -{ - Packet2d res = pset1(0.0); - res = vsetq_lane_f64(std::real(from[0*stride]), res, 0); - res = vsetq_lane_f64(std::imag(from[0*stride]), res, 1); - return Packet1cd(res); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet1cd>(std::complex* to, const Packet1cd& from, Index stride) -{ - to[stride*0] = std::complex(vgetq_lane_f64(from.v, 0), vgetq_lane_f64(from.v, 1)); -} - - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet1cd& a) -{ - std::complex EIGEN_ALIGN16 res; - pstore >(&res, a); - - return res; -} - -template<> EIGEN_STRONG_INLINE Packet1cd preverse(const Packet1cd& a) { return a; } - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet1cd& a) { return pfirst(a); } - -template<> EIGEN_STRONG_INLINE Packet1cd preduxp(const Packet1cd* vecs) { return vecs[0]; } - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet1cd& a) { return pfirst(a); } - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet1cd& /*first*/, const Packet1cd& /*second*/) - { - // FIXME is it sure we never have to align a Packet1cd? - // Even though a std::complex has 16 bytes, it is not necessarily aligned on a 16 bytes boundary... - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) - -template<> EIGEN_STRONG_INLINE Packet1cd pdiv(const Packet1cd& a, const Packet1cd& b) -{ - // TODO optimize it for NEON - Packet1cd res = conj_helper().pmul(a,b); - Packet2d s = pmul(b.v, b.v); - Packet2d rev_s = preverse(s); - - return Packet1cd(pdiv(res.v, padd(s,rev_s))); -} - -EIGEN_STRONG_INLINE Packet1cd pcplxflip/**/(const Packet1cd& x) -{ - return Packet1cd(preverse(Packet2d(x.v))); -} - -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel) -{ - Packet2d tmp = vcombine_f64(vget_high_f64(kernel.packet[0].v), vget_high_f64(kernel.packet[1].v)); - kernel.packet[0].v = vcombine_f64(vget_low_f64(kernel.packet[0].v), vget_low_f64(kernel.packet[1].v)); - kernel.packet[1].v = tmp; -} -#endif // EIGEN_ARCH_ARM64 - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX_NEON_H diff --git a/Eigen/src/Core/arch/NEON/MathFunctions.h b/Eigen/src/Core/arch/NEON/MathFunctions.h deleted file mode 100644 index c48c61023..000000000 --- a/Eigen/src/Core/arch/NEON/MathFunctions.h +++ /dev/null @@ -1,183 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* The sin, cos, exp, and log functions of this file come from - * Julien Pommier's sse math library: http://gruntthepeon.free.fr/ssemath/ - */ - -#ifndef EIGEN_MATH_FUNCTIONS_NEON_H -#define EIGEN_MATH_FUNCTIONS_NEON_H - -namespace Eigen { - -namespace internal { - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f pexp(const Packet4f& _x) -{ - Packet4f x = _x; - Packet4f tmp, fx; - - _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); - _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet4i(0x7f, 0x7f); - _EIGEN_DECLARE_CONST_Packet4f(exp_hi, 88.3762626647950f); - _EIGEN_DECLARE_CONST_Packet4f(exp_lo, -88.3762626647949f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_LOG2EF, 1.44269504088896341f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C1, 0.693359375f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C2, -2.12194440e-4f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p0, 1.9875691500E-4f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p1, 1.3981999507E-3f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p2, 8.3334519073E-3f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p3, 4.1665795894E-2f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p4, 1.6666665459E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p5, 5.0000001201E-1f); - - x = vminq_f32(x, p4f_exp_hi); - x = vmaxq_f32(x, p4f_exp_lo); - - /* express exp(x) as exp(g + n*log(2)) */ - fx = vmlaq_f32(p4f_half, x, p4f_cephes_LOG2EF); - - /* perform a floorf */ - tmp = vcvtq_f32_s32(vcvtq_s32_f32(fx)); - - /* if greater, substract 1 */ - Packet4ui mask = vcgtq_f32(tmp, fx); - mask = vandq_u32(mask, vreinterpretq_u32_f32(p4f_1)); - - fx = vsubq_f32(tmp, vreinterpretq_f32_u32(mask)); - - tmp = vmulq_f32(fx, p4f_cephes_exp_C1); - Packet4f z = vmulq_f32(fx, p4f_cephes_exp_C2); - x = vsubq_f32(x, tmp); - x = vsubq_f32(x, z); - - Packet4f y = vmulq_f32(p4f_cephes_exp_p0, x); - z = vmulq_f32(x, x); - y = vaddq_f32(y, p4f_cephes_exp_p1); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_exp_p2); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_exp_p3); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_exp_p4); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_exp_p5); - - y = vmulq_f32(y, z); - y = vaddq_f32(y, x); - y = vaddq_f32(y, p4f_1); - - /* build 2^n */ - int32x4_t mm; - mm = vcvtq_s32_f32(fx); - mm = vaddq_s32(mm, p4i_0x7f); - mm = vshlq_n_s32(mm, 23); - Packet4f pow2n = vreinterpretq_f32_s32(mm); - - y = vmulq_f32(y, pow2n); - return y; -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f plog(const Packet4f& _x) -{ - Packet4f x = _x; - _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); - _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet4i(0x7f, 0x7f); - - _EIGEN_DECLARE_CONST_Packet4i(inv_mant_mask, ~0x7f800000); - - /* natural logarithm computed for 4 simultaneous float - return NaN for x <= 0 - */ - _EIGEN_DECLARE_CONST_Packet4f(cephes_SQRTHF, 0.707106781186547524f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p0, 7.0376836292E-2f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p1, - 1.1514610310E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p2, 1.1676998740E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p3, - 1.2420140846E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p4, + 1.4249322787E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p5, - 1.6668057665E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p6, + 2.0000714765E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p7, - 2.4999993993E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p8, + 3.3333331174E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q1, -2.12194440e-4f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q2, 0.693359375f); - - x = vmaxq_f32(x, vdupq_n_f32(0)); /* force flush to zero on denormal values */ - Packet4ui invalid_mask = vcleq_f32(x, vdupq_n_f32(0)); - - Packet4i ux = vreinterpretq_s32_f32(x); - - Packet4i emm0 = vshrq_n_s32(ux, 23); - - /* keep only the fractional part */ - ux = vandq_s32(ux, p4i_inv_mant_mask); - ux = vorrq_s32(ux, vreinterpretq_s32_f32(p4f_half)); - x = vreinterpretq_f32_s32(ux); - - emm0 = vsubq_s32(emm0, p4i_0x7f); - Packet4f e = vcvtq_f32_s32(emm0); - - e = vaddq_f32(e, p4f_1); - - /* part2: - if( x < SQRTHF ) { - e -= 1; - x = x + x - 1.0; - } else { x = x - 1.0; } - */ - Packet4ui mask = vcltq_f32(x, p4f_cephes_SQRTHF); - Packet4f tmp = vreinterpretq_f32_u32(vandq_u32(vreinterpretq_u32_f32(x), mask)); - x = vsubq_f32(x, p4f_1); - e = vsubq_f32(e, vreinterpretq_f32_u32(vandq_u32(vreinterpretq_u32_f32(p4f_1), mask))); - x = vaddq_f32(x, tmp); - - Packet4f z = vmulq_f32(x,x); - - Packet4f y = p4f_cephes_log_p0; - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p1); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p2); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p3); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p4); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p5); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p6); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p7); - y = vmulq_f32(y, x); - y = vaddq_f32(y, p4f_cephes_log_p8); - y = vmulq_f32(y, x); - - y = vmulq_f32(y, z); - - tmp = vmulq_f32(e, p4f_cephes_log_q1); - y = vaddq_f32(y, tmp); - - - tmp = vmulq_f32(z, p4f_half); - y = vsubq_f32(y, tmp); - - tmp = vmulq_f32(e, p4f_cephes_log_q2); - x = vaddq_f32(x, y); - x = vaddq_f32(x, tmp); - x = vreinterpretq_f32_u32(vorrq_u32(vreinterpretq_u32_f32(x), invalid_mask)); // negative arg will be NAN - return x; -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_MATH_FUNCTIONS_NEON_H diff --git a/Eigen/src/Core/arch/NEON/PacketMath.h b/Eigen/src/Core/arch/NEON/PacketMath.h deleted file mode 100644 index 6283b6cfa..000000000 --- a/Eigen/src/Core/arch/NEON/PacketMath.h +++ /dev/null @@ -1,729 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2010 Konstantinos Margaritis -// Heavily based on Gael's SSE version. -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_NEON_H -#define EIGEN_PACKET_MATH_NEON_H - -namespace Eigen { - -namespace internal { - -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 8 -#endif - -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#endif - -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD -#endif - -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#if EIGEN_ARCH_ARM64 -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS 32 -#else -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS 16 -#endif -#endif - -typedef float32x2_t Packet2f; -typedef float32x4_t Packet4f; -typedef int32x4_t Packet4i; -typedef int32x2_t Packet2i; -typedef uint32x4_t Packet4ui; - -#define _EIGEN_DECLARE_CONST_Packet4f(NAME,X) \ - const Packet4f p4f_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(NAME,X) \ - const Packet4f p4f_##NAME = vreinterpretq_f32_u32(pset1(X)) - -#define _EIGEN_DECLARE_CONST_Packet4i(NAME,X) \ - const Packet4i p4i_##NAME = pset1(X) - -#if EIGEN_ARCH_ARM64 - // __builtin_prefetch tends to do nothing on ARM64 compilers because the - // prefetch instructions there are too detailed for __builtin_prefetch to map - // meaningfully to them. - #define EIGEN_ARM_PREFETCH(ADDR) __asm__ __volatile__("prfm pldl1keep, [%[addr]]\n" ::[addr] "r"(ADDR) : ); -#elif EIGEN_HAS_BUILTIN(__builtin_prefetch) || EIGEN_COMP_GNUC - #define EIGEN_ARM_PREFETCH(ADDR) __builtin_prefetch(ADDR); -#elif defined __pld - #define EIGEN_ARM_PREFETCH(ADDR) __pld(ADDR) -#elif EIGEN_ARCH_ARM32 - #define EIGEN_ARM_PREFETCH(ADDR) __asm__ __volatile__ ("pld [%[addr]]\n" :: [addr] "r" (ADDR) : ); -#else - // by default no explicit prefetching - #define EIGEN_ARM_PREFETCH(ADDR) -#endif - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4f type; - typedef Packet4f half; // Packet2f intrinsics not implemented yet - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 4, - HasHalfPacket=0, // Packet2f intrinsics not implemented yet - - HasDiv = 1, - // FIXME check the Has* - HasSin = 0, - HasCos = 0, - HasLog = 1, - HasExp = 1, - HasSqrt = 0 - }; -}; -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4i type; - typedef Packet4i half; // Packet2i intrinsics not implemented yet - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - HasHalfPacket=0 // Packet2i intrinsics not implemented yet - // FIXME check the Has* - }; -}; - -#if EIGEN_GNUC_AT_MOST(4,4) && !EIGEN_COMP_LLVM -// workaround gcc 4.2, 4.3 and 4.4 compilatin issue -EIGEN_STRONG_INLINE float32x4_t vld1q_f32(const float* x) { return ::vld1q_f32((const float32_t*)x); } -EIGEN_STRONG_INLINE float32x2_t vld1_f32 (const float* x) { return ::vld1_f32 ((const float32_t*)x); } -EIGEN_STRONG_INLINE float32x2_t vld1_dup_f32 (const float* x) { return ::vld1_dup_f32 ((const float32_t*)x); } -EIGEN_STRONG_INLINE void vst1q_f32(float* to, float32x4_t from) { ::vst1q_f32((float32_t*)to,from); } -EIGEN_STRONG_INLINE void vst1_f32 (float* to, float32x2_t from) { ::vst1_f32 ((float32_t*)to,from); } -#endif - -template<> struct unpacket_traits { typedef float type; enum {size=4, alignment=Aligned16}; typedef Packet4f half; }; -template<> struct unpacket_traits { typedef int32_t type; enum {size=4, alignment=Aligned16}; typedef Packet4i half; }; - -template<> EIGEN_STRONG_INLINE Packet4f pset1(const float& from) { return vdupq_n_f32(from); } -template<> EIGEN_STRONG_INLINE Packet4i pset1(const int32_t& from) { return vdupq_n_s32(from); } - -template<> EIGEN_STRONG_INLINE Packet4f plset(const float& a) -{ - const float f[] = {0, 1, 2, 3}; - Packet4f countdown = vld1q_f32(f); - return vaddq_f32(pset1(a), countdown); -} -template<> EIGEN_STRONG_INLINE Packet4i plset(const int32_t& a) -{ - const int32_t i[] = {0, 1, 2, 3}; - Packet4i countdown = vld1q_s32(i); - return vaddq_s32(pset1(a), countdown); -} - -template<> EIGEN_STRONG_INLINE Packet4f padd(const Packet4f& a, const Packet4f& b) { return vaddq_f32(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i padd(const Packet4i& a, const Packet4i& b) { return vaddq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f psub(const Packet4f& a, const Packet4f& b) { return vsubq_f32(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i psub(const Packet4i& a, const Packet4i& b) { return vsubq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pnegate(const Packet4f& a) { return vnegq_f32(a); } -template<> EIGEN_STRONG_INLINE Packet4i pnegate(const Packet4i& a) { return vnegq_s32(a); } - -template<> EIGEN_STRONG_INLINE Packet4f pconj(const Packet4f& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet4i pconj(const Packet4i& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet4f pmul(const Packet4f& a, const Packet4f& b) { return vmulq_f32(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pmul(const Packet4i& a, const Packet4i& b) { return vmulq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pdiv(const Packet4f& a, const Packet4f& b) -{ -#if EIGEN_ARCH_ARM64 - return vdivq_f32(a,b); -#else - Packet4f inv, restep, div; - - // NEON does not offer a divide instruction, we have to do a reciprocal approximation - // However NEON in contrast to other SIMD engines (AltiVec/SSE), offers - // a reciprocal estimate AND a reciprocal step -which saves a few instructions - // vrecpeq_f32() returns an estimate to 1/b, which we will finetune with - // Newton-Raphson and vrecpsq_f32() - inv = vrecpeq_f32(b); - - // This returns a differential, by which we will have to multiply inv to get a better - // approximation of 1/b. - restep = vrecpsq_f32(b, inv); - inv = vmulq_f32(restep, inv); - - // Finally, multiply a by 1/b and get the wanted result of the division. - div = vmulq_f32(a, inv); - - return div; -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4i pdiv(const Packet4i& /*a*/, const Packet4i& /*b*/) -{ eigen_assert(false && "packet integer division are not supported by NEON"); - return pset1(0); -} - -// Clang/ARM wrongly advertises __ARM_FEATURE_FMA even when it's not available, -// then implements a slow software scalar fallback calling fmaf()! -// Filed LLVM bug: -// https://llvm.org/bugs/show_bug.cgi?id=27216 -#if (defined __ARM_FEATURE_FMA) && !(EIGEN_COMP_CLANG && EIGEN_ARCH_ARM) -// See bug 936. -// FMA is available on VFPv4 i.e. when compiling with -mfpu=neon-vfpv4. -// FMA is a true fused multiply-add i.e. only 1 rounding at the end, no intermediate rounding. -// MLA is not fused i.e. does 2 roundings. -// In addition to giving better accuracy, FMA also gives better performance here on a Krait (Nexus 4): -// MLA: 10 GFlop/s ; FMA: 12 GFlops/s. -template<> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) { return vfmaq_f32(c,a,b); } -#else -template<> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) { -#if EIGEN_COMP_CLANG && EIGEN_ARCH_ARM - // Clang/ARM will replace VMLA by VMUL+VADD at least for some values of -mcpu, - // at least -mcpu=cortex-a8 and -mcpu=cortex-a7. Since the former is the default on - // -march=armv7-a, that is a very common case. - // See e.g. this thread: - // http://lists.llvm.org/pipermail/llvm-dev/2013-December/068806.html - // Filed LLVM bug: - // https://llvm.org/bugs/show_bug.cgi?id=27219 - Packet4f r = c; - asm volatile( - "vmla.f32 %q[r], %q[a], %q[b]" - : [r] "+w" (r) - : [a] "w" (a), - [b] "w" (b) - : ); - return r; -#else - return vmlaq_f32(c,a,b); -#endif -} -#endif - -// No FMA instruction for int, so use MLA unconditionally. -template<> EIGEN_STRONG_INLINE Packet4i pmadd(const Packet4i& a, const Packet4i& b, const Packet4i& c) { return vmlaq_s32(c,a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pmin(const Packet4f& a, const Packet4f& b) { return vminq_f32(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pmin(const Packet4i& a, const Packet4i& b) { return vminq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pmax(const Packet4f& a, const Packet4f& b) { return vmaxq_f32(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pmax(const Packet4i& a, const Packet4i& b) { return vmaxq_s32(a,b); } - -// Logical Operations are not supported for float, so we have to reinterpret casts using NEON intrinsics -template<> EIGEN_STRONG_INLINE Packet4f pand(const Packet4f& a, const Packet4f& b) -{ - return vreinterpretq_f32_u32(vandq_u32(vreinterpretq_u32_f32(a),vreinterpretq_u32_f32(b))); -} -template<> EIGEN_STRONG_INLINE Packet4i pand(const Packet4i& a, const Packet4i& b) { return vandq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f por(const Packet4f& a, const Packet4f& b) -{ - return vreinterpretq_f32_u32(vorrq_u32(vreinterpretq_u32_f32(a),vreinterpretq_u32_f32(b))); -} -template<> EIGEN_STRONG_INLINE Packet4i por(const Packet4i& a, const Packet4i& b) { return vorrq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pxor(const Packet4f& a, const Packet4f& b) -{ - return vreinterpretq_f32_u32(veorq_u32(vreinterpretq_u32_f32(a),vreinterpretq_u32_f32(b))); -} -template<> EIGEN_STRONG_INLINE Packet4i pxor(const Packet4i& a, const Packet4i& b) { return veorq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pandnot(const Packet4f& a, const Packet4f& b) -{ - return vreinterpretq_f32_u32(vbicq_u32(vreinterpretq_u32_f32(a),vreinterpretq_u32_f32(b))); -} -template<> EIGEN_STRONG_INLINE Packet4i pandnot(const Packet4i& a, const Packet4i& b) { return vbicq_s32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pload(const float* from) { EIGEN_DEBUG_ALIGNED_LOAD return vld1q_f32(from); } -template<> EIGEN_STRONG_INLINE Packet4i pload(const int32_t* from) { EIGEN_DEBUG_ALIGNED_LOAD return vld1q_s32(from); } - -template<> EIGEN_STRONG_INLINE Packet4f ploadu(const float* from) { EIGEN_DEBUG_UNALIGNED_LOAD return vld1q_f32(from); } -template<> EIGEN_STRONG_INLINE Packet4i ploadu(const int32_t* from) { EIGEN_DEBUG_UNALIGNED_LOAD return vld1q_s32(from); } - -template<> EIGEN_STRONG_INLINE Packet4f ploaddup(const float* from) -{ - float32x2_t lo, hi; - lo = vld1_dup_f32(from); - hi = vld1_dup_f32(from+1); - return vcombine_f32(lo, hi); -} -template<> EIGEN_STRONG_INLINE Packet4i ploaddup(const int32_t* from) -{ - int32x2_t lo, hi; - lo = vld1_dup_s32(from); - hi = vld1_dup_s32(from+1); - return vcombine_s32(lo, hi); -} - -template<> EIGEN_STRONG_INLINE void pstore (float* to, const Packet4f& from) { EIGEN_DEBUG_ALIGNED_STORE vst1q_f32(to, from); } -template<> EIGEN_STRONG_INLINE void pstore(int32_t* to, const Packet4i& from) { EIGEN_DEBUG_ALIGNED_STORE vst1q_s32(to, from); } - -template<> EIGEN_STRONG_INLINE void pstoreu (float* to, const Packet4f& from) { EIGEN_DEBUG_UNALIGNED_STORE vst1q_f32(to, from); } -template<> EIGEN_STRONG_INLINE void pstoreu(int32_t* to, const Packet4i& from) { EIGEN_DEBUG_UNALIGNED_STORE vst1q_s32(to, from); } - -template<> EIGEN_DEVICE_FUNC inline Packet4f pgather(const float* from, Index stride) -{ - Packet4f res = pset1(0.f); - res = vsetq_lane_f32(from[0*stride], res, 0); - res = vsetq_lane_f32(from[1*stride], res, 1); - res = vsetq_lane_f32(from[2*stride], res, 2); - res = vsetq_lane_f32(from[3*stride], res, 3); - return res; -} -template<> EIGEN_DEVICE_FUNC inline Packet4i pgather(const int32_t* from, Index stride) -{ - Packet4i res = pset1(0); - res = vsetq_lane_s32(from[0*stride], res, 0); - res = vsetq_lane_s32(from[1*stride], res, 1); - res = vsetq_lane_s32(from[2*stride], res, 2); - res = vsetq_lane_s32(from[3*stride], res, 3); - return res; -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const Packet4f& from, Index stride) -{ - to[stride*0] = vgetq_lane_f32(from, 0); - to[stride*1] = vgetq_lane_f32(from, 1); - to[stride*2] = vgetq_lane_f32(from, 2); - to[stride*3] = vgetq_lane_f32(from, 3); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(int32_t* to, const Packet4i& from, Index stride) -{ - to[stride*0] = vgetq_lane_s32(from, 0); - to[stride*1] = vgetq_lane_s32(from, 1); - to[stride*2] = vgetq_lane_s32(from, 2); - to[stride*3] = vgetq_lane_s32(from, 3); -} - -template<> EIGEN_STRONG_INLINE void prefetch (const float* addr) { EIGEN_ARM_PREFETCH(addr); } -template<> EIGEN_STRONG_INLINE void prefetch(const int32_t* addr) { EIGEN_ARM_PREFETCH(addr); } - -// FIXME only store the 2 first elements ? -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { float EIGEN_ALIGN16 x[4]; vst1q_f32(x, a); return x[0]; } -template<> EIGEN_STRONG_INLINE int32_t pfirst(const Packet4i& a) { int32_t EIGEN_ALIGN16 x[4]; vst1q_s32(x, a); return x[0]; } - -template<> EIGEN_STRONG_INLINE Packet4f preverse(const Packet4f& a) { - float32x2_t a_lo, a_hi; - Packet4f a_r64; - - a_r64 = vrev64q_f32(a); - a_lo = vget_low_f32(a_r64); - a_hi = vget_high_f32(a_r64); - return vcombine_f32(a_hi, a_lo); -} -template<> EIGEN_STRONG_INLINE Packet4i preverse(const Packet4i& a) { - int32x2_t a_lo, a_hi; - Packet4i a_r64; - - a_r64 = vrev64q_s32(a); - a_lo = vget_low_s32(a_r64); - a_hi = vget_high_s32(a_r64); - return vcombine_s32(a_hi, a_lo); -} - -template<> EIGEN_STRONG_INLINE Packet4f pabs(const Packet4f& a) { return vabsq_f32(a); } -template<> EIGEN_STRONG_INLINE Packet4i pabs(const Packet4i& a) { return vabsq_s32(a); } - -template<> EIGEN_STRONG_INLINE float predux(const Packet4f& a) -{ - float32x2_t a_lo, a_hi, sum; - - a_lo = vget_low_f32(a); - a_hi = vget_high_f32(a); - sum = vpadd_f32(a_lo, a_hi); - sum = vpadd_f32(sum, sum); - return vget_lane_f32(sum, 0); -} - -template<> EIGEN_STRONG_INLINE Packet4f preduxp(const Packet4f* vecs) -{ - float32x4x2_t vtrn1, vtrn2, res1, res2; - Packet4f sum1, sum2, sum; - - // NEON zip performs interleaving of the supplied vectors. - // We perform two interleaves in a row to acquire the transposed vector - vtrn1 = vzipq_f32(vecs[0], vecs[2]); - vtrn2 = vzipq_f32(vecs[1], vecs[3]); - res1 = vzipq_f32(vtrn1.val[0], vtrn2.val[0]); - res2 = vzipq_f32(vtrn1.val[1], vtrn2.val[1]); - - // Do the addition of the resulting vectors - sum1 = vaddq_f32(res1.val[0], res1.val[1]); - sum2 = vaddq_f32(res2.val[0], res2.val[1]); - sum = vaddq_f32(sum1, sum2); - - return sum; -} - -template<> EIGEN_STRONG_INLINE int32_t predux(const Packet4i& a) -{ - int32x2_t a_lo, a_hi, sum; - - a_lo = vget_low_s32(a); - a_hi = vget_high_s32(a); - sum = vpadd_s32(a_lo, a_hi); - sum = vpadd_s32(sum, sum); - return vget_lane_s32(sum, 0); -} - -template<> EIGEN_STRONG_INLINE Packet4i preduxp(const Packet4i* vecs) -{ - int32x4x2_t vtrn1, vtrn2, res1, res2; - Packet4i sum1, sum2, sum; - - // NEON zip performs interleaving of the supplied vectors. - // We perform two interleaves in a row to acquire the transposed vector - vtrn1 = vzipq_s32(vecs[0], vecs[2]); - vtrn2 = vzipq_s32(vecs[1], vecs[3]); - res1 = vzipq_s32(vtrn1.val[0], vtrn2.val[0]); - res2 = vzipq_s32(vtrn1.val[1], vtrn2.val[1]); - - // Do the addition of the resulting vectors - sum1 = vaddq_s32(res1.val[0], res1.val[1]); - sum2 = vaddq_s32(res2.val[0], res2.val[1]); - sum = vaddq_s32(sum1, sum2); - - return sum; -} - -// Other reduction functions: -// mul -template<> EIGEN_STRONG_INLINE float predux_mul(const Packet4f& a) -{ - float32x2_t a_lo, a_hi, prod; - - // Get a_lo = |a1|a2| and a_hi = |a3|a4| - a_lo = vget_low_f32(a); - a_hi = vget_high_f32(a); - // Get the product of a_lo * a_hi -> |a1*a3|a2*a4| - prod = vmul_f32(a_lo, a_hi); - // Multiply prod with its swapped value |a2*a4|a1*a3| - prod = vmul_f32(prod, vrev64_f32(prod)); - - return vget_lane_f32(prod, 0); -} -template<> EIGEN_STRONG_INLINE int32_t predux_mul(const Packet4i& a) -{ - int32x2_t a_lo, a_hi, prod; - - // Get a_lo = |a1|a2| and a_hi = |a3|a4| - a_lo = vget_low_s32(a); - a_hi = vget_high_s32(a); - // Get the product of a_lo * a_hi -> |a1*a3|a2*a4| - prod = vmul_s32(a_lo, a_hi); - // Multiply prod with its swapped value |a2*a4|a1*a3| - prod = vmul_s32(prod, vrev64_s32(prod)); - - return vget_lane_s32(prod, 0); -} - -// min -template<> EIGEN_STRONG_INLINE float predux_min(const Packet4f& a) -{ - float32x2_t a_lo, a_hi, min; - - a_lo = vget_low_f32(a); - a_hi = vget_high_f32(a); - min = vpmin_f32(a_lo, a_hi); - min = vpmin_f32(min, min); - - return vget_lane_f32(min, 0); -} - -template<> EIGEN_STRONG_INLINE int32_t predux_min(const Packet4i& a) -{ - int32x2_t a_lo, a_hi, min; - - a_lo = vget_low_s32(a); - a_hi = vget_high_s32(a); - min = vpmin_s32(a_lo, a_hi); - min = vpmin_s32(min, min); - - return vget_lane_s32(min, 0); -} - -// max -template<> EIGEN_STRONG_INLINE float predux_max(const Packet4f& a) -{ - float32x2_t a_lo, a_hi, max; - - a_lo = vget_low_f32(a); - a_hi = vget_high_f32(a); - max = vpmax_f32(a_lo, a_hi); - max = vpmax_f32(max, max); - - return vget_lane_f32(max, 0); -} - -template<> EIGEN_STRONG_INLINE int32_t predux_max(const Packet4i& a) -{ - int32x2_t a_lo, a_hi, max; - - a_lo = vget_low_s32(a); - a_hi = vget_high_s32(a); - max = vpmax_s32(a_lo, a_hi); - max = vpmax_s32(max, max); - - return vget_lane_s32(max, 0); -} - -// this PALIGN_NEON business is to work around a bug in LLVM Clang 3.0 causing incorrect compilation errors, -// see bug 347 and this LLVM bug: http://llvm.org/bugs/show_bug.cgi?id=11074 -#define PALIGN_NEON(Offset,Type,Command) \ -template<>\ -struct palign_impl\ -{\ - EIGEN_STRONG_INLINE static void run(Type& first, const Type& second)\ - {\ - if (Offset!=0)\ - first = Command(first, second, Offset);\ - }\ -};\ - -PALIGN_NEON(0,Packet4f,vextq_f32) -PALIGN_NEON(1,Packet4f,vextq_f32) -PALIGN_NEON(2,Packet4f,vextq_f32) -PALIGN_NEON(3,Packet4f,vextq_f32) -PALIGN_NEON(0,Packet4i,vextq_s32) -PALIGN_NEON(1,Packet4i,vextq_s32) -PALIGN_NEON(2,Packet4i,vextq_s32) -PALIGN_NEON(3,Packet4i,vextq_s32) - -#undef PALIGN_NEON - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - float32x4x2_t tmp1 = vzipq_f32(kernel.packet[0], kernel.packet[1]); - float32x4x2_t tmp2 = vzipq_f32(kernel.packet[2], kernel.packet[3]); - - kernel.packet[0] = vcombine_f32(vget_low_f32(tmp1.val[0]), vget_low_f32(tmp2.val[0])); - kernel.packet[1] = vcombine_f32(vget_high_f32(tmp1.val[0]), vget_high_f32(tmp2.val[0])); - kernel.packet[2] = vcombine_f32(vget_low_f32(tmp1.val[1]), vget_low_f32(tmp2.val[1])); - kernel.packet[3] = vcombine_f32(vget_high_f32(tmp1.val[1]), vget_high_f32(tmp2.val[1])); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - int32x4x2_t tmp1 = vzipq_s32(kernel.packet[0], kernel.packet[1]); - int32x4x2_t tmp2 = vzipq_s32(kernel.packet[2], kernel.packet[3]); - kernel.packet[0] = vcombine_s32(vget_low_s32(tmp1.val[0]), vget_low_s32(tmp2.val[0])); - kernel.packet[1] = vcombine_s32(vget_high_s32(tmp1.val[0]), vget_high_s32(tmp2.val[0])); - kernel.packet[2] = vcombine_s32(vget_low_s32(tmp1.val[1]), vget_low_s32(tmp2.val[1])); - kernel.packet[3] = vcombine_s32(vget_high_s32(tmp1.val[1]), vget_high_s32(tmp2.val[1])); -} - -//---------- double ---------- - -// Clang 3.5 in the iOS toolchain has an ICE triggered by NEON intrisics for double. -// Confirmed at least with __apple_build_version__ = 6000054. -#ifdef __apple_build_version__ -// Let's hope that by the time __apple_build_version__ hits the 601* range, the bug will be fixed. -// https://gist.github.com/yamaya/2924292 suggests that the 3 first digits are only updated with -// major toolchain updates. -#define EIGEN_APPLE_DOUBLE_NEON_BUG (__apple_build_version__ < 6010000) -#else -#define EIGEN_APPLE_DOUBLE_NEON_BUG 0 -#endif - -#if EIGEN_ARCH_ARM64 && !EIGEN_APPLE_DOUBLE_NEON_BUG - -// Bug 907: workaround missing declarations of the following two functions in the ADK -// Defining these functions as templates ensures that if these intrinsics are -// already defined in arm_neon.h, then our workaround doesn't cause a conflict -// and has lower priority in overload resolution. -template -uint64x2_t vreinterpretq_u64_f64(T a) -{ - return (uint64x2_t) a; -} - -template -float64x2_t vreinterpretq_f64_u64(T a) -{ - return (float64x2_t) a; -} - -typedef float64x2_t Packet2d; -typedef float64x1_t Packet1d; - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet2d type; - typedef Packet2d half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 2, - HasHalfPacket=0, - - HasDiv = 1, - // FIXME check the Has* - HasSin = 0, - HasCos = 0, - HasLog = 0, - HasExp = 0, - HasSqrt = 0 - }; -}; - -template<> struct unpacket_traits { typedef double type; enum {size=2, alignment=Aligned16}; typedef Packet2d half; }; - -template<> EIGEN_STRONG_INLINE Packet2d pset1(const double& from) { return vdupq_n_f64(from); } - -template<> EIGEN_STRONG_INLINE Packet2d plset(const double& a) -{ - const double countdown_raw[] = {0.0,1.0}; - const Packet2d countdown = vld1q_f64(countdown_raw); - return vaddq_f64(pset1(a), countdown); -} -template<> EIGEN_STRONG_INLINE Packet2d padd(const Packet2d& a, const Packet2d& b) { return vaddq_f64(a,b); } - -template<> EIGEN_STRONG_INLINE Packet2d psub(const Packet2d& a, const Packet2d& b) { return vsubq_f64(a,b); } - -template<> EIGEN_STRONG_INLINE Packet2d pnegate(const Packet2d& a) { return vnegq_f64(a); } - -template<> EIGEN_STRONG_INLINE Packet2d pconj(const Packet2d& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet2d pmul(const Packet2d& a, const Packet2d& b) { return vmulq_f64(a,b); } - -template<> EIGEN_STRONG_INLINE Packet2d pdiv(const Packet2d& a, const Packet2d& b) { return vdivq_f64(a,b); } - -#ifdef __ARM_FEATURE_FMA -// See bug 936. See above comment about FMA for float. -template<> EIGEN_STRONG_INLINE Packet2d pmadd(const Packet2d& a, const Packet2d& b, const Packet2d& c) { return vfmaq_f64(c,a,b); } -#else -template<> EIGEN_STRONG_INLINE Packet2d pmadd(const Packet2d& a, const Packet2d& b, const Packet2d& c) { return vmlaq_f64(c,a,b); } -#endif - -template<> EIGEN_STRONG_INLINE Packet2d pmin(const Packet2d& a, const Packet2d& b) { return vminq_f64(a,b); } - -template<> EIGEN_STRONG_INLINE Packet2d pmax(const Packet2d& a, const Packet2d& b) { return vmaxq_f64(a,b); } - -// Logical Operations are not supported for float, so we have to reinterpret casts using NEON intrinsics -template<> EIGEN_STRONG_INLINE Packet2d pand(const Packet2d& a, const Packet2d& b) -{ - return vreinterpretq_f64_u64(vandq_u64(vreinterpretq_u64_f64(a),vreinterpretq_u64_f64(b))); -} - -template<> EIGEN_STRONG_INLINE Packet2d por(const Packet2d& a, const Packet2d& b) -{ - return vreinterpretq_f64_u64(vorrq_u64(vreinterpretq_u64_f64(a),vreinterpretq_u64_f64(b))); -} - -template<> EIGEN_STRONG_INLINE Packet2d pxor(const Packet2d& a, const Packet2d& b) -{ - return vreinterpretq_f64_u64(veorq_u64(vreinterpretq_u64_f64(a),vreinterpretq_u64_f64(b))); -} - -template<> EIGEN_STRONG_INLINE Packet2d pandnot(const Packet2d& a, const Packet2d& b) -{ - return vreinterpretq_f64_u64(vbicq_u64(vreinterpretq_u64_f64(a),vreinterpretq_u64_f64(b))); -} - -template<> EIGEN_STRONG_INLINE Packet2d pload(const double* from) { EIGEN_DEBUG_ALIGNED_LOAD return vld1q_f64(from); } - -template<> EIGEN_STRONG_INLINE Packet2d ploadu(const double* from) { EIGEN_DEBUG_UNALIGNED_LOAD return vld1q_f64(from); } - -template<> EIGEN_STRONG_INLINE Packet2d ploaddup(const double* from) -{ - return vld1q_dup_f64(from); -} -template<> EIGEN_STRONG_INLINE void pstore(double* to, const Packet2d& from) { EIGEN_DEBUG_ALIGNED_STORE vst1q_f64(to, from); } - -template<> EIGEN_STRONG_INLINE void pstoreu(double* to, const Packet2d& from) { EIGEN_DEBUG_UNALIGNED_STORE vst1q_f64(to, from); } - -template<> EIGEN_DEVICE_FUNC inline Packet2d pgather(const double* from, Index stride) -{ - Packet2d res = pset1(0.0); - res = vsetq_lane_f64(from[0*stride], res, 0); - res = vsetq_lane_f64(from[1*stride], res, 1); - return res; -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(double* to, const Packet2d& from, Index stride) -{ - to[stride*0] = vgetq_lane_f64(from, 0); - to[stride*1] = vgetq_lane_f64(from, 1); -} -template<> EIGEN_STRONG_INLINE void prefetch(const double* addr) { EIGEN_ARM_PREFETCH(addr); } - -// FIXME only store the 2 first elements ? -template<> EIGEN_STRONG_INLINE double pfirst(const Packet2d& a) { return vgetq_lane_f64(a, 0); } - -template<> EIGEN_STRONG_INLINE Packet2d preverse(const Packet2d& a) { return vcombine_f64(vget_high_f64(a), vget_low_f64(a)); } - -template<> EIGEN_STRONG_INLINE Packet2d pabs(const Packet2d& a) { return vabsq_f64(a); } - -#if EIGEN_COMP_CLANG && defined(__apple_build_version__) -// workaround ICE, see bug 907 -template<> EIGEN_STRONG_INLINE double predux(const Packet2d& a) { return (vget_low_f64(a) + vget_high_f64(a))[0]; } -#else -template<> EIGEN_STRONG_INLINE double predux(const Packet2d& a) { return vget_lane_f64(vget_low_f64(a) + vget_high_f64(a), 0); } -#endif - -template<> EIGEN_STRONG_INLINE Packet2d preduxp(const Packet2d* vecs) -{ - float64x2_t trn1, trn2; - - // NEON zip performs interleaving of the supplied vectors. - // We perform two interleaves in a row to acquire the transposed vector - trn1 = vzip1q_f64(vecs[0], vecs[1]); - trn2 = vzip2q_f64(vecs[0], vecs[1]); - - // Do the addition of the resulting vectors - return vaddq_f64(trn1, trn2); -} -// Other reduction functions: -// mul -#if EIGEN_COMP_CLANG && defined(__apple_build_version__) -template<> EIGEN_STRONG_INLINE double predux_mul(const Packet2d& a) { return (vget_low_f64(a) * vget_high_f64(a))[0]; } -#else -template<> EIGEN_STRONG_INLINE double predux_mul(const Packet2d& a) { return vget_lane_f64(vget_low_f64(a) * vget_high_f64(a), 0); } -#endif - -// min -template<> EIGEN_STRONG_INLINE double predux_min(const Packet2d& a) { return vgetq_lane_f64(vpminq_f64(a, a), 0); } - -// max -template<> EIGEN_STRONG_INLINE double predux_max(const Packet2d& a) { return vgetq_lane_f64(vpmaxq_f64(a, a), 0); } - -// this PALIGN_NEON business is to work around a bug in LLVM Clang 3.0 causing incorrect compilation errors, -// see bug 347 and this LLVM bug: http://llvm.org/bugs/show_bug.cgi?id=11074 -#define PALIGN_NEON(Offset,Type,Command) \ -template<>\ -struct palign_impl\ -{\ - EIGEN_STRONG_INLINE static void run(Type& first, const Type& second)\ - {\ - if (Offset!=0)\ - first = Command(first, second, Offset);\ - }\ -};\ - -PALIGN_NEON(0,Packet2d,vextq_f64) -PALIGN_NEON(1,Packet2d,vextq_f64) -#undef PALIGN_NEON - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - float64x2_t trn1 = vzip1q_f64(kernel.packet[0], kernel.packet[1]); - float64x2_t trn2 = vzip2q_f64(kernel.packet[0], kernel.packet[1]); - - kernel.packet[0] = trn1; - kernel.packet[1] = trn2; -} -#endif // EIGEN_ARCH_ARM64 - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PACKET_MATH_NEON_H diff --git a/Eigen/src/Core/arch/SSE/Complex.h b/Eigen/src/Core/arch/SSE/Complex.h deleted file mode 100644 index 23e717f28..000000000 --- a/Eigen/src/Core/arch/SSE/Complex.h +++ /dev/null @@ -1,471 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX_SSE_H -#define EIGEN_COMPLEX_SSE_H - -namespace Eigen { - -namespace internal { - -//---------- float ---------- -struct Packet2cf -{ - EIGEN_STRONG_INLINE Packet2cf() {} - EIGEN_STRONG_INLINE explicit Packet2cf(const __m128& a) : v(a) {} - __m128 v; -}; - -// Use the packet_traits defined in AVX/PacketMath.h instead if we're going -// to leverage AVX instructions. -#ifndef EIGEN_VECTORIZE_AVX -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet2cf type; - typedef Packet2cf half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 2, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0, - HasBlend = 1 - }; -}; -#endif - -template<> struct unpacket_traits { typedef std::complex type; enum {size=2, alignment=Aligned16}; typedef Packet2cf half; }; - -template<> EIGEN_STRONG_INLINE Packet2cf padd(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(_mm_add_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf psub(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(_mm_sub_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pnegate(const Packet2cf& a) -{ - const __m128 mask = _mm_castsi128_ps(_mm_setr_epi32(0x80000000,0x80000000,0x80000000,0x80000000)); - return Packet2cf(_mm_xor_ps(a.v,mask)); -} -template<> EIGEN_STRONG_INLINE Packet2cf pconj(const Packet2cf& a) -{ - const __m128 mask = _mm_castsi128_ps(_mm_setr_epi32(0x00000000,0x80000000,0x00000000,0x80000000)); - return Packet2cf(_mm_xor_ps(a.v,mask)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) -{ - #ifdef EIGEN_VECTORIZE_SSE3 - return Packet2cf(_mm_addsub_ps(_mm_mul_ps(_mm_moveldup_ps(a.v), b.v), - _mm_mul_ps(_mm_movehdup_ps(a.v), - vec4f_swizzle1(b.v, 1, 0, 3, 2)))); -// return Packet2cf(_mm_addsub_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 0, 0, 2, 2), b.v), -// _mm_mul_ps(vec4f_swizzle1(a.v, 1, 1, 3, 3), -// vec4f_swizzle1(b.v, 1, 0, 3, 2)))); - #else - const __m128 mask = _mm_castsi128_ps(_mm_setr_epi32(0x80000000,0x00000000,0x80000000,0x00000000)); - return Packet2cf(_mm_add_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 0, 0, 2, 2), b.v), - _mm_xor_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 1, 1, 3, 3), - vec4f_swizzle1(b.v, 1, 0, 3, 2)), mask))); - #endif -} - -template<> EIGEN_STRONG_INLINE Packet2cf pand (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(_mm_and_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf por (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(_mm_or_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pxor (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(_mm_xor_ps(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pandnot(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(_mm_andnot_ps(a.v,b.v)); } - -template<> EIGEN_STRONG_INLINE Packet2cf pload (const std::complex* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet2cf(pload(&numext::real_ref(*from))); } -template<> EIGEN_STRONG_INLINE Packet2cf ploadu(const std::complex* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet2cf(ploadu(&numext::real_ref(*from))); } - -template<> EIGEN_STRONG_INLINE Packet2cf pset1(const std::complex& from) -{ - Packet2cf res; -#if EIGEN_GNUC_AT_MOST(4,2) - // Workaround annoying "may be used uninitialized in this function" warning with gcc 4.2 - res.v = _mm_loadl_pi(_mm_set1_ps(0.0f), reinterpret_cast(&from)); -#elif EIGEN_GNUC_AT_LEAST(4,6) - // Suppress annoying "may be used uninitialized in this function" warning with gcc >= 4.6 - #pragma GCC diagnostic push - #pragma GCC diagnostic ignored "-Wuninitialized" - res.v = _mm_loadl_pi(res.v, (const __m64*)&from); - #pragma GCC diagnostic pop -#else - res.v = _mm_loadl_pi(res.v, (const __m64*)&from); -#endif - return Packet2cf(_mm_movelh_ps(res.v,res.v)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet2cf& from) { EIGEN_DEBUG_ALIGNED_STORE pstore(&numext::real_ref(*to), Packet4f(from.v)); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet2cf& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu(&numext::real_ref(*to), Packet4f(from.v)); } - - -template<> EIGEN_DEVICE_FUNC inline Packet2cf pgather, Packet2cf>(const std::complex* from, Index stride) -{ - return Packet2cf(_mm_set_ps(std::imag(from[1*stride]), std::real(from[1*stride]), - std::imag(from[0*stride]), std::real(from[0*stride]))); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet2cf>(std::complex* to, const Packet2cf& from, Index stride) -{ - to[stride*0] = std::complex(_mm_cvtss_f32(_mm_shuffle_ps(from.v, from.v, 0)), - _mm_cvtss_f32(_mm_shuffle_ps(from.v, from.v, 1))); - to[stride*1] = std::complex(_mm_cvtss_f32(_mm_shuffle_ps(from.v, from.v, 2)), - _mm_cvtss_f32(_mm_shuffle_ps(from.v, from.v, 3))); -} - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet2cf& a) -{ - #if EIGEN_GNUC_AT_MOST(4,3) - // Workaround gcc 4.2 ICE - this is not performance wise ideal, but who cares... - // This workaround also fix invalid code generation with gcc 4.3 - EIGEN_ALIGN16 std::complex res[2]; - _mm_store_ps((float*)res, a.v); - return res[0]; - #else - std::complex res; - _mm_storel_pi((__m64*)&res, a.v); - return res; - #endif -} - -template<> EIGEN_STRONG_INLINE Packet2cf preverse(const Packet2cf& a) { return Packet2cf(_mm_castpd_ps(preverse(Packet2d(_mm_castps_pd(a.v))))); } - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet2cf& a) -{ - return pfirst(Packet2cf(_mm_add_ps(a.v, _mm_movehl_ps(a.v,a.v)))); -} - -template<> EIGEN_STRONG_INLINE Packet2cf preduxp(const Packet2cf* vecs) -{ - return Packet2cf(_mm_add_ps(_mm_movelh_ps(vecs[0].v,vecs[1].v), _mm_movehl_ps(vecs[1].v,vecs[0].v))); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet2cf& a) -{ - return pfirst(pmul(a, Packet2cf(_mm_movehl_ps(a.v,a.v)))); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2cf& first, const Packet2cf& second) - { - if (Offset==1) - { - first.v = _mm_movehl_ps(first.v, first.v); - first.v = _mm_movelh_ps(first.v, second.v); - } - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - #ifdef EIGEN_VECTORIZE_SSE3 - return internal::pmul(a, pconj(b)); - #else - const __m128 mask = _mm_castsi128_ps(_mm_setr_epi32(0x00000000,0x80000000,0x00000000,0x80000000)); - return Packet2cf(_mm_add_ps(_mm_xor_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 0, 0, 2, 2), b.v), mask), - _mm_mul_ps(vec4f_swizzle1(a.v, 1, 1, 3, 3), - vec4f_swizzle1(b.v, 1, 0, 3, 2)))); - #endif - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - #ifdef EIGEN_VECTORIZE_SSE3 - return internal::pmul(pconj(a), b); - #else - const __m128 mask = _mm_castsi128_ps(_mm_setr_epi32(0x00000000,0x80000000,0x00000000,0x80000000)); - return Packet2cf(_mm_add_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 0, 0, 2, 2), b.v), - _mm_xor_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 1, 1, 3, 3), - vec4f_swizzle1(b.v, 1, 0, 3, 2)), mask))); - #endif - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - #ifdef EIGEN_VECTORIZE_SSE3 - return pconj(internal::pmul(a, b)); - #else - const __m128 mask = _mm_castsi128_ps(_mm_setr_epi32(0x00000000,0x80000000,0x00000000,0x80000000)); - return Packet2cf(_mm_sub_ps(_mm_xor_ps(_mm_mul_ps(vec4f_swizzle1(a.v, 0, 0, 2, 2), b.v), mask), - _mm_mul_ps(vec4f_swizzle1(a.v, 1, 1, 3, 3), - vec4f_swizzle1(b.v, 1, 0, 3, 2)))); - #endif - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) - -template<> EIGEN_STRONG_INLINE Packet2cf pdiv(const Packet2cf& a, const Packet2cf& b) -{ - // TODO optimize it for SSE3 and 4 - Packet2cf res = conj_helper().pmul(a,b); - __m128 s = _mm_mul_ps(b.v,b.v); - return Packet2cf(_mm_div_ps(res.v,_mm_add_ps(s,_mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(s), 0xb1))))); -} - -EIGEN_STRONG_INLINE Packet2cf pcplxflip/* */(const Packet2cf& x) -{ - return Packet2cf(vec4f_swizzle1(x.v, 1, 0, 3, 2)); -} - - -//---------- double ---------- -struct Packet1cd -{ - EIGEN_STRONG_INLINE Packet1cd() {} - EIGEN_STRONG_INLINE explicit Packet1cd(const __m128d& a) : v(a) {} - __m128d v; -}; - -// Use the packet_traits defined in AVX/PacketMath.h instead if we're going -// to leverage AVX instructions. -#ifndef EIGEN_VECTORIZE_AVX -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet1cd type; - typedef Packet1cd half; - enum { - Vectorizable = 1, - AlignedOnScalar = 0, - size = 1, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; -#endif - -template<> struct unpacket_traits { typedef std::complex type; enum {size=1, alignment=Aligned16}; typedef Packet1cd half; }; - -template<> EIGEN_STRONG_INLINE Packet1cd padd(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(_mm_add_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd psub(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(_mm_sub_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pnegate(const Packet1cd& a) { return Packet1cd(pnegate(Packet2d(a.v))); } -template<> EIGEN_STRONG_INLINE Packet1cd pconj(const Packet1cd& a) -{ - const __m128d mask = _mm_castsi128_pd(_mm_set_epi32(0x80000000,0x0,0x0,0x0)); - return Packet1cd(_mm_xor_pd(a.v,mask)); -} - -template<> EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) -{ - #ifdef EIGEN_VECTORIZE_SSE3 - return Packet1cd(_mm_addsub_pd(_mm_mul_pd(_mm_movedup_pd(a.v), b.v), - _mm_mul_pd(vec2d_swizzle1(a.v, 1, 1), - vec2d_swizzle1(b.v, 1, 0)))); - #else - const __m128d mask = _mm_castsi128_pd(_mm_set_epi32(0x0,0x0,0x80000000,0x0)); - return Packet1cd(_mm_add_pd(_mm_mul_pd(vec2d_swizzle1(a.v, 0, 0), b.v), - _mm_xor_pd(_mm_mul_pd(vec2d_swizzle1(a.v, 1, 1), - vec2d_swizzle1(b.v, 1, 0)), mask))); - #endif -} - -template<> EIGEN_STRONG_INLINE Packet1cd pand (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(_mm_and_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd por (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(_mm_or_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pxor (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(_mm_xor_pd(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pandnot(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(_mm_andnot_pd(a.v,b.v)); } - -// FIXME force unaligned load, this is a temporary fix -template<> EIGEN_STRONG_INLINE Packet1cd pload (const std::complex* from) -{ EIGEN_DEBUG_ALIGNED_LOAD return Packet1cd(pload((const double*)from)); } -template<> EIGEN_STRONG_INLINE Packet1cd ploadu(const std::complex* from) -{ EIGEN_DEBUG_UNALIGNED_LOAD return Packet1cd(ploadu((const double*)from)); } -template<> EIGEN_STRONG_INLINE Packet1cd pset1(const std::complex& from) -{ /* here we really have to use unaligned loads :( */ return ploadu(&from); } - -template<> EIGEN_STRONG_INLINE Packet1cd ploaddup(const std::complex* from) { return pset1(*from); } - -// FIXME force unaligned store, this is a temporary fix -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet1cd& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((double*)to, Packet2d(from.v)); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet1cd& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((double*)to, Packet2d(from.v)); } - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet1cd& a) -{ - EIGEN_ALIGN16 double res[2]; - _mm_store_pd(res, a.v); - return std::complex(res[0],res[1]); -} - -template<> EIGEN_STRONG_INLINE Packet1cd preverse(const Packet1cd& a) { return a; } - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet1cd& a) -{ - return pfirst(a); -} - -template<> EIGEN_STRONG_INLINE Packet1cd preduxp(const Packet1cd* vecs) -{ - return vecs[0]; -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet1cd& a) -{ - return pfirst(a); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet1cd& /*first*/, const Packet1cd& /*second*/) - { - // FIXME is it sure we never have to align a Packet1cd? - // Even though a std::complex has 16 bytes, it is not necessarily aligned on a 16 bytes boundary... - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - #ifdef EIGEN_VECTORIZE_SSE3 - return internal::pmul(a, pconj(b)); - #else - const __m128d mask = _mm_castsi128_pd(_mm_set_epi32(0x80000000,0x0,0x0,0x0)); - return Packet1cd(_mm_add_pd(_mm_xor_pd(_mm_mul_pd(vec2d_swizzle1(a.v, 0, 0), b.v), mask), - _mm_mul_pd(vec2d_swizzle1(a.v, 1, 1), - vec2d_swizzle1(b.v, 1, 0)))); - #endif - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - #ifdef EIGEN_VECTORIZE_SSE3 - return internal::pmul(pconj(a), b); - #else - const __m128d mask = _mm_castsi128_pd(_mm_set_epi32(0x80000000,0x0,0x0,0x0)); - return Packet1cd(_mm_add_pd(_mm_mul_pd(vec2d_swizzle1(a.v, 0, 0), b.v), - _mm_xor_pd(_mm_mul_pd(vec2d_swizzle1(a.v, 1, 1), - vec2d_swizzle1(b.v, 1, 0)), mask))); - #endif - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - #ifdef EIGEN_VECTORIZE_SSE3 - return pconj(internal::pmul(a, b)); - #else - const __m128d mask = _mm_castsi128_pd(_mm_set_epi32(0x80000000,0x0,0x0,0x0)); - return Packet1cd(_mm_sub_pd(_mm_xor_pd(_mm_mul_pd(vec2d_swizzle1(a.v, 0, 0), b.v), mask), - _mm_mul_pd(vec2d_swizzle1(a.v, 1, 1), - vec2d_swizzle1(b.v, 1, 0)))); - #endif - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) - -template<> EIGEN_STRONG_INLINE Packet1cd pdiv(const Packet1cd& a, const Packet1cd& b) -{ - // TODO optimize it for SSE3 and 4 - Packet1cd res = conj_helper().pmul(a,b); - __m128d s = _mm_mul_pd(b.v,b.v); - return Packet1cd(_mm_div_pd(res.v, _mm_add_pd(s,_mm_shuffle_pd(s, s, 0x1)))); -} - -EIGEN_STRONG_INLINE Packet1cd pcplxflip/* */(const Packet1cd& x) -{ - return Packet1cd(preverse(Packet2d(x.v))); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m128d w1 = _mm_castps_pd(kernel.packet[0].v); - __m128d w2 = _mm_castps_pd(kernel.packet[1].v); - - __m128 tmp = _mm_castpd_ps(_mm_unpackhi_pd(w1, w2)); - kernel.packet[0].v = _mm_castpd_ps(_mm_unpacklo_pd(w1, w2)); - kernel.packet[1].v = tmp; -} - -template<> EIGEN_STRONG_INLINE Packet2cf pblend(const Selector<2>& ifPacket, const Packet2cf& thenPacket, const Packet2cf& elsePacket) { - __m128d result = pblend(ifPacket, _mm_castps_pd(thenPacket.v), _mm_castps_pd(elsePacket.v)); - return Packet2cf(_mm_castpd_ps(result)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pinsertfirst(const Packet2cf& a, std::complex b) -{ - return Packet2cf(_mm_loadl_pi(a.v, reinterpret_cast(&b))); -} - -template<> EIGEN_STRONG_INLINE Packet1cd pinsertfirst(const Packet1cd&, std::complex b) -{ - return pset1(b); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pinsertlast(const Packet2cf& a, std::complex b) -{ - return Packet2cf(_mm_loadh_pi(a.v, reinterpret_cast(&b))); -} - -template<> EIGEN_STRONG_INLINE Packet1cd pinsertlast(const Packet1cd&, std::complex b) -{ - return pset1(b); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX_SSE_H diff --git a/Eigen/src/Core/arch/SSE/MathFunctions.h b/Eigen/src/Core/arch/SSE/MathFunctions.h deleted file mode 100644 index 7b5f948e1..000000000 --- a/Eigen/src/Core/arch/SSE/MathFunctions.h +++ /dev/null @@ -1,562 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2007 Julien Pommier -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* The sin, cos, exp, and log functions of this file come from - * Julien Pommier's sse math library: http://gruntthepeon.free.fr/ssemath/ - */ - -#ifndef EIGEN_MATH_FUNCTIONS_SSE_H -#define EIGEN_MATH_FUNCTIONS_SSE_H - -namespace Eigen { - -namespace internal { - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f plog(const Packet4f& _x) -{ - Packet4f x = _x; - _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); - _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet4i(0x7f, 0x7f); - - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(inv_mant_mask, ~0x7f800000); - - /* the smallest non denormalized float number */ - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(min_norm_pos, 0x00800000); - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(minus_inf, 0xff800000);//-1.f/0.f); - - /* natural logarithm computed for 4 simultaneous float - return NaN for x <= 0 - */ - _EIGEN_DECLARE_CONST_Packet4f(cephes_SQRTHF, 0.707106781186547524f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p0, 7.0376836292E-2f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p1, - 1.1514610310E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p2, 1.1676998740E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p3, - 1.2420140846E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p4, + 1.4249322787E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p5, - 1.6668057665E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p6, + 2.0000714765E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p7, - 2.4999993993E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p8, + 3.3333331174E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q1, -2.12194440e-4f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q2, 0.693359375f); - - - Packet4i emm0; - - Packet4f invalid_mask = _mm_cmpnge_ps(x, _mm_setzero_ps()); // not greater equal is true if x is NaN - Packet4f iszero_mask = _mm_cmpeq_ps(x, _mm_setzero_ps()); - - x = pmax(x, p4f_min_norm_pos); /* cut off denormalized stuff */ - emm0 = _mm_srli_epi32(_mm_castps_si128(x), 23); - - /* keep only the fractional part */ - x = _mm_and_ps(x, p4f_inv_mant_mask); - x = _mm_or_ps(x, p4f_half); - - emm0 = _mm_sub_epi32(emm0, p4i_0x7f); - Packet4f e = padd(Packet4f(_mm_cvtepi32_ps(emm0)), p4f_1); - - /* part2: - if( x < SQRTHF ) { - e -= 1; - x = x + x - 1.0; - } else { x = x - 1.0; } - */ - Packet4f mask = _mm_cmplt_ps(x, p4f_cephes_SQRTHF); - Packet4f tmp = pand(x, mask); - x = psub(x, p4f_1); - e = psub(e, pand(p4f_1, mask)); - x = padd(x, tmp); - - Packet4f x2 = pmul(x,x); - Packet4f x3 = pmul(x2,x); - - Packet4f y, y1, y2; - y = pmadd(p4f_cephes_log_p0, x, p4f_cephes_log_p1); - y1 = pmadd(p4f_cephes_log_p3, x, p4f_cephes_log_p4); - y2 = pmadd(p4f_cephes_log_p6, x, p4f_cephes_log_p7); - y = pmadd(y , x, p4f_cephes_log_p2); - y1 = pmadd(y1, x, p4f_cephes_log_p5); - y2 = pmadd(y2, x, p4f_cephes_log_p8); - y = pmadd(y, x3, y1); - y = pmadd(y, x3, y2); - y = pmul(y, x3); - - y1 = pmul(e, p4f_cephes_log_q1); - tmp = pmul(x2, p4f_half); - y = padd(y, y1); - x = psub(x, tmp); - y2 = pmul(e, p4f_cephes_log_q2); - x = padd(x, y); - x = padd(x, y2); - // negative arg will be NAN, 0 will be -INF - return _mm_or_ps(_mm_andnot_ps(iszero_mask, _mm_or_ps(x, invalid_mask)), - _mm_and_ps(iszero_mask, p4f_minus_inf)); -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f pexp(const Packet4f& _x) -{ - Packet4f x = _x; - _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); - _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); - _EIGEN_DECLARE_CONST_Packet4i(0x7f, 0x7f); - - - _EIGEN_DECLARE_CONST_Packet4f(exp_hi, 88.3762626647950f); - _EIGEN_DECLARE_CONST_Packet4f(exp_lo, -88.3762626647949f); - - _EIGEN_DECLARE_CONST_Packet4f(cephes_LOG2EF, 1.44269504088896341f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C1, 0.693359375f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C2, -2.12194440e-4f); - - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p0, 1.9875691500E-4f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p1, 1.3981999507E-3f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p2, 8.3334519073E-3f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p3, 4.1665795894E-2f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p4, 1.6666665459E-1f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p5, 5.0000001201E-1f); - - Packet4f tmp, fx; - Packet4i emm0; - - // clamp x - x = pmax(pmin(x, p4f_exp_hi), p4f_exp_lo); - - /* express exp(x) as exp(g + n*log(2)) */ - fx = pmadd(x, p4f_cephes_LOG2EF, p4f_half); - -#ifdef EIGEN_VECTORIZE_SSE4_1 - fx = _mm_floor_ps(fx); -#else - emm0 = _mm_cvttps_epi32(fx); - tmp = _mm_cvtepi32_ps(emm0); - /* if greater, substract 1 */ - Packet4f mask = _mm_cmpgt_ps(tmp, fx); - mask = _mm_and_ps(mask, p4f_1); - fx = psub(tmp, mask); -#endif - - tmp = pmul(fx, p4f_cephes_exp_C1); - Packet4f z = pmul(fx, p4f_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - z = pmul(x,x); - - Packet4f y = p4f_cephes_exp_p0; - y = pmadd(y, x, p4f_cephes_exp_p1); - y = pmadd(y, x, p4f_cephes_exp_p2); - y = pmadd(y, x, p4f_cephes_exp_p3); - y = pmadd(y, x, p4f_cephes_exp_p4); - y = pmadd(y, x, p4f_cephes_exp_p5); - y = pmadd(y, z, x); - y = padd(y, p4f_1); - - // build 2^n - emm0 = _mm_cvttps_epi32(fx); - emm0 = _mm_add_epi32(emm0, p4i_0x7f); - emm0 = _mm_slli_epi32(emm0, 23); - return pmax(pmul(y, Packet4f(_mm_castsi128_ps(emm0))), _x); -} -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d pexp(const Packet2d& _x) -{ - Packet2d x = _x; - - _EIGEN_DECLARE_CONST_Packet2d(1 , 1.0); - _EIGEN_DECLARE_CONST_Packet2d(2 , 2.0); - _EIGEN_DECLARE_CONST_Packet2d(half, 0.5); - - _EIGEN_DECLARE_CONST_Packet2d(exp_hi, 709.437); - _EIGEN_DECLARE_CONST_Packet2d(exp_lo, -709.436139303); - - _EIGEN_DECLARE_CONST_Packet2d(cephes_LOG2EF, 1.4426950408889634073599); - - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p0, 1.26177193074810590878e-4); - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p1, 3.02994407707441961300e-2); - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p2, 9.99999999999999999910e-1); - - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q0, 3.00198505138664455042e-6); - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q1, 2.52448340349684104192e-3); - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q2, 2.27265548208155028766e-1); - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q3, 2.00000000000000000009e0); - - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_C1, 0.693145751953125); - _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_C2, 1.42860682030941723212e-6); - static const __m128i p4i_1023_0 = _mm_setr_epi32(1023, 1023, 0, 0); - - Packet2d tmp, fx; - Packet4i emm0; - - // clamp x - x = pmax(pmin(x, p2d_exp_hi), p2d_exp_lo); - /* express exp(x) as exp(g + n*log(2)) */ - fx = pmadd(p2d_cephes_LOG2EF, x, p2d_half); - -#ifdef EIGEN_VECTORIZE_SSE4_1 - fx = _mm_floor_pd(fx); -#else - emm0 = _mm_cvttpd_epi32(fx); - tmp = _mm_cvtepi32_pd(emm0); - /* if greater, substract 1 */ - Packet2d mask = _mm_cmpgt_pd(tmp, fx); - mask = _mm_and_pd(mask, p2d_1); - fx = psub(tmp, mask); -#endif - - tmp = pmul(fx, p2d_cephes_exp_C1); - Packet2d z = pmul(fx, p2d_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - Packet2d x2 = pmul(x,x); - - Packet2d px = p2d_cephes_exp_p0; - px = pmadd(px, x2, p2d_cephes_exp_p1); - px = pmadd(px, x2, p2d_cephes_exp_p2); - px = pmul (px, x); - - Packet2d qx = p2d_cephes_exp_q0; - qx = pmadd(qx, x2, p2d_cephes_exp_q1); - qx = pmadd(qx, x2, p2d_cephes_exp_q2); - qx = pmadd(qx, x2, p2d_cephes_exp_q3); - - x = pdiv(px,psub(qx,px)); - x = pmadd(p2d_2,x,p2d_1); - - // build 2^n - emm0 = _mm_cvttpd_epi32(fx); - emm0 = _mm_add_epi32(emm0, p4i_1023_0); - emm0 = _mm_slli_epi32(emm0, 20); - emm0 = _mm_shuffle_epi32(emm0, _MM_SHUFFLE(1,2,0,3)); - return pmax(pmul(x, Packet2d(_mm_castsi128_pd(emm0))), _x); -} - -/* evaluation of 4 sines at onces, using SSE2 intrinsics. - - The code is the exact rewriting of the cephes sinf function. - Precision is excellent as long as x < 8192 (I did not bother to - take into account the special handling they have for greater values - -- it does not return garbage for arguments over 8192, though, but - the extra precision is missing). - - Note that it is such that sinf((float)M_PI) = 8.74e-8, which is the - surprising but correct result. -*/ - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f psin(const Packet4f& _x) -{ - Packet4f x = _x; - _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); - _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); - - _EIGEN_DECLARE_CONST_Packet4i(1, 1); - _EIGEN_DECLARE_CONST_Packet4i(not1, ~1); - _EIGEN_DECLARE_CONST_Packet4i(2, 2); - _EIGEN_DECLARE_CONST_Packet4i(4, 4); - - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(sign_mask, 0x80000000); - - _EIGEN_DECLARE_CONST_Packet4f(minus_cephes_DP1,-0.78515625f); - _EIGEN_DECLARE_CONST_Packet4f(minus_cephes_DP2, -2.4187564849853515625e-4f); - _EIGEN_DECLARE_CONST_Packet4f(minus_cephes_DP3, -3.77489497744594108e-8f); - _EIGEN_DECLARE_CONST_Packet4f(sincof_p0, -1.9515295891E-4f); - _EIGEN_DECLARE_CONST_Packet4f(sincof_p1, 8.3321608736E-3f); - _EIGEN_DECLARE_CONST_Packet4f(sincof_p2, -1.6666654611E-1f); - _EIGEN_DECLARE_CONST_Packet4f(coscof_p0, 2.443315711809948E-005f); - _EIGEN_DECLARE_CONST_Packet4f(coscof_p1, -1.388731625493765E-003f); - _EIGEN_DECLARE_CONST_Packet4f(coscof_p2, 4.166664568298827E-002f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_FOPI, 1.27323954473516f); // 4 / M_PI - - Packet4f xmm1, xmm2, xmm3, sign_bit, y; - - Packet4i emm0, emm2; - sign_bit = x; - /* take the absolute value */ - x = pabs(x); - - /* take the modulo */ - - /* extract the sign bit (upper one) */ - sign_bit = _mm_and_ps(sign_bit, p4f_sign_mask); - - /* scale by 4/Pi */ - y = pmul(x, p4f_cephes_FOPI); - - /* store the integer part of y in mm0 */ - emm2 = _mm_cvttps_epi32(y); - /* j=(j+1) & (~1) (see the cephes sources) */ - emm2 = _mm_add_epi32(emm2, p4i_1); - emm2 = _mm_and_si128(emm2, p4i_not1); - y = _mm_cvtepi32_ps(emm2); - /* get the swap sign flag */ - emm0 = _mm_and_si128(emm2, p4i_4); - emm0 = _mm_slli_epi32(emm0, 29); - /* get the polynom selection mask - there is one polynom for 0 <= x <= Pi/4 - and another one for Pi/4 EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f pcos(const Packet4f& _x) -{ - Packet4f x = _x; - _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); - _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); - - _EIGEN_DECLARE_CONST_Packet4i(1, 1); - _EIGEN_DECLARE_CONST_Packet4i(not1, ~1); - _EIGEN_DECLARE_CONST_Packet4i(2, 2); - _EIGEN_DECLARE_CONST_Packet4i(4, 4); - - _EIGEN_DECLARE_CONST_Packet4f(minus_cephes_DP1,-0.78515625f); - _EIGEN_DECLARE_CONST_Packet4f(minus_cephes_DP2, -2.4187564849853515625e-4f); - _EIGEN_DECLARE_CONST_Packet4f(minus_cephes_DP3, -3.77489497744594108e-8f); - _EIGEN_DECLARE_CONST_Packet4f(sincof_p0, -1.9515295891E-4f); - _EIGEN_DECLARE_CONST_Packet4f(sincof_p1, 8.3321608736E-3f); - _EIGEN_DECLARE_CONST_Packet4f(sincof_p2, -1.6666654611E-1f); - _EIGEN_DECLARE_CONST_Packet4f(coscof_p0, 2.443315711809948E-005f); - _EIGEN_DECLARE_CONST_Packet4f(coscof_p1, -1.388731625493765E-003f); - _EIGEN_DECLARE_CONST_Packet4f(coscof_p2, 4.166664568298827E-002f); - _EIGEN_DECLARE_CONST_Packet4f(cephes_FOPI, 1.27323954473516f); // 4 / M_PI - - Packet4f xmm1, xmm2, xmm3, y; - Packet4i emm0, emm2; - - x = pabs(x); - - /* scale by 4/Pi */ - y = pmul(x, p4f_cephes_FOPI); - - /* get the integer part of y */ - emm2 = _mm_cvttps_epi32(y); - /* j=(j+1) & (~1) (see the cephes sources) */ - emm2 = _mm_add_epi32(emm2, p4i_1); - emm2 = _mm_and_si128(emm2, p4i_not1); - y = _mm_cvtepi32_ps(emm2); - - emm2 = _mm_sub_epi32(emm2, p4i_2); - - /* get the swap sign flag */ - emm0 = _mm_andnot_si128(emm2, p4i_4); - emm0 = _mm_slli_epi32(emm0, 29); - /* get the polynom selection mask */ - emm2 = _mm_and_si128(emm2, p4i_2); - emm2 = _mm_cmpeq_epi32(emm2, _mm_setzero_si128()); - - Packet4f sign_bit = _mm_castsi128_ps(emm0); - Packet4f poly_mask = _mm_castsi128_ps(emm2); - - /* The magic pass: "Extended precision modular arithmetic" - x = ((x - y * DP1) - y * DP2) - y * DP3; */ - xmm1 = pmul(y, p4f_minus_cephes_DP1); - xmm2 = pmul(y, p4f_minus_cephes_DP2); - xmm3 = pmul(y, p4f_minus_cephes_DP3); - x = padd(x, xmm1); - x = padd(x, xmm2); - x = padd(x, xmm3); - - /* Evaluate the first polynom (0 <= x <= Pi/4) */ - y = p4f_coscof_p0; - Packet4f z = pmul(x,x); - - y = pmadd(y,z,p4f_coscof_p1); - y = pmadd(y,z,p4f_coscof_p2); - y = pmul(y, z); - y = pmul(y, z); - Packet4f tmp = _mm_mul_ps(z, p4f_half); - y = psub(y, tmp); - y = padd(y, p4f_1); - - /* Evaluate the second polynom (Pi/4 <= x <= 0) */ - Packet4f y2 = p4f_sincof_p0; - y2 = pmadd(y2, z, p4f_sincof_p1); - y2 = pmadd(y2, z, p4f_sincof_p2); - y2 = pmul(y2, z); - y2 = pmadd(y2, x, x); - - /* select the correct result from the two polynoms */ - y2 = _mm_and_ps(poly_mask, y2); - y = _mm_andnot_ps(poly_mask, y); - y = _mm_or_ps(y,y2); - - /* update the sign */ - return _mm_xor_ps(y, sign_bit); -} - -#if EIGEN_FAST_MATH - -// Functions for sqrt. -// The EIGEN_FAST_MATH version uses the _mm_rsqrt_ps approximation and one step -// of Newton's method, at a cost of 1-2 bits of precision as opposed to the -// exact solution. It does not handle +inf, or denormalized numbers correctly. -// The main advantage of this approach is not just speed, but also the fact that -// it can be inlined and pipelined with other computations, further reducing its -// effective latency. This is similar to Quake3's fast inverse square root. -// For detail see here: http://www.beyond3d.com/content/articles/8/ -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f psqrt(const Packet4f& _x) -{ - Packet4f half = pmul(_x, pset1(.5f)); - Packet4f denormal_mask = _mm_and_ps( - _mm_cmpge_ps(_x, _mm_setzero_ps()), - _mm_cmplt_ps(_x, pset1((std::numeric_limits::min)()))); - - // Compute approximate reciprocal sqrt. - Packet4f x = _mm_rsqrt_ps(_x); - // Do a single step of Newton's iteration. - x = pmul(x, psub(pset1(1.5f), pmul(half, pmul(x,x)))); - // Flush results for denormals to zero. - return _mm_andnot_ps(denormal_mask, pmul(_x,x)); -} - -#else - -template<>EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f psqrt(const Packet4f& x) { return _mm_sqrt_ps(x); } - -#endif - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d psqrt(const Packet2d& x) { return _mm_sqrt_pd(x); } - -#if EIGEN_FAST_MATH - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f prsqrt(const Packet4f& _x) { - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(inf, 0x7f800000); - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(nan, 0x7fc00000); - _EIGEN_DECLARE_CONST_Packet4f(one_point_five, 1.5f); - _EIGEN_DECLARE_CONST_Packet4f(minus_half, -0.5f); - _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(flt_min, 0x00800000); - - Packet4f neg_half = pmul(_x, p4f_minus_half); - - // select only the inverse sqrt of positive normal inputs (denormals are - // flushed to zero and cause infs as well). - Packet4f le_zero_mask = _mm_cmple_ps(_x, p4f_flt_min); - Packet4f x = _mm_andnot_ps(le_zero_mask, _mm_rsqrt_ps(_x)); - - // Fill in NaNs and Infs for the negative/zero entries. - Packet4f neg_mask = _mm_cmplt_ps(_x, _mm_setzero_ps()); - Packet4f zero_mask = _mm_andnot_ps(neg_mask, le_zero_mask); - Packet4f infs_and_nans = _mm_or_ps(_mm_and_ps(neg_mask, p4f_nan), - _mm_and_ps(zero_mask, p4f_inf)); - - // Do a single step of Newton's iteration. - x = pmul(x, pmadd(neg_half, pmul(x, x), p4f_one_point_five)); - - // Insert NaNs and Infs in all the right places. - return _mm_or_ps(x, infs_and_nans); -} - -#else - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f prsqrt(const Packet4f& x) { - // Unfortunately we can't use the much faster mm_rqsrt_ps since it only provides an approximation. - return _mm_div_ps(pset1(1.0f), _mm_sqrt_ps(x)); -} - -#endif - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d prsqrt(const Packet2d& x) { - // Unfortunately we can't use the much faster mm_rqsrt_pd since it only provides an approximation. - return _mm_div_pd(pset1(1.0), _mm_sqrt_pd(x)); -} - -// Hyperbolic Tangent function. -template <> -EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED Packet4f -ptanh(const Packet4f& x) { - return internal::generic_fast_tanh_float(x); -} - -} // end namespace internal - -namespace numext { - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE -float sqrt(const float &x) -{ - return internal::pfirst(internal::Packet4f(_mm_sqrt_ss(_mm_set_ss(x)))); -} - -template<> -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE -double sqrt(const double &x) -{ -#if EIGEN_COMP_GNUC_STRICT - // This works around a GCC bug generating poor code for _mm_sqrt_pd - // See https://bitbucket.org/eigen/eigen/commits/14f468dba4d350d7c19c9b93072e19f7b3df563b - return internal::pfirst(internal::Packet2d(__builtin_ia32_sqrtsd(_mm_set_sd(x)))); -#else - return internal::pfirst(internal::Packet2d(_mm_sqrt_pd(_mm_set_sd(x)))); -#endif -} - -} // end namespace numex - -} // end namespace Eigen - -#endif // EIGEN_MATH_FUNCTIONS_SSE_H diff --git a/Eigen/src/Core/arch/SSE/PacketMath.h b/Eigen/src/Core/arch/SSE/PacketMath.h deleted file mode 100755 index 03c8a2c13..000000000 --- a/Eigen/src/Core/arch/SSE/PacketMath.h +++ /dev/null @@ -1,931 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_SSE_H -#define EIGEN_PACKET_MATH_SSE_H - -namespace Eigen { - -namespace internal { - -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 8 -#endif - -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS (2*sizeof(void*)) -#endif - -#ifdef __FMA__ -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_MADD 1 -#endif -#endif - -#if (defined EIGEN_VECTORIZE_AVX) && (EIGEN_COMP_GNUC_STRICT || EIGEN_COMP_MINGW) && (__GXX_ABI_VERSION < 1004) -// With GCC's default ABI version, a __m128 or __m256 are the same types and therefore we cannot -// have overloads for both types without linking error. -// One solution is to increase ABI version using -fabi-version=4 (or greater). -// Otherwise, we workaround this inconvenience by wrapping 128bit types into the following helper -// structure: -template -struct eigen_packet_wrapper -{ - EIGEN_ALWAYS_INLINE operator T&() { return m_val; } - EIGEN_ALWAYS_INLINE operator const T&() const { return m_val; } - EIGEN_ALWAYS_INLINE eigen_packet_wrapper() {} - EIGEN_ALWAYS_INLINE eigen_packet_wrapper(const T &v) : m_val(v) {} - EIGEN_ALWAYS_INLINE eigen_packet_wrapper& operator=(const T &v) { - m_val = v; - return *this; - } - - T m_val; -}; -typedef eigen_packet_wrapper<__m128> Packet4f; -typedef eigen_packet_wrapper<__m128i> Packet4i; -typedef eigen_packet_wrapper<__m128d> Packet2d; -#else -typedef __m128 Packet4f; -typedef __m128i Packet4i; -typedef __m128d Packet2d; -#endif - -template<> struct is_arithmetic<__m128> { enum { value = true }; }; -template<> struct is_arithmetic<__m128i> { enum { value = true }; }; -template<> struct is_arithmetic<__m128d> { enum { value = true }; }; - -#define vec4f_swizzle1(v,p,q,r,s) \ - (_mm_castsi128_ps(_mm_shuffle_epi32( _mm_castps_si128(v), ((s)<<6|(r)<<4|(q)<<2|(p))))) - -#define vec4i_swizzle1(v,p,q,r,s) \ - (_mm_shuffle_epi32( v, ((s)<<6|(r)<<4|(q)<<2|(p)))) - -#define vec2d_swizzle1(v,p,q) \ - (_mm_castsi128_pd(_mm_shuffle_epi32( _mm_castpd_si128(v), ((q*2+1)<<6|(q*2)<<4|(p*2+1)<<2|(p*2))))) - -#define vec4f_swizzle2(a,b,p,q,r,s) \ - (_mm_shuffle_ps( (a), (b), ((s)<<6|(r)<<4|(q)<<2|(p)))) - -#define vec4i_swizzle2(a,b,p,q,r,s) \ - (_mm_castps_si128( (_mm_shuffle_ps( _mm_castsi128_ps(a), _mm_castsi128_ps(b), ((s)<<6|(r)<<4|(q)<<2|(p)))))) - -#define _EIGEN_DECLARE_CONST_Packet4f(NAME,X) \ - const Packet4f p4f_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet2d(NAME,X) \ - const Packet2d p2d_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(NAME,X) \ - const Packet4f p4f_##NAME = _mm_castsi128_ps(pset1(X)) - -#define _EIGEN_DECLARE_CONST_Packet4i(NAME,X) \ - const Packet4i p4i_##NAME = pset1(X) - - -// Use the packet_traits defined in AVX/PacketMath.h instead if we're going -// to leverage AVX instructions. -#ifndef EIGEN_VECTORIZE_AVX -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4f type; - typedef Packet4f half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - HasHalfPacket = 0, - - HasDiv = 1, - HasSin = EIGEN_FAST_MATH, - HasCos = EIGEN_FAST_MATH, - HasLog = 1, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasTanh = EIGEN_FAST_MATH, - HasBlend = 1 - -#ifdef EIGEN_VECTORIZE_SSE4_1 - , - HasRound = 1, - HasFloor = 1, - HasCeil = 1 -#endif - }; -}; -template<> struct packet_traits : default_packet_traits -{ - typedef Packet2d type; - typedef Packet2d half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=2, - HasHalfPacket = 0, - - HasDiv = 1, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasBlend = 1 - -#ifdef EIGEN_VECTORIZE_SSE4_1 - , - HasRound = 1, - HasFloor = 1, - HasCeil = 1 -#endif - }; -}; -#endif -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4i type; - typedef Packet4i half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - - HasBlend = 1 - }; -}; - -template<> struct unpacket_traits { typedef float type; enum {size=4, alignment=Aligned16}; typedef Packet4f half; }; -template<> struct unpacket_traits { typedef double type; enum {size=2, alignment=Aligned16}; typedef Packet2d half; }; -template<> struct unpacket_traits { typedef int type; enum {size=4, alignment=Aligned16}; typedef Packet4i half; }; - -#ifndef EIGEN_VECTORIZE_AVX -template<> struct scalar_div_cost { enum { value = 7 }; }; -template<> struct scalar_div_cost { enum { value = 8 }; }; -#endif - -#if EIGEN_COMP_MSVC==1500 -// Workaround MSVC 9 internal compiler error. -// TODO: It has been detected with win64 builds (amd64), so let's check whether it also happens in 32bits+SSE mode -// TODO: let's check whether there does not exist a better fix, like adding a pset0() function. (it crashed on pset1(0)). -template<> EIGEN_STRONG_INLINE Packet4f pset1(const float& from) { return _mm_set_ps(from,from,from,from); } -template<> EIGEN_STRONG_INLINE Packet2d pset1(const double& from) { return _mm_set_pd(from,from); } -template<> EIGEN_STRONG_INLINE Packet4i pset1(const int& from) { return _mm_set_epi32(from,from,from,from); } -#else -template<> EIGEN_STRONG_INLINE Packet4f pset1(const float& from) { return _mm_set_ps1(from); } -template<> EIGEN_STRONG_INLINE Packet2d pset1(const double& from) { return _mm_set1_pd(from); } -template<> EIGEN_STRONG_INLINE Packet4i pset1(const int& from) { return _mm_set1_epi32(from); } -#endif - -// GCC generates a shufps instruction for _mm_set1_ps/_mm_load1_ps instead of the more efficient pshufd instruction. -// However, using inrinsics for pset1 makes gcc to generate crappy code in some cases (see bug 203) -// Using inline assembly is also not an option because then gcc fails to reorder properly the instructions. -// Therefore, we introduced the pload1 functions to be used in product kernels for which bug 203 does not apply. -// Also note that with AVX, we want it to generate a vbroadcastss. -#if EIGEN_COMP_GNUC_STRICT && (!defined __AVX__) -template<> EIGEN_STRONG_INLINE Packet4f pload1(const float *from) { - return vec4f_swizzle1(_mm_load_ss(from),0,0,0,0); -} -#endif - -template<> EIGEN_STRONG_INLINE Packet4f plset(const float& a) { return _mm_add_ps(pset1(a), _mm_set_ps(3,2,1,0)); } -template<> EIGEN_STRONG_INLINE Packet2d plset(const double& a) { return _mm_add_pd(pset1(a),_mm_set_pd(1,0)); } -template<> EIGEN_STRONG_INLINE Packet4i plset(const int& a) { return _mm_add_epi32(pset1(a),_mm_set_epi32(3,2,1,0)); } - -template<> EIGEN_STRONG_INLINE Packet4f padd(const Packet4f& a, const Packet4f& b) { return _mm_add_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d padd(const Packet2d& a, const Packet2d& b) { return _mm_add_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i padd(const Packet4i& a, const Packet4i& b) { return _mm_add_epi32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f psub(const Packet4f& a, const Packet4f& b) { return _mm_sub_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d psub(const Packet2d& a, const Packet2d& b) { return _mm_sub_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i psub(const Packet4i& a, const Packet4i& b) { return _mm_sub_epi32(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pnegate(const Packet4f& a) -{ - const Packet4f mask = _mm_castsi128_ps(_mm_setr_epi32(0x80000000,0x80000000,0x80000000,0x80000000)); - return _mm_xor_ps(a,mask); -} -template<> EIGEN_STRONG_INLINE Packet2d pnegate(const Packet2d& a) -{ - const Packet2d mask = _mm_castsi128_pd(_mm_setr_epi32(0x0,0x80000000,0x0,0x80000000)); - return _mm_xor_pd(a,mask); -} -template<> EIGEN_STRONG_INLINE Packet4i pnegate(const Packet4i& a) -{ - return psub(Packet4i(_mm_setr_epi32(0,0,0,0)), a); -} - -template<> EIGEN_STRONG_INLINE Packet4f pconj(const Packet4f& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet2d pconj(const Packet2d& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet4i pconj(const Packet4i& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet4f pmul(const Packet4f& a, const Packet4f& b) { return _mm_mul_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d pmul(const Packet2d& a, const Packet2d& b) { return _mm_mul_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pmul(const Packet4i& a, const Packet4i& b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_mullo_epi32(a,b); -#else - // this version is slightly faster than 4 scalar products - return vec4i_swizzle1( - vec4i_swizzle2( - _mm_mul_epu32(a,b), - _mm_mul_epu32(vec4i_swizzle1(a,1,0,3,2), - vec4i_swizzle1(b,1,0,3,2)), - 0,2,0,2), - 0,2,1,3); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4f pdiv(const Packet4f& a, const Packet4f& b) { return _mm_div_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d pdiv(const Packet2d& a, const Packet2d& b) { return _mm_div_pd(a,b); } - -// for some weird raisons, it has to be overloaded for packet of integers -template<> EIGEN_STRONG_INLINE Packet4i pmadd(const Packet4i& a, const Packet4i& b, const Packet4i& c) { return padd(pmul(a,b), c); } -#ifdef __FMA__ -template<> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) { return _mm_fmadd_ps(a,b,c); } -template<> EIGEN_STRONG_INLINE Packet2d pmadd(const Packet2d& a, const Packet2d& b, const Packet2d& c) { return _mm_fmadd_pd(a,b,c); } -#endif - -template<> EIGEN_STRONG_INLINE Packet4f pmin(const Packet4f& a, const Packet4f& b) { -#if EIGEN_COMP_GNUC - // There appears to be a bug in GCC, by which the optimizer may - // flip the argument order in calls to _mm_min_ps, so we have to - // resort to inline ASM here. This is supposed to be fixed in gcc6.3, - // see also: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=72867 - Packet4f res = b; - asm("minps %[a], %[res]" : [res] "+x" (res) : [a] "x" (a)); - return res; -#else - // Arguments are reversed to match NaN propagation behavior of std::min. - return _mm_min_ps(b, a); -#endif -} -template<> EIGEN_STRONG_INLINE Packet2d pmin(const Packet2d& a, const Packet2d& b) { -#if EIGEN_COMP_GNUC - // There appears to be a bug in GCC, by which the optimizer may - // flip the argument order in calls to _mm_min_pd, so we have to - // resort to inline ASM here. This is supposed to be fixed in gcc6.3, - // see also: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=72867 - Packet2d res = b; - asm("minpd %[a], %[res]" : [res] "+x" (res) : [a] "x" (a)); - return res; -#else - // Arguments are reversed to match NaN propagation behavior of std::min. - return _mm_min_pd(b, a); -#endif -} -template<> EIGEN_STRONG_INLINE Packet4i pmin(const Packet4i& a, const Packet4i& b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_min_epi32(a,b); -#else - // after some bench, this version *is* faster than a scalar implementation - Packet4i mask = _mm_cmplt_epi32(a,b); - return _mm_or_si128(_mm_and_si128(mask,a),_mm_andnot_si128(mask,b)); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4f pmax(const Packet4f& a, const Packet4f& b) { -#if EIGEN_COMP_GNUC - // There appears to be a bug in GCC, by which the optimizer may - // flip the argument order in calls to _mm_max_ps, so we have to - // resort to inline ASM here. This is supposed to be fixed in gcc6.3, - // see also: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=72867 - Packet4f res = b; - asm("maxps %[a], %[res]" : [res] "+x" (res) : [a] "x" (a)); - return res; -#else - // Arguments are reversed to match NaN propagation behavior of std::max. - return _mm_max_ps(b, a); -#endif -} -template<> EIGEN_STRONG_INLINE Packet2d pmax(const Packet2d& a, const Packet2d& b) { -#if EIGEN_COMP_GNUC - // There appears to be a bug in GCC, by which the optimizer may - // flip the argument order in calls to _mm_max_pd, so we have to - // resort to inline ASM here. This is supposed to be fixed in gcc6.3, - // see also: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=72867 - Packet2d res = b; - asm("maxpd %[a], %[res]" : [res] "+x" (res) : [a] "x" (a)); - return res; -#else - // Arguments are reversed to match NaN propagation behavior of std::max. - return _mm_max_pd(b, a); -#endif -} -template<> EIGEN_STRONG_INLINE Packet4i pmax(const Packet4i& a, const Packet4i& b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_max_epi32(a,b); -#else - // after some bench, this version *is* faster than a scalar implementation - Packet4i mask = _mm_cmpgt_epi32(a,b); - return _mm_or_si128(_mm_and_si128(mask,a),_mm_andnot_si128(mask,b)); -#endif -} - -#ifdef EIGEN_VECTORIZE_SSE4_1 -template<> EIGEN_STRONG_INLINE Packet4f pround(const Packet4f& a) { return _mm_round_ps(a, 0); } -template<> EIGEN_STRONG_INLINE Packet2d pround(const Packet2d& a) { return _mm_round_pd(a, 0); } - -template<> EIGEN_STRONG_INLINE Packet4f pceil(const Packet4f& a) { return _mm_ceil_ps(a); } -template<> EIGEN_STRONG_INLINE Packet2d pceil(const Packet2d& a) { return _mm_ceil_pd(a); } - -template<> EIGEN_STRONG_INLINE Packet4f pfloor(const Packet4f& a) { return _mm_floor_ps(a); } -template<> EIGEN_STRONG_INLINE Packet2d pfloor(const Packet2d& a) { return _mm_floor_pd(a); } -#endif - -template<> EIGEN_STRONG_INLINE Packet4f pand(const Packet4f& a, const Packet4f& b) { return _mm_and_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d pand(const Packet2d& a, const Packet2d& b) { return _mm_and_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pand(const Packet4i& a, const Packet4i& b) { return _mm_and_si128(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f por(const Packet4f& a, const Packet4f& b) { return _mm_or_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d por(const Packet2d& a, const Packet2d& b) { return _mm_or_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i por(const Packet4i& a, const Packet4i& b) { return _mm_or_si128(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pxor(const Packet4f& a, const Packet4f& b) { return _mm_xor_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d pxor(const Packet2d& a, const Packet2d& b) { return _mm_xor_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pxor(const Packet4i& a, const Packet4i& b) { return _mm_xor_si128(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pandnot(const Packet4f& a, const Packet4f& b) { return _mm_andnot_ps(a,b); } -template<> EIGEN_STRONG_INLINE Packet2d pandnot(const Packet2d& a, const Packet2d& b) { return _mm_andnot_pd(a,b); } -template<> EIGEN_STRONG_INLINE Packet4i pandnot(const Packet4i& a, const Packet4i& b) { return _mm_andnot_si128(a,b); } - -template<> EIGEN_STRONG_INLINE Packet4f pload(const float* from) { EIGEN_DEBUG_ALIGNED_LOAD return _mm_load_ps(from); } -template<> EIGEN_STRONG_INLINE Packet2d pload(const double* from) { EIGEN_DEBUG_ALIGNED_LOAD return _mm_load_pd(from); } -template<> EIGEN_STRONG_INLINE Packet4i pload(const int* from) { EIGEN_DEBUG_ALIGNED_LOAD return _mm_load_si128(reinterpret_cast(from)); } - -#if EIGEN_COMP_MSVC - template<> EIGEN_STRONG_INLINE Packet4f ploadu(const float* from) { - EIGEN_DEBUG_UNALIGNED_LOAD - #if (EIGEN_COMP_MSVC==1600) - // NOTE Some version of MSVC10 generates bad code when using _mm_loadu_ps - // (i.e., it does not generate an unaligned load!! - __m128 res = _mm_loadl_pi(_mm_set1_ps(0.0f), (const __m64*)(from)); - res = _mm_loadh_pi(res, (const __m64*)(from+2)); - return res; - #else - return _mm_loadu_ps(from); - #endif - } -#else -// NOTE: with the code below, MSVC's compiler crashes! - -template<> EIGEN_STRONG_INLINE Packet4f ploadu(const float* from) -{ - EIGEN_DEBUG_UNALIGNED_LOAD - return _mm_loadu_ps(from); -} -#endif - -template<> EIGEN_STRONG_INLINE Packet2d ploadu(const double* from) -{ - EIGEN_DEBUG_UNALIGNED_LOAD - return _mm_loadu_pd(from); -} -template<> EIGEN_STRONG_INLINE Packet4i ploadu(const int* from) -{ - EIGEN_DEBUG_UNALIGNED_LOAD - return _mm_loadu_si128(reinterpret_cast(from)); -} - - -template<> EIGEN_STRONG_INLINE Packet4f ploaddup(const float* from) -{ - return vec4f_swizzle1(_mm_castpd_ps(_mm_load_sd(reinterpret_cast(from))), 0, 0, 1, 1); -} -template<> EIGEN_STRONG_INLINE Packet2d ploaddup(const double* from) -{ return pset1(from[0]); } -template<> EIGEN_STRONG_INLINE Packet4i ploaddup(const int* from) -{ - Packet4i tmp; - tmp = _mm_loadl_epi64(reinterpret_cast(from)); - return vec4i_swizzle1(tmp, 0, 0, 1, 1); -} - -template<> EIGEN_STRONG_INLINE void pstore(float* to, const Packet4f& from) { EIGEN_DEBUG_ALIGNED_STORE _mm_store_ps(to, from); } -template<> EIGEN_STRONG_INLINE void pstore(double* to, const Packet2d& from) { EIGEN_DEBUG_ALIGNED_STORE _mm_store_pd(to, from); } -template<> EIGEN_STRONG_INLINE void pstore(int* to, const Packet4i& from) { EIGEN_DEBUG_ALIGNED_STORE _mm_store_si128(reinterpret_cast<__m128i*>(to), from); } - -template<> EIGEN_STRONG_INLINE void pstoreu(double* to, const Packet2d& from) { EIGEN_DEBUG_UNALIGNED_STORE _mm_storeu_pd(to, from); } -template<> EIGEN_STRONG_INLINE void pstoreu(float* to, const Packet4f& from) { EIGEN_DEBUG_UNALIGNED_STORE _mm_storeu_ps(to, from); } -template<> EIGEN_STRONG_INLINE void pstoreu(int* to, const Packet4i& from) { EIGEN_DEBUG_UNALIGNED_STORE _mm_storeu_si128(reinterpret_cast<__m128i*>(to), from); } - -template<> EIGEN_DEVICE_FUNC inline Packet4f pgather(const float* from, Index stride) -{ - return _mm_set_ps(from[3*stride], from[2*stride], from[1*stride], from[0*stride]); -} -template<> EIGEN_DEVICE_FUNC inline Packet2d pgather(const double* from, Index stride) -{ - return _mm_set_pd(from[1*stride], from[0*stride]); -} -template<> EIGEN_DEVICE_FUNC inline Packet4i pgather(const int* from, Index stride) -{ - return _mm_set_epi32(from[3*stride], from[2*stride], from[1*stride], from[0*stride]); - } - -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const Packet4f& from, Index stride) -{ - to[stride*0] = _mm_cvtss_f32(from); - to[stride*1] = _mm_cvtss_f32(_mm_shuffle_ps(from, from, 1)); - to[stride*2] = _mm_cvtss_f32(_mm_shuffle_ps(from, from, 2)); - to[stride*3] = _mm_cvtss_f32(_mm_shuffle_ps(from, from, 3)); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(double* to, const Packet2d& from, Index stride) -{ - to[stride*0] = _mm_cvtsd_f64(from); - to[stride*1] = _mm_cvtsd_f64(_mm_shuffle_pd(from, from, 1)); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter(int* to, const Packet4i& from, Index stride) -{ - to[stride*0] = _mm_cvtsi128_si32(from); - to[stride*1] = _mm_cvtsi128_si32(_mm_shuffle_epi32(from, 1)); - to[stride*2] = _mm_cvtsi128_si32(_mm_shuffle_epi32(from, 2)); - to[stride*3] = _mm_cvtsi128_si32(_mm_shuffle_epi32(from, 3)); -} - -// some compilers might be tempted to perform multiple moves instead of using a vector path. -template<> EIGEN_STRONG_INLINE void pstore1(float* to, const float& a) -{ - Packet4f pa = _mm_set_ss(a); - pstore(to, Packet4f(vec4f_swizzle1(pa,0,0,0,0))); -} -// some compilers might be tempted to perform multiple moves instead of using a vector path. -template<> EIGEN_STRONG_INLINE void pstore1(double* to, const double& a) -{ - Packet2d pa = _mm_set_sd(a); - pstore(to, Packet2d(vec2d_swizzle1(pa,0,0))); -} - -#ifndef EIGEN_VECTORIZE_AVX -template<> EIGEN_STRONG_INLINE void prefetch(const float* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -template<> EIGEN_STRONG_INLINE void prefetch(const double* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -template<> EIGEN_STRONG_INLINE void prefetch(const int* addr) { _mm_prefetch((const char*)(addr), _MM_HINT_T0); } -#endif - -#if EIGEN_COMP_MSVC_STRICT && EIGEN_OS_WIN64 -// The temporary variable fixes an internal compilation error in vs <= 2008 and a wrong-result bug in vs 2010 -// Direct of the struct members fixed bug #62. -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { return a.m128_f32[0]; } -template<> EIGEN_STRONG_INLINE double pfirst(const Packet2d& a) { return a.m128d_f64[0]; } -template<> EIGEN_STRONG_INLINE int pfirst(const Packet4i& a) { int x = _mm_cvtsi128_si32(a); return x; } -#elif EIGEN_COMP_MSVC_STRICT -// The temporary variable fixes an internal compilation error in vs <= 2008 and a wrong-result bug in vs 2010 -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { float x = _mm_cvtss_f32(a); return x; } -template<> EIGEN_STRONG_INLINE double pfirst(const Packet2d& a) { double x = _mm_cvtsd_f64(a); return x; } -template<> EIGEN_STRONG_INLINE int pfirst(const Packet4i& a) { int x = _mm_cvtsi128_si32(a); return x; } -#else -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { return _mm_cvtss_f32(a); } -template<> EIGEN_STRONG_INLINE double pfirst(const Packet2d& a) { return _mm_cvtsd_f64(a); } -template<> EIGEN_STRONG_INLINE int pfirst(const Packet4i& a) { return _mm_cvtsi128_si32(a); } -#endif - -template<> EIGEN_STRONG_INLINE Packet4f preverse(const Packet4f& a) -{ return _mm_shuffle_ps(a,a,0x1B); } -template<> EIGEN_STRONG_INLINE Packet2d preverse(const Packet2d& a) -{ return _mm_shuffle_pd(a,a,0x1); } -template<> EIGEN_STRONG_INLINE Packet4i preverse(const Packet4i& a) -{ return _mm_shuffle_epi32(a,0x1B); } - -template<> EIGEN_STRONG_INLINE Packet4f pabs(const Packet4f& a) -{ - const Packet4f mask = _mm_castsi128_ps(_mm_setr_epi32(0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF,0x7FFFFFFF)); - return _mm_and_ps(a,mask); -} -template<> EIGEN_STRONG_INLINE Packet2d pabs(const Packet2d& a) -{ - const Packet2d mask = _mm_castsi128_pd(_mm_setr_epi32(0xFFFFFFFF,0x7FFFFFFF,0xFFFFFFFF,0x7FFFFFFF)); - return _mm_and_pd(a,mask); -} -template<> EIGEN_STRONG_INLINE Packet4i pabs(const Packet4i& a) -{ - #ifdef EIGEN_VECTORIZE_SSSE3 - return _mm_abs_epi32(a); - #else - Packet4i aux = _mm_srai_epi32(a,31); - return _mm_sub_epi32(_mm_xor_si128(a,aux),aux); - #endif -} - -// with AVX, the default implementations based on pload1 are faster -#ifndef __AVX__ -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const float *a, - Packet4f& a0, Packet4f& a1, Packet4f& a2, Packet4f& a3) -{ - a3 = pload(a); - a0 = vec4f_swizzle1(a3, 0,0,0,0); - a1 = vec4f_swizzle1(a3, 1,1,1,1); - a2 = vec4f_swizzle1(a3, 2,2,2,2); - a3 = vec4f_swizzle1(a3, 3,3,3,3); -} -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const double *a, - Packet2d& a0, Packet2d& a1, Packet2d& a2, Packet2d& a3) -{ -#ifdef EIGEN_VECTORIZE_SSE3 - a0 = _mm_loaddup_pd(a+0); - a1 = _mm_loaddup_pd(a+1); - a2 = _mm_loaddup_pd(a+2); - a3 = _mm_loaddup_pd(a+3); -#else - a1 = pload(a); - a0 = vec2d_swizzle1(a1, 0,0); - a1 = vec2d_swizzle1(a1, 1,1); - a3 = pload(a+2); - a2 = vec2d_swizzle1(a3, 0,0); - a3 = vec2d_swizzle1(a3, 1,1); -#endif -} -#endif - -EIGEN_STRONG_INLINE void punpackp(Packet4f* vecs) -{ - vecs[1] = _mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(vecs[0]), 0x55)); - vecs[2] = _mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(vecs[0]), 0xAA)); - vecs[3] = _mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(vecs[0]), 0xFF)); - vecs[0] = _mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(vecs[0]), 0x00)); -} - -#ifdef EIGEN_VECTORIZE_SSE3 -template<> EIGEN_STRONG_INLINE Packet4f preduxp(const Packet4f* vecs) -{ - return _mm_hadd_ps(_mm_hadd_ps(vecs[0], vecs[1]),_mm_hadd_ps(vecs[2], vecs[3])); -} - -template<> EIGEN_STRONG_INLINE Packet2d preduxp(const Packet2d* vecs) -{ - return _mm_hadd_pd(vecs[0], vecs[1]); -} - -#else -template<> EIGEN_STRONG_INLINE Packet4f preduxp(const Packet4f* vecs) -{ - Packet4f tmp0, tmp1, tmp2; - tmp0 = _mm_unpacklo_ps(vecs[0], vecs[1]); - tmp1 = _mm_unpackhi_ps(vecs[0], vecs[1]); - tmp2 = _mm_unpackhi_ps(vecs[2], vecs[3]); - tmp0 = _mm_add_ps(tmp0, tmp1); - tmp1 = _mm_unpacklo_ps(vecs[2], vecs[3]); - tmp1 = _mm_add_ps(tmp1, tmp2); - tmp2 = _mm_movehl_ps(tmp1, tmp0); - tmp0 = _mm_movelh_ps(tmp0, tmp1); - return _mm_add_ps(tmp0, tmp2); -} - -template<> EIGEN_STRONG_INLINE Packet2d preduxp(const Packet2d* vecs) -{ - return _mm_add_pd(_mm_unpacklo_pd(vecs[0], vecs[1]), _mm_unpackhi_pd(vecs[0], vecs[1])); -} -#endif // SSE3 - -template<> EIGEN_STRONG_INLINE float predux(const Packet4f& a) -{ - // Disable SSE3 _mm_hadd_pd that is extremely slow on all existing Intel's architectures - // (from Nehalem to Haswell) -// #ifdef EIGEN_VECTORIZE_SSE3 -// Packet4f tmp = _mm_add_ps(a, vec4f_swizzle1(a,2,3,2,3)); -// return pfirst(_mm_hadd_ps(tmp, tmp)); -// #else - Packet4f tmp = _mm_add_ps(a, _mm_movehl_ps(a,a)); - return pfirst(_mm_add_ss(tmp, _mm_shuffle_ps(tmp,tmp, 1))); -// #endif -} - -template<> EIGEN_STRONG_INLINE double predux(const Packet2d& a) -{ - // Disable SSE3 _mm_hadd_pd that is extremely slow on all existing Intel's architectures - // (from Nehalem to Haswell) -// #ifdef EIGEN_VECTORIZE_SSE3 -// return pfirst(_mm_hadd_pd(a, a)); -// #else - return pfirst(_mm_add_sd(a, _mm_unpackhi_pd(a,a))); -// #endif -} - -#ifdef EIGEN_VECTORIZE_SSSE3 -template<> EIGEN_STRONG_INLINE Packet4i preduxp(const Packet4i* vecs) -{ - return _mm_hadd_epi32(_mm_hadd_epi32(vecs[0], vecs[1]),_mm_hadd_epi32(vecs[2], vecs[3])); -} -template<> EIGEN_STRONG_INLINE int predux(const Packet4i& a) -{ - Packet4i tmp0 = _mm_hadd_epi32(a,a); - return pfirst(_mm_hadd_epi32(tmp0,tmp0)); -} -#else -template<> EIGEN_STRONG_INLINE int predux(const Packet4i& a) -{ - Packet4i tmp = _mm_add_epi32(a, _mm_unpackhi_epi64(a,a)); - return pfirst(tmp) + pfirst(_mm_shuffle_epi32(tmp, 1)); -} - -template<> EIGEN_STRONG_INLINE Packet4i preduxp(const Packet4i* vecs) -{ - Packet4i tmp0, tmp1, tmp2; - tmp0 = _mm_unpacklo_epi32(vecs[0], vecs[1]); - tmp1 = _mm_unpackhi_epi32(vecs[0], vecs[1]); - tmp2 = _mm_unpackhi_epi32(vecs[2], vecs[3]); - tmp0 = _mm_add_epi32(tmp0, tmp1); - tmp1 = _mm_unpacklo_epi32(vecs[2], vecs[3]); - tmp1 = _mm_add_epi32(tmp1, tmp2); - tmp2 = _mm_unpacklo_epi64(tmp0, tmp1); - tmp0 = _mm_unpackhi_epi64(tmp0, tmp1); - return _mm_add_epi32(tmp0, tmp2); -} -#endif -// Other reduction functions: - -// mul -template<> EIGEN_STRONG_INLINE float predux_mul(const Packet4f& a) -{ - Packet4f tmp = _mm_mul_ps(a, _mm_movehl_ps(a,a)); - return pfirst(_mm_mul_ss(tmp, _mm_shuffle_ps(tmp,tmp, 1))); -} -template<> EIGEN_STRONG_INLINE double predux_mul(const Packet2d& a) -{ - return pfirst(_mm_mul_sd(a, _mm_unpackhi_pd(a,a))); -} -template<> EIGEN_STRONG_INLINE int predux_mul(const Packet4i& a) -{ - // after some experiments, it is seems this is the fastest way to implement it - // for GCC (eg., reusing pmul is very slow !) - // TODO try to call _mm_mul_epu32 directly - EIGEN_ALIGN16 int aux[4]; - pstore(aux, a); - return (aux[0] * aux[1]) * (aux[2] * aux[3]);; -} - -// min -template<> EIGEN_STRONG_INLINE float predux_min(const Packet4f& a) -{ - Packet4f tmp = _mm_min_ps(a, _mm_movehl_ps(a,a)); - return pfirst(_mm_min_ss(tmp, _mm_shuffle_ps(tmp,tmp, 1))); -} -template<> EIGEN_STRONG_INLINE double predux_min(const Packet2d& a) -{ - return pfirst(_mm_min_sd(a, _mm_unpackhi_pd(a,a))); -} -template<> EIGEN_STRONG_INLINE int predux_min(const Packet4i& a) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - Packet4i tmp = _mm_min_epi32(a, _mm_shuffle_epi32(a, _MM_SHUFFLE(0,0,3,2))); - return pfirst(_mm_min_epi32(tmp,_mm_shuffle_epi32(tmp, 1))); -#else - // after some experiments, it is seems this is the fastest way to implement it - // for GCC (eg., it does not like using std::min after the pstore !!) - EIGEN_ALIGN16 int aux[4]; - pstore(aux, a); - int aux0 = aux[0] EIGEN_STRONG_INLINE float predux_max(const Packet4f& a) -{ - Packet4f tmp = _mm_max_ps(a, _mm_movehl_ps(a,a)); - return pfirst(_mm_max_ss(tmp, _mm_shuffle_ps(tmp,tmp, 1))); -} -template<> EIGEN_STRONG_INLINE double predux_max(const Packet2d& a) -{ - return pfirst(_mm_max_sd(a, _mm_unpackhi_pd(a,a))); -} -template<> EIGEN_STRONG_INLINE int predux_max(const Packet4i& a) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - Packet4i tmp = _mm_max_epi32(a, _mm_shuffle_epi32(a, _MM_SHUFFLE(0,0,3,2))); - return pfirst(_mm_max_epi32(tmp,_mm_shuffle_epi32(tmp, 1))); -#else - // after some experiments, it is seems this is the fastest way to implement it - // for GCC (eg., it does not like using std::min after the pstore !!) - EIGEN_ALIGN16 int aux[4]; - pstore(aux, a); - int aux0 = aux[0]>aux[1] ? aux[0] : aux[1]; - int aux2 = aux[2]>aux[3] ? aux[2] : aux[3]; - return aux0>aux2 ? aux0 : aux2; -#endif // EIGEN_VECTORIZE_SSE4_1 -} - -#if EIGEN_COMP_GNUC -// template <> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) -// { -// Packet4f res = b; -// asm("mulps %[a], %[b] \n\taddps %[c], %[b]" : [b] "+x" (res) : [a] "x" (a), [c] "x" (c)); -// return res; -// } -// EIGEN_STRONG_INLINE Packet4i _mm_alignr_epi8(const Packet4i& a, const Packet4i& b, const int i) -// { -// Packet4i res = a; -// asm("palignr %[i], %[a], %[b] " : [b] "+x" (res) : [a] "x" (a), [i] "i" (i)); -// return res; -// } -#endif - -#ifdef EIGEN_VECTORIZE_SSSE3 -// SSSE3 versions -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4f& first, const Packet4f& second) - { - if (Offset!=0) - first = _mm_castsi128_ps(_mm_alignr_epi8(_mm_castps_si128(second), _mm_castps_si128(first), Offset*4)); - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4i& first, const Packet4i& second) - { - if (Offset!=0) - first = _mm_alignr_epi8(second,first, Offset*4); - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2d& first, const Packet2d& second) - { - if (Offset==1) - first = _mm_castsi128_pd(_mm_alignr_epi8(_mm_castpd_si128(second), _mm_castpd_si128(first), 8)); - } -}; -#else -// SSE2 versions -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4f& first, const Packet4f& second) - { - if (Offset==1) - { - first = _mm_move_ss(first,second); - first = _mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(first),0x39)); - } - else if (Offset==2) - { - first = _mm_movehl_ps(first,first); - first = _mm_movelh_ps(first,second); - } - else if (Offset==3) - { - first = _mm_move_ss(first,second); - first = _mm_shuffle_ps(first,second,0x93); - } - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4i& first, const Packet4i& second) - { - if (Offset==1) - { - first = _mm_castps_si128(_mm_move_ss(_mm_castsi128_ps(first),_mm_castsi128_ps(second))); - first = _mm_shuffle_epi32(first,0x39); - } - else if (Offset==2) - { - first = _mm_castps_si128(_mm_movehl_ps(_mm_castsi128_ps(first),_mm_castsi128_ps(first))); - first = _mm_castps_si128(_mm_movelh_ps(_mm_castsi128_ps(first),_mm_castsi128_ps(second))); - } - else if (Offset==3) - { - first = _mm_castps_si128(_mm_move_ss(_mm_castsi128_ps(first),_mm_castsi128_ps(second))); - first = _mm_castps_si128(_mm_shuffle_ps(_mm_castsi128_ps(first),_mm_castsi128_ps(second),0x93)); - } - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2d& first, const Packet2d& second) - { - if (Offset==1) - { - first = _mm_castps_pd(_mm_movehl_ps(_mm_castpd_ps(first),_mm_castpd_ps(first))); - first = _mm_castps_pd(_mm_movelh_ps(_mm_castpd_ps(first),_mm_castpd_ps(second))); - } - } -}; -#endif - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - _MM_TRANSPOSE4_PS(kernel.packet[0], kernel.packet[1], kernel.packet[2], kernel.packet[3]); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m128d tmp = _mm_unpackhi_pd(kernel.packet[0], kernel.packet[1]); - kernel.packet[0] = _mm_unpacklo_pd(kernel.packet[0], kernel.packet[1]); - kernel.packet[1] = tmp; -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - __m128i T0 = _mm_unpacklo_epi32(kernel.packet[0], kernel.packet[1]); - __m128i T1 = _mm_unpacklo_epi32(kernel.packet[2], kernel.packet[3]); - __m128i T2 = _mm_unpackhi_epi32(kernel.packet[0], kernel.packet[1]); - __m128i T3 = _mm_unpackhi_epi32(kernel.packet[2], kernel.packet[3]); - - kernel.packet[0] = _mm_unpacklo_epi64(T0, T1); - kernel.packet[1] = _mm_unpackhi_epi64(T0, T1); - kernel.packet[2] = _mm_unpacklo_epi64(T2, T3); - kernel.packet[3] = _mm_unpackhi_epi64(T2, T3); -} - -template<> EIGEN_STRONG_INLINE Packet4i pblend(const Selector<4>& ifPacket, const Packet4i& thenPacket, const Packet4i& elsePacket) { - const __m128i zero = _mm_setzero_si128(); - const __m128i select = _mm_set_epi32(ifPacket.select[3], ifPacket.select[2], ifPacket.select[1], ifPacket.select[0]); - __m128i false_mask = _mm_cmpeq_epi32(select, zero); -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blendv_epi8(thenPacket, elsePacket, false_mask); -#else - return _mm_or_si128(_mm_andnot_si128(false_mask, thenPacket), _mm_and_si128(false_mask, elsePacket)); -#endif -} -template<> EIGEN_STRONG_INLINE Packet4f pblend(const Selector<4>& ifPacket, const Packet4f& thenPacket, const Packet4f& elsePacket) { - const __m128 zero = _mm_setzero_ps(); - const __m128 select = _mm_set_ps(ifPacket.select[3], ifPacket.select[2], ifPacket.select[1], ifPacket.select[0]); - __m128 false_mask = _mm_cmpeq_ps(select, zero); -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blendv_ps(thenPacket, elsePacket, false_mask); -#else - return _mm_or_ps(_mm_andnot_ps(false_mask, thenPacket), _mm_and_ps(false_mask, elsePacket)); -#endif -} -template<> EIGEN_STRONG_INLINE Packet2d pblend(const Selector<2>& ifPacket, const Packet2d& thenPacket, const Packet2d& elsePacket) { - const __m128d zero = _mm_setzero_pd(); - const __m128d select = _mm_set_pd(ifPacket.select[1], ifPacket.select[0]); - __m128d false_mask = _mm_cmpeq_pd(select, zero); -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blendv_pd(thenPacket, elsePacket, false_mask); -#else - return _mm_or_pd(_mm_andnot_pd(false_mask, thenPacket), _mm_and_pd(false_mask, elsePacket)); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4f pinsertfirst(const Packet4f& a, float b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blend_ps(a,pset1(b),1); -#else - return _mm_move_ss(a, _mm_load_ss(&b)); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet2d pinsertfirst(const Packet2d& a, double b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blend_pd(a,pset1(b),1); -#else - return _mm_move_sd(a, _mm_load_sd(&b)); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet4f pinsertlast(const Packet4f& a, float b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blend_ps(a,pset1(b),(1<<3)); -#else - const Packet4f mask = _mm_castsi128_ps(_mm_setr_epi32(0x0,0x0,0x0,0xFFFFFFFF)); - return _mm_or_ps(_mm_andnot_ps(mask, a), _mm_and_ps(mask, pset1(b))); -#endif -} - -template<> EIGEN_STRONG_INLINE Packet2d pinsertlast(const Packet2d& a, double b) -{ -#ifdef EIGEN_VECTORIZE_SSE4_1 - return _mm_blend_pd(a,pset1(b),(1<<1)); -#else - const Packet2d mask = _mm_castsi128_pd(_mm_setr_epi32(0x0,0x0,0xFFFFFFFF,0xFFFFFFFF)); - return _mm_or_pd(_mm_andnot_pd(mask, a), _mm_and_pd(mask, pset1(b))); -#endif -} - -// Scalar path for pmadd with FMA to ensure consistency with vectorized path. -#ifdef __FMA__ -template<> EIGEN_STRONG_INLINE float pmadd(const float& a, const float& b, const float& c) { - return ::fmaf(a,b,c); -} -template<> EIGEN_STRONG_INLINE double pmadd(const double& a, const double& b, const double& c) { - return ::fma(a,b,c); -} -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PACKET_MATH_SSE_H diff --git a/Eigen/src/Core/arch/SSE/TypeCasting.h b/Eigen/src/Core/arch/SSE/TypeCasting.h deleted file mode 100644 index c84893230..000000000 --- a/Eigen/src/Core/arch/SSE/TypeCasting.h +++ /dev/null @@ -1,77 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Benoit Steiner -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TYPE_CASTING_SSE_H -#define EIGEN_TYPE_CASTING_SSE_H - -namespace Eigen { - -namespace internal { - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet4i pcast(const Packet4f& a) { - return _mm_cvttps_epi32(a); -} - - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet4f pcast(const Packet4i& a) { - return _mm_cvtepi32_ps(a); -} - - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 2, - TgtCoeffRatio = 1 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet4f pcast(const Packet2d& a, const Packet2d& b) { - return _mm_shuffle_ps(_mm_cvtpd_ps(a), _mm_cvtpd_ps(b), (1 << 2) | (1 << 6)); -} - -template <> -struct type_casting_traits { - enum { - VectorizedCast = 1, - SrcCoeffRatio = 1, - TgtCoeffRatio = 2 - }; -}; - -template<> EIGEN_STRONG_INLINE Packet2d pcast(const Packet4f& a) { - // Simply discard the second half of the input - return _mm_cvtps_pd(a); -} - - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TYPE_CASTING_SSE_H diff --git a/Eigen/src/Core/arch/ZVector/Complex.h b/Eigen/src/Core/arch/ZVector/Complex.h deleted file mode 100644 index 95aba428f..000000000 --- a/Eigen/src/Core/arch/ZVector/Complex.h +++ /dev/null @@ -1,563 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Gael Guennebaud -// Copyright (C) 2016 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX32_ALTIVEC_H -#define EIGEN_COMPLEX32_ALTIVEC_H - -namespace Eigen { - -namespace internal { - -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) -static Packet4ui p4ui_CONJ_XOR = { 0x00000000, 0x80000000, 0x00000000, 0x80000000 }; //vec_mergeh((Packet4ui)p4i_ZERO, (Packet4ui)p4f_MZERO); -#endif - -static Packet2ul p2ul_CONJ_XOR1 = (Packet2ul) vec_sld((Packet4ui) p2d_ZERO_, (Packet4ui) p2l_ZERO, 8);//{ 0x8000000000000000, 0x0000000000000000 }; -static Packet2ul p2ul_CONJ_XOR2 = (Packet2ul) vec_sld((Packet4ui) p2l_ZERO, (Packet4ui) p2d_ZERO_, 8);//{ 0x8000000000000000, 0x0000000000000000 }; - -struct Packet1cd -{ - EIGEN_STRONG_INLINE Packet1cd() {} - EIGEN_STRONG_INLINE explicit Packet1cd(const Packet2d& a) : v(a) {} - Packet2d v; -}; - -struct Packet2cf -{ - EIGEN_STRONG_INLINE Packet2cf() {} - EIGEN_STRONG_INLINE explicit Packet2cf(const Packet4f& a) : v(a) {} -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ < 12) - union { - Packet4f v; - Packet1cd cd[2]; - }; -#else - Packet4f v; -#endif -}; - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet2cf type; - typedef Packet2cf half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 2, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasBlend = 1, - HasSetLinear = 0 - }; -}; - - -template<> struct packet_traits > : default_packet_traits -{ - typedef Packet1cd type; - typedef Packet1cd half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 1, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasNegate = 1, - HasAbs = 0, - HasAbs2 = 0, - HasMin = 0, - HasMax = 0, - HasSetLinear = 0 - }; -}; - -template<> struct unpacket_traits { typedef std::complex type; enum {size=2, alignment=Aligned16}; typedef Packet2cf half; }; -template<> struct unpacket_traits { typedef std::complex type; enum {size=1, alignment=Aligned16}; typedef Packet1cd half; }; - -/* Forward declaration */ -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel); - -/* complex first */ -template<> EIGEN_STRONG_INLINE Packet1cd pload (const std::complex* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet1cd(pload((const double*)from)); } -template<> EIGEN_STRONG_INLINE Packet1cd ploadu(const std::complex* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet1cd(ploadu((const double*)from)); } -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet1cd& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((double*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet1cd& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((double*)to, from.v); } - -template<> EIGEN_STRONG_INLINE Packet1cd pset1(const std::complex& from) -{ /* here we really have to use unaligned loads :( */ return ploadu(&from); } - -template<> EIGEN_DEVICE_FUNC inline Packet1cd pgather, Packet1cd>(const std::complex* from, Index stride EIGEN_UNUSED) -{ - return pload(from); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet1cd>(std::complex* to, const Packet1cd& from, Index stride EIGEN_UNUSED) -{ - pstore >(to, from); -} -template<> EIGEN_STRONG_INLINE Packet1cd padd(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(a.v + b.v); } -template<> EIGEN_STRONG_INLINE Packet1cd psub(const Packet1cd& a, const Packet1cd& b) { return Packet1cd(a.v - b.v); } -template<> EIGEN_STRONG_INLINE Packet1cd pnegate(const Packet1cd& a) { return Packet1cd(pnegate(Packet2d(a.v))); } -template<> EIGEN_STRONG_INLINE Packet1cd pconj(const Packet1cd& a) { return Packet1cd((Packet2d)vec_xor((Packet2d)a.v, (Packet2d)p2ul_CONJ_XOR2)); } -template<> EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) -{ - Packet2d a_re, a_im, v1, v2; - - // Permute and multiply the real parts of a and b - a_re = vec_perm(a.v, a.v, p16uc_PSET64_HI); - // Get the imaginary parts of a - a_im = vec_perm(a.v, a.v, p16uc_PSET64_LO); - // multiply a_re * b - v1 = vec_madd(a_re, b.v, p2d_ZERO); - // multiply a_im * b and get the conjugate result - v2 = vec_madd(a_im, b.v, p2d_ZERO); - v2 = (Packet2d) vec_sld((Packet4ui)v2, (Packet4ui)v2, 8); - v2 = (Packet2d) vec_xor((Packet2d)v2, (Packet2d) p2ul_CONJ_XOR1); - - return Packet1cd(v1 + v2); -} -template<> EIGEN_STRONG_INLINE Packet1cd pand (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_and(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd por (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_or(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pxor (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_xor(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet1cd pandnot (const Packet1cd& a, const Packet1cd& b) { return Packet1cd(vec_and(a.v, vec_nor(b.v,b.v))); } -template<> EIGEN_STRONG_INLINE Packet1cd ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { EIGEN_ZVECTOR_PREFETCH(addr); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet1cd& a) -{ - std::complex EIGEN_ALIGN16 res; - pstore >(&res, a); - - return res; -} - -template<> EIGEN_STRONG_INLINE Packet1cd preverse(const Packet1cd& a) { return a; } -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet1cd& a) -{ - return pfirst(a); -} -template<> EIGEN_STRONG_INLINE Packet1cd preduxp(const Packet1cd* vecs) -{ - return vecs[0]; -} -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet1cd& a) -{ - return pfirst(a); -} -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet1cd& /*first*/, const Packet1cd& /*second*/) - { - // FIXME is it sure we never have to align a Packet1cd? - // Even though a std::complex has 16 bytes, it is not necessarily aligned on a 16 bytes boundary... - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet1cd pmadd(const Packet1cd& x, const Packet1cd& y, const Packet1cd& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet1cd pmul(const Packet1cd& a, const Packet1cd& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet1cd,Packet2d) - -template<> EIGEN_STRONG_INLINE Packet1cd pdiv(const Packet1cd& a, const Packet1cd& b) -{ - // TODO optimize it for AltiVec - Packet1cd res = conj_helper().pmul(a,b); - Packet2d s = vec_madd(b.v, b.v, p2d_ZERO_); - return Packet1cd(pdiv(res.v, s + vec_perm(s, s, p16uc_REVERSE64))); -} - -EIGEN_STRONG_INLINE Packet1cd pcplxflip/**/(const Packet1cd& x) -{ - return Packet1cd(preverse(Packet2d(x.v))); -} - -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel) -{ - Packet2d tmp = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_HI); - kernel.packet[1].v = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_LO); - kernel.packet[0].v = tmp; -} - -/* complex follows */ -template<> EIGEN_STRONG_INLINE Packet2cf pload (const std::complex* from) { EIGEN_DEBUG_ALIGNED_LOAD return Packet2cf(pload((const float*)from)); } -template<> EIGEN_STRONG_INLINE Packet2cf ploadu(const std::complex* from) { EIGEN_DEBUG_UNALIGNED_LOAD return Packet2cf(ploadu((const float*)from)); } -template<> EIGEN_STRONG_INLINE void pstore >(std::complex * to, const Packet2cf& from) { EIGEN_DEBUG_ALIGNED_STORE pstore((float*)to, from.v); } -template<> EIGEN_STRONG_INLINE void pstoreu >(std::complex * to, const Packet2cf& from) { EIGEN_DEBUG_UNALIGNED_STORE pstoreu((float*)to, from.v); } - -template<> EIGEN_STRONG_INLINE std::complex pfirst(const Packet2cf& a) -{ - std::complex EIGEN_ALIGN16 res[2]; - pstore >(res, a); - - return res[0]; -} - - -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ < 12) -template<> EIGEN_STRONG_INLINE Packet2cf pset1(const std::complex& from) -{ - Packet2cf res; - res.cd[0] = Packet1cd(vec_ld2f((const float *)&from)); - res.cd[1] = res.cd[0]; - return res; -} -#else -template<> EIGEN_STRONG_INLINE Packet2cf pset1(const std::complex& from) -{ - Packet2cf res; - if((std::ptrdiff_t(&from) % 16) == 0) - res.v = pload((const float *)&from); - else - res.v = ploadu((const float *)&from); - res.v = vec_perm(res.v, res.v, p16uc_PSET64_HI); - return res; -} -#endif - -template<> EIGEN_DEVICE_FUNC inline Packet2cf pgather, Packet2cf>(const std::complex* from, Index stride) -{ - std::complex EIGEN_ALIGN16 af[2]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - return pload(af); -} -template<> EIGEN_DEVICE_FUNC inline void pscatter, Packet2cf>(std::complex* to, const Packet2cf& from, Index stride) -{ - std::complex EIGEN_ALIGN16 af[2]; - pstore >((std::complex *) af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; -} - -template<> EIGEN_STRONG_INLINE Packet2cf padd(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(padd(a.v, b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf psub(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(psub(a.v, b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pnegate(const Packet2cf& a) { return Packet2cf(pnegate(Packet4f(a.v))); } - -template<> EIGEN_STRONG_INLINE Packet2cf pand (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(pand(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf por (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(por(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pxor (const Packet2cf& a, const Packet2cf& b) { return Packet2cf(pxor(a.v,b.v)); } -template<> EIGEN_STRONG_INLINE Packet2cf pandnot(const Packet2cf& a, const Packet2cf& b) { return Packet2cf(pandnot(a.v,b.v)); } - -template<> EIGEN_STRONG_INLINE Packet2cf ploaddup(const std::complex* from) { return pset1(*from); } - -template<> EIGEN_STRONG_INLINE void prefetch >(const std::complex * addr) { EIGEN_ZVECTOR_PREFETCH(addr); } - - -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ < 12) -template<> EIGEN_STRONG_INLINE Packet2cf pconj(const Packet2cf& a) -{ - Packet2cf res; - res.v.v4f[0] = pconj(Packet1cd(reinterpret_cast(a.v.v4f[0]))).v; - res.v.v4f[1] = pconj(Packet1cd(reinterpret_cast(a.v.v4f[1]))).v; - return res; -} - -template<> EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) -{ - Packet2cf res; - res.v.v4f[0] = pmul(Packet1cd(reinterpret_cast(a.v.v4f[0])), Packet1cd(reinterpret_cast(b.v.v4f[0]))).v; - res.v.v4f[1] = pmul(Packet1cd(reinterpret_cast(a.v.v4f[1])), Packet1cd(reinterpret_cast(b.v.v4f[1]))).v; - return res; -} - -template<> EIGEN_STRONG_INLINE Packet2cf preverse(const Packet2cf& a) -{ - Packet2cf res; - res.cd[0] = a.cd[1]; - res.cd[1] = a.cd[0]; - return res; -} - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet2cf& a) -{ - std::complex res; - Packet1cd b = padd(a.cd[0], a.cd[1]); - vec_st2f(b.v, (float*)&res); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet2cf preduxp(const Packet2cf* vecs) -{ - PacketBlock transpose; - transpose.packet[0] = vecs[0]; - transpose.packet[1] = vecs[1]; - ptranspose(transpose); - - return padd(transpose.packet[0], transpose.packet[1]); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet2cf& a) -{ - std::complex res; - Packet1cd b = pmul(a.cd[0], a.cd[1]); - vec_st2f(b.v, (float*)&res); - return res; -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2cf& first, const Packet2cf& second) - { - if (Offset == 1) { - first.cd[0] = first.cd[1]; - first.cd[1] = second.cd[0]; - } - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) - -template<> EIGEN_STRONG_INLINE Packet2cf pdiv(const Packet2cf& a, const Packet2cf& b) -{ - // TODO optimize it for AltiVec - Packet2cf res; - res.cd[0] = pdiv(a.cd[0], b.cd[0]); - res.cd[1] = pdiv(a.cd[1], b.cd[1]); - return res; -} - -EIGEN_STRONG_INLINE Packet2cf pcplxflip/**/(const Packet2cf& x) -{ - Packet2cf res; - res.cd[0] = pcplxflip(x.cd[0]); - res.cd[1] = pcplxflip(x.cd[1]); - return res; -} - -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel) -{ - Packet1cd tmp = kernel.packet[0].cd[1]; - kernel.packet[0].cd[1] = kernel.packet[1].cd[0]; - kernel.packet[1].cd[0] = tmp; -} - -template<> EIGEN_STRONG_INLINE Packet2cf pblend(const Selector<2>& ifPacket, const Packet2cf& thenPacket, const Packet2cf& elsePacket) { - Packet2cf result; - const Selector<4> ifPacket4 = { ifPacket.select[0], ifPacket.select[0], ifPacket.select[1], ifPacket.select[1] }; - result.v = pblend(ifPacket4, thenPacket.v, elsePacket.v); - return result; -} -#else -template<> EIGEN_STRONG_INLINE Packet2cf pconj(const Packet2cf& a) { return Packet2cf(pxor(a.v, reinterpret_cast(p4ui_CONJ_XOR))); } -template<> EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) -{ - Packet4f a_re, a_im, prod, prod_im; - - // Permute and multiply the real parts of a and b - a_re = vec_perm(a.v, a.v, p16uc_PSET32_WODD); - - // Get the imaginary parts of a - a_im = vec_perm(a.v, a.v, p16uc_PSET32_WEVEN); - - // multiply a_im * b and get the conjugate result - prod_im = a_im * b.v; - prod_im = pxor(prod_im, reinterpret_cast(p4ui_CONJ_XOR)); - // permute back to a proper order - prod_im = vec_perm(prod_im, prod_im, p16uc_COMPLEX32_REV); - - // multiply a_re * b, add prod_im - prod = pmadd(a_re, b.v, prod_im); - - return Packet2cf(prod); -} - -template<> EIGEN_STRONG_INLINE Packet2cf preverse(const Packet2cf& a) -{ - Packet4f rev_a; - rev_a = vec_perm(a.v, a.v, p16uc_COMPLEX32_REV2); - return Packet2cf(rev_a); -} - -template<> EIGEN_STRONG_INLINE std::complex predux(const Packet2cf& a) -{ - Packet4f b; - b = vec_sld(a.v, a.v, 8); - b = padd(a.v, b); - return pfirst(Packet2cf(b)); -} - -template<> EIGEN_STRONG_INLINE Packet2cf preduxp(const Packet2cf* vecs) -{ - Packet4f b1, b2; - b1 = vec_sld(vecs[0].v, vecs[1].v, 8); - b2 = vec_sld(vecs[1].v, vecs[0].v, 8); - b2 = vec_sld(b2, b2, 8); - b2 = padd(b1, b2); - - return Packet2cf(b2); -} - -template<> EIGEN_STRONG_INLINE std::complex predux_mul(const Packet2cf& a) -{ - Packet4f b; - Packet2cf prod; - b = vec_sld(a.v, a.v, 8); - prod = pmul(a, Packet2cf(b)); - - return pfirst(prod); -} - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2cf& first, const Packet2cf& second) - { - if (Offset==1) - { - first.v = vec_sld(first.v, second.v, 8); - } - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(a, pconj(b)); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return internal::pmul(pconj(a), b); - } -}; - -template<> struct conj_helper -{ - EIGEN_STRONG_INLINE Packet2cf pmadd(const Packet2cf& x, const Packet2cf& y, const Packet2cf& c) const - { return padd(pmul(x,y),c); } - - EIGEN_STRONG_INLINE Packet2cf pmul(const Packet2cf& a, const Packet2cf& b) const - { - return pconj(internal::pmul(a, b)); - } -}; - -EIGEN_MAKE_CONJ_HELPER_CPLX_REAL(Packet2cf,Packet4f) - -template<> EIGEN_STRONG_INLINE Packet2cf pdiv(const Packet2cf& a, const Packet2cf& b) -{ - // TODO optimize it for AltiVec - Packet2cf res = conj_helper().pmul(a, b); - Packet4f s = pmul(b.v, b.v); - return Packet2cf(pdiv(res.v, padd(s, vec_perm(s, s, p16uc_COMPLEX32_REV)))); -} - -template<> EIGEN_STRONG_INLINE Packet2cf pcplxflip(const Packet2cf& x) -{ - return Packet2cf(vec_perm(x.v, x.v, p16uc_COMPLEX32_REV)); -} - -EIGEN_STRONG_INLINE void ptranspose(PacketBlock& kernel) -{ - Packet4f tmp = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_HI); - kernel.packet[1].v = vec_perm(kernel.packet[0].v, kernel.packet[1].v, p16uc_TRANSPOSE64_LO); - kernel.packet[0].v = tmp; -} - -template<> EIGEN_STRONG_INLINE Packet2cf pblend(const Selector<2>& ifPacket, const Packet2cf& thenPacket, const Packet2cf& elsePacket) { - Packet2cf result; - result.v = reinterpret_cast(pblend(ifPacket, reinterpret_cast(thenPacket.v), reinterpret_cast(elsePacket.v))); - return result; -} -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX32_ALTIVEC_H diff --git a/Eigen/src/Core/arch/ZVector/MathFunctions.h b/Eigen/src/Core/arch/ZVector/MathFunctions.h deleted file mode 100644 index ff33a975f..000000000 --- a/Eigen/src/Core/arch/ZVector/MathFunctions.h +++ /dev/null @@ -1,232 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2007 Julien Pommier -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2016 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* The sin, cos, exp, and log functions of this file come from - * Julien Pommier's sse math library: http://gruntthepeon.free.fr/ssemath/ - */ - -#ifndef EIGEN_MATH_FUNCTIONS_ALTIVEC_H -#define EIGEN_MATH_FUNCTIONS_ALTIVEC_H - -namespace Eigen { - -namespace internal { - -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) -static _EIGEN_DECLARE_CONST_Packet4f(1 , 1.0f); -static _EIGEN_DECLARE_CONST_Packet4f(half, 0.5f); -static _EIGEN_DECLARE_CONST_Packet4i(0x7f, 0x7f); -static _EIGEN_DECLARE_CONST_Packet4i(23, 23); - -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(inv_mant_mask, ~0x7f800000); - -/* the smallest non denormalized float number */ -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(min_norm_pos, 0x00800000); -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(minus_inf, 0xff800000); // -1.f/0.f -static _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(minus_nan, 0xffffffff); - -/* natural logarithm computed for 4 simultaneous float - return NaN for x <= 0 -*/ -static _EIGEN_DECLARE_CONST_Packet4f(cephes_SQRTHF, 0.707106781186547524f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p0, 7.0376836292E-2f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p1, - 1.1514610310E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p2, 1.1676998740E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p3, - 1.2420140846E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p4, + 1.4249322787E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p5, - 1.6668057665E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p6, + 2.0000714765E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p7, - 2.4999993993E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_p8, + 3.3333331174E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q1, -2.12194440e-4f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_log_q2, 0.693359375f); - -static _EIGEN_DECLARE_CONST_Packet4f(exp_hi, 88.3762626647950f); -static _EIGEN_DECLARE_CONST_Packet4f(exp_lo, -88.3762626647949f); - -static _EIGEN_DECLARE_CONST_Packet4f(cephes_LOG2EF, 1.44269504088896341f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C1, 0.693359375f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_C2, -2.12194440e-4f); - -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p0, 1.9875691500E-4f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p1, 1.3981999507E-3f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p2, 8.3334519073E-3f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p3, 4.1665795894E-2f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p4, 1.6666665459E-1f); -static _EIGEN_DECLARE_CONST_Packet4f(cephes_exp_p5, 5.0000001201E-1f); -#endif - -static _EIGEN_DECLARE_CONST_Packet2d(1 , 1.0); -static _EIGEN_DECLARE_CONST_Packet2d(2 , 2.0); -static _EIGEN_DECLARE_CONST_Packet2d(half, 0.5); - -static _EIGEN_DECLARE_CONST_Packet2d(exp_hi, 709.437); -static _EIGEN_DECLARE_CONST_Packet2d(exp_lo, -709.436139303); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_LOG2EF, 1.4426950408889634073599); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p0, 1.26177193074810590878e-4); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p1, 3.02994407707441961300e-2); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_p2, 9.99999999999999999910e-1); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q0, 3.00198505138664455042e-6); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q1, 2.52448340349684104192e-3); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q2, 2.27265548208155028766e-1); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_q3, 2.00000000000000000009e0); - -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_C1, 0.693145751953125); -static _EIGEN_DECLARE_CONST_Packet2d(cephes_exp_C2, 1.42860682030941723212e-6); - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d pexp(const Packet2d& _x) -{ - Packet2d x = _x; - - Packet2d tmp, fx; - Packet2l emm0; - - // clamp x - x = pmax(pmin(x, p2d_exp_hi), p2d_exp_lo); - /* express exp(x) as exp(g + n*log(2)) */ - fx = pmadd(p2d_cephes_LOG2EF, x, p2d_half); - - fx = vec_floor(fx); - - tmp = pmul(fx, p2d_cephes_exp_C1); - Packet2d z = pmul(fx, p2d_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - Packet2d x2 = pmul(x,x); - - Packet2d px = p2d_cephes_exp_p0; - px = pmadd(px, x2, p2d_cephes_exp_p1); - px = pmadd(px, x2, p2d_cephes_exp_p2); - px = pmul (px, x); - - Packet2d qx = p2d_cephes_exp_q0; - qx = pmadd(qx, x2, p2d_cephes_exp_q1); - qx = pmadd(qx, x2, p2d_cephes_exp_q2); - qx = pmadd(qx, x2, p2d_cephes_exp_q3); - - x = pdiv(px,psub(qx,px)); - x = pmadd(p2d_2,x,p2d_1); - - // build 2^n - emm0 = vec_ctsl(fx, 0); - - static const Packet2l p2l_1023 = { 1023, 1023 }; - static const Packet2ul p2ul_52 = { 52, 52 }; - - emm0 = emm0 + p2l_1023; - emm0 = emm0 << reinterpret_cast(p2ul_52); - - // Altivec's max & min operators just drop silent NaNs. Check NaNs in - // inputs and return them unmodified. - Packet2ul isnumber_mask = reinterpret_cast(vec_cmpeq(_x, _x)); - return vec_sel(_x, pmax(pmul(x, reinterpret_cast(emm0)), _x), - isnumber_mask); -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f pexp(const Packet4f& _x) -{ -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) -/* - Packet4f x = _x; - - Packet4f tmp, fx; - Packet4i emm0; - - // clamp x - x = pmax(pmin(x, p4f_exp_hi), p4f_exp_lo); - - // express exp(x) as exp(g + n*log(2)) - fx = pmadd(x, p4f_cephes_LOG2EF, p4f_half); - - fx = pfloor(fx); - - tmp = pmul(fx, p4f_cephes_exp_C1); - Packet4f z = pmul(fx, p4f_cephes_exp_C2); - x = psub(x, tmp); - x = psub(x, z); - - z = pmul(x,x); - - Packet4f y = p4f_cephes_exp_p0; - y = pmadd(y, x, p4f_cephes_exp_p1); - y = pmadd(y, x, p4f_cephes_exp_p2); - y = pmadd(y, x, p4f_cephes_exp_p3); - y = pmadd(y, x, p4f_cephes_exp_p4); - y = pmadd(y, x, p4f_cephes_exp_p5); - y = pmadd(y, z, x); - y = padd(y, p4f_1); - - // build 2^n - emm0 = vec_cts(fx, 0); - emm0 = emm0 + p4i_0x7f; - emm0 = emm0 << reinterpret_cast(p4i_23); - - // Altivec's max & min operators just drop silent NaNs. Check NaNs in - // inputs and return them unmodified. - Packet4ui isnumber_mask = reinterpret_cast(vec_cmpeq(_x, _x)); - return vec_sel(_x, pmax(pmul(y, reinterpret_cast(emm0)), _x), - isnumber_mask);*/ - return _x; -#else - Packet4f res; - res.v4f[0] = pexp(_x.v4f[0]); - res.v4f[1] = pexp(_x.v4f[1]); - return res; -#endif -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d psqrt(const Packet2d& x) -{ - return vec_sqrt(x); -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f psqrt(const Packet4f& x) -{ - Packet4f res; -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) - res = vec_sqrt(x); -#else - res.v4f[0] = psqrt(x.v4f[0]); - res.v4f[1] = psqrt(x.v4f[1]); -#endif - return res; -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet2d prsqrt(const Packet2d& x) { - return pset1(1.0) / psqrt(x); -} - -template<> EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_UNUSED -Packet4f prsqrt(const Packet4f& x) { - Packet4f res; -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) - res = pset1(1.0) / psqrt(x); -#else - res.v4f[0] = prsqrt(x.v4f[0]); - res.v4f[1] = prsqrt(x.v4f[1]); -#endif - return res; -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_MATH_FUNCTIONS_ALTIVEC_H diff --git a/Eigen/src/Core/arch/ZVector/PacketMath.h b/Eigen/src/Core/arch/ZVector/PacketMath.h deleted file mode 100755 index 0b37f4992..000000000 --- a/Eigen/src/Core/arch/ZVector/PacketMath.h +++ /dev/null @@ -1,1191 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2016 Konstantinos Margaritis -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PACKET_MATH_ZVECTOR_H -#define EIGEN_PACKET_MATH_ZVECTOR_H - -#include - -namespace Eigen { - -namespace internal { - -#ifndef EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD -#define EIGEN_CACHEFRIENDLY_PRODUCT_THRESHOLD 16 -#endif - -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_MADD -#endif - -#ifndef EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD -#define EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD -#endif - -#ifndef EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS -#define EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS 32 -#endif - -typedef __vector int Packet4i; -typedef __vector unsigned int Packet4ui; -typedef __vector __bool int Packet4bi; -typedef __vector short int Packet8i; -typedef __vector unsigned char Packet16uc; -typedef __vector double Packet2d; -typedef __vector unsigned long long Packet2ul; -typedef __vector long long Packet2l; - -// Z14 has builtin support for float vectors -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) -typedef __vector float Packet4f; -#else -typedef struct { - Packet2d v4f[2]; -} Packet4f; -#endif - -typedef union { - int32_t i[4]; - uint32_t ui[4]; - int64_t l[2]; - uint64_t ul[2]; - double d[2]; - float f[4]; - Packet4i v4i; - Packet4ui v4ui; - Packet2l v2l; - Packet2ul v2ul; - Packet2d v2d; -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) - Packet4f v4f; -#endif -} Packet; - -// We don't want to write the same code all the time, but we need to reuse the constants -// and it doesn't really work to declare them global, so we define macros instead - -#define _EIGEN_DECLARE_CONST_FAST_Packet4i(NAME,X) \ - Packet4i p4i_##NAME = reinterpret_cast(vec_splat_s32(X)) - -#define _EIGEN_DECLARE_CONST_FAST_Packet2d(NAME,X) \ - Packet2d p2d_##NAME = reinterpret_cast(vec_splat_s64(X)) - -#define _EIGEN_DECLARE_CONST_FAST_Packet2l(NAME,X) \ - Packet2l p2l_##NAME = reinterpret_cast(vec_splat_s64(X)) - -#define _EIGEN_DECLARE_CONST_Packet4i(NAME,X) \ - Packet4i p4i_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet2d(NAME,X) \ - Packet2d p2d_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet2l(NAME,X) \ - Packet2l p2l_##NAME = pset1(X) - -// These constants are endian-agnostic -static _EIGEN_DECLARE_CONST_FAST_Packet4i(ZERO, 0); //{ 0, 0, 0, 0,} -static _EIGEN_DECLARE_CONST_FAST_Packet4i(ONE, 1); //{ 1, 1, 1, 1} - -static _EIGEN_DECLARE_CONST_FAST_Packet2d(ZERO, 0); -static _EIGEN_DECLARE_CONST_FAST_Packet2l(ZERO, 0); -static _EIGEN_DECLARE_CONST_FAST_Packet2l(ONE, 1); - -static Packet2d p2d_ONE = { 1.0, 1.0 }; -static Packet2d p2d_ZERO_ = { -0.0, -0.0 }; - -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) -#define _EIGEN_DECLARE_CONST_FAST_Packet4f(NAME,X) \ - Packet4f p4f_##NAME = reinterpret_cast(vec_splat_s32(X)) - -#define _EIGEN_DECLARE_CONST_Packet4f(NAME,X) \ - Packet4f p4f_##NAME = pset1(X) - -#define _EIGEN_DECLARE_CONST_Packet4f_FROM_INT(NAME,X) \ - const Packet4f p4f_##NAME = reinterpret_cast(pset1(X)) - -static _EIGEN_DECLARE_CONST_FAST_Packet4f(ZERO, 0); //{ 0.0, 0.0, 0.0, 0.0} -static _EIGEN_DECLARE_CONST_FAST_Packet4i(MINUS1,-1); //{ -1, -1, -1, -1} -static Packet4f p4f_MZERO = { 0x80000000, 0x80000000, 0x80000000, 0x80000000}; -#endif - -static Packet4i p4i_COUNTDOWN = { 0, 1, 2, 3 }; -static Packet4f p4f_COUNTDOWN = { 0.0, 1.0, 2.0, 3.0 }; -static Packet2d p2d_COUNTDOWN = reinterpret_cast(vec_sld(reinterpret_cast(p2d_ZERO), reinterpret_cast(p2d_ONE), 8)); - -static Packet16uc p16uc_PSET64_HI = { 0,1,2,3, 4,5,6,7, 0,1,2,3, 4,5,6,7 }; -static Packet16uc p16uc_DUPLICATE32_HI = { 0,1,2,3, 0,1,2,3, 4,5,6,7, 4,5,6,7 }; - -// Mask alignment -#define _EIGEN_MASK_ALIGNMENT 0xfffffffffffffff0 - -#define _EIGEN_ALIGNED_PTR(x) ((std::ptrdiff_t)(x) & _EIGEN_MASK_ALIGNMENT) - -// Handle endianness properly while loading constants -// Define global static constants: - -static Packet16uc p16uc_FORWARD = { 0,1,2,3, 4,5,6,7, 8,9,10,11, 12,13,14,15 }; -static Packet16uc p16uc_REVERSE32 = { 12,13,14,15, 8,9,10,11, 4,5,6,7, 0,1,2,3 }; -static Packet16uc p16uc_REVERSE64 = { 8,9,10,11, 12,13,14,15, 0,1,2,3, 4,5,6,7 }; - -static Packet16uc p16uc_PSET32_WODD = vec_sld((Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 0), (Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 2), 8);//{ 0,1,2,3, 0,1,2,3, 8,9,10,11, 8,9,10,11 }; -static Packet16uc p16uc_PSET32_WEVEN = vec_sld(p16uc_DUPLICATE32_HI, (Packet16uc) vec_splat((Packet4ui)p16uc_FORWARD, 3), 8);//{ 4,5,6,7, 4,5,6,7, 12,13,14,15, 12,13,14,15 }; -/*static Packet16uc p16uc_HALF64_0_16 = vec_sld((Packet16uc)p4i_ZERO, vec_splat((Packet16uc) vec_abs(p4i_MINUS16), 3), 8); //{ 0,0,0,0, 0,0,0,0, 16,16,16,16, 16,16,16,16}; - -static Packet16uc p16uc_PSET64_HI = (Packet16uc) vec_mergeh((Packet4ui)p16uc_PSET32_WODD, (Packet4ui)p16uc_PSET32_WEVEN); //{ 0,1,2,3, 4,5,6,7, 0,1,2,3, 4,5,6,7 };*/ -static Packet16uc p16uc_PSET64_LO = (Packet16uc) vec_mergel((Packet4ui)p16uc_PSET32_WODD, (Packet4ui)p16uc_PSET32_WEVEN); //{ 8,9,10,11, 12,13,14,15, 8,9,10,11, 12,13,14,15 }; -/*static Packet16uc p16uc_TRANSPOSE64_HI = vec_add(p16uc_PSET64_HI, p16uc_HALF64_0_16); //{ 0,1,2,3, 4,5,6,7, 16,17,18,19, 20,21,22,23}; -static Packet16uc p16uc_TRANSPOSE64_LO = vec_add(p16uc_PSET64_LO, p16uc_HALF64_0_16); //{ 8,9,10,11, 12,13,14,15, 24,25,26,27, 28,29,30,31};*/ -static Packet16uc p16uc_TRANSPOSE64_HI = { 0,1,2,3, 4,5,6,7, 16,17,18,19, 20,21,22,23}; -static Packet16uc p16uc_TRANSPOSE64_LO = { 8,9,10,11, 12,13,14,15, 24,25,26,27, 28,29,30,31}; - -static Packet16uc p16uc_COMPLEX32_REV = vec_sld(p16uc_REVERSE32, p16uc_REVERSE32, 8); //{ 4,5,6,7, 0,1,2,3, 12,13,14,15, 8,9,10,11 }; - -static Packet16uc p16uc_COMPLEX32_REV2 = vec_sld(p16uc_FORWARD, p16uc_FORWARD, 8); //{ 8,9,10,11, 12,13,14,15, 0,1,2,3, 4,5,6,7 }; - - -#if EIGEN_HAS_BUILTIN(__builtin_prefetch) || EIGEN_COMP_GNUC - #define EIGEN_ZVECTOR_PREFETCH(ADDR) __builtin_prefetch(ADDR); -#else - #define EIGEN_ZVECTOR_PREFETCH(ADDR) asm( " pfd [%[addr]]\n" :: [addr] "r" (ADDR) : "cc" ); -#endif - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4i type; - typedef Packet4i half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size = 4, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasBlend = 1 - }; -}; - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet4f type; - typedef Packet4f half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=4, - HasHalfPacket = 0, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasMin = 1, - HasMax = 1, - HasAbs = 1, - HasSin = 0, - HasCos = 0, - HasLog = 0, -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) - HasExp = 0, -#else - HasExp = 1, -#endif - HasSqrt = 1, - HasRsqrt = 1, - HasRound = 1, - HasFloor = 1, - HasCeil = 1, - HasNegate = 1, - HasBlend = 1 - }; -}; - -template<> struct packet_traits : default_packet_traits -{ - typedef Packet2d type; - typedef Packet2d half; - enum { - Vectorizable = 1, - AlignedOnScalar = 1, - size=2, - HasHalfPacket = 1, - - HasAdd = 1, - HasSub = 1, - HasMul = 1, - HasDiv = 1, - HasMin = 1, - HasMax = 1, - HasAbs = 1, - HasSin = 0, - HasCos = 0, - HasLog = 0, - HasExp = 1, - HasSqrt = 1, - HasRsqrt = 1, - HasRound = 1, - HasFloor = 1, - HasCeil = 1, - HasNegate = 1, - HasBlend = 1 - }; -}; - -template<> struct unpacket_traits { typedef int type; enum {size=4, alignment=Aligned16}; typedef Packet4i half; }; -template<> struct unpacket_traits { typedef float type; enum {size=4, alignment=Aligned16}; typedef Packet4f half; }; -template<> struct unpacket_traits { typedef double type; enum {size=2, alignment=Aligned16}; typedef Packet2d half; }; - -/* Forward declaration */ -EIGEN_DEVICE_FUNC inline void ptranspose(PacketBlock& kernel); - -inline std::ostream & operator <<(std::ostream & s, const Packet4i & v) -{ - Packet vt; - vt.v4i = v; - s << vt.i[0] << ", " << vt.i[1] << ", " << vt.i[2] << ", " << vt.i[3]; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet4ui & v) -{ - Packet vt; - vt.v4ui = v; - s << vt.ui[0] << ", " << vt.ui[1] << ", " << vt.ui[2] << ", " << vt.ui[3]; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet2l & v) -{ - Packet vt; - vt.v2l = v; - s << vt.l[0] << ", " << vt.l[1]; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet2ul & v) -{ - Packet vt; - vt.v2ul = v; - s << vt.ul[0] << ", " << vt.ul[1] ; - return s; -} - -inline std::ostream & operator <<(std::ostream & s, const Packet2d & v) -{ - Packet vt; - vt.v2d = v; - s << vt.d[0] << ", " << vt.d[1]; - return s; -} - -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ >= 12) -inline std::ostream & operator <<(std::ostream & s, const Packet4f & v) -{ - Packet vt; - vt.v4f = v; - s << vt.f[0] << ", " << vt.f[1] << ", " << vt.f[2] << ", " << vt.f[3]; - return s; -} -#endif - - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4i& first, const Packet4i& second) - { - switch (Offset % 4) { - case 1: - first = vec_sld(first, second, 4); break; - case 2: - first = vec_sld(first, second, 8); break; - case 3: - first = vec_sld(first, second, 12); break; - } - } -}; - -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet2d& first, const Packet2d& second) - { - if (Offset == 1) - first = reinterpret_cast(vec_sld(reinterpret_cast(first), reinterpret_cast(second), 8)); - } -}; - -template<> EIGEN_STRONG_INLINE Packet4i pload(const int* from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_LOAD - Packet *vfrom; - vfrom = (Packet *) from; - return vfrom->v4i; -} - -template<> EIGEN_STRONG_INLINE Packet2d pload(const double* from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_LOAD - Packet *vfrom; - vfrom = (Packet *) from; - return vfrom->v2d; -} - -template<> EIGEN_STRONG_INLINE void pstore(int* to, const Packet4i& from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_STORE - Packet *vto; - vto = (Packet *) to; - vto->v4i = from; -} - -template<> EIGEN_STRONG_INLINE void pstore(double* to, const Packet2d& from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_STORE - Packet *vto; - vto = (Packet *) to; - vto->v2d = from; -} - -template<> EIGEN_STRONG_INLINE Packet4i pset1(const int& from) -{ - return vec_splats(from); -} -template<> EIGEN_STRONG_INLINE Packet2d pset1(const double& from) { - return vec_splats(from); -} - -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const int *a, - Packet4i& a0, Packet4i& a1, Packet4i& a2, Packet4i& a3) -{ - a3 = pload(a); - a0 = vec_splat(a3, 0); - a1 = vec_splat(a3, 1); - a2 = vec_splat(a3, 2); - a3 = vec_splat(a3, 3); -} - -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const double *a, - Packet2d& a0, Packet2d& a1, Packet2d& a2, Packet2d& a3) -{ - a1 = pload(a); - a0 = vec_splat(a1, 0); - a1 = vec_splat(a1, 1); - a3 = pload(a+2); - a2 = vec_splat(a3, 0); - a3 = vec_splat(a3, 1); -} - -template<> EIGEN_DEVICE_FUNC inline Packet4i pgather(const int* from, Index stride) -{ - int EIGEN_ALIGN16 ai[4]; - ai[0] = from[0*stride]; - ai[1] = from[1*stride]; - ai[2] = from[2*stride]; - ai[3] = from[3*stride]; - return pload(ai); -} - -template<> EIGEN_DEVICE_FUNC inline Packet2d pgather(const double* from, Index stride) -{ - double EIGEN_ALIGN16 af[2]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - return pload(af); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(int* to, const Packet4i& from, Index stride) -{ - int EIGEN_ALIGN16 ai[4]; - pstore((int *)ai, from); - to[0*stride] = ai[0]; - to[1*stride] = ai[1]; - to[2*stride] = ai[2]; - to[3*stride] = ai[3]; -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(double* to, const Packet2d& from, Index stride) -{ - double EIGEN_ALIGN16 af[2]; - pstore(af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; -} - -template<> EIGEN_STRONG_INLINE Packet4i padd(const Packet4i& a, const Packet4i& b) { return (a + b); } -template<> EIGEN_STRONG_INLINE Packet2d padd(const Packet2d& a, const Packet2d& b) { return (a + b); } - -template<> EIGEN_STRONG_INLINE Packet4i psub(const Packet4i& a, const Packet4i& b) { return (a - b); } -template<> EIGEN_STRONG_INLINE Packet2d psub(const Packet2d& a, const Packet2d& b) { return (a - b); } - -template<> EIGEN_STRONG_INLINE Packet4i pmul(const Packet4i& a, const Packet4i& b) { return (a * b); } -template<> EIGEN_STRONG_INLINE Packet2d pmul(const Packet2d& a, const Packet2d& b) { return (a * b); } - -template<> EIGEN_STRONG_INLINE Packet4i pdiv(const Packet4i& a, const Packet4i& b) { return (a / b); } -template<> EIGEN_STRONG_INLINE Packet2d pdiv(const Packet2d& a, const Packet2d& b) { return (a / b); } - -template<> EIGEN_STRONG_INLINE Packet4i pnegate(const Packet4i& a) { return (-a); } -template<> EIGEN_STRONG_INLINE Packet2d pnegate(const Packet2d& a) { return (-a); } - -template<> EIGEN_STRONG_INLINE Packet4i pconj(const Packet4i& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet2d pconj(const Packet2d& a) { return a; } - -template<> EIGEN_STRONG_INLINE Packet4i pmadd(const Packet4i& a, const Packet4i& b, const Packet4i& c) { return padd(pmul(a, b), c); } -template<> EIGEN_STRONG_INLINE Packet2d pmadd(const Packet2d& a, const Packet2d& b, const Packet2d& c) { return vec_madd(a, b, c); } - -template<> EIGEN_STRONG_INLINE Packet4i plset(const int& a) { return padd(pset1(a), p4i_COUNTDOWN); } -template<> EIGEN_STRONG_INLINE Packet2d plset(const double& a) { return padd(pset1(a), p2d_COUNTDOWN); } - -template<> EIGEN_STRONG_INLINE Packet4i pmin(const Packet4i& a, const Packet4i& b) { return vec_min(a, b); } -template<> EIGEN_STRONG_INLINE Packet2d pmin(const Packet2d& a, const Packet2d& b) { return vec_min(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4i pmax(const Packet4i& a, const Packet4i& b) { return vec_max(a, b); } -template<> EIGEN_STRONG_INLINE Packet2d pmax(const Packet2d& a, const Packet2d& b) { return vec_max(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4i pand(const Packet4i& a, const Packet4i& b) { return vec_and(a, b); } -template<> EIGEN_STRONG_INLINE Packet2d pand(const Packet2d& a, const Packet2d& b) { return vec_and(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4i por(const Packet4i& a, const Packet4i& b) { return vec_or(a, b); } -template<> EIGEN_STRONG_INLINE Packet2d por(const Packet2d& a, const Packet2d& b) { return vec_or(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4i pxor(const Packet4i& a, const Packet4i& b) { return vec_xor(a, b); } -template<> EIGEN_STRONG_INLINE Packet2d pxor(const Packet2d& a, const Packet2d& b) { return vec_xor(a, b); } - -template<> EIGEN_STRONG_INLINE Packet4i pandnot(const Packet4i& a, const Packet4i& b) { return pand(a, vec_nor(b, b)); } -template<> EIGEN_STRONG_INLINE Packet2d pandnot(const Packet2d& a, const Packet2d& b) { return vec_and(a, vec_nor(b, b)); } - -template<> EIGEN_STRONG_INLINE Packet2d pround(const Packet2d& a) { return vec_round(a); } -template<> EIGEN_STRONG_INLINE Packet2d pceil(const Packet2d& a) { return vec_ceil(a); } -template<> EIGEN_STRONG_INLINE Packet2d pfloor(const Packet2d& a) { return vec_floor(a); } - -template<> EIGEN_STRONG_INLINE Packet4i ploadu(const int* from) { return pload(from); } -template<> EIGEN_STRONG_INLINE Packet2d ploadu(const double* from) { return pload(from); } - - -template<> EIGEN_STRONG_INLINE Packet4i ploaddup(const int* from) -{ - Packet4i p = pload(from); - return vec_perm(p, p, p16uc_DUPLICATE32_HI); -} - -template<> EIGEN_STRONG_INLINE Packet2d ploaddup(const double* from) -{ - Packet2d p = pload(from); - return vec_perm(p, p, p16uc_PSET64_HI); -} - -template<> EIGEN_STRONG_INLINE void pstoreu(int* to, const Packet4i& from) { pstore(to, from); } -template<> EIGEN_STRONG_INLINE void pstoreu(double* to, const Packet2d& from) { pstore(to, from); } - -template<> EIGEN_STRONG_INLINE void prefetch(const int* addr) { EIGEN_ZVECTOR_PREFETCH(addr); } -template<> EIGEN_STRONG_INLINE void prefetch(const double* addr) { EIGEN_ZVECTOR_PREFETCH(addr); } - -template<> EIGEN_STRONG_INLINE int pfirst(const Packet4i& a) { int EIGEN_ALIGN16 x[4]; pstore(x, a); return x[0]; } -template<> EIGEN_STRONG_INLINE double pfirst(const Packet2d& a) { double EIGEN_ALIGN16 x[2]; pstore(x, a); return x[0]; } - -template<> EIGEN_STRONG_INLINE Packet4i preverse(const Packet4i& a) -{ - return reinterpret_cast(vec_perm(reinterpret_cast(a), reinterpret_cast(a), p16uc_REVERSE32)); -} - -template<> EIGEN_STRONG_INLINE Packet2d preverse(const Packet2d& a) -{ - return reinterpret_cast(vec_perm(reinterpret_cast(a), reinterpret_cast(a), p16uc_REVERSE64)); -} - -template<> EIGEN_STRONG_INLINE Packet4i pabs(const Packet4i& a) { return vec_abs(a); } -template<> EIGEN_STRONG_INLINE Packet2d pabs(const Packet2d& a) { return vec_abs(a); } - -template<> EIGEN_STRONG_INLINE int predux(const Packet4i& a) -{ - Packet4i b, sum; - b = vec_sld(a, a, 8); - sum = padd(a, b); - b = vec_sld(sum, sum, 4); - sum = padd(sum, b); - return pfirst(sum); -} - -template<> EIGEN_STRONG_INLINE double predux(const Packet2d& a) -{ - Packet2d b, sum; - b = reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)); - sum = padd(a, b); - return pfirst(sum); -} - -template<> EIGEN_STRONG_INLINE Packet4i preduxp(const Packet4i* vecs) -{ - Packet4i v[4], sum[4]; - - // It's easier and faster to transpose then add as columns - // Check: http://www.freevec.org/function/matrix_4x4_transpose_floats for explanation - // Do the transpose, first set of moves - v[0] = vec_mergeh(vecs[0], vecs[2]); - v[1] = vec_mergel(vecs[0], vecs[2]); - v[2] = vec_mergeh(vecs[1], vecs[3]); - v[3] = vec_mergel(vecs[1], vecs[3]); - // Get the resulting vectors - sum[0] = vec_mergeh(v[0], v[2]); - sum[1] = vec_mergel(v[0], v[2]); - sum[2] = vec_mergeh(v[1], v[3]); - sum[3] = vec_mergel(v[1], v[3]); - - // Now do the summation: - // Lines 0+1 - sum[0] = padd(sum[0], sum[1]); - // Lines 2+3 - sum[1] = padd(sum[2], sum[3]); - // Add the results - sum[0] = padd(sum[0], sum[1]); - - return sum[0]; -} - -template<> EIGEN_STRONG_INLINE Packet2d preduxp(const Packet2d* vecs) -{ - Packet2d v[2], sum; - v[0] = padd(vecs[0], reinterpret_cast(vec_sld(reinterpret_cast(vecs[0]), reinterpret_cast(vecs[0]), 8))); - v[1] = padd(vecs[1], reinterpret_cast(vec_sld(reinterpret_cast(vecs[1]), reinterpret_cast(vecs[1]), 8))); - - sum = reinterpret_cast(vec_sld(reinterpret_cast(v[0]), reinterpret_cast(v[1]), 8)); - - return sum; -} - -// Other reduction functions: -// mul -template<> EIGEN_STRONG_INLINE int predux_mul(const Packet4i& a) -{ - EIGEN_ALIGN16 int aux[4]; - pstore(aux, a); - return aux[0] * aux[1] * aux[2] * aux[3]; -} - -template<> EIGEN_STRONG_INLINE double predux_mul(const Packet2d& a) -{ - return pfirst(pmul(a, reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)))); -} - -// min -template<> EIGEN_STRONG_INLINE int predux_min(const Packet4i& a) -{ - Packet4i b, res; - b = pmin(a, vec_sld(a, a, 8)); - res = pmin(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -template<> EIGEN_STRONG_INLINE double predux_min(const Packet2d& a) -{ - return pfirst(pmin(a, reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)))); -} - -// max -template<> EIGEN_STRONG_INLINE int predux_max(const Packet4i& a) -{ - Packet4i b, res; - b = pmax(a, vec_sld(a, a, 8)); - res = pmax(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -// max -template<> EIGEN_STRONG_INLINE double predux_max(const Packet2d& a) -{ - return pfirst(pmax(a, reinterpret_cast(vec_sld(reinterpret_cast(a), reinterpret_cast(a), 8)))); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet4i t0 = vec_mergeh(kernel.packet[0], kernel.packet[2]); - Packet4i t1 = vec_mergel(kernel.packet[0], kernel.packet[2]); - Packet4i t2 = vec_mergeh(kernel.packet[1], kernel.packet[3]); - Packet4i t3 = vec_mergel(kernel.packet[1], kernel.packet[3]); - kernel.packet[0] = vec_mergeh(t0, t2); - kernel.packet[1] = vec_mergel(t0, t2); - kernel.packet[2] = vec_mergeh(t1, t3); - kernel.packet[3] = vec_mergel(t1, t3); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet2d t0 = vec_perm(kernel.packet[0], kernel.packet[1], p16uc_TRANSPOSE64_HI); - Packet2d t1 = vec_perm(kernel.packet[0], kernel.packet[1], p16uc_TRANSPOSE64_LO); - kernel.packet[0] = t0; - kernel.packet[1] = t1; -} - -template<> EIGEN_STRONG_INLINE Packet4i pblend(const Selector<4>& ifPacket, const Packet4i& thenPacket, const Packet4i& elsePacket) { - Packet4ui select = { ifPacket.select[0], ifPacket.select[1], ifPacket.select[2], ifPacket.select[3] }; - Packet4ui mask = vec_cmpeq(select, reinterpret_cast(p4i_ONE)); - return vec_sel(elsePacket, thenPacket, mask); -} - - -template<> EIGEN_STRONG_INLINE Packet2d pblend(const Selector<2>& ifPacket, const Packet2d& thenPacket, const Packet2d& elsePacket) { - Packet2ul select = { ifPacket.select[0], ifPacket.select[1] }; - Packet2ul mask = vec_cmpeq(select, reinterpret_cast(p2l_ONE)); - return vec_sel(elsePacket, thenPacket, mask); -} - -/* z13 has no vector float support so we emulate that with double - z14 has proper vector float support. -*/ -#if !defined(__ARCH__) || (defined(__ARCH__) && __ARCH__ < 12) -/* Helper function to simulate a vec_splat_packet4f - */ -template EIGEN_STRONG_INLINE Packet4f vec_splat_packet4f(const Packet4f& from) -{ - Packet4f splat; - switch (element) { - case 0: - splat.v4f[0] = vec_splat(from.v4f[0], 0); - splat.v4f[1] = splat.v4f[0]; - break; - case 1: - splat.v4f[0] = vec_splat(from.v4f[0], 1); - splat.v4f[1] = splat.v4f[0]; - break; - case 2: - splat.v4f[0] = vec_splat(from.v4f[1], 0); - splat.v4f[1] = splat.v4f[0]; - break; - case 3: - splat.v4f[0] = vec_splat(from.v4f[1], 1); - splat.v4f[1] = splat.v4f[0]; - break; - } - return splat; -} - -/* This is a tricky one, we have to translate float alignment to vector elements of sizeof double - */ -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4f& first, const Packet4f& second) - { - switch (Offset % 4) { - case 1: - first.v4f[0] = vec_sld(first.v4f[0], first.v4f[1], 8); - first.v4f[1] = vec_sld(first.v4f[1], second.v4f[0], 8); - break; - case 2: - first.v4f[0] = first.v4f[1]; - first.v4f[1] = second.v4f[0]; - break; - case 3: - first.v4f[0] = vec_sld(first.v4f[1], second.v4f[0], 8); - first.v4f[1] = vec_sld(second.v4f[0], second.v4f[1], 8); - break; - } - } -}; - -template<> EIGEN_STRONG_INLINE Packet4f pload(const float* from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_LOAD - Packet4f vfrom; - vfrom.v4f[0] = vec_ld2f(&from[0]); - vfrom.v4f[1] = vec_ld2f(&from[2]); - return vfrom; -} - -template<> EIGEN_STRONG_INLINE void pstore(float* to, const Packet4f& from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_STORE - vec_st2f(from.v4f[0], &to[0]); - vec_st2f(from.v4f[1], &to[2]); -} - -template<> EIGEN_STRONG_INLINE Packet4f pset1(const float& from) -{ - Packet4f to; - to.v4f[0] = pset1(static_cast(from)); - to.v4f[1] = to.v4f[0]; - return to; -} - -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const float *a, - Packet4f& a0, Packet4f& a1, Packet4f& a2, Packet4f& a3) -{ - a3 = pload(a); - a0 = vec_splat_packet4f<0>(a3); - a1 = vec_splat_packet4f<1>(a3); - a2 = vec_splat_packet4f<2>(a3); - a3 = vec_splat_packet4f<3>(a3); -} - -template<> EIGEN_DEVICE_FUNC inline Packet4f pgather(const float* from, Index stride) -{ - float EIGEN_ALIGN16 ai[4]; - ai[0] = from[0*stride]; - ai[1] = from[1*stride]; - ai[2] = from[2*stride]; - ai[3] = from[3*stride]; - return pload(ai); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const Packet4f& from, Index stride) -{ - float EIGEN_ALIGN16 ai[4]; - pstore((float *)ai, from); - to[0*stride] = ai[0]; - to[1*stride] = ai[1]; - to[2*stride] = ai[2]; - to[3*stride] = ai[3]; -} - -template<> EIGEN_STRONG_INLINE Packet4f padd(const Packet4f& a, const Packet4f& b) -{ - Packet4f c; - c.v4f[0] = a.v4f[0] + b.v4f[0]; - c.v4f[1] = a.v4f[1] + b.v4f[1]; - return c; -} - -template<> EIGEN_STRONG_INLINE Packet4f psub(const Packet4f& a, const Packet4f& b) -{ - Packet4f c; - c.v4f[0] = a.v4f[0] - b.v4f[0]; - c.v4f[1] = a.v4f[1] - b.v4f[1]; - return c; -} - -template<> EIGEN_STRONG_INLINE Packet4f pmul(const Packet4f& a, const Packet4f& b) -{ - Packet4f c; - c.v4f[0] = a.v4f[0] * b.v4f[0]; - c.v4f[1] = a.v4f[1] * b.v4f[1]; - return c; -} - -template<> EIGEN_STRONG_INLINE Packet4f pdiv(const Packet4f& a, const Packet4f& b) -{ - Packet4f c; - c.v4f[0] = a.v4f[0] / b.v4f[0]; - c.v4f[1] = a.v4f[1] / b.v4f[1]; - return c; -} - -template<> EIGEN_STRONG_INLINE Packet4f pnegate(const Packet4f& a) -{ - Packet4f c; - c.v4f[0] = -a.v4f[0]; - c.v4f[1] = -a.v4f[1]; - return c; -} - -template<> EIGEN_STRONG_INLINE Packet4f pmadd(const Packet4f& a, const Packet4f& b, const Packet4f& c) -{ - Packet4f res; - res.v4f[0] = vec_madd(a.v4f[0], b.v4f[0], c.v4f[0]); - res.v4f[1] = vec_madd(a.v4f[1], b.v4f[1], c.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pmin(const Packet4f& a, const Packet4f& b) -{ - Packet4f res; - res.v4f[0] = pmin(a.v4f[0], b.v4f[0]); - res.v4f[1] = pmin(a.v4f[1], b.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pmax(const Packet4f& a, const Packet4f& b) -{ - Packet4f res; - res.v4f[0] = pmax(a.v4f[0], b.v4f[0]); - res.v4f[1] = pmax(a.v4f[1], b.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pand(const Packet4f& a, const Packet4f& b) -{ - Packet4f res; - res.v4f[0] = pand(a.v4f[0], b.v4f[0]); - res.v4f[1] = pand(a.v4f[1], b.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f por(const Packet4f& a, const Packet4f& b) -{ - Packet4f res; - res.v4f[0] = pand(a.v4f[0], b.v4f[0]); - res.v4f[1] = pand(a.v4f[1], b.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pxor(const Packet4f& a, const Packet4f& b) -{ - Packet4f res; - res.v4f[0] = pand(a.v4f[0], b.v4f[0]); - res.v4f[1] = pand(a.v4f[1], b.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pandnot(const Packet4f& a, const Packet4f& b) -{ - Packet4f res; - res.v4f[0] = pandnot(a.v4f[0], b.v4f[0]); - res.v4f[1] = pandnot(a.v4f[1], b.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pround(const Packet4f& a) -{ - Packet4f res; - res.v4f[0] = vec_round(a.v4f[0]); - res.v4f[1] = vec_round(a.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pceil(const Packet4f& a) -{ - Packet4f res; - res.v4f[0] = vec_ceil(a.v4f[0]); - res.v4f[1] = vec_ceil(a.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f pfloor(const Packet4f& a) -{ - Packet4f res; - res.v4f[0] = vec_floor(a.v4f[0]); - res.v4f[1] = vec_floor(a.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE Packet4f ploaddup(const float* from) -{ - Packet4f p = pload(from); - p.v4f[1] = vec_splat(p.v4f[0], 1); - p.v4f[0] = vec_splat(p.v4f[0], 0); - return p; -} - -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { float EIGEN_ALIGN16 x[2]; vec_st2f(a.v4f[0], &x[0]); return x[0]; } - -template<> EIGEN_STRONG_INLINE Packet4f preverse(const Packet4f& a) -{ - Packet4f rev; - rev.v4f[0] = preverse(a.v4f[1]); - rev.v4f[1] = preverse(a.v4f[0]); - return rev; -} - -template<> EIGEN_STRONG_INLINE Packet4f pabs(const Packet4f& a) -{ - Packet4f res; - res.v4f[0] = pabs(a.v4f[0]); - res.v4f[1] = pabs(a.v4f[1]); - return res; -} - -template<> EIGEN_STRONG_INLINE float predux(const Packet4f& a) -{ - Packet2d sum; - sum = padd(a.v4f[0], a.v4f[1]); - double first = predux(sum); - return static_cast(first); -} - -template<> EIGEN_STRONG_INLINE Packet4f preduxp(const Packet4f* vecs) -{ - PacketBlock transpose; - transpose.packet[0] = vecs[0]; - transpose.packet[1] = vecs[1]; - transpose.packet[2] = vecs[2]; - transpose.packet[3] = vecs[3]; - ptranspose(transpose); - - Packet4f sum = padd(transpose.packet[0], transpose.packet[1]); - sum = padd(sum, transpose.packet[2]); - sum = padd(sum, transpose.packet[3]); - return sum; -} - -template<> EIGEN_STRONG_INLINE float predux_mul(const Packet4f& a) -{ - // Return predux_mul of the subvectors product - return static_cast(pfirst(predux_mul(pmul(a.v4f[0], a.v4f[1])))); -} - -template<> EIGEN_STRONG_INLINE float predux_min(const Packet4f& a) -{ - Packet2d b, res; - b = pmin(a.v4f[0], a.v4f[1]); - res = pmin(b, reinterpret_cast(vec_sld(reinterpret_cast(b), reinterpret_cast(b), 8))); - return static_cast(pfirst(res)); -} - -template<> EIGEN_STRONG_INLINE float predux_max(const Packet4f& a) -{ - Packet2d b, res; - b = pmax(a.v4f[0], a.v4f[1]); - res = pmax(b, reinterpret_cast(vec_sld(reinterpret_cast(b), reinterpret_cast(b), 8))); - return static_cast(pfirst(res)); -} - -/* Split the Packet4f PacketBlock into 4 Packet2d PacketBlocks and transpose each one - */ -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - PacketBlock t0,t1,t2,t3; - // copy top-left 2x2 Packet2d block - t0.packet[0] = kernel.packet[0].v4f[0]; - t0.packet[1] = kernel.packet[1].v4f[0]; - - // copy top-right 2x2 Packet2d block - t1.packet[0] = kernel.packet[0].v4f[1]; - t1.packet[1] = kernel.packet[1].v4f[1]; - - // copy bottom-left 2x2 Packet2d block - t2.packet[0] = kernel.packet[2].v4f[0]; - t2.packet[1] = kernel.packet[3].v4f[0]; - - // copy bottom-right 2x2 Packet2d block - t3.packet[0] = kernel.packet[2].v4f[1]; - t3.packet[1] = kernel.packet[3].v4f[1]; - - // Transpose all 2x2 blocks - ptranspose(t0); - ptranspose(t1); - ptranspose(t2); - ptranspose(t3); - - // Copy back transposed blocks, but exchange t1 and t2 due to transposition - kernel.packet[0].v4f[0] = t0.packet[0]; - kernel.packet[0].v4f[1] = t2.packet[0]; - kernel.packet[1].v4f[0] = t0.packet[1]; - kernel.packet[1].v4f[1] = t2.packet[1]; - kernel.packet[2].v4f[0] = t1.packet[0]; - kernel.packet[2].v4f[1] = t3.packet[0]; - kernel.packet[3].v4f[0] = t1.packet[1]; - kernel.packet[3].v4f[1] = t3.packet[1]; -} - -template<> EIGEN_STRONG_INLINE Packet4f pblend(const Selector<4>& ifPacket, const Packet4f& thenPacket, const Packet4f& elsePacket) { - Packet2ul select_hi = { ifPacket.select[0], ifPacket.select[1] }; - Packet2ul select_lo = { ifPacket.select[2], ifPacket.select[3] }; - Packet2ul mask_hi = vec_cmpeq(select_hi, reinterpret_cast(p2l_ONE)); - Packet2ul mask_lo = vec_cmpeq(select_lo, reinterpret_cast(p2l_ONE)); - Packet4f result; - result.v4f[0] = vec_sel(elsePacket.v4f[0], thenPacket.v4f[0], mask_hi); - result.v4f[1] = vec_sel(elsePacket.v4f[1], thenPacket.v4f[1], mask_lo); - return result; -} -#else -template -struct palign_impl -{ - static EIGEN_STRONG_INLINE void run(Packet4f& first, const Packet4f& second) - { - switch (Offset % 4) { - case 1: - first = vec_sld(first, second, 4); break; - case 2: - first = vec_sld(first, second, 8); break; - case 3: - first = vec_sld(first, second, 12); break; - } - } -}; - -template<> EIGEN_STRONG_INLINE Packet4f pload(const float* from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_LOAD - Packet *vfrom; - vfrom = (Packet *) from; - return vfrom->v4f; -} - -template<> EIGEN_STRONG_INLINE void pstore(float* to, const Packet4f& from) -{ - // FIXME: No intrinsic yet - EIGEN_DEBUG_ALIGNED_STORE - Packet *vto; - vto = (Packet *) to; - vto->v4f = from; -} - -template<> EIGEN_STRONG_INLINE Packet4f pset1(const float& from) -{ - return vec_splats(from); -} - -template<> EIGEN_STRONG_INLINE void -pbroadcast4(const float *a, - Packet4f& a0, Packet4f& a1, Packet4f& a2, Packet4f& a3) -{ - a3 = pload(a); - a0 = vec_splat(a3, 0); - a1 = vec_splat(a3, 1); - a2 = vec_splat(a3, 2); - a3 = vec_splat(a3, 3); -} - -template<> EIGEN_DEVICE_FUNC inline Packet4f pgather(const float* from, Index stride) -{ - float EIGEN_ALIGN16 af[4]; - af[0] = from[0*stride]; - af[1] = from[1*stride]; - af[2] = from[2*stride]; - af[3] = from[3*stride]; - return pload(af); -} - -template<> EIGEN_DEVICE_FUNC inline void pscatter(float* to, const Packet4f& from, Index stride) -{ - float EIGEN_ALIGN16 af[4]; - pstore((float*)af, from); - to[0*stride] = af[0]; - to[1*stride] = af[1]; - to[2*stride] = af[2]; - to[3*stride] = af[3]; -} - -template<> EIGEN_STRONG_INLINE Packet4f padd(const Packet4f& a, const Packet4f& b) { return (a + b); } -template<> EIGEN_STRONG_INLINE Packet4f psub(const Packet4f& a, const Packet4f& b) { return (a - b); } -template<> EIGEN_STRONG_INLINE Packet4f pmul(const Packet4f& a, const Packet4f& b) { return (a * b); } -template<> EIGEN_STRONG_INLINE Packet4f pdiv(const Packet4f& a, const Packet4f& b) { return (a / b); } -template<> EIGEN_STRONG_INLINE Packet4f pnegate(const Packet4f& a) { return (-a); } -template<> EIGEN_STRONG_INLINE Packet4f pconj (const Packet4f& a) { return a; } -template<> EIGEN_STRONG_INLINE Packet4f pmadd (const Packet4f& a, const Packet4f& b, const Packet4f& c) { return vec_madd(a, b, c); } -template<> EIGEN_STRONG_INLINE Packet4f pmin (const Packet4f& a, const Packet4f& b) { return vec_min(a, b); } -template<> EIGEN_STRONG_INLINE Packet4f pmax (const Packet4f& a, const Packet4f& b) { return vec_max(a, b); } -template<> EIGEN_STRONG_INLINE Packet4f pand (const Packet4f& a, const Packet4f& b) { return vec_and(a, b); } -template<> EIGEN_STRONG_INLINE Packet4f por (const Packet4f& a, const Packet4f& b) { return vec_or(a, b); } -template<> EIGEN_STRONG_INLINE Packet4f pxor (const Packet4f& a, const Packet4f& b) { return vec_xor(a, b); } -template<> EIGEN_STRONG_INLINE Packet4f pandnot(const Packet4f& a, const Packet4f& b) { return vec_and(a, vec_nor(b, b)); } -template<> EIGEN_STRONG_INLINE Packet4f pround (const Packet4f& a) { return vec_round(a); } -template<> EIGEN_STRONG_INLINE Packet4f pceil (const Packet4f& a) { return vec_ceil(a); } -template<> EIGEN_STRONG_INLINE Packet4f pfloor (const Packet4f& a) { return vec_floor(a); } -template<> EIGEN_STRONG_INLINE Packet4f pabs (const Packet4f& a) { return vec_abs(a); } -template<> EIGEN_STRONG_INLINE float pfirst(const Packet4f& a) { float EIGEN_ALIGN16 x[4]; pstore(x, a); return x[0]; } - -template<> EIGEN_STRONG_INLINE Packet4f ploaddup(const float* from) -{ - Packet4f p = pload(from); - return vec_perm(p, p, p16uc_DUPLICATE32_HI); -} - -template<> EIGEN_STRONG_INLINE Packet4f preverse(const Packet4f& a) -{ - return reinterpret_cast(vec_perm(reinterpret_cast(a), reinterpret_cast(a), p16uc_REVERSE32)); -} - -template<> EIGEN_STRONG_INLINE float predux(const Packet4f& a) -{ - Packet4f b, sum; - b = vec_sld(a, a, 8); - sum = padd(a, b); - b = vec_sld(sum, sum, 4); - sum = padd(sum, b); - return pfirst(sum); -} - -template<> EIGEN_STRONG_INLINE Packet4f preduxp(const Packet4f* vecs) -{ - Packet4f v[4], sum[4]; - - // It's easier and faster to transpose then add as columns - // Check: http://www.freevec.org/function/matrix_4x4_transpose_floats for explanation - // Do the transpose, first set of moves - v[0] = vec_mergeh(vecs[0], vecs[2]); - v[1] = vec_mergel(vecs[0], vecs[2]); - v[2] = vec_mergeh(vecs[1], vecs[3]); - v[3] = vec_mergel(vecs[1], vecs[3]); - // Get the resulting vectors - sum[0] = vec_mergeh(v[0], v[2]); - sum[1] = vec_mergel(v[0], v[2]); - sum[2] = vec_mergeh(v[1], v[3]); - sum[3] = vec_mergel(v[1], v[3]); - - // Now do the summation: - // Lines 0+1 - sum[0] = padd(sum[0], sum[1]); - // Lines 2+3 - sum[1] = padd(sum[2], sum[3]); - // Add the results - sum[0] = padd(sum[0], sum[1]); - - return sum[0]; -} - -// Other reduction functions: -// mul -template<> EIGEN_STRONG_INLINE float predux_mul(const Packet4f& a) -{ - Packet4f prod; - prod = pmul(a, vec_sld(a, a, 8)); - return pfirst(pmul(prod, vec_sld(prod, prod, 4))); -} - -// min -template<> EIGEN_STRONG_INLINE float predux_min(const Packet4f& a) -{ - Packet4f b, res; - b = pmin(a, vec_sld(a, a, 8)); - res = pmin(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -// max -template<> EIGEN_STRONG_INLINE float predux_max(const Packet4f& a) -{ - Packet4f b, res; - b = pmax(a, vec_sld(a, a, 8)); - res = pmax(b, vec_sld(b, b, 4)); - return pfirst(res); -} - -EIGEN_DEVICE_FUNC inline void -ptranspose(PacketBlock& kernel) { - Packet4f t0 = vec_mergeh(kernel.packet[0], kernel.packet[2]); - Packet4f t1 = vec_mergel(kernel.packet[0], kernel.packet[2]); - Packet4f t2 = vec_mergeh(kernel.packet[1], kernel.packet[3]); - Packet4f t3 = vec_mergel(kernel.packet[1], kernel.packet[3]); - kernel.packet[0] = vec_mergeh(t0, t2); - kernel.packet[1] = vec_mergel(t0, t2); - kernel.packet[2] = vec_mergeh(t1, t3); - kernel.packet[3] = vec_mergel(t1, t3); -} - -template<> EIGEN_STRONG_INLINE Packet4f pblend(const Selector<4>& ifPacket, const Packet4f& thenPacket, const Packet4f& elsePacket) { - Packet4ui select = { ifPacket.select[0], ifPacket.select[1], ifPacket.select[2], ifPacket.select[3] }; - Packet4ui mask = vec_cmpeq(select, reinterpret_cast(p4i_ONE)); - return vec_sel(elsePacket, thenPacket, mask); -} - -#endif - -template<> EIGEN_STRONG_INLINE void prefetch(const float* addr) { EIGEN_ZVECTOR_PREFETCH(addr); } -template<> EIGEN_STRONG_INLINE Packet4f ploadu (const float* from) { return pload(from); } -template<> EIGEN_STRONG_INLINE void pstoreu(float* to, const Packet4f& from) { pstore(to, from); } -template<> EIGEN_STRONG_INLINE Packet4f plset (const float& a) { return padd(pset1(a), p4f_COUNTDOWN); } - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PACKET_MATH_ZVECTOR_H diff --git a/Eigen/src/Core/functors/AssignmentFunctors.h b/Eigen/src/Core/functors/AssignmentFunctors.h deleted file mode 100644 index 1077d8eb0..000000000 --- a/Eigen/src/Core/functors/AssignmentFunctors.h +++ /dev/null @@ -1,168 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ASSIGNMENT_FUNCTORS_H -#define EIGEN_ASSIGNMENT_FUNCTORS_H - -namespace Eigen { - -namespace internal { - -/** \internal - * \brief Template functor for scalar/packet assignment - * - */ -template struct assign_op { - - EIGEN_EMPTY_STRUCT_CTOR(assign_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(DstScalar& a, const SrcScalar& b) const { a = b; } - - template - EIGEN_STRONG_INLINE void assignPacket(DstScalar* a, const Packet& b) const - { internal::pstoret(a,b); } -}; - -// Empty overload for void type (used by PermutationMatrix) -template struct assign_op {}; - -template -struct functor_traits > { - enum { - Cost = NumTraits::ReadCost, - PacketAccess = is_same::value && packet_traits::Vectorizable && packet_traits::Vectorizable - }; -}; - -/** \internal - * \brief Template functor for scalar/packet assignment with addition - * - */ -template struct add_assign_op { - - EIGEN_EMPTY_STRUCT_CTOR(add_assign_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(DstScalar& a, const SrcScalar& b) const { a += b; } - - template - EIGEN_STRONG_INLINE void assignPacket(DstScalar* a, const Packet& b) const - { internal::pstoret(a,internal::padd(internal::ploadt(a),b)); } -}; -template -struct functor_traits > { - enum { - Cost = NumTraits::ReadCost + NumTraits::AddCost, - PacketAccess = is_same::value && packet_traits::HasAdd - }; -}; - -/** \internal - * \brief Template functor for scalar/packet assignment with subtraction - * - */ -template struct sub_assign_op { - - EIGEN_EMPTY_STRUCT_CTOR(sub_assign_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(DstScalar& a, const SrcScalar& b) const { a -= b; } - - template - EIGEN_STRONG_INLINE void assignPacket(DstScalar* a, const Packet& b) const - { internal::pstoret(a,internal::psub(internal::ploadt(a),b)); } -}; -template -struct functor_traits > { - enum { - Cost = NumTraits::ReadCost + NumTraits::AddCost, - PacketAccess = is_same::value && packet_traits::HasSub - }; -}; - -/** \internal - * \brief Template functor for scalar/packet assignment with multiplication - * - */ -template -struct mul_assign_op { - - EIGEN_EMPTY_STRUCT_CTOR(mul_assign_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(DstScalar& a, const SrcScalar& b) const { a *= b; } - - template - EIGEN_STRONG_INLINE void assignPacket(DstScalar* a, const Packet& b) const - { internal::pstoret(a,internal::pmul(internal::ploadt(a),b)); } -}; -template -struct functor_traits > { - enum { - Cost = NumTraits::ReadCost + NumTraits::MulCost, - PacketAccess = is_same::value && packet_traits::HasMul - }; -}; - -/** \internal - * \brief Template functor for scalar/packet assignment with diviving - * - */ -template struct div_assign_op { - - EIGEN_EMPTY_STRUCT_CTOR(div_assign_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(DstScalar& a, const SrcScalar& b) const { a /= b; } - - template - EIGEN_STRONG_INLINE void assignPacket(DstScalar* a, const Packet& b) const - { internal::pstoret(a,internal::pdiv(internal::ploadt(a),b)); } -}; -template -struct functor_traits > { - enum { - Cost = NumTraits::ReadCost + NumTraits::MulCost, - PacketAccess = is_same::value && packet_traits::HasDiv - }; -}; - -/** \internal - * \brief Template functor for scalar/packet assignment with swapping - * - * It works as follow. For a non-vectorized evaluation loop, we have: - * for(i) func(A.coeffRef(i), B.coeff(i)); - * where B is a SwapWrapper expression. The trick is to make SwapWrapper::coeff behaves like a non-const coeffRef. - * Actually, SwapWrapper might not even be needed since even if B is a plain expression, since it has to be writable - * B.coeff already returns a const reference to the underlying scalar value. - * - * The case of a vectorized loop is more tricky: - * for(i,j) func.assignPacket(&A.coeffRef(i,j), B.packet(i,j)); - * Here, B must be a SwapWrapper whose packet function actually returns a proxy object holding a Scalar*, - * the actual alignment and Packet type. - * - */ -template struct swap_assign_op { - - EIGEN_EMPTY_STRUCT_CTOR(swap_assign_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void assignCoeff(Scalar& a, const Scalar& b) const - { -#ifdef EIGEN_CUDACC - // FIXME is there some kind of cuda::swap? - Scalar t=b; const_cast(b)=a; a=t; -#else - using std::swap; - swap(a,const_cast(b)); -#endif - } -}; -template -struct functor_traits > { - enum { - Cost = 3 * NumTraits::ReadCost, - PacketAccess = packet_traits::Vectorizable - }; -}; - -} // namespace internal - -} // namespace Eigen - -#endif // EIGEN_ASSIGNMENT_FUNCTORS_H diff --git a/Eigen/src/Core/functors/BinaryFunctors.h b/Eigen/src/Core/functors/BinaryFunctors.h deleted file mode 100644 index 96747bac7..000000000 --- a/Eigen/src/Core/functors/BinaryFunctors.h +++ /dev/null @@ -1,482 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BINARY_FUNCTORS_H -#define EIGEN_BINARY_FUNCTORS_H - -namespace Eigen { - -namespace internal { - -//---------- associative binary functors ---------- - -template -struct binary_op_base -{ - typedef Arg1 first_argument_type; - typedef Arg2 second_argument_type; -}; - -/** \internal - * \brief Template functor to compute the sum of two scalars - * - * \sa class CwiseBinaryOp, MatrixBase::operator+, class VectorwiseOp, DenseBase::sum() - */ -template -struct scalar_sum_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; -#ifndef EIGEN_SCALAR_BINARY_OP_PLUGIN - EIGEN_EMPTY_STRUCT_CTOR(scalar_sum_op) -#else - scalar_sum_op() { - EIGEN_SCALAR_BINARY_OP_PLUGIN - } -#endif - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a + b; } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return internal::padd(a,b); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type predux(const Packet& a) const - { return internal::predux(a); } -}; -template -struct functor_traits > { - enum { - Cost = (NumTraits::AddCost+NumTraits::AddCost)/2, // rough estimate! - PacketAccess = is_same::value && packet_traits::HasAdd && packet_traits::HasAdd - // TODO vectorize mixed sum - }; -}; - -/** \internal - * \brief Template specialization to deprecate the summation of boolean expressions. - * This is required to solve Bug 426. - * \sa DenseBase::count(), DenseBase::any(), ArrayBase::cast(), MatrixBase::cast() - */ -template<> struct scalar_sum_op : scalar_sum_op { - EIGEN_DEPRECATED - scalar_sum_op() {} -}; - - -/** \internal - * \brief Template functor to compute the product of two scalars - * - * \sa class CwiseBinaryOp, Cwise::operator*(), class VectorwiseOp, MatrixBase::redux() - */ -template -struct scalar_product_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; -#ifndef EIGEN_SCALAR_BINARY_OP_PLUGIN - EIGEN_EMPTY_STRUCT_CTOR(scalar_product_op) -#else - scalar_product_op() { - EIGEN_SCALAR_BINARY_OP_PLUGIN - } -#endif - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a * b; } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return internal::pmul(a,b); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type predux(const Packet& a) const - { return internal::predux_mul(a); } -}; -template -struct functor_traits > { - enum { - Cost = (NumTraits::MulCost + NumTraits::MulCost)/2, // rough estimate! - PacketAccess = is_same::value && packet_traits::HasMul && packet_traits::HasMul - // TODO vectorize mixed product - }; -}; - -/** \internal - * \brief Template functor to compute the conjugate product of two scalars - * - * This is a short cut for conj(x) * y which is needed for optimization purpose; in Eigen2 support mode, this becomes x * conj(y) - */ -template -struct scalar_conj_product_op : binary_op_base -{ - - enum { - Conj = NumTraits::IsComplex - }; - - typedef typename ScalarBinaryOpTraits::ReturnType result_type; - - EIGEN_EMPTY_STRUCT_CTOR(scalar_conj_product_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const - { return conj_helper().pmul(a,b); } - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return conj_helper().pmul(a,b); } -}; -template -struct functor_traits > { - enum { - Cost = NumTraits::MulCost, - PacketAccess = internal::is_same::value && packet_traits::HasMul - }; -}; - -/** \internal - * \brief Template functor to compute the min of two scalars - * - * \sa class CwiseBinaryOp, MatrixBase::cwiseMin, class VectorwiseOp, MatrixBase::minCoeff() - */ -template -struct scalar_min_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_min_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return numext::mini(a, b); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return internal::pmin(a,b); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type predux(const Packet& a) const - { return internal::predux_min(a); } -}; -template -struct functor_traits > { - enum { - Cost = (NumTraits::AddCost+NumTraits::AddCost)/2, - PacketAccess = internal::is_same::value && packet_traits::HasMin - }; -}; - -/** \internal - * \brief Template functor to compute the max of two scalars - * - * \sa class CwiseBinaryOp, MatrixBase::cwiseMax, class VectorwiseOp, MatrixBase::maxCoeff() - */ -template -struct scalar_max_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_max_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return numext::maxi(a, b); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return internal::pmax(a,b); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type predux(const Packet& a) const - { return internal::predux_max(a); } -}; -template -struct functor_traits > { - enum { - Cost = (NumTraits::AddCost+NumTraits::AddCost)/2, - PacketAccess = internal::is_same::value && packet_traits::HasMax - }; -}; - -/** \internal - * \brief Template functors for comparison of two scalars - * \todo Implement packet-comparisons - */ -template struct scalar_cmp_op; - -template -struct functor_traits > { - enum { - Cost = (NumTraits::AddCost+NumTraits::AddCost)/2, - PacketAccess = false - }; -}; - -template -struct result_of(LhsScalar,RhsScalar)> { - typedef bool type; -}; - - -template -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a==b;} -}; -template -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a<=b;} -}; -template -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a>b;} -}; -template -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a>=b;} -}; -template -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return !(a<=b || b<=a);} -}; -template -struct scalar_cmp_op : binary_op_base -{ - typedef bool result_type; - EIGEN_EMPTY_STRUCT_CTOR(scalar_cmp_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a!=b;} -}; - - -/** \internal - * \brief Template functor to compute the hypot of two scalars - * - * \sa MatrixBase::stableNorm(), class Redux - */ -template -struct scalar_hypot_op : binary_op_base -{ - EIGEN_EMPTY_STRUCT_CTOR(scalar_hypot_op) -// typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& _x, const Scalar& _y) const - { - EIGEN_USING_STD_MATH(sqrt) - Scalar p, qp; - if(_x>_y) - { - p = _x; - qp = _y / p; - } - else - { - p = _y; - qp = _x / p; - } - return p * sqrt(Scalar(1) + qp*qp); - } -}; -template -struct functor_traits > { - enum - { - Cost = 3 * NumTraits::AddCost + - 2 * NumTraits::MulCost + - 2 * scalar_div_cost::value, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to compute the pow of two scalars - */ -template -struct scalar_pow_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; -#ifndef EIGEN_SCALAR_BINARY_OP_PLUGIN - EIGEN_EMPTY_STRUCT_CTOR(scalar_pow_op) -#else - scalar_pow_op() { - typedef Scalar LhsScalar; - typedef Exponent RhsScalar; - EIGEN_SCALAR_BINARY_OP_PLUGIN - } -#endif - EIGEN_DEVICE_FUNC - inline result_type operator() (const Scalar& a, const Exponent& b) const { return numext::pow(a, b); } -}; -template -struct functor_traits > { - enum { Cost = 5 * NumTraits::MulCost, PacketAccess = false }; -}; - - - -//---------- non associative binary functors ---------- - -/** \internal - * \brief Template functor to compute the difference of two scalars - * - * \sa class CwiseBinaryOp, MatrixBase::operator- - */ -template -struct scalar_difference_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; -#ifndef EIGEN_SCALAR_BINARY_OP_PLUGIN - EIGEN_EMPTY_STRUCT_CTOR(scalar_difference_op) -#else - scalar_difference_op() { - EIGEN_SCALAR_BINARY_OP_PLUGIN - } -#endif - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a - b; } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return internal::psub(a,b); } -}; -template -struct functor_traits > { - enum { - Cost = (NumTraits::AddCost+NumTraits::AddCost)/2, - PacketAccess = is_same::value && packet_traits::HasSub && packet_traits::HasSub - }; -}; - -/** \internal - * \brief Template functor to compute the quotient of two scalars - * - * \sa class CwiseBinaryOp, Cwise::operator/() - */ -template -struct scalar_quotient_op : binary_op_base -{ - typedef typename ScalarBinaryOpTraits::ReturnType result_type; -#ifndef EIGEN_SCALAR_BINARY_OP_PLUGIN - EIGEN_EMPTY_STRUCT_CTOR(scalar_quotient_op) -#else - scalar_quotient_op() { - EIGEN_SCALAR_BINARY_OP_PLUGIN - } -#endif - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a / b; } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const - { return internal::pdiv(a,b); } -}; -template -struct functor_traits > { - typedef typename scalar_quotient_op::result_type result_type; - enum { - PacketAccess = is_same::value && packet_traits::HasDiv && packet_traits::HasDiv, - Cost = scalar_div_cost::value - }; -}; - - - -/** \internal - * \brief Template functor to compute the and of two booleans - * - * \sa class CwiseBinaryOp, ArrayBase::operator&& - */ -struct scalar_boolean_and_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_boolean_and_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator() (const bool& a, const bool& b) const { return a && b; } -}; -template<> struct functor_traits { - enum { - Cost = NumTraits::AddCost, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to compute the or of two booleans - * - * \sa class CwiseBinaryOp, ArrayBase::operator|| - */ -struct scalar_boolean_or_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_boolean_or_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator() (const bool& a, const bool& b) const { return a || b; } -}; -template<> struct functor_traits { - enum { - Cost = NumTraits::AddCost, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to compute the xor of two booleans - * - * \sa class CwiseBinaryOp, ArrayBase::operator^ - */ -struct scalar_boolean_xor_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_boolean_xor_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator() (const bool& a, const bool& b) const { return a ^ b; } -}; -template<> struct functor_traits { - enum { - Cost = NumTraits::AddCost, - PacketAccess = false - }; -}; - - - -//---------- binary functors bound to a constant, thus appearing as a unary functor ---------- - -// The following two classes permits to turn any binary functor into a unary one with one argument bound to a constant value. -// They are analogues to std::binder1st/binder2nd but with the following differences: -// - they are compatible with packetOp -// - they are portable across C++ versions (the std::binder* are deprecated in C++11) -template struct bind1st_op : BinaryOp { - - typedef typename BinaryOp::first_argument_type first_argument_type; - typedef typename BinaryOp::second_argument_type second_argument_type; - typedef typename BinaryOp::result_type result_type; - - bind1st_op(const first_argument_type &val) : m_value(val) {} - - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const second_argument_type& b) const { return BinaryOp::operator()(m_value,b); } - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& b) const - { return BinaryOp::packetOp(internal::pset1(m_value), b); } - - first_argument_type m_value; -}; -template struct functor_traits > : functor_traits {}; - - -template struct bind2nd_op : BinaryOp { - - typedef typename BinaryOp::first_argument_type first_argument_type; - typedef typename BinaryOp::second_argument_type second_argument_type; - typedef typename BinaryOp::result_type result_type; - - bind2nd_op(const second_argument_type &val) : m_value(val) {} - - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const first_argument_type& a) const { return BinaryOp::operator()(a,m_value); } - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const - { return BinaryOp::packetOp(a,internal::pset1(m_value)); } - - second_argument_type m_value; -}; -template struct functor_traits > : functor_traits {}; - - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_BINARY_FUNCTORS_H diff --git a/Eigen/src/Core/functors/NullaryFunctors.h b/Eigen/src/Core/functors/NullaryFunctors.h deleted file mode 100644 index b03be0269..000000000 --- a/Eigen/src/Core/functors/NullaryFunctors.h +++ /dev/null @@ -1,188 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2016 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_NULLARY_FUNCTORS_H -#define EIGEN_NULLARY_FUNCTORS_H - -namespace Eigen { - -namespace internal { - -template -struct scalar_constant_op { - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE scalar_constant_op(const scalar_constant_op& other) : m_other(other.m_other) { } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE scalar_constant_op(const Scalar& other) : m_other(other) { } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() () const { return m_other; } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const PacketType packetOp() const { return internal::pset1(m_other); } - const Scalar m_other; -}; -template -struct functor_traits > -{ enum { Cost = 0 /* as the constant value should be loaded in register only once for the whole expression */, - PacketAccess = packet_traits::Vectorizable, IsRepeatable = true }; }; - -template struct scalar_identity_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_identity_op) - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (IndexType row, IndexType col) const { return row==col ? Scalar(1) : Scalar(0); } -}; -template -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false, IsRepeatable = true }; }; - -template struct linspaced_op_impl; - -template -struct linspaced_op_impl -{ - linspaced_op_impl(const Scalar& low, const Scalar& high, Index num_steps) : - m_low(low), m_high(high), m_size1(num_steps==1 ? 1 : num_steps-1), m_step(num_steps==1 ? Scalar() : (high-low)/Scalar(num_steps-1)), - m_flip(numext::abs(high) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (IndexType i) const { - typedef typename NumTraits::Real RealScalar; - if(m_flip) - return (i==0)? m_low : (m_high - RealScalar(m_size1-i)*m_step); - else - return (i==m_size1)? m_high : (m_low + RealScalar(i)*m_step); - } - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(IndexType i) const - { - // Principle: - // [low, ..., low] + ( [step, ..., step] * ( [i, ..., i] + [0, ..., size] ) ) - if(m_flip) - { - Packet pi = plset(Scalar(i-m_size1)); - Packet res = padd(pset1(m_high), pmul(pset1(m_step), pi)); - if(i==0) - res = pinsertfirst(res, m_low); - return res; - } - else - { - Packet pi = plset(Scalar(i)); - Packet res = padd(pset1(m_low), pmul(pset1(m_step), pi)); - if(i==m_size1-unpacket_traits::size+1) - res = pinsertlast(res, m_high); - return res; - } - } - - const Scalar m_low; - const Scalar m_high; - const Index m_size1; - const Scalar m_step; - const bool m_flip; -}; - -template -struct linspaced_op_impl -{ - linspaced_op_impl(const Scalar& low, const Scalar& high, Index num_steps) : - m_low(low), - m_multiplier((high-low)/convert_index(num_steps<=1 ? 1 : num_steps-1)), - m_divisor(convert_index((high>=low?num_steps:-num_steps)+(high-low))/((numext::abs(high-low)+1)==0?1:(numext::abs(high-low)+1))), - m_use_divisor(num_steps>1 && (numext::abs(high-low)+1) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE - const Scalar operator() (IndexType i) const - { - if(m_use_divisor) return m_low + convert_index(i)/m_divisor; - else return m_low + convert_index(i)*m_multiplier; - } - - const Scalar m_low; - const Scalar m_multiplier; - const Scalar m_divisor; - const bool m_use_divisor; -}; - -// ----- Linspace functor ---------------------------------------------------------------- - -// Forward declaration (we default to random access which does not really give -// us a speed gain when using packet access but it allows to use the functor in -// nested expressions). -template struct linspaced_op; -template struct functor_traits< linspaced_op > -{ - enum - { - Cost = 1, - PacketAccess = (!NumTraits::IsInteger) && packet_traits::HasSetLinear && packet_traits::HasBlend, - /*&& ((!NumTraits::IsInteger) || packet_traits::HasDiv),*/ // <- vectorization for integer is currently disabled - IsRepeatable = true - }; -}; -template struct linspaced_op -{ - linspaced_op(const Scalar& low, const Scalar& high, Index num_steps) - : impl((num_steps==1 ? high : low),high,num_steps) - {} - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (IndexType i) const { return impl(i); } - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(IndexType i) const { return impl.packetOp(i); } - - // This proxy object handles the actual required temporaries and the different - // implementations (integer vs. floating point). - const linspaced_op_impl::IsInteger> impl; -}; - -// Linear access is automatically determined from the operator() prototypes available for the given functor. -// If it exposes an operator()(i,j), then we assume the i and j coefficients are required independently -// and linear access is not possible. In all other cases, linear access is enabled. -// Users should not have to deal with this structure. -template struct functor_has_linear_access { enum { ret = !has_binary_operator::value }; }; - -// For unreliable compilers, let's specialize the has_*ary_operator -// helpers so that at least built-in nullary functors work fine. -#if !( (EIGEN_COMP_MSVC>1600) || (EIGEN_GNUC_AT_LEAST(4,8)) || (EIGEN_COMP_ICC>=1600)) -template -struct has_nullary_operator,IndexType> { enum { value = 1}; }; -template -struct has_unary_operator,IndexType> { enum { value = 0}; }; -template -struct has_binary_operator,IndexType> { enum { value = 0}; }; - -template -struct has_nullary_operator,IndexType> { enum { value = 0}; }; -template -struct has_unary_operator,IndexType> { enum { value = 0}; }; -template -struct has_binary_operator,IndexType> { enum { value = 1}; }; - -template -struct has_nullary_operator,IndexType> { enum { value = 0}; }; -template -struct has_unary_operator,IndexType> { enum { value = 1}; }; -template -struct has_binary_operator,IndexType> { enum { value = 0}; }; - -template -struct has_nullary_operator,IndexType> { enum { value = 1}; }; -template -struct has_unary_operator,IndexType> { enum { value = 0}; }; -template -struct has_binary_operator,IndexType> { enum { value = 0}; }; -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_NULLARY_FUNCTORS_H diff --git a/Eigen/src/Core/functors/StlFunctors.h b/Eigen/src/Core/functors/StlFunctors.h deleted file mode 100644 index 6df3fa501..000000000 --- a/Eigen/src/Core/functors/StlFunctors.h +++ /dev/null @@ -1,132 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STL_FUNCTORS_H -#define EIGEN_STL_FUNCTORS_H - -namespace Eigen { - -namespace internal { - -// default functor traits for STL functors: - -template -struct functor_traits > -{ enum { Cost = NumTraits::MulCost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = NumTraits::MulCost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = NumTraits::AddCost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1, PacketAccess = false }; }; - -#if (__cplusplus < 201103L) && (EIGEN_COMP_MSVC <= 1900) -// std::binder* are deprecated since c++11 and will be removed in c++17 -template -struct functor_traits > -{ enum { Cost = functor_traits::Cost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = functor_traits::Cost, PacketAccess = false }; }; -#endif - -template -struct functor_traits > -{ enum { Cost = 1 + functor_traits::Cost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 1 + functor_traits::Cost, PacketAccess = false }; }; - -#ifdef EIGEN_STDEXT_SUPPORT - -template -struct functor_traits > -{ enum { Cost = 0, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = 0, PacketAccess = false }; }; - -template -struct functor_traits > > -{ enum { Cost = 0, PacketAccess = false }; }; - -template -struct functor_traits > > -{ enum { Cost = 0, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = functor_traits::Cost + functor_traits::Cost, PacketAccess = false }; }; - -template -struct functor_traits > -{ enum { Cost = functor_traits::Cost + functor_traits::Cost + functor_traits::Cost, PacketAccess = false }; }; - -#endif // EIGEN_STDEXT_SUPPORT - -// allow to add new functors and specializations of functor_traits from outside Eigen. -// this macro is really needed because functor_traits must be specialized after it is declared but before it is used... -#ifdef EIGEN_FUNCTORS_PLUGIN -#include EIGEN_FUNCTORS_PLUGIN -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_STL_FUNCTORS_H diff --git a/Eigen/src/Core/functors/TernaryFunctors.h b/Eigen/src/Core/functors/TernaryFunctors.h deleted file mode 100644 index b254e96c6..000000000 --- a/Eigen/src/Core/functors/TernaryFunctors.h +++ /dev/null @@ -1,25 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2016 Eugene Brevdo -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TERNARY_FUNCTORS_H -#define EIGEN_TERNARY_FUNCTORS_H - -namespace Eigen { - -namespace internal { - -//---------- associative ternary functors ---------- - - - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TERNARY_FUNCTORS_H diff --git a/Eigen/src/Core/functors/UnaryFunctors.h b/Eigen/src/Core/functors/UnaryFunctors.h deleted file mode 100644 index bfc046556..000000000 --- a/Eigen/src/Core/functors/UnaryFunctors.h +++ /dev/null @@ -1,830 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2016 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_UNARY_FUNCTORS_H -#define EIGEN_UNARY_FUNCTORS_H - -namespace Eigen { - -namespace internal { - -/** \internal - * \brief Template functor to compute the opposite of a scalar - * - * \sa class CwiseUnaryOp, MatrixBase::operator- - */ -template struct scalar_opposite_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_opposite_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return -a; } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const - { return internal::pnegate(a); } -}; -template -struct functor_traits > -{ enum { - Cost = NumTraits::AddCost, - PacketAccess = packet_traits::HasNegate }; -}; - -/** \internal - * \brief Template functor to compute the absolute value of a scalar - * - * \sa class CwiseUnaryOp, Cwise::abs - */ -template struct scalar_abs_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_abs_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a) const { return numext::abs(a); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const - { return internal::pabs(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::AddCost, - PacketAccess = packet_traits::HasAbs - }; -}; - -/** \internal - * \brief Template functor to compute the score of a scalar, to chose a pivot - * - * \sa class CwiseUnaryOp - */ -template struct scalar_score_coeff_op : scalar_abs_op -{ - typedef void Score_is_abs; -}; -template -struct functor_traits > : functor_traits > {}; - -/* Avoid recomputing abs when we know the score and they are the same. Not a true Eigen functor. */ -template struct abs_knowing_score -{ - EIGEN_EMPTY_STRUCT_CTOR(abs_knowing_score) - typedef typename NumTraits::Real result_type; - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a, const Score&) const { return numext::abs(a); } -}; -template struct abs_knowing_score::Score_is_abs> -{ - EIGEN_EMPTY_STRUCT_CTOR(abs_knowing_score) - typedef typename NumTraits::Real result_type; - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scal&, const result_type& a) const { return a; } -}; - -/** \internal - * \brief Template functor to compute the squared absolute value of a scalar - * - * \sa class CwiseUnaryOp, Cwise::abs2 - */ -template struct scalar_abs2_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_abs2_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a) const { return numext::abs2(a); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const - { return internal::pmul(a,a); } -}; -template -struct functor_traits > -{ enum { Cost = NumTraits::MulCost, PacketAccess = packet_traits::HasAbs2 }; }; - -/** \internal - * \brief Template functor to compute the conjugate of a complex value - * - * \sa class CwiseUnaryOp, MatrixBase::conjugate() - */ -template struct scalar_conjugate_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_conjugate_op) - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { using numext::conj; return conj(a); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const { return internal::pconj(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::IsComplex ? NumTraits::AddCost : 0, - PacketAccess = packet_traits::HasConj - }; -}; - -/** \internal - * \brief Template functor to compute the phase angle of a complex - * - * \sa class CwiseUnaryOp, Cwise::arg - */ -template struct scalar_arg_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_arg_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const result_type operator() (const Scalar& a) const { using numext::arg; return arg(a); } - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a) const - { return internal::parg(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::IsComplex ? 5 * NumTraits::MulCost : NumTraits::AddCost, - PacketAccess = packet_traits::HasArg - }; -}; -/** \internal - * \brief Template functor to cast a scalar to another type - * - * \sa class CwiseUnaryOp, MatrixBase::cast() - */ -template -struct scalar_cast_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cast_op) - typedef NewType result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const NewType operator() (const Scalar& a) const { return cast(a); } -}; -template -struct functor_traits > -{ enum { Cost = is_same::value ? 0 : NumTraits::AddCost, PacketAccess = false }; }; - -/** \internal - * \brief Template functor to extract the real part of a complex - * - * \sa class CwiseUnaryOp, MatrixBase::real() - */ -template -struct scalar_real_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_real_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { return numext::real(a); } -}; -template -struct functor_traits > -{ enum { Cost = 0, PacketAccess = false }; }; - -/** \internal - * \brief Template functor to extract the imaginary part of a complex - * - * \sa class CwiseUnaryOp, MatrixBase::imag() - */ -template -struct scalar_imag_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_imag_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { return numext::imag(a); } -}; -template -struct functor_traits > -{ enum { Cost = 0, PacketAccess = false }; }; - -/** \internal - * \brief Template functor to extract the real part of a complex as a reference - * - * \sa class CwiseUnaryOp, MatrixBase::real() - */ -template -struct scalar_real_ref_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_real_ref_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE result_type& operator() (const Scalar& a) const { return numext::real_ref(*const_cast(&a)); } -}; -template -struct functor_traits > -{ enum { Cost = 0, PacketAccess = false }; }; - -/** \internal - * \brief Template functor to extract the imaginary part of a complex as a reference - * - * \sa class CwiseUnaryOp, MatrixBase::imag() - */ -template -struct scalar_imag_ref_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_imag_ref_op) - typedef typename NumTraits::Real result_type; - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE result_type& operator() (const Scalar& a) const { return numext::imag_ref(*const_cast(&a)); } -}; -template -struct functor_traits > -{ enum { Cost = 0, PacketAccess = false }; }; - -/** \internal - * - * \brief Template functor to compute the exponential of a scalar - * - * \sa class CwiseUnaryOp, Cwise::exp() - */ -template struct scalar_exp_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_exp_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::exp(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pexp(a); } -}; -template -struct functor_traits > { - enum { - PacketAccess = packet_traits::HasExp, - // The following numbers are based on the AVX implementation. -#ifdef EIGEN_VECTORIZE_FMA - // Haswell can issue 2 add/mul/madd per cycle. - Cost = - (sizeof(Scalar) == 4 - // float: 8 pmadd, 4 pmul, 2 padd/psub, 6 other - ? (8 * NumTraits::AddCost + 6 * NumTraits::MulCost) - // double: 7 pmadd, 5 pmul, 3 padd/psub, 1 div, 13 other - : (14 * NumTraits::AddCost + - 6 * NumTraits::MulCost + - scalar_div_cost::HasDiv>::value)) -#else - Cost = - (sizeof(Scalar) == 4 - // float: 7 pmadd, 6 pmul, 4 padd/psub, 10 other - ? (21 * NumTraits::AddCost + 13 * NumTraits::MulCost) - // double: 7 pmadd, 5 pmul, 3 padd/psub, 1 div, 13 other - : (23 * NumTraits::AddCost + - 12 * NumTraits::MulCost + - scalar_div_cost::HasDiv>::value)) -#endif - }; -}; - -/** \internal - * - * \brief Template functor to compute the exponential of a scalar - 1. - * - * \sa class CwiseUnaryOp, ArrayBase::expm1() - */ -template struct scalar_expm1_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_expm1_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::expm1(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pexpm1(a); } -}; -template -struct functor_traits > { - enum { - PacketAccess = packet_traits::HasExpm1, - Cost = functor_traits >::Cost // TODO measure cost of expm1 - }; -}; - -/** \internal - * - * \brief Template functor to compute the logarithm of a scalar - * - * \sa class CwiseUnaryOp, ArrayBase::log() - */ -template struct scalar_log_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_log_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::log(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog(a); } -}; -template -struct functor_traits > { - enum { - PacketAccess = packet_traits::HasLog, - Cost = - (PacketAccess - // The following numbers are based on the AVX implementation. -#ifdef EIGEN_VECTORIZE_FMA - // 8 pmadd, 6 pmul, 8 padd/psub, 16 other, can issue 2 add/mul/madd per cycle. - ? (20 * NumTraits::AddCost + 7 * NumTraits::MulCost) -#else - // 8 pmadd, 6 pmul, 8 padd/psub, 20 other - ? (36 * NumTraits::AddCost + 14 * NumTraits::MulCost) -#endif - // Measured cost of std::log. - : sizeof(Scalar)==4 ? 40 : 85) - }; -}; - -/** \internal - * - * \brief Template functor to compute the logarithm of 1 plus a scalar value - * - * \sa class CwiseUnaryOp, ArrayBase::log1p() - */ -template struct scalar_log1p_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_log1p_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::log1p(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog1p(a); } -}; -template -struct functor_traits > { - enum { - PacketAccess = packet_traits::HasLog1p, - Cost = functor_traits >::Cost // TODO measure cost of log1p - }; -}; - -/** \internal - * - * \brief Template functor to compute the base-10 logarithm of a scalar - * - * \sa class CwiseUnaryOp, Cwise::log10() - */ -template struct scalar_log10_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_log10_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { EIGEN_USING_STD_MATH(log10) return log10(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::plog10(a); } -}; -template -struct functor_traits > -{ enum { Cost = 5 * NumTraits::MulCost, PacketAccess = packet_traits::HasLog10 }; }; - -/** \internal - * \brief Template functor to compute the square root of a scalar - * \sa class CwiseUnaryOp, Cwise::sqrt() - */ -template struct scalar_sqrt_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_sqrt_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::sqrt(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psqrt(a); } -}; -template -struct functor_traits > { - enum { -#if EIGEN_FAST_MATH - // The following numbers are based on the AVX implementation. - Cost = (sizeof(Scalar) == 8 ? 28 - // 4 pmul, 1 pmadd, 3 other - : (3 * NumTraits::AddCost + - 5 * NumTraits::MulCost)), -#else - // The following numbers are based on min VSQRT throughput on Haswell. - Cost = (sizeof(Scalar) == 8 ? 28 : 14), -#endif - PacketAccess = packet_traits::HasSqrt - }; -}; - -/** \internal - * \brief Template functor to compute the reciprocal square root of a scalar - * \sa class CwiseUnaryOp, Cwise::rsqrt() - */ -template struct scalar_rsqrt_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_rsqrt_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return Scalar(1)/numext::sqrt(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::prsqrt(a); } -}; - -template -struct functor_traits > -{ enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasRsqrt - }; -}; - -/** \internal - * \brief Template functor to compute the cosine of a scalar - * \sa class CwiseUnaryOp, ArrayBase::cos() - */ -template struct scalar_cos_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cos_op) - EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return numext::cos(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pcos(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasCos - }; -}; - -/** \internal - * \brief Template functor to compute the sine of a scalar - * \sa class CwiseUnaryOp, ArrayBase::sin() - */ -template struct scalar_sin_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_sin_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::sin(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psin(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasSin - }; -}; - - -/** \internal - * \brief Template functor to compute the tan of a scalar - * \sa class CwiseUnaryOp, ArrayBase::tan() - */ -template struct scalar_tan_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_tan_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::tan(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::ptan(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasTan - }; -}; - -/** \internal - * \brief Template functor to compute the arc cosine of a scalar - * \sa class CwiseUnaryOp, ArrayBase::acos() - */ -template struct scalar_acos_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_acos_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::acos(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pacos(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasACos - }; -}; - -/** \internal - * \brief Template functor to compute the arc sine of a scalar - * \sa class CwiseUnaryOp, ArrayBase::asin() - */ -template struct scalar_asin_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_asin_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::asin(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pasin(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasASin - }; -}; - - -/** \internal - * \brief Template functor to compute the atan of a scalar - * \sa class CwiseUnaryOp, ArrayBase::atan() - */ -template struct scalar_atan_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_atan_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::atan(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::patan(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasATan - }; -}; - -/** \internal - * \brief Template functor to compute the tanh of a scalar - * \sa class CwiseUnaryOp, ArrayBase::tanh() - */ -template -struct scalar_tanh_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_tanh_op) - EIGEN_DEVICE_FUNC inline const Scalar operator()(const Scalar& a) const { return numext::tanh(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& x) const { return ptanh(x); } -}; - -template -struct functor_traits > { - enum { - PacketAccess = packet_traits::HasTanh, - Cost = ( (EIGEN_FAST_MATH && is_same::value) -// The following numbers are based on the AVX implementation, -#ifdef EIGEN_VECTORIZE_FMA - // Haswell can issue 2 add/mul/madd per cycle. - // 9 pmadd, 2 pmul, 1 div, 2 other - ? (2 * NumTraits::AddCost + - 6 * NumTraits::MulCost + - scalar_div_cost::HasDiv>::value) -#else - ? (11 * NumTraits::AddCost + - 11 * NumTraits::MulCost + - scalar_div_cost::HasDiv>::value) -#endif - // This number assumes a naive implementation of tanh - : (6 * NumTraits::AddCost + - 3 * NumTraits::MulCost + - 2 * scalar_div_cost::HasDiv>::value + - functor_traits >::Cost)) - }; -}; - -/** \internal - * \brief Template functor to compute the sinh of a scalar - * \sa class CwiseUnaryOp, ArrayBase::sinh() - */ -template struct scalar_sinh_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_sinh_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::sinh(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psinh(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasSinh - }; -}; - -/** \internal - * \brief Template functor to compute the cosh of a scalar - * \sa class CwiseUnaryOp, ArrayBase::cosh() - */ -template struct scalar_cosh_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cosh_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const { return numext::cosh(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pcosh(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = 5 * NumTraits::MulCost, - PacketAccess = packet_traits::HasCosh - }; -}; - -/** \internal - * \brief Template functor to compute the inverse of a scalar - * \sa class CwiseUnaryOp, Cwise::inverse() - */ -template -struct scalar_inverse_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_inverse_op) - EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return Scalar(1)/a; } - template - EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const - { return internal::pdiv(pset1(Scalar(1)),a); } -}; -template -struct functor_traits > -{ enum { Cost = NumTraits::MulCost, PacketAccess = packet_traits::HasDiv }; }; - -/** \internal - * \brief Template functor to compute the square of a scalar - * \sa class CwiseUnaryOp, Cwise::square() - */ -template -struct scalar_square_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_square_op) - EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return a*a; } - template - EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const - { return internal::pmul(a,a); } -}; -template -struct functor_traits > -{ enum { Cost = NumTraits::MulCost, PacketAccess = packet_traits::HasMul }; }; - -/** \internal - * \brief Template functor to compute the cube of a scalar - * \sa class CwiseUnaryOp, Cwise::cube() - */ -template -struct scalar_cube_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_cube_op) - EIGEN_DEVICE_FUNC inline Scalar operator() (const Scalar& a) const { return a*a*a; } - template - EIGEN_DEVICE_FUNC inline const Packet packetOp(const Packet& a) const - { return internal::pmul(a,pmul(a,a)); } -}; -template -struct functor_traits > -{ enum { Cost = 2*NumTraits::MulCost, PacketAccess = packet_traits::HasMul }; }; - -/** \internal - * \brief Template functor to compute the rounded value of a scalar - * \sa class CwiseUnaryOp, ArrayBase::round() - */ -template struct scalar_round_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_round_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::round(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pround(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::MulCost, - PacketAccess = packet_traits::HasRound - }; -}; - -/** \internal - * \brief Template functor to compute the floor of a scalar - * \sa class CwiseUnaryOp, ArrayBase::floor() - */ -template struct scalar_floor_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_floor_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::floor(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pfloor(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::MulCost, - PacketAccess = packet_traits::HasFloor - }; -}; - -/** \internal - * \brief Template functor to compute the ceil of a scalar - * \sa class CwiseUnaryOp, ArrayBase::ceil() - */ -template struct scalar_ceil_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_ceil_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Scalar operator() (const Scalar& a) const { return numext::ceil(a); } - template - EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::pceil(a); } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::MulCost, - PacketAccess = packet_traits::HasCeil - }; -}; - -/** \internal - * \brief Template functor to compute whether a scalar is NaN - * \sa class CwiseUnaryOp, ArrayBase::isnan() - */ -template struct scalar_isnan_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_isnan_op) - typedef bool result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { -#if defined(__SYCL_DEVICE_ONLY__) - return numext::isnan(a); -#else - return (numext::isnan)(a); -#endif - } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::MulCost, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to check whether a scalar is +/-inf - * \sa class CwiseUnaryOp, ArrayBase::isinf() - */ -template struct scalar_isinf_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_isinf_op) - typedef bool result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { -#if defined(__SYCL_DEVICE_ONLY__) - return numext::isinf(a); -#else - return (numext::isinf)(a); -#endif - } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::MulCost, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to check whether a scalar has a finite value - * \sa class CwiseUnaryOp, ArrayBase::isfinite() - */ -template struct scalar_isfinite_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_isfinite_op) - typedef bool result_type; - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE result_type operator() (const Scalar& a) const { -#if defined(__SYCL_DEVICE_ONLY__) - return numext::isfinite(a); -#else - return (numext::isfinite)(a); -#endif - } -}; -template -struct functor_traits > -{ - enum { - Cost = NumTraits::MulCost, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to compute the logical not of a boolean - * - * \sa class CwiseUnaryOp, ArrayBase::operator! - */ -template struct scalar_boolean_not_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_boolean_not_op) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE bool operator() (const bool& a) const { return !a; } -}; -template -struct functor_traits > { - enum { - Cost = NumTraits::AddCost, - PacketAccess = false - }; -}; - -/** \internal - * \brief Template functor to compute the signum of a scalar - * \sa class CwiseUnaryOp, Cwise::sign() - */ -template::IsComplex!=0) > struct scalar_sign_op; -template -struct scalar_sign_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_sign_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const - { - return Scalar( (a>Scalar(0)) - (a - //EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psign(a); } -}; -template -struct scalar_sign_op { - EIGEN_EMPTY_STRUCT_CTOR(scalar_sign_op) - EIGEN_DEVICE_FUNC inline const Scalar operator() (const Scalar& a) const - { - typedef typename NumTraits::Real real_type; - real_type aa = numext::abs(a); - if (aa==real_type(0)) - return Scalar(0); - aa = real_type(1)/aa; - return Scalar(real(a)*aa, imag(a)*aa ); - } - //TODO - //template - //EIGEN_DEVICE_FUNC inline Packet packetOp(const Packet& a) const { return internal::psign(a); } -}; -template -struct functor_traits > -{ enum { - Cost = - NumTraits::IsComplex - ? ( 8*NumTraits::MulCost ) // roughly - : ( 3*NumTraits::AddCost), - PacketAccess = packet_traits::HasSign - }; -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_FUNCTORS_H diff --git a/Eigen/src/Core/products/GeneralBlockPanelKernel.h b/Eigen/src/Core/products/GeneralBlockPanelKernel.h deleted file mode 100644 index 45230bce5..000000000 --- a/Eigen/src/Core/products/GeneralBlockPanelKernel.h +++ /dev/null @@ -1,2149 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GENERAL_BLOCK_PANEL_H -#define EIGEN_GENERAL_BLOCK_PANEL_H - - -namespace Eigen { - -namespace internal { - -template -class gebp_traits; - - -/** \internal \returns b if a<=0, and returns a otherwise. */ -inline std::ptrdiff_t manage_caching_sizes_helper(std::ptrdiff_t a, std::ptrdiff_t b) -{ - return a<=0 ? b : a; -} - -#if EIGEN_ARCH_i386_OR_x86_64 -const std::ptrdiff_t defaultL1CacheSize = 32*1024; -const std::ptrdiff_t defaultL2CacheSize = 256*1024; -const std::ptrdiff_t defaultL3CacheSize = 2*1024*1024; -#else -const std::ptrdiff_t defaultL1CacheSize = 16*1024; -const std::ptrdiff_t defaultL2CacheSize = 512*1024; -const std::ptrdiff_t defaultL3CacheSize = 512*1024; -#endif - -/** \internal */ -struct CacheSizes { - CacheSizes(): m_l1(-1),m_l2(-1),m_l3(-1) { - int l1CacheSize, l2CacheSize, l3CacheSize; - queryCacheSizes(l1CacheSize, l2CacheSize, l3CacheSize); - m_l1 = manage_caching_sizes_helper(l1CacheSize, defaultL1CacheSize); - m_l2 = manage_caching_sizes_helper(l2CacheSize, defaultL2CacheSize); - m_l3 = manage_caching_sizes_helper(l3CacheSize, defaultL3CacheSize); - } - - std::ptrdiff_t m_l1; - std::ptrdiff_t m_l2; - std::ptrdiff_t m_l3; -}; - - -/** \internal */ -inline void manage_caching_sizes(Action action, std::ptrdiff_t* l1, std::ptrdiff_t* l2, std::ptrdiff_t* l3) -{ - static CacheSizes m_cacheSizes; - - if(action==SetAction) - { - // set the cpu cache size and cache all block sizes from a global cache size in byte - eigen_internal_assert(l1!=0 && l2!=0); - m_cacheSizes.m_l1 = *l1; - m_cacheSizes.m_l2 = *l2; - m_cacheSizes.m_l3 = *l3; - } - else if(action==GetAction) - { - eigen_internal_assert(l1!=0 && l2!=0); - *l1 = m_cacheSizes.m_l1; - *l2 = m_cacheSizes.m_l2; - *l3 = m_cacheSizes.m_l3; - } - else - { - eigen_internal_assert(false); - } -} - -/* Helper for computeProductBlockingSizes. - * - * Given a m x k times k x n matrix product of scalar types \c LhsScalar and \c RhsScalar, - * this function computes the blocking size parameters along the respective dimensions - * for matrix products and related algorithms. The blocking sizes depends on various - * parameters: - * - the L1 and L2 cache sizes, - * - the register level blocking sizes defined by gebp_traits, - * - the number of scalars that fit into a packet (when vectorization is enabled). - * - * \sa setCpuCacheSizes */ - -template -void evaluateProductBlockingSizesHeuristic(Index& k, Index& m, Index& n, Index num_threads = 1) -{ - typedef gebp_traits Traits; - - // Explanations: - // Let's recall that the product algorithms form mc x kc vertical panels A' on the lhs and - // kc x nc blocks B' on the rhs. B' has to fit into L2/L3 cache. Moreover, A' is processed - // per mr x kc horizontal small panels where mr is the blocking size along the m dimension - // at the register level. This small horizontal panel has to stay within L1 cache. - std::ptrdiff_t l1, l2, l3; - manage_caching_sizes(GetAction, &l1, &l2, &l3); - - if (num_threads > 1) { - typedef typename Traits::ResScalar ResScalar; - enum { - kdiv = KcFactor * (Traits::mr * sizeof(LhsScalar) + Traits::nr * sizeof(RhsScalar)), - ksub = Traits::mr * Traits::nr * sizeof(ResScalar), - kr = 8, - mr = Traits::mr, - nr = Traits::nr - }; - // Increasing k gives us more time to prefetch the content of the "C" - // registers. However once the latency is hidden there is no point in - // increasing the value of k, so we'll cap it at 320 (value determined - // experimentally). - const Index k_cache = (numext::mini)((l1-ksub)/kdiv, 320); - if (k_cache < k) { - k = k_cache - (k_cache % kr); - eigen_internal_assert(k > 0); - } - - const Index n_cache = (l2-l1) / (nr * sizeof(RhsScalar) * k); - const Index n_per_thread = numext::div_ceil(n, num_threads); - if (n_cache <= n_per_thread) { - // Don't exceed the capacity of the l2 cache. - eigen_internal_assert(n_cache >= static_cast(nr)); - n = n_cache - (n_cache % nr); - eigen_internal_assert(n > 0); - } else { - n = (numext::mini)(n, (n_per_thread + nr - 1) - ((n_per_thread + nr - 1) % nr)); - } - - if (l3 > l2) { - // l3 is shared between all cores, so we'll give each thread its own chunk of l3. - const Index m_cache = (l3-l2) / (sizeof(LhsScalar) * k * num_threads); - const Index m_per_thread = numext::div_ceil(m, num_threads); - if(m_cache < m_per_thread && m_cache >= static_cast(mr)) { - m = m_cache - (m_cache % mr); - eigen_internal_assert(m > 0); - } else { - m = (numext::mini)(m, (m_per_thread + mr - 1) - ((m_per_thread + mr - 1) % mr)); - } - } - } - else { - // In unit tests we do not want to use extra large matrices, - // so we reduce the cache size to check the blocking strategy is not flawed -#ifdef EIGEN_DEBUG_SMALL_PRODUCT_BLOCKS - l1 = 9*1024; - l2 = 32*1024; - l3 = 512*1024; -#endif - - // Early return for small problems because the computation below are time consuming for small problems. - // Perhaps it would make more sense to consider k*n*m?? - // Note that for very tiny problem, this function should be bypassed anyway - // because we use the coefficient-based implementation for them. - if((numext::maxi)(k,(numext::maxi)(m,n))<48) - return; - - typedef typename Traits::ResScalar ResScalar; - enum { - k_peeling = 8, - k_div = KcFactor * (Traits::mr * sizeof(LhsScalar) + Traits::nr * sizeof(RhsScalar)), - k_sub = Traits::mr * Traits::nr * sizeof(ResScalar) - }; - - // ---- 1st level of blocking on L1, yields kc ---- - - // Blocking on the third dimension (i.e., k) is chosen so that an horizontal panel - // of size mr x kc of the lhs plus a vertical panel of kc x nr of the rhs both fits within L1 cache. - // We also include a register-level block of the result (mx x nr). - // (In an ideal world only the lhs panel would stay in L1) - // Moreover, kc has to be a multiple of 8 to be compatible with loop peeling, leading to a maximum blocking size of: - const Index max_kc = numext::maxi(((l1-k_sub)/k_div) & (~(k_peeling-1)),1); - const Index old_k = k; - if(k>max_kc) - { - // We are really blocking on the third dimension: - // -> reduce blocking size to make sure the last block is as large as possible - // while keeping the same number of sweeps over the result. - k = (k%max_kc)==0 ? max_kc - : max_kc - k_peeling * ((max_kc-1-(k%max_kc))/(k_peeling*(k/max_kc+1))); - - eigen_internal_assert(((old_k/k) == (old_k/max_kc)) && "the number of sweeps has to remain the same"); - } - - // ---- 2nd level of blocking on max(L2,L3), yields nc ---- - - // TODO find a reliable way to get the actual amount of cache per core to use for 2nd level blocking, that is: - // actual_l2 = max(l2, l3/nb_core_sharing_l3) - // The number below is quite conservative: it is better to underestimate the cache size rather than overestimating it) - // For instance, it corresponds to 6MB of L3 shared among 4 cores. - #ifdef EIGEN_DEBUG_SMALL_PRODUCT_BLOCKS - const Index actual_l2 = l3; - #else - const Index actual_l2 = 1572864; // == 1.5 MB - #endif - - // Here, nc is chosen such that a block of kc x nc of the rhs fit within half of L2. - // The second half is implicitly reserved to access the result and lhs coefficients. - // When k= Index(Traits::nr*sizeof(RhsScalar))*k) - { - // L1 blocking - max_nc = remaining_l1 / (k*sizeof(RhsScalar)); - } - else - { - // L2 blocking - max_nc = (3*actual_l2)/(2*2*max_kc*sizeof(RhsScalar)); - } - // WARNING Below, we assume that Traits::nr is a power of two. - Index nc = numext::mini(actual_l2/(2*k*sizeof(RhsScalar)), max_nc) & (~(Traits::nr-1)); - if(n>nc) - { - // We are really blocking over the columns: - // -> reduce blocking size to make sure the last block is as large as possible - // while keeping the same number of sweeps over the packed lhs. - // Here we allow one more sweep if this gives us a perfect match, thus the commented "-1" - n = (n%nc)==0 ? nc - : (nc - Traits::nr * ((nc/*-1*/-(n%nc))/(Traits::nr*(n/nc+1)))); - } - else if(old_k==k) - { - // So far, no blocking at all, i.e., kc==k, and nc==n. - // In this case, let's perform a blocking over the rows such that the packed lhs data is kept in cache L1/L2 - // TODO: part of this blocking strategy is now implemented within the kernel itself, so the L1-based heuristic here should be obsolete. - Index problem_size = k*n*sizeof(LhsScalar); - Index actual_lm = actual_l2; - Index max_mc = m; - if(problem_size<=1024) - { - // problem is small enough to keep in L1 - // Let's choose m such that lhs's block fit in 1/3 of L1 - actual_lm = l1; - } - else if(l3!=0 && problem_size<=32768) - { - // we have both L2 and L3, and problem is small enough to be kept in L2 - // Let's choose m such that lhs's block fit in 1/3 of L2 - actual_lm = l2; - max_mc = (numext::mini)(576,max_mc); - } - Index mc = (numext::mini)(actual_lm/(3*k*sizeof(LhsScalar)), max_mc); - if (mc > Traits::mr) mc -= mc % Traits::mr; - else if (mc==0) return; - m = (m%mc)==0 ? mc - : (mc - Traits::mr * ((mc/*-1*/-(m%mc))/(Traits::mr*(m/mc+1)))); - } - } -} - -template -inline bool useSpecificBlockingSizes(Index& k, Index& m, Index& n) -{ -#ifdef EIGEN_TEST_SPECIFIC_BLOCKING_SIZES - if (EIGEN_TEST_SPECIFIC_BLOCKING_SIZES) { - k = numext::mini(k, EIGEN_TEST_SPECIFIC_BLOCKING_SIZE_K); - m = numext::mini(m, EIGEN_TEST_SPECIFIC_BLOCKING_SIZE_M); - n = numext::mini(n, EIGEN_TEST_SPECIFIC_BLOCKING_SIZE_N); - return true; - } -#else - EIGEN_UNUSED_VARIABLE(k) - EIGEN_UNUSED_VARIABLE(m) - EIGEN_UNUSED_VARIABLE(n) -#endif - return false; -} - -/** \brief Computes the blocking parameters for a m x k times k x n matrix product - * - * \param[in,out] k Input: the third dimension of the product. Output: the blocking size along the same dimension. - * \param[in,out] m Input: the number of rows of the left hand side. Output: the blocking size along the same dimension. - * \param[in,out] n Input: the number of columns of the right hand side. Output: the blocking size along the same dimension. - * - * Given a m x k times k x n matrix product of scalar types \c LhsScalar and \c RhsScalar, - * this function computes the blocking size parameters along the respective dimensions - * for matrix products and related algorithms. - * - * The blocking size parameters may be evaluated: - * - either by a heuristic based on cache sizes; - * - or using fixed prescribed values (for testing purposes). - * - * \sa setCpuCacheSizes */ - -template -void computeProductBlockingSizes(Index& k, Index& m, Index& n, Index num_threads = 1) -{ - if (!useSpecificBlockingSizes(k, m, n)) { - evaluateProductBlockingSizesHeuristic(k, m, n, num_threads); - } -} - -template -inline void computeProductBlockingSizes(Index& k, Index& m, Index& n, Index num_threads = 1) -{ - computeProductBlockingSizes(k, m, n, num_threads); -} - -#ifdef EIGEN_HAS_SINGLE_INSTRUCTION_CJMADD - #define CJMADD(CJ,A,B,C,T) C = CJ.pmadd(A,B,C); -#else - - // FIXME (a bit overkill maybe ?) - - template struct gebp_madd_selector { - EIGEN_ALWAYS_INLINE static void run(const CJ& cj, A& a, B& b, C& c, T& /*t*/) - { - c = cj.pmadd(a,b,c); - } - }; - - template struct gebp_madd_selector { - EIGEN_ALWAYS_INLINE static void run(const CJ& cj, T& a, T& b, T& c, T& t) - { - t = b; t = cj.pmul(a,t); c = padd(c,t); - } - }; - - template - EIGEN_STRONG_INLINE void gebp_madd(const CJ& cj, A& a, B& b, C& c, T& t) - { - gebp_madd_selector::run(cj,a,b,c,t); - } - - #define CJMADD(CJ,A,B,C,T) gebp_madd(CJ,A,B,C,T); -// #define CJMADD(CJ,A,B,C,T) T = B; T = CJ.pmul(A,T); C = padd(C,T); -#endif - -/* Vectorization logic - * real*real: unpack rhs to constant packets, ... - * - * cd*cd : unpack rhs to (b_r,b_r), (b_i,b_i), mul to get (a_r b_r,a_i b_r) (a_r b_i,a_i b_i), - * storing each res packet into two packets (2x2), - * at the end combine them: swap the second and addsub them - * cf*cf : same but with 2x4 blocks - * cplx*real : unpack rhs to constant packets, ... - * real*cplx : load lhs as (a0,a0,a1,a1), and mul as usual - */ -template -class gebp_traits -{ -public: - typedef _LhsScalar LhsScalar; - typedef _RhsScalar RhsScalar; - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - - enum { - ConjLhs = _ConjLhs, - ConjRhs = _ConjRhs, - Vectorizable = packet_traits::Vectorizable && packet_traits::Vectorizable, - LhsPacketSize = Vectorizable ? packet_traits::size : 1, - RhsPacketSize = Vectorizable ? packet_traits::size : 1, - ResPacketSize = Vectorizable ? packet_traits::size : 1, - - NumberOfRegisters = EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS, - - // register block size along the N direction must be 1 or 4 - nr = 4, - - // register block size along the M direction (currently, this one cannot be modified) - default_mr = (EIGEN_PLAIN_ENUM_MIN(16,NumberOfRegisters)/2/nr)*LhsPacketSize, -#if defined(EIGEN_HAS_SINGLE_INSTRUCTION_MADD) && !defined(EIGEN_VECTORIZE_ALTIVEC) && !defined(EIGEN_VECTORIZE_VSX) - // we assume 16 registers - // See bug 992, if the scalar type is not vectorizable but that EIGEN_HAS_SINGLE_INSTRUCTION_MADD is defined, - // then using 3*LhsPacketSize triggers non-implemented paths in syrk. - mr = Vectorizable ? 3*LhsPacketSize : default_mr, -#else - mr = default_mr, -#endif - - LhsProgress = LhsPacketSize, - RhsProgress = 1 - }; - - typedef typename packet_traits::type _LhsPacket; - typedef typename packet_traits::type _RhsPacket; - typedef typename packet_traits::type _ResPacket; - - typedef typename conditional::type LhsPacket; - typedef typename conditional::type RhsPacket; - typedef typename conditional::type ResPacket; - - typedef ResPacket AccPacket; - - EIGEN_STRONG_INLINE void initAcc(AccPacket& p) - { - p = pset1(ResScalar(0)); - } - - EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) - { - pbroadcast4(b, b0, b1, b2, b3); - } - -// EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1) -// { -// pbroadcast2(b, b0, b1); -// } - - template - EIGEN_STRONG_INLINE void loadRhs(const RhsScalar* b, RhsPacketType& dest) const - { - dest = pset1(*b); - } - - EIGEN_STRONG_INLINE void loadRhsQuad(const RhsScalar* b, RhsPacket& dest) const - { - dest = ploadquad(b); - } - - template - EIGEN_STRONG_INLINE void loadLhs(const LhsScalar* a, LhsPacketType& dest) const - { - dest = pload(a); - } - - template - EIGEN_STRONG_INLINE void loadLhsUnaligned(const LhsScalar* a, LhsPacketType& dest) const - { - dest = ploadu(a); - } - - template - EIGEN_STRONG_INLINE void madd(const LhsPacketType& a, const RhsPacketType& b, AccPacketType& c, AccPacketType& tmp) const - { - conj_helper cj; - // It would be a lot cleaner to call pmadd all the time. Unfortunately if we - // let gcc allocate the register in which to store the result of the pmul - // (in the case where there is no FMA) gcc fails to figure out how to avoid - // spilling register. -#ifdef EIGEN_HAS_SINGLE_INSTRUCTION_MADD - EIGEN_UNUSED_VARIABLE(tmp); - c = cj.pmadd(a,b,c); -#else - tmp = b; tmp = cj.pmul(a,tmp); c = padd(c,tmp); -#endif - } - - EIGEN_STRONG_INLINE void acc(const AccPacket& c, const ResPacket& alpha, ResPacket& r) const - { - r = pmadd(c,alpha,r); - } - - template - EIGEN_STRONG_INLINE void acc(const ResPacketHalf& c, const ResPacketHalf& alpha, ResPacketHalf& r) const - { - r = pmadd(c,alpha,r); - } - -}; - -template -class gebp_traits, RealScalar, _ConjLhs, false> -{ -public: - typedef std::complex LhsScalar; - typedef RealScalar RhsScalar; - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - - enum { - ConjLhs = _ConjLhs, - ConjRhs = false, - Vectorizable = packet_traits::Vectorizable && packet_traits::Vectorizable, - LhsPacketSize = Vectorizable ? packet_traits::size : 1, - RhsPacketSize = Vectorizable ? packet_traits::size : 1, - ResPacketSize = Vectorizable ? packet_traits::size : 1, - - NumberOfRegisters = EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS, - nr = 4, -#if defined(EIGEN_HAS_SINGLE_INSTRUCTION_MADD) && !defined(EIGEN_VECTORIZE_ALTIVEC) && !defined(EIGEN_VECTORIZE_VSX) - // we assume 16 registers - mr = 3*LhsPacketSize, -#else - mr = (EIGEN_PLAIN_ENUM_MIN(16,NumberOfRegisters)/2/nr)*LhsPacketSize, -#endif - - LhsProgress = LhsPacketSize, - RhsProgress = 1 - }; - - typedef typename packet_traits::type _LhsPacket; - typedef typename packet_traits::type _RhsPacket; - typedef typename packet_traits::type _ResPacket; - - typedef typename conditional::type LhsPacket; - typedef typename conditional::type RhsPacket; - typedef typename conditional::type ResPacket; - - typedef ResPacket AccPacket; - - EIGEN_STRONG_INLINE void initAcc(AccPacket& p) - { - p = pset1(ResScalar(0)); - } - - EIGEN_STRONG_INLINE void loadRhs(const RhsScalar* b, RhsPacket& dest) const - { - dest = pset1(*b); - } - - EIGEN_STRONG_INLINE void loadRhsQuad(const RhsScalar* b, RhsPacket& dest) const - { - dest = pset1(*b); - } - - EIGEN_STRONG_INLINE void loadLhs(const LhsScalar* a, LhsPacket& dest) const - { - dest = pload(a); - } - - EIGEN_STRONG_INLINE void loadLhsUnaligned(const LhsScalar* a, LhsPacket& dest) const - { - dest = ploadu(a); - } - - EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) - { - pbroadcast4(b, b0, b1, b2, b3); - } - -// EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1) -// { -// pbroadcast2(b, b0, b1); -// } - - EIGEN_STRONG_INLINE void madd(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp) const - { - madd_impl(a, b, c, tmp, typename conditional::type()); - } - - EIGEN_STRONG_INLINE void madd_impl(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp, const true_type&) const - { -#ifdef EIGEN_HAS_SINGLE_INSTRUCTION_MADD - EIGEN_UNUSED_VARIABLE(tmp); - c.v = pmadd(a.v,b,c.v); -#else - tmp = b; tmp = pmul(a.v,tmp); c.v = padd(c.v,tmp); -#endif - } - - EIGEN_STRONG_INLINE void madd_impl(const LhsScalar& a, const RhsScalar& b, ResScalar& c, RhsScalar& /*tmp*/, const false_type&) const - { - c += a * b; - } - - EIGEN_STRONG_INLINE void acc(const AccPacket& c, const ResPacket& alpha, ResPacket& r) const - { - r = cj.pmadd(c,alpha,r); - } - -protected: - conj_helper cj; -}; - -template -struct DoublePacket -{ - Packet first; - Packet second; -}; - -template -DoublePacket padd(const DoublePacket &a, const DoublePacket &b) -{ - DoublePacket res; - res.first = padd(a.first, b.first); - res.second = padd(a.second,b.second); - return res; -} - -template -const DoublePacket& predux_downto4(const DoublePacket &a) -{ - return a; -} - -template struct unpacket_traits > { typedef DoublePacket half; }; -// template -// DoublePacket pmadd(const DoublePacket &a, const DoublePacket &b) -// { -// DoublePacket res; -// res.first = padd(a.first, b.first); -// res.second = padd(a.second,b.second); -// return res; -// } - -template -class gebp_traits, std::complex, _ConjLhs, _ConjRhs > -{ -public: - typedef std::complex Scalar; - typedef std::complex LhsScalar; - typedef std::complex RhsScalar; - typedef std::complex ResScalar; - - enum { - ConjLhs = _ConjLhs, - ConjRhs = _ConjRhs, - Vectorizable = packet_traits::Vectorizable - && packet_traits::Vectorizable, - RealPacketSize = Vectorizable ? packet_traits::size : 1, - ResPacketSize = Vectorizable ? packet_traits::size : 1, - LhsPacketSize = Vectorizable ? packet_traits::size : 1, - RhsPacketSize = Vectorizable ? packet_traits::size : 1, - - // FIXME: should depend on NumberOfRegisters - nr = 4, - mr = ResPacketSize, - - LhsProgress = ResPacketSize, - RhsProgress = 1 - }; - - typedef typename packet_traits::type RealPacket; - typedef typename packet_traits::type ScalarPacket; - typedef DoublePacket DoublePacketType; - - typedef typename conditional::type LhsPacket; - typedef typename conditional::type RhsPacket; - typedef typename conditional::type ResPacket; - typedef typename conditional::type AccPacket; - - EIGEN_STRONG_INLINE void initAcc(Scalar& p) { p = Scalar(0); } - - EIGEN_STRONG_INLINE void initAcc(DoublePacketType& p) - { - p.first = pset1(RealScalar(0)); - p.second = pset1(RealScalar(0)); - } - - // Scalar path - EIGEN_STRONG_INLINE void loadRhs(const RhsScalar* b, ResPacket& dest) const - { - dest = pset1(*b); - } - - // Vectorized path - EIGEN_STRONG_INLINE void loadRhs(const RhsScalar* b, DoublePacketType& dest) const - { - dest.first = pset1(real(*b)); - dest.second = pset1(imag(*b)); - } - - EIGEN_STRONG_INLINE void loadRhsQuad(const RhsScalar* b, ResPacket& dest) const - { - loadRhs(b,dest); - } - EIGEN_STRONG_INLINE void loadRhsQuad(const RhsScalar* b, DoublePacketType& dest) const - { - eigen_internal_assert(unpacket_traits::size<=4); - loadRhs(b,dest); - } - - EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) - { - // FIXME not sure that's the best way to implement it! - loadRhs(b+0, b0); - loadRhs(b+1, b1); - loadRhs(b+2, b2); - loadRhs(b+3, b3); - } - - // Vectorized path - EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, DoublePacketType& b0, DoublePacketType& b1) - { - // FIXME not sure that's the best way to implement it! - loadRhs(b+0, b0); - loadRhs(b+1, b1); - } - - // Scalar path - EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsScalar& b0, RhsScalar& b1) - { - // FIXME not sure that's the best way to implement it! - loadRhs(b+0, b0); - loadRhs(b+1, b1); - } - - // nothing special here - EIGEN_STRONG_INLINE void loadLhs(const LhsScalar* a, LhsPacket& dest) const - { - dest = pload((const typename unpacket_traits::type*)(a)); - } - - EIGEN_STRONG_INLINE void loadLhsUnaligned(const LhsScalar* a, LhsPacket& dest) const - { - dest = ploadu((const typename unpacket_traits::type*)(a)); - } - - EIGEN_STRONG_INLINE void madd(const LhsPacket& a, const RhsPacket& b, DoublePacketType& c, RhsPacket& /*tmp*/) const - { - c.first = padd(pmul(a,b.first), c.first); - c.second = padd(pmul(a,b.second),c.second); - } - - EIGEN_STRONG_INLINE void madd(const LhsPacket& a, const RhsPacket& b, ResPacket& c, RhsPacket& /*tmp*/) const - { - c = cj.pmadd(a,b,c); - } - - EIGEN_STRONG_INLINE void acc(const Scalar& c, const Scalar& alpha, Scalar& r) const { r += alpha * c; } - - EIGEN_STRONG_INLINE void acc(const DoublePacketType& c, const ResPacket& alpha, ResPacket& r) const - { - // assemble c - ResPacket tmp; - if((!ConjLhs)&&(!ConjRhs)) - { - tmp = pcplxflip(pconj(ResPacket(c.second))); - tmp = padd(ResPacket(c.first),tmp); - } - else if((!ConjLhs)&&(ConjRhs)) - { - tmp = pconj(pcplxflip(ResPacket(c.second))); - tmp = padd(ResPacket(c.first),tmp); - } - else if((ConjLhs)&&(!ConjRhs)) - { - tmp = pcplxflip(ResPacket(c.second)); - tmp = padd(pconj(ResPacket(c.first)),tmp); - } - else if((ConjLhs)&&(ConjRhs)) - { - tmp = pcplxflip(ResPacket(c.second)); - tmp = psub(pconj(ResPacket(c.first)),tmp); - } - - r = pmadd(tmp,alpha,r); - } - -protected: - conj_helper cj; -}; - -template -class gebp_traits, false, _ConjRhs > -{ -public: - typedef std::complex Scalar; - typedef RealScalar LhsScalar; - typedef Scalar RhsScalar; - typedef Scalar ResScalar; - - enum { - ConjLhs = false, - ConjRhs = _ConjRhs, - Vectorizable = packet_traits::Vectorizable - && packet_traits::Vectorizable, - LhsPacketSize = Vectorizable ? packet_traits::size : 1, - RhsPacketSize = Vectorizable ? packet_traits::size : 1, - ResPacketSize = Vectorizable ? packet_traits::size : 1, - - NumberOfRegisters = EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS, - // FIXME: should depend on NumberOfRegisters - nr = 4, - mr = (EIGEN_PLAIN_ENUM_MIN(16,NumberOfRegisters)/2/nr)*ResPacketSize, - - LhsProgress = ResPacketSize, - RhsProgress = 1 - }; - - typedef typename packet_traits::type _LhsPacket; - typedef typename packet_traits::type _RhsPacket; - typedef typename packet_traits::type _ResPacket; - - typedef typename conditional::type LhsPacket; - typedef typename conditional::type RhsPacket; - typedef typename conditional::type ResPacket; - - typedef ResPacket AccPacket; - - EIGEN_STRONG_INLINE void initAcc(AccPacket& p) - { - p = pset1(ResScalar(0)); - } - - EIGEN_STRONG_INLINE void loadRhs(const RhsScalar* b, RhsPacket& dest) const - { - dest = pset1(*b); - } - - void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) - { - pbroadcast4(b, b0, b1, b2, b3); - } - -// EIGEN_STRONG_INLINE void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1) -// { -// // FIXME not sure that's the best way to implement it! -// b0 = pload1(b+0); -// b1 = pload1(b+1); -// } - - EIGEN_STRONG_INLINE void loadLhs(const LhsScalar* a, LhsPacket& dest) const - { - dest = ploaddup(a); - } - - EIGEN_STRONG_INLINE void loadRhsQuad(const RhsScalar* b, RhsPacket& dest) const - { - eigen_internal_assert(unpacket_traits::size<=4); - loadRhs(b,dest); - } - - EIGEN_STRONG_INLINE void loadLhsUnaligned(const LhsScalar* a, LhsPacket& dest) const - { - dest = ploaddup(a); - } - - EIGEN_STRONG_INLINE void madd(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp) const - { - madd_impl(a, b, c, tmp, typename conditional::type()); - } - - EIGEN_STRONG_INLINE void madd_impl(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp, const true_type&) const - { -#ifdef EIGEN_HAS_SINGLE_INSTRUCTION_MADD - EIGEN_UNUSED_VARIABLE(tmp); - c.v = pmadd(a,b.v,c.v); -#else - tmp = b; tmp.v = pmul(a,tmp.v); c = padd(c,tmp); -#endif - - } - - EIGEN_STRONG_INLINE void madd_impl(const LhsScalar& a, const RhsScalar& b, ResScalar& c, RhsScalar& /*tmp*/, const false_type&) const - { - c += a * b; - } - - EIGEN_STRONG_INLINE void acc(const AccPacket& c, const ResPacket& alpha, ResPacket& r) const - { - r = cj.pmadd(alpha,c,r); - } - -protected: - conj_helper cj; -}; - -/* optimized GEneral packed Block * packed Panel product kernel - * - * Mixing type logic: C += A * B - * | A | B | comments - * |real |cplx | no vectorization yet, would require to pack A with duplication - * |cplx |real | easy vectorization - */ -template -struct gebp_kernel -{ - typedef gebp_traits Traits; - typedef typename Traits::ResScalar ResScalar; - typedef typename Traits::LhsPacket LhsPacket; - typedef typename Traits::RhsPacket RhsPacket; - typedef typename Traits::ResPacket ResPacket; - typedef typename Traits::AccPacket AccPacket; - - typedef gebp_traits SwappedTraits; - typedef typename SwappedTraits::ResScalar SResScalar; - typedef typename SwappedTraits::LhsPacket SLhsPacket; - typedef typename SwappedTraits::RhsPacket SRhsPacket; - typedef typename SwappedTraits::ResPacket SResPacket; - typedef typename SwappedTraits::AccPacket SAccPacket; - - typedef typename DataMapper::LinearMapper LinearMapper; - - enum { - Vectorizable = Traits::Vectorizable, - LhsProgress = Traits::LhsProgress, - RhsProgress = Traits::RhsProgress, - ResPacketSize = Traits::ResPacketSize - }; - - EIGEN_DONT_INLINE - void operator()(const DataMapper& res, const LhsScalar* blockA, const RhsScalar* blockB, - Index rows, Index depth, Index cols, ResScalar alpha, - Index strideA=-1, Index strideB=-1, Index offsetA=0, Index offsetB=0); -}; - -template -EIGEN_DONT_INLINE -void gebp_kernel - ::operator()(const DataMapper& res, const LhsScalar* blockA, const RhsScalar* blockB, - Index rows, Index depth, Index cols, ResScalar alpha, - Index strideA, Index strideB, Index offsetA, Index offsetB) - { - Traits traits; - SwappedTraits straits; - - if(strideA==-1) strideA = depth; - if(strideB==-1) strideB = depth; - conj_helper cj; - Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; - const Index peeled_mc3 = mr>=3*Traits::LhsProgress ? (rows/(3*LhsProgress))*(3*LhsProgress) : 0; - const Index peeled_mc2 = mr>=2*Traits::LhsProgress ? peeled_mc3+((rows-peeled_mc3)/(2*LhsProgress))*(2*LhsProgress) : 0; - const Index peeled_mc1 = mr>=1*Traits::LhsProgress ? (rows/(1*LhsProgress))*(1*LhsProgress) : 0; - enum { pk = 8 }; // NOTE Such a large peeling factor is important for large matrices (~ +5% when >1000 on Haswell) - const Index peeled_kc = depth & ~(pk-1); - const Index prefetch_res_offset = 32/sizeof(ResScalar); -// const Index depth2 = depth & ~1; - - //---------- Process 3 * LhsProgress rows at once ---------- - // This corresponds to 3*LhsProgress x nr register blocks. - // Usually, make sense only with FMA - if(mr>=3*Traits::LhsProgress) - { - // Here, the general idea is to loop on each largest micro horizontal panel of the lhs (3*Traits::LhsProgress x depth) - // and on each largest micro vertical panel of the rhs (depth * nr). - // Blocking sizes, i.e., 'depth' has been computed so that the micro horizontal panel of the lhs fit in L1. - // However, if depth is too small, we can extend the number of rows of these horizontal panels. - // This actual number of rows is computed as follow: - const Index l1 = defaultL1CacheSize; // in Bytes, TODO, l1 should be passed to this function. - // The max(1, ...) here is needed because we may be using blocking params larger than what our known l1 cache size - // suggests we should be using: either because our known l1 cache size is inaccurate (e.g. on Android, we can only guess), - // or because we are testing specific blocking sizes. - const Index actual_panel_rows = (3*LhsProgress) * std::max(1,( (l1 - sizeof(ResScalar)*mr*nr - depth*nr*sizeof(RhsScalar)) / (depth * sizeof(LhsScalar) * 3*LhsProgress) )); - for(Index i1=0; i1(alpha); - - R0 = r0.loadPacket(0 * Traits::ResPacketSize); - R1 = r0.loadPacket(1 * Traits::ResPacketSize); - R2 = r0.loadPacket(2 * Traits::ResPacketSize); - traits.acc(C0, alphav, R0); - traits.acc(C4, alphav, R1); - traits.acc(C8, alphav, R2); - r0.storePacket(0 * Traits::ResPacketSize, R0); - r0.storePacket(1 * Traits::ResPacketSize, R1); - r0.storePacket(2 * Traits::ResPacketSize, R2); - - R0 = r1.loadPacket(0 * Traits::ResPacketSize); - R1 = r1.loadPacket(1 * Traits::ResPacketSize); - R2 = r1.loadPacket(2 * Traits::ResPacketSize); - traits.acc(C1, alphav, R0); - traits.acc(C5, alphav, R1); - traits.acc(C9, alphav, R2); - r1.storePacket(0 * Traits::ResPacketSize, R0); - r1.storePacket(1 * Traits::ResPacketSize, R1); - r1.storePacket(2 * Traits::ResPacketSize, R2); - - R0 = r2.loadPacket(0 * Traits::ResPacketSize); - R1 = r2.loadPacket(1 * Traits::ResPacketSize); - R2 = r2.loadPacket(2 * Traits::ResPacketSize); - traits.acc(C2, alphav, R0); - traits.acc(C6, alphav, R1); - traits.acc(C10, alphav, R2); - r2.storePacket(0 * Traits::ResPacketSize, R0); - r2.storePacket(1 * Traits::ResPacketSize, R1); - r2.storePacket(2 * Traits::ResPacketSize, R2); - - R0 = r3.loadPacket(0 * Traits::ResPacketSize); - R1 = r3.loadPacket(1 * Traits::ResPacketSize); - R2 = r3.loadPacket(2 * Traits::ResPacketSize); - traits.acc(C3, alphav, R0); - traits.acc(C7, alphav, R1); - traits.acc(C11, alphav, R2); - r3.storePacket(0 * Traits::ResPacketSize, R0); - r3.storePacket(1 * Traits::ResPacketSize, R1); - r3.storePacket(2 * Traits::ResPacketSize, R2); - } - } - - // Deal with remaining columns of the rhs - for(Index j2=packet_cols4; j2(alpha); - - R0 = r0.loadPacket(0 * Traits::ResPacketSize); - R1 = r0.loadPacket(1 * Traits::ResPacketSize); - R2 = r0.loadPacket(2 * Traits::ResPacketSize); - traits.acc(C0, alphav, R0); - traits.acc(C4, alphav, R1); - traits.acc(C8, alphav, R2); - r0.storePacket(0 * Traits::ResPacketSize, R0); - r0.storePacket(1 * Traits::ResPacketSize, R1); - r0.storePacket(2 * Traits::ResPacketSize, R2); - } - } - } - } - - //---------- Process 2 * LhsProgress rows at once ---------- - if(mr>=2*Traits::LhsProgress) - { - const Index l1 = defaultL1CacheSize; // in Bytes, TODO, l1 should be passed to this function. - // The max(1, ...) here is needed because we may be using blocking params larger than what our known l1 cache size - // suggests we should be using: either because our known l1 cache size is inaccurate (e.g. on Android, we can only guess), - // or because we are testing specific blocking sizes. - Index actual_panel_rows = (2*LhsProgress) * std::max(1,( (l1 - sizeof(ResScalar)*mr*nr - depth*nr*sizeof(RhsScalar)) / (depth * sizeof(LhsScalar) * 2*LhsProgress) )); - - for(Index i1=peeled_mc3; i1(alpha); - - R0 = r0.loadPacket(0 * Traits::ResPacketSize); - R1 = r0.loadPacket(1 * Traits::ResPacketSize); - R2 = r1.loadPacket(0 * Traits::ResPacketSize); - R3 = r1.loadPacket(1 * Traits::ResPacketSize); - traits.acc(C0, alphav, R0); - traits.acc(C4, alphav, R1); - traits.acc(C1, alphav, R2); - traits.acc(C5, alphav, R3); - r0.storePacket(0 * Traits::ResPacketSize, R0); - r0.storePacket(1 * Traits::ResPacketSize, R1); - r1.storePacket(0 * Traits::ResPacketSize, R2); - r1.storePacket(1 * Traits::ResPacketSize, R3); - - R0 = r2.loadPacket(0 * Traits::ResPacketSize); - R1 = r2.loadPacket(1 * Traits::ResPacketSize); - R2 = r3.loadPacket(0 * Traits::ResPacketSize); - R3 = r3.loadPacket(1 * Traits::ResPacketSize); - traits.acc(C2, alphav, R0); - traits.acc(C6, alphav, R1); - traits.acc(C3, alphav, R2); - traits.acc(C7, alphav, R3); - r2.storePacket(0 * Traits::ResPacketSize, R0); - r2.storePacket(1 * Traits::ResPacketSize, R1); - r3.storePacket(0 * Traits::ResPacketSize, R2); - r3.storePacket(1 * Traits::ResPacketSize, R3); - } - } - - // Deal with remaining columns of the rhs - for(Index j2=packet_cols4; j2(alpha); - - R0 = r0.loadPacket(0 * Traits::ResPacketSize); - R1 = r0.loadPacket(1 * Traits::ResPacketSize); - traits.acc(C0, alphav, R0); - traits.acc(C4, alphav, R1); - r0.storePacket(0 * Traits::ResPacketSize, R0); - r0.storePacket(1 * Traits::ResPacketSize, R1); - } - } - } - } - //---------- Process 1 * LhsProgress rows at once ---------- - if(mr>=1*Traits::LhsProgress) - { - // loops on each largest micro horizontal panel of lhs (1*LhsProgress x depth) - for(Index i=peeled_mc2; i(alpha); - - R0 = r0.loadPacket(0 * Traits::ResPacketSize); - R1 = r1.loadPacket(0 * Traits::ResPacketSize); - traits.acc(C0, alphav, R0); - traits.acc(C1, alphav, R1); - r0.storePacket(0 * Traits::ResPacketSize, R0); - r1.storePacket(0 * Traits::ResPacketSize, R1); - - R0 = r2.loadPacket(0 * Traits::ResPacketSize); - R1 = r3.loadPacket(0 * Traits::ResPacketSize); - traits.acc(C2, alphav, R0); - traits.acc(C3, alphav, R1); - r2.storePacket(0 * Traits::ResPacketSize, R0); - r3.storePacket(0 * Traits::ResPacketSize, R1); - } - - // Deal with remaining columns of the rhs - for(Index j2=packet_cols4; j2(alpha); - R0 = r0.loadPacket(0 * Traits::ResPacketSize); - traits.acc(C0, alphav, R0); - r0.storePacket(0 * Traits::ResPacketSize, R0); - } - } - } - //---------- Process remaining rows, 1 at once ---------- - if(peeled_mc1::half SResPacketHalf; - if ((SwappedTraits::LhsProgress % 4) == 0 && - (SwappedTraits::LhsProgress <= 8) && - (SwappedTraits::LhsProgress!=8 || unpacket_traits::size==nr)) - { - SAccPacket C0, C1, C2, C3; - straits.initAcc(C0); - straits.initAcc(C1); - straits.initAcc(C2); - straits.initAcc(C3); - - const Index spk = (std::max)(1,SwappedTraits::LhsProgress/4); - const Index endk = (depth/spk)*spk; - const Index endk4 = (depth/(spk*4))*(spk*4); - - Index k=0; - for(; k=8,typename unpacket_traits::half,SResPacket>::type SResPacketHalf; - typedef typename conditional=8,typename unpacket_traits::half,SLhsPacket>::type SLhsPacketHalf; - typedef typename conditional=8,typename unpacket_traits::half,SRhsPacket>::type SRhsPacketHalf; - typedef typename conditional=8,typename unpacket_traits::half,SAccPacket>::type SAccPacketHalf; - - SResPacketHalf R = res.template gatherPacket(i, j2); - SResPacketHalf alphav = pset1(alpha); - - if(depth-endk>0) - { - // We have to handle the last row of the rhs which corresponds to a half-packet - SLhsPacketHalf a0; - SRhsPacketHalf b0; - straits.loadLhsUnaligned(blB, a0); - straits.loadRhs(blA, b0); - SAccPacketHalf c0 = predux_downto4(C0); - straits.madd(a0,b0,c0,b0); - straits.acc(c0, alphav, R); - } - else - { - straits.acc(predux_downto4(C0), alphav, R); - } - res.scatterPacket(i, j2, R); - } - else - { - SResPacket R = res.template gatherPacket(i, j2); - SResPacket alphav = pset1(alpha); - straits.acc(C0, alphav, R); - res.scatterPacket(i, j2, R); - } - } - else // scalar path - { - // get a 1 x 4 res block as registers - ResScalar C0(0), C1(0), C2(0), C3(0); - - for(Index k=0; k -struct gemm_pack_lhs -{ - typedef typename DataMapper::LinearMapper LinearMapper; - EIGEN_DONT_INLINE void operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride=0, Index offset=0); -}; - -template -EIGEN_DONT_INLINE void gemm_pack_lhs - ::operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride, Index offset) -{ - typedef typename packet_traits::type Packet; - enum { PacketSize = packet_traits::size }; - - EIGEN_ASM_COMMENT("EIGEN PRODUCT PACK LHS"); - EIGEN_UNUSED_VARIABLE(stride); - EIGEN_UNUSED_VARIABLE(offset); - eigen_assert(((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)); - eigen_assert( ((Pack1%PacketSize)==0 && Pack1<=4*PacketSize) || (Pack1<=4) ); - conj_if::IsComplex && Conjugate> cj; - Index count = 0; - - const Index peeled_mc3 = Pack1>=3*PacketSize ? (rows/(3*PacketSize))*(3*PacketSize) : 0; - const Index peeled_mc2 = Pack1>=2*PacketSize ? peeled_mc3+((rows-peeled_mc3)/(2*PacketSize))*(2*PacketSize) : 0; - const Index peeled_mc1 = Pack1>=1*PacketSize ? (rows/(1*PacketSize))*(1*PacketSize) : 0; - const Index peeled_mc0 = Pack2>=1*PacketSize ? peeled_mc1 - : Pack2>1 ? (rows/Pack2)*Pack2 : 0; - - Index i=0; - - // Pack 3 packets - if(Pack1>=3*PacketSize) - { - for(; i=2*PacketSize) - { - for(; i=1*PacketSize) - { - for(; i1) - { - for(; i -struct gemm_pack_lhs -{ - typedef typename DataMapper::LinearMapper LinearMapper; - EIGEN_DONT_INLINE void operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride=0, Index offset=0); -}; - -template -EIGEN_DONT_INLINE void gemm_pack_lhs - ::operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride, Index offset) -{ - typedef typename packet_traits::type Packet; - enum { PacketSize = packet_traits::size }; - - EIGEN_ASM_COMMENT("EIGEN PRODUCT PACK LHS"); - EIGEN_UNUSED_VARIABLE(stride); - EIGEN_UNUSED_VARIABLE(offset); - eigen_assert(((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)); - conj_if::IsComplex && Conjugate> cj; - Index count = 0; - -// const Index peeled_mc3 = Pack1>=3*PacketSize ? (rows/(3*PacketSize))*(3*PacketSize) : 0; -// const Index peeled_mc2 = Pack1>=2*PacketSize ? peeled_mc3+((rows-peeled_mc3)/(2*PacketSize))*(2*PacketSize) : 0; -// const Index peeled_mc1 = Pack1>=1*PacketSize ? (rows/(1*PacketSize))*(1*PacketSize) : 0; - - int pack = Pack1; - Index i = 0; - while(pack>0) - { - Index remaining_rows = rows-i; - Index peeled_mc = i+(remaining_rows/pack)*pack; - for(; i=PacketSize) - { - for(; k kernel; - for (int p = 0; p < PacketSize; ++p) kernel.packet[p] = lhs.loadPacket(i+p+m, k); - ptranspose(kernel); - for (int p = 0; p < PacketSize; ++p) pstore(blockA+count+m+(pack)*p, cj.pconj(kernel.packet[p])); - } - count += PacketSize*pack; - } - } - for(; k -struct gemm_pack_rhs -{ - typedef typename packet_traits::type Packet; - typedef typename DataMapper::LinearMapper LinearMapper; - enum { PacketSize = packet_traits::size }; - EIGEN_DONT_INLINE void operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride=0, Index offset=0); -}; - -template -EIGEN_DONT_INLINE void gemm_pack_rhs - ::operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride, Index offset) -{ - EIGEN_ASM_COMMENT("EIGEN PRODUCT PACK RHS COLMAJOR"); - EIGEN_UNUSED_VARIABLE(stride); - EIGEN_UNUSED_VARIABLE(offset); - eigen_assert(((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)); - conj_if::IsComplex && Conjugate> cj; - Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0; - Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; - Index count = 0; - const Index peeled_k = (depth/PacketSize)*PacketSize; -// if(nr>=8) -// { -// for(Index j2=0; j2 kernel; -// for (int p = 0; p < PacketSize; ++p) { -// kernel.packet[p] = ploadu(&rhs[(j2+p)*rhsStride+k]); -// } -// ptranspose(kernel); -// for (int p = 0; p < PacketSize; ++p) { -// pstoreu(blockB+count, cj.pconj(kernel.packet[p])); -// count+=PacketSize; -// } -// } -// } -// for(; k=4) - { - for(Index j2=packet_cols8; j2 kernel; - kernel.packet[0] = dm0.loadPacket(k); - kernel.packet[1%PacketSize] = dm1.loadPacket(k); - kernel.packet[2%PacketSize] = dm2.loadPacket(k); - kernel.packet[3%PacketSize] = dm3.loadPacket(k); - ptranspose(kernel); - pstoreu(blockB+count+0*PacketSize, cj.pconj(kernel.packet[0])); - pstoreu(blockB+count+1*PacketSize, cj.pconj(kernel.packet[1%PacketSize])); - pstoreu(blockB+count+2*PacketSize, cj.pconj(kernel.packet[2%PacketSize])); - pstoreu(blockB+count+3*PacketSize, cj.pconj(kernel.packet[3%PacketSize])); - count+=4*PacketSize; - } - } - for(; k -struct gemm_pack_rhs -{ - typedef typename packet_traits::type Packet; - typedef typename DataMapper::LinearMapper LinearMapper; - enum { PacketSize = packet_traits::size }; - EIGEN_DONT_INLINE void operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride=0, Index offset=0); -}; - -template -EIGEN_DONT_INLINE void gemm_pack_rhs - ::operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride, Index offset) -{ - EIGEN_ASM_COMMENT("EIGEN PRODUCT PACK RHS ROWMAJOR"); - EIGEN_UNUSED_VARIABLE(stride); - EIGEN_UNUSED_VARIABLE(offset); - eigen_assert(((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)); - conj_if::IsComplex && Conjugate> cj; - Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0; - Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; - Index count = 0; - -// if(nr>=8) -// { -// for(Index j2=0; j2(&rhs[k*rhsStride + j2]); -// pstoreu(blockB+count, cj.pconj(A)); -// } else if (PacketSize==4) { -// Packet A = ploadu(&rhs[k*rhsStride + j2]); -// Packet B = ploadu(&rhs[k*rhsStride + j2 + PacketSize]); -// pstoreu(blockB+count, cj.pconj(A)); -// pstoreu(blockB+count+PacketSize, cj.pconj(B)); -// } else { -// const Scalar* b0 = &rhs[k*rhsStride + j2]; -// blockB[count+0] = cj(b0[0]); -// blockB[count+1] = cj(b0[1]); -// blockB[count+2] = cj(b0[2]); -// blockB[count+3] = cj(b0[3]); -// blockB[count+4] = cj(b0[4]); -// blockB[count+5] = cj(b0[5]); -// blockB[count+6] = cj(b0[6]); -// blockB[count+7] = cj(b0[7]); -// } -// count += 8; -// } -// // skip what we have after -// if(PanelMode) count += 8 * (stride-offset-depth); -// } -// } - if(nr>=4) - { - for(Index j2=packet_cols8; j2 -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GENERAL_MATRIX_MATRIX_H -#define EIGEN_GENERAL_MATRIX_MATRIX_H - -namespace Eigen { - -namespace internal { - -template class level3_blocking; - -/* Specialization for a row-major destination matrix => simple transposition of the product */ -template< - typename Index, - typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, - typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs> -struct general_matrix_matrix_product -{ - typedef gebp_traits Traits; - - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - static EIGEN_STRONG_INLINE void run( - Index rows, Index cols, Index depth, - const LhsScalar* lhs, Index lhsStride, - const RhsScalar* rhs, Index rhsStride, - ResScalar* res, Index resStride, - ResScalar alpha, - level3_blocking& blocking, - GemmParallelInfo* info = 0) - { - // transpose the product such that the result is column major - general_matrix_matrix_product - ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info); - } -}; - -/* Specialization for a col-major destination matrix - * => Blocking algorithm following Goto's paper */ -template< - typename Index, - typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, - typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs> -struct general_matrix_matrix_product -{ - -typedef gebp_traits Traits; - -typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; -static void run(Index rows, Index cols, Index depth, - const LhsScalar* _lhs, Index lhsStride, - const RhsScalar* _rhs, Index rhsStride, - ResScalar* _res, Index resStride, - ResScalar alpha, - level3_blocking& blocking, - GemmParallelInfo* info = 0) -{ - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - typedef blas_data_mapper ResMapper; - LhsMapper lhs(_lhs,lhsStride); - RhsMapper rhs(_rhs,rhsStride); - ResMapper res(_res, resStride); - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction - Index nc = (std::min)(cols,blocking.nc()); // cache block size along the N direction - - gemm_pack_lhs pack_lhs; - gemm_pack_rhs pack_rhs; - gebp_kernel gebp; - -#ifdef EIGEN_HAS_OPENMP - if(info) - { - // this is the parallel version! - int tid = omp_get_thread_num(); - int threads = omp_get_num_threads(); - - LhsScalar* blockA = blocking.blockA(); - eigen_internal_assert(blockA!=0); - - std::size_t sizeB = kc*nc; - ei_declare_aligned_stack_constructed_variable(RhsScalar, blockB, sizeB, 0); - - // For each horizontal panel of the rhs, and corresponding vertical panel of the lhs... - for(Index k=0; k rows of B', and cols of the A' - - // In order to reduce the chance that a thread has to wait for the other, - // let's start by packing B'. - pack_rhs(blockB, rhs.getSubMapper(k,0), actual_kc, nc); - - // Pack A_k to A' in a parallel fashion: - // each thread packs the sub block A_k,i to A'_i where i is the thread id. - - // However, before copying to A'_i, we have to make sure that no other thread is still using it, - // i.e., we test that info[tid].users equals 0. - // Then, we set info[tid].users to the number of threads to mark that all other threads are going to use it. - while(info[tid].users!=0) {} - info[tid].users += threads; - - pack_lhs(blockA+info[tid].lhs_start*actual_kc, lhs.getSubMapper(info[tid].lhs_start,k), actual_kc, info[tid].lhs_length); - - // Notify the other threads that the part A'_i is ready to go. - info[tid].sync = k; - - // Computes C_i += A' * B' per A'_i - for(int shift=0; shift0) { - while(info[i].sync!=k) { - } - } - - gebp(res.getSubMapper(info[i].lhs_start, 0), blockA+info[i].lhs_start*actual_kc, blockB, info[i].lhs_length, actual_kc, nc, alpha); - } - - // Then keep going as usual with the remaining B' - for(Index j=nc; j Pack lhs's panel into a sequential chunk of memory (L2/L3 caching) - // Note that this panel will be read as many times as the number of blocks in the rhs's - // horizontal panel which is, in practice, a very low number. - pack_lhs(blockA, lhs.getSubMapper(i2,k2), actual_kc, actual_mc); - - // For each kc x nc block of the rhs's horizontal panel... - for(Index j2=0; j2 -struct gemm_functor -{ - gemm_functor(const Lhs& lhs, const Rhs& rhs, Dest& dest, const Scalar& actualAlpha, BlockingType& blocking) - : m_lhs(lhs), m_rhs(rhs), m_dest(dest), m_actualAlpha(actualAlpha), m_blocking(blocking) - {} - - void initParallelSession(Index num_threads) const - { - m_blocking.initParallel(m_lhs.rows(), m_rhs.cols(), m_lhs.cols(), num_threads); - m_blocking.allocateA(); - } - - void operator() (Index row, Index rows, Index col=0, Index cols=-1, GemmParallelInfo* info=0) const - { - if(cols==-1) - cols = m_rhs.cols(); - - Gemm::run(rows, cols, m_lhs.cols(), - &m_lhs.coeffRef(row,0), m_lhs.outerStride(), - &m_rhs.coeffRef(0,col), m_rhs.outerStride(), - (Scalar*)&(m_dest.coeffRef(row,col)), m_dest.outerStride(), - m_actualAlpha, m_blocking, info); - } - - typedef typename Gemm::Traits Traits; - - protected: - const Lhs& m_lhs; - const Rhs& m_rhs; - Dest& m_dest; - Scalar m_actualAlpha; - BlockingType& m_blocking; -}; - -template class gemm_blocking_space; - -template -class level3_blocking -{ - typedef _LhsScalar LhsScalar; - typedef _RhsScalar RhsScalar; - - protected: - LhsScalar* m_blockA; - RhsScalar* m_blockB; - - Index m_mc; - Index m_nc; - Index m_kc; - - public: - - level3_blocking() - : m_blockA(0), m_blockB(0), m_mc(0), m_nc(0), m_kc(0) - {} - - inline Index mc() const { return m_mc; } - inline Index nc() const { return m_nc; } - inline Index kc() const { return m_kc; } - - inline LhsScalar* blockA() { return m_blockA; } - inline RhsScalar* blockB() { return m_blockB; } -}; - -template -class gemm_blocking_space - : public level3_blocking< - typename conditional::type, - typename conditional::type> -{ - enum { - Transpose = StorageOrder==RowMajor, - ActualRows = Transpose ? MaxCols : MaxRows, - ActualCols = Transpose ? MaxRows : MaxCols - }; - typedef typename conditional::type LhsScalar; - typedef typename conditional::type RhsScalar; - typedef gebp_traits Traits; - enum { - SizeA = ActualRows * MaxDepth, - SizeB = ActualCols * MaxDepth - }; - -#if EIGEN_MAX_STATIC_ALIGN_BYTES >= EIGEN_DEFAULT_ALIGN_BYTES - EIGEN_ALIGN_MAX LhsScalar m_staticA[SizeA]; - EIGEN_ALIGN_MAX RhsScalar m_staticB[SizeB]; -#else - EIGEN_ALIGN_MAX char m_staticA[SizeA * sizeof(LhsScalar) + EIGEN_DEFAULT_ALIGN_BYTES-1]; - EIGEN_ALIGN_MAX char m_staticB[SizeB * sizeof(RhsScalar) + EIGEN_DEFAULT_ALIGN_BYTES-1]; -#endif - - public: - - gemm_blocking_space(Index /*rows*/, Index /*cols*/, Index /*depth*/, Index /*num_threads*/, bool /*full_rows = false*/) - { - this->m_mc = ActualRows; - this->m_nc = ActualCols; - this->m_kc = MaxDepth; -#if EIGEN_MAX_STATIC_ALIGN_BYTES >= EIGEN_DEFAULT_ALIGN_BYTES - this->m_blockA = m_staticA; - this->m_blockB = m_staticB; -#else - this->m_blockA = reinterpret_cast((internal::UIntPtr(m_staticA) + (EIGEN_DEFAULT_ALIGN_BYTES-1)) & ~std::size_t(EIGEN_DEFAULT_ALIGN_BYTES-1)); - this->m_blockB = reinterpret_cast((internal::UIntPtr(m_staticB) + (EIGEN_DEFAULT_ALIGN_BYTES-1)) & ~std::size_t(EIGEN_DEFAULT_ALIGN_BYTES-1)); -#endif - } - - void initParallel(Index, Index, Index, Index) - {} - - inline void allocateA() {} - inline void allocateB() {} - inline void allocateAll() {} -}; - -template -class gemm_blocking_space - : public level3_blocking< - typename conditional::type, - typename conditional::type> -{ - enum { - Transpose = StorageOrder==RowMajor - }; - typedef typename conditional::type LhsScalar; - typedef typename conditional::type RhsScalar; - typedef gebp_traits Traits; - - Index m_sizeA; - Index m_sizeB; - - public: - - gemm_blocking_space(Index rows, Index cols, Index depth, Index num_threads, bool l3_blocking) - { - this->m_mc = Transpose ? cols : rows; - this->m_nc = Transpose ? rows : cols; - this->m_kc = depth; - - if(l3_blocking) - { - computeProductBlockingSizes(this->m_kc, this->m_mc, this->m_nc, num_threads); - } - else // no l3 blocking - { - Index n = this->m_nc; - computeProductBlockingSizes(this->m_kc, this->m_mc, n, num_threads); - } - - m_sizeA = this->m_mc * this->m_kc; - m_sizeB = this->m_kc * this->m_nc; - } - - void initParallel(Index rows, Index cols, Index depth, Index num_threads) - { - this->m_mc = Transpose ? cols : rows; - this->m_nc = Transpose ? rows : cols; - this->m_kc = depth; - - eigen_internal_assert(this->m_blockA==0 && this->m_blockB==0); - Index m = this->m_mc; - computeProductBlockingSizes(this->m_kc, m, this->m_nc, num_threads); - m_sizeA = this->m_mc * this->m_kc; - m_sizeB = this->m_kc * this->m_nc; - } - - void allocateA() - { - if(this->m_blockA==0) - this->m_blockA = aligned_new(m_sizeA); - } - - void allocateB() - { - if(this->m_blockB==0) - this->m_blockB = aligned_new(m_sizeB); - } - - void allocateAll() - { - allocateA(); - allocateB(); - } - - ~gemm_blocking_space() - { - aligned_delete(this->m_blockA, m_sizeA); - aligned_delete(this->m_blockB, m_sizeB); - } -}; - -} // end namespace internal - -namespace internal { - -template -struct generic_product_impl - : generic_product_impl_base > -{ - typedef typename Product::Scalar Scalar; - typedef typename Lhs::Scalar LhsScalar; - typedef typename Rhs::Scalar RhsScalar; - - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; - typedef typename internal::remove_all::type ActualLhsTypeCleaned; - - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; - typedef typename internal::remove_all::type ActualRhsTypeCleaned; - - enum { - MaxDepthAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(Lhs::MaxColsAtCompileTime,Rhs::MaxRowsAtCompileTime) - }; - - typedef generic_product_impl lazyproduct; - - template - static void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) - { - // See http://eigen.tuxfamily.org/bz/show_bug.cgi?id=404 for a discussion and helper program - // to determine the following heuristic. - // EIGEN_GEMM_TO_COEFFBASED_THRESHOLD is typically defined to 20 in GeneralProduct.h, - // unless it has been specialized by the user or for a given architecture. - // Note that the condition rhs.rows()>0 was required because lazy produc is (was?) not happy with empty inputs. - // I'm not sure it is still required. - if((rhs.rows()+dst.rows()+dst.cols())0) - lazyproduct::evalTo(dst, lhs, rhs); - else - { - dst.setZero(); - scaleAndAddTo(dst, lhs, rhs, Scalar(1)); - } - } - - template - static void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) - { - if((rhs.rows()+dst.rows()+dst.cols())0) - lazyproduct::addTo(dst, lhs, rhs); - else - scaleAndAddTo(dst,lhs, rhs, Scalar(1)); - } - - template - static void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) - { - if((rhs.rows()+dst.rows()+dst.cols())0) - lazyproduct::subTo(dst, lhs, rhs); - else - scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); - } - - template - static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) - { - eigen_assert(dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols()); - if(a_lhs.cols()==0 || a_lhs.rows()==0 || a_rhs.cols()==0) - return; - - typename internal::add_const_on_value_type::type lhs = LhsBlasTraits::extract(a_lhs); - typename internal::add_const_on_value_type::type rhs = RhsBlasTraits::extract(a_rhs); - - Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) - * RhsBlasTraits::extractScalarFactor(a_rhs); - - typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,LhsScalar,RhsScalar, - Dest::MaxRowsAtCompileTime,Dest::MaxColsAtCompileTime,MaxDepthAtCompileTime> BlockingType; - - typedef internal::gemm_functor< - Scalar, Index, - internal::general_matrix_matrix_product< - Index, - LhsScalar, (ActualLhsTypeCleaned::Flags&RowMajorBit) ? RowMajor : ColMajor, bool(LhsBlasTraits::NeedToConjugate), - RhsScalar, (ActualRhsTypeCleaned::Flags&RowMajorBit) ? RowMajor : ColMajor, bool(RhsBlasTraits::NeedToConjugate), - (Dest::Flags&RowMajorBit) ? RowMajor : ColMajor>, - ActualLhsTypeCleaned, ActualRhsTypeCleaned, Dest, BlockingType> GemmFunctor; - - BlockingType blocking(dst.rows(), dst.cols(), lhs.cols(), 1, true); - internal::parallelize_gemm<(Dest::MaxRowsAtCompileTime>32 || Dest::MaxRowsAtCompileTime==Dynamic)> - (GemmFunctor(lhs, rhs, dst, actualAlpha, blocking), a_lhs.rows(), a_rhs.cols(), a_lhs.cols(), Dest::Flags&RowMajorBit); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_GENERAL_MATRIX_MATRIX_H diff --git a/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h b/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h deleted file mode 100644 index e436c50a4..000000000 --- a/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h +++ /dev/null @@ -1,311 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GENERAL_MATRIX_MATRIX_TRIANGULAR_H -#define EIGEN_GENERAL_MATRIX_MATRIX_TRIANGULAR_H - -namespace Eigen { - -template -struct selfadjoint_rank1_update; - -namespace internal { - -/********************************************************************** -* This file implements a general A * B product while -* evaluating only one triangular part of the product. -* This is a more general version of self adjoint product (C += A A^T) -* as the level 3 SYRK Blas routine. -**********************************************************************/ - -// forward declarations (defined at the end of this file) -template -struct tribb_kernel; - -/* Optimized matrix-matrix product evaluating only one triangular half */ -template -struct general_matrix_matrix_triangular_product; - -// as usual if the result is row major => we transpose the product -template -struct general_matrix_matrix_triangular_product -{ - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - static EIGEN_STRONG_INLINE void run(Index size, Index depth,const LhsScalar* lhs, Index lhsStride, - const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, - const ResScalar& alpha, level3_blocking& blocking) - { - general_matrix_matrix_triangular_product - ::run(size,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking); - } -}; - -template -struct general_matrix_matrix_triangular_product -{ - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - static EIGEN_STRONG_INLINE void run(Index size, Index depth,const LhsScalar* _lhs, Index lhsStride, - const RhsScalar* _rhs, Index rhsStride, ResScalar* _res, Index resStride, - const ResScalar& alpha, level3_blocking& blocking) - { - typedef gebp_traits Traits; - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - typedef blas_data_mapper ResMapper; - LhsMapper lhs(_lhs,lhsStride); - RhsMapper rhs(_rhs,rhsStride); - ResMapper res(_res, resStride); - - Index kc = blocking.kc(); - Index mc = (std::min)(size,blocking.mc()); - - // !!! mc must be a multiple of nr: - if(mc > Traits::nr) - mc = (mc/Traits::nr)*Traits::nr; - - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*size; - - ei_declare_aligned_stack_constructed_variable(LhsScalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(RhsScalar, blockB, sizeB, blocking.blockB()); - - gemm_pack_lhs pack_lhs; - gemm_pack_rhs pack_rhs; - gebp_kernel gebp; - tribb_kernel sybb; - - for(Index k2=0; k2 processed with gebp or skipped - // 2 - the actual_mc x actual_mc symmetric block => processed with a special kernel - // 3 - after the diagonal => processed with gebp or skipped - if (UpLo==Lower) - gebp(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, - (std::min)(size,i2), alpha, -1, -1, 0, 0); - - - sybb(_res+resStride*i2 + i2, resStride, blockA, blockB + actual_kc*i2, actual_mc, actual_kc, alpha); - - if (UpLo==Upper) - { - Index j2 = i2+actual_mc; - gebp(res.getSubMapper(i2, j2), blockA, blockB+actual_kc*j2, actual_mc, - actual_kc, (std::max)(Index(0), size-j2), alpha, -1, -1, 0, 0); - } - } - } - } -}; - -// Optimized packed Block * packed Block product kernel evaluating only one given triangular part -// This kernel is built on top of the gebp kernel: -// - the current destination block is processed per panel of actual_mc x BlockSize -// where BlockSize is set to the minimal value allowing gebp to be as fast as possible -// - then, as usual, each panel is split into three parts along the diagonal, -// the sub blocks above and below the diagonal are processed as usual, -// while the triangular block overlapping the diagonal is evaluated into a -// small temporary buffer which is then accumulated into the result using a -// triangular traversal. -template -struct tribb_kernel -{ - typedef gebp_traits Traits; - typedef typename Traits::ResScalar ResScalar; - - enum { - BlockSize = meta_least_common_multiple::ret - }; - void operator()(ResScalar* _res, Index resStride, const LhsScalar* blockA, const RhsScalar* blockB, Index size, Index depth, const ResScalar& alpha) - { - typedef blas_data_mapper ResMapper; - ResMapper res(_res, resStride); - gebp_kernel gebp_kernel; - - Matrix buffer((internal::constructor_without_unaligned_array_assert())); - - // let's process the block per panel of actual_mc x BlockSize, - // again, each is split into three parts, etc. - for (Index j=0; j(BlockSize,size - j); - const RhsScalar* actual_b = blockB+j*depth; - - if(UpLo==Upper) - gebp_kernel(res.getSubMapper(0, j), blockA, actual_b, j, depth, actualBlockSize, alpha, - -1, -1, 0, 0); - - // selfadjoint micro block - { - Index i = j; - buffer.setZero(); - // 1 - apply the kernel on the temporary buffer - gebp_kernel(ResMapper(buffer.data(), BlockSize), blockA+depth*i, actual_b, actualBlockSize, depth, actualBlockSize, alpha, - -1, -1, 0, 0); - // 2 - triangular accumulation - for(Index j1=0; j1 -struct general_product_to_triangular_selector; - - -template -struct general_product_to_triangular_selector -{ - static void run(MatrixType& mat, const ProductType& prod, const typename MatrixType::Scalar& alpha, bool beta) - { - typedef typename MatrixType::Scalar Scalar; - - typedef typename internal::remove_all::type Lhs; - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhs; - typedef typename internal::remove_all::type _ActualLhs; - typename internal::add_const_on_value_type::type actualLhs = LhsBlasTraits::extract(prod.lhs()); - - typedef typename internal::remove_all::type Rhs; - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhs; - typedef typename internal::remove_all::type _ActualRhs; - typename internal::add_const_on_value_type::type actualRhs = RhsBlasTraits::extract(prod.rhs()); - - Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(prod.lhs().derived()) * RhsBlasTraits::extractScalarFactor(prod.rhs().derived()); - - if(!beta) - mat.template triangularView().setZero(); - - enum { - StorageOrder = (internal::traits::Flags&RowMajorBit) ? RowMajor : ColMajor, - UseLhsDirectly = _ActualLhs::InnerStrideAtCompileTime==1, - UseRhsDirectly = _ActualRhs::InnerStrideAtCompileTime==1 - }; - - internal::gemv_static_vector_if static_lhs; - ei_declare_aligned_stack_constructed_variable(Scalar, actualLhsPtr, actualLhs.size(), - (UseLhsDirectly ? const_cast(actualLhs.data()) : static_lhs.data())); - if(!UseLhsDirectly) Map(actualLhsPtr, actualLhs.size()) = actualLhs; - - internal::gemv_static_vector_if static_rhs; - ei_declare_aligned_stack_constructed_variable(Scalar, actualRhsPtr, actualRhs.size(), - (UseRhsDirectly ? const_cast(actualRhs.data()) : static_rhs.data())); - if(!UseRhsDirectly) Map(actualRhsPtr, actualRhs.size()) = actualRhs; - - - selfadjoint_rank1_update::IsComplex, - RhsBlasTraits::NeedToConjugate && NumTraits::IsComplex> - ::run(actualLhs.size(), mat.data(), mat.outerStride(), actualLhsPtr, actualRhsPtr, actualAlpha); - } -}; - -template -struct general_product_to_triangular_selector -{ - static void run(MatrixType& mat, const ProductType& prod, const typename MatrixType::Scalar& alpha, bool beta) - { - typedef typename internal::remove_all::type Lhs; - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhs; - typedef typename internal::remove_all::type _ActualLhs; - typename internal::add_const_on_value_type::type actualLhs = LhsBlasTraits::extract(prod.lhs()); - - typedef typename internal::remove_all::type Rhs; - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhs; - typedef typename internal::remove_all::type _ActualRhs; - typename internal::add_const_on_value_type::type actualRhs = RhsBlasTraits::extract(prod.rhs()); - - typename ProductType::Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(prod.lhs().derived()) * RhsBlasTraits::extractScalarFactor(prod.rhs().derived()); - - if(!beta) - mat.template triangularView().setZero(); - - enum { - IsRowMajor = (internal::traits::Flags&RowMajorBit) ? 1 : 0, - LhsIsRowMajor = _ActualLhs::Flags&RowMajorBit ? 1 : 0, - RhsIsRowMajor = _ActualRhs::Flags&RowMajorBit ? 1 : 0, - SkipDiag = (UpLo&(UnitDiag|ZeroDiag))!=0 - }; - - Index size = mat.cols(); - if(SkipDiag) - size--; - Index depth = actualLhs.cols(); - - typedef internal::gemm_blocking_space BlockingType; - - BlockingType blocking(size, size, depth, 1, false); - - internal::general_matrix_matrix_triangular_product - ::run(size, depth, - &actualLhs.coeffRef(SkipDiag&&(UpLo&Lower)==Lower ? 1 : 0,0), actualLhs.outerStride(), - &actualRhs.coeffRef(0,SkipDiag&&(UpLo&Upper)==Upper ? 1 : 0), actualRhs.outerStride(), - mat.data() + (SkipDiag ? (bool(IsRowMajor) != ((UpLo&Lower)==Lower) ? 1 : mat.outerStride() ) : 0), mat.outerStride(), actualAlpha, blocking); - } -}; - -template -template -EIGEN_DEVICE_FUNC TriangularView& TriangularViewImpl::_assignProduct(const ProductType& prod, const Scalar& alpha, bool beta) -{ - EIGEN_STATIC_ASSERT((UpLo&UnitDiag)==0, WRITING_TO_TRIANGULAR_PART_WITH_UNIT_DIAGONAL_IS_NOT_SUPPORTED); - eigen_assert(derived().nestedExpression().rows() == prod.rows() && derived().cols() == prod.cols()); - - general_product_to_triangular_selector::InnerSize==1>::run(derived().nestedExpression().const_cast_derived(), prod, alpha, beta); - - return derived(); -} - -} // end namespace Eigen - -#endif // EIGEN_GENERAL_MATRIX_MATRIX_TRIANGULAR_H diff --git a/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h b/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h deleted file mode 100644 index 9176a1382..000000000 --- a/Eigen/src/Core/products/GeneralMatrixMatrixTriangular_BLAS.h +++ /dev/null @@ -1,145 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * Level 3 BLAS SYRK/HERK implementation. - ******************************************************************************** -*/ - -#ifndef EIGEN_GENERAL_MATRIX_MATRIX_TRIANGULAR_BLAS_H -#define EIGEN_GENERAL_MATRIX_MATRIX_TRIANGULAR_BLAS_H - -namespace Eigen { - -namespace internal { - -template -struct general_matrix_matrix_rankupdate : - general_matrix_matrix_triangular_product< - Index,Scalar,AStorageOrder,ConjugateA,Scalar,AStorageOrder,ConjugateA,ResStorageOrder,UpLo,BuiltIn> {}; - - -// try to go to BLAS specialization -#define EIGEN_BLAS_RANKUPDATE_SPECIALIZE(Scalar) \ -template \ -struct general_matrix_matrix_triangular_product { \ - static EIGEN_STRONG_INLINE void run(Index size, Index depth,const Scalar* lhs, Index lhsStride, \ - const Scalar* rhs, Index rhsStride, Scalar* res, Index resStride, Scalar alpha, level3_blocking& blocking) \ - { \ - if ( lhs==rhs && ((UpLo&(Lower|Upper)==UpLo)) ) { \ - general_matrix_matrix_rankupdate \ - ::run(size,depth,lhs,lhsStride,rhs,rhsStride,res,resStride,alpha,blocking); \ - } else { \ - general_matrix_matrix_triangular_product \ - ::run(size,depth,lhs,lhsStride,rhs,rhsStride,res,resStride,alpha,blocking); \ - } \ - } \ -}; - -EIGEN_BLAS_RANKUPDATE_SPECIALIZE(double) -EIGEN_BLAS_RANKUPDATE_SPECIALIZE(float) -// TODO handle complex cases -// EIGEN_BLAS_RANKUPDATE_SPECIALIZE(dcomplex) -// EIGEN_BLAS_RANKUPDATE_SPECIALIZE(scomplex) - -// SYRK for float/double -#define EIGEN_BLAS_RANKUPDATE_R(EIGTYPE, BLASTYPE, BLASFUNC) \ -template \ -struct general_matrix_matrix_rankupdate { \ - enum { \ - IsLower = (UpLo&Lower) == Lower, \ - LowUp = IsLower ? Lower : Upper, \ - conjA = ((AStorageOrder==ColMajor) && ConjugateA) ? 1 : 0 \ - }; \ - static EIGEN_STRONG_INLINE void run(Index size, Index depth,const EIGTYPE* lhs, Index lhsStride, \ - const EIGTYPE* /*rhs*/, Index /*rhsStride*/, EIGTYPE* res, Index resStride, EIGTYPE alpha, level3_blocking& /*blocking*/) \ - { \ - /* typedef Matrix MatrixRhs;*/ \ -\ - BlasIndex lda=convert_index(lhsStride), ldc=convert_index(resStride), n=convert_index(size), k=convert_index(depth); \ - char uplo=((IsLower) ? 'L' : 'U'), trans=((AStorageOrder==RowMajor) ? 'T':'N'); \ - EIGTYPE beta(1); \ - BLASFUNC(&uplo, &trans, &n, &k, (const BLASTYPE*)&numext::real_ref(alpha), lhs, &lda, (const BLASTYPE*)&numext::real_ref(beta), res, &ldc); \ - } \ -}; - -// HERK for complex data -#define EIGEN_BLAS_RANKUPDATE_C(EIGTYPE, BLASTYPE, RTYPE, BLASFUNC) \ -template \ -struct general_matrix_matrix_rankupdate { \ - enum { \ - IsLower = (UpLo&Lower) == Lower, \ - LowUp = IsLower ? Lower : Upper, \ - conjA = (((AStorageOrder==ColMajor) && ConjugateA) || ((AStorageOrder==RowMajor) && !ConjugateA)) ? 1 : 0 \ - }; \ - static EIGEN_STRONG_INLINE void run(Index size, Index depth,const EIGTYPE* lhs, Index lhsStride, \ - const EIGTYPE* /*rhs*/, Index /*rhsStride*/, EIGTYPE* res, Index resStride, EIGTYPE alpha, level3_blocking& /*blocking*/) \ - { \ - typedef Matrix MatrixType; \ -\ - BlasIndex lda=convert_index(lhsStride), ldc=convert_index(resStride), n=convert_index(size), k=convert_index(depth); \ - char uplo=((IsLower) ? 'L' : 'U'), trans=((AStorageOrder==RowMajor) ? 'C':'N'); \ - RTYPE alpha_, beta_; \ - const EIGTYPE* a_ptr; \ -\ - alpha_ = alpha.real(); \ - beta_ = 1.0; \ -/* Copy with conjugation in some cases*/ \ - MatrixType a; \ - if (conjA) { \ - Map > mapA(lhs,n,k,OuterStride<>(lhsStride)); \ - a = mapA.conjugate(); \ - lda = a.outerStride(); \ - a_ptr = a.data(); \ - } else a_ptr=lhs; \ - BLASFUNC(&uplo, &trans, &n, &k, &alpha_, (BLASTYPE*)a_ptr, &lda, &beta_, (BLASTYPE*)res, &ldc); \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_RANKUPDATE_R(double, double, dsyrk) -EIGEN_BLAS_RANKUPDATE_R(float, float, ssyrk) -#else -EIGEN_BLAS_RANKUPDATE_R(double, double, dsyrk_) -EIGEN_BLAS_RANKUPDATE_R(float, float, ssyrk_) -#endif - -// TODO hanlde complex cases -// EIGEN_BLAS_RANKUPDATE_C(dcomplex, double, double, zherk_) -// EIGEN_BLAS_RANKUPDATE_C(scomplex, float, float, cherk_) - - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_GENERAL_MATRIX_MATRIX_TRIANGULAR_BLAS_H diff --git a/Eigen/src/Core/products/GeneralMatrixMatrix_BLAS.h b/Eigen/src/Core/products/GeneralMatrixMatrix_BLAS.h deleted file mode 100644 index b0f6b0d5b..000000000 --- a/Eigen/src/Core/products/GeneralMatrixMatrix_BLAS.h +++ /dev/null @@ -1,122 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * General matrix-matrix product functionality based on ?GEMM. - ******************************************************************************** -*/ - -#ifndef EIGEN_GENERAL_MATRIX_MATRIX_BLAS_H -#define EIGEN_GENERAL_MATRIX_MATRIX_BLAS_H - -namespace Eigen { - -namespace internal { - -/********************************************************************** -* This file implements general matrix-matrix multiplication using BLAS -* gemm function via partial specialization of -* general_matrix_matrix_product::run(..) method for float, double, -* std::complex and std::complex types -**********************************************************************/ - -// gemm specialization - -#define GEMM_SPECIALIZATION(EIGTYPE, EIGPREFIX, BLASTYPE, BLASFUNC) \ -template< \ - typename Index, \ - int LhsStorageOrder, bool ConjugateLhs, \ - int RhsStorageOrder, bool ConjugateRhs> \ -struct general_matrix_matrix_product \ -{ \ -typedef gebp_traits Traits; \ -\ -static void run(Index rows, Index cols, Index depth, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, \ - level3_blocking& /*blocking*/, \ - GemmParallelInfo* /*info = 0*/) \ -{ \ - using std::conj; \ -\ - char transa, transb; \ - BlasIndex m, n, k, lda, ldb, ldc; \ - const EIGTYPE *a, *b; \ - EIGTYPE beta(1); \ - MatrixX##EIGPREFIX a_tmp, b_tmp; \ -\ -/* Set transpose options */ \ - transa = (LhsStorageOrder==RowMajor) ? ((ConjugateLhs) ? 'C' : 'T') : 'N'; \ - transb = (RhsStorageOrder==RowMajor) ? ((ConjugateRhs) ? 'C' : 'T') : 'N'; \ -\ -/* Set m, n, k */ \ - m = convert_index(rows); \ - n = convert_index(cols); \ - k = convert_index(depth); \ -\ -/* Set lda, ldb, ldc */ \ - lda = convert_index(lhsStride); \ - ldb = convert_index(rhsStride); \ - ldc = convert_index(resStride); \ -\ -/* Set a, b, c */ \ - if ((LhsStorageOrder==ColMajor) && (ConjugateLhs)) { \ - Map > lhs(_lhs,m,k,OuterStride<>(lhsStride)); \ - a_tmp = lhs.conjugate(); \ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else a = _lhs; \ -\ - if ((RhsStorageOrder==ColMajor) && (ConjugateRhs)) { \ - Map > rhs(_rhs,k,n,OuterStride<>(rhsStride)); \ - b_tmp = rhs.conjugate(); \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ - } else b = _rhs; \ -\ - BLASFUNC(&transa, &transb, &m, &n, &k, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)b, &ldb, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &ldc); \ -}}; - -#ifdef EIGEN_USE_MKL -GEMM_SPECIALIZATION(double, d, double, dgemm) -GEMM_SPECIALIZATION(float, f, float, sgemm) -GEMM_SPECIALIZATION(dcomplex, cd, MKL_Complex16, zgemm) -GEMM_SPECIALIZATION(scomplex, cf, MKL_Complex8, cgemm) -#else -GEMM_SPECIALIZATION(double, d, double, dgemm_) -GEMM_SPECIALIZATION(float, f, float, sgemm_) -GEMM_SPECIALIZATION(dcomplex, cd, double, zgemm_) -GEMM_SPECIALIZATION(scomplex, cf, float, cgemm_) -#endif - -} // end namespase internal - -} // end namespace Eigen - -#endif // EIGEN_GENERAL_MATRIX_MATRIX_BLAS_H diff --git a/Eigen/src/Core/products/GeneralMatrixVector.h b/Eigen/src/Core/products/GeneralMatrixVector.h deleted file mode 100644 index 41d8242e1..000000000 --- a/Eigen/src/Core/products/GeneralMatrixVector.h +++ /dev/null @@ -1,405 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2016 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GENERAL_MATRIX_VECTOR_H -#define EIGEN_GENERAL_MATRIX_VECTOR_H - -namespace Eigen { - -namespace internal { - -/* Optimized col-major matrix * vector product: - * This algorithm processes the matrix per vertical panels, - * which are then processed horizontaly per chunck of 8*PacketSize x 1 vertical segments. - * - * Mixing type logic: C += alpha * A * B - * | A | B |alpha| comments - * |real |cplx |cplx | no vectorization - * |real |cplx |real | alpha is converted to a cplx when calling the run function, no vectorization - * |cplx |real |cplx | invalid, the caller has to do tmp: = A * B; C += alpha*tmp - * |cplx |real |real | optimal case, vectorization possible via real-cplx mul - * - * The same reasoning apply for the transposed case. - */ -template -struct general_matrix_vector_product -{ - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - -enum { - Vectorizable = packet_traits::Vectorizable && packet_traits::Vectorizable - && int(packet_traits::size)==int(packet_traits::size), - LhsPacketSize = Vectorizable ? packet_traits::size : 1, - RhsPacketSize = Vectorizable ? packet_traits::size : 1, - ResPacketSize = Vectorizable ? packet_traits::size : 1 -}; - -typedef typename packet_traits::type _LhsPacket; -typedef typename packet_traits::type _RhsPacket; -typedef typename packet_traits::type _ResPacket; - -typedef typename conditional::type LhsPacket; -typedef typename conditional::type RhsPacket; -typedef typename conditional::type ResPacket; - -EIGEN_DONT_INLINE static void run( - Index rows, Index cols, - const LhsMapper& lhs, - const RhsMapper& rhs, - ResScalar* res, Index resIncr, - RhsScalar alpha); -}; - -template -EIGEN_DONT_INLINE void general_matrix_vector_product::run( - Index rows, Index cols, - const LhsMapper& alhs, - const RhsMapper& rhs, - ResScalar* res, Index resIncr, - RhsScalar alpha) -{ - EIGEN_UNUSED_VARIABLE(resIncr); - eigen_internal_assert(resIncr==1); - - // The following copy tells the compiler that lhs's attributes are not modified outside this function - // This helps GCC to generate propoer code. - LhsMapper lhs(alhs); - - conj_helper cj; - conj_helper pcj; - const Index lhsStride = lhs.stride(); - // TODO: for padded aligned inputs, we could enable aligned reads - enum { LhsAlignment = Unaligned }; - - const Index n8 = rows-8*ResPacketSize+1; - const Index n4 = rows-4*ResPacketSize+1; - const Index n3 = rows-3*ResPacketSize+1; - const Index n2 = rows-2*ResPacketSize+1; - const Index n1 = rows-1*ResPacketSize+1; - - // TODO: improve the following heuristic: - const Index block_cols = cols<128 ? cols : (lhsStride*sizeof(LhsScalar)<32000?16:4); - ResPacket palpha = pset1(alpha); - - for(Index j2=0; j2(ResScalar(0)), - c1 = pset1(ResScalar(0)), - c2 = pset1(ResScalar(0)), - c3 = pset1(ResScalar(0)), - c4 = pset1(ResScalar(0)), - c5 = pset1(ResScalar(0)), - c6 = pset1(ResScalar(0)), - c7 = pset1(ResScalar(0)); - - for(Index j=j2; j(rhs(j,0)); - c0 = pcj.pmadd(lhs.template load(i+LhsPacketSize*0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+LhsPacketSize*1,j),b0,c1); - c2 = pcj.pmadd(lhs.template load(i+LhsPacketSize*2,j),b0,c2); - c3 = pcj.pmadd(lhs.template load(i+LhsPacketSize*3,j),b0,c3); - c4 = pcj.pmadd(lhs.template load(i+LhsPacketSize*4,j),b0,c4); - c5 = pcj.pmadd(lhs.template load(i+LhsPacketSize*5,j),b0,c5); - c6 = pcj.pmadd(lhs.template load(i+LhsPacketSize*6,j),b0,c6); - c7 = pcj.pmadd(lhs.template load(i+LhsPacketSize*7,j),b0,c7); - } - pstoreu(res+i+ResPacketSize*0, pmadd(c0,palpha,ploadu(res+i+ResPacketSize*0))); - pstoreu(res+i+ResPacketSize*1, pmadd(c1,palpha,ploadu(res+i+ResPacketSize*1))); - pstoreu(res+i+ResPacketSize*2, pmadd(c2,palpha,ploadu(res+i+ResPacketSize*2))); - pstoreu(res+i+ResPacketSize*3, pmadd(c3,palpha,ploadu(res+i+ResPacketSize*3))); - pstoreu(res+i+ResPacketSize*4, pmadd(c4,palpha,ploadu(res+i+ResPacketSize*4))); - pstoreu(res+i+ResPacketSize*5, pmadd(c5,palpha,ploadu(res+i+ResPacketSize*5))); - pstoreu(res+i+ResPacketSize*6, pmadd(c6,palpha,ploadu(res+i+ResPacketSize*6))); - pstoreu(res+i+ResPacketSize*7, pmadd(c7,palpha,ploadu(res+i+ResPacketSize*7))); - } - if(i(ResScalar(0)), - c1 = pset1(ResScalar(0)), - c2 = pset1(ResScalar(0)), - c3 = pset1(ResScalar(0)); - - for(Index j=j2; j(rhs(j,0)); - c0 = pcj.pmadd(lhs.template load(i+LhsPacketSize*0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+LhsPacketSize*1,j),b0,c1); - c2 = pcj.pmadd(lhs.template load(i+LhsPacketSize*2,j),b0,c2); - c3 = pcj.pmadd(lhs.template load(i+LhsPacketSize*3,j),b0,c3); - } - pstoreu(res+i+ResPacketSize*0, pmadd(c0,palpha,ploadu(res+i+ResPacketSize*0))); - pstoreu(res+i+ResPacketSize*1, pmadd(c1,palpha,ploadu(res+i+ResPacketSize*1))); - pstoreu(res+i+ResPacketSize*2, pmadd(c2,palpha,ploadu(res+i+ResPacketSize*2))); - pstoreu(res+i+ResPacketSize*3, pmadd(c3,palpha,ploadu(res+i+ResPacketSize*3))); - - i+=ResPacketSize*4; - } - if(i(ResScalar(0)), - c1 = pset1(ResScalar(0)), - c2 = pset1(ResScalar(0)); - - for(Index j=j2; j(rhs(j,0)); - c0 = pcj.pmadd(lhs.template load(i+LhsPacketSize*0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+LhsPacketSize*1,j),b0,c1); - c2 = pcj.pmadd(lhs.template load(i+LhsPacketSize*2,j),b0,c2); - } - pstoreu(res+i+ResPacketSize*0, pmadd(c0,palpha,ploadu(res+i+ResPacketSize*0))); - pstoreu(res+i+ResPacketSize*1, pmadd(c1,palpha,ploadu(res+i+ResPacketSize*1))); - pstoreu(res+i+ResPacketSize*2, pmadd(c2,palpha,ploadu(res+i+ResPacketSize*2))); - - i+=ResPacketSize*3; - } - if(i(ResScalar(0)), - c1 = pset1(ResScalar(0)); - - for(Index j=j2; j(rhs(j,0)); - c0 = pcj.pmadd(lhs.template load(i+LhsPacketSize*0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+LhsPacketSize*1,j),b0,c1); - } - pstoreu(res+i+ResPacketSize*0, pmadd(c0,palpha,ploadu(res+i+ResPacketSize*0))); - pstoreu(res+i+ResPacketSize*1, pmadd(c1,palpha,ploadu(res+i+ResPacketSize*1))); - i+=ResPacketSize*2; - } - if(i(ResScalar(0)); - for(Index j=j2; j(rhs(j,0)); - c0 = pcj.pmadd(lhs.template load(i+0,j),b0,c0); - } - pstoreu(res+i+ResPacketSize*0, pmadd(c0,palpha,ploadu(res+i+ResPacketSize*0))); - i+=ResPacketSize; - } - for(;i -struct general_matrix_vector_product -{ -typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - -enum { - Vectorizable = packet_traits::Vectorizable && packet_traits::Vectorizable - && int(packet_traits::size)==int(packet_traits::size), - LhsPacketSize = Vectorizable ? packet_traits::size : 1, - RhsPacketSize = Vectorizable ? packet_traits::size : 1, - ResPacketSize = Vectorizable ? packet_traits::size : 1 -}; - -typedef typename packet_traits::type _LhsPacket; -typedef typename packet_traits::type _RhsPacket; -typedef typename packet_traits::type _ResPacket; - -typedef typename conditional::type LhsPacket; -typedef typename conditional::type RhsPacket; -typedef typename conditional::type ResPacket; - -EIGEN_DONT_INLINE static void run( - Index rows, Index cols, - const LhsMapper& lhs, - const RhsMapper& rhs, - ResScalar* res, Index resIncr, - ResScalar alpha); -}; - -template -EIGEN_DONT_INLINE void general_matrix_vector_product::run( - Index rows, Index cols, - const LhsMapper& alhs, - const RhsMapper& rhs, - ResScalar* res, Index resIncr, - ResScalar alpha) -{ - // The following copy tells the compiler that lhs's attributes are not modified outside this function - // This helps GCC to generate propoer code. - LhsMapper lhs(alhs); - - eigen_internal_assert(rhs.stride()==1); - conj_helper cj; - conj_helper pcj; - - // TODO: fine tune the following heuristic. The rationale is that if the matrix is very large, - // processing 8 rows at once might be counter productive wrt cache. - const Index n8 = lhs.stride()*sizeof(LhsScalar)>32000 ? 0 : rows-7; - const Index n4 = rows-3; - const Index n2 = rows-1; - - // TODO: for padded aligned inputs, we could enable aligned reads - enum { LhsAlignment = Unaligned }; - - Index i=0; - for(; i(ResScalar(0)), - c1 = pset1(ResScalar(0)), - c2 = pset1(ResScalar(0)), - c3 = pset1(ResScalar(0)), - c4 = pset1(ResScalar(0)), - c5 = pset1(ResScalar(0)), - c6 = pset1(ResScalar(0)), - c7 = pset1(ResScalar(0)); - - Index j=0; - for(; j+LhsPacketSize<=cols; j+=LhsPacketSize) - { - RhsPacket b0 = rhs.template load(j,0); - - c0 = pcj.pmadd(lhs.template load(i+0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+1,j),b0,c1); - c2 = pcj.pmadd(lhs.template load(i+2,j),b0,c2); - c3 = pcj.pmadd(lhs.template load(i+3,j),b0,c3); - c4 = pcj.pmadd(lhs.template load(i+4,j),b0,c4); - c5 = pcj.pmadd(lhs.template load(i+5,j),b0,c5); - c6 = pcj.pmadd(lhs.template load(i+6,j),b0,c6); - c7 = pcj.pmadd(lhs.template load(i+7,j),b0,c7); - } - ResScalar cc0 = predux(c0); - ResScalar cc1 = predux(c1); - ResScalar cc2 = predux(c2); - ResScalar cc3 = predux(c3); - ResScalar cc4 = predux(c4); - ResScalar cc5 = predux(c5); - ResScalar cc6 = predux(c6); - ResScalar cc7 = predux(c7); - for(; j(ResScalar(0)), - c1 = pset1(ResScalar(0)), - c2 = pset1(ResScalar(0)), - c3 = pset1(ResScalar(0)); - - Index j=0; - for(; j+LhsPacketSize<=cols; j+=LhsPacketSize) - { - RhsPacket b0 = rhs.template load(j,0); - - c0 = pcj.pmadd(lhs.template load(i+0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+1,j),b0,c1); - c2 = pcj.pmadd(lhs.template load(i+2,j),b0,c2); - c3 = pcj.pmadd(lhs.template load(i+3,j),b0,c3); - } - ResScalar cc0 = predux(c0); - ResScalar cc1 = predux(c1); - ResScalar cc2 = predux(c2); - ResScalar cc3 = predux(c3); - for(; j(ResScalar(0)), - c1 = pset1(ResScalar(0)); - - Index j=0; - for(; j+LhsPacketSize<=cols; j+=LhsPacketSize) - { - RhsPacket b0 = rhs.template load(j,0); - - c0 = pcj.pmadd(lhs.template load(i+0,j),b0,c0); - c1 = pcj.pmadd(lhs.template load(i+1,j),b0,c1); - } - ResScalar cc0 = predux(c0); - ResScalar cc1 = predux(c1); - for(; j(ResScalar(0)); - Index j=0; - for(; j+LhsPacketSize<=cols; j+=LhsPacketSize) - { - RhsPacket b0 = rhs.template load(j,0); - c0 = pcj.pmadd(lhs.template load(i,j),b0,c0); - } - ResScalar cc0 = predux(c0); - for(; j and std::complex types -**********************************************************************/ - -// gemv specialization - -template -struct general_matrix_vector_product_gemv; - -#define EIGEN_BLAS_GEMV_SPECIALIZE(Scalar) \ -template \ -struct general_matrix_vector_product,ColMajor,ConjugateLhs,Scalar,const_blas_data_mapper,ConjugateRhs,Specialized> { \ -static void run( \ - Index rows, Index cols, \ - const const_blas_data_mapper &lhs, \ - const const_blas_data_mapper &rhs, \ - Scalar* res, Index resIncr, Scalar alpha) \ -{ \ - if (ConjugateLhs) { \ - general_matrix_vector_product,ColMajor,ConjugateLhs,Scalar,const_blas_data_mapper,ConjugateRhs,BuiltIn>::run( \ - rows, cols, lhs, rhs, res, resIncr, alpha); \ - } else { \ - general_matrix_vector_product_gemv::run( \ - rows, cols, lhs.data(), lhs.stride(), rhs.data(), rhs.stride(), res, resIncr, alpha); \ - } \ -} \ -}; \ -template \ -struct general_matrix_vector_product,RowMajor,ConjugateLhs,Scalar,const_blas_data_mapper,ConjugateRhs,Specialized> { \ -static void run( \ - Index rows, Index cols, \ - const const_blas_data_mapper &lhs, \ - const const_blas_data_mapper &rhs, \ - Scalar* res, Index resIncr, Scalar alpha) \ -{ \ - general_matrix_vector_product_gemv::run( \ - rows, cols, lhs.data(), lhs.stride(), rhs.data(), rhs.stride(), res, resIncr, alpha); \ -} \ -}; \ - -EIGEN_BLAS_GEMV_SPECIALIZE(double) -EIGEN_BLAS_GEMV_SPECIALIZE(float) -EIGEN_BLAS_GEMV_SPECIALIZE(dcomplex) -EIGEN_BLAS_GEMV_SPECIALIZE(scomplex) - -#define EIGEN_BLAS_GEMV_SPECIALIZATION(EIGTYPE,BLASTYPE,BLASFUNC) \ -template \ -struct general_matrix_vector_product_gemv \ -{ \ -typedef Matrix GEMVVector;\ -\ -static void run( \ - Index rows, Index cols, \ - const EIGTYPE* lhs, Index lhsStride, \ - const EIGTYPE* rhs, Index rhsIncr, \ - EIGTYPE* res, Index resIncr, EIGTYPE alpha) \ -{ \ - BlasIndex m=convert_index(rows), n=convert_index(cols), \ - lda=convert_index(lhsStride), incx=convert_index(rhsIncr), incy=convert_index(resIncr); \ - const EIGTYPE beta(1); \ - const EIGTYPE *x_ptr; \ - char trans=(LhsStorageOrder==ColMajor) ? 'N' : (ConjugateLhs) ? 'C' : 'T'; \ - if (LhsStorageOrder==RowMajor) { \ - m = convert_index(cols); \ - n = convert_index(rows); \ - }\ - GEMVVector x_tmp; \ - if (ConjugateRhs) { \ - Map > map_x(rhs,cols,1,InnerStride<>(incx)); \ - x_tmp=map_x.conjugate(); \ - x_ptr=x_tmp.data(); \ - incx=1; \ - } else x_ptr=rhs; \ - BLASFUNC(&trans, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)lhs, &lda, (const BLASTYPE*)x_ptr, &incx, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &incy); \ -}\ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_GEMV_SPECIALIZATION(double, double, dgemv) -EIGEN_BLAS_GEMV_SPECIALIZATION(float, float, sgemv) -EIGEN_BLAS_GEMV_SPECIALIZATION(dcomplex, MKL_Complex16, zgemv) -EIGEN_BLAS_GEMV_SPECIALIZATION(scomplex, MKL_Complex8 , cgemv) -#else -EIGEN_BLAS_GEMV_SPECIALIZATION(double, double, dgemv_) -EIGEN_BLAS_GEMV_SPECIALIZATION(float, float, sgemv_) -EIGEN_BLAS_GEMV_SPECIALIZATION(dcomplex, double, zgemv_) -EIGEN_BLAS_GEMV_SPECIALIZATION(scomplex, float, cgemv_) -#endif - -} // end namespase internal - -} // end namespace Eigen - -#endif // EIGEN_GENERAL_MATRIX_VECTOR_BLAS_H diff --git a/Eigen/src/Core/products/Parallelizer.h b/Eigen/src/Core/products/Parallelizer.h deleted file mode 100644 index c2f084c82..000000000 --- a/Eigen/src/Core/products/Parallelizer.h +++ /dev/null @@ -1,163 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PARALLELIZER_H -#define EIGEN_PARALLELIZER_H - -namespace Eigen { - -namespace internal { - -/** \internal */ -inline void manage_multi_threading(Action action, int* v) -{ - static EIGEN_UNUSED int m_maxThreads = -1; - - if(action==SetAction) - { - eigen_internal_assert(v!=0); - m_maxThreads = *v; - } - else if(action==GetAction) - { - eigen_internal_assert(v!=0); - #ifdef EIGEN_HAS_OPENMP - if(m_maxThreads>0) - *v = m_maxThreads; - else - *v = omp_get_max_threads(); - #else - *v = 1; - #endif - } - else - { - eigen_internal_assert(false); - } -} - -} - -/** Must be call first when calling Eigen from multiple threads */ -inline void initParallel() -{ - int nbt; - internal::manage_multi_threading(GetAction, &nbt); - std::ptrdiff_t l1, l2, l3; - internal::manage_caching_sizes(GetAction, &l1, &l2, &l3); -} - -/** \returns the max number of threads reserved for Eigen - * \sa setNbThreads */ -inline int nbThreads() -{ - int ret; - internal::manage_multi_threading(GetAction, &ret); - return ret; -} - -/** Sets the max number of threads reserved for Eigen - * \sa nbThreads */ -inline void setNbThreads(int v) -{ - internal::manage_multi_threading(SetAction, &v); -} - -namespace internal { - -template struct GemmParallelInfo -{ - GemmParallelInfo() : sync(-1), users(0), lhs_start(0), lhs_length(0) {} - - Index volatile sync; - int volatile users; - - Index lhs_start; - Index lhs_length; -}; - -template -void parallelize_gemm(const Functor& func, Index rows, Index cols, Index depth, bool transpose) -{ - // TODO when EIGEN_USE_BLAS is defined, - // we should still enable OMP for other scalar types -#if !(defined (EIGEN_HAS_OPENMP)) || defined (EIGEN_USE_BLAS) - // FIXME the transpose variable is only needed to properly split - // the matrix product when multithreading is enabled. This is a temporary - // fix to support row-major destination matrices. This whole - // parallelizer mechanism has to be redisigned anyway. - EIGEN_UNUSED_VARIABLE(depth); - EIGEN_UNUSED_VARIABLE(transpose); - func(0,rows, 0,cols); -#else - - // Dynamically check whether we should enable or disable OpenMP. - // The conditions are: - // - the max number of threads we can create is greater than 1 - // - we are not already in a parallel code - // - the sizes are large enough - - // compute the maximal number of threads from the size of the product: - // This first heuristic takes into account that the product kernel is fully optimized when working with nr columns at once. - Index size = transpose ? rows : cols; - Index pb_max_threads = std::max(1,size / Functor::Traits::nr); - - // compute the maximal number of threads from the total amount of work: - double work = static_cast(rows) * static_cast(cols) * - static_cast(depth); - double kMinTaskSize = 50000; // FIXME improve this heuristic. - pb_max_threads = std::max(1, std::min(pb_max_threads, work / kMinTaskSize)); - - // compute the number of threads we are going to use - Index threads = std::min(nbThreads(), pb_max_threads); - - // if multi-threading is explicitely disabled, not useful, or if we already are in a parallel session, - // then abort multi-threading - // FIXME omp_get_num_threads()>1 only works for openmp, what if the user does not use openmp? - if((!Condition) || (threads==1) || (omp_get_num_threads()>1)) - return func(0,rows, 0,cols); - - Eigen::initParallel(); - func.initParallelSession(threads); - - if(transpose) - std::swap(rows,cols); - - ei_declare_aligned_stack_constructed_variable(GemmParallelInfo,info,threads,0); - - #pragma omp parallel num_threads(threads) - { - Index i = omp_get_thread_num(); - // Note that the actual number of threads might be lower than the number of request ones. - Index actual_threads = omp_get_num_threads(); - - Index blockCols = (cols / actual_threads) & ~Index(0x3); - Index blockRows = (rows / actual_threads); - blockRows = (blockRows/Functor::Traits::mr)*Functor::Traits::mr; - - Index r0 = i*blockRows; - Index actualBlockRows = (i+1==actual_threads) ? rows-r0 : blockRows; - - Index c0 = i*blockCols; - Index actualBlockCols = (i+1==actual_threads) ? cols-c0 : blockCols; - - info[i].lhs_start = r0; - info[i].lhs_length = actualBlockRows; - - if(transpose) func(c0, actualBlockCols, 0, rows, info); - else func(0, rows, c0, actualBlockCols, info); - } -#endif -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PARALLELIZER_H diff --git a/Eigen/src/Core/products/SelfadjointMatrixMatrix.h b/Eigen/src/Core/products/SelfadjointMatrixMatrix.h deleted file mode 100644 index da6f82abc..000000000 --- a/Eigen/src/Core/products/SelfadjointMatrixMatrix.h +++ /dev/null @@ -1,521 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFADJOINT_MATRIX_MATRIX_H -#define EIGEN_SELFADJOINT_MATRIX_MATRIX_H - -namespace Eigen { - -namespace internal { - -// pack a selfadjoint block diagonal for use with the gebp_kernel -template -struct symm_pack_lhs -{ - template inline - void pack(Scalar* blockA, const const_blas_data_mapper& lhs, Index cols, Index i, Index& count) - { - // normal copy - for(Index k=0; k::size }; - const_blas_data_mapper lhs(_lhs,lhsStride); - Index count = 0; - //Index peeled_mc3 = (rows/Pack1)*Pack1; - - const Index peeled_mc3 = Pack1>=3*PacketSize ? (rows/(3*PacketSize))*(3*PacketSize) : 0; - const Index peeled_mc2 = Pack1>=2*PacketSize ? peeled_mc3+((rows-peeled_mc3)/(2*PacketSize))*(2*PacketSize) : 0; - const Index peeled_mc1 = Pack1>=1*PacketSize ? (rows/(1*PacketSize))*(1*PacketSize) : 0; - - if(Pack1>=3*PacketSize) - for(Index i=0; i(blockA, lhs, cols, i, count); - - if(Pack1>=2*PacketSize) - for(Index i=peeled_mc3; i(blockA, lhs, cols, i, count); - - if(Pack1>=1*PacketSize) - for(Index i=peeled_mc2; i(blockA, lhs, cols, i, count); - - // do the same with mr==1 - for(Index i=peeled_mc1; i -struct symm_pack_rhs -{ - enum { PacketSize = packet_traits::size }; - void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2) - { - Index end_k = k2 + rows; - Index count = 0; - const_blas_data_mapper rhs(_rhs,rhsStride); - Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0; - Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; - - // first part: normal case - for(Index j2=0; j2=4) - { - blockB[count+2] = rhs(k,j2+2); - blockB[count+3] = rhs(k,j2+3); - } - if (nr>=8) - { - blockB[count+4] = rhs(k,j2+4); - blockB[count+5] = rhs(k,j2+5); - blockB[count+6] = rhs(k,j2+6); - blockB[count+7] = rhs(k,j2+7); - } - count += nr; - } - } - - // second part: diagonal block - Index end8 = nr>=8 ? (std::min)(k2+rows,packet_cols8) : k2; - if(nr>=8) - { - for(Index j2=k2; j2=4) - { - for(Index j2=end8; j2<(std::min)(k2+rows,packet_cols4); j2+=4) - { - // again we can split vertically in three different parts (transpose, symmetric, normal) - // transpose - for(Index k=k2; k=8) - { - for(Index j2=k2+rows; j2=4) - { - for(Index j2=(std::max)(packet_cols8,k2+rows); j2 the same with nr==1) - for(Index j2=packet_cols4; j2 -struct product_selfadjoint_matrix; - -template -struct product_selfadjoint_matrix -{ - - static EIGEN_STRONG_INLINE void run( - Index rows, Index cols, - const Scalar* lhs, Index lhsStride, - const Scalar* rhs, Index rhsStride, - Scalar* res, Index resStride, - const Scalar& alpha, level3_blocking& blocking) - { - product_selfadjoint_matrix::IsComplex && EIGEN_LOGICAL_XOR(RhsSelfAdjoint,ConjugateRhs), - EIGEN_LOGICAL_XOR(LhsSelfAdjoint,LhsStorageOrder==RowMajor) ? ColMajor : RowMajor, - LhsSelfAdjoint, NumTraits::IsComplex && EIGEN_LOGICAL_XOR(LhsSelfAdjoint,ConjugateLhs), - ColMajor> - ::run(cols, rows, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking); - } -}; - -template -struct product_selfadjoint_matrix -{ - - static EIGEN_DONT_INLINE void run( - Index rows, Index cols, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* res, Index resStride, - const Scalar& alpha, level3_blocking& blocking); -}; - -template -EIGEN_DONT_INLINE void product_selfadjoint_matrix::run( - Index rows, Index cols, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* _res, Index resStride, - const Scalar& alpha, level3_blocking& blocking) - { - Index size = rows; - - typedef gebp_traits Traits; - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper LhsTransposeMapper; - typedef const_blas_data_mapper RhsMapper; - typedef blas_data_mapper ResMapper; - LhsMapper lhs(_lhs,lhsStride); - LhsTransposeMapper lhs_transpose(_lhs,lhsStride); - RhsMapper rhs(_rhs,rhsStride); - ResMapper res(_res, resStride); - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction - // kc must be smaller than mc - kc = (std::min)(kc,mc); - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*cols; - ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB()); - - gebp_kernel gebp_kernel; - symm_pack_lhs pack_lhs; - gemm_pack_rhs pack_rhs; - gemm_pack_lhs pack_lhs_transposed; - - for(Index k2=0; k2 transposed packed copy - // 2 - the diagonal block => special packed copy - // 3 - the panel below the diagonal block => generic packed copy - for(Index i2=0; i2() - (blockA, lhs.getSubMapper(i2, k2), actual_kc, actual_mc); - - gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha); - } - } - } - -// matrix * selfadjoint product -template -struct product_selfadjoint_matrix -{ - - static EIGEN_DONT_INLINE void run( - Index rows, Index cols, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* res, Index resStride, - const Scalar& alpha, level3_blocking& blocking); -}; - -template -EIGEN_DONT_INLINE void product_selfadjoint_matrix::run( - Index rows, Index cols, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* _res, Index resStride, - const Scalar& alpha, level3_blocking& blocking) - { - Index size = cols; - - typedef gebp_traits Traits; - - typedef const_blas_data_mapper LhsMapper; - typedef blas_data_mapper ResMapper; - LhsMapper lhs(_lhs,lhsStride); - ResMapper res(_res,resStride); - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*cols; - ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB()); - - gebp_kernel gebp_kernel; - gemm_pack_lhs pack_lhs; - symm_pack_rhs pack_rhs; - - for(Index k2=0; k2 GEPP - for(Index i2=0; i2 -struct selfadjoint_product_impl -{ - typedef typename Product::Scalar Scalar; - - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; - - enum { - LhsIsUpper = (LhsMode&(Upper|Lower))==Upper, - LhsIsSelfAdjoint = (LhsMode&SelfAdjoint)==SelfAdjoint, - RhsIsUpper = (RhsMode&(Upper|Lower))==Upper, - RhsIsSelfAdjoint = (RhsMode&SelfAdjoint)==SelfAdjoint - }; - - template - static void run(Dest &dst, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha) - { - eigen_assert(dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols()); - - typename internal::add_const_on_value_type::type lhs = LhsBlasTraits::extract(a_lhs); - typename internal::add_const_on_value_type::type rhs = RhsBlasTraits::extract(a_rhs); - - Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) - * RhsBlasTraits::extractScalarFactor(a_rhs); - - typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar, - Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxColsAtCompileTime,1> BlockingType; - - BlockingType blocking(lhs.rows(), rhs.cols(), lhs.cols(), 1, false); - - internal::product_selfadjoint_matrix::Flags &RowMajorBit) ? RowMajor : ColMajor, LhsIsSelfAdjoint, - NumTraits::IsComplex && EIGEN_LOGICAL_XOR(LhsIsUpper,bool(LhsBlasTraits::NeedToConjugate)), - EIGEN_LOGICAL_XOR(RhsIsUpper,internal::traits::Flags &RowMajorBit) ? RowMajor : ColMajor, RhsIsSelfAdjoint, - NumTraits::IsComplex && EIGEN_LOGICAL_XOR(RhsIsUpper,bool(RhsBlasTraits::NeedToConjugate)), - internal::traits::Flags&RowMajorBit ? RowMajor : ColMajor> - ::run( - lhs.rows(), rhs.cols(), // sizes - &lhs.coeffRef(0,0), lhs.outerStride(), // lhs info - &rhs.coeffRef(0,0), rhs.outerStride(), // rhs info - &dst.coeffRef(0,0), dst.outerStride(), // result info - actualAlpha, blocking // alpha - ); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINT_MATRIX_MATRIX_H diff --git a/Eigen/src/Core/products/SelfadjointMatrixMatrix_BLAS.h b/Eigen/src/Core/products/SelfadjointMatrixMatrix_BLAS.h deleted file mode 100644 index 9a5318507..000000000 --- a/Eigen/src/Core/products/SelfadjointMatrixMatrix_BLAS.h +++ /dev/null @@ -1,287 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -// - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * Self adjoint matrix * matrix product functionality based on ?SYMM/?HEMM. - ******************************************************************************** -*/ - -#ifndef EIGEN_SELFADJOINT_MATRIX_MATRIX_BLAS_H -#define EIGEN_SELFADJOINT_MATRIX_MATRIX_BLAS_H - -namespace Eigen { - -namespace internal { - - -/* Optimized selfadjoint matrix * matrix (?SYMM/?HEMM) product */ - -#define EIGEN_BLAS_SYMM_L(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \ -template \ -struct product_selfadjoint_matrix \ -{\ -\ - static void run( \ - Index rows, Index cols, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, level3_blocking& /*blocking*/) \ - { \ - char side='L', uplo='L'; \ - BlasIndex m, n, lda, ldb, ldc; \ - const EIGTYPE *a, *b; \ - EIGTYPE beta(1); \ - MatrixX##EIGPREFIX b_tmp; \ -\ -/* Set transpose options */ \ -/* Set m, n, k */ \ - m = convert_index(rows); \ - n = convert_index(cols); \ -\ -/* Set lda, ldb, ldc */ \ - lda = convert_index(lhsStride); \ - ldb = convert_index(rhsStride); \ - ldc = convert_index(resStride); \ -\ -/* Set a, b, c */ \ - if (LhsStorageOrder==RowMajor) uplo='U'; \ - a = _lhs; \ -\ - if (RhsStorageOrder==RowMajor) { \ - Map > rhs(_rhs,n,m,OuterStride<>(rhsStride)); \ - b_tmp = rhs.adjoint(); \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ - } else b = _rhs; \ -\ - BLASFUNC(&side, &uplo, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)b, &ldb, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &ldc); \ -\ - } \ -}; - - -#define EIGEN_BLAS_HEMM_L(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \ -template \ -struct product_selfadjoint_matrix \ -{\ - static void run( \ - Index rows, Index cols, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, level3_blocking& /*blocking*/) \ - { \ - char side='L', uplo='L'; \ - BlasIndex m, n, lda, ldb, ldc; \ - const EIGTYPE *a, *b; \ - EIGTYPE beta(1); \ - MatrixX##EIGPREFIX b_tmp; \ - Matrix a_tmp; \ -\ -/* Set transpose options */ \ -/* Set m, n, k */ \ - m = convert_index(rows); \ - n = convert_index(cols); \ -\ -/* Set lda, ldb, ldc */ \ - lda = convert_index(lhsStride); \ - ldb = convert_index(rhsStride); \ - ldc = convert_index(resStride); \ -\ -/* Set a, b, c */ \ - if (((LhsStorageOrder==ColMajor) && ConjugateLhs) || ((LhsStorageOrder==RowMajor) && (!ConjugateLhs))) { \ - Map, 0, OuterStride<> > lhs(_lhs,m,m,OuterStride<>(lhsStride)); \ - a_tmp = lhs.conjugate(); \ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else a = _lhs; \ - if (LhsStorageOrder==RowMajor) uplo='U'; \ -\ - if (RhsStorageOrder==ColMajor && (!ConjugateRhs)) { \ - b = _rhs; } \ - else { \ - if (RhsStorageOrder==ColMajor && ConjugateRhs) { \ - Map > rhs(_rhs,m,n,OuterStride<>(rhsStride)); \ - b_tmp = rhs.conjugate(); \ - } else \ - if (ConjugateRhs) { \ - Map > rhs(_rhs,n,m,OuterStride<>(rhsStride)); \ - b_tmp = rhs.adjoint(); \ - } else { \ - Map > rhs(_rhs,n,m,OuterStride<>(rhsStride)); \ - b_tmp = rhs.transpose(); \ - } \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ - } \ -\ - BLASFUNC(&side, &uplo, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)b, &ldb, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &ldc); \ -\ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_SYMM_L(double, double, d, dsymm) -EIGEN_BLAS_SYMM_L(float, float, f, ssymm) -EIGEN_BLAS_HEMM_L(dcomplex, MKL_Complex16, cd, zhemm) -EIGEN_BLAS_HEMM_L(scomplex, MKL_Complex8, cf, chemm) -#else -EIGEN_BLAS_SYMM_L(double, double, d, dsymm_) -EIGEN_BLAS_SYMM_L(float, float, f, ssymm_) -EIGEN_BLAS_HEMM_L(dcomplex, double, cd, zhemm_) -EIGEN_BLAS_HEMM_L(scomplex, float, cf, chemm_) -#endif - -/* Optimized matrix * selfadjoint matrix (?SYMM/?HEMM) product */ - -#define EIGEN_BLAS_SYMM_R(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \ -template \ -struct product_selfadjoint_matrix \ -{\ -\ - static void run( \ - Index rows, Index cols, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, level3_blocking& /*blocking*/) \ - { \ - char side='R', uplo='L'; \ - BlasIndex m, n, lda, ldb, ldc; \ - const EIGTYPE *a, *b; \ - EIGTYPE beta(1); \ - MatrixX##EIGPREFIX b_tmp; \ -\ -/* Set m, n, k */ \ - m = convert_index(rows); \ - n = convert_index(cols); \ -\ -/* Set lda, ldb, ldc */ \ - lda = convert_index(rhsStride); \ - ldb = convert_index(lhsStride); \ - ldc = convert_index(resStride); \ -\ -/* Set a, b, c */ \ - if (RhsStorageOrder==RowMajor) uplo='U'; \ - a = _rhs; \ -\ - if (LhsStorageOrder==RowMajor) { \ - Map > lhs(_lhs,n,m,OuterStride<>(rhsStride)); \ - b_tmp = lhs.adjoint(); \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ - } else b = _lhs; \ -\ - BLASFUNC(&side, &uplo, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)b, &ldb, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &ldc); \ -\ - } \ -}; - - -#define EIGEN_BLAS_HEMM_R(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \ -template \ -struct product_selfadjoint_matrix \ -{\ - static void run( \ - Index rows, Index cols, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, level3_blocking& /*blocking*/) \ - { \ - char side='R', uplo='L'; \ - BlasIndex m, n, lda, ldb, ldc; \ - const EIGTYPE *a, *b; \ - EIGTYPE beta(1); \ - MatrixX##EIGPREFIX b_tmp; \ - Matrix a_tmp; \ -\ -/* Set m, n, k */ \ - m = convert_index(rows); \ - n = convert_index(cols); \ -\ -/* Set lda, ldb, ldc */ \ - lda = convert_index(rhsStride); \ - ldb = convert_index(lhsStride); \ - ldc = convert_index(resStride); \ -\ -/* Set a, b, c */ \ - if (((RhsStorageOrder==ColMajor) && ConjugateRhs) || ((RhsStorageOrder==RowMajor) && (!ConjugateRhs))) { \ - Map, 0, OuterStride<> > rhs(_rhs,n,n,OuterStride<>(rhsStride)); \ - a_tmp = rhs.conjugate(); \ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else a = _rhs; \ - if (RhsStorageOrder==RowMajor) uplo='U'; \ -\ - if (LhsStorageOrder==ColMajor && (!ConjugateLhs)) { \ - b = _lhs; } \ - else { \ - if (LhsStorageOrder==ColMajor && ConjugateLhs) { \ - Map > lhs(_lhs,m,n,OuterStride<>(lhsStride)); \ - b_tmp = lhs.conjugate(); \ - } else \ - if (ConjugateLhs) { \ - Map > lhs(_lhs,n,m,OuterStride<>(lhsStride)); \ - b_tmp = lhs.adjoint(); \ - } else { \ - Map > lhs(_lhs,n,m,OuterStride<>(lhsStride)); \ - b_tmp = lhs.transpose(); \ - } \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ - } \ -\ - BLASFUNC(&side, &uplo, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)b, &ldb, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &ldc); \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_SYMM_R(double, double, d, dsymm) -EIGEN_BLAS_SYMM_R(float, float, f, ssymm) -EIGEN_BLAS_HEMM_R(dcomplex, MKL_Complex16, cd, zhemm) -EIGEN_BLAS_HEMM_R(scomplex, MKL_Complex8, cf, chemm) -#else -EIGEN_BLAS_SYMM_R(double, double, d, dsymm_) -EIGEN_BLAS_SYMM_R(float, float, f, ssymm_) -EIGEN_BLAS_HEMM_R(dcomplex, double, cd, zhemm_) -EIGEN_BLAS_HEMM_R(scomplex, float, cf, chemm_) -#endif -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINT_MATRIX_MATRIX_BLAS_H diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector.h b/Eigen/src/Core/products/SelfadjointMatrixVector.h deleted file mode 100644 index 3fd180e6c..000000000 --- a/Eigen/src/Core/products/SelfadjointMatrixVector.h +++ /dev/null @@ -1,260 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFADJOINT_MATRIX_VECTOR_H -#define EIGEN_SELFADJOINT_MATRIX_VECTOR_H - -namespace Eigen { - -namespace internal { - -/* Optimized selfadjoint matrix * vector product: - * This algorithm processes 2 columns at onces that allows to both reduce - * the number of load/stores of the result by a factor 2 and to reduce - * the instruction dependency. - */ - -template -struct selfadjoint_matrix_vector_product; - -template -struct selfadjoint_matrix_vector_product - -{ -static EIGEN_DONT_INLINE void run( - Index size, - const Scalar* lhs, Index lhsStride, - const Scalar* rhs, - Scalar* res, - Scalar alpha); -}; - -template -EIGEN_DONT_INLINE void selfadjoint_matrix_vector_product::run( - Index size, - const Scalar* lhs, Index lhsStride, - const Scalar* rhs, - Scalar* res, - Scalar alpha) -{ - typedef typename packet_traits::type Packet; - typedef typename NumTraits::Real RealScalar; - const Index PacketSize = sizeof(Packet)/sizeof(Scalar); - - enum { - IsRowMajor = StorageOrder==RowMajor ? 1 : 0, - IsLower = UpLo == Lower ? 1 : 0, - FirstTriangular = IsRowMajor == IsLower - }; - - conj_helper::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, IsRowMajor), ConjugateRhs> cj0; - conj_helper::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> cj1; - conj_helper cjd; - - conj_helper::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, IsRowMajor), ConjugateRhs> pcj0; - conj_helper::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> pcj1; - - Scalar cjAlpha = ConjugateRhs ? numext::conj(alpha) : alpha; - - - Index bound = (std::max)(Index(0),size-8) & 0xfffffffe; - if (FirstTriangular) - bound = size - bound; - - for (Index j=FirstTriangular ? bound : 0; - j<(FirstTriangular ? size : bound);j+=2) - { - const Scalar* EIGEN_RESTRICT A0 = lhs + j*lhsStride; - const Scalar* EIGEN_RESTRICT A1 = lhs + (j+1)*lhsStride; - - Scalar t0 = cjAlpha * rhs[j]; - Packet ptmp0 = pset1(t0); - Scalar t1 = cjAlpha * rhs[j+1]; - Packet ptmp1 = pset1(t1); - - Scalar t2(0); - Packet ptmp2 = pset1(t2); - Scalar t3(0); - Packet ptmp3 = pset1(t3); - - Index starti = FirstTriangular ? 0 : j+2; - Index endi = FirstTriangular ? j : size; - Index alignedStart = (starti) + internal::first_default_aligned(&res[starti], endi-starti); - Index alignedEnd = alignedStart + ((endi-alignedStart)/(PacketSize))*(PacketSize); - - res[j] += cjd.pmul(numext::real(A0[j]), t0); - res[j+1] += cjd.pmul(numext::real(A1[j+1]), t1); - if(FirstTriangular) - { - res[j] += cj0.pmul(A1[j], t1); - t3 += cj1.pmul(A1[j], rhs[j]); - } - else - { - res[j+1] += cj0.pmul(A0[j+1],t0); - t2 += cj1.pmul(A0[j+1], rhs[j+1]); - } - - for (Index i=starti; i huge speed up) - // gcc 4.2 does this optimization automatically. - const Scalar* EIGEN_RESTRICT a0It = A0 + alignedStart; - const Scalar* EIGEN_RESTRICT a1It = A1 + alignedStart; - const Scalar* EIGEN_RESTRICT rhsIt = rhs + alignedStart; - Scalar* EIGEN_RESTRICT resIt = res + alignedStart; - for (Index i=alignedStart; i(a0It); a0It += PacketSize; - Packet A1i = ploadu(a1It); a1It += PacketSize; - Packet Bi = ploadu(rhsIt); rhsIt += PacketSize; // FIXME should be aligned in most cases - Packet Xi = pload (resIt); - - Xi = pcj0.pmadd(A0i,ptmp0, pcj0.pmadd(A1i,ptmp1,Xi)); - ptmp2 = pcj1.pmadd(A0i, Bi, ptmp2); - ptmp3 = pcj1.pmadd(A1i, Bi, ptmp3); - pstore(resIt,Xi); resIt += PacketSize; - } - for (Index i=alignedEnd; i -struct selfadjoint_product_impl -{ - typedef typename Product::Scalar Scalar; - - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; - typedef typename internal::remove_all::type ActualLhsTypeCleaned; - - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; - typedef typename internal::remove_all::type ActualRhsTypeCleaned; - - enum { LhsUpLo = LhsMode&(Upper|Lower) }; - - template - static void run(Dest& dest, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha) - { - typedef typename Dest::Scalar ResScalar; - typedef typename Rhs::Scalar RhsScalar; - typedef Map, EIGEN_PLAIN_ENUM_MIN(AlignedMax,internal::packet_traits::size)> MappedDest; - - eigen_assert(dest.rows()==a_lhs.rows() && dest.cols()==a_rhs.cols()); - - typename internal::add_const_on_value_type::type lhs = LhsBlasTraits::extract(a_lhs); - typename internal::add_const_on_value_type::type rhs = RhsBlasTraits::extract(a_rhs); - - Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) - * RhsBlasTraits::extractScalarFactor(a_rhs); - - enum { - EvalToDest = (Dest::InnerStrideAtCompileTime==1), - UseRhs = (ActualRhsTypeCleaned::InnerStrideAtCompileTime==1) - }; - - internal::gemv_static_vector_if static_dest; - internal::gemv_static_vector_if static_rhs; - - ei_declare_aligned_stack_constructed_variable(ResScalar,actualDestPtr,dest.size(), - EvalToDest ? dest.data() : static_dest.data()); - - ei_declare_aligned_stack_constructed_variable(RhsScalar,actualRhsPtr,rhs.size(), - UseRhs ? const_cast(rhs.data()) : static_rhs.data()); - - if(!EvalToDest) - { - #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN - Index size = dest.size(); - EIGEN_DENSE_STORAGE_CTOR_PLUGIN - #endif - MappedDest(actualDestPtr, dest.size()) = dest; - } - - if(!UseRhs) - { - #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN - Index size = rhs.size(); - EIGEN_DENSE_STORAGE_CTOR_PLUGIN - #endif - Map(actualRhsPtr, rhs.size()) = rhs; - } - - - internal::selfadjoint_matrix_vector_product::Flags&RowMajorBit) ? RowMajor : ColMajor, - int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run - ( - lhs.rows(), // size - &lhs.coeffRef(0,0), lhs.outerStride(), // lhs info - actualRhsPtr, // rhs info - actualDestPtr, // result info - actualAlpha // scale factor - ); - - if(!EvalToDest) - dest = MappedDest(actualDestPtr, dest.size()); - } -}; - -template -struct selfadjoint_product_impl -{ - typedef typename Product::Scalar Scalar; - enum { RhsUpLo = RhsMode&(Upper|Lower) }; - - template - static void run(Dest& dest, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha) - { - // let's simply transpose the product - Transpose destT(dest); - selfadjoint_product_impl, int(RhsUpLo)==Upper ? Lower : Upper, false, - Transpose, 0, true>::run(destT, a_rhs.transpose(), a_lhs.transpose(), alpha); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINT_MATRIX_VECTOR_H diff --git a/Eigen/src/Core/products/SelfadjointMatrixVector_BLAS.h b/Eigen/src/Core/products/SelfadjointMatrixVector_BLAS.h deleted file mode 100644 index 1238345e3..000000000 --- a/Eigen/src/Core/products/SelfadjointMatrixVector_BLAS.h +++ /dev/null @@ -1,118 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * Selfadjoint matrix-vector product functionality based on ?SYMV/HEMV. - ******************************************************************************** -*/ - -#ifndef EIGEN_SELFADJOINT_MATRIX_VECTOR_BLAS_H -#define EIGEN_SELFADJOINT_MATRIX_VECTOR_BLAS_H - -namespace Eigen { - -namespace internal { - -/********************************************************************** -* This file implements selfadjoint matrix-vector multiplication using BLAS -**********************************************************************/ - -// symv/hemv specialization - -template -struct selfadjoint_matrix_vector_product_symv : - selfadjoint_matrix_vector_product {}; - -#define EIGEN_BLAS_SYMV_SPECIALIZE(Scalar) \ -template \ -struct selfadjoint_matrix_vector_product { \ -static void run( \ - Index size, const Scalar* lhs, Index lhsStride, \ - const Scalar* _rhs, Scalar* res, Scalar alpha) { \ - enum {\ - IsColMajor = StorageOrder==ColMajor \ - }; \ - if (IsColMajor == ConjugateLhs) {\ - selfadjoint_matrix_vector_product::run( \ - size, lhs, lhsStride, _rhs, res, alpha); \ - } else {\ - selfadjoint_matrix_vector_product_symv::run( \ - size, lhs, lhsStride, _rhs, res, alpha); \ - }\ - } \ -}; \ - -EIGEN_BLAS_SYMV_SPECIALIZE(double) -EIGEN_BLAS_SYMV_SPECIALIZE(float) -EIGEN_BLAS_SYMV_SPECIALIZE(dcomplex) -EIGEN_BLAS_SYMV_SPECIALIZE(scomplex) - -#define EIGEN_BLAS_SYMV_SPECIALIZATION(EIGTYPE,BLASTYPE,BLASFUNC) \ -template \ -struct selfadjoint_matrix_vector_product_symv \ -{ \ -typedef Matrix SYMVVector;\ -\ -static void run( \ -Index size, const EIGTYPE* lhs, Index lhsStride, \ -const EIGTYPE* _rhs, EIGTYPE* res, EIGTYPE alpha) \ -{ \ - enum {\ - IsRowMajor = StorageOrder==RowMajor ? 1 : 0, \ - IsLower = UpLo == Lower ? 1 : 0 \ - }; \ - BlasIndex n=convert_index(size), lda=convert_index(lhsStride), incx=1, incy=1; \ - EIGTYPE beta(1); \ - const EIGTYPE *x_ptr; \ - char uplo=(IsRowMajor) ? (IsLower ? 'U' : 'L') : (IsLower ? 'L' : 'U'); \ - SYMVVector x_tmp; \ - if (ConjugateRhs) { \ - Map map_x(_rhs,size,1); \ - x_tmp=map_x.conjugate(); \ - x_ptr=x_tmp.data(); \ - } else x_ptr=_rhs; \ - BLASFUNC(&uplo, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)lhs, &lda, (const BLASTYPE*)x_ptr, &incx, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)res, &incy); \ -}\ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_SYMV_SPECIALIZATION(double, double, dsymv) -EIGEN_BLAS_SYMV_SPECIALIZATION(float, float, ssymv) -EIGEN_BLAS_SYMV_SPECIALIZATION(dcomplex, MKL_Complex16, zhemv) -EIGEN_BLAS_SYMV_SPECIALIZATION(scomplex, MKL_Complex8, chemv) -#else -EIGEN_BLAS_SYMV_SPECIALIZATION(double, double, dsymv_) -EIGEN_BLAS_SYMV_SPECIALIZATION(float, float, ssymv_) -EIGEN_BLAS_SYMV_SPECIALIZATION(dcomplex, double, zhemv_) -EIGEN_BLAS_SYMV_SPECIALIZATION(scomplex, float, chemv_) -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINT_MATRIX_VECTOR_BLAS_H diff --git a/Eigen/src/Core/products/SelfadjointProduct.h b/Eigen/src/Core/products/SelfadjointProduct.h deleted file mode 100644 index 39c5b59ff..000000000 --- a/Eigen/src/Core/products/SelfadjointProduct.h +++ /dev/null @@ -1,133 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFADJOINT_PRODUCT_H -#define EIGEN_SELFADJOINT_PRODUCT_H - -/********************************************************************** -* This file implements a self adjoint product: C += A A^T updating only -* half of the selfadjoint matrix C. -* It corresponds to the level 3 SYRK and level 2 SYR Blas routines. -**********************************************************************/ - -namespace Eigen { - - -template -struct selfadjoint_rank1_update -{ - static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha) - { - internal::conj_if cj; - typedef Map > OtherMap; - typedef typename internal::conditional::type ConjLhsType; - for (Index i=0; i >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1))) - += (alpha * cj(vecY[i])) * ConjLhsType(OtherMap(vecX+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : (i+1))); - } - } -}; - -template -struct selfadjoint_rank1_update -{ - static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha) - { - selfadjoint_rank1_update::run(size,mat,stride,vecY,vecX,alpha); - } -}; - -template -struct selfadjoint_product_selector; - -template -struct selfadjoint_product_selector -{ - static void run(MatrixType& mat, const OtherType& other, const typename MatrixType::Scalar& alpha) - { - typedef typename MatrixType::Scalar Scalar; - typedef internal::blas_traits OtherBlasTraits; - typedef typename OtherBlasTraits::DirectLinearAccessType ActualOtherType; - typedef typename internal::remove_all::type _ActualOtherType; - typename internal::add_const_on_value_type::type actualOther = OtherBlasTraits::extract(other.derived()); - - Scalar actualAlpha = alpha * OtherBlasTraits::extractScalarFactor(other.derived()); - - enum { - StorageOrder = (internal::traits::Flags&RowMajorBit) ? RowMajor : ColMajor, - UseOtherDirectly = _ActualOtherType::InnerStrideAtCompileTime==1 - }; - internal::gemv_static_vector_if static_other; - - ei_declare_aligned_stack_constructed_variable(Scalar, actualOtherPtr, other.size(), - (UseOtherDirectly ? const_cast(actualOther.data()) : static_other.data())); - - if(!UseOtherDirectly) - Map(actualOtherPtr, actualOther.size()) = actualOther; - - selfadjoint_rank1_update::IsComplex, - (!OtherBlasTraits::NeedToConjugate) && NumTraits::IsComplex> - ::run(other.size(), mat.data(), mat.outerStride(), actualOtherPtr, actualOtherPtr, actualAlpha); - } -}; - -template -struct selfadjoint_product_selector -{ - static void run(MatrixType& mat, const OtherType& other, const typename MatrixType::Scalar& alpha) - { - typedef typename MatrixType::Scalar Scalar; - typedef internal::blas_traits OtherBlasTraits; - typedef typename OtherBlasTraits::DirectLinearAccessType ActualOtherType; - typedef typename internal::remove_all::type _ActualOtherType; - typename internal::add_const_on_value_type::type actualOther = OtherBlasTraits::extract(other.derived()); - - Scalar actualAlpha = alpha * OtherBlasTraits::extractScalarFactor(other.derived()); - - enum { - IsRowMajor = (internal::traits::Flags&RowMajorBit) ? 1 : 0, - OtherIsRowMajor = _ActualOtherType::Flags&RowMajorBit ? 1 : 0 - }; - - Index size = mat.cols(); - Index depth = actualOther.cols(); - - typedef internal::gemm_blocking_space BlockingType; - - BlockingType blocking(size, size, depth, 1, false); - - - internal::general_matrix_matrix_triangular_product::IsComplex, - Scalar, OtherIsRowMajor ? ColMajor : RowMajor, (!OtherBlasTraits::NeedToConjugate) && NumTraits::IsComplex, - IsRowMajor ? RowMajor : ColMajor, UpLo> - ::run(size, depth, - &actualOther.coeffRef(0,0), actualOther.outerStride(), &actualOther.coeffRef(0,0), actualOther.outerStride(), - mat.data(), mat.outerStride(), actualAlpha, blocking); - } -}; - -// high level API - -template -template -EIGEN_DEVICE_FUNC SelfAdjointView& SelfAdjointView -::rankUpdate(const MatrixBase& u, const Scalar& alpha) -{ - selfadjoint_product_selector::run(_expression().const_cast_derived(), u.derived(), alpha); - - return *this; -} - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINT_PRODUCT_H diff --git a/Eigen/src/Core/products/SelfadjointRank2Update.h b/Eigen/src/Core/products/SelfadjointRank2Update.h deleted file mode 100644 index d395888e5..000000000 --- a/Eigen/src/Core/products/SelfadjointRank2Update.h +++ /dev/null @@ -1,93 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFADJOINTRANK2UPTADE_H -#define EIGEN_SELFADJOINTRANK2UPTADE_H - -namespace Eigen { - -namespace internal { - -/* Optimized selfadjoint matrix += alpha * uv' + conj(alpha)*vu' - * It corresponds to the Level2 syr2 BLAS routine - */ - -template -struct selfadjoint_rank2_update_selector; - -template -struct selfadjoint_rank2_update_selector -{ - static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) - { - const Index size = u.size(); - for (Index i=0; i >(mat+stride*i+i, size-i) += - (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i) - + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i); - } - } -}; - -template -struct selfadjoint_rank2_update_selector -{ - static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) - { - const Index size = u.size(); - for (Index i=0; i >(mat+stride*i, i+1) += - (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.head(i+1) - + (alpha * numext::conj(v.coeff(i))) * u.head(i+1); - } -}; - -template struct conj_expr_if - : conditional::Scalar>,T> > {}; - -} // end namespace internal - -template -template -EIGEN_DEVICE_FUNC SelfAdjointView& SelfAdjointView -::rankUpdate(const MatrixBase& u, const MatrixBase& v, const Scalar& alpha) -{ - typedef internal::blas_traits UBlasTraits; - typedef typename UBlasTraits::DirectLinearAccessType ActualUType; - typedef typename internal::remove_all::type _ActualUType; - typename internal::add_const_on_value_type::type actualU = UBlasTraits::extract(u.derived()); - - typedef internal::blas_traits VBlasTraits; - typedef typename VBlasTraits::DirectLinearAccessType ActualVType; - typedef typename internal::remove_all::type _ActualVType; - typename internal::add_const_on_value_type::type actualV = VBlasTraits::extract(v.derived()); - - // If MatrixType is row major, then we use the routine for lower triangular in the upper triangular case and - // vice versa, and take the complex conjugate of all coefficients and vector entries. - - enum { IsRowMajor = (internal::traits::Flags&RowMajorBit) ? 1 : 0 }; - Scalar actualAlpha = alpha * UBlasTraits::extractScalarFactor(u.derived()) - * numext::conj(VBlasTraits::extractScalarFactor(v.derived())); - if (IsRowMajor) - actualAlpha = numext::conj(actualAlpha); - - typedef typename internal::remove_all::type>::type UType; - typedef typename internal::remove_all::type>::type VType; - internal::selfadjoint_rank2_update_selector - ::run(_expression().const_cast_derived().data(),_expression().outerStride(),UType(actualU),VType(actualV),actualAlpha); - - return *this; -} - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINTRANK2UPTADE_H diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix.h b/Eigen/src/Core/products/TriangularMatrixMatrix.h deleted file mode 100644 index f784507e7..000000000 --- a/Eigen/src/Core/products/TriangularMatrixMatrix.h +++ /dev/null @@ -1,466 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRIANGULAR_MATRIX_MATRIX_H -#define EIGEN_TRIANGULAR_MATRIX_MATRIX_H - -namespace Eigen { - -namespace internal { - -// template -// struct gemm_pack_lhs_triangular -// { -// Matrix::IsComplex && Conjugate> cj; -// const_blas_data_mapper lhs(_lhs,lhsStride); -// int count = 0; -// const int peeled_mc = (rows/mr)*mr; -// for(int i=0; i -struct product_triangular_matrix_matrix; - -template -struct product_triangular_matrix_matrix -{ - static EIGEN_STRONG_INLINE void run( - Index rows, Index cols, Index depth, - const Scalar* lhs, Index lhsStride, - const Scalar* rhs, Index rhsStride, - Scalar* res, Index resStride, - const Scalar& alpha, level3_blocking& blocking) - { - product_triangular_matrix_matrix - ::run(cols, rows, depth, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking); - } -}; - -// implements col-major += alpha * op(triangular) * op(general) -template -struct product_triangular_matrix_matrix -{ - - typedef gebp_traits Traits; - enum { - SmallPanelWidth = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr), - IsLower = (Mode&Lower) == Lower, - SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1 - }; - - static EIGEN_DONT_INLINE void run( - Index _rows, Index _cols, Index _depth, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* res, Index resStride, - const Scalar& alpha, level3_blocking& blocking); -}; - -template -EIGEN_DONT_INLINE void product_triangular_matrix_matrix::run( - Index _rows, Index _cols, Index _depth, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* _res, Index resStride, - const Scalar& alpha, level3_blocking& blocking) - { - // strip zeros - Index diagSize = (std::min)(_rows,_depth); - Index rows = IsLower ? _rows : diagSize; - Index depth = IsLower ? diagSize : _depth; - Index cols = _cols; - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - typedef blas_data_mapper ResMapper; - LhsMapper lhs(_lhs,lhsStride); - RhsMapper rhs(_rhs,rhsStride); - ResMapper res(_res, resStride); - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction - // The small panel size must not be larger than blocking size. - // Usually this should never be the case because SmallPanelWidth^2 is very small - // compared to L2 cache size, but let's be safe: - Index panelWidth = (std::min)(Index(SmallPanelWidth),(std::min)(kc,mc)); - - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*cols; - - ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB()); - - // To work around an "error: member reference base type 'Matrix<...> - // (Eigen::internal::constructor_without_unaligned_array_assert (*)())' is - // not a structure or union" compilation error in nvcc (tested V8.0.61), - // create a dummy internal::constructor_without_unaligned_array_assert - // object to pass to the Matrix constructor. - internal::constructor_without_unaligned_array_assert a; - Matrix triangularBuffer(a); - triangularBuffer.setZero(); - if((Mode&ZeroDiag)==ZeroDiag) - triangularBuffer.diagonal().setZero(); - else - triangularBuffer.diagonal().setOnes(); - - gebp_kernel gebp_kernel; - gemm_pack_lhs pack_lhs; - gemm_pack_rhs pack_rhs; - - for(Index k2=IsLower ? depth : 0; - IsLower ? k2>0 : k2rows)) - { - actual_kc = rows-k2; - k2 = k2+actual_kc-kc; - } - - pack_rhs(blockB, rhs.getSubMapper(actual_k2,0), actual_kc, cols); - - // the selected lhs's panel has to be split in three different parts: - // 1 - the part which is zero => skip it - // 2 - the diagonal block => special kernel - // 3 - the dense panel below (lower case) or above (upper case) the diagonal block => GEPP - - // the block diagonal, if any: - if(IsLower || actual_k2(actual_kc-k1, panelWidth); - Index lengthTarget = IsLower ? actual_kc-k1-actualPanelWidth : k1; - Index startBlock = actual_k2+k1; - Index blockBOffset = k1; - - // => GEBP with the micro triangular block - // The trick is to pack this micro block while filling the opposite triangular part with zeros. - // To this end we do an extra triangular copy to a small temporary buffer - for (Index k=0;k0) - { - Index startTarget = IsLower ? actual_k2+k1+actualPanelWidth : actual_k2; - - pack_lhs(blockA, lhs.getSubMapper(startTarget,startBlock), actualPanelWidth, lengthTarget); - - gebp_kernel(res.getSubMapper(startTarget, 0), blockA, blockB, - lengthTarget, actualPanelWidth, cols, alpha, - actualPanelWidth, actual_kc, 0, blockBOffset); - } - } - } - // the part below (lower case) or above (upper case) the diagonal => GEPP - { - Index start = IsLower ? k2 : 0; - Index end = IsLower ? rows : (std::min)(actual_k2,rows); - for(Index i2=start; i2() - (blockA, lhs.getSubMapper(i2, actual_k2), actual_kc, actual_mc); - - gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, - actual_kc, cols, alpha, -1, -1, 0, 0); - } - } - } - } - -// implements col-major += alpha * op(general) * op(triangular) -template -struct product_triangular_matrix_matrix -{ - typedef gebp_traits Traits; - enum { - SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr), - IsLower = (Mode&Lower) == Lower, - SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1 - }; - - static EIGEN_DONT_INLINE void run( - Index _rows, Index _cols, Index _depth, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* res, Index resStride, - const Scalar& alpha, level3_blocking& blocking); -}; - -template -EIGEN_DONT_INLINE void product_triangular_matrix_matrix::run( - Index _rows, Index _cols, Index _depth, - const Scalar* _lhs, Index lhsStride, - const Scalar* _rhs, Index rhsStride, - Scalar* _res, Index resStride, - const Scalar& alpha, level3_blocking& blocking) - { - const Index PacketBytes = packet_traits::size*sizeof(Scalar); - // strip zeros - Index diagSize = (std::min)(_cols,_depth); - Index rows = _rows; - Index depth = IsLower ? _depth : diagSize; - Index cols = IsLower ? diagSize : _cols; - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - typedef blas_data_mapper ResMapper; - LhsMapper lhs(_lhs,lhsStride); - RhsMapper rhs(_rhs,rhsStride); - ResMapper res(_res, resStride); - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction - - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*cols+EIGEN_MAX_ALIGN_BYTES/sizeof(Scalar); - - ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB()); - - internal::constructor_without_unaligned_array_assert a; - Matrix triangularBuffer(a); - triangularBuffer.setZero(); - if((Mode&ZeroDiag)==ZeroDiag) - triangularBuffer.diagonal().setZero(); - else - triangularBuffer.diagonal().setOnes(); - - gebp_kernel gebp_kernel; - gemm_pack_lhs pack_lhs; - gemm_pack_rhs pack_rhs; - gemm_pack_rhs pack_rhs_panel; - - for(Index k2=IsLower ? 0 : depth; - IsLower ? k20; - IsLower ? k2+=kc : k2-=kc) - { - Index actual_kc = (std::min)(IsLower ? depth-k2 : k2, kc); - Index actual_k2 = IsLower ? k2 : k2-actual_kc; - - // align blocks with the end of the triangular part for trapezoidal rhs - if(IsLower && (k2cols)) - { - actual_kc = cols-k2; - k2 = actual_k2 + actual_kc - kc; - } - - // remaining size - Index rs = IsLower ? (std::min)(cols,actual_k2) : cols - k2; - // size of the triangular part - Index ts = (IsLower && actual_k2>=cols) ? 0 : actual_kc; - - Scalar* geb = blockB+ts*ts; - geb = geb + internal::first_aligned(geb,PacketBytes/sizeof(Scalar)); - - pack_rhs(geb, rhs.getSubMapper(actual_k2,IsLower ? 0 : k2), actual_kc, rs); - - // pack the triangular part of the rhs padding the unrolled blocks with zeros - if(ts>0) - { - for (Index j2=0; j2(actual_kc-j2, SmallPanelWidth); - Index actual_j2 = actual_k2 + j2; - Index panelOffset = IsLower ? j2+actualPanelWidth : 0; - Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2; - // general part - pack_rhs_panel(blockB+j2*actual_kc, - rhs.getSubMapper(actual_k2+panelOffset, actual_j2), - panelLength, actualPanelWidth, - actual_kc, panelOffset); - - // append the triangular part via a temporary buffer - for (Index j=0;j0) - { - for (Index j2=0; j2(actual_kc-j2, SmallPanelWidth); - Index panelLength = IsLower ? actual_kc-j2 : j2+actualPanelWidth; - Index blockOffset = IsLower ? j2 : 0; - - gebp_kernel(res.getSubMapper(i2, actual_k2 + j2), - blockA, blockB+j2*actual_kc, - actual_mc, panelLength, actualPanelWidth, - alpha, - actual_kc, actual_kc, // strides - blockOffset, blockOffset);// offsets - } - } - gebp_kernel(res.getSubMapper(i2, IsLower ? 0 : k2), - blockA, geb, actual_mc, actual_kc, rs, - alpha, - -1, -1, 0, 0); - } - } - } - -/*************************************************************************** -* Wrapper to product_triangular_matrix_matrix -***************************************************************************/ - -} // end namespace internal - -namespace internal { -template -struct triangular_product_impl -{ - template static void run(Dest& dst, const Lhs &a_lhs, const Rhs &a_rhs, const typename Dest::Scalar& alpha) - { - typedef typename Lhs::Scalar LhsScalar; - typedef typename Rhs::Scalar RhsScalar; - typedef typename Dest::Scalar Scalar; - - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; - typedef typename internal::remove_all::type ActualLhsTypeCleaned; - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; - typedef typename internal::remove_all::type ActualRhsTypeCleaned; - - typename internal::add_const_on_value_type::type lhs = LhsBlasTraits::extract(a_lhs); - typename internal::add_const_on_value_type::type rhs = RhsBlasTraits::extract(a_rhs); - - LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(a_lhs); - RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(a_rhs); - Scalar actualAlpha = alpha * lhs_alpha * rhs_alpha; - - typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar, - Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxColsAtCompileTime,4> BlockingType; - - enum { IsLower = (Mode&Lower) == Lower }; - Index stripedRows = ((!LhsIsTriangular) || (IsLower)) ? lhs.rows() : (std::min)(lhs.rows(),lhs.cols()); - Index stripedCols = ((LhsIsTriangular) || (!IsLower)) ? rhs.cols() : (std::min)(rhs.cols(),rhs.rows()); - Index stripedDepth = LhsIsTriangular ? ((!IsLower) ? lhs.cols() : (std::min)(lhs.cols(),lhs.rows())) - : ((IsLower) ? rhs.rows() : (std::min)(rhs.rows(),rhs.cols())); - - BlockingType blocking(stripedRows, stripedCols, stripedDepth, 1, false); - - internal::product_triangular_matrix_matrix::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate, - (internal::traits::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate, - (internal::traits::Flags&RowMajorBit) ? RowMajor : ColMajor> - ::run( - stripedRows, stripedCols, stripedDepth, // sizes - &lhs.coeffRef(0,0), lhs.outerStride(), // lhs info - &rhs.coeffRef(0,0), rhs.outerStride(), // rhs info - &dst.coeffRef(0,0), dst.outerStride(), // result info - actualAlpha, blocking - ); - - // Apply correction if the diagonal is unit and a scalar factor was nested: - if ((Mode&UnitDiag)==UnitDiag) - { - if (LhsIsTriangular && lhs_alpha!=LhsScalar(1)) - { - Index diagSize = (std::min)(lhs.rows(),lhs.cols()); - dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize); - } - else if ((!LhsIsTriangular) && rhs_alpha!=RhsScalar(1)) - { - Index diagSize = (std::min)(rhs.rows(),rhs.cols()); - dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize); - } - } - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULAR_MATRIX_MATRIX_H diff --git a/Eigen/src/Core/products/TriangularMatrixMatrix_BLAS.h b/Eigen/src/Core/products/TriangularMatrixMatrix_BLAS.h deleted file mode 100644 index a25197ab0..000000000 --- a/Eigen/src/Core/products/TriangularMatrixMatrix_BLAS.h +++ /dev/null @@ -1,315 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * Triangular matrix * matrix product functionality based on ?TRMM. - ******************************************************************************** -*/ - -#ifndef EIGEN_TRIANGULAR_MATRIX_MATRIX_BLAS_H -#define EIGEN_TRIANGULAR_MATRIX_MATRIX_BLAS_H - -namespace Eigen { - -namespace internal { - - -template -struct product_triangular_matrix_matrix_trmm : - product_triangular_matrix_matrix {}; - - -// try to go to BLAS specialization -#define EIGEN_BLAS_TRMM_SPECIALIZE(Scalar, LhsIsTriangular) \ -template \ -struct product_triangular_matrix_matrix { \ - static inline void run(Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride,\ - const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, Scalar alpha, level3_blocking& blocking) { \ - product_triangular_matrix_matrix_trmm::run( \ - _rows, _cols, _depth, _lhs, lhsStride, _rhs, rhsStride, res, resStride, alpha, blocking); \ - } \ -}; - -EIGEN_BLAS_TRMM_SPECIALIZE(double, true) -EIGEN_BLAS_TRMM_SPECIALIZE(double, false) -EIGEN_BLAS_TRMM_SPECIALIZE(dcomplex, true) -EIGEN_BLAS_TRMM_SPECIALIZE(dcomplex, false) -EIGEN_BLAS_TRMM_SPECIALIZE(float, true) -EIGEN_BLAS_TRMM_SPECIALIZE(float, false) -EIGEN_BLAS_TRMM_SPECIALIZE(scomplex, true) -EIGEN_BLAS_TRMM_SPECIALIZE(scomplex, false) - -// implements col-major += alpha * op(triangular) * op(general) -#define EIGEN_BLAS_TRMM_L(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \ -template \ -struct product_triangular_matrix_matrix_trmm \ -{ \ - enum { \ - IsLower = (Mode&Lower) == Lower, \ - SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1, \ - IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \ - IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \ - LowUp = IsLower ? Lower : Upper, \ - conjA = ((LhsStorageOrder==ColMajor) && ConjugateLhs) ? 1 : 0 \ - }; \ -\ - static void run( \ - Index _rows, Index _cols, Index _depth, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, level3_blocking& blocking) \ - { \ - Index diagSize = (std::min)(_rows,_depth); \ - Index rows = IsLower ? _rows : diagSize; \ - Index depth = IsLower ? diagSize : _depth; \ - Index cols = _cols; \ -\ - typedef Matrix MatrixLhs; \ - typedef Matrix MatrixRhs; \ -\ -/* Non-square case - doesn't fit to BLAS ?TRMM. Fall to default triangular product or call BLAS ?GEMM*/ \ - if (rows != depth) { \ -\ - /* FIXME handle mkl_domain_get_max_threads */ \ - /*int nthr = mkl_domain_get_max_threads(EIGEN_BLAS_DOMAIN_BLAS);*/ int nthr = 1;\ -\ - if (((nthr==1) && (((std::max)(rows,depth)-diagSize)/(double)diagSize < 0.5))) { \ - /* Most likely no benefit to call TRMM or GEMM from BLAS */ \ - product_triangular_matrix_matrix::run( \ - _rows, _cols, _depth, _lhs, lhsStride, _rhs, rhsStride, res, resStride, alpha, blocking); \ - /*std::cout << "TRMM_L: A is not square! Go to Eigen TRMM implementation!\n";*/ \ - } else { \ - /* Make sense to call GEMM */ \ - Map > lhsMap(_lhs,rows,depth,OuterStride<>(lhsStride)); \ - MatrixLhs aa_tmp=lhsMap.template triangularView(); \ - BlasIndex aStride = convert_index(aa_tmp.outerStride()); \ - gemm_blocking_space gemm_blocking(_rows,_cols,_depth, 1, true); \ - general_matrix_matrix_product::run( \ - rows, cols, depth, aa_tmp.data(), aStride, _rhs, rhsStride, res, resStride, alpha, gemm_blocking, 0); \ -\ - /*std::cout << "TRMM_L: A is not square! Go to BLAS GEMM implementation! " << nthr<<" \n";*/ \ - } \ - return; \ - } \ - char side = 'L', transa, uplo, diag = 'N'; \ - EIGTYPE *b; \ - const EIGTYPE *a; \ - BlasIndex m, n, lda, ldb; \ -\ -/* Set m, n */ \ - m = convert_index(diagSize); \ - n = convert_index(cols); \ -\ -/* Set trans */ \ - transa = (LhsStorageOrder==RowMajor) ? ((ConjugateLhs) ? 'C' : 'T') : 'N'; \ -\ -/* Set b, ldb */ \ - Map > rhs(_rhs,depth,cols,OuterStride<>(rhsStride)); \ - MatrixX##EIGPREFIX b_tmp; \ -\ - if (ConjugateRhs) b_tmp = rhs.conjugate(); else b_tmp = rhs; \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ -\ -/* Set uplo */ \ - uplo = IsLower ? 'L' : 'U'; \ - if (LhsStorageOrder==RowMajor) uplo = (uplo == 'L') ? 'U' : 'L'; \ -/* Set a, lda */ \ - Map > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \ - MatrixLhs a_tmp; \ -\ - if ((conjA!=0) || (SetDiag==0)) { \ - if (conjA) a_tmp = lhs.conjugate(); else a_tmp = lhs; \ - if (IsZeroDiag) \ - a_tmp.diagonal().setZero(); \ - else if (IsUnitDiag) \ - a_tmp.diagonal().setOnes();\ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else { \ - a = _lhs; \ - lda = convert_index(lhsStride); \ - } \ - /*std::cout << "TRMM_L: A is square! Go to BLAS TRMM implementation! \n";*/ \ -/* call ?trmm*/ \ - BLASFUNC(&side, &uplo, &transa, &diag, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (BLASTYPE*)b, &ldb); \ -\ -/* Add op(a_triangular)*b into res*/ \ - Map > res_tmp(res,rows,cols,OuterStride<>(resStride)); \ - res_tmp=res_tmp+b_tmp; \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_TRMM_L(double, double, d, dtrmm) -EIGEN_BLAS_TRMM_L(dcomplex, MKL_Complex16, cd, ztrmm) -EIGEN_BLAS_TRMM_L(float, float, f, strmm) -EIGEN_BLAS_TRMM_L(scomplex, MKL_Complex8, cf, ctrmm) -#else -EIGEN_BLAS_TRMM_L(double, double, d, dtrmm_) -EIGEN_BLAS_TRMM_L(dcomplex, double, cd, ztrmm_) -EIGEN_BLAS_TRMM_L(float, float, f, strmm_) -EIGEN_BLAS_TRMM_L(scomplex, float, cf, ctrmm_) -#endif - -// implements col-major += alpha * op(general) * op(triangular) -#define EIGEN_BLAS_TRMM_R(EIGTYPE, BLASTYPE, EIGPREFIX, BLASFUNC) \ -template \ -struct product_triangular_matrix_matrix_trmm \ -{ \ - enum { \ - IsLower = (Mode&Lower) == Lower, \ - SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1, \ - IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \ - IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \ - LowUp = IsLower ? Lower : Upper, \ - conjA = ((RhsStorageOrder==ColMajor) && ConjugateRhs) ? 1 : 0 \ - }; \ -\ - static void run( \ - Index _rows, Index _cols, Index _depth, \ - const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsStride, \ - EIGTYPE* res, Index resStride, \ - EIGTYPE alpha, level3_blocking& blocking) \ - { \ - Index diagSize = (std::min)(_cols,_depth); \ - Index rows = _rows; \ - Index depth = IsLower ? _depth : diagSize; \ - Index cols = IsLower ? diagSize : _cols; \ -\ - typedef Matrix MatrixLhs; \ - typedef Matrix MatrixRhs; \ -\ -/* Non-square case - doesn't fit to BLAS ?TRMM. Fall to default triangular product or call BLAS ?GEMM*/ \ - if (cols != depth) { \ -\ - int nthr = 1 /*mkl_domain_get_max_threads(EIGEN_BLAS_DOMAIN_BLAS)*/; \ -\ - if ((nthr==1) && (((std::max)(cols,depth)-diagSize)/(double)diagSize < 0.5)) { \ - /* Most likely no benefit to call TRMM or GEMM from BLAS*/ \ - product_triangular_matrix_matrix::run( \ - _rows, _cols, _depth, _lhs, lhsStride, _rhs, rhsStride, res, resStride, alpha, blocking); \ - /*std::cout << "TRMM_R: A is not square! Go to Eigen TRMM implementation!\n";*/ \ - } else { \ - /* Make sense to call GEMM */ \ - Map > rhsMap(_rhs,depth,cols, OuterStride<>(rhsStride)); \ - MatrixRhs aa_tmp=rhsMap.template triangularView(); \ - BlasIndex aStride = convert_index(aa_tmp.outerStride()); \ - gemm_blocking_space gemm_blocking(_rows,_cols,_depth, 1, true); \ - general_matrix_matrix_product::run( \ - rows, cols, depth, _lhs, lhsStride, aa_tmp.data(), aStride, res, resStride, alpha, gemm_blocking, 0); \ -\ - /*std::cout << "TRMM_R: A is not square! Go to BLAS GEMM implementation! " << nthr<<" \n";*/ \ - } \ - return; \ - } \ - char side = 'R', transa, uplo, diag = 'N'; \ - EIGTYPE *b; \ - const EIGTYPE *a; \ - BlasIndex m, n, lda, ldb; \ -\ -/* Set m, n */ \ - m = convert_index(rows); \ - n = convert_index(diagSize); \ -\ -/* Set trans */ \ - transa = (RhsStorageOrder==RowMajor) ? ((ConjugateRhs) ? 'C' : 'T') : 'N'; \ -\ -/* Set b, ldb */ \ - Map > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \ - MatrixX##EIGPREFIX b_tmp; \ -\ - if (ConjugateLhs) b_tmp = lhs.conjugate(); else b_tmp = lhs; \ - b = b_tmp.data(); \ - ldb = convert_index(b_tmp.outerStride()); \ -\ -/* Set uplo */ \ - uplo = IsLower ? 'L' : 'U'; \ - if (RhsStorageOrder==RowMajor) uplo = (uplo == 'L') ? 'U' : 'L'; \ -/* Set a, lda */ \ - Map > rhs(_rhs,depth,cols, OuterStride<>(rhsStride)); \ - MatrixRhs a_tmp; \ -\ - if ((conjA!=0) || (SetDiag==0)) { \ - if (conjA) a_tmp = rhs.conjugate(); else a_tmp = rhs; \ - if (IsZeroDiag) \ - a_tmp.diagonal().setZero(); \ - else if (IsUnitDiag) \ - a_tmp.diagonal().setOnes();\ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else { \ - a = _rhs; \ - lda = convert_index(rhsStride); \ - } \ - /*std::cout << "TRMM_R: A is square! Go to BLAS TRMM implementation! \n";*/ \ -/* call ?trmm*/ \ - BLASFUNC(&side, &uplo, &transa, &diag, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (BLASTYPE*)b, &ldb); \ -\ -/* Add op(a_triangular)*b into res*/ \ - Map > res_tmp(res,rows,cols,OuterStride<>(resStride)); \ - res_tmp=res_tmp+b_tmp; \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_TRMM_R(double, double, d, dtrmm) -EIGEN_BLAS_TRMM_R(dcomplex, MKL_Complex16, cd, ztrmm) -EIGEN_BLAS_TRMM_R(float, float, f, strmm) -EIGEN_BLAS_TRMM_R(scomplex, MKL_Complex8, cf, ctrmm) -#else -EIGEN_BLAS_TRMM_R(double, double, d, dtrmm_) -EIGEN_BLAS_TRMM_R(dcomplex, double, cd, ztrmm_) -EIGEN_BLAS_TRMM_R(float, float, f, strmm_) -EIGEN_BLAS_TRMM_R(scomplex, float, cf, ctrmm_) -#endif -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULAR_MATRIX_MATRIX_BLAS_H diff --git a/Eigen/src/Core/products/TriangularMatrixVector.h b/Eigen/src/Core/products/TriangularMatrixVector.h deleted file mode 100644 index 76bfa159c..000000000 --- a/Eigen/src/Core/products/TriangularMatrixVector.h +++ /dev/null @@ -1,350 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRIANGULARMATRIXVECTOR_H -#define EIGEN_TRIANGULARMATRIXVECTOR_H - -namespace Eigen { - -namespace internal { - -template -struct triangular_matrix_vector_product; - -template -struct triangular_matrix_vector_product -{ - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - enum { - IsLower = ((Mode&Lower)==Lower), - HasUnitDiag = (Mode & UnitDiag)==UnitDiag, - HasZeroDiag = (Mode & ZeroDiag)==ZeroDiag - }; - static EIGEN_DONT_INLINE void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, - const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const RhsScalar& alpha); -}; - -template -EIGEN_DONT_INLINE void triangular_matrix_vector_product - ::run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, - const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const RhsScalar& alpha) - { - static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH; - Index size = (std::min)(_rows,_cols); - Index rows = IsLower ? _rows : (std::min)(_rows,_cols); - Index cols = IsLower ? (std::min)(_rows,_cols) : _cols; - - typedef Map, 0, OuterStride<> > LhsMap; - const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride)); - typename conj_expr_if::type cjLhs(lhs); - - typedef Map, 0, InnerStride<> > RhsMap; - const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr)); - typename conj_expr_if::type cjRhs(rhs); - - typedef Map > ResMap; - ResMap res(_res,rows); - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - - for (Index pi=0; pi0) - res.segment(s,r) += (alpha * cjRhs.coeff(i)) * cjLhs.col(i).segment(s,r); - if (HasUnitDiag) - res.coeffRef(i) += alpha * cjRhs.coeff(i); - } - Index r = IsLower ? rows - pi - actualPanelWidth : pi; - if (r>0) - { - Index s = IsLower ? pi+actualPanelWidth : 0; - general_matrix_vector_product::run( - r, actualPanelWidth, - LhsMapper(&lhs.coeffRef(s,pi), lhsStride), - RhsMapper(&rhs.coeffRef(pi), rhsIncr), - &res.coeffRef(s), resIncr, alpha); - } - } - if((!IsLower) && cols>size) - { - general_matrix_vector_product::run( - rows, cols-size, - LhsMapper(&lhs.coeffRef(0,size), lhsStride), - RhsMapper(&rhs.coeffRef(size), rhsIncr), - _res, resIncr, alpha); - } - } - -template -struct triangular_matrix_vector_product -{ - typedef typename ScalarBinaryOpTraits::ReturnType ResScalar; - enum { - IsLower = ((Mode&Lower)==Lower), - HasUnitDiag = (Mode & UnitDiag)==UnitDiag, - HasZeroDiag = (Mode & ZeroDiag)==ZeroDiag - }; - static EIGEN_DONT_INLINE void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, - const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const ResScalar& alpha); -}; - -template -EIGEN_DONT_INLINE void triangular_matrix_vector_product - ::run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, - const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const ResScalar& alpha) - { - static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH; - Index diagSize = (std::min)(_rows,_cols); - Index rows = IsLower ? _rows : diagSize; - Index cols = IsLower ? diagSize : _cols; - - typedef Map, 0, OuterStride<> > LhsMap; - const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride)); - typename conj_expr_if::type cjLhs(lhs); - - typedef Map > RhsMap; - const RhsMap rhs(_rhs,cols); - typename conj_expr_if::type cjRhs(rhs); - - typedef Map, 0, InnerStride<> > ResMap; - ResMap res(_res,rows,InnerStride<>(resIncr)); - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - - for (Index pi=0; pi0) - res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum(); - if (HasUnitDiag) - res.coeffRef(i) += alpha * cjRhs.coeff(i); - } - Index r = IsLower ? pi : cols - pi - actualPanelWidth; - if (r>0) - { - Index s = IsLower ? 0 : pi + actualPanelWidth; - general_matrix_vector_product::run( - actualPanelWidth, r, - LhsMapper(&lhs.coeffRef(pi,s), lhsStride), - RhsMapper(&rhs.coeffRef(s), rhsIncr), - &res.coeffRef(pi), resIncr, alpha); - } - } - if(IsLower && rows>diagSize) - { - general_matrix_vector_product::run( - rows-diagSize, cols, - LhsMapper(&lhs.coeffRef(diagSize,0), lhsStride), - RhsMapper(&rhs.coeffRef(0), rhsIncr), - &res.coeffRef(diagSize), resIncr, alpha); - } - } - -/*************************************************************************** -* Wrapper to product_triangular_vector -***************************************************************************/ - -template -struct trmv_selector; - -} // end namespace internal - -namespace internal { - -template -struct triangular_product_impl -{ - template static void run(Dest& dst, const Lhs &lhs, const Rhs &rhs, const typename Dest::Scalar& alpha) - { - eigen_assert(dst.rows()==lhs.rows() && dst.cols()==rhs.cols()); - - internal::trmv_selector::Flags)&RowMajorBit) ? RowMajor : ColMajor>::run(lhs, rhs, dst, alpha); - } -}; - -template -struct triangular_product_impl -{ - template static void run(Dest& dst, const Lhs &lhs, const Rhs &rhs, const typename Dest::Scalar& alpha) - { - eigen_assert(dst.rows()==lhs.rows() && dst.cols()==rhs.cols()); - - Transpose dstT(dst); - internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower), - (int(internal::traits::Flags)&RowMajorBit) ? ColMajor : RowMajor> - ::run(rhs.transpose(),lhs.transpose(), dstT, alpha); - } -}; - -} // end namespace internal - -namespace internal { - -// TODO: find a way to factorize this piece of code with gemv_selector since the logic is exactly the same. - -template struct trmv_selector -{ - template - static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) - { - typedef typename Lhs::Scalar LhsScalar; - typedef typename Rhs::Scalar RhsScalar; - typedef typename Dest::Scalar ResScalar; - typedef typename Dest::RealScalar RealScalar; - - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; - - typedef Map, EIGEN_PLAIN_ENUM_MIN(AlignedMax,internal::packet_traits::size)> MappedDest; - - typename internal::add_const_on_value_type::type actualLhs = LhsBlasTraits::extract(lhs); - typename internal::add_const_on_value_type::type actualRhs = RhsBlasTraits::extract(rhs); - - LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(lhs); - RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(rhs); - ResScalar actualAlpha = alpha * lhs_alpha * rhs_alpha; - - enum { - // FIXME find a way to allow an inner stride on the result if packet_traits::size==1 - // on, the other hand it is good for the cache to pack the vector anyways... - EvalToDestAtCompileTime = Dest::InnerStrideAtCompileTime==1, - ComplexByReal = (NumTraits::IsComplex) && (!NumTraits::IsComplex), - MightCannotUseDest = (Dest::InnerStrideAtCompileTime!=1) || ComplexByReal - }; - - gemv_static_vector_if static_dest; - - bool alphaIsCompatible = (!ComplexByReal) || (numext::imag(actualAlpha)==RealScalar(0)); - bool evalToDest = EvalToDestAtCompileTime && alphaIsCompatible; - - RhsScalar compatibleAlpha = get_factor::run(actualAlpha); - - ei_declare_aligned_stack_constructed_variable(ResScalar,actualDestPtr,dest.size(), - evalToDest ? dest.data() : static_dest.data()); - - if(!evalToDest) - { - #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN - Index size = dest.size(); - EIGEN_DENSE_STORAGE_CTOR_PLUGIN - #endif - if(!alphaIsCompatible) - { - MappedDest(actualDestPtr, dest.size()).setZero(); - compatibleAlpha = RhsScalar(1); - } - else - MappedDest(actualDestPtr, dest.size()) = dest; - } - - internal::triangular_matrix_vector_product - - ::run(actualLhs.rows(),actualLhs.cols(), - actualLhs.data(),actualLhs.outerStride(), - actualRhs.data(),actualRhs.innerStride(), - actualDestPtr,1,compatibleAlpha); - - if (!evalToDest) - { - if(!alphaIsCompatible) - dest += actualAlpha * MappedDest(actualDestPtr, dest.size()); - else - dest = MappedDest(actualDestPtr, dest.size()); - } - - if ( ((Mode&UnitDiag)==UnitDiag) && (lhs_alpha!=LhsScalar(1)) ) - { - Index diagSize = (std::min)(lhs.rows(),lhs.cols()); - dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize); - } - } -}; - -template struct trmv_selector -{ - template - static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) - { - typedef typename Lhs::Scalar LhsScalar; - typedef typename Rhs::Scalar RhsScalar; - typedef typename Dest::Scalar ResScalar; - - typedef internal::blas_traits LhsBlasTraits; - typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; - typedef internal::blas_traits RhsBlasTraits; - typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; - typedef typename internal::remove_all::type ActualRhsTypeCleaned; - - typename add_const::type actualLhs = LhsBlasTraits::extract(lhs); - typename add_const::type actualRhs = RhsBlasTraits::extract(rhs); - - LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(lhs); - RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(rhs); - ResScalar actualAlpha = alpha * lhs_alpha * rhs_alpha; - - enum { - DirectlyUseRhs = ActualRhsTypeCleaned::InnerStrideAtCompileTime==1 - }; - - gemv_static_vector_if static_rhs; - - ei_declare_aligned_stack_constructed_variable(RhsScalar,actualRhsPtr,actualRhs.size(), - DirectlyUseRhs ? const_cast(actualRhs.data()) : static_rhs.data()); - - if(!DirectlyUseRhs) - { - #ifdef EIGEN_DENSE_STORAGE_CTOR_PLUGIN - Index size = actualRhs.size(); - EIGEN_DENSE_STORAGE_CTOR_PLUGIN - #endif - Map(actualRhsPtr, actualRhs.size()) = actualRhs; - } - - internal::triangular_matrix_vector_product - - ::run(actualLhs.rows(),actualLhs.cols(), - actualLhs.data(),actualLhs.outerStride(), - actualRhsPtr,1, - dest.data(),dest.innerStride(), - actualAlpha); - - if ( ((Mode&UnitDiag)==UnitDiag) && (lhs_alpha!=LhsScalar(1)) ) - { - Index diagSize = (std::min)(lhs.rows(),lhs.cols()); - dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize); - } - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULARMATRIXVECTOR_H diff --git a/Eigen/src/Core/products/TriangularMatrixVector_BLAS.h b/Eigen/src/Core/products/TriangularMatrixVector_BLAS.h deleted file mode 100644 index 3d47a2b94..000000000 --- a/Eigen/src/Core/products/TriangularMatrixVector_BLAS.h +++ /dev/null @@ -1,255 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * Triangular matrix-vector product functionality based on ?TRMV. - ******************************************************************************** -*/ - -#ifndef EIGEN_TRIANGULAR_MATRIX_VECTOR_BLAS_H -#define EIGEN_TRIANGULAR_MATRIX_VECTOR_BLAS_H - -namespace Eigen { - -namespace internal { - -/********************************************************************** -* This file implements triangular matrix-vector multiplication using BLAS -**********************************************************************/ - -// trmv/hemv specialization - -template -struct triangular_matrix_vector_product_trmv : - triangular_matrix_vector_product {}; - -#define EIGEN_BLAS_TRMV_SPECIALIZE(Scalar) \ -template \ -struct triangular_matrix_vector_product { \ - static void run(Index _rows, Index _cols, const Scalar* _lhs, Index lhsStride, \ - const Scalar* _rhs, Index rhsIncr, Scalar* _res, Index resIncr, Scalar alpha) { \ - triangular_matrix_vector_product_trmv::run( \ - _rows, _cols, _lhs, lhsStride, _rhs, rhsIncr, _res, resIncr, alpha); \ - } \ -}; \ -template \ -struct triangular_matrix_vector_product { \ - static void run(Index _rows, Index _cols, const Scalar* _lhs, Index lhsStride, \ - const Scalar* _rhs, Index rhsIncr, Scalar* _res, Index resIncr, Scalar alpha) { \ - triangular_matrix_vector_product_trmv::run( \ - _rows, _cols, _lhs, lhsStride, _rhs, rhsIncr, _res, resIncr, alpha); \ - } \ -}; - -EIGEN_BLAS_TRMV_SPECIALIZE(double) -EIGEN_BLAS_TRMV_SPECIALIZE(float) -EIGEN_BLAS_TRMV_SPECIALIZE(dcomplex) -EIGEN_BLAS_TRMV_SPECIALIZE(scomplex) - -// implements col-major: res += alpha * op(triangular) * vector -#define EIGEN_BLAS_TRMV_CM(EIGTYPE, BLASTYPE, EIGPREFIX, BLASPREFIX, BLASPOSTFIX) \ -template \ -struct triangular_matrix_vector_product_trmv { \ - enum { \ - IsLower = (Mode&Lower) == Lower, \ - SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1, \ - IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \ - IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \ - LowUp = IsLower ? Lower : Upper \ - }; \ - static void run(Index _rows, Index _cols, const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsIncr, EIGTYPE* _res, Index resIncr, EIGTYPE alpha) \ - { \ - if (ConjLhs || IsZeroDiag) { \ - triangular_matrix_vector_product::run( \ - _rows, _cols, _lhs, lhsStride, _rhs, rhsIncr, _res, resIncr, alpha); \ - return; \ - }\ - Index size = (std::min)(_rows,_cols); \ - Index rows = IsLower ? _rows : size; \ - Index cols = IsLower ? size : _cols; \ -\ - typedef VectorX##EIGPREFIX VectorRhs; \ - EIGTYPE *x, *y;\ -\ -/* Set x*/ \ - Map > rhs(_rhs,cols,InnerStride<>(rhsIncr)); \ - VectorRhs x_tmp; \ - if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ - x = x_tmp.data(); \ -\ -/* Square part handling */\ -\ - char trans, uplo, diag; \ - BlasIndex m, n, lda, incx, incy; \ - EIGTYPE const *a; \ - EIGTYPE beta(1); \ -\ -/* Set m, n */ \ - n = convert_index(size); \ - lda = convert_index(lhsStride); \ - incx = 1; \ - incy = convert_index(resIncr); \ -\ -/* Set uplo, trans and diag*/ \ - trans = 'N'; \ - uplo = IsLower ? 'L' : 'U'; \ - diag = IsUnitDiag ? 'U' : 'N'; \ -\ -/* call ?TRMV*/ \ - BLASPREFIX##trmv##BLASPOSTFIX(&uplo, &trans, &diag, &n, (const BLASTYPE*)_lhs, &lda, (BLASTYPE*)x, &incx); \ -\ -/* Add op(a_tr)rhs into res*/ \ - BLASPREFIX##axpy##BLASPOSTFIX(&n, (const BLASTYPE*)&numext::real_ref(alpha),(const BLASTYPE*)x, &incx, (BLASTYPE*)_res, &incy); \ -/* Non-square case - doesn't fit to BLAS ?TRMV. Fall to default triangular product*/ \ - if (size<(std::max)(rows,cols)) { \ - if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ - x = x_tmp.data(); \ - if (size(rows-size); \ - n = convert_index(size); \ - } \ - else { \ - x += size; \ - y = _res; \ - a = _lhs + size*lda; \ - m = convert_index(size); \ - n = convert_index(cols-size); \ - } \ - BLASPREFIX##gemv##BLASPOSTFIX(&trans, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)x, &incx, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)y, &incy); \ - } \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_TRMV_CM(double, double, d, d,) -EIGEN_BLAS_TRMV_CM(dcomplex, MKL_Complex16, cd, z,) -EIGEN_BLAS_TRMV_CM(float, float, f, s,) -EIGEN_BLAS_TRMV_CM(scomplex, MKL_Complex8, cf, c,) -#else -EIGEN_BLAS_TRMV_CM(double, double, d, d, _) -EIGEN_BLAS_TRMV_CM(dcomplex, double, cd, z, _) -EIGEN_BLAS_TRMV_CM(float, float, f, s, _) -EIGEN_BLAS_TRMV_CM(scomplex, float, cf, c, _) -#endif - -// implements row-major: res += alpha * op(triangular) * vector -#define EIGEN_BLAS_TRMV_RM(EIGTYPE, BLASTYPE, EIGPREFIX, BLASPREFIX, BLASPOSTFIX) \ -template \ -struct triangular_matrix_vector_product_trmv { \ - enum { \ - IsLower = (Mode&Lower) == Lower, \ - SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1, \ - IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \ - IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \ - LowUp = IsLower ? Lower : Upper \ - }; \ - static void run(Index _rows, Index _cols, const EIGTYPE* _lhs, Index lhsStride, \ - const EIGTYPE* _rhs, Index rhsIncr, EIGTYPE* _res, Index resIncr, EIGTYPE alpha) \ - { \ - if (IsZeroDiag) { \ - triangular_matrix_vector_product::run( \ - _rows, _cols, _lhs, lhsStride, _rhs, rhsIncr, _res, resIncr, alpha); \ - return; \ - }\ - Index size = (std::min)(_rows,_cols); \ - Index rows = IsLower ? _rows : size; \ - Index cols = IsLower ? size : _cols; \ -\ - typedef VectorX##EIGPREFIX VectorRhs; \ - EIGTYPE *x, *y;\ -\ -/* Set x*/ \ - Map > rhs(_rhs,cols,InnerStride<>(rhsIncr)); \ - VectorRhs x_tmp; \ - if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ - x = x_tmp.data(); \ -\ -/* Square part handling */\ -\ - char trans, uplo, diag; \ - BlasIndex m, n, lda, incx, incy; \ - EIGTYPE const *a; \ - EIGTYPE beta(1); \ -\ -/* Set m, n */ \ - n = convert_index(size); \ - lda = convert_index(lhsStride); \ - incx = 1; \ - incy = convert_index(resIncr); \ -\ -/* Set uplo, trans and diag*/ \ - trans = ConjLhs ? 'C' : 'T'; \ - uplo = IsLower ? 'U' : 'L'; \ - diag = IsUnitDiag ? 'U' : 'N'; \ -\ -/* call ?TRMV*/ \ - BLASPREFIX##trmv##BLASPOSTFIX(&uplo, &trans, &diag, &n, (const BLASTYPE*)_lhs, &lda, (BLASTYPE*)x, &incx); \ -\ -/* Add op(a_tr)rhs into res*/ \ - BLASPREFIX##axpy##BLASPOSTFIX(&n, (const BLASTYPE*)&numext::real_ref(alpha),(const BLASTYPE*)x, &incx, (BLASTYPE*)_res, &incy); \ -/* Non-square case - doesn't fit to BLAS ?TRMV. Fall to default triangular product*/ \ - if (size<(std::max)(rows,cols)) { \ - if (ConjRhs) x_tmp = rhs.conjugate(); else x_tmp = rhs; \ - x = x_tmp.data(); \ - if (size(rows-size); \ - n = convert_index(size); \ - } \ - else { \ - x += size; \ - y = _res; \ - a = _lhs + size; \ - m = convert_index(size); \ - n = convert_index(cols-size); \ - } \ - BLASPREFIX##gemv##BLASPOSTFIX(&trans, &n, &m, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (const BLASTYPE*)x, &incx, (const BLASTYPE*)&numext::real_ref(beta), (BLASTYPE*)y, &incy); \ - } \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_TRMV_RM(double, double, d, d,) -EIGEN_BLAS_TRMV_RM(dcomplex, MKL_Complex16, cd, z,) -EIGEN_BLAS_TRMV_RM(float, float, f, s,) -EIGEN_BLAS_TRMV_RM(scomplex, MKL_Complex8, cf, c,) -#else -EIGEN_BLAS_TRMV_RM(double, double, d, d,_) -EIGEN_BLAS_TRMV_RM(dcomplex, double, cd, z,_) -EIGEN_BLAS_TRMV_RM(float, float, f, s,_) -EIGEN_BLAS_TRMV_RM(scomplex, float, cf, c,_) -#endif - -} // end namespase internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULAR_MATRIX_VECTOR_BLAS_H diff --git a/Eigen/src/Core/products/TriangularSolverMatrix.h b/Eigen/src/Core/products/TriangularSolverMatrix.h deleted file mode 100644 index 223c38b86..000000000 --- a/Eigen/src/Core/products/TriangularSolverMatrix.h +++ /dev/null @@ -1,335 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRIANGULAR_SOLVER_MATRIX_H -#define EIGEN_TRIANGULAR_SOLVER_MATRIX_H - -namespace Eigen { - -namespace internal { - -// if the rhs is row major, let's transpose the product -template -struct triangular_solve_matrix -{ - static void run( - Index size, Index cols, - const Scalar* tri, Index triStride, - Scalar* _other, Index otherStride, - level3_blocking& blocking) - { - triangular_solve_matrix< - Scalar, Index, Side==OnTheLeft?OnTheRight:OnTheLeft, - (Mode&UnitDiag) | ((Mode&Upper) ? Lower : Upper), - NumTraits::IsComplex && Conjugate, - TriStorageOrder==RowMajor ? ColMajor : RowMajor, ColMajor> - ::run(size, cols, tri, triStride, _other, otherStride, blocking); - } -}; - -/* Optimized triangular solver with multiple right hand side and the triangular matrix on the left - */ -template -struct triangular_solve_matrix -{ - static EIGEN_DONT_INLINE void run( - Index size, Index otherSize, - const Scalar* _tri, Index triStride, - Scalar* _other, Index otherStride, - level3_blocking& blocking); -}; -template -EIGEN_DONT_INLINE void triangular_solve_matrix::run( - Index size, Index otherSize, - const Scalar* _tri, Index triStride, - Scalar* _other, Index otherStride, - level3_blocking& blocking) - { - Index cols = otherSize; - - typedef const_blas_data_mapper TriMapper; - typedef blas_data_mapper OtherMapper; - TriMapper tri(_tri, triStride); - OtherMapper other(_other, otherStride); - - typedef gebp_traits Traits; - - enum { - SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr), - IsLower = (Mode&Lower) == Lower - }; - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(size,blocking.mc()); // cache block size along the M direction - - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*cols; - - ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB()); - - conj_if conj; - gebp_kernel gebp_kernel; - gemm_pack_lhs pack_lhs; - gemm_pack_rhs pack_rhs; - - // the goal here is to subdivise the Rhs panels such that we keep some cache - // coherence when accessing the rhs elements - std::ptrdiff_t l1, l2, l3; - manage_caching_sizes(GetAction, &l1, &l2, &l3); - Index subcols = cols>0 ? l2/(4 * sizeof(Scalar) * std::max(otherStride,size)) : 0; - subcols = std::max((subcols/Traits::nr)*Traits::nr, Traits::nr); - - for(Index k2=IsLower ? 0 : size; - IsLower ? k20; - IsLower ? k2+=kc : k2-=kc) - { - const Index actual_kc = (std::min)(IsLower ? size-k2 : k2, kc); - - // We have selected and packed a big horizontal panel R1 of rhs. Let B be the packed copy of this panel, - // and R2 the remaining part of rhs. The corresponding vertical panel of lhs is split into - // A11 (the triangular part) and A21 the remaining rectangular part. - // Then the high level algorithm is: - // - B = R1 => general block copy (done during the next step) - // - R1 = A11^-1 B => tricky part - // - update B from the new R1 => actually this has to be performed continuously during the above step - // - R2 -= A21 * B => GEPP - - // The tricky part: compute R1 = A11^-1 B while updating B from R1 - // The idea is to split A11 into multiple small vertical panels. - // Each panel can be split into a small triangular part T1k which is processed without optimization, - // and the remaining small part T2k which is processed using gebp with appropriate block strides - for(Index j2=0; j2(actual_kc-k1, SmallPanelWidth); - // tr solve - for (Index k=0; k0) - { - Index startTarget = IsLower ? k2+k1+actualPanelWidth : k2-actual_kc; - - pack_lhs(blockA, tri.getSubMapper(startTarget,startBlock), actualPanelWidth, lengthTarget); - - gebp_kernel(other.getSubMapper(startTarget,j2), blockA, blockB+actual_kc*j2, lengthTarget, actualPanelWidth, actual_cols, Scalar(-1), - actualPanelWidth, actual_kc, 0, blockBOffset); - } - } - } - - // R2 -= A21 * B => GEPP - { - Index start = IsLower ? k2+kc : 0; - Index end = IsLower ? size : k2-kc; - for(Index i2=start; i20) - { - pack_lhs(blockA, tri.getSubMapper(i2, IsLower ? k2 : k2-kc), actual_kc, actual_mc); - - gebp_kernel(other.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, Scalar(-1), -1, -1, 0, 0); - } - } - } - } - } - -/* Optimized triangular solver with multiple left hand sides and the triangular matrix on the right - */ -template -struct triangular_solve_matrix -{ - static EIGEN_DONT_INLINE void run( - Index size, Index otherSize, - const Scalar* _tri, Index triStride, - Scalar* _other, Index otherStride, - level3_blocking& blocking); -}; -template -EIGEN_DONT_INLINE void triangular_solve_matrix::run( - Index size, Index otherSize, - const Scalar* _tri, Index triStride, - Scalar* _other, Index otherStride, - level3_blocking& blocking) - { - Index rows = otherSize; - typedef typename NumTraits::Real RealScalar; - - typedef blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - LhsMapper lhs(_other, otherStride); - RhsMapper rhs(_tri, triStride); - - typedef gebp_traits Traits; - enum { - RhsStorageOrder = TriStorageOrder, - SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr), - IsLower = (Mode&Lower) == Lower - }; - - Index kc = blocking.kc(); // cache block size along the K direction - Index mc = (std::min)(rows,blocking.mc()); // cache block size along the M direction - - std::size_t sizeA = kc*mc; - std::size_t sizeB = kc*size; - - ei_declare_aligned_stack_constructed_variable(Scalar, blockA, sizeA, blocking.blockA()); - ei_declare_aligned_stack_constructed_variable(Scalar, blockB, sizeB, blocking.blockB()); - - conj_if conj; - gebp_kernel gebp_kernel; - gemm_pack_rhs pack_rhs; - gemm_pack_rhs pack_rhs_panel; - gemm_pack_lhs pack_lhs_panel; - - for(Index k2=IsLower ? size : 0; - IsLower ? k2>0 : k20) pack_rhs(geb, rhs.getSubMapper(actual_k2,startPanel), actual_kc, rs); - - // triangular packing (we only pack the panels off the diagonal, - // neglecting the blocks overlapping the diagonal - { - for (Index j2=0; j2(actual_kc-j2, SmallPanelWidth); - Index actual_j2 = actual_k2 + j2; - Index panelOffset = IsLower ? j2+actualPanelWidth : 0; - Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2; - - if (panelLength>0) - pack_rhs_panel(blockB+j2*actual_kc, - rhs.getSubMapper(actual_k2+panelOffset, actual_j2), - panelLength, actualPanelWidth, - actual_kc, panelOffset); - } - } - - for(Index i2=0; i2 vertical panels of rhs) - for (Index j2 = IsLower - ? (actual_kc - ((actual_kc%SmallPanelWidth) ? Index(actual_kc%SmallPanelWidth) - : Index(SmallPanelWidth))) - : 0; - IsLower ? j2>=0 : j2(actual_kc-j2, SmallPanelWidth); - Index absolute_j2 = actual_k2 + j2; - Index panelOffset = IsLower ? j2+actualPanelWidth : 0; - Index panelLength = IsLower ? actual_kc - j2 - actualPanelWidth : j2; - - // GEBP - if(panelLength>0) - { - gebp_kernel(lhs.getSubMapper(i2,absolute_j2), - blockA, blockB+j2*actual_kc, - actual_mc, panelLength, actualPanelWidth, - Scalar(-1), - actual_kc, actual_kc, // strides - panelOffset, panelOffset); // offsets - } - - // unblocked triangular solve - for (Index k=0; k0) - gebp_kernel(lhs.getSubMapper(i2, startPanel), blockA, geb, - actual_mc, actual_kc, rs, Scalar(-1), - -1, -1, 0, 0); - } - } - } - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULAR_SOLVER_MATRIX_H diff --git a/Eigen/src/Core/products/TriangularSolverMatrix_BLAS.h b/Eigen/src/Core/products/TriangularSolverMatrix_BLAS.h deleted file mode 100644 index f0775116a..000000000 --- a/Eigen/src/Core/products/TriangularSolverMatrix_BLAS.h +++ /dev/null @@ -1,163 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to BLAS F77 - * Triangular matrix * matrix product functionality based on ?TRMM. - ******************************************************************************** -*/ - -#ifndef EIGEN_TRIANGULAR_SOLVER_MATRIX_BLAS_H -#define EIGEN_TRIANGULAR_SOLVER_MATRIX_BLAS_H - -namespace Eigen { - -namespace internal { - -// implements LeftSide op(triangular)^-1 * general -#define EIGEN_BLAS_TRSM_L(EIGTYPE, BLASTYPE, BLASFUNC) \ -template \ -struct triangular_solve_matrix \ -{ \ - enum { \ - IsLower = (Mode&Lower) == Lower, \ - IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \ - IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \ - conjA = ((TriStorageOrder==ColMajor) && Conjugate) ? 1 : 0 \ - }; \ - static void run( \ - Index size, Index otherSize, \ - const EIGTYPE* _tri, Index triStride, \ - EIGTYPE* _other, Index otherStride, level3_blocking& /*blocking*/) \ - { \ - BlasIndex m = convert_index(size), n = convert_index(otherSize), lda, ldb; \ - char side = 'L', uplo, diag='N', transa; \ - /* Set alpha_ */ \ - EIGTYPE alpha(1); \ - ldb = convert_index(otherStride);\ -\ - const EIGTYPE *a; \ -/* Set trans */ \ - transa = (TriStorageOrder==RowMajor) ? ((Conjugate) ? 'C' : 'T') : 'N'; \ -/* Set uplo */ \ - uplo = IsLower ? 'L' : 'U'; \ - if (TriStorageOrder==RowMajor) uplo = (uplo == 'L') ? 'U' : 'L'; \ -/* Set a, lda */ \ - typedef Matrix MatrixTri; \ - Map > tri(_tri,size,size,OuterStride<>(triStride)); \ - MatrixTri a_tmp; \ -\ - if (conjA) { \ - a_tmp = tri.conjugate(); \ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else { \ - a = _tri; \ - lda = convert_index(triStride); \ - } \ - if (IsUnitDiag) diag='U'; \ -/* call ?trsm*/ \ - BLASFUNC(&side, &uplo, &transa, &diag, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (BLASTYPE*)_other, &ldb); \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_TRSM_L(double, double, dtrsm) -EIGEN_BLAS_TRSM_L(dcomplex, MKL_Complex16, ztrsm) -EIGEN_BLAS_TRSM_L(float, float, strsm) -EIGEN_BLAS_TRSM_L(scomplex, MKL_Complex8, ctrsm) -#else -EIGEN_BLAS_TRSM_L(double, double, dtrsm_) -EIGEN_BLAS_TRSM_L(dcomplex, double, ztrsm_) -EIGEN_BLAS_TRSM_L(float, float, strsm_) -EIGEN_BLAS_TRSM_L(scomplex, float, ctrsm_) -#endif - -// implements RightSide general * op(triangular)^-1 -#define EIGEN_BLAS_TRSM_R(EIGTYPE, BLASTYPE, BLASFUNC) \ -template \ -struct triangular_solve_matrix \ -{ \ - enum { \ - IsLower = (Mode&Lower) == Lower, \ - IsUnitDiag = (Mode&UnitDiag) ? 1 : 0, \ - IsZeroDiag = (Mode&ZeroDiag) ? 1 : 0, \ - conjA = ((TriStorageOrder==ColMajor) && Conjugate) ? 1 : 0 \ - }; \ - static void run( \ - Index size, Index otherSize, \ - const EIGTYPE* _tri, Index triStride, \ - EIGTYPE* _other, Index otherStride, level3_blocking& /*blocking*/) \ - { \ - BlasIndex m = convert_index(otherSize), n = convert_index(size), lda, ldb; \ - char side = 'R', uplo, diag='N', transa; \ - /* Set alpha_ */ \ - EIGTYPE alpha(1); \ - ldb = convert_index(otherStride);\ -\ - const EIGTYPE *a; \ -/* Set trans */ \ - transa = (TriStorageOrder==RowMajor) ? ((Conjugate) ? 'C' : 'T') : 'N'; \ -/* Set uplo */ \ - uplo = IsLower ? 'L' : 'U'; \ - if (TriStorageOrder==RowMajor) uplo = (uplo == 'L') ? 'U' : 'L'; \ -/* Set a, lda */ \ - typedef Matrix MatrixTri; \ - Map > tri(_tri,size,size,OuterStride<>(triStride)); \ - MatrixTri a_tmp; \ -\ - if (conjA) { \ - a_tmp = tri.conjugate(); \ - a = a_tmp.data(); \ - lda = convert_index(a_tmp.outerStride()); \ - } else { \ - a = _tri; \ - lda = convert_index(triStride); \ - } \ - if (IsUnitDiag) diag='U'; \ -/* call ?trsm*/ \ - BLASFUNC(&side, &uplo, &transa, &diag, &m, &n, (const BLASTYPE*)&numext::real_ref(alpha), (const BLASTYPE*)a, &lda, (BLASTYPE*)_other, &ldb); \ - /*std::cout << "TRMS_L specialization!\n";*/ \ - } \ -}; - -#ifdef EIGEN_USE_MKL -EIGEN_BLAS_TRSM_R(double, double, dtrsm) -EIGEN_BLAS_TRSM_R(dcomplex, MKL_Complex16, ztrsm) -EIGEN_BLAS_TRSM_R(float, float, strsm) -EIGEN_BLAS_TRSM_R(scomplex, MKL_Complex8, ctrsm) -#else -EIGEN_BLAS_TRSM_R(double, double, dtrsm_) -EIGEN_BLAS_TRSM_R(dcomplex, double, ztrsm_) -EIGEN_BLAS_TRSM_R(float, float, strsm_) -EIGEN_BLAS_TRSM_R(scomplex, float, ctrsm_) -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULAR_SOLVER_MATRIX_BLAS_H diff --git a/Eigen/src/Core/products/TriangularSolverVector.h b/Eigen/src/Core/products/TriangularSolverVector.h deleted file mode 100644 index b994759b2..000000000 --- a/Eigen/src/Core/products/TriangularSolverVector.h +++ /dev/null @@ -1,145 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRIANGULAR_SOLVER_VECTOR_H -#define EIGEN_TRIANGULAR_SOLVER_VECTOR_H - -namespace Eigen { - -namespace internal { - -template -struct triangular_solve_vector -{ - static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) - { - triangular_solve_vector::run(size, _lhs, lhsStride, rhs); - } -}; - -// forward and backward substitution, row-major, rhs is a vector -template -struct triangular_solve_vector -{ - enum { - IsLower = ((Mode&Lower)==Lower) - }; - static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) - { - typedef Map, 0, OuterStride<> > LhsMap; - const LhsMap lhs(_lhs,size,size,OuterStride<>(lhsStride)); - - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - - typename internal::conditional< - Conjugate, - const CwiseUnaryOp,LhsMap>, - const LhsMap&> - ::type cjLhs(lhs); - static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH; - for(Index pi=IsLower ? 0 : size; - IsLower ? pi0; - IsLower ? pi+=PanelWidth : pi-=PanelWidth) - { - Index actualPanelWidth = (std::min)(IsLower ? size - pi : pi, PanelWidth); - - Index r = IsLower ? pi : size - pi; // remaining size - if (r > 0) - { - // let's directly call the low level product function because: - // 1 - it is faster to compile - // 2 - it is slighlty faster at runtime - Index startRow = IsLower ? pi : pi-actualPanelWidth; - Index startCol = IsLower ? 0 : pi; - - general_matrix_vector_product::run( - actualPanelWidth, r, - LhsMapper(&lhs.coeffRef(startRow,startCol), lhsStride), - RhsMapper(rhs + startCol, 1), - rhs + startRow, 1, - RhsScalar(-1)); - } - - for(Index k=0; k0) - rhs[i] -= (cjLhs.row(i).segment(s,k).transpose().cwiseProduct(Map >(rhs+s,k))).sum(); - - if(!(Mode & UnitDiag)) - rhs[i] /= cjLhs(i,i); - } - } - } -}; - -// forward and backward substitution, column-major, rhs is a vector -template -struct triangular_solve_vector -{ - enum { - IsLower = ((Mode&Lower)==Lower) - }; - static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) - { - typedef Map, 0, OuterStride<> > LhsMap; - const LhsMap lhs(_lhs,size,size,OuterStride<>(lhsStride)); - typedef const_blas_data_mapper LhsMapper; - typedef const_blas_data_mapper RhsMapper; - typename internal::conditional,LhsMap>, - const LhsMap& - >::type cjLhs(lhs); - static const Index PanelWidth = EIGEN_TUNE_TRIANGULAR_PANEL_WIDTH; - - for(Index pi=IsLower ? 0 : size; - IsLower ? pi0; - IsLower ? pi+=PanelWidth : pi-=PanelWidth) - { - Index actualPanelWidth = (std::min)(IsLower ? size - pi : pi, PanelWidth); - Index startBlock = IsLower ? pi : pi-actualPanelWidth; - Index endBlock = IsLower ? pi + actualPanelWidth : 0; - - for(Index k=0; k0) - Map >(rhs+s,r) -= rhs[i] * cjLhs.col(i).segment(s,r); - } - Index r = IsLower ? size - endBlock : startBlock; // remaining size - if (r > 0) - { - // let's directly call the low level product function because: - // 1 - it is faster to compile - // 2 - it is slighlty faster at runtime - general_matrix_vector_product::run( - r, actualPanelWidth, - LhsMapper(&lhs.coeffRef(endBlock,startBlock), lhsStride), - RhsMapper(rhs+startBlock, 1), - rhs+endBlock, 1, RhsScalar(-1)); - } - } - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIANGULAR_SOLVER_VECTOR_H diff --git a/Eigen/src/Core/util/BlasUtil.h b/Eigen/src/Core/util/BlasUtil.h deleted file mode 100755 index b1791fb3a..000000000 --- a/Eigen/src/Core/util/BlasUtil.h +++ /dev/null @@ -1,403 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BLASUTIL_H -#define EIGEN_BLASUTIL_H - -// This file contains many lightweight helper classes used to -// implement and control fast level 2 and level 3 BLAS-like routines. - -namespace Eigen { - -namespace internal { - -// forward declarations -template -struct gebp_kernel; - -template -struct gemm_pack_rhs; - -template -struct gemm_pack_lhs; - -template< - typename Index, - typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, - typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, - int ResStorageOrder> -struct general_matrix_matrix_product; - -template -struct general_matrix_vector_product; - - -template struct conj_if; - -template<> struct conj_if { - template - inline T operator()(const T& x) const { return numext::conj(x); } - template - inline T pconj(const T& x) const { return internal::pconj(x); } -}; - -template<> struct conj_if { - template - inline const T& operator()(const T& x) const { return x; } - template - inline const T& pconj(const T& x) const { return x; } -}; - -// Generic implementation for custom complex types. -template -struct conj_helper -{ - typedef typename ScalarBinaryOpTraits::ReturnType Scalar; - - EIGEN_STRONG_INLINE Scalar pmadd(const LhsScalar& x, const RhsScalar& y, const Scalar& c) const - { return padd(c, pmul(x,y)); } - - EIGEN_STRONG_INLINE Scalar pmul(const LhsScalar& x, const RhsScalar& y) const - { return conj_if()(x) * conj_if()(y); } -}; - -template struct conj_helper -{ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const { return internal::pmadd(x,y,c); } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Scalar pmul(const Scalar& x, const Scalar& y) const { return internal::pmul(x,y); } -}; - -template struct conj_helper, std::complex, false,true> -{ - typedef std::complex Scalar; - EIGEN_STRONG_INLINE Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const - { return c + pmul(x,y); } - - EIGEN_STRONG_INLINE Scalar pmul(const Scalar& x, const Scalar& y) const - { return Scalar(numext::real(x)*numext::real(y) + numext::imag(x)*numext::imag(y), numext::imag(x)*numext::real(y) - numext::real(x)*numext::imag(y)); } -}; - -template struct conj_helper, std::complex, true,false> -{ - typedef std::complex Scalar; - EIGEN_STRONG_INLINE Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const - { return c + pmul(x,y); } - - EIGEN_STRONG_INLINE Scalar pmul(const Scalar& x, const Scalar& y) const - { return Scalar(numext::real(x)*numext::real(y) + numext::imag(x)*numext::imag(y), numext::real(x)*numext::imag(y) - numext::imag(x)*numext::real(y)); } -}; - -template struct conj_helper, std::complex, true,true> -{ - typedef std::complex Scalar; - EIGEN_STRONG_INLINE Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const - { return c + pmul(x,y); } - - EIGEN_STRONG_INLINE Scalar pmul(const Scalar& x, const Scalar& y) const - { return Scalar(numext::real(x)*numext::real(y) - numext::imag(x)*numext::imag(y), - numext::real(x)*numext::imag(y) - numext::imag(x)*numext::real(y)); } -}; - -template struct conj_helper, RealScalar, Conj,false> -{ - typedef std::complex Scalar; - EIGEN_STRONG_INLINE Scalar pmadd(const Scalar& x, const RealScalar& y, const Scalar& c) const - { return padd(c, pmul(x,y)); } - EIGEN_STRONG_INLINE Scalar pmul(const Scalar& x, const RealScalar& y) const - { return conj_if()(x)*y; } -}; - -template struct conj_helper, false,Conj> -{ - typedef std::complex Scalar; - EIGEN_STRONG_INLINE Scalar pmadd(const RealScalar& x, const Scalar& y, const Scalar& c) const - { return padd(c, pmul(x,y)); } - EIGEN_STRONG_INLINE Scalar pmul(const RealScalar& x, const Scalar& y) const - { return x*conj_if()(y); } -}; - -template struct get_factor { - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE To run(const From& x) { return To(x); } -}; - -template struct get_factor::Real> { - EIGEN_DEVICE_FUNC - static EIGEN_STRONG_INLINE typename NumTraits::Real run(const Scalar& x) { return numext::real(x); } -}; - - -template -class BlasVectorMapper { - public: - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE BlasVectorMapper(Scalar *data) : m_data(data) {} - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Scalar operator()(Index i) const { - return m_data[i]; - } - template - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Packet load(Index i) const { - return ploadt(m_data + i); - } - - template - EIGEN_DEVICE_FUNC bool aligned(Index i) const { - return (UIntPtr(m_data+i)%sizeof(Packet))==0; - } - - protected: - Scalar* m_data; -}; - -template -class BlasLinearMapper { - public: - typedef typename packet_traits::type Packet; - typedef typename packet_traits::half HalfPacket; - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE BlasLinearMapper(Scalar *data) : m_data(data) {} - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE void prefetch(int i) const { - internal::prefetch(&operator()(i)); - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Scalar& operator()(Index i) const { - return m_data[i]; - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Packet loadPacket(Index i) const { - return ploadt(m_data + i); - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE HalfPacket loadHalfPacket(Index i) const { - return ploadt(m_data + i); - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE void storePacket(Index i, const Packet &p) const { - pstoret(m_data + i, p); - } - - protected: - Scalar *m_data; -}; - -// Lightweight helper class to access matrix coefficients. -template -class blas_data_mapper { - public: - typedef typename packet_traits::type Packet; - typedef typename packet_traits::half HalfPacket; - - typedef BlasLinearMapper LinearMapper; - typedef BlasVectorMapper VectorMapper; - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE blas_data_mapper(Scalar* data, Index stride) : m_data(data), m_stride(stride) {} - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE blas_data_mapper - getSubMapper(Index i, Index j) const { - return blas_data_mapper(&operator()(i, j), m_stride); - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE LinearMapper getLinearMapper(Index i, Index j) const { - return LinearMapper(&operator()(i, j)); - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE VectorMapper getVectorMapper(Index i, Index j) const { - return VectorMapper(&operator()(i, j)); - } - - - EIGEN_DEVICE_FUNC - EIGEN_ALWAYS_INLINE Scalar& operator()(Index i, Index j) const { - return m_data[StorageOrder==RowMajor ? j + i*m_stride : i + j*m_stride]; - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE Packet loadPacket(Index i, Index j) const { - return ploadt(&operator()(i, j)); - } - - template - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE PacketT load(Index i, Index j) const { - return ploadt(&operator()(i, j)); - } - - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE HalfPacket loadHalfPacket(Index i, Index j) const { - return ploadt(&operator()(i, j)); - } - - template - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE void scatterPacket(Index i, Index j, const SubPacket &p) const { - pscatter(&operator()(i, j), p, m_stride); - } - - template - EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE SubPacket gatherPacket(Index i, Index j) const { - return pgather(&operator()(i, j), m_stride); - } - - EIGEN_DEVICE_FUNC const Index stride() const { return m_stride; } - EIGEN_DEVICE_FUNC const Scalar* data() const { return m_data; } - - EIGEN_DEVICE_FUNC Index firstAligned(Index size) const { - if (UIntPtr(m_data)%sizeof(Scalar)) { - return -1; - } - return internal::first_default_aligned(m_data, size); - } - - protected: - Scalar* EIGEN_RESTRICT m_data; - const Index m_stride; -}; - -// lightweight helper class to access matrix coefficients (const version) -template -class const_blas_data_mapper : public blas_data_mapper { - public: - EIGEN_ALWAYS_INLINE const_blas_data_mapper(const Scalar *data, Index stride) : blas_data_mapper(data, stride) {} - - EIGEN_ALWAYS_INLINE const_blas_data_mapper getSubMapper(Index i, Index j) const { - return const_blas_data_mapper(&(this->operator()(i, j)), this->m_stride); - } -}; - - -/* Helper class to analyze the factors of a Product expression. - * In particular it allows to pop out operator-, scalar multiples, - * and conjugate */ -template struct blas_traits -{ - typedef typename traits::Scalar Scalar; - typedef const XprType& ExtractType; - typedef XprType _ExtractType; - enum { - IsComplex = NumTraits::IsComplex, - IsTransposed = false, - NeedToConjugate = false, - HasUsableDirectAccess = ( (int(XprType::Flags)&DirectAccessBit) - && ( bool(XprType::IsVectorAtCompileTime) - || int(inner_stride_at_compile_time::ret) == 1) - ) ? 1 : 0 - }; - typedef typename conditional::type DirectLinearAccessType; - static inline ExtractType extract(const XprType& x) { return x; } - static inline const Scalar extractScalarFactor(const XprType&) { return Scalar(1); } -}; - -// pop conjugate -template -struct blas_traits, NestedXpr> > - : blas_traits -{ - typedef blas_traits Base; - typedef CwiseUnaryOp, NestedXpr> XprType; - typedef typename Base::ExtractType ExtractType; - - enum { - IsComplex = NumTraits::IsComplex, - NeedToConjugate = Base::NeedToConjugate ? 0 : IsComplex - }; - static inline ExtractType extract(const XprType& x) { return Base::extract(x.nestedExpression()); } - static inline Scalar extractScalarFactor(const XprType& x) { return conj(Base::extractScalarFactor(x.nestedExpression())); } -}; - -// pop scalar multiple -template -struct blas_traits, const CwiseNullaryOp,Plain>, NestedXpr> > - : blas_traits -{ - typedef blas_traits Base; - typedef CwiseBinaryOp, const CwiseNullaryOp,Plain>, NestedXpr> XprType; - typedef typename Base::ExtractType ExtractType; - static inline ExtractType extract(const XprType& x) { return Base::extract(x.rhs()); } - static inline Scalar extractScalarFactor(const XprType& x) - { return x.lhs().functor().m_other * Base::extractScalarFactor(x.rhs()); } -}; -template -struct blas_traits, NestedXpr, const CwiseNullaryOp,Plain> > > - : blas_traits -{ - typedef blas_traits Base; - typedef CwiseBinaryOp, NestedXpr, const CwiseNullaryOp,Plain> > XprType; - typedef typename Base::ExtractType ExtractType; - static inline ExtractType extract(const XprType& x) { return Base::extract(x.lhs()); } - static inline Scalar extractScalarFactor(const XprType& x) - { return Base::extractScalarFactor(x.lhs()) * x.rhs().functor().m_other; } -}; -template -struct blas_traits, const CwiseNullaryOp,Plain1>, - const CwiseNullaryOp,Plain2> > > - : blas_traits,Plain1> > -{}; - -// pop opposite -template -struct blas_traits, NestedXpr> > - : blas_traits -{ - typedef blas_traits Base; - typedef CwiseUnaryOp, NestedXpr> XprType; - typedef typename Base::ExtractType ExtractType; - static inline ExtractType extract(const XprType& x) { return Base::extract(x.nestedExpression()); } - static inline Scalar extractScalarFactor(const XprType& x) - { return - Base::extractScalarFactor(x.nestedExpression()); } -}; - -// pop/push transpose -template -struct blas_traits > - : blas_traits -{ - typedef typename NestedXpr::Scalar Scalar; - typedef blas_traits Base; - typedef Transpose XprType; - typedef Transpose ExtractType; // const to get rid of a compile error; anyway blas traits are only used on the RHS - typedef Transpose _ExtractType; - typedef typename conditional::type DirectLinearAccessType; - enum { - IsTransposed = Base::IsTransposed ? 0 : 1 - }; - static inline ExtractType extract(const XprType& x) { return ExtractType(Base::extract(x.nestedExpression())); } - static inline Scalar extractScalarFactor(const XprType& x) { return Base::extractScalarFactor(x.nestedExpression()); } -}; - -template -struct blas_traits - : blas_traits -{}; - -template::HasUsableDirectAccess> -struct extract_data_selector { - static const typename T::Scalar* run(const T& m) - { - return blas_traits::extract(m).data(); - } -}; - -template -struct extract_data_selector { - static typename T::Scalar* run(const T&) { return 0; } -}; - -template const typename T::Scalar* extract_data(const T& m) -{ - return extract_data_selector::run(m); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_BLASUTIL_H diff --git a/Eigen/src/Core/util/Constants.h b/Eigen/src/Core/util/Constants.h deleted file mode 100644 index 5d37e5d04..000000000 --- a/Eigen/src/Core/util/Constants.h +++ /dev/null @@ -1,551 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// Copyright (C) 2007-2009 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_CONSTANTS_H -#define EIGEN_CONSTANTS_H - -namespace Eigen { - -/** This value means that a positive quantity (e.g., a size) is not known at compile-time, and that instead the value is - * stored in some runtime variable. - * - * Changing the value of Dynamic breaks the ABI, as Dynamic is often used as a template parameter for Matrix. - */ -const int Dynamic = -1; - -/** This value means that a signed quantity (e.g., a signed index) is not known at compile-time, and that instead its value - * has to be specified at runtime. - */ -const int DynamicIndex = 0xffffff; - -/** This value means that the increment to go from one value to another in a sequence is not constant for each step. - */ -const int UndefinedIncr = 0xfffffe; - -/** This value means +Infinity; it is currently used only as the p parameter to MatrixBase::lpNorm(). - * The value Infinity there means the L-infinity norm. - */ -const int Infinity = -1; - -/** This value means that the cost to evaluate an expression coefficient is either very expensive or - * cannot be known at compile time. - * - * This value has to be positive to (1) simplify cost computation, and (2) allow to distinguish between a very expensive and very very expensive expressions. - * It thus must also be large enough to make sure unrolling won't happen and that sub expressions will be evaluated, but not too large to avoid overflow. - */ -const int HugeCost = 10000; - -/** \defgroup flags Flags - * \ingroup Core_Module - * - * These are the possible bits which can be OR'ed to constitute the flags of a matrix or - * expression. - * - * It is important to note that these flags are a purely compile-time notion. They are a compile-time property of - * an expression type, implemented as enum's. They are not stored in memory at runtime, and they do not incur any - * runtime overhead. - * - * \sa MatrixBase::Flags - */ - -/** \ingroup flags - * - * for a matrix, this means that the storage order is row-major. - * If this bit is not set, the storage order is column-major. - * For an expression, this determines the storage order of - * the matrix created by evaluation of that expression. - * \sa \blank \ref TopicStorageOrders */ -const unsigned int RowMajorBit = 0x1; - -/** \ingroup flags - * means the expression should be evaluated by the calling expression */ -const unsigned int EvalBeforeNestingBit = 0x2; - -/** \ingroup flags - * \deprecated - * means the expression should be evaluated before any assignment */ -EIGEN_DEPRECATED -const unsigned int EvalBeforeAssigningBit = 0x4; // FIXME deprecated - -/** \ingroup flags - * - * Short version: means the expression might be vectorized - * - * Long version: means that the coefficients can be handled by packets - * and start at a memory location whose alignment meets the requirements - * of the present CPU architecture for optimized packet access. In the fixed-size - * case, there is the additional condition that it be possible to access all the - * coefficients by packets (this implies the requirement that the size be a multiple of 16 bytes, - * and that any nontrivial strides don't break the alignment). In the dynamic-size case, - * there is no such condition on the total size and strides, so it might not be possible to access - * all coeffs by packets. - * - * \note This bit can be set regardless of whether vectorization is actually enabled. - * To check for actual vectorizability, see \a ActualPacketAccessBit. - */ -const unsigned int PacketAccessBit = 0x8; - -#ifdef EIGEN_VECTORIZE -/** \ingroup flags - * - * If vectorization is enabled (EIGEN_VECTORIZE is defined) this constant - * is set to the value \a PacketAccessBit. - * - * If vectorization is not enabled (EIGEN_VECTORIZE is not defined) this constant - * is set to the value 0. - */ -const unsigned int ActualPacketAccessBit = PacketAccessBit; -#else -const unsigned int ActualPacketAccessBit = 0x0; -#endif - -/** \ingroup flags - * - * Short version: means the expression can be seen as 1D vector. - * - * Long version: means that one can access the coefficients - * of this expression by coeff(int), and coeffRef(int) in the case of a lvalue expression. These - * index-based access methods are guaranteed - * to not have to do any runtime computation of a (row, col)-pair from the index, so that it - * is guaranteed that whenever it is available, index-based access is at least as fast as - * (row,col)-based access. Expressions for which that isn't possible don't have the LinearAccessBit. - * - * If both PacketAccessBit and LinearAccessBit are set, then the - * packets of this expression can be accessed by packet(int), and writePacket(int) in the case of a - * lvalue expression. - * - * Typically, all vector expressions have the LinearAccessBit, but there is one exception: - * Product expressions don't have it, because it would be troublesome for vectorization, even when the - * Product is a vector expression. Thus, vector Product expressions allow index-based coefficient access but - * not index-based packet access, so they don't have the LinearAccessBit. - */ -const unsigned int LinearAccessBit = 0x10; - -/** \ingroup flags - * - * Means the expression has a coeffRef() method, i.e. is writable as its individual coefficients are directly addressable. - * This rules out read-only expressions. - * - * Note that DirectAccessBit and LvalueBit are mutually orthogonal, as there are examples of expression having one but note - * the other: - * \li writable expressions that don't have a very simple memory layout as a strided array, have LvalueBit but not DirectAccessBit - * \li Map-to-const expressions, for example Map, have DirectAccessBit but not LvalueBit - * - * Expressions having LvalueBit also have their coeff() method returning a const reference instead of returning a new value. - */ -const unsigned int LvalueBit = 0x20; - -/** \ingroup flags - * - * Means that the underlying array of coefficients can be directly accessed as a plain strided array. The memory layout - * of the array of coefficients must be exactly the natural one suggested by rows(), cols(), - * outerStride(), innerStride(), and the RowMajorBit. This rules out expressions such as Diagonal, whose coefficients, - * though referencable, do not have such a regular memory layout. - * - * See the comment on LvalueBit for an explanation of how LvalueBit and DirectAccessBit are mutually orthogonal. - */ -const unsigned int DirectAccessBit = 0x40; - -/** \deprecated \ingroup flags - * - * means the first coefficient packet is guaranteed to be aligned. - * An expression cannot has the AlignedBit without the PacketAccessBit flag. - * In other words, this means we are allow to perform an aligned packet access to the first element regardless - * of the expression kind: - * \code - * expression.packet(0); - * \endcode - */ -EIGEN_DEPRECATED const unsigned int AlignedBit = 0x80; - -const unsigned int NestByRefBit = 0x100; - -/** \ingroup flags - * - * for an expression, this means that the storage order - * can be either row-major or column-major. - * The precise choice will be decided at evaluation time or when - * combined with other expressions. - * \sa \blank \ref RowMajorBit, \ref TopicStorageOrders */ -const unsigned int NoPreferredStorageOrderBit = 0x200; - -/** \ingroup flags - * - * Means that the underlying coefficients can be accessed through pointers to the sparse (un)compressed storage format, - * that is, the expression provides: - * \code - inline const Scalar* valuePtr() const; - inline const Index* innerIndexPtr() const; - inline const Index* outerIndexPtr() const; - inline const Index* innerNonZeroPtr() const; - \endcode - */ -const unsigned int CompressedAccessBit = 0x400; - - -// list of flags that are inherited by default -const unsigned int HereditaryBits = RowMajorBit - | EvalBeforeNestingBit; - -/** \defgroup enums Enumerations - * \ingroup Core_Module - * - * Various enumerations used in %Eigen. Many of these are used as template parameters. - */ - -/** \ingroup enums - * Enum containing possible values for the \c Mode or \c UpLo parameter of - * MatrixBase::selfadjointView() and MatrixBase::triangularView(), and selfadjoint solvers. */ -enum UpLoType { - /** View matrix as a lower triangular matrix. */ - Lower=0x1, - /** View matrix as an upper triangular matrix. */ - Upper=0x2, - /** %Matrix has ones on the diagonal; to be used in combination with #Lower or #Upper. */ - UnitDiag=0x4, - /** %Matrix has zeros on the diagonal; to be used in combination with #Lower or #Upper. */ - ZeroDiag=0x8, - /** View matrix as a lower triangular matrix with ones on the diagonal. */ - UnitLower=UnitDiag|Lower, - /** View matrix as an upper triangular matrix with ones on the diagonal. */ - UnitUpper=UnitDiag|Upper, - /** View matrix as a lower triangular matrix with zeros on the diagonal. */ - StrictlyLower=ZeroDiag|Lower, - /** View matrix as an upper triangular matrix with zeros on the diagonal. */ - StrictlyUpper=ZeroDiag|Upper, - /** Used in BandMatrix and SelfAdjointView to indicate that the matrix is self-adjoint. */ - SelfAdjoint=0x10, - /** Used to support symmetric, non-selfadjoint, complex matrices. */ - Symmetric=0x20 -}; - -/** \ingroup enums - * Enum for indicating whether a buffer is aligned or not. */ -enum AlignmentType { - Unaligned=0, /**< Data pointer has no specific alignment. */ - Aligned8=8, /**< Data pointer is aligned on a 8 bytes boundary. */ - Aligned16=16, /**< Data pointer is aligned on a 16 bytes boundary. */ - Aligned32=32, /**< Data pointer is aligned on a 32 bytes boundary. */ - Aligned64=64, /**< Data pointer is aligned on a 64 bytes boundary. */ - Aligned128=128, /**< Data pointer is aligned on a 128 bytes boundary. */ - AlignedMask=255, - Aligned=16, /**< \deprecated Synonym for Aligned16. */ -#if EIGEN_MAX_ALIGN_BYTES==128 - AlignedMax = Aligned128 -#elif EIGEN_MAX_ALIGN_BYTES==64 - AlignedMax = Aligned64 -#elif EIGEN_MAX_ALIGN_BYTES==32 - AlignedMax = Aligned32 -#elif EIGEN_MAX_ALIGN_BYTES==16 - AlignedMax = Aligned16 -#elif EIGEN_MAX_ALIGN_BYTES==8 - AlignedMax = Aligned8 -#elif EIGEN_MAX_ALIGN_BYTES==0 - AlignedMax = Unaligned -#else -#error Invalid value for EIGEN_MAX_ALIGN_BYTES -#endif -}; - -/** \ingroup enums - * Enum used by DenseBase::corner() in Eigen2 compatibility mode. */ -// FIXME after the corner() API change, this was not needed anymore, except by AlignedBox -// TODO: find out what to do with that. Adapt the AlignedBox API ? -enum CornerType { TopLeft, TopRight, BottomLeft, BottomRight }; - -/** \ingroup enums - * Enum containing possible values for the \p Direction parameter of - * Reverse, PartialReduxExpr and VectorwiseOp. */ -enum DirectionType { - /** For Reverse, all columns are reversed; - * for PartialReduxExpr and VectorwiseOp, act on columns. */ - Vertical, - /** For Reverse, all rows are reversed; - * for PartialReduxExpr and VectorwiseOp, act on rows. */ - Horizontal, - /** For Reverse, both rows and columns are reversed; - * not used for PartialReduxExpr and VectorwiseOp. */ - BothDirections -}; - -/** \internal \ingroup enums - * Enum to specify how to traverse the entries of a matrix. */ -enum TraversalType { - /** \internal Default traversal, no vectorization, no index-based access */ - DefaultTraversal, - /** \internal No vectorization, use index-based access to have only one for loop instead of 2 nested loops */ - LinearTraversal, - /** \internal Equivalent to a slice vectorization for fixed-size matrices having good alignment - * and good size */ - InnerVectorizedTraversal, - /** \internal Vectorization path using a single loop plus scalar loops for the - * unaligned boundaries */ - LinearVectorizedTraversal, - /** \internal Generic vectorization path using one vectorized loop per row/column with some - * scalar loops to handle the unaligned boundaries */ - SliceVectorizedTraversal, - /** \internal Special case to properly handle incompatible scalar types or other defecting cases*/ - InvalidTraversal, - /** \internal Evaluate all entries at once */ - AllAtOnceTraversal -}; - -/** \internal \ingroup enums - * Enum to specify whether to unroll loops when traversing over the entries of a matrix. */ -enum UnrollingType { - /** \internal Do not unroll loops. */ - NoUnrolling, - /** \internal Unroll only the inner loop, but not the outer loop. */ - InnerUnrolling, - /** \internal Unroll both the inner and the outer loop. If there is only one loop, - * because linear traversal is used, then unroll that loop. */ - CompleteUnrolling -}; - -/** \internal \ingroup enums - * Enum to specify whether to use the default (built-in) implementation or the specialization. */ -enum SpecializedType { - Specialized, - BuiltIn -}; - -/** \ingroup enums - * Enum containing possible values for the \p _Options template parameter of - * Matrix, Array and BandMatrix. */ -enum StorageOptions { - /** Storage order is column major (see \ref TopicStorageOrders). */ - ColMajor = 0, - /** Storage order is row major (see \ref TopicStorageOrders). */ - RowMajor = 0x1, // it is only a coincidence that this is equal to RowMajorBit -- don't rely on that - /** Align the matrix itself if it is vectorizable fixed-size */ - AutoAlign = 0, - /** Don't require alignment for the matrix itself (the array of coefficients, if dynamically allocated, may still be requested to be aligned) */ // FIXME --- clarify the situation - DontAlign = 0x2 -}; - -/** \ingroup enums - * Enum for specifying whether to apply or solve on the left or right. */ -enum SideType { - /** Apply transformation on the left. */ - OnTheLeft = 1, - /** Apply transformation on the right. */ - OnTheRight = 2 -}; - -/* the following used to be written as: - * - * struct NoChange_t {}; - * namespace { - * EIGEN_UNUSED NoChange_t NoChange; - * } - * - * on the ground that it feels dangerous to disambiguate overloaded functions on enum/integer types. - * However, this leads to "variable declared but never referenced" warnings on Intel Composer XE, - * and we do not know how to get rid of them (bug 450). - */ - -enum NoChange_t { NoChange }; -enum Sequential_t { Sequential }; -enum Default_t { Default }; - -/** \internal \ingroup enums - * Used in AmbiVector. */ -enum AmbiVectorMode { - IsDense = 0, - IsSparse -}; - -/** \ingroup enums - * Used as template parameter in DenseCoeffBase and MapBase to indicate - * which accessors should be provided. */ -enum AccessorLevels { - /** Read-only access via a member function. */ - ReadOnlyAccessors, - /** Read/write access via member functions. */ - WriteAccessors, - /** Direct read-only access to the coefficients. */ - DirectAccessors, - /** Direct read/write access to the coefficients. */ - DirectWriteAccessors -}; - -/** \ingroup enums - * Enum with options to give to various decompositions. */ -enum DecompositionOptions { - /** \internal Not used (meant for LDLT?). */ - Pivoting = 0x01, - /** \internal Not used (meant for LDLT?). */ - NoPivoting = 0x02, - /** Used in JacobiSVD to indicate that the square matrix U is to be computed. */ - ComputeFullU = 0x04, - /** Used in JacobiSVD to indicate that the thin matrix U is to be computed. */ - ComputeThinU = 0x08, - /** Used in JacobiSVD to indicate that the square matrix V is to be computed. */ - ComputeFullV = 0x10, - /** Used in JacobiSVD to indicate that the thin matrix V is to be computed. */ - ComputeThinV = 0x20, - /** Used in SelfAdjointEigenSolver and GeneralizedSelfAdjointEigenSolver to specify - * that only the eigenvalues are to be computed and not the eigenvectors. */ - EigenvaluesOnly = 0x40, - /** Used in SelfAdjointEigenSolver and GeneralizedSelfAdjointEigenSolver to specify - * that both the eigenvalues and the eigenvectors are to be computed. */ - ComputeEigenvectors = 0x80, - /** \internal */ - EigVecMask = EigenvaluesOnly | ComputeEigenvectors, - /** Used in GeneralizedSelfAdjointEigenSolver to indicate that it should - * solve the generalized eigenproblem \f$ Ax = \lambda B x \f$. */ - Ax_lBx = 0x100, - /** Used in GeneralizedSelfAdjointEigenSolver to indicate that it should - * solve the generalized eigenproblem \f$ ABx = \lambda x \f$. */ - ABx_lx = 0x200, - /** Used in GeneralizedSelfAdjointEigenSolver to indicate that it should - * solve the generalized eigenproblem \f$ BAx = \lambda x \f$. */ - BAx_lx = 0x400, - /** \internal */ - GenEigMask = Ax_lBx | ABx_lx | BAx_lx -}; - -/** \ingroup enums - * Possible values for the \p QRPreconditioner template parameter of JacobiSVD. */ -enum QRPreconditioners { - /** Do not specify what is to be done if the SVD of a non-square matrix is asked for. */ - NoQRPreconditioner, - /** Use a QR decomposition without pivoting as the first step. */ - HouseholderQRPreconditioner, - /** Use a QR decomposition with column pivoting as the first step. */ - ColPivHouseholderQRPreconditioner, - /** Use a QR decomposition with full pivoting as the first step. */ - FullPivHouseholderQRPreconditioner -}; - -#ifdef Success -#error The preprocessor symbol 'Success' is defined, possibly by the X11 header file X.h -#endif - -/** \ingroup enums - * Enum for reporting the status of a computation. */ -enum ComputationInfo { - /** Computation was successful. */ - Success = 0, - /** The provided data did not satisfy the prerequisites. */ - NumericalIssue = 1, - /** Iterative procedure did not converge. */ - NoConvergence = 2, - /** The inputs are invalid, or the algorithm has been improperly called. - * When assertions are enabled, such errors trigger an assert. */ - InvalidInput = 3 -}; - -/** \ingroup enums - * Enum used to specify how a particular transformation is stored in a matrix. - * \sa Transform, Hyperplane::transform(). */ -enum TransformTraits { - /** Transformation is an isometry. */ - Isometry = 0x1, - /** Transformation is an affine transformation stored as a (Dim+1)^2 matrix whose last row is - * assumed to be [0 ... 0 1]. */ - Affine = 0x2, - /** Transformation is an affine transformation stored as a (Dim) x (Dim+1) matrix. */ - AffineCompact = 0x10 | Affine, - /** Transformation is a general projective transformation stored as a (Dim+1)^2 matrix. */ - Projective = 0x20 -}; - -/** \internal \ingroup enums - * Enum used to choose between implementation depending on the computer architecture. */ -namespace Architecture -{ - enum Type { - Generic = 0x0, - SSE = 0x1, - AltiVec = 0x2, - VSX = 0x3, - NEON = 0x4, -#if defined EIGEN_VECTORIZE_SSE - Target = SSE -#elif defined EIGEN_VECTORIZE_ALTIVEC - Target = AltiVec -#elif defined EIGEN_VECTORIZE_VSX - Target = VSX -#elif defined EIGEN_VECTORIZE_NEON - Target = NEON -#else - Target = Generic -#endif - }; -} - -/** \internal \ingroup enums - * Enum used as template parameter in Product and product evaluators. */ -enum ProductImplType -{ DefaultProduct=0, LazyProduct, AliasFreeProduct, CoeffBasedProductMode, LazyCoeffBasedProductMode, OuterProduct, InnerProduct, GemvProduct, GemmProduct }; - -/** \internal \ingroup enums - * Enum used in experimental parallel implementation. */ -enum Action {GetAction, SetAction}; - -/** The type used to identify a dense storage. */ -struct Dense {}; - -/** The type used to identify a general sparse storage. */ -struct Sparse {}; - -/** The type used to identify a general solver (factored) storage. */ -struct SolverStorage {}; - -/** The type used to identify a permutation storage. */ -struct PermutationStorage {}; - -/** The type used to identify a permutation storage. */ -struct TranspositionsStorage {}; - -/** The type used to identify a matrix expression */ -struct MatrixXpr {}; - -/** The type used to identify an array expression */ -struct ArrayXpr {}; - -// An evaluator must define its shape. By default, it can be one of the following: -struct DenseShape { static std::string debugName() { return "DenseShape"; } }; -struct SolverShape { static std::string debugName() { return "SolverShape"; } }; -struct HomogeneousShape { static std::string debugName() { return "HomogeneousShape"; } }; -struct DiagonalShape { static std::string debugName() { return "DiagonalShape"; } }; -struct BandShape { static std::string debugName() { return "BandShape"; } }; -struct TriangularShape { static std::string debugName() { return "TriangularShape"; } }; -struct SelfAdjointShape { static std::string debugName() { return "SelfAdjointShape"; } }; -struct PermutationShape { static std::string debugName() { return "PermutationShape"; } }; -struct TranspositionsShape { static std::string debugName() { return "TranspositionsShape"; } }; -struct SparseShape { static std::string debugName() { return "SparseShape"; } }; - -namespace internal { - - // random access iterators based on coeff*() accessors. -struct IndexBased {}; - -// evaluator based on iterators to access coefficients. -struct IteratorBased {}; - -/** \internal - * Constants for comparison functors - */ -enum ComparisonName { - cmp_EQ = 0, - cmp_LT = 1, - cmp_LE = 2, - cmp_UNORD = 3, - cmp_NEQ = 4, - cmp_GT = 5, - cmp_GE = 6 -}; -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_CONSTANTS_H diff --git a/Eigen/src/Core/util/DisableStupidWarnings.h b/Eigen/src/Core/util/DisableStupidWarnings.h deleted file mode 100755 index 8ef0f3594..000000000 --- a/Eigen/src/Core/util/DisableStupidWarnings.h +++ /dev/null @@ -1,79 +0,0 @@ -#ifndef EIGEN_WARNINGS_DISABLED -#define EIGEN_WARNINGS_DISABLED - -#ifdef _MSC_VER - // 4100 - unreferenced formal parameter (occurred e.g. in aligned_allocator::destroy(pointer p)) - // 4101 - unreferenced local variable - // 4181 - qualifier applied to reference type ignored - // 4211 - nonstandard extension used : redefined extern to static - // 4244 - 'argument' : conversion from 'type1' to 'type2', possible loss of data - // 4273 - QtAlignedMalloc, inconsistent DLL linkage - // 4324 - structure was padded due to declspec(align()) - // 4503 - decorated name length exceeded, name was truncated - // 4512 - assignment operator could not be generated - // 4522 - 'class' : multiple assignment operators specified - // 4700 - uninitialized local variable 'xyz' used - // 4714 - function marked as __forceinline not inlined - // 4717 - 'function' : recursive on all control paths, function will cause runtime stack overflow - // 4800 - 'type' : forcing value to bool 'true' or 'false' (performance warning) - #ifndef EIGEN_PERMANENTLY_DISABLE_STUPID_WARNINGS - #pragma warning( push ) - #endif - #pragma warning( disable : 4100 4101 4181 4211 4244 4273 4324 4503 4512 4522 4700 4714 4717 4800) - -#elif defined __INTEL_COMPILER - // 2196 - routine is both "inline" and "noinline" ("noinline" assumed) - // ICC 12 generates this warning even without any inline keyword, when defining class methods 'inline' i.e. inside of class body - // typedef that may be a reference type. - // 279 - controlling expression is constant - // ICC 12 generates this warning on assert(constant_expression_depending_on_template_params) and frankly this is a legitimate use case. - // 1684 - conversion from pointer to same-sized integral type (potential portability problem) - // 2259 - non-pointer conversion from "Eigen::Index={ptrdiff_t={long}}" to "int" may lose significant bits - #ifndef EIGEN_PERMANENTLY_DISABLE_STUPID_WARNINGS - #pragma warning push - #endif - #pragma warning disable 2196 279 1684 2259 - -#elif defined __clang__ - // -Wconstant-logical-operand - warning: use of logical && with constant operand; switch to bitwise & or remove constant - // this is really a stupid warning as it warns on compile-time expressions involving enums - #ifndef EIGEN_PERMANENTLY_DISABLE_STUPID_WARNINGS - #pragma clang diagnostic push - #endif - #pragma clang diagnostic ignored "-Wconstant-logical-operand" - #if __clang_major__ >= 3 && __clang_minor__ >= 5 - #pragma clang diagnostic ignored "-Wabsolute-value" - #endif - -#elif defined __GNUC__ && __GNUC__>=6 - - #ifndef EIGEN_PERMANENTLY_DISABLE_STUPID_WARNINGS - #pragma GCC diagnostic push - #endif - #pragma GCC diagnostic ignored "-Wignored-attributes" - -#endif - -#if defined __NVCC__ - #pragma diag_suppress boolean_controlling_expr_is_constant - // Disable the "statement is unreachable" message - #pragma diag_suppress code_is_unreachable - // Disable the "dynamic initialization in unreachable code" message - #pragma diag_suppress initialization_not_reachable - // Disable the "invalid error number" message that we get with older versions of nvcc - #pragma diag_suppress 1222 - // Disable the "calling a __host__ function from a __host__ __device__ function is not allowed" messages (yes, there are many of them and they seem to change with every version of the compiler) - #pragma diag_suppress 2527 - #pragma diag_suppress 2529 - #pragma diag_suppress 2651 - #pragma diag_suppress 2653 - #pragma diag_suppress 2668 - #pragma diag_suppress 2669 - #pragma diag_suppress 2670 - #pragma diag_suppress 2671 - #pragma diag_suppress 2735 - #pragma diag_suppress 2737 - #pragma diag_suppress 2739 -#endif - -#endif // not EIGEN_WARNINGS_DISABLED diff --git a/Eigen/src/Core/util/ForwardDeclarations.h b/Eigen/src/Core/util/ForwardDeclarations.h deleted file mode 100644 index 1a48cff04..000000000 --- a/Eigen/src/Core/util/ForwardDeclarations.h +++ /dev/null @@ -1,303 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2007-2010 Benoit Jacob -// Copyright (C) 2008-2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_FORWARDDECLARATIONS_H -#define EIGEN_FORWARDDECLARATIONS_H - -namespace Eigen { -namespace internal { - -template struct traits; - -// here we say once and for all that traits == traits -// When constness must affect traits, it has to be constness on template parameters on which T itself depends. -// For example, traits > != traits >, but -// traits > == traits > -template struct traits : traits {}; - -template struct has_direct_access -{ - enum { ret = (traits::Flags & DirectAccessBit) ? 1 : 0 }; -}; - -template struct accessors_level -{ - enum { has_direct_access = (traits::Flags & DirectAccessBit) ? 1 : 0, - has_write_access = (traits::Flags & LvalueBit) ? 1 : 0, - value = has_direct_access ? (has_write_access ? DirectWriteAccessors : DirectAccessors) - : (has_write_access ? WriteAccessors : ReadOnlyAccessors) - }; -}; - -template struct evaluator_traits; - -template< typename T> struct evaluator; - -} // end namespace internal - -template struct NumTraits; - -template struct EigenBase; -template class DenseBase; -template class PlainObjectBase; - - -template::value > -class DenseCoeffsBase; - -template class Matrix; - -template class MatrixBase; -template class ArrayBase; - -template class Flagged; -template class StorageBase > class NoAlias; -template class NestByValue; -template class ForceAlignedAccess; -template class SwapWrapper; - -template class Block; -template class IndexedView; - -template class VectorBlock; -template class Transpose; -template class Conjugate; -template class CwiseNullaryOp; -template class CwiseUnaryOp; -template class CwiseUnaryView; -template class CwiseBinaryOp; -template class CwiseTernaryOp; -template class Solve; -template class Inverse; - -template class Product; - -template class DiagonalBase; -template class DiagonalWrapper; -template class DiagonalMatrix; -template class DiagonalProduct; -template class Diagonal; -template class PermutationMatrix; -template class Transpositions; -template class PermutationBase; -template class TranspositionsBase; -template class PermutationWrapper; -template class TranspositionsWrapper; - -template::has_write_access ? WriteAccessors : ReadOnlyAccessors -> class MapBase; -template class Stride; -template class InnerStride; -template class OuterStride; -template > class Map; -template class RefBase; -template,OuterStride<> >::type > class Ref; - -template class TriangularBase; -template class TriangularView; -template class SelfAdjointView; -template class SparseView; -template class WithFormat; -template struct CommaInitializer; -template class ReturnByValue; -template class ArrayWrapper; -template class MatrixWrapper; -template class SolverBase; -template class InnerIterator; - -namespace internal { -template struct kernel_retval_base; -template struct kernel_retval; -template struct image_retval_base; -template struct image_retval; -} // end namespace internal - -namespace internal { -template class BandMatrix; -} - -namespace internal { -template struct product_type; - -template struct EnableIf; - -/** \internal - * \class product_evaluator - * Products need their own evaluator with more template arguments allowing for - * easier partial template specializations. - */ -template< typename T, - int ProductTag = internal::product_type::ret, - typename LhsShape = typename evaluator_traits::Shape, - typename RhsShape = typename evaluator_traits::Shape, - typename LhsScalar = typename traits::Scalar, - typename RhsScalar = typename traits::Scalar - > struct product_evaluator; -} - -template::value> -struct ProductReturnType; - -// this is a workaround for sun CC -template struct LazyProductReturnType; - -namespace internal { - -// Provides scalar/packet-wise product and product with accumulation -// with optional conjugation of the arguments. -template struct conj_helper; - -template struct scalar_sum_op; -template struct scalar_difference_op; -template struct scalar_conj_product_op; -template struct scalar_min_op; -template struct scalar_max_op; -template struct scalar_opposite_op; -template struct scalar_conjugate_op; -template struct scalar_real_op; -template struct scalar_imag_op; -template struct scalar_abs_op; -template struct scalar_abs2_op; -template struct scalar_sqrt_op; -template struct scalar_rsqrt_op; -template struct scalar_exp_op; -template struct scalar_log_op; -template struct scalar_cos_op; -template struct scalar_sin_op; -template struct scalar_acos_op; -template struct scalar_asin_op; -template struct scalar_tan_op; -template struct scalar_inverse_op; -template struct scalar_square_op; -template struct scalar_cube_op; -template struct scalar_cast_op; -template struct scalar_random_op; -template struct scalar_constant_op; -template struct scalar_identity_op; -template struct scalar_sign_op; -template struct scalar_pow_op; -template struct scalar_hypot_op; -template struct scalar_product_op; -template struct scalar_quotient_op; - -// SpecialFunctions module -template struct scalar_lgamma_op; -template struct scalar_digamma_op; -template struct scalar_erf_op; -template struct scalar_erfc_op; -template struct scalar_igamma_op; -template struct scalar_igammac_op; -template struct scalar_zeta_op; -template struct scalar_betainc_op; - -} // end namespace internal - -struct IOFormat; - -// Array module -template class Array; -template class Select; -template class PartialReduxExpr; -template class VectorwiseOp; -template class Replicate; -template class Reverse; - -template class FullPivLU; -template class PartialPivLU; -namespace internal { -template struct inverse_impl; -} -template class HouseholderQR; -template class ColPivHouseholderQR; -template class FullPivHouseholderQR; -template class CompleteOrthogonalDecomposition; -template class JacobiSVD; -template class BDCSVD; -template class LLT; -template class LDLT; -template class HouseholderSequence; -template class JacobiRotation; - -// Geometry module: -template class RotationBase; -template class Cross; -template class QuaternionBase; -template class Rotation2D; -template class AngleAxis; -template class Translation; -template class AlignedBox; -template class Quaternion; -template class Transform; -template class ParametrizedLine; -template class Hyperplane; -template class UniformScaling; -template class Homogeneous; - -// Sparse module: -template class SparseMatrixBase; - -// MatrixFunctions module -template struct MatrixExponentialReturnValue; -template class MatrixFunctionReturnValue; -template class MatrixSquareRootReturnValue; -template class MatrixLogarithmReturnValue; -template class MatrixPowerReturnValue; -template class MatrixComplexPowerReturnValue; - -namespace internal { -template -struct stem_function -{ - typedef std::complex::Real> ComplexScalar; - typedef ComplexScalar type(ComplexScalar, int); -}; -} - -} // end namespace Eigen - -#endif // EIGEN_FORWARDDECLARATIONS_H diff --git a/Eigen/src/Core/util/IndexedViewHelper.h b/Eigen/src/Core/util/IndexedViewHelper.h deleted file mode 100644 index ab01c857f..000000000 --- a/Eigen/src/Core/util/IndexedViewHelper.h +++ /dev/null @@ -1,187 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2017 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -#ifndef EIGEN_INDEXED_VIEW_HELPER_H -#define EIGEN_INDEXED_VIEW_HELPER_H - -namespace Eigen { - -/** \namespace Eigen::placeholders - * \ingroup Core_Module - * - * Namespace containing symbolic placeholder and identifiers - */ -namespace placeholders { - -namespace internal { -struct symbolic_last_tag {}; -} - -/** \var last - * \ingroup Core_Module - * - * Can be used as a parameter to Eigen::seq and Eigen::seqN functions to symbolically reference the last element/row/columns - * of the underlying vector or matrix once passed to DenseBase::operator()(const RowIndices&, const ColIndices&). - * - * This symbolic placeholder support standard arithmetic operation. - * - * A typical usage example would be: - * \code - * using namespace Eigen; - * using Eigen::placeholders::last; - * VectorXd v(n); - * v(seq(2,last-2)).setOnes(); - * \endcode - * - * \sa end - */ -static const Symbolic::SymbolExpr last; - -/** \var end - * \ingroup Core_Module - * - * Can be used as a parameter to Eigen::seq and Eigen::seqN functions to symbolically reference the last+1 element/row/columns - * of the underlying vector or matrix once passed to DenseBase::operator()(const RowIndices&, const ColIndices&). - * - * This symbolic placeholder support standard arithmetic operation. - * It is essentially an alias to last+1 - * - * \sa last - */ -#ifdef EIGEN_PARSED_BY_DOXYGEN -static const auto end = last+1; -#else -// Using a FixedExpr<1> expression is important here to make sure the compiler -// can fully optimize the computation starting indices with zero overhead. -static const Symbolic::AddExpr,Symbolic::ValueExpr > > end(last+fix<1>()); -#endif - -} // end namespace placeholders - -namespace internal { - - // Replace symbolic last/end "keywords" by their true runtime value -inline Index eval_expr_given_size(Index x, Index /* size */) { return x; } - -template -FixedInt eval_expr_given_size(FixedInt x, Index /*size*/) { return x; } - -template -Index eval_expr_given_size(const Symbolic::BaseExpr &x, Index size) -{ - return x.derived().eval(placeholders::last=size-1); -} - -// Extract increment/step at compile time -template struct get_compile_time_incr { - enum { value = UndefinedIncr }; -}; - -// Analogue of std::get<0>(x), but tailored for our needs. -template -Index first(const T& x) { return x.first(); } - -// IndexedViewCompatibleType/makeIndexedViewCompatible turn an arbitrary object of type T into something usable by MatrixSlice -// The generic implementation is a no-op -template -struct IndexedViewCompatibleType { - typedef T type; -}; - -template -const T& makeIndexedViewCompatible(const T& x, Index /*size*/, Q) { return x; } - -//-------------------------------------------------------------------------------- -// Handling of a single Index -//-------------------------------------------------------------------------------- - -struct SingleRange { - enum { - SizeAtCompileTime = 1 - }; - SingleRange(Index val) : m_value(val) {} - Index operator[](Index) const { return m_value; } - Index size() const { return 1; } - Index first() const { return m_value; } - Index m_value; -}; - -template<> struct get_compile_time_incr { - enum { value = 1 }; // 1 or 0 ?? -}; - -// Turn a single index into something that looks like an array (i.e., that exposes a .size(), and operatro[](int) methods) -template -struct IndexedViewCompatibleType::value>::type> { - // Here we could simply use Array, but maybe it's less work for the compiler to use - // a simpler wrapper as SingleRange - //typedef Eigen::Array type; - typedef SingleRange type; -}; - -template -struct IndexedViewCompatibleType::value>::type> { - typedef SingleRange type; -}; - - -template -typename enable_if::value,SingleRange>::type -makeIndexedViewCompatible(const T& id, Index size, SpecializedType) { - return eval_expr_given_size(id,size); -} - -//-------------------------------------------------------------------------------- -// Handling of all -//-------------------------------------------------------------------------------- - -struct all_t { all_t() {} }; - -// Convert a symbolic 'all' into a usable range type -template -struct AllRange { - enum { SizeAtCompileTime = XprSize }; - AllRange(Index size = XprSize) : m_size(size) {} - Index operator[](Index i) const { return i; } - Index size() const { return m_size.value(); } - Index first() const { return 0; } - variable_if_dynamic m_size; -}; - -template -struct IndexedViewCompatibleType { - typedef AllRange type; -}; - -template -inline AllRange::value> makeIndexedViewCompatible(all_t , XprSizeType size, SpecializedType) { - return AllRange::value>(size); -} - -template struct get_compile_time_incr > { - enum { value = 1 }; -}; - -} // end namespace internal - - -namespace placeholders { - -/** \var all - * \ingroup Core_Module - * Can be used as a parameter to DenseBase::operator()(const RowIndices&, const ColIndices&) to index all rows or columns - */ -static const Eigen::internal::all_t all; - -} - -} // end namespace Eigen - -#endif // EIGEN_INDEXED_VIEW_HELPER_H diff --git a/Eigen/src/Core/util/IntegralConstant.h b/Eigen/src/Core/util/IntegralConstant.h deleted file mode 100644 index 78a4705cd..000000000 --- a/Eigen/src/Core/util/IntegralConstant.h +++ /dev/null @@ -1,270 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2017 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -#ifndef EIGEN_INTEGRAL_CONSTANT_H -#define EIGEN_INTEGRAL_CONSTANT_H - -namespace Eigen { - -namespace internal { - -template class FixedInt; -template class VariableAndFixedInt; - -/** \internal - * \class FixedInt - * - * This class embeds a compile-time integer \c N. - * - * It is similar to c++11 std::integral_constant but with some additional features - * such as: - * - implicit conversion to int - * - arithmetic and some bitwise operators: -, +, *, /, %, &, | - * - c++98/14 compatibility with fix and fix() syntax to define integral constants. - * - * It is strongly discouraged to directly deal with this class FixedInt. Instances are expcected to - * be created by the user using Eigen::fix or Eigen::fix(). In C++98-11, the former syntax does - * not create a FixedInt instance but rather a point to function that needs to be \em cleaned-up - * using the generic helper: - * \code - * internal::cleanup_index_type::type - * internal::cleanup_index_type::type - * \endcode - * where T can a FixedInt, a pointer to function FixedInt (*)(), or numerous other integer-like representations. - * \c DynamicKey is either Dynamic (default) or DynamicIndex and used to identify true compile-time values. - * - * For convenience, you can extract the compile-time value \c N in a generic way using the following helper: - * \code - * internal::get_fixed_value::value - * \endcode - * that will give you \c N if T equals FixedInt or FixedInt (*)(), and \c DefaultVal if T does not embed any compile-time value (e.g., T==int). - * - * \sa fix, class VariableAndFixedInt - */ -template class FixedInt -{ -public: - static const int value = N; - operator int() const { return value; } - FixedInt() {} - FixedInt( VariableAndFixedInt other) { - EIGEN_ONLY_USED_FOR_DEBUG(other); - eigen_internal_assert(int(other)==N); - } - - FixedInt<-N> operator-() const { return FixedInt<-N>(); } - template - FixedInt operator+( FixedInt) const { return FixedInt(); } - template - FixedInt operator-( FixedInt) const { return FixedInt(); } - template - FixedInt operator*( FixedInt) const { return FixedInt(); } - template - FixedInt operator/( FixedInt) const { return FixedInt(); } - template - FixedInt operator%( FixedInt) const { return FixedInt(); } - template - FixedInt operator|( FixedInt) const { return FixedInt(); } - template - FixedInt operator&( FixedInt) const { return FixedInt(); } - -#if EIGEN_HAS_CXX14 - // Needed in C++14 to allow fix(): - FixedInt operator() () const { return *this; } - - VariableAndFixedInt operator() (int val) const { return VariableAndFixedInt(val); } -#else - FixedInt ( FixedInt (*)() ) {} -#endif - -#if EIGEN_HAS_CXX11 - FixedInt(std::integral_constant) {} -#endif -}; - -/** \internal - * \class VariableAndFixedInt - * - * This class embeds both a compile-time integer \c N and a runtime integer. - * Both values are supposed to be equal unless the compile-time value \c N has a special - * value meaning that the runtime-value should be used. Depending on the context, this special - * value can be either Eigen::Dynamic (for positive quantities) or Eigen::DynamicIndex (for - * quantities that can be negative). - * - * It is the return-type of the function Eigen::fix(int), and most of the time this is the only - * way it is used. It is strongly discouraged to directly deal with instances of VariableAndFixedInt. - * Indeed, in order to write generic code, it is the responsibility of the callee to properly convert - * it to either a true compile-time quantity (i.e. a FixedInt), or to a runtime quantity (e.g., an Index) - * using the following generic helper: - * \code - * internal::cleanup_index_type::type - * internal::cleanup_index_type::type - * \endcode - * where T can be a template instantiation of VariableAndFixedInt or numerous other integer-like representations. - * \c DynamicKey is either Dynamic (default) or DynamicIndex and used to identify true compile-time values. - * - * For convenience, you can also extract the compile-time value \c N using the following helper: - * \code - * internal::get_fixed_value::value - * \endcode - * that will give you \c N if T equals VariableAndFixedInt, and \c DefaultVal if T does not embed any compile-time value (e.g., T==int). - * - * \sa fix(int), class FixedInt - */ -template class VariableAndFixedInt -{ -public: - static const int value = N; - operator int() const { return m_value; } - VariableAndFixedInt(int val) { m_value = val; } -protected: - int m_value; -}; - -template struct get_fixed_value { - static const int value = Default; -}; - -template struct get_fixed_value,Default> { - static const int value = N; -}; - -#if !EIGEN_HAS_CXX14 -template struct get_fixed_value (*)(),Default> { - static const int value = N; -}; -#endif - -template struct get_fixed_value,Default> { - static const int value = N ; -}; - -template -struct get_fixed_value,Default> { - static const int value = N; -}; - -template EIGEN_DEVICE_FUNC Index get_runtime_value(const T &x) { return x; } -#if !EIGEN_HAS_CXX14 -template EIGEN_DEVICE_FUNC Index get_runtime_value(FixedInt (*)()) { return N; } -#endif - -// Cleanup integer/FixedInt/VariableAndFixedInt/etc types: - -// By default, no cleanup: -template struct cleanup_index_type { typedef T type; }; - -// Convert any integral type (e.g., short, int, unsigned int, etc.) to Eigen::Index -template struct cleanup_index_type::value>::type> { typedef Index type; }; - -#if !EIGEN_HAS_CXX14 -// In c++98/c++11, fix is a pointer to function that we better cleanup to a true FixedInt: -template struct cleanup_index_type (*)(), DynamicKey> { typedef FixedInt type; }; -#endif - -// If VariableAndFixedInt does not match DynamicKey, then we turn it to a pure compile-time value: -template struct cleanup_index_type, DynamicKey> { typedef FixedInt type; }; -// If VariableAndFixedInt matches DynamicKey, then we turn it to a pure runtime-value (aka Index): -template struct cleanup_index_type, DynamicKey> { typedef Index type; }; - -#if EIGEN_HAS_CXX11 -template struct cleanup_index_type, DynamicKey> { typedef FixedInt type; }; -#endif - -} // end namespace internal - -#ifndef EIGEN_PARSED_BY_DOXYGEN - -#if EIGEN_HAS_CXX14 -template -static const internal::FixedInt fix{}; -#else -template -inline internal::FixedInt fix() { return internal::FixedInt(); } - -// The generic typename T is mandatory. Otherwise, a code like fix could refer to either the function above or this next overload. -// This way a code like fix can only refer to the previous function. -template -inline internal::VariableAndFixedInt fix(T val) { return internal::VariableAndFixedInt(val); } -#endif - -#else // EIGEN_PARSED_BY_DOXYGEN - -/** \var fix() - * \ingroup Core_Module - * - * This \em identifier permits to construct an object embedding a compile-time integer \c N. - * - * \tparam N the compile-time integer value - * - * It is typically used in conjunction with the Eigen::seq and Eigen::seqN functions to pass compile-time values to them: - * \code - * seqN(10,fix<4>,fix<-3>) // <=> [10 7 4 1] - * \endcode - * - * See also the function fix(int) to pass both a compile-time and runtime value. - * - * In c++14, it is implemented as: - * \code - * template static const internal::FixedInt fix{}; - * \endcode - * where internal::FixedInt is an internal template class similar to - * \c std::integral_constant - * Here, \c fix is thus an object of type \c internal::FixedInt. - * - * In c++98/11, it is implemented as a function: - * \code - * template inline internal::FixedInt fix(); - * \endcode - * Here internal::FixedInt is thus a pointer to function. - * - * If for some reason you want a true object in c++98 then you can write: \code fix() \endcode which is also valid in c++14. - * - * \sa fix(int), seq, seqN - */ -template -static const auto fix(); - -/** \fn fix(int) - * \ingroup Core_Module - * - * This function returns an object embedding both a compile-time integer \c N, and a fallback runtime value \a val. - * - * \tparam N the compile-time integer value - * \param val the fallback runtime integer value - * - * This function is a more general version of the \ref fix identifier/function that can be used in template code - * where the compile-time value could turn out to actually mean "undefined at compile-time". For positive integers - * such as a size or a dimension, this case is identified by Eigen::Dynamic, whereas runtime signed integers - * (e.g., an increment/stride) are identified as Eigen::DynamicIndex. In such a case, the runtime value \a val - * will be used as a fallback. - * - * A typical use case would be: - * \code - * template void foo(const MatrixBase &mat) { - * const int N = Derived::RowsAtCompileTime==Dynamic ? Dynamic : Derived::RowsAtCompileTime/2; - * const int n = mat.rows()/2; - * ... mat( seqN(0,fix(n) ) ...; - * } - * \endcode - * In this example, the function Eigen::seqN knows that the second argument is expected to be a size. - * If the passed compile-time value N equals Eigen::Dynamic, then the proxy object returned by fix will be dissmissed, and converted to an Eigen::Index of value \c n. - * Otherwise, the runtime-value \c n will be dissmissed, and the returned ArithmeticSequence will be of the exact same type as seqN(0,fix) . - * - * \sa fix, seqN, class ArithmeticSequence - */ -template -static const auto fix(int val); - -#endif // EIGEN_PARSED_BY_DOXYGEN - -} // end namespace Eigen - -#endif // EIGEN_INTEGRAL_CONSTANT_H diff --git a/Eigen/src/Core/util/MKL_support.h b/Eigen/src/Core/util/MKL_support.h deleted file mode 100755 index 17963fad4..000000000 --- a/Eigen/src/Core/util/MKL_support.h +++ /dev/null @@ -1,137 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to Intel(R) MKL - * Include file with common MKL declarations - ******************************************************************************** -*/ - -#ifndef EIGEN_MKL_SUPPORT_H -#define EIGEN_MKL_SUPPORT_H - -#ifdef EIGEN_USE_MKL_ALL - #ifndef EIGEN_USE_BLAS - #define EIGEN_USE_BLAS - #endif - #ifndef EIGEN_USE_LAPACKE - #define EIGEN_USE_LAPACKE - #endif - #ifndef EIGEN_USE_MKL_VML - #define EIGEN_USE_MKL_VML - #endif -#endif - -#ifdef EIGEN_USE_LAPACKE_STRICT - #define EIGEN_USE_LAPACKE -#endif - -#if defined(EIGEN_USE_MKL_VML) && !defined(EIGEN_USE_MKL) - #define EIGEN_USE_MKL -#endif - - -#if defined EIGEN_USE_MKL -# if (!defined MKL_DIRECT_CALL) && (!defined EIGEN_MKL_NO_DIRECT_CALL) -# define MKL_DIRECT_CALL -# define MKL_DIRECT_CALL_JUST_SET -# endif -# include -/*Check IMKL version for compatibility: < 10.3 is not usable with Eigen*/ -# ifndef INTEL_MKL_VERSION -# undef EIGEN_USE_MKL /* INTEL_MKL_VERSION is not even defined on older versions */ -# elif INTEL_MKL_VERSION < 100305 /* the intel-mkl-103-release-notes say this was when the lapacke.h interface was added*/ -# undef EIGEN_USE_MKL -# endif -# ifndef EIGEN_USE_MKL - /*If the MKL version is too old, undef everything*/ -# undef EIGEN_USE_MKL_ALL -# undef EIGEN_USE_LAPACKE -# undef EIGEN_USE_MKL_VML -# undef EIGEN_USE_LAPACKE_STRICT -# undef EIGEN_USE_LAPACKE -# ifdef MKL_DIRECT_CALL_JUST_SET -# undef MKL_DIRECT_CALL -# endif -# endif -#endif - -#if defined EIGEN_USE_MKL - -#define EIGEN_MKL_VML_THRESHOLD 128 - -/* MKL_DOMAIN_BLAS, etc are defined only in 10.3 update 7 */ -/* MKL_BLAS, etc are not defined in 11.2 */ -#ifdef MKL_DOMAIN_ALL -#define EIGEN_MKL_DOMAIN_ALL MKL_DOMAIN_ALL -#else -#define EIGEN_MKL_DOMAIN_ALL MKL_ALL -#endif - -#ifdef MKL_DOMAIN_BLAS -#define EIGEN_MKL_DOMAIN_BLAS MKL_DOMAIN_BLAS -#else -#define EIGEN_MKL_DOMAIN_BLAS MKL_BLAS -#endif - -#ifdef MKL_DOMAIN_FFT -#define EIGEN_MKL_DOMAIN_FFT MKL_DOMAIN_FFT -#else -#define EIGEN_MKL_DOMAIN_FFT MKL_FFT -#endif - -#ifdef MKL_DOMAIN_VML -#define EIGEN_MKL_DOMAIN_VML MKL_DOMAIN_VML -#else -#define EIGEN_MKL_DOMAIN_VML MKL_VML -#endif - -#ifdef MKL_DOMAIN_PARDISO -#define EIGEN_MKL_DOMAIN_PARDISO MKL_DOMAIN_PARDISO -#else -#define EIGEN_MKL_DOMAIN_PARDISO MKL_PARDISO -#endif -#endif - -#if defined(EIGEN_USE_BLAS) && !defined(EIGEN_USE_MKL) -#include "../../misc/blas.h" -#endif - -namespace Eigen { - -typedef std::complex dcomplex; -typedef std::complex scomplex; - -#if defined(EIGEN_USE_MKL) -typedef MKL_INT BlasIndex; -#else -typedef int BlasIndex; -#endif - -} // end namespace Eigen - - -#endif // EIGEN_MKL_SUPPORT_H diff --git a/Eigen/src/Core/util/Macros.h b/Eigen/src/Core/util/Macros.h deleted file mode 100644 index e351b7ad9..000000000 --- a/Eigen/src/Core/util/Macros.h +++ /dev/null @@ -1,1031 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MACROS_H -#define EIGEN_MACROS_H - -#define EIGEN_WORLD_VERSION 3 -#define EIGEN_MAJOR_VERSION 3 -#define EIGEN_MINOR_VERSION 90 - -#define EIGEN_VERSION_AT_LEAST(x,y,z) (EIGEN_WORLD_VERSION>x || (EIGEN_WORLD_VERSION>=x && \ - (EIGEN_MAJOR_VERSION>y || (EIGEN_MAJOR_VERSION>=y && \ - EIGEN_MINOR_VERSION>=z)))) - -// Compiler identification, EIGEN_COMP_* - -/// \internal EIGEN_COMP_GNUC set to 1 for all compilers compatible with GCC -#ifdef __GNUC__ - #define EIGEN_COMP_GNUC (__GNUC__*10+__GNUC_MINOR__) -#else - #define EIGEN_COMP_GNUC 0 -#endif - -/// \internal EIGEN_COMP_CLANG set to major+minor version (e.g., 307 for clang 3.7) if the compiler is clang -#if defined(__clang__) - #define EIGEN_COMP_CLANG (__clang_major__*100+__clang_minor__) -#else - #define EIGEN_COMP_CLANG 0 -#endif - - -/// \internal EIGEN_COMP_LLVM set to 1 if the compiler backend is llvm -#if defined(__llvm__) - #define EIGEN_COMP_LLVM 1 -#else - #define EIGEN_COMP_LLVM 0 -#endif - -/// \internal EIGEN_COMP_ICC set to __INTEL_COMPILER if the compiler is Intel compiler, 0 otherwise -#if defined(__INTEL_COMPILER) - #define EIGEN_COMP_ICC __INTEL_COMPILER -#else - #define EIGEN_COMP_ICC 0 -#endif - -/// \internal EIGEN_COMP_MINGW set to 1 if the compiler is mingw -#if defined(__MINGW32__) - #define EIGEN_COMP_MINGW 1 -#else - #define EIGEN_COMP_MINGW 0 -#endif - -/// \internal EIGEN_COMP_SUNCC set to 1 if the compiler is Solaris Studio -#if defined(__SUNPRO_CC) - #define EIGEN_COMP_SUNCC 1 -#else - #define EIGEN_COMP_SUNCC 0 -#endif - -/// \internal EIGEN_COMP_MSVC set to _MSC_VER if the compiler is Microsoft Visual C++, 0 otherwise. -#if defined(_MSC_VER) - #define EIGEN_COMP_MSVC _MSC_VER -#else - #define EIGEN_COMP_MSVC 0 -#endif - -// For the record, here is a table summarizing the possible values for EIGEN_COMP_MSVC: -// name ver MSC_VER -// 2008 9 1500 -// 2010 10 1600 -// 2012 11 1700 -// 2013 12 1800 -// 2015 14 1900 -// "15" 15 1900 - -/// \internal EIGEN_COMP_MSVC_STRICT set to 1 if the compiler is really Microsoft Visual C++ and not ,e.g., ICC or clang-cl -#if EIGEN_COMP_MSVC && !(EIGEN_COMP_ICC || EIGEN_COMP_LLVM || EIGEN_COMP_CLANG) - #define EIGEN_COMP_MSVC_STRICT _MSC_VER -#else - #define EIGEN_COMP_MSVC_STRICT 0 -#endif - -/// \internal EIGEN_COMP_IBM set to 1 if the compiler is IBM XL C++ -#if defined(__IBMCPP__) || defined(__xlc__) - #define EIGEN_COMP_IBM 1 -#else - #define EIGEN_COMP_IBM 0 -#endif - -/// \internal EIGEN_COMP_PGI set to 1 if the compiler is Portland Group Compiler -#if defined(__PGI) - #define EIGEN_COMP_PGI 1 -#else - #define EIGEN_COMP_PGI 0 -#endif - -/// \internal EIGEN_COMP_ARM set to 1 if the compiler is ARM Compiler -#if defined(__CC_ARM) || defined(__ARMCC_VERSION) - #define EIGEN_COMP_ARM 1 -#else - #define EIGEN_COMP_ARM 0 -#endif - -/// \internal EIGEN_COMP_ARM set to 1 if the compiler is ARM Compiler -#if defined(__EMSCRIPTEN__) - #define EIGEN_COMP_EMSCRIPTEN 1 -#else - #define EIGEN_COMP_EMSCRIPTEN 0 -#endif - - -/// \internal EIGEN_GNUC_STRICT set to 1 if the compiler is really GCC and not a compatible compiler (e.g., ICC, clang, mingw, etc.) -#if EIGEN_COMP_GNUC && !(EIGEN_COMP_CLANG || EIGEN_COMP_ICC || EIGEN_COMP_MINGW || EIGEN_COMP_PGI || EIGEN_COMP_IBM || EIGEN_COMP_ARM || EIGEN_COMP_EMSCRIPTEN) - #define EIGEN_COMP_GNUC_STRICT 1 -#else - #define EIGEN_COMP_GNUC_STRICT 0 -#endif - - -#if EIGEN_COMP_GNUC - #define EIGEN_GNUC_AT_LEAST(x,y) ((__GNUC__==x && __GNUC_MINOR__>=y) || __GNUC__>x) - #define EIGEN_GNUC_AT_MOST(x,y) ((__GNUC__==x && __GNUC_MINOR__<=y) || __GNUC__ void foo(const T x[N]); -#if !( EIGEN_COMP_CLANG && ((EIGEN_COMP_CLANG<309) || defined(__apple_build_version__)) || EIGEN_COMP_GNUC_STRICT && EIGEN_COMP_GNUC<49) -#define EIGEN_HAS_STATIC_ARRAY_TEMPLATE 1 -#else -#define EIGEN_HAS_STATIC_ARRAY_TEMPLATE 0 -#endif - -// Upperbound on the C++ version to use. -// Expected values are 03, 11, 14, 17, etc. -// By default, let's use an arbitrarily large C++ version. -#ifndef EIGEN_MAX_CPP_VER -#define EIGEN_MAX_CPP_VER 99 -#endif - -#if EIGEN_MAX_CPP_VER>=11 && (defined(__cplusplus) && (__cplusplus >= 201103L) || EIGEN_COMP_MSVC >= 1900) -#define EIGEN_HAS_CXX11 1 -#else -#define EIGEN_HAS_CXX11 0 -#endif - -#if EIGEN_MAX_CPP_VER>=14 && (defined(__cplusplus) && (__cplusplus > 201103L) || EIGEN_COMP_MSVC >= 1910) -#define EIGEN_HAS_CXX14 1 -#else -#define EIGEN_HAS_CXX14 0 -#endif - -// Do we support r-value references? -#ifndef EIGEN_HAS_RVALUE_REFERENCES -#if EIGEN_MAX_CPP_VER>=11 && \ - (__has_feature(cxx_rvalue_references) || \ - (defined(__cplusplus) && __cplusplus >= 201103L) || \ - (EIGEN_COMP_MSVC >= 1600)) - #define EIGEN_HAS_RVALUE_REFERENCES 1 -#else - #define EIGEN_HAS_RVALUE_REFERENCES 0 -#endif -#endif - -// Does the compiler support C99? -#ifndef EIGEN_HAS_C99_MATH -#if EIGEN_MAX_CPP_VER>=11 && \ - ((defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901)) \ - || (defined(__GNUC__) && defined(_GLIBCXX_USE_C99)) \ - || (defined(_LIBCPP_VERSION) && !defined(_MSC_VER)) \ - || (EIGEN_COMP_MSVC >= 1900) || defined(__SYCL_DEVICE_ONLY__)) - #define EIGEN_HAS_C99_MATH 1 -#else - #define EIGEN_HAS_C99_MATH 0 -#endif -#endif - -// Does the compiler support result_of? -#ifndef EIGEN_HAS_STD_RESULT_OF -#if EIGEN_MAX_CPP_VER>=11 && ((__has_feature(cxx_lambdas) || (defined(__cplusplus) && __cplusplus >= 201103L))) -#define EIGEN_HAS_STD_RESULT_OF 1 -#else -#define EIGEN_HAS_STD_RESULT_OF 0 -#endif -#endif - -// Does the compiler support type_trais? -#ifndef EIGEN_HAS_TYPE_TRAITS -#if EIGEN_MAX_CPP_VER>=11 && (EIGEN_HAS_CXX11 || EIGEN_COMP_MSVC >= 1700) -#define EIGEN_HAS_TYPE_TRAITS 1 -#define EIGEN_INCLUDE_TYPE_TRAITS -#else -#define EIGEN_HAS_TYPE_TRAITS 0 -#endif -#endif - -// Does the compiler support variadic templates? -#ifndef EIGEN_HAS_VARIADIC_TEMPLATES -#if EIGEN_MAX_CPP_VER>=11 && (__cplusplus > 199711L || EIGEN_COMP_MSVC >= 1900) \ - && (!defined(__NVCC__) || !EIGEN_ARCH_ARM_OR_ARM64 || (EIGEN_CUDACC_VER >= 80000) ) - // ^^ Disable the use of variadic templates when compiling with versions of nvcc older than 8.0 on ARM devices: - // this prevents nvcc from crashing when compiling Eigen on Tegra X1 -#define EIGEN_HAS_VARIADIC_TEMPLATES 1 -#elif EIGEN_MAX_CPP_VER>=11 && (__cplusplus > 199711L || EIGEN_COMP_MSVC >= 1900) && defined(__SYCL_DEVICE_ONLY__) -#define EIGEN_HAS_VARIADIC_TEMPLATES 1 -#else -#define EIGEN_HAS_VARIADIC_TEMPLATES 0 -#endif -#endif - -// Does the compiler fully support const expressions? (as in c++14) -#ifndef EIGEN_HAS_CONSTEXPR - -#if defined(EIGEN_CUDACC) -// Const expressions are supported provided that c++11 is enabled and we're using either clang or nvcc 7.5 or above -#if EIGEN_MAX_CPP_VER>=14 && (__cplusplus > 199711L && (EIGEN_COMP_CLANG || EIGEN_CUDACC_VER >= 70500)) - #define EIGEN_HAS_CONSTEXPR 1 -#endif -#elif EIGEN_MAX_CPP_VER>=14 && (__has_feature(cxx_relaxed_constexpr) || (defined(__cplusplus) && __cplusplus >= 201402L) || \ - (EIGEN_GNUC_AT_LEAST(4,8) && (__cplusplus > 199711L)) || \ - (EIGEN_COMP_CLANG >= 306 && (__cplusplus > 199711L))) -#define EIGEN_HAS_CONSTEXPR 1 -#endif - -#ifndef EIGEN_HAS_CONSTEXPR -#define EIGEN_HAS_CONSTEXPR 0 -#endif - -#endif - -// Does the compiler support C++11 math? -// Let's be conservative and enable the default C++11 implementation only if we are sure it exists -#ifndef EIGEN_HAS_CXX11_MATH - #if EIGEN_MAX_CPP_VER>=11 && ((__cplusplus > 201103L) || (__cplusplus >= 201103L) && (EIGEN_COMP_GNUC_STRICT || EIGEN_COMP_CLANG || EIGEN_COMP_MSVC || EIGEN_COMP_ICC) \ - && (EIGEN_ARCH_i386_OR_x86_64) && (EIGEN_OS_GNULINUX || EIGEN_OS_WIN_STRICT || EIGEN_OS_MAC)) - #define EIGEN_HAS_CXX11_MATH 1 - #else - #define EIGEN_HAS_CXX11_MATH 0 - #endif -#endif - -// Does the compiler support proper C++11 containers? -#ifndef EIGEN_HAS_CXX11_CONTAINERS - #if EIGEN_MAX_CPP_VER>=11 && \ - ((__cplusplus > 201103L) \ - || ((__cplusplus >= 201103L) && (EIGEN_COMP_GNUC_STRICT || EIGEN_COMP_CLANG || EIGEN_COMP_ICC>=1400)) \ - || EIGEN_COMP_MSVC >= 1900) - #define EIGEN_HAS_CXX11_CONTAINERS 1 - #else - #define EIGEN_HAS_CXX11_CONTAINERS 0 - #endif -#endif - -// Does the compiler support C++11 noexcept? -#ifndef EIGEN_HAS_CXX11_NOEXCEPT - #if EIGEN_MAX_CPP_VER>=11 && \ - (__has_feature(cxx_noexcept) \ - || (__cplusplus > 201103L) \ - || ((__cplusplus >= 201103L) && (EIGEN_COMP_GNUC_STRICT || EIGEN_COMP_CLANG || EIGEN_COMP_ICC>=1400)) \ - || EIGEN_COMP_MSVC >= 1900) - #define EIGEN_HAS_CXX11_NOEXCEPT 1 - #else - #define EIGEN_HAS_CXX11_NOEXCEPT 0 - #endif -#endif - -/** Allows to disable some optimizations which might affect the accuracy of the result. - * Such optimization are enabled by default, and set EIGEN_FAST_MATH to 0 to disable them. - * They currently include: - * - single precision ArrayBase::sin() and ArrayBase::cos() for SSE and AVX vectorization. - */ -#ifndef EIGEN_FAST_MATH -#define EIGEN_FAST_MATH 1 -#endif - -#define EIGEN_DEBUG_VAR(x) std::cerr << #x << " = " << x << std::endl; - -// concatenate two tokens -#define EIGEN_CAT2(a,b) a ## b -#define EIGEN_CAT(a,b) EIGEN_CAT2(a,b) - -#define EIGEN_COMMA , - -// convert a token to a string -#define EIGEN_MAKESTRING2(a) #a -#define EIGEN_MAKESTRING(a) EIGEN_MAKESTRING2(a) - -// EIGEN_STRONG_INLINE is a stronger version of the inline, using __forceinline on MSVC, -// but it still doesn't use GCC's always_inline. This is useful in (common) situations where MSVC needs forceinline -// but GCC is still doing fine with just inline. -#ifndef EIGEN_STRONG_INLINE -#if EIGEN_COMP_MSVC || EIGEN_COMP_ICC -#define EIGEN_STRONG_INLINE __forceinline -#else -#define EIGEN_STRONG_INLINE inline -#endif -#endif - -// EIGEN_ALWAYS_INLINE is the stronget, it has the effect of making the function inline and adding every possible -// attribute to maximize inlining. This should only be used when really necessary: in particular, -// it uses __attribute__((always_inline)) on GCC, which most of the time is useless and can severely harm compile times. -// FIXME with the always_inline attribute, -// gcc 3.4.x and 4.1 reports the following compilation error: -// Eval.h:91: sorry, unimplemented: inlining failed in call to 'const Eigen::Eval Eigen::MatrixBase::eval() const' -// : function body not available -// See also bug 1367 -#if EIGEN_GNUC_AT_LEAST(4,2) -#define EIGEN_ALWAYS_INLINE __attribute__((always_inline)) inline -#else -#define EIGEN_ALWAYS_INLINE EIGEN_STRONG_INLINE -#endif - -#if EIGEN_COMP_GNUC -#define EIGEN_DONT_INLINE __attribute__((noinline)) -#elif EIGEN_COMP_MSVC -#define EIGEN_DONT_INLINE __declspec(noinline) -#else -#define EIGEN_DONT_INLINE -#endif - -#if EIGEN_COMP_GNUC -#define EIGEN_PERMISSIVE_EXPR __extension__ -#else -#define EIGEN_PERMISSIVE_EXPR -#endif - -// this macro allows to get rid of linking errors about multiply defined functions. -// - static is not very good because it prevents definitions from different object files to be merged. -// So static causes the resulting linked executable to be bloated with multiple copies of the same function. -// - inline is not perfect either as it unwantedly hints the compiler toward inlining the function. -#define EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_DEVICE_FUNC -#define EIGEN_DEFINE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS EIGEN_DEVICE_FUNC inline - -#ifdef NDEBUG -# ifndef EIGEN_NO_DEBUG -# define EIGEN_NO_DEBUG -# endif -#endif - -// eigen_plain_assert is where we implement the workaround for the assert() bug in GCC <= 4.3, see bug 89 -#ifdef EIGEN_NO_DEBUG - #define eigen_plain_assert(x) -#else - #if EIGEN_SAFE_TO_USE_STANDARD_ASSERT_MACRO - namespace Eigen { - namespace internal { - inline bool copy_bool(bool b) { return b; } - } - } - #define eigen_plain_assert(x) assert(x) - #else - // work around bug 89 - #include // for abort - #include // for std::cerr - - namespace Eigen { - namespace internal { - // trivial function copying a bool. Must be EIGEN_DONT_INLINE, so we implement it after including Eigen headers. - // see bug 89. - namespace { - EIGEN_DONT_INLINE bool copy_bool(bool b) { return b; } - } - inline void assert_fail(const char *condition, const char *function, const char *file, int line) - { - std::cerr << "assertion failed: " << condition << " in function " << function << " at " << file << ":" << line << std::endl; - abort(); - } - } - } - #define eigen_plain_assert(x) \ - do { \ - if(!Eigen::internal::copy_bool(x)) \ - Eigen::internal::assert_fail(EIGEN_MAKESTRING(x), __PRETTY_FUNCTION__, __FILE__, __LINE__); \ - } while(false) - #endif -#endif - -// eigen_assert can be overridden -#ifndef eigen_assert -#define eigen_assert(x) eigen_plain_assert(x) -#endif - -#ifdef EIGEN_INTERNAL_DEBUGGING -#define eigen_internal_assert(x) eigen_assert(x) -#else -#define eigen_internal_assert(x) -#endif - -#ifdef EIGEN_NO_DEBUG -#define EIGEN_ONLY_USED_FOR_DEBUG(x) EIGEN_UNUSED_VARIABLE(x) -#else -#define EIGEN_ONLY_USED_FOR_DEBUG(x) -#endif - -#ifndef EIGEN_NO_DEPRECATED_WARNING - #if EIGEN_COMP_GNUC - #define EIGEN_DEPRECATED __attribute__((deprecated)) - #elif EIGEN_COMP_MSVC - #define EIGEN_DEPRECATED __declspec(deprecated) - #else - #define EIGEN_DEPRECATED - #endif -#else - #define EIGEN_DEPRECATED -#endif - -#if EIGEN_COMP_GNUC -#define EIGEN_UNUSED __attribute__((unused)) -#else -#define EIGEN_UNUSED -#endif - -// Suppresses 'unused variable' warnings. -namespace Eigen { - namespace internal { - template EIGEN_DEVICE_FUNC void ignore_unused_variable(const T&) {} - } -} -#define EIGEN_UNUSED_VARIABLE(var) Eigen::internal::ignore_unused_variable(var); - -#if !defined(EIGEN_ASM_COMMENT) - #if EIGEN_COMP_GNUC && (EIGEN_ARCH_i386_OR_x86_64 || EIGEN_ARCH_ARM_OR_ARM64) - #define EIGEN_ASM_COMMENT(X) __asm__("#" X) - #else - #define EIGEN_ASM_COMMENT(X) - #endif -#endif - - -#if EIGEN_COMP_MSVC - // NOTE MSVC often gives C4127 warnings with compiletime if statements. See bug 1362. - // This workaround is ugly, but it does the job. -# define EIGEN_CONST_CONDITIONAL(cond) (void)0, cond -#else -# define EIGEN_CONST_CONDITIONAL(cond) cond -#endif - -//------------------------------------------------------------------------------------------ -// Static and dynamic alignment control -// -// The main purpose of this section is to define EIGEN_MAX_ALIGN_BYTES and EIGEN_MAX_STATIC_ALIGN_BYTES -// as the maximal boundary in bytes on which dynamically and statically allocated data may be alignment respectively. -// The values of EIGEN_MAX_ALIGN_BYTES and EIGEN_MAX_STATIC_ALIGN_BYTES can be specified by the user. If not, -// a default value is automatically computed based on architecture, compiler, and OS. -// -// This section also defines macros EIGEN_ALIGN_TO_BOUNDARY(N) and the shortcuts EIGEN_ALIGN{8,16,32,_MAX} -// to be used to declare statically aligned buffers. -//------------------------------------------------------------------------------------------ - - -/* EIGEN_ALIGN_TO_BOUNDARY(n) forces data to be n-byte aligned. This is used to satisfy SIMD requirements. - * However, we do that EVEN if vectorization (EIGEN_VECTORIZE) is disabled, - * so that vectorization doesn't affect binary compatibility. - * - * If we made alignment depend on whether or not EIGEN_VECTORIZE is defined, it would be impossible to link - * vectorized and non-vectorized code. - */ -#if (defined EIGEN_CUDACC) - #define EIGEN_ALIGN_TO_BOUNDARY(n) __align__(n) -#elif EIGEN_COMP_GNUC || EIGEN_COMP_PGI || EIGEN_COMP_IBM || EIGEN_COMP_ARM - #define EIGEN_ALIGN_TO_BOUNDARY(n) __attribute__((aligned(n))) -#elif EIGEN_COMP_MSVC - #define EIGEN_ALIGN_TO_BOUNDARY(n) __declspec(align(n)) -#elif EIGEN_COMP_SUNCC - // FIXME not sure about this one: - #define EIGEN_ALIGN_TO_BOUNDARY(n) __attribute__((aligned(n))) -#else - #error Please tell me what is the equivalent of __attribute__((aligned(n))) for your compiler -#endif - -// If the user explicitly disable vectorization, then we also disable alignment -#if defined(EIGEN_DONT_VECTORIZE) - #define EIGEN_IDEAL_MAX_ALIGN_BYTES 0 -#elif defined(EIGEN_VECTORIZE_AVX512) - // 64 bytes static alignment is preferred only if really required - #define EIGEN_IDEAL_MAX_ALIGN_BYTES 64 -#elif defined(__AVX__) - // 32 bytes static alignment is preferred only if really required - #define EIGEN_IDEAL_MAX_ALIGN_BYTES 32 -#else - #define EIGEN_IDEAL_MAX_ALIGN_BYTES 16 -#endif - - -// EIGEN_MIN_ALIGN_BYTES defines the minimal value for which the notion of explicit alignment makes sense -#define EIGEN_MIN_ALIGN_BYTES 16 - -// Defined the boundary (in bytes) on which the data needs to be aligned. Note -// that unless EIGEN_ALIGN is defined and not equal to 0, the data may not be -// aligned at all regardless of the value of this #define. - -#if (defined(EIGEN_DONT_ALIGN_STATICALLY) || defined(EIGEN_DONT_ALIGN)) && defined(EIGEN_MAX_STATIC_ALIGN_BYTES) && EIGEN_MAX_STATIC_ALIGN_BYTES>0 -#error EIGEN_MAX_STATIC_ALIGN_BYTES and EIGEN_DONT_ALIGN[_STATICALLY] are both defined with EIGEN_MAX_STATIC_ALIGN_BYTES!=0. Use EIGEN_MAX_STATIC_ALIGN_BYTES=0 as a synonym of EIGEN_DONT_ALIGN_STATICALLY. -#endif - -// EIGEN_DONT_ALIGN_STATICALLY and EIGEN_DONT_ALIGN are deprectated -// They imply EIGEN_MAX_STATIC_ALIGN_BYTES=0 -#if defined(EIGEN_DONT_ALIGN_STATICALLY) || defined(EIGEN_DONT_ALIGN) - #ifdef EIGEN_MAX_STATIC_ALIGN_BYTES - #undef EIGEN_MAX_STATIC_ALIGN_BYTES - #endif - #define EIGEN_MAX_STATIC_ALIGN_BYTES 0 -#endif - -#ifndef EIGEN_MAX_STATIC_ALIGN_BYTES - - // Try to automatically guess what is the best default value for EIGEN_MAX_STATIC_ALIGN_BYTES - - // 16 byte alignment is only useful for vectorization. Since it affects the ABI, we need to enable - // 16 byte alignment on all platforms where vectorization might be enabled. In theory we could always - // enable alignment, but it can be a cause of problems on some platforms, so we just disable it in - // certain common platform (compiler+architecture combinations) to avoid these problems. - // Only static alignment is really problematic (relies on nonstandard compiler extensions), - // try to keep heap alignment even when we have to disable static alignment. - #if EIGEN_COMP_GNUC && !(EIGEN_ARCH_i386_OR_x86_64 || EIGEN_ARCH_ARM_OR_ARM64 || EIGEN_ARCH_PPC || EIGEN_ARCH_IA64) - #define EIGEN_GCC_AND_ARCH_DOESNT_WANT_STACK_ALIGNMENT 1 - #elif EIGEN_ARCH_ARM_OR_ARM64 && EIGEN_COMP_GNUC_STRICT && EIGEN_GNUC_AT_MOST(4, 6) - // Old versions of GCC on ARM, at least 4.4, were once seen to have buggy static alignment support. - // Not sure which version fixed it, hopefully it doesn't affect 4.7, which is still somewhat in use. - // 4.8 and newer seem definitely unaffected. - #define EIGEN_GCC_AND_ARCH_DOESNT_WANT_STACK_ALIGNMENT 1 - #else - #define EIGEN_GCC_AND_ARCH_DOESNT_WANT_STACK_ALIGNMENT 0 - #endif - - // static alignment is completely disabled with GCC 3, Sun Studio, and QCC/QNX - #if !EIGEN_GCC_AND_ARCH_DOESNT_WANT_STACK_ALIGNMENT \ - && !EIGEN_GCC3_OR_OLDER \ - && !EIGEN_COMP_SUNCC \ - && !EIGEN_OS_QNX - #define EIGEN_ARCH_WANTS_STACK_ALIGNMENT 1 - #else - #define EIGEN_ARCH_WANTS_STACK_ALIGNMENT 0 - #endif - - #if EIGEN_ARCH_WANTS_STACK_ALIGNMENT - #define EIGEN_MAX_STATIC_ALIGN_BYTES EIGEN_IDEAL_MAX_ALIGN_BYTES - #else - #define EIGEN_MAX_STATIC_ALIGN_BYTES 0 - #endif - -#endif - -// If EIGEN_MAX_ALIGN_BYTES is defined, then it is considered as an upper bound for EIGEN_MAX_ALIGN_BYTES -#if defined(EIGEN_MAX_ALIGN_BYTES) && EIGEN_MAX_ALIGN_BYTES0 is the true test whether we want to align arrays on the stack or not. -// It takes into account both the user choice to explicitly enable/disable alignment (by settting EIGEN_MAX_STATIC_ALIGN_BYTES) -// and the architecture config (EIGEN_ARCH_WANTS_STACK_ALIGNMENT). -// Henceforth, only EIGEN_MAX_STATIC_ALIGN_BYTES should be used. - - -// Shortcuts to EIGEN_ALIGN_TO_BOUNDARY -#define EIGEN_ALIGN8 EIGEN_ALIGN_TO_BOUNDARY(8) -#define EIGEN_ALIGN16 EIGEN_ALIGN_TO_BOUNDARY(16) -#define EIGEN_ALIGN32 EIGEN_ALIGN_TO_BOUNDARY(32) -#define EIGEN_ALIGN64 EIGEN_ALIGN_TO_BOUNDARY(64) -#if EIGEN_MAX_STATIC_ALIGN_BYTES>0 -#define EIGEN_ALIGN_MAX EIGEN_ALIGN_TO_BOUNDARY(EIGEN_MAX_STATIC_ALIGN_BYTES) -#else -#define EIGEN_ALIGN_MAX -#endif - - -// Dynamic alignment control - -#if defined(EIGEN_DONT_ALIGN) && defined(EIGEN_MAX_ALIGN_BYTES) && EIGEN_MAX_ALIGN_BYTES>0 -#error EIGEN_MAX_ALIGN_BYTES and EIGEN_DONT_ALIGN are both defined with EIGEN_MAX_ALIGN_BYTES!=0. Use EIGEN_MAX_ALIGN_BYTES=0 as a synonym of EIGEN_DONT_ALIGN. -#endif - -#ifdef EIGEN_DONT_ALIGN - #ifdef EIGEN_MAX_ALIGN_BYTES - #undef EIGEN_MAX_ALIGN_BYTES - #endif - #define EIGEN_MAX_ALIGN_BYTES 0 -#elif !defined(EIGEN_MAX_ALIGN_BYTES) - #define EIGEN_MAX_ALIGN_BYTES EIGEN_IDEAL_MAX_ALIGN_BYTES -#endif - -#if EIGEN_IDEAL_MAX_ALIGN_BYTES > EIGEN_MAX_ALIGN_BYTES -#define EIGEN_DEFAULT_ALIGN_BYTES EIGEN_IDEAL_MAX_ALIGN_BYTES -#else -#define EIGEN_DEFAULT_ALIGN_BYTES EIGEN_MAX_ALIGN_BYTES -#endif - - -#ifndef EIGEN_UNALIGNED_VECTORIZE -#define EIGEN_UNALIGNED_VECTORIZE 1 -#endif - -//---------------------------------------------------------------------- - - -#ifdef EIGEN_DONT_USE_RESTRICT_KEYWORD - #define EIGEN_RESTRICT -#endif -#ifndef EIGEN_RESTRICT - #define EIGEN_RESTRICT __restrict -#endif - -#ifndef EIGEN_STACK_ALLOCATION_LIMIT -// 131072 == 128 KB -#define EIGEN_STACK_ALLOCATION_LIMIT 131072 -#endif - -#ifndef EIGEN_DEFAULT_IO_FORMAT -#ifdef EIGEN_MAKING_DOCS -// format used in Eigen's documentation -// needed to define it here as escaping characters in CMake add_definition's argument seems very problematic. -#define EIGEN_DEFAULT_IO_FORMAT Eigen::IOFormat(3, 0, " ", "\n", "", "") -#else -#define EIGEN_DEFAULT_IO_FORMAT Eigen::IOFormat() -#endif -#endif - -// just an empty macro ! -#define EIGEN_EMPTY - -#if EIGEN_COMP_MSVC_STRICT && (EIGEN_COMP_MSVC < 1900 || EIGEN_CUDACC_VER>0) - // for older MSVC versions, as well as 1900 && CUDA 8, using the base operator is sufficient (cf Bugs 1000, 1324) - #define EIGEN_INHERIT_ASSIGNMENT_EQUAL_OPERATOR(Derived) \ - using Base::operator =; -#elif EIGEN_COMP_CLANG // workaround clang bug (see http://forum.kde.org/viewtopic.php?f=74&t=102653) - #define EIGEN_INHERIT_ASSIGNMENT_EQUAL_OPERATOR(Derived) \ - using Base::operator =; \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& operator=(const Derived& other) { Base::operator=(other); return *this; } \ - template \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& operator=(const DenseBase& other) { Base::operator=(other.derived()); return *this; } -#else - #define EIGEN_INHERIT_ASSIGNMENT_EQUAL_OPERATOR(Derived) \ - using Base::operator =; \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& operator=(const Derived& other) \ - { \ - Base::operator=(other); \ - return *this; \ - } -#endif - - -/** \internal - * \brief Macro to manually inherit assignment operators. - * This is necessary, because the implicitly defined assignment operator gets deleted when a custom operator= is defined. - */ -#define EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Derived) EIGEN_INHERIT_ASSIGNMENT_EQUAL_OPERATOR(Derived) - -/** -* Just a side note. Commenting within defines works only by documenting -* behind the object (via '!<'). Comments cannot be multi-line and thus -* we have these extra long lines. What is confusing doxygen over here is -* that we use '\' and basically have a bunch of typedefs with their -* documentation in a single line. -**/ - -#define EIGEN_GENERIC_PUBLIC_INTERFACE(Derived) \ - typedef typename Eigen::internal::traits::Scalar Scalar; /*!< \brief Numeric type, e.g. float, double, int or std::complex. */ \ - typedef typename Eigen::NumTraits::Real RealScalar; /*!< \brief The underlying numeric type for composed scalar types. \details In cases where Scalar is e.g. std::complex, T were corresponding to RealScalar. */ \ - typedef typename Base::CoeffReturnType CoeffReturnType; /*!< \brief The return type for coefficient access. \details Depending on whether the object allows direct coefficient access (e.g. for a MatrixXd), this type is either 'const Scalar&' or simply 'Scalar' for objects that do not allow direct coefficient access. */ \ - typedef typename Eigen::internal::ref_selector::type Nested; \ - typedef typename Eigen::internal::traits::StorageKind StorageKind; \ - typedef typename Eigen::internal::traits::StorageIndex StorageIndex; \ - enum CompileTimeTraits \ - { RowsAtCompileTime = Eigen::internal::traits::RowsAtCompileTime, \ - ColsAtCompileTime = Eigen::internal::traits::ColsAtCompileTime, \ - Flags = Eigen::internal::traits::Flags, \ - SizeAtCompileTime = Base::SizeAtCompileTime, \ - MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, \ - IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; \ - using Base::derived; \ - using Base::const_cast_derived; - - -// FIXME Maybe the EIGEN_DENSE_PUBLIC_INTERFACE could be removed as importing PacketScalar is rarely needed -#define EIGEN_DENSE_PUBLIC_INTERFACE(Derived) \ - EIGEN_GENERIC_PUBLIC_INTERFACE(Derived) \ - typedef typename Base::PacketScalar PacketScalar; - - -#define EIGEN_PLAIN_ENUM_MIN(a,b) (((int)a <= (int)b) ? (int)a : (int)b) -#define EIGEN_PLAIN_ENUM_MAX(a,b) (((int)a >= (int)b) ? (int)a : (int)b) - -// EIGEN_SIZE_MIN_PREFER_DYNAMIC gives the min between compile-time sizes. 0 has absolute priority, followed by 1, -// followed by Dynamic, followed by other finite values. The reason for giving Dynamic the priority over -// finite values is that min(3, Dynamic) should be Dynamic, since that could be anything between 0 and 3. -#define EIGEN_SIZE_MIN_PREFER_DYNAMIC(a,b) (((int)a == 0 || (int)b == 0) ? 0 \ - : ((int)a == 1 || (int)b == 1) ? 1 \ - : ((int)a == Dynamic || (int)b == Dynamic) ? Dynamic \ - : ((int)a <= (int)b) ? (int)a : (int)b) - -// EIGEN_SIZE_MIN_PREFER_FIXED is a variant of EIGEN_SIZE_MIN_PREFER_DYNAMIC comparing MaxSizes. The difference is that finite values -// now have priority over Dynamic, so that min(3, Dynamic) gives 3. Indeed, whatever the actual value is -// (between 0 and 3), it is not more than 3. -#define EIGEN_SIZE_MIN_PREFER_FIXED(a,b) (((int)a == 0 || (int)b == 0) ? 0 \ - : ((int)a == 1 || (int)b == 1) ? 1 \ - : ((int)a == Dynamic && (int)b == Dynamic) ? Dynamic \ - : ((int)a == Dynamic) ? (int)b \ - : ((int)b == Dynamic) ? (int)a \ - : ((int)a <= (int)b) ? (int)a : (int)b) - -// see EIGEN_SIZE_MIN_PREFER_DYNAMIC. No need for a separate variant for MaxSizes here. -#define EIGEN_SIZE_MAX(a,b) (((int)a == Dynamic || (int)b == Dynamic) ? Dynamic \ - : ((int)a >= (int)b) ? (int)a : (int)b) - -#define EIGEN_LOGICAL_XOR(a,b) (((a) || (b)) && !((a) && (b))) - -#define EIGEN_IMPLIES(a,b) (!(a) || (b)) - -// the expression type of a standard coefficient wise binary operation -#define EIGEN_CWISE_BINARY_RETURN_TYPE(LHS,RHS,OPNAME) \ - CwiseBinaryOp< \ - EIGEN_CAT(EIGEN_CAT(internal::scalar_,OPNAME),_op)< \ - typename internal::traits::Scalar, \ - typename internal::traits::Scalar \ - >, \ - const LHS, \ - const RHS \ - > - -#define EIGEN_MAKE_CWISE_BINARY_OP(METHOD,OPNAME) \ - template \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const EIGEN_CWISE_BINARY_RETURN_TYPE(Derived,OtherDerived,OPNAME) \ - (METHOD)(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const \ - { \ - return EIGEN_CWISE_BINARY_RETURN_TYPE(Derived,OtherDerived,OPNAME)(derived(), other.derived()); \ - } - -#define EIGEN_SCALAR_BINARY_SUPPORTED(OPNAME,TYPEA,TYPEB) \ - (Eigen::internal::has_ReturnType > >::value) - -#define EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(EXPR,SCALAR,OPNAME) \ - CwiseBinaryOp::Scalar,SCALAR>, const EXPR, \ - const typename internal::plain_constant_type::type> - -#define EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(SCALAR,EXPR,OPNAME) \ - CwiseBinaryOp::Scalar>, \ - const typename internal::plain_constant_type::type, const EXPR> - -// Workaround for MSVC 2010 (see ML thread "patch with compile for for MSVC 2010") -#if EIGEN_COMP_MSVC_STRICT && (EIGEN_COMP_MSVC_STRICT<=1600) -#define EIGEN_MSVC10_WORKAROUND_BINARYOP_RETURN_TYPE(X) typename internal::enable_if::type -#else -#define EIGEN_MSVC10_WORKAROUND_BINARYOP_RETURN_TYPE(X) X -#endif - -#define EIGEN_MAKE_SCALAR_BINARY_OP_ONTHERIGHT(METHOD,OPNAME) \ - template EIGEN_DEVICE_FUNC inline \ - EIGEN_MSVC10_WORKAROUND_BINARYOP_RETURN_TYPE(const EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(Derived,typename internal::promote_scalar_arg::type,OPNAME))\ - (METHOD)(const T& scalar) const { \ - typedef typename internal::promote_scalar_arg::type PromotedT; \ - return EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(Derived,PromotedT,OPNAME)(derived(), \ - typename internal::plain_constant_type::type(derived().rows(), derived().cols(), internal::scalar_constant_op(scalar))); \ - } - -#define EIGEN_MAKE_SCALAR_BINARY_OP_ONTHELEFT(METHOD,OPNAME) \ - template EIGEN_DEVICE_FUNC inline friend \ - EIGEN_MSVC10_WORKAROUND_BINARYOP_RETURN_TYPE(const EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(typename internal::promote_scalar_arg::type,Derived,OPNAME)) \ - (METHOD)(const T& scalar, const StorageBaseType& matrix) { \ - typedef typename internal::promote_scalar_arg::type PromotedT; \ - return EIGEN_SCALAR_BINARYOP_EXPR_RETURN_TYPE(PromotedT,Derived,OPNAME)( \ - typename internal::plain_constant_type::type(matrix.derived().rows(), matrix.derived().cols(), internal::scalar_constant_op(scalar)), matrix.derived()); \ - } - -#define EIGEN_MAKE_SCALAR_BINARY_OP(METHOD,OPNAME) \ - EIGEN_MAKE_SCALAR_BINARY_OP_ONTHELEFT(METHOD,OPNAME) \ - EIGEN_MAKE_SCALAR_BINARY_OP_ONTHERIGHT(METHOD,OPNAME) - - -#ifdef EIGEN_EXCEPTIONS -# define EIGEN_THROW_X(X) throw X -# define EIGEN_THROW throw -# define EIGEN_TRY try -# define EIGEN_CATCH(X) catch (X) -#else -# ifdef EIGEN_CUDA_ARCH -# define EIGEN_THROW_X(X) asm("trap;") -# define EIGEN_THROW asm("trap;") -# else -# define EIGEN_THROW_X(X) std::abort() -# define EIGEN_THROW std::abort() -# endif -# define EIGEN_TRY if (true) -# define EIGEN_CATCH(X) else -#endif - - -#if EIGEN_HAS_CXX11_NOEXCEPT -# define EIGEN_INCLUDE_TYPE_TRAITS -# define EIGEN_NOEXCEPT noexcept -# define EIGEN_NOEXCEPT_IF(x) noexcept(x) -# define EIGEN_NO_THROW noexcept(true) -# define EIGEN_EXCEPTION_SPEC(X) noexcept(false) -#else -# define EIGEN_NOEXCEPT -# define EIGEN_NOEXCEPT_IF(x) -# define EIGEN_NO_THROW throw() -# define EIGEN_EXCEPTION_SPEC(X) throw(X) -#endif - -#endif // EIGEN_MACROS_H diff --git a/Eigen/src/Core/util/Memory.h b/Eigen/src/Core/util/Memory.h deleted file mode 100644 index c455f92a1..000000000 --- a/Eigen/src/Core/util/Memory.h +++ /dev/null @@ -1,985 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// Copyright (C) 2008-2009 Benoit Jacob -// Copyright (C) 2009 Kenneth Riddile -// Copyright (C) 2010 Hauke Heibel -// Copyright (C) 2010 Thomas Capricelli -// Copyright (C) 2013 Pavel Holoborodko -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -/***************************************************************************** -*** Platform checks for aligned malloc functions *** -*****************************************************************************/ - -#ifndef EIGEN_MEMORY_H -#define EIGEN_MEMORY_H - -#ifndef EIGEN_MALLOC_ALREADY_ALIGNED - -// Try to determine automatically if malloc is already aligned. - -// On 64-bit systems, glibc's malloc returns 16-byte-aligned pointers, see: -// http://www.gnu.org/s/libc/manual/html_node/Aligned-Memory-Blocks.html -// This is true at least since glibc 2.8. -// This leaves the question how to detect 64-bit. According to this document, -// http://gcc.fyxm.net/summit/2003/Porting%20to%2064%20bit.pdf -// page 114, "[The] LP64 model [...] is used by all 64-bit UNIX ports" so it's indeed -// quite safe, at least within the context of glibc, to equate 64-bit with LP64. -#if defined(__GLIBC__) && ((__GLIBC__>=2 && __GLIBC_MINOR__ >= 8) || __GLIBC__>2) \ - && defined(__LP64__) && ! defined( __SANITIZE_ADDRESS__ ) && (EIGEN_DEFAULT_ALIGN_BYTES == 16) - #define EIGEN_GLIBC_MALLOC_ALREADY_ALIGNED 1 -#else - #define EIGEN_GLIBC_MALLOC_ALREADY_ALIGNED 0 -#endif - -// FreeBSD 6 seems to have 16-byte aligned malloc -// See http://svn.freebsd.org/viewvc/base/stable/6/lib/libc/stdlib/malloc.c?view=markup -// FreeBSD 7 seems to have 16-byte aligned malloc except on ARM and MIPS architectures -// See http://svn.freebsd.org/viewvc/base/stable/7/lib/libc/stdlib/malloc.c?view=markup -#if defined(__FreeBSD__) && !(EIGEN_ARCH_ARM || EIGEN_ARCH_MIPS) && (EIGEN_DEFAULT_ALIGN_BYTES == 16) - #define EIGEN_FREEBSD_MALLOC_ALREADY_ALIGNED 1 -#else - #define EIGEN_FREEBSD_MALLOC_ALREADY_ALIGNED 0 -#endif - -#if (EIGEN_OS_MAC && (EIGEN_DEFAULT_ALIGN_BYTES == 16)) \ - || (EIGEN_OS_WIN64 && (EIGEN_DEFAULT_ALIGN_BYTES == 16)) \ - || EIGEN_GLIBC_MALLOC_ALREADY_ALIGNED \ - || EIGEN_FREEBSD_MALLOC_ALREADY_ALIGNED - #define EIGEN_MALLOC_ALREADY_ALIGNED 1 -#else - #define EIGEN_MALLOC_ALREADY_ALIGNED 0 -#endif - -#endif - -namespace Eigen { - -namespace internal { - -EIGEN_DEVICE_FUNC -inline void throw_std_bad_alloc() -{ - #ifdef EIGEN_EXCEPTIONS - throw std::bad_alloc(); - #else - std::size_t huge = static_cast(-1); - new int[huge]; - #endif -} - -/***************************************************************************** -*** Implementation of handmade aligned functions *** -*****************************************************************************/ - -/* ----- Hand made implementations of aligned malloc/free and realloc ----- */ - -/** \internal Like malloc, but the returned pointer is guaranteed to be 16-byte aligned. - * Fast, but wastes 16 additional bytes of memory. Does not throw any exception. - */ -inline void* handmade_aligned_malloc(std::size_t size) -{ - void *original = std::malloc(size+EIGEN_DEFAULT_ALIGN_BYTES); - if (original == 0) return 0; - void *aligned = reinterpret_cast((reinterpret_cast(original) & ~(std::size_t(EIGEN_DEFAULT_ALIGN_BYTES-1))) + EIGEN_DEFAULT_ALIGN_BYTES); - *(reinterpret_cast(aligned) - 1) = original; - return aligned; -} - -/** \internal Frees memory allocated with handmade_aligned_malloc */ -inline void handmade_aligned_free(void *ptr) -{ - if (ptr) std::free(*(reinterpret_cast(ptr) - 1)); -} - -/** \internal - * \brief Reallocates aligned memory. - * Since we know that our handmade version is based on std::malloc - * we can use std::realloc to implement efficient reallocation. - */ -inline void* handmade_aligned_realloc(void* ptr, std::size_t size, std::size_t = 0) -{ - if (ptr == 0) return handmade_aligned_malloc(size); - void *original = *(reinterpret_cast(ptr) - 1); - std::ptrdiff_t previous_offset = static_cast(ptr)-static_cast(original); - original = std::realloc(original,size+EIGEN_DEFAULT_ALIGN_BYTES); - if (original == 0) return 0; - void *aligned = reinterpret_cast((reinterpret_cast(original) & ~(std::size_t(EIGEN_DEFAULT_ALIGN_BYTES-1))) + EIGEN_DEFAULT_ALIGN_BYTES); - void *previous_aligned = static_cast(original)+previous_offset; - if(aligned!=previous_aligned) - std::memmove(aligned, previous_aligned, size); - - *(reinterpret_cast(aligned) - 1) = original; - return aligned; -} - -/***************************************************************************** -*** Implementation of portable aligned versions of malloc/free/realloc *** -*****************************************************************************/ - -#ifdef EIGEN_NO_MALLOC -EIGEN_DEVICE_FUNC inline void check_that_malloc_is_allowed() -{ - eigen_assert(false && "heap allocation is forbidden (EIGEN_NO_MALLOC is defined)"); -} -#elif defined EIGEN_RUNTIME_NO_MALLOC -EIGEN_DEVICE_FUNC inline bool is_malloc_allowed_impl(bool update, bool new_value = false) -{ - static bool value = true; - if (update == 1) - value = new_value; - return value; -} -EIGEN_DEVICE_FUNC inline bool is_malloc_allowed() { return is_malloc_allowed_impl(false); } -EIGEN_DEVICE_FUNC inline bool set_is_malloc_allowed(bool new_value) { return is_malloc_allowed_impl(true, new_value); } -EIGEN_DEVICE_FUNC inline void check_that_malloc_is_allowed() -{ - eigen_assert(is_malloc_allowed() && "heap allocation is forbidden (EIGEN_RUNTIME_NO_MALLOC is defined and g_is_malloc_allowed is false)"); -} -#else -EIGEN_DEVICE_FUNC inline void check_that_malloc_is_allowed() -{} -#endif - -/** \internal Allocates \a size bytes. The returned pointer is guaranteed to have 16 or 32 bytes alignment depending on the requirements. - * On allocation error, the returned pointer is null, and std::bad_alloc is thrown. - */ -EIGEN_DEVICE_FUNC inline void* aligned_malloc(std::size_t size) -{ - check_that_malloc_is_allowed(); - - void *result; - #if (EIGEN_DEFAULT_ALIGN_BYTES==0) || EIGEN_MALLOC_ALREADY_ALIGNED - result = std::malloc(size); - #if EIGEN_DEFAULT_ALIGN_BYTES==16 - eigen_assert((size<16 || (std::size_t(result)%16)==0) && "System's malloc returned an unaligned pointer. Compile with EIGEN_MALLOC_ALREADY_ALIGNED=0 to fallback to handmade alignd memory allocator."); - #endif - #else - result = handmade_aligned_malloc(size); - #endif - - if(!result && size) - throw_std_bad_alloc(); - - return result; -} - -/** \internal Frees memory allocated with aligned_malloc. */ -EIGEN_DEVICE_FUNC inline void aligned_free(void *ptr) -{ - #if (EIGEN_DEFAULT_ALIGN_BYTES==0) || EIGEN_MALLOC_ALREADY_ALIGNED - std::free(ptr); - #else - handmade_aligned_free(ptr); - #endif -} - -/** - * \internal - * \brief Reallocates an aligned block of memory. - * \throws std::bad_alloc on allocation failure - */ -inline void* aligned_realloc(void *ptr, std::size_t new_size, std::size_t old_size) -{ - EIGEN_UNUSED_VARIABLE(old_size); - - void *result; -#if (EIGEN_DEFAULT_ALIGN_BYTES==0) || EIGEN_MALLOC_ALREADY_ALIGNED - result = std::realloc(ptr,new_size); -#else - result = handmade_aligned_realloc(ptr,new_size,old_size); -#endif - - if (!result && new_size) - throw_std_bad_alloc(); - - return result; -} - -/***************************************************************************** -*** Implementation of conditionally aligned functions *** -*****************************************************************************/ - -/** \internal Allocates \a size bytes. If Align is true, then the returned ptr is 16-byte-aligned. - * On allocation error, the returned pointer is null, and a std::bad_alloc is thrown. - */ -template EIGEN_DEVICE_FUNC inline void* conditional_aligned_malloc(std::size_t size) -{ - return aligned_malloc(size); -} - -template<> EIGEN_DEVICE_FUNC inline void* conditional_aligned_malloc(std::size_t size) -{ - check_that_malloc_is_allowed(); - - void *result = std::malloc(size); - if(!result && size) - throw_std_bad_alloc(); - return result; -} - -/** \internal Frees memory allocated with conditional_aligned_malloc */ -template EIGEN_DEVICE_FUNC inline void conditional_aligned_free(void *ptr) -{ - aligned_free(ptr); -} - -template<> EIGEN_DEVICE_FUNC inline void conditional_aligned_free(void *ptr) -{ - std::free(ptr); -} - -template inline void* conditional_aligned_realloc(void* ptr, std::size_t new_size, std::size_t old_size) -{ - return aligned_realloc(ptr, new_size, old_size); -} - -template<> inline void* conditional_aligned_realloc(void* ptr, std::size_t new_size, std::size_t) -{ - return std::realloc(ptr, new_size); -} - -/***************************************************************************** -*** Construction/destruction of array elements *** -*****************************************************************************/ - -/** \internal Destructs the elements of an array. - * The \a size parameters tells on how many objects to call the destructor of T. - */ -template EIGEN_DEVICE_FUNC inline void destruct_elements_of_array(T *ptr, std::size_t size) -{ - // always destruct an array starting from the end. - if(ptr) - while(size) ptr[--size].~T(); -} - -/** \internal Constructs the elements of an array. - * The \a size parameter tells on how many objects to call the constructor of T. - */ -template EIGEN_DEVICE_FUNC inline T* construct_elements_of_array(T *ptr, std::size_t size) -{ - std::size_t i; - EIGEN_TRY - { - for (i = 0; i < size; ++i) ::new (ptr + i) T; - return ptr; - } - EIGEN_CATCH(...) - { - destruct_elements_of_array(ptr, i); - EIGEN_THROW; - } - return NULL; -} - -/***************************************************************************** -*** Implementation of aligned new/delete-like functions *** -*****************************************************************************/ - -template -EIGEN_DEVICE_FUNC EIGEN_ALWAYS_INLINE void check_size_for_overflow(std::size_t size) -{ - if(size > std::size_t(-1) / sizeof(T)) - throw_std_bad_alloc(); -} - -/** \internal Allocates \a size objects of type T. The returned pointer is guaranteed to have 16 bytes alignment. - * On allocation error, the returned pointer is undefined, but a std::bad_alloc is thrown. - * The default constructor of T is called. - */ -template EIGEN_DEVICE_FUNC inline T* aligned_new(std::size_t size) -{ - check_size_for_overflow(size); - T *result = reinterpret_cast(aligned_malloc(sizeof(T)*size)); - EIGEN_TRY - { - return construct_elements_of_array(result, size); - } - EIGEN_CATCH(...) - { - aligned_free(result); - EIGEN_THROW; - } - return result; -} - -template EIGEN_DEVICE_FUNC inline T* conditional_aligned_new(std::size_t size) -{ - check_size_for_overflow(size); - T *result = reinterpret_cast(conditional_aligned_malloc(sizeof(T)*size)); - EIGEN_TRY - { - return construct_elements_of_array(result, size); - } - EIGEN_CATCH(...) - { - conditional_aligned_free(result); - EIGEN_THROW; - } - return result; -} - -/** \internal Deletes objects constructed with aligned_new - * The \a size parameters tells on how many objects to call the destructor of T. - */ -template EIGEN_DEVICE_FUNC inline void aligned_delete(T *ptr, std::size_t size) -{ - destruct_elements_of_array(ptr, size); - aligned_free(ptr); -} - -/** \internal Deletes objects constructed with conditional_aligned_new - * The \a size parameters tells on how many objects to call the destructor of T. - */ -template EIGEN_DEVICE_FUNC inline void conditional_aligned_delete(T *ptr, std::size_t size) -{ - destruct_elements_of_array(ptr, size); - conditional_aligned_free(ptr); -} - -template EIGEN_DEVICE_FUNC inline T* conditional_aligned_realloc_new(T* pts, std::size_t new_size, std::size_t old_size) -{ - check_size_for_overflow(new_size); - check_size_for_overflow(old_size); - if(new_size < old_size) - destruct_elements_of_array(pts+new_size, old_size-new_size); - T *result = reinterpret_cast(conditional_aligned_realloc(reinterpret_cast(pts), sizeof(T)*new_size, sizeof(T)*old_size)); - if(new_size > old_size) - { - EIGEN_TRY - { - construct_elements_of_array(result+old_size, new_size-old_size); - } - EIGEN_CATCH(...) - { - conditional_aligned_free(result); - EIGEN_THROW; - } - } - return result; -} - - -template EIGEN_DEVICE_FUNC inline T* conditional_aligned_new_auto(std::size_t size) -{ - if(size==0) - return 0; // short-cut. Also fixes Bug 884 - check_size_for_overflow(size); - T *result = reinterpret_cast(conditional_aligned_malloc(sizeof(T)*size)); - if(NumTraits::RequireInitialization) - { - EIGEN_TRY - { - construct_elements_of_array(result, size); - } - EIGEN_CATCH(...) - { - conditional_aligned_free(result); - EIGEN_THROW; - } - } - return result; -} - -template inline T* conditional_aligned_realloc_new_auto(T* pts, std::size_t new_size, std::size_t old_size) -{ - check_size_for_overflow(new_size); - check_size_for_overflow(old_size); - if(NumTraits::RequireInitialization && (new_size < old_size)) - destruct_elements_of_array(pts+new_size, old_size-new_size); - T *result = reinterpret_cast(conditional_aligned_realloc(reinterpret_cast(pts), sizeof(T)*new_size, sizeof(T)*old_size)); - if(NumTraits::RequireInitialization && (new_size > old_size)) - { - EIGEN_TRY - { - construct_elements_of_array(result+old_size, new_size-old_size); - } - EIGEN_CATCH(...) - { - conditional_aligned_free(result); - EIGEN_THROW; - } - } - return result; -} - -template EIGEN_DEVICE_FUNC inline void conditional_aligned_delete_auto(T *ptr, std::size_t size) -{ - if(NumTraits::RequireInitialization) - destruct_elements_of_array(ptr, size); - conditional_aligned_free(ptr); -} - -/****************************************************************************/ - -/** \internal Returns the index of the first element of the array that is well aligned with respect to the requested \a Alignment. - * - * \tparam Alignment requested alignment in Bytes. - * \param array the address of the start of the array - * \param size the size of the array - * - * \note If no element of the array is well aligned or the requested alignment is not a multiple of a scalar, - * the size of the array is returned. For example with SSE, the requested alignment is typically 16-bytes. If - * packet size for the given scalar type is 1, then everything is considered well-aligned. - * - * \note Otherwise, if the Alignment is larger that the scalar size, we rely on the assumptions that sizeof(Scalar) is a - * power of 2. On the other hand, we do not assume that the array address is a multiple of sizeof(Scalar), as that fails for - * example with Scalar=double on certain 32-bit platforms, see bug #79. - * - * There is also the variant first_aligned(const MatrixBase&) defined in DenseCoeffsBase.h. - * \sa first_default_aligned() - */ -template -EIGEN_DEVICE_FUNC inline Index first_aligned(const Scalar* array, Index size) -{ - const Index ScalarSize = sizeof(Scalar); - const Index AlignmentSize = Alignment / ScalarSize; - const Index AlignmentMask = AlignmentSize-1; - - if(AlignmentSize<=1) - { - // Either the requested alignment if smaller than a scalar, or it exactly match a 1 scalar - // so that all elements of the array have the same alignment. - return 0; - } - else if( (UIntPtr(array) & (sizeof(Scalar)-1)) || (Alignment%ScalarSize)!=0) - { - // The array is not aligned to the size of a single scalar, or the requested alignment is not a multiple of the scalar size. - // Consequently, no element of the array is well aligned. - return size; - } - else - { - Index first = (AlignmentSize - (Index((UIntPtr(array)/sizeof(Scalar))) & AlignmentMask)) & AlignmentMask; - return (first < size) ? first : size; - } -} - -/** \internal Returns the index of the first element of the array that is well aligned with respect the largest packet requirement. - * \sa first_aligned(Scalar*,Index) and first_default_aligned(DenseBase) */ -template -EIGEN_DEVICE_FUNC inline Index first_default_aligned(const Scalar* array, Index size) -{ - typedef typename packet_traits::type DefaultPacketType; - return first_aligned::alignment>(array, size); -} - -/** \internal Returns the smallest integer multiple of \a base and greater or equal to \a size - */ -template -inline Index first_multiple(Index size, Index base) -{ - return ((size+base-1)/base)*base; -} - -// std::copy is much slower than memcpy, so let's introduce a smart_copy which -// use memcpy on trivial types, i.e., on types that does not require an initialization ctor. -template struct smart_copy_helper; - -template EIGEN_DEVICE_FUNC void smart_copy(const T* start, const T* end, T* target) -{ - smart_copy_helper::RequireInitialization>::run(start, end, target); -} - -template struct smart_copy_helper { - EIGEN_DEVICE_FUNC static inline void run(const T* start, const T* end, T* target) - { - IntPtr size = IntPtr(end)-IntPtr(start); - if(size==0) return; - eigen_internal_assert(start!=0 && end!=0 && target!=0); - std::memcpy(target, start, size); - } -}; - -template struct smart_copy_helper { - EIGEN_DEVICE_FUNC static inline void run(const T* start, const T* end, T* target) - { std::copy(start, end, target); } -}; - -// intelligent memmove. falls back to std::memmove for POD types, uses std::copy otherwise. -template struct smart_memmove_helper; - -template void smart_memmove(const T* start, const T* end, T* target) -{ - smart_memmove_helper::RequireInitialization>::run(start, end, target); -} - -template struct smart_memmove_helper { - static inline void run(const T* start, const T* end, T* target) - { - IntPtr size = IntPtr(end)-IntPtr(start); - if(size==0) return; - eigen_internal_assert(start!=0 && end!=0 && target!=0); - std::memmove(target, start, size); - } -}; - -template struct smart_memmove_helper { - static inline void run(const T* start, const T* end, T* target) - { - if (UIntPtr(target) < UIntPtr(start)) - { - std::copy(start, end, target); - } - else - { - std::ptrdiff_t count = (std::ptrdiff_t(end)-std::ptrdiff_t(start)) / sizeof(T); - std::copy_backward(start, end, target + count); - } - } -}; - - -/***************************************************************************** -*** Implementation of runtime stack allocation (falling back to malloc) *** -*****************************************************************************/ - -// you can overwrite Eigen's default behavior regarding alloca by defining EIGEN_ALLOCA -// to the appropriate stack allocation function -#ifndef EIGEN_ALLOCA - #if EIGEN_OS_LINUX || EIGEN_OS_MAC || (defined alloca) - #define EIGEN_ALLOCA alloca - #elif EIGEN_COMP_MSVC - #define EIGEN_ALLOCA _alloca - #endif -#endif - -// This helper class construct the allocated memory, and takes care of destructing and freeing the handled data -// at destruction time. In practice this helper class is mainly useful to avoid memory leak in case of exceptions. -template class aligned_stack_memory_handler : noncopyable -{ - public: - /* Creates a stack_memory_handler responsible for the buffer \a ptr of size \a size. - * Note that \a ptr can be 0 regardless of the other parameters. - * This constructor takes care of constructing/initializing the elements of the buffer if required by the scalar type T (see NumTraits::RequireInitialization). - * In this case, the buffer elements will also be destructed when this handler will be destructed. - * Finally, if \a dealloc is true, then the pointer \a ptr is freed. - **/ - aligned_stack_memory_handler(T* ptr, std::size_t size, bool dealloc) - : m_ptr(ptr), m_size(size), m_deallocate(dealloc) - { - if(NumTraits::RequireInitialization && m_ptr) - Eigen::internal::construct_elements_of_array(m_ptr, size); - } - ~aligned_stack_memory_handler() - { - if(NumTraits::RequireInitialization && m_ptr) - Eigen::internal::destruct_elements_of_array(m_ptr, m_size); - if(m_deallocate) - Eigen::internal::aligned_free(m_ptr); - } - protected: - T* m_ptr; - std::size_t m_size; - bool m_deallocate; -}; - -template class scoped_array : noncopyable -{ - T* m_ptr; -public: - explicit scoped_array(std::ptrdiff_t size) - { - m_ptr = new T[size]; - } - ~scoped_array() - { - delete[] m_ptr; - } - T& operator[](std::ptrdiff_t i) { return m_ptr[i]; } - const T& operator[](std::ptrdiff_t i) const { return m_ptr[i]; } - T* &ptr() { return m_ptr; } - const T* ptr() const { return m_ptr; } - operator const T*() const { return m_ptr; } -}; - -template void swap(scoped_array &a,scoped_array &b) -{ - std::swap(a.ptr(),b.ptr()); -} - -} // end namespace internal - -/** \internal - * Declares, allocates and construct an aligned buffer named NAME of SIZE elements of type TYPE on the stack - * if SIZE is smaller than EIGEN_STACK_ALLOCATION_LIMIT, and if stack allocation is supported by the platform - * (currently, this is Linux and Visual Studio only). Otherwise the memory is allocated on the heap. - * The allocated buffer is automatically deleted when exiting the scope of this declaration. - * If BUFFER is non null, then the declared variable is simply an alias for BUFFER, and no allocation/deletion occurs. - * Here is an example: - * \code - * { - * ei_declare_aligned_stack_constructed_variable(float,data,size,0); - * // use data[0] to data[size-1] - * } - * \endcode - * The underlying stack allocation function can controlled with the EIGEN_ALLOCA preprocessor token. - */ -#ifdef EIGEN_ALLOCA - - #if EIGEN_DEFAULT_ALIGN_BYTES>0 - // We always manually re-align the result of EIGEN_ALLOCA. - // If alloca is already aligned, the compiler should be smart enough to optimize away the re-alignment. - #define EIGEN_ALIGNED_ALLOCA(SIZE) reinterpret_cast((internal::UIntPtr(EIGEN_ALLOCA(SIZE+EIGEN_DEFAULT_ALIGN_BYTES-1)) + EIGEN_DEFAULT_ALIGN_BYTES-1) & ~(std::size_t(EIGEN_DEFAULT_ALIGN_BYTES-1))) - #else - #define EIGEN_ALIGNED_ALLOCA(SIZE) EIGEN_ALLOCA(SIZE) - #endif - - #define ei_declare_aligned_stack_constructed_variable(TYPE,NAME,SIZE,BUFFER) \ - Eigen::internal::check_size_for_overflow(SIZE); \ - TYPE* NAME = (BUFFER)!=0 ? (BUFFER) \ - : reinterpret_cast( \ - (sizeof(TYPE)*SIZE<=EIGEN_STACK_ALLOCATION_LIMIT) ? EIGEN_ALIGNED_ALLOCA(sizeof(TYPE)*SIZE) \ - : Eigen::internal::aligned_malloc(sizeof(TYPE)*SIZE) ); \ - Eigen::internal::aligned_stack_memory_handler EIGEN_CAT(NAME,_stack_memory_destructor)((BUFFER)==0 ? NAME : 0,SIZE,sizeof(TYPE)*SIZE>EIGEN_STACK_ALLOCATION_LIMIT) - -#else - - #define ei_declare_aligned_stack_constructed_variable(TYPE,NAME,SIZE,BUFFER) \ - Eigen::internal::check_size_for_overflow(SIZE); \ - TYPE* NAME = (BUFFER)!=0 ? BUFFER : reinterpret_cast(Eigen::internal::aligned_malloc(sizeof(TYPE)*SIZE)); \ - Eigen::internal::aligned_stack_memory_handler EIGEN_CAT(NAME,_stack_memory_destructor)((BUFFER)==0 ? NAME : 0,SIZE,true) - -#endif - - -/***************************************************************************** -*** Implementation of EIGEN_MAKE_ALIGNED_OPERATOR_NEW [_IF] *** -*****************************************************************************/ - -#if EIGEN_MAX_ALIGN_BYTES!=0 - #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_NOTHROW(NeedsToAlign) \ - void* operator new(std::size_t size, const std::nothrow_t&) EIGEN_NO_THROW { \ - EIGEN_TRY { return Eigen::internal::conditional_aligned_malloc(size); } \ - EIGEN_CATCH (...) { return 0; } \ - } - #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(NeedsToAlign) \ - void *operator new(std::size_t size) { \ - return Eigen::internal::conditional_aligned_malloc(size); \ - } \ - void *operator new[](std::size_t size) { \ - return Eigen::internal::conditional_aligned_malloc(size); \ - } \ - void operator delete(void * ptr) EIGEN_NO_THROW { Eigen::internal::conditional_aligned_free(ptr); } \ - void operator delete[](void * ptr) EIGEN_NO_THROW { Eigen::internal::conditional_aligned_free(ptr); } \ - void operator delete(void * ptr, std::size_t /* sz */) EIGEN_NO_THROW { Eigen::internal::conditional_aligned_free(ptr); } \ - void operator delete[](void * ptr, std::size_t /* sz */) EIGEN_NO_THROW { Eigen::internal::conditional_aligned_free(ptr); } \ - /* in-place new and delete. since (at least afaik) there is no actual */ \ - /* memory allocated we can safely let the default implementation handle */ \ - /* this particular case. */ \ - static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } \ - static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } \ - void operator delete(void * memory, void *ptr) EIGEN_NO_THROW { return ::operator delete(memory,ptr); } \ - void operator delete[](void * memory, void *ptr) EIGEN_NO_THROW { return ::operator delete[](memory,ptr); } \ - /* nothrow-new (returns zero instead of std::bad_alloc) */ \ - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_NOTHROW(NeedsToAlign) \ - void operator delete(void *ptr, const std::nothrow_t&) EIGEN_NO_THROW { \ - Eigen::internal::conditional_aligned_free(ptr); \ - } \ - typedef void eigen_aligned_operator_new_marker_type; -#else - #define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(NeedsToAlign) -#endif - -#define EIGEN_MAKE_ALIGNED_OPERATOR_NEW EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(true) -#define EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(Scalar,Size) \ - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(bool(((Size)!=Eigen::Dynamic) && ((sizeof(Scalar)*(Size))%EIGEN_MAX_ALIGN_BYTES==0))) - -/****************************************************************************/ - -/** \class aligned_allocator -* \ingroup Core_Module -* -* \brief STL compatible allocator to use with types requiring a non standrad alignment. -* -* The memory is aligned as for dynamically aligned matrix/array types such as MatrixXd. -* By default, it will thus provide at least 16 bytes alignment and more in following cases: -* - 32 bytes alignment if AVX is enabled. -* - 64 bytes alignment if AVX512 is enabled. -* -* This can be controled using the \c EIGEN_MAX_ALIGN_BYTES macro as documented -* \link TopicPreprocessorDirectivesPerformance there \endlink. -* -* Example: -* \code -* // Matrix4f requires 16 bytes alignment: -* std::map< int, Matrix4f, std::less, -* aligned_allocator > > my_map_mat4; -* // Vector3f does not require 16 bytes alignment, no need to use Eigen's allocator: -* std::map< int, Vector3f > my_map_vec3; -* \endcode -* -* \sa \blank \ref TopicStlContainers. -*/ -template -class aligned_allocator : public std::allocator -{ -public: - typedef std::size_t size_type; - typedef std::ptrdiff_t difference_type; - typedef T* pointer; - typedef const T* const_pointer; - typedef T& reference; - typedef const T& const_reference; - typedef T value_type; - - template - struct rebind - { - typedef aligned_allocator other; - }; - - aligned_allocator() : std::allocator() {} - - aligned_allocator(const aligned_allocator& other) : std::allocator(other) {} - - template - aligned_allocator(const aligned_allocator& other) : std::allocator(other) {} - - ~aligned_allocator() {} - - pointer allocate(size_type num, const void* /*hint*/ = 0) - { - internal::check_size_for_overflow(num); - return static_cast( internal::aligned_malloc(num * sizeof(T)) ); - } - - void deallocate(pointer p, size_type /*num*/) - { - internal::aligned_free(p); - } -}; - -//---------- Cache sizes ---------- - -#if !defined(EIGEN_NO_CPUID) -# if EIGEN_COMP_GNUC && EIGEN_ARCH_i386_OR_x86_64 -# if defined(__PIC__) && EIGEN_ARCH_i386 - // Case for x86 with PIC -# define EIGEN_CPUID(abcd,func,id) \ - __asm__ __volatile__ ("xchgl %%ebx, %k1;cpuid; xchgl %%ebx,%k1": "=a" (abcd[0]), "=&r" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "a" (func), "c" (id)); -# elif defined(__PIC__) && EIGEN_ARCH_x86_64 - // Case for x64 with PIC. In theory this is only a problem with recent gcc and with medium or large code model, not with the default small code model. - // However, we cannot detect which code model is used, and the xchg overhead is negligible anyway. -# define EIGEN_CPUID(abcd,func,id) \ - __asm__ __volatile__ ("xchg{q}\t{%%}rbx, %q1; cpuid; xchg{q}\t{%%}rbx, %q1": "=a" (abcd[0]), "=&r" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (func), "2" (id)); -# else - // Case for x86_64 or x86 w/o PIC -# define EIGEN_CPUID(abcd,func,id) \ - __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (func), "2" (id) ); -# endif -# elif EIGEN_COMP_MSVC -# if (EIGEN_COMP_MSVC > 1500) && EIGEN_ARCH_i386_OR_x86_64 -# define EIGEN_CPUID(abcd,func,id) __cpuidex((int*)abcd,func,id) -# endif -# endif -#endif - -namespace internal { - -#ifdef EIGEN_CPUID - -inline bool cpuid_is_vendor(int abcd[4], const int vendor[3]) -{ - return abcd[1]==vendor[0] && abcd[3]==vendor[1] && abcd[2]==vendor[2]; -} - -inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) -{ - int abcd[4]; - l1 = l2 = l3 = 0; - int cache_id = 0; - int cache_type = 0; - do { - abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; - EIGEN_CPUID(abcd,0x4,cache_id); - cache_type = (abcd[0] & 0x0F) >> 0; - if(cache_type==1||cache_type==3) // data or unified cache - { - int cache_level = (abcd[0] & 0xE0) >> 5; // A[7:5] - int ways = (abcd[1] & 0xFFC00000) >> 22; // B[31:22] - int partitions = (abcd[1] & 0x003FF000) >> 12; // B[21:12] - int line_size = (abcd[1] & 0x00000FFF) >> 0; // B[11:0] - int sets = (abcd[2]); // C[31:0] - - int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1); - - switch(cache_level) - { - case 1: l1 = cache_size; break; - case 2: l2 = cache_size; break; - case 3: l3 = cache_size; break; - default: break; - } - } - cache_id++; - } while(cache_type>0 && cache_id<16); -} - -inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) -{ - int abcd[4]; - abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; - l1 = l2 = l3 = 0; - EIGEN_CPUID(abcd,0x00000002,0); - unsigned char * bytes = reinterpret_cast(abcd)+2; - bool check_for_p2_core2 = false; - for(int i=0; i<14; ++i) - { - switch(bytes[i]) - { - case 0x0A: l1 = 8; break; // 0Ah data L1 cache, 8 KB, 2 ways, 32 byte lines - case 0x0C: l1 = 16; break; // 0Ch data L1 cache, 16 KB, 4 ways, 32 byte lines - case 0x0E: l1 = 24; break; // 0Eh data L1 cache, 24 KB, 6 ways, 64 byte lines - case 0x10: l1 = 16; break; // 10h data L1 cache, 16 KB, 4 ways, 32 byte lines (IA-64) - case 0x15: l1 = 16; break; // 15h code L1 cache, 16 KB, 4 ways, 32 byte lines (IA-64) - case 0x2C: l1 = 32; break; // 2Ch data L1 cache, 32 KB, 8 ways, 64 byte lines - case 0x30: l1 = 32; break; // 30h code L1 cache, 32 KB, 8 ways, 64 byte lines - case 0x60: l1 = 16; break; // 60h data L1 cache, 16 KB, 8 ways, 64 byte lines, sectored - case 0x66: l1 = 8; break; // 66h data L1 cache, 8 KB, 4 ways, 64 byte lines, sectored - case 0x67: l1 = 16; break; // 67h data L1 cache, 16 KB, 4 ways, 64 byte lines, sectored - case 0x68: l1 = 32; break; // 68h data L1 cache, 32 KB, 4 ways, 64 byte lines, sectored - case 0x1A: l2 = 96; break; // code and data L2 cache, 96 KB, 6 ways, 64 byte lines (IA-64) - case 0x22: l3 = 512; break; // code and data L3 cache, 512 KB, 4 ways (!), 64 byte lines, dual-sectored - case 0x23: l3 = 1024; break; // code and data L3 cache, 1024 KB, 8 ways, 64 byte lines, dual-sectored - case 0x25: l3 = 2048; break; // code and data L3 cache, 2048 KB, 8 ways, 64 byte lines, dual-sectored - case 0x29: l3 = 4096; break; // code and data L3 cache, 4096 KB, 8 ways, 64 byte lines, dual-sectored - case 0x39: l2 = 128; break; // code and data L2 cache, 128 KB, 4 ways, 64 byte lines, sectored - case 0x3A: l2 = 192; break; // code and data L2 cache, 192 KB, 6 ways, 64 byte lines, sectored - case 0x3B: l2 = 128; break; // code and data L2 cache, 128 KB, 2 ways, 64 byte lines, sectored - case 0x3C: l2 = 256; break; // code and data L2 cache, 256 KB, 4 ways, 64 byte lines, sectored - case 0x3D: l2 = 384; break; // code and data L2 cache, 384 KB, 6 ways, 64 byte lines, sectored - case 0x3E: l2 = 512; break; // code and data L2 cache, 512 KB, 4 ways, 64 byte lines, sectored - case 0x40: l2 = 0; break; // no integrated L2 cache (P6 core) or L3 cache (P4 core) - case 0x41: l2 = 128; break; // code and data L2 cache, 128 KB, 4 ways, 32 byte lines - case 0x42: l2 = 256; break; // code and data L2 cache, 256 KB, 4 ways, 32 byte lines - case 0x43: l2 = 512; break; // code and data L2 cache, 512 KB, 4 ways, 32 byte lines - case 0x44: l2 = 1024; break; // code and data L2 cache, 1024 KB, 4 ways, 32 byte lines - case 0x45: l2 = 2048; break; // code and data L2 cache, 2048 KB, 4 ways, 32 byte lines - case 0x46: l3 = 4096; break; // code and data L3 cache, 4096 KB, 4 ways, 64 byte lines - case 0x47: l3 = 8192; break; // code and data L3 cache, 8192 KB, 8 ways, 64 byte lines - case 0x48: l2 = 3072; break; // code and data L2 cache, 3072 KB, 12 ways, 64 byte lines - case 0x49: if(l2!=0) l3 = 4096; else {check_for_p2_core2=true; l3 = l2 = 4096;} break;// code and data L3 cache, 4096 KB, 16 ways, 64 byte lines (P4) or L2 for core2 - case 0x4A: l3 = 6144; break; // code and data L3 cache, 6144 KB, 12 ways, 64 byte lines - case 0x4B: l3 = 8192; break; // code and data L3 cache, 8192 KB, 16 ways, 64 byte lines - case 0x4C: l3 = 12288; break; // code and data L3 cache, 12288 KB, 12 ways, 64 byte lines - case 0x4D: l3 = 16384; break; // code and data L3 cache, 16384 KB, 16 ways, 64 byte lines - case 0x4E: l2 = 6144; break; // code and data L2 cache, 6144 KB, 24 ways, 64 byte lines - case 0x78: l2 = 1024; break; // code and data L2 cache, 1024 KB, 4 ways, 64 byte lines - case 0x79: l2 = 128; break; // code and data L2 cache, 128 KB, 8 ways, 64 byte lines, dual-sectored - case 0x7A: l2 = 256; break; // code and data L2 cache, 256 KB, 8 ways, 64 byte lines, dual-sectored - case 0x7B: l2 = 512; break; // code and data L2 cache, 512 KB, 8 ways, 64 byte lines, dual-sectored - case 0x7C: l2 = 1024; break; // code and data L2 cache, 1024 KB, 8 ways, 64 byte lines, dual-sectored - case 0x7D: l2 = 2048; break; // code and data L2 cache, 2048 KB, 8 ways, 64 byte lines - case 0x7E: l2 = 256; break; // code and data L2 cache, 256 KB, 8 ways, 128 byte lines, sect. (IA-64) - case 0x7F: l2 = 512; break; // code and data L2 cache, 512 KB, 2 ways, 64 byte lines - case 0x80: l2 = 512; break; // code and data L2 cache, 512 KB, 8 ways, 64 byte lines - case 0x81: l2 = 128; break; // code and data L2 cache, 128 KB, 8 ways, 32 byte lines - case 0x82: l2 = 256; break; // code and data L2 cache, 256 KB, 8 ways, 32 byte lines - case 0x83: l2 = 512; break; // code and data L2 cache, 512 KB, 8 ways, 32 byte lines - case 0x84: l2 = 1024; break; // code and data L2 cache, 1024 KB, 8 ways, 32 byte lines - case 0x85: l2 = 2048; break; // code and data L2 cache, 2048 KB, 8 ways, 32 byte lines - case 0x86: l2 = 512; break; // code and data L2 cache, 512 KB, 4 ways, 64 byte lines - case 0x87: l2 = 1024; break; // code and data L2 cache, 1024 KB, 8 ways, 64 byte lines - case 0x88: l3 = 2048; break; // code and data L3 cache, 2048 KB, 4 ways, 64 byte lines (IA-64) - case 0x89: l3 = 4096; break; // code and data L3 cache, 4096 KB, 4 ways, 64 byte lines (IA-64) - case 0x8A: l3 = 8192; break; // code and data L3 cache, 8192 KB, 4 ways, 64 byte lines (IA-64) - case 0x8D: l3 = 3072; break; // code and data L3 cache, 3072 KB, 12 ways, 128 byte lines (IA-64) - - default: break; - } - } - if(check_for_p2_core2 && l2 == l3) - l3 = 0; - l1 *= 1024; - l2 *= 1024; - l3 *= 1024; -} - -inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs) -{ - if(max_std_funcs>=4) - queryCacheSizes_intel_direct(l1,l2,l3); - else - queryCacheSizes_intel_codes(l1,l2,l3); -} - -inline void queryCacheSizes_amd(int& l1, int& l2, int& l3) -{ - int abcd[4]; - abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; - EIGEN_CPUID(abcd,0x80000005,0); - l1 = (abcd[2] >> 24) * 1024; // C[31:24] = L1 size in KB - abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; - EIGEN_CPUID(abcd,0x80000006,0); - l2 = (abcd[2] >> 16) * 1024; // C[31;16] = l2 cache size in KB - l3 = ((abcd[3] & 0xFFFC000) >> 18) * 512 * 1024; // D[31;18] = l3 cache size in 512KB -} -#endif - -/** \internal - * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */ -inline void queryCacheSizes(int& l1, int& l2, int& l3) -{ - #ifdef EIGEN_CPUID - int abcd[4]; - const int GenuineIntel[] = {0x756e6547, 0x49656e69, 0x6c65746e}; - const int AuthenticAMD[] = {0x68747541, 0x69746e65, 0x444d4163}; - const int AMDisbetter_[] = {0x69444d41, 0x74656273, 0x21726574}; // "AMDisbetter!" - - // identify the CPU vendor - EIGEN_CPUID(abcd,0x0,0); - int max_std_funcs = abcd[1]; - if(cpuid_is_vendor(abcd,GenuineIntel)) - queryCacheSizes_intel(l1,l2,l3,max_std_funcs); - else if(cpuid_is_vendor(abcd,AuthenticAMD) || cpuid_is_vendor(abcd,AMDisbetter_)) - queryCacheSizes_amd(l1,l2,l3); - else - // by default let's use Intel's API - queryCacheSizes_intel(l1,l2,l3,max_std_funcs); - - // here is the list of other vendors: -// ||cpuid_is_vendor(abcd,"VIA VIA VIA ") -// ||cpuid_is_vendor(abcd,"CyrixInstead") -// ||cpuid_is_vendor(abcd,"CentaurHauls") -// ||cpuid_is_vendor(abcd,"GenuineTMx86") -// ||cpuid_is_vendor(abcd,"TransmetaCPU") -// ||cpuid_is_vendor(abcd,"RiseRiseRise") -// ||cpuid_is_vendor(abcd,"Geode by NSC") -// ||cpuid_is_vendor(abcd,"SiS SiS SiS ") -// ||cpuid_is_vendor(abcd,"UMC UMC UMC ") -// ||cpuid_is_vendor(abcd,"NexGenDriven") - #else - l1 = l2 = l3 = -1; - #endif -} - -/** \internal - * \returns the size in Bytes of the L1 data cache */ -inline int queryL1CacheSize() -{ - int l1(-1), l2, l3; - queryCacheSizes(l1,l2,l3); - return l1; -} - -/** \internal - * \returns the size in Bytes of the L2 or L3 cache if this later is present */ -inline int queryTopLevelCacheSize() -{ - int l1, l2(-1), l3(-1); - queryCacheSizes(l1,l2,l3); - return (std::max)(l2,l3); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_MEMORY_H diff --git a/Eigen/src/Core/util/Meta.h b/Eigen/src/Core/util/Meta.h deleted file mode 100755 index 0fa818008..000000000 --- a/Eigen/src/Core/util/Meta.h +++ /dev/null @@ -1,550 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_META_H -#define EIGEN_META_H - -#if defined(EIGEN_CUDA_ARCH) -#include -#include -#endif - -#if EIGEN_COMP_ICC>=1600 && __cplusplus >= 201103L -#include -#endif - -namespace Eigen { - -typedef EIGEN_DEFAULT_DENSE_INDEX_TYPE DenseIndex; - -/** - * \brief The Index type as used for the API. - * \details To change this, \c \#define the preprocessor symbol \c EIGEN_DEFAULT_DENSE_INDEX_TYPE. - * \sa \blank \ref TopicPreprocessorDirectives, StorageIndex. - */ - -typedef EIGEN_DEFAULT_DENSE_INDEX_TYPE Index; - -namespace internal { - -/** \internal - * \file Meta.h - * This file contains generic metaprogramming classes which are not specifically related to Eigen. - * \note In case you wonder, yes we're aware that Boost already provides all these features, - * we however don't want to add a dependency to Boost. - */ - -// Only recent versions of ICC complain about using ptrdiff_t to hold pointers, -// and older versions do not provide *intptr_t types. -#if EIGEN_COMP_ICC>=1600 && __cplusplus >= 201103L -typedef std::intptr_t IntPtr; -typedef std::uintptr_t UIntPtr; -#else -typedef std::ptrdiff_t IntPtr; -typedef std::size_t UIntPtr; -#endif - -struct true_type { enum { value = 1 }; }; -struct false_type { enum { value = 0 }; }; - -template -struct conditional { typedef Then type; }; - -template -struct conditional { typedef Else type; }; - -template struct is_same { enum { value = 0 }; }; -template struct is_same { enum { value = 1 }; }; - -template struct remove_reference { typedef T type; }; -template struct remove_reference { typedef T type; }; - -template struct remove_pointer { typedef T type; }; -template struct remove_pointer { typedef T type; }; -template struct remove_pointer { typedef T type; }; - -template struct remove_const { typedef T type; }; -template struct remove_const { typedef T type; }; -template struct remove_const { typedef T type[]; }; -template struct remove_const { typedef T type[Size]; }; - -template struct remove_all { typedef T type; }; -template struct remove_all { typedef typename remove_all::type type; }; -template struct remove_all { typedef typename remove_all::type type; }; -template struct remove_all { typedef typename remove_all::type type; }; -template struct remove_all { typedef typename remove_all::type type; }; -template struct remove_all { typedef typename remove_all::type type; }; - -template struct is_arithmetic { enum { value = false }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic{ enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; -template<> struct is_arithmetic { enum { value = true }; }; - -#if EIGEN_HAS_CXX11 -using std::is_integral; -#else -template struct is_integral { enum { value = false }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -template<> struct is_integral { enum { value = true }; }; -#endif - - -template struct add_const { typedef const T type; }; -template struct add_const { typedef T& type; }; - -template struct is_const { enum { value = 0 }; }; -template struct is_const { enum { value = 1 }; }; - -template struct add_const_on_value_type { typedef const T type; }; -template struct add_const_on_value_type { typedef T const& type; }; -template struct add_const_on_value_type { typedef T const* type; }; -template struct add_const_on_value_type { typedef T const* const type; }; -template struct add_const_on_value_type { typedef T const* const type; }; - - -template -struct is_convertible_impl -{ -private: - struct any_conversion - { - template any_conversion(const volatile T&); - template any_conversion(T&); - }; - struct yes {int a[1];}; - struct no {int a[2];}; - - static yes test(const To&, int); - static no test(any_conversion, ...); - -public: - static From ms_from; -#ifdef __INTEL_COMPILER - #pragma warning push - #pragma warning ( disable : 2259 ) -#endif - enum { value = sizeof(test(ms_from, 0))==sizeof(yes) }; -#ifdef __INTEL_COMPILER - #pragma warning pop -#endif -}; - -template -struct is_convertible -{ - enum { value = is_convertible_impl::type, - typename remove_all::type>::value }; -}; - -/** \internal Allows to enable/disable an overload - * according to a compile time condition. - */ -template struct enable_if; - -template struct enable_if -{ typedef T type; }; - -#if defined(EIGEN_CUDA_ARCH) -#if !defined(__FLT_EPSILON__) -#define __FLT_EPSILON__ FLT_EPSILON -#define __DBL_EPSILON__ DBL_EPSILON -#endif - -namespace device { - -template struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static T epsilon() { return 0; } - static T (max)() { assert(false && "Highest not supported for this type"); } - static T (min)() { assert(false && "Lowest not supported for this type"); } - static T infinity() { assert(false && "Infinity not supported for this type"); } - static T quiet_NaN() { assert(false && "quiet_NaN not supported for this type"); } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static float epsilon() { return __FLT_EPSILON__; } - EIGEN_DEVICE_FUNC - static float (max)() { return CUDART_MAX_NORMAL_F; } - EIGEN_DEVICE_FUNC - static float (min)() { return FLT_MIN; } - EIGEN_DEVICE_FUNC - static float infinity() { return CUDART_INF_F; } - EIGEN_DEVICE_FUNC - static float quiet_NaN() { return CUDART_NAN_F; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static double epsilon() { return __DBL_EPSILON__; } - EIGEN_DEVICE_FUNC - static double (max)() { return DBL_MAX; } - EIGEN_DEVICE_FUNC - static double (min)() { return DBL_MIN; } - EIGEN_DEVICE_FUNC - static double infinity() { return CUDART_INF; } - EIGEN_DEVICE_FUNC - static double quiet_NaN() { return CUDART_NAN; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static int epsilon() { return 0; } - EIGEN_DEVICE_FUNC - static int (max)() { return INT_MAX; } - EIGEN_DEVICE_FUNC - static int (min)() { return INT_MIN; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static unsigned int epsilon() { return 0; } - EIGEN_DEVICE_FUNC - static unsigned int (max)() { return UINT_MAX; } - EIGEN_DEVICE_FUNC - static unsigned int (min)() { return 0; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static long epsilon() { return 0; } - EIGEN_DEVICE_FUNC - static long (max)() { return LONG_MAX; } - EIGEN_DEVICE_FUNC - static long (min)() { return LONG_MIN; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static unsigned long epsilon() { return 0; } - EIGEN_DEVICE_FUNC - static unsigned long (max)() { return ULONG_MAX; } - EIGEN_DEVICE_FUNC - static unsigned long (min)() { return 0; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static long long epsilon() { return 0; } - EIGEN_DEVICE_FUNC - static long long (max)() { return LLONG_MAX; } - EIGEN_DEVICE_FUNC - static long long (min)() { return LLONG_MIN; } -}; -template<> struct numeric_limits -{ - EIGEN_DEVICE_FUNC - static unsigned long long epsilon() { return 0; } - EIGEN_DEVICE_FUNC - static unsigned long long (max)() { return ULLONG_MAX; } - EIGEN_DEVICE_FUNC - static unsigned long long (min)() { return 0; } -}; - -} - -#endif - -/** \internal - * A base class do disable default copy ctor and copy assignement operator. - */ -class noncopyable -{ - EIGEN_DEVICE_FUNC noncopyable(const noncopyable&); - EIGEN_DEVICE_FUNC const noncopyable& operator=(const noncopyable&); -protected: - EIGEN_DEVICE_FUNC noncopyable() {} - EIGEN_DEVICE_FUNC ~noncopyable() {} -}; - -/** \internal - * Provides access to the number of elements in the object of as a compile-time constant expression. - * It "returns" Eigen::Dynamic if the size cannot be resolved at compile-time (default). - * - * Similar to std::tuple_size, but more general. - * - * It currently supports: - * - any types T defining T::SizeAtCompileTime - * - plain C arrays as T[N] - * - std::array (c++11) - * - some internal types such as SingleRange and AllRange - * - * The second template parameter eases SFINAE-based specializations. - */ -template struct array_size { - enum { value = Dynamic }; -}; - -template struct array_size::type> { - enum { value = T::SizeAtCompileTime }; -}; - -template struct array_size { - enum { value = N }; -}; -template struct array_size { - enum { value = N }; -}; - -#if EIGEN_HAS_CXX11 -template struct array_size > { - enum { value = N }; -}; -template struct array_size > { - enum { value = N }; -}; -#endif - -/** \internal - * Analogue of the std::size free function. - * It returns the size of the container or view \a x of type \c T - * - * It currently supports: - * - any types T defining a member T::size() const - * - plain C arrays as T[N] - * - */ -template -Index size(const T& x) { return x.size(); } - -template -Index size(const T (&) [N]) { return N; } - -/** \internal - * Convenient struct to get the result type of a unary or binary functor. - * - * It supports both the current STL mechanism (using the result_type member) as well as - * upcoming next STL generation (using a templated result member). - * If none of these members is provided, then the type of the first argument is returned. FIXME, that behavior is a pretty bad hack. - */ -#if EIGEN_HAS_STD_RESULT_OF -template struct result_of { - typedef typename std::result_of::type type1; - typedef typename remove_all::type type; -}; -#else -template struct result_of { }; - -struct has_none {int a[1];}; -struct has_std_result_type {int a[2];}; -struct has_tr1_result {int a[3];}; - -template -struct unary_result_of_select {typedef typename internal::remove_all::type type;}; - -template -struct unary_result_of_select {typedef typename Func::result_type type;}; - -template -struct unary_result_of_select {typedef typename Func::template result::type type;}; - -template -struct result_of { - template - static has_std_result_type testFunctor(T const *, typename T::result_type const * = 0); - template - static has_tr1_result testFunctor(T const *, typename T::template result::type const * = 0); - static has_none testFunctor(...); - - // note that the following indirection is needed for gcc-3.3 - enum {FunctorType = sizeof(testFunctor(static_cast(0)))}; - typedef typename unary_result_of_select::type type; -}; - -template -struct binary_result_of_select {typedef typename internal::remove_all::type type;}; - -template -struct binary_result_of_select -{typedef typename Func::result_type type;}; - -template -struct binary_result_of_select -{typedef typename Func::template result::type type;}; - -template -struct result_of { - template - static has_std_result_type testFunctor(T const *, typename T::result_type const * = 0); - template - static has_tr1_result testFunctor(T const *, typename T::template result::type const * = 0); - static has_none testFunctor(...); - - // note that the following indirection is needed for gcc-3.3 - enum {FunctorType = sizeof(testFunctor(static_cast(0)))}; - typedef typename binary_result_of_select::type type; -}; - -template -struct ternary_result_of_select {typedef typename internal::remove_all::type type;}; - -template -struct ternary_result_of_select -{typedef typename Func::result_type type;}; - -template -struct ternary_result_of_select -{typedef typename Func::template result::type type;}; - -template -struct result_of { - template - static has_std_result_type testFunctor(T const *, typename T::result_type const * = 0); - template - static has_tr1_result testFunctor(T const *, typename T::template result::type const * = 0); - static has_none testFunctor(...); - - // note that the following indirection is needed for gcc-3.3 - enum {FunctorType = sizeof(testFunctor(static_cast(0)))}; - typedef typename ternary_result_of_select::type type; -}; -#endif - -struct meta_yes { char a[1]; }; -struct meta_no { char a[2]; }; - -// Check whether T::ReturnType does exist -template -struct has_ReturnType -{ - template static meta_yes testFunctor(C const *, typename C::ReturnType const * = 0); - template static meta_no testFunctor(...); - - enum { value = sizeof(testFunctor(static_cast(0))) == sizeof(meta_yes) }; -}; - -template const T* return_ptr(); - -template -struct has_nullary_operator -{ - template static meta_yes testFunctor(C const *,typename enable_if<(sizeof(return_ptr()->operator()())>0)>::type * = 0); - static meta_no testFunctor(...); - - enum { value = sizeof(testFunctor(static_cast(0))) == sizeof(meta_yes) }; -}; - -template -struct has_unary_operator -{ - template static meta_yes testFunctor(C const *,typename enable_if<(sizeof(return_ptr()->operator()(IndexType(0)))>0)>::type * = 0); - static meta_no testFunctor(...); - - enum { value = sizeof(testFunctor(static_cast(0))) == sizeof(meta_yes) }; -}; - -template -struct has_binary_operator -{ - template static meta_yes testFunctor(C const *,typename enable_if<(sizeof(return_ptr()->operator()(IndexType(0),IndexType(0)))>0)>::type * = 0); - static meta_no testFunctor(...); - - enum { value = sizeof(testFunctor(static_cast(0))) == sizeof(meta_yes) }; -}; - -/** \internal In short, it computes int(sqrt(\a Y)) with \a Y an integer. - * Usage example: \code meta_sqrt<1023>::ret \endcode - */ -template Y))) > - // use ?: instead of || just to shut up a stupid gcc 4.3 warning -class meta_sqrt -{ - enum { - MidX = (InfX+SupX)/2, - TakeInf = MidX*MidX > Y ? 1 : 0, - NewInf = int(TakeInf) ? InfX : int(MidX), - NewSup = int(TakeInf) ? int(MidX) : SupX - }; - public: - enum { ret = meta_sqrt::ret }; -}; - -template -class meta_sqrt { public: enum { ret = (SupX*SupX <= Y) ? SupX : InfX }; }; - - -/** \internal Computes the least common multiple of two positive integer A and B - * at compile-time. It implements a naive algorithm testing all multiples of A. - * It thus works better if A>=B. - */ -template -struct meta_least_common_multiple -{ - enum { ret = meta_least_common_multiple::ret }; -}; -template -struct meta_least_common_multiple -{ - enum { ret = A*K }; -}; - -/** \internal determines whether the product of two numeric types is allowed and what the return type is */ -template struct scalar_product_traits -{ - enum { Defined = 0 }; -}; - -// FIXME quick workaround around current limitation of result_of -// template -// struct result_of(ArgType0,ArgType1)> { -// typedef typename scalar_product_traits::type, typename remove_all::type>::ReturnType type; -// }; - -} // end namespace internal - -namespace numext { - -#if defined(EIGEN_CUDA_ARCH) -template EIGEN_DEVICE_FUNC void swap(T &a, T &b) { T tmp = b; b = a; a = tmp; } -#else -template EIGEN_STRONG_INLINE void swap(T &a, T &b) { std::swap(a,b); } -#endif - -#if defined(EIGEN_CUDA_ARCH) -using internal::device::numeric_limits; -#else -using std::numeric_limits; -#endif - -// Integer division with rounding up. -// T is assumed to be an integer type with a>=0, and b>0 -template -T div_ceil(const T &a, const T &b) -{ - return (a+b-1) / b; -} - -} // end namespace numext - -} // end namespace Eigen - -#endif // EIGEN_META_H diff --git a/Eigen/src/Core/util/NonMPL2.h b/Eigen/src/Core/util/NonMPL2.h deleted file mode 100644 index 1af67cf18..000000000 --- a/Eigen/src/Core/util/NonMPL2.h +++ /dev/null @@ -1,3 +0,0 @@ -#ifdef EIGEN_MPL2_ONLY -#error Including non-MPL2 code in EIGEN_MPL2_ONLY mode -#endif diff --git a/Eigen/src/Core/util/ReenableStupidWarnings.h b/Eigen/src/Core/util/ReenableStupidWarnings.h deleted file mode 100644 index 86b60f52f..000000000 --- a/Eigen/src/Core/util/ReenableStupidWarnings.h +++ /dev/null @@ -1,27 +0,0 @@ -#ifdef EIGEN_WARNINGS_DISABLED -#undef EIGEN_WARNINGS_DISABLED - -#ifndef EIGEN_PERMANENTLY_DISABLE_STUPID_WARNINGS - #ifdef _MSC_VER - #pragma warning( pop ) - #elif defined __INTEL_COMPILER - #pragma warning pop - #elif defined __clang__ - #pragma clang diagnostic pop - #elif defined __GNUC__ && __GNUC__>=6 - #pragma GCC diagnostic pop - #endif - - #if defined __NVCC__ -// Don't reenable the diagnostic messages, as it turns out these messages need -// to be disabled at the point of the template instantiation (i.e the user code) -// otherwise they'll be triggered by nvcc. -// #pragma diag_default code_is_unreachable -// #pragma diag_default initialization_not_reachable -// #pragma diag_default 2651 -// #pragma diag_default 2653 - #endif - -#endif - -#endif // EIGEN_WARNINGS_DISABLED diff --git a/Eigen/src/Core/util/StaticAssert.h b/Eigen/src/Core/util/StaticAssert.h deleted file mode 100644 index 500e47792..000000000 --- a/Eigen/src/Core/util/StaticAssert.h +++ /dev/null @@ -1,218 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STATIC_ASSERT_H -#define EIGEN_STATIC_ASSERT_H - -/* Some notes on Eigen's static assertion mechanism: - * - * - in EIGEN_STATIC_ASSERT(CONDITION,MSG) the parameter CONDITION must be a compile time boolean - * expression, and MSG an enum listed in struct internal::static_assertion - * - * - define EIGEN_NO_STATIC_ASSERT to disable them (and save compilation time) - * in that case, the static assertion is converted to the following runtime assert: - * eigen_assert(CONDITION && "MSG") - * - * - currently EIGEN_STATIC_ASSERT can only be used in function scope - * - */ - -#ifndef EIGEN_STATIC_ASSERT -#ifndef EIGEN_NO_STATIC_ASSERT - - #if EIGEN_MAX_CPP_VER>=11 && (__has_feature(cxx_static_assert) || (defined(__cplusplus) && __cplusplus >= 201103L) || (EIGEN_COMP_MSVC >= 1600)) - - // if native static_assert is enabled, let's use it - #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); - - #else // not CXX0X - - namespace Eigen { - - namespace internal { - - template - struct static_assertion {}; - - template<> - struct static_assertion - { - enum { - YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX=1, - YOU_MIXED_VECTORS_OF_DIFFERENT_SIZES=1, - YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES=1, - THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE=1, - THIS_METHOD_IS_ONLY_FOR_MATRICES_OF_A_SPECIFIC_SIZE=1, - THIS_METHOD_IS_ONLY_FOR_OBJECTS_OF_A_SPECIFIC_SIZE=1, - OUT_OF_RANGE_ACCESS=1, - YOU_MADE_A_PROGRAMMING_MISTAKE=1, - EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT=1, - EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE=1, - YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR=1, - YOU_CALLED_A_DYNAMIC_SIZE_METHOD_ON_A_FIXED_SIZE_MATRIX_OR_VECTOR=1, - UNALIGNED_LOAD_AND_STORE_OPERATIONS_UNIMPLEMENTED_ON_ALTIVEC=1, - THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES=1, - FLOATING_POINT_ARGUMENT_PASSED__INTEGER_WAS_EXPECTED=1, - NUMERIC_TYPE_MUST_BE_REAL=1, - COEFFICIENT_WRITE_ACCESS_TO_SELFADJOINT_NOT_SUPPORTED=1, - WRITING_TO_TRIANGULAR_PART_WITH_UNIT_DIAGONAL_IS_NOT_SUPPORTED=1, - THIS_METHOD_IS_ONLY_FOR_FIXED_SIZE=1, - INVALID_MATRIX_PRODUCT=1, - INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS=1, - INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION=1, - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY=1, - THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES=1, - THIS_METHOD_IS_ONLY_FOR_ROW_MAJOR_MATRICES=1, - INVALID_MATRIX_TEMPLATE_PARAMETERS=1, - INVALID_MATRIXBASE_TEMPLATE_PARAMETERS=1, - BOTH_MATRICES_MUST_HAVE_THE_SAME_STORAGE_ORDER=1, - THIS_METHOD_IS_ONLY_FOR_DIAGONAL_MATRIX=1, - THE_MATRIX_OR_EXPRESSION_THAT_YOU_PASSED_DOES_NOT_HAVE_THE_EXPECTED_TYPE=1, - THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_WITH_DIRECT_MEMORY_ACCESS_SUCH_AS_MAP_OR_PLAIN_MATRICES=1, - YOU_ALREADY_SPECIFIED_THIS_STRIDE=1, - INVALID_STORAGE_ORDER_FOR_THIS_VECTOR_EXPRESSION=1, - THE_BRACKET_OPERATOR_IS_ONLY_FOR_VECTORS__USE_THE_PARENTHESIS_OPERATOR_INSTEAD=1, - PACKET_ACCESS_REQUIRES_TO_HAVE_INNER_STRIDE_FIXED_TO_1=1, - THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS=1, - YOU_CANNOT_MIX_ARRAYS_AND_MATRICES=1, - YOU_PERFORMED_AN_INVALID_TRANSFORMATION_CONVERSION=1, - THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY=1, - YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT=1, - THIS_METHOD_IS_ONLY_FOR_1x1_EXPRESSIONS=1, - THIS_METHOD_IS_ONLY_FOR_INNER_OR_LAZY_PRODUCTS=1, - THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL=1, - THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES=1, - YOU_PASSED_A_ROW_VECTOR_BUT_A_COLUMN_VECTOR_WAS_EXPECTED=1, - YOU_PASSED_A_COLUMN_VECTOR_BUT_A_ROW_VECTOR_WAS_EXPECTED=1, - THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE=1, - THE_STORAGE_ORDER_OF_BOTH_SIDES_MUST_MATCH=1, - OBJECT_ALLOCATED_ON_STACK_IS_TOO_BIG=1, - IMPLICIT_CONVERSION_TO_SCALAR_IS_FOR_INNER_PRODUCT_ONLY=1, - STORAGE_LAYOUT_DOES_NOT_MATCH=1, - EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE=1, - THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS=1, - MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY=1, - THIS_TYPE_IS_NOT_SUPPORTED=1, - STORAGE_KIND_MUST_MATCH=1, - STORAGE_INDEX_MUST_MATCH=1, - CHOLMOD_SUPPORTS_DOUBLE_PRECISION_ONLY=1, - SELFADJOINTVIEW_ACCEPTS_UPPER_AND_LOWER_MODE_ONLY=1 - }; - }; - - } // end namespace internal - - } // end namespace Eigen - - // Specialized implementation for MSVC to avoid "conditional - // expression is constant" warnings. This implementation doesn't - // appear to work under GCC, hence the multiple implementations. - #if EIGEN_COMP_MSVC - - #define EIGEN_STATIC_ASSERT(CONDITION,MSG) \ - {Eigen::internal::static_assertion::MSG;} - - #else - // In some cases clang interprets bool(CONDITION) as function declaration - #define EIGEN_STATIC_ASSERT(CONDITION,MSG) \ - if (Eigen::internal::static_assertion(CONDITION)>::MSG) {} - - #endif - - #endif // not CXX0X - -#else // EIGEN_NO_STATIC_ASSERT - - #define EIGEN_STATIC_ASSERT(CONDITION,MSG) eigen_assert((CONDITION) && #MSG); - -#endif // EIGEN_NO_STATIC_ASSERT -#endif // EIGEN_STATIC_ASSERT - -// static assertion failing if the type \a TYPE is not a vector type -#define EIGEN_STATIC_ASSERT_VECTOR_ONLY(TYPE) \ - EIGEN_STATIC_ASSERT(TYPE::IsVectorAtCompileTime, \ - YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) - -// static assertion failing if the type \a TYPE is not fixed-size -#define EIGEN_STATIC_ASSERT_FIXED_SIZE(TYPE) \ - EIGEN_STATIC_ASSERT(TYPE::SizeAtCompileTime!=Eigen::Dynamic, \ - YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR) - -// static assertion failing if the type \a TYPE is not dynamic-size -#define EIGEN_STATIC_ASSERT_DYNAMIC_SIZE(TYPE) \ - EIGEN_STATIC_ASSERT(TYPE::SizeAtCompileTime==Eigen::Dynamic, \ - YOU_CALLED_A_DYNAMIC_SIZE_METHOD_ON_A_FIXED_SIZE_MATRIX_OR_VECTOR) - -// static assertion failing if the type \a TYPE is not a vector type of the given size -#define EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(TYPE, SIZE) \ - EIGEN_STATIC_ASSERT(TYPE::IsVectorAtCompileTime && TYPE::SizeAtCompileTime==SIZE, \ - THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) - -// static assertion failing if the type \a TYPE is not a vector type of the given size -#define EIGEN_STATIC_ASSERT_MATRIX_SPECIFIC_SIZE(TYPE, ROWS, COLS) \ - EIGEN_STATIC_ASSERT(TYPE::RowsAtCompileTime==ROWS && TYPE::ColsAtCompileTime==COLS, \ - THIS_METHOD_IS_ONLY_FOR_MATRICES_OF_A_SPECIFIC_SIZE) - -// static assertion failing if the two vector expression types are not compatible (same fixed-size or dynamic size) -#define EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(TYPE0,TYPE1) \ - EIGEN_STATIC_ASSERT( \ - (int(TYPE0::SizeAtCompileTime)==Eigen::Dynamic \ - || int(TYPE1::SizeAtCompileTime)==Eigen::Dynamic \ - || int(TYPE0::SizeAtCompileTime)==int(TYPE1::SizeAtCompileTime)),\ - YOU_MIXED_VECTORS_OF_DIFFERENT_SIZES) - -#define EIGEN_PREDICATE_SAME_MATRIX_SIZE(TYPE0,TYPE1) \ - ( \ - (int(Eigen::internal::size_of_xpr_at_compile_time::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time::ret)==0) \ - || (\ - (int(TYPE0::RowsAtCompileTime)==Eigen::Dynamic \ - || int(TYPE1::RowsAtCompileTime)==Eigen::Dynamic \ - || int(TYPE0::RowsAtCompileTime)==int(TYPE1::RowsAtCompileTime)) \ - && (int(TYPE0::ColsAtCompileTime)==Eigen::Dynamic \ - || int(TYPE1::ColsAtCompileTime)==Eigen::Dynamic \ - || int(TYPE0::ColsAtCompileTime)==int(TYPE1::ColsAtCompileTime))\ - ) \ - ) - -#define EIGEN_STATIC_ASSERT_NON_INTEGER(TYPE) \ - EIGEN_STATIC_ASSERT(!NumTraits::IsInteger, THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) - - -// static assertion failing if it is guaranteed at compile-time that the two matrix expression types have different sizes -#define EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(TYPE0,TYPE1) \ - EIGEN_STATIC_ASSERT( \ - EIGEN_PREDICATE_SAME_MATRIX_SIZE(TYPE0,TYPE1),\ - YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) - -#define EIGEN_STATIC_ASSERT_SIZE_1x1(TYPE) \ - EIGEN_STATIC_ASSERT((TYPE::RowsAtCompileTime == 1 || TYPE::RowsAtCompileTime == Dynamic) && \ - (TYPE::ColsAtCompileTime == 1 || TYPE::ColsAtCompileTime == Dynamic), \ - THIS_METHOD_IS_ONLY_FOR_1x1_EXPRESSIONS) - -#define EIGEN_STATIC_ASSERT_LVALUE(Derived) \ - EIGEN_STATIC_ASSERT(Eigen::internal::is_lvalue::value, \ - THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) - -#define EIGEN_STATIC_ASSERT_ARRAYXPR(Derived) \ - EIGEN_STATIC_ASSERT((Eigen::internal::is_same::XprKind, ArrayXpr>::value), \ - THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES) - -#define EIGEN_STATIC_ASSERT_SAME_XPR_KIND(Derived1, Derived2) \ - EIGEN_STATIC_ASSERT((Eigen::internal::is_same::XprKind, \ - typename Eigen::internal::traits::XprKind \ - >::value), \ - YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) - -// Check that a cost value is positive, and that is stay within a reasonable range -// TODO this check could be enabled for internal debugging only -#define EIGEN_INTERNAL_CHECK_COST_VALUE(C) \ - EIGEN_STATIC_ASSERT((C)>=0 && (C)<=HugeCost*HugeCost, EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE); - -#endif // EIGEN_STATIC_ASSERT_H diff --git a/Eigen/src/Core/util/SymbolicIndex.h b/Eigen/src/Core/util/SymbolicIndex.h deleted file mode 100644 index bb6349eb9..000000000 --- a/Eigen/src/Core/util/SymbolicIndex.h +++ /dev/null @@ -1,300 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2017 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SYMBOLIC_INDEX_H -#define EIGEN_SYMBOLIC_INDEX_H - -namespace Eigen { - -/** \namespace Eigen::Symbolic - * \ingroup Core_Module - * - * This namespace defines a set of classes and functions to build and evaluate symbolic expressions of scalar type Index. - * Here is a simple example: - * - * \code - * // First step, defines symbols: - * struct x_tag {}; static const Symbolic::SymbolExpr x; - * struct y_tag {}; static const Symbolic::SymbolExpr y; - * struct z_tag {}; static const Symbolic::SymbolExpr z; - * - * // Defines an expression: - * auto expr = (x+3)/y+z; - * - * // And evaluate it: (c++14) - * std::cout << expr.eval(x=6,y=3,z=-13) << "\n"; - * - * // In c++98/11, only one symbol per expression is supported for now: - * auto expr98 = (3-x)/2; - * std::cout << expr98.eval(x=6) << "\n"; - * \endcode - * - * It is currently only used internally to define and minipulate the placeholders::last and placeholders::end symbols in Eigen::seq and Eigen::seqN. - * - */ -namespace Symbolic { - -template class Symbol; -template class NegateExpr; -template class AddExpr; -template class ProductExpr; -template class QuotientExpr; - -// A simple wrapper around an integral value to provide the eval method. -// We could also use a free-function symbolic_eval... -template -class ValueExpr { -public: - ValueExpr(IndexType val) : m_value(val) {} - template - IndexType eval_impl(const T&) const { return m_value; } -protected: - IndexType m_value; -}; - -// Specialization for compile-time value, -// It is similar to ValueExpr(N) but this version helps the compiler to generate better code. -template -class ValueExpr > { -public: - ValueExpr() {} - template - Index eval_impl(const T&) const { return N; } -}; - - -/** \class BaseExpr - * \ingroup Core_Module - * Common base class of any symbolic expressions - */ -template -class BaseExpr -{ -public: - const Derived& derived() const { return *static_cast(this); } - - /** Evaluate the expression given the \a values of the symbols. - * - * \param values defines the values of the symbols, it can either be a SymbolValue or a std::tuple of SymbolValue - * as constructed by SymbolExpr::operator= operator. - * - */ - template - Index eval(const T& values) const { return derived().eval_impl(values); } - -#if EIGEN_HAS_CXX14 - template - Index eval(Types&&... values) const { return derived().eval_impl(std::make_tuple(values...)); } -#endif - - NegateExpr operator-() const { return NegateExpr(derived()); } - - AddExpr > operator+(Index b) const - { return AddExpr >(derived(), b); } - AddExpr > operator-(Index a) const - { return AddExpr >(derived(), -a); } - ProductExpr > operator*(Index a) const - { return ProductExpr >(derived(),a); } - QuotientExpr > operator/(Index a) const - { return QuotientExpr >(derived(),a); } - - friend AddExpr > operator+(Index a, const BaseExpr& b) - { return AddExpr >(b.derived(), a); } - friend AddExpr,ValueExpr<> > operator-(Index a, const BaseExpr& b) - { return AddExpr,ValueExpr<> >(-b.derived(), a); } - friend ProductExpr,Derived> operator*(Index a, const BaseExpr& b) - { return ProductExpr,Derived>(a,b.derived()); } - friend QuotientExpr,Derived> operator/(Index a, const BaseExpr& b) - { return QuotientExpr,Derived>(a,b.derived()); } - - template - AddExpr > > operator+(internal::FixedInt) const - { return AddExpr > >(derived(), ValueExpr >()); } - template - AddExpr > > operator-(internal::FixedInt) const - { return AddExpr > >(derived(), ValueExpr >()); } - template - ProductExpr > > operator*(internal::FixedInt) const - { return ProductExpr > >(derived(),ValueExpr >()); } - template - QuotientExpr > > operator/(internal::FixedInt) const - { return QuotientExpr > >(derived(),ValueExpr >()); } - - template - friend AddExpr > > operator+(internal::FixedInt, const BaseExpr& b) - { return AddExpr > >(b.derived(), ValueExpr >()); } - template - friend AddExpr,ValueExpr > > operator-(internal::FixedInt, const BaseExpr& b) - { return AddExpr,ValueExpr > >(-b.derived(), ValueExpr >()); } - template - friend ProductExpr >,Derived> operator*(internal::FixedInt, const BaseExpr& b) - { return ProductExpr >,Derived>(ValueExpr >(),b.derived()); } - template - friend QuotientExpr >,Derived> operator/(internal::FixedInt, const BaseExpr& b) - { return QuotientExpr > ,Derived>(ValueExpr >(),b.derived()); } - -#if (!EIGEN_HAS_CXX14) - template - AddExpr > > operator+(internal::FixedInt (*)()) const - { return AddExpr > >(derived(), ValueExpr >()); } - template - AddExpr > > operator-(internal::FixedInt (*)()) const - { return AddExpr > >(derived(), ValueExpr >()); } - template - ProductExpr > > operator*(internal::FixedInt (*)()) const - { return ProductExpr > >(derived(),ValueExpr >()); } - template - QuotientExpr > > operator/(internal::FixedInt (*)()) const - { return QuotientExpr > >(derived(),ValueExpr >()); } - - template - friend AddExpr > > operator+(internal::FixedInt (*)(), const BaseExpr& b) - { return AddExpr > >(b.derived(), ValueExpr >()); } - template - friend AddExpr,ValueExpr > > operator-(internal::FixedInt (*)(), const BaseExpr& b) - { return AddExpr,ValueExpr > >(-b.derived(), ValueExpr >()); } - template - friend ProductExpr >,Derived> operator*(internal::FixedInt (*)(), const BaseExpr& b) - { return ProductExpr >,Derived>(ValueExpr >(),b.derived()); } - template - friend QuotientExpr >,Derived> operator/(internal::FixedInt (*)(), const BaseExpr& b) - { return QuotientExpr > ,Derived>(ValueExpr >(),b.derived()); } -#endif - - - template - AddExpr operator+(const BaseExpr &b) const - { return AddExpr(derived(), b.derived()); } - - template - AddExpr > operator-(const BaseExpr &b) const - { return AddExpr >(derived(), -b.derived()); } - - template - ProductExpr operator*(const BaseExpr &b) const - { return ProductExpr(derived(), b.derived()); } - - template - QuotientExpr operator/(const BaseExpr &b) const - { return QuotientExpr(derived(), b.derived()); } -}; - -template -struct is_symbolic { - // BaseExpr has no conversion ctor, so we only have to check whether T can be staticaly cast to its base class BaseExpr. - enum { value = internal::is_convertible >::value }; -}; - -// Specialization for functions, because is_convertible fails in this case. -// Useful in c++98/11 mode when testing is_symbolic)> -template -struct is_symbolic { - enum { value = false }; -}; - -/** Represents the actual value of a symbol identified by its tag - * - * It is the return type of SymbolValue::operator=, and most of the time this is only way it is used. - */ -template -class SymbolValue -{ -public: - /** Default constructor from the value \a val */ - SymbolValue(Index val) : m_value(val) {} - - /** \returns the stored value of the symbol */ - Index value() const { return m_value; } -protected: - Index m_value; -}; - -/** Expression of a symbol uniquely identified by the template parameter type \c tag */ -template -class SymbolExpr : public BaseExpr > -{ -public: - /** Alias to the template parameter \c tag */ - typedef tag Tag; - - SymbolExpr() {} - - /** Associate the value \a val to the given symbol \c *this, uniquely identified by its \c Tag. - * - * The returned object should be passed to ExprBase::eval() to evaluate a given expression with this specified runtime-time value. - */ - SymbolValue operator=(Index val) const { - return SymbolValue(val); - } - - Index eval_impl(const SymbolValue &values) const { return values.value(); } - -#if EIGEN_HAS_CXX14 - // C++14 versions suitable for multiple symbols - template - Index eval_impl(const std::tuple& values) const { return std::get >(values).value(); } -#endif -}; - -template -class NegateExpr : public BaseExpr > -{ -public: - NegateExpr(const Arg0& arg0) : m_arg0(arg0) {} - - template - Index eval_impl(const T& values) const { return -m_arg0.eval_impl(values); } -protected: - Arg0 m_arg0; -}; - -template -class AddExpr : public BaseExpr > -{ -public: - AddExpr(const Arg0& arg0, const Arg1& arg1) : m_arg0(arg0), m_arg1(arg1) {} - - template - Index eval_impl(const T& values) const { return m_arg0.eval_impl(values) + m_arg1.eval_impl(values); } -protected: - Arg0 m_arg0; - Arg1 m_arg1; -}; - -template -class ProductExpr : public BaseExpr > -{ -public: - ProductExpr(const Arg0& arg0, const Arg1& arg1) : m_arg0(arg0), m_arg1(arg1) {} - - template - Index eval_impl(const T& values) const { return m_arg0.eval_impl(values) * m_arg1.eval_impl(values); } -protected: - Arg0 m_arg0; - Arg1 m_arg1; -}; - -template -class QuotientExpr : public BaseExpr > -{ -public: - QuotientExpr(const Arg0& arg0, const Arg1& arg1) : m_arg0(arg0), m_arg1(arg1) {} - - template - Index eval_impl(const T& values) const { return m_arg0.eval_impl(values) / m_arg1.eval_impl(values); } -protected: - Arg0 m_arg0; - Arg1 m_arg1; -}; - -} // end namespace Symbolic - -} // end namespace Eigen - -#endif // EIGEN_SYMBOLIC_INDEX_H diff --git a/Eigen/src/Core/util/XprHelper.h b/Eigen/src/Core/util/XprHelper.h deleted file mode 100644 index 10328be0d..000000000 --- a/Eigen/src/Core/util/XprHelper.h +++ /dev/null @@ -1,835 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_XPRHELPER_H -#define EIGEN_XPRHELPER_H - -// just a workaround because GCC seems to not really like empty structs -// FIXME: gcc 4.3 generates bad code when strict-aliasing is enabled -// so currently we simply disable this optimization for gcc 4.3 -#if EIGEN_COMP_GNUC && !EIGEN_GNUC_AT(4,3) - #define EIGEN_EMPTY_STRUCT_CTOR(X) \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE X() {} \ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE X(const X& ) {} -#else - #define EIGEN_EMPTY_STRUCT_CTOR(X) -#endif - -namespace Eigen { - -namespace internal { - -template -EIGEN_DEVICE_FUNC -inline IndexDest convert_index(const IndexSrc& idx) { - // for sizeof(IndexDest)>=sizeof(IndexSrc) compilers should be able to optimize this away: - eigen_internal_assert(idx <= NumTraits::highest() && "Index value to big for target type"); - return IndexDest(idx); -} - -// true if T can be considered as an integral index (i.e., and integral type or enum) -template struct is_valid_index_type -{ - enum { value = -#if EIGEN_HAS_TYPE_TRAITS - internal::is_integral::value || std::is_enum::value -#else - // without C++11, we use is_convertible to Index instead of is_integral in order to treat enums as Index. - internal::is_convertible::value -#endif - }; -}; - -// promote_scalar_arg is an helper used in operation between an expression and a scalar, like: -// expression * scalar -// Its role is to determine how the type T of the scalar operand should be promoted given the scalar type ExprScalar of the given expression. -// The IsSupported template parameter must be provided by the caller as: internal::has_ReturnType >::value using the proper order for ExprScalar and T. -// Then the logic is as follows: -// - if the operation is natively supported as defined by IsSupported, then the scalar type is not promoted, and T is returned. -// - otherwise, NumTraits::Literal is returned if T is implicitly convertible to NumTraits::Literal AND that this does not imply a float to integer conversion. -// - otherwise, ExprScalar is returned if T is implicitly convertible to ExprScalar AND that this does not imply a float to integer conversion. -// - In all other cases, the promoted type is not defined, and the respective operation is thus invalid and not available (SFINAE). -template -struct promote_scalar_arg; - -template -struct promote_scalar_arg -{ - typedef T type; -}; - -// Recursively check safe conversion to PromotedType, and then ExprScalar if they are different. -template::value, - bool IsSafe = NumTraits::IsInteger || !NumTraits::IsInteger> -struct promote_scalar_arg_unsupported; - -// Start recursion with NumTraits::Literal -template -struct promote_scalar_arg : promote_scalar_arg_unsupported::Literal> {}; - -// We found a match! -template -struct promote_scalar_arg_unsupported -{ - typedef PromotedType type; -}; - -// No match, but no real-to-integer issues, and ExprScalar and current PromotedType are different, -// so let's try to promote to ExprScalar -template -struct promote_scalar_arg_unsupported - : promote_scalar_arg_unsupported -{}; - -// Unsafe real-to-integer, let's stop. -template -struct promote_scalar_arg_unsupported {}; - -// T is not even convertible to ExprScalar, let's stop. -template -struct promote_scalar_arg_unsupported {}; - -//classes inheriting no_assignment_operator don't generate a default operator=. -class no_assignment_operator -{ - private: - no_assignment_operator& operator=(const no_assignment_operator&); -}; - -/** \internal return the index type with the largest number of bits */ -template -struct promote_index_type -{ - typedef typename conditional<(sizeof(I1)::type type; -}; - -/** \internal If the template parameter Value is Dynamic, this class is just a wrapper around a T variable that - * can be accessed using value() and setValue(). - * Otherwise, this class is an empty structure and value() just returns the template parameter Value. - */ -template class variable_if_dynamic -{ - public: - EIGEN_EMPTY_STRUCT_CTOR(variable_if_dynamic) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE explicit variable_if_dynamic(T v) { EIGEN_ONLY_USED_FOR_DEBUG(v); eigen_assert(v == T(Value)); } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE T value() { return T(Value); } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE operator T() const { return T(Value); } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void setValue(T) {} -}; - -template class variable_if_dynamic -{ - T m_value; - EIGEN_DEVICE_FUNC variable_if_dynamic() { eigen_assert(false); } - public: - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE explicit variable_if_dynamic(T value) : m_value(value) {} - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE T value() const { return m_value; } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE operator T() const { return m_value; } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void setValue(T value) { m_value = value; } -}; - -/** \internal like variable_if_dynamic but for DynamicIndex - */ -template class variable_if_dynamicindex -{ - public: - EIGEN_EMPTY_STRUCT_CTOR(variable_if_dynamicindex) - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE explicit variable_if_dynamicindex(T v) { EIGEN_ONLY_USED_FOR_DEBUG(v); eigen_assert(v == T(Value)); } - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE T value() { return T(Value); } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void setValue(T) {} -}; - -template class variable_if_dynamicindex -{ - T m_value; - EIGEN_DEVICE_FUNC variable_if_dynamicindex() { eigen_assert(false); } - public: - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE explicit variable_if_dynamicindex(T value) : m_value(value) {} - EIGEN_DEVICE_FUNC T EIGEN_STRONG_INLINE value() const { return m_value; } - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE void setValue(T value) { m_value = value; } -}; - -template struct functor_traits -{ - enum - { - Cost = 10, - PacketAccess = false, - IsRepeatable = false - }; -}; - -template struct packet_traits; - -template struct unpacket_traits -{ - typedef T type; - typedef T half; - enum - { - size = 1, - alignment = 1 - }; -}; - -template::size)==0 || is_same::half>::value> -struct find_best_packet_helper; - -template< int Size, typename PacketType> -struct find_best_packet_helper -{ - typedef PacketType type; -}; - -template -struct find_best_packet_helper -{ - typedef typename find_best_packet_helper::half>::type type; -}; - -template -struct find_best_packet -{ - typedef typename find_best_packet_helper::type>::type type; -}; - -#if EIGEN_MAX_STATIC_ALIGN_BYTES>0 -template -struct compute_default_alignment_helper -{ - enum { value = 0 }; -}; - -template -struct compute_default_alignment_helper // Match -{ - enum { value = AlignmentBytes }; -}; - -template -struct compute_default_alignment_helper // Try-half -{ - // current packet too large, try with an half-packet - enum { value = compute_default_alignment_helper::value }; -}; -#else -// If static alignment is disabled, no need to bother. -// This also avoids a division by zero in "bool Match = bool((ArrayBytes%AlignmentBytes)==0)" -template -struct compute_default_alignment_helper -{ - enum { value = 0 }; -}; -#endif - -template struct compute_default_alignment { - enum { value = compute_default_alignment_helper::value }; -}; - -template struct compute_default_alignment { - enum { value = EIGEN_MAX_ALIGN_BYTES }; -}; - -template class make_proper_matrix_type -{ - enum { - IsColVector = _Cols==1 && _Rows!=1, - IsRowVector = _Rows==1 && _Cols!=1, - Options = IsColVector ? (_Options | ColMajor) & ~RowMajor - : IsRowVector ? (_Options | RowMajor) & ~ColMajor - : _Options - }; - public: - typedef Matrix<_Scalar, _Rows, _Cols, Options, _MaxRows, _MaxCols> type; -}; - -template -class compute_matrix_flags -{ - enum { row_major_bit = Options&RowMajor ? RowMajorBit : 0 }; - public: - // FIXME currently we still have to handle DirectAccessBit at the expression level to handle DenseCoeffsBase<> - // and then propagate this information to the evaluator's flags. - // However, I (Gael) think that DirectAccessBit should only matter at the evaluation stage. - enum { ret = DirectAccessBit | LvalueBit | NestByRefBit | row_major_bit }; -}; - -template struct size_at_compile_time -{ - enum { ret = (_Rows==Dynamic || _Cols==Dynamic) ? Dynamic : _Rows * _Cols }; -}; - -template struct size_of_xpr_at_compile_time -{ - enum { ret = size_at_compile_time::RowsAtCompileTime,traits::ColsAtCompileTime>::ret }; -}; - -/* plain_matrix_type : the difference from eval is that plain_matrix_type is always a plain matrix type, - * whereas eval is a const reference in the case of a matrix - */ - -template::StorageKind> struct plain_matrix_type; -template struct plain_matrix_type_dense; -template struct plain_matrix_type -{ - typedef typename plain_matrix_type_dense::XprKind, traits::Flags>::type type; -}; -template struct plain_matrix_type -{ - typedef typename T::PlainObject type; -}; - -template struct plain_matrix_type_dense -{ - typedef Matrix::Scalar, - traits::RowsAtCompileTime, - traits::ColsAtCompileTime, - AutoAlign | (Flags&RowMajorBit ? RowMajor : ColMajor), - traits::MaxRowsAtCompileTime, - traits::MaxColsAtCompileTime - > type; -}; - -template struct plain_matrix_type_dense -{ - typedef Array::Scalar, - traits::RowsAtCompileTime, - traits::ColsAtCompileTime, - AutoAlign | (Flags&RowMajorBit ? RowMajor : ColMajor), - traits::MaxRowsAtCompileTime, - traits::MaxColsAtCompileTime - > type; -}; - -/* eval : the return type of eval(). For matrices, this is just a const reference - * in order to avoid a useless copy - */ - -template::StorageKind> struct eval; - -template struct eval -{ - typedef typename plain_matrix_type::type type; -// typedef typename T::PlainObject type; -// typedef T::Matrix::Scalar, -// traits::RowsAtCompileTime, -// traits::ColsAtCompileTime, -// AutoAlign | (traits::Flags&RowMajorBit ? RowMajor : ColMajor), -// traits::MaxRowsAtCompileTime, -// traits::MaxColsAtCompileTime -// > type; -}; - -template struct eval -{ - typedef typename plain_matrix_type::type type; -}; - -// for matrices, no need to evaluate, just use a const reference to avoid a useless copy -template -struct eval, Dense> -{ - typedef const Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& type; -}; - -template -struct eval, Dense> -{ - typedef const Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& type; -}; - - -/* similar to plain_matrix_type, but using the evaluator's Flags */ -template::StorageKind> struct plain_object_eval; - -template -struct plain_object_eval -{ - typedef typename plain_matrix_type_dense::XprKind, evaluator::Flags>::type type; -}; - - -/* plain_matrix_type_column_major : same as plain_matrix_type but guaranteed to be column-major - */ -template struct plain_matrix_type_column_major -{ - enum { Rows = traits::RowsAtCompileTime, - Cols = traits::ColsAtCompileTime, - MaxRows = traits::MaxRowsAtCompileTime, - MaxCols = traits::MaxColsAtCompileTime - }; - typedef Matrix::Scalar, - Rows, - Cols, - (MaxRows==1&&MaxCols!=1) ? RowMajor : ColMajor, - MaxRows, - MaxCols - > type; -}; - -/* plain_matrix_type_row_major : same as plain_matrix_type but guaranteed to be row-major - */ -template struct plain_matrix_type_row_major -{ - enum { Rows = traits::RowsAtCompileTime, - Cols = traits::ColsAtCompileTime, - MaxRows = traits::MaxRowsAtCompileTime, - MaxCols = traits::MaxColsAtCompileTime - }; - typedef Matrix::Scalar, - Rows, - Cols, - (MaxCols==1&&MaxRows!=1) ? RowMajor : ColMajor, - MaxRows, - MaxCols - > type; -}; - -/** \internal The reference selector for template expressions. The idea is that we don't - * need to use references for expressions since they are light weight proxy - * objects which should generate no copying overhead. */ -template -struct ref_selector -{ - typedef typename conditional< - bool(traits::Flags & NestByRefBit), - T const&, - const T - >::type type; - - typedef typename conditional< - bool(traits::Flags & NestByRefBit), - T &, - T - >::type non_const_type; -}; - -/** \internal Adds the const qualifier on the value-type of T2 if and only if T1 is a const type */ -template -struct transfer_constness -{ - typedef typename conditional< - bool(internal::is_const::value), - typename internal::add_const_on_value_type::type, - T2 - >::type type; -}; - - -// However, we still need a mechanism to detect whether an expression which is evaluated multiple time -// has to be evaluated into a temporary. -// That's the purpose of this new nested_eval helper: -/** \internal Determines how a given expression should be nested when evaluated multiple times. - * For example, when you do a * (b+c), Eigen will determine how the expression b+c should be - * evaluated into the bigger product expression. The choice is between nesting the expression b+c as-is, or - * evaluating that expression b+c into a temporary variable d, and nest d so that the resulting expression is - * a*d. Evaluating can be beneficial for example if every coefficient access in the resulting expression causes - * many coefficient accesses in the nested expressions -- as is the case with matrix product for example. - * - * \tparam T the type of the expression being nested. - * \tparam n the number of coefficient accesses in the nested expression for each coefficient access in the bigger expression. - * \tparam PlainObject the type of the temporary if needed. - */ -template::type> struct nested_eval -{ - enum { - ScalarReadCost = NumTraits::Scalar>::ReadCost, - CoeffReadCost = evaluator::CoeffReadCost, // NOTE What if an evaluator evaluate itself into a tempory? - // Then CoeffReadCost will be small (e.g., 1) but we still have to evaluate, especially if n>1. - // This situation is already taken care by the EvalBeforeNestingBit flag, which is turned ON - // for all evaluator creating a temporary. This flag is then propagated by the parent evaluators. - // Another solution could be to count the number of temps? - NAsInteger = n == Dynamic ? HugeCost : n, - CostEval = (NAsInteger+1) * ScalarReadCost + CoeffReadCost, - CostNoEval = NAsInteger * CoeffReadCost, - Evaluate = (int(evaluator::Flags) & EvalBeforeNestingBit) || (int(CostEval) < int(CostNoEval)) - }; - - typedef typename conditional::type>::type type; -}; - -template -EIGEN_DEVICE_FUNC -inline T* const_cast_ptr(const T* ptr) -{ - return const_cast(ptr); -} - -template::XprKind> -struct dense_xpr_base -{ - /* dense_xpr_base should only ever be used on dense expressions, thus falling either into the MatrixXpr or into the ArrayXpr cases */ -}; - -template -struct dense_xpr_base -{ - typedef MatrixBase type; -}; - -template -struct dense_xpr_base -{ - typedef ArrayBase type; -}; - -template::XprKind, typename StorageKind = typename traits::StorageKind> -struct generic_xpr_base; - -template -struct generic_xpr_base -{ - typedef typename dense_xpr_base::type type; -}; - -template struct cast_return_type -{ - typedef typename XprType::Scalar CurrentScalarType; - typedef typename remove_all::type _CastType; - typedef typename _CastType::Scalar NewScalarType; - typedef typename conditional::value, - const XprType&,CastType>::type type; -}; - -template struct promote_storage_type; - -template struct promote_storage_type -{ - typedef A ret; -}; -template struct promote_storage_type -{ - typedef A ret; -}; -template struct promote_storage_type -{ - typedef A ret; -}; - -/** \internal Specify the "storage kind" of applying a coefficient-wise - * binary operations between two expressions of kinds A and B respectively. - * The template parameter Functor permits to specialize the resulting storage kind wrt to - * the functor. - * The default rules are as follows: - * \code - * A op A -> A - * A op dense -> dense - * dense op B -> dense - * sparse op dense -> sparse - * dense op sparse -> sparse - * \endcode - */ -template struct cwise_promote_storage_type; - -template struct cwise_promote_storage_type { typedef A ret; }; -template struct cwise_promote_storage_type { typedef Dense ret; }; -template struct cwise_promote_storage_type { typedef Dense ret; }; -template struct cwise_promote_storage_type { typedef Dense ret; }; -template struct cwise_promote_storage_type { typedef Sparse ret; }; -template struct cwise_promote_storage_type { typedef Sparse ret; }; - -template struct cwise_promote_storage_order { - enum { value = LhsOrder }; -}; - -template struct cwise_promote_storage_order { enum { value = RhsOrder }; }; -template struct cwise_promote_storage_order { enum { value = LhsOrder }; }; -template struct cwise_promote_storage_order { enum { value = Order }; }; - - -/** \internal Specify the "storage kind" of multiplying an expression of kind A with kind B. - * The template parameter ProductTag permits to specialize the resulting storage kind wrt to - * some compile-time properties of the product: GemmProduct, GemvProduct, OuterProduct, InnerProduct. - * The default rules are as follows: - * \code - * K * K -> K - * dense * K -> dense - * K * dense -> dense - * diag * K -> K - * K * diag -> K - * Perm * K -> K - * K * Perm -> K - * \endcode - */ -template struct product_promote_storage_type; - -template struct product_promote_storage_type { typedef A ret;}; -template struct product_promote_storage_type { typedef Dense ret;}; -template struct product_promote_storage_type { typedef Dense ret; }; -template struct product_promote_storage_type { typedef Dense ret; }; - -template struct product_promote_storage_type { typedef A ret; }; -template struct product_promote_storage_type { typedef B ret; }; -template struct product_promote_storage_type { typedef Dense ret; }; -template struct product_promote_storage_type { typedef Dense ret; }; - -template struct product_promote_storage_type { typedef A ret; }; -template struct product_promote_storage_type { typedef B ret; }; -template struct product_promote_storage_type { typedef Dense ret; }; -template struct product_promote_storage_type { typedef Dense ret; }; - -/** \internal gives the plain matrix or array type to store a row/column/diagonal of a matrix type. - * \tparam Scalar optional parameter allowing to pass a different scalar type than the one of the MatrixType. - */ -template -struct plain_row_type -{ - typedef Matrix MatrixRowType; - typedef Array ArrayRowType; - - typedef typename conditional< - is_same< typename traits::XprKind, MatrixXpr >::value, - MatrixRowType, - ArrayRowType - >::type type; -}; - -template -struct plain_col_type -{ - typedef Matrix MatrixColType; - typedef Array ArrayColType; - - typedef typename conditional< - is_same< typename traits::XprKind, MatrixXpr >::value, - MatrixColType, - ArrayColType - >::type type; -}; - -template -struct plain_diag_type -{ - enum { diag_size = EIGEN_SIZE_MIN_PREFER_DYNAMIC(ExpressionType::RowsAtCompileTime, ExpressionType::ColsAtCompileTime), - max_diag_size = EIGEN_SIZE_MIN_PREFER_FIXED(ExpressionType::MaxRowsAtCompileTime, ExpressionType::MaxColsAtCompileTime) - }; - typedef Matrix MatrixDiagType; - typedef Array ArrayDiagType; - - typedef typename conditional< - is_same< typename traits::XprKind, MatrixXpr >::value, - MatrixDiagType, - ArrayDiagType - >::type type; -}; - -template -struct plain_constant_type -{ - enum { Options = (traits::Flags&RowMajorBit)?RowMajor:0 }; - - typedef Array::RowsAtCompileTime, traits::ColsAtCompileTime, - Options, traits::MaxRowsAtCompileTime,traits::MaxColsAtCompileTime> array_type; - - typedef Matrix::RowsAtCompileTime, traits::ColsAtCompileTime, - Options, traits::MaxRowsAtCompileTime,traits::MaxColsAtCompileTime> matrix_type; - - typedef CwiseNullaryOp, const typename conditional::XprKind, MatrixXpr >::value, matrix_type, array_type>::type > type; -}; - -template -struct is_lvalue -{ - enum { value = (!bool(is_const::value)) && - bool(traits::Flags & LvalueBit) }; -}; - -template struct is_diagonal -{ enum { ret = false }; }; - -template struct is_diagonal > -{ enum { ret = true }; }; - -template struct is_diagonal > -{ enum { ret = true }; }; - -template struct is_diagonal > -{ enum { ret = true }; }; - -template struct glue_shapes; -template<> struct glue_shapes { typedef TriangularShape type; }; - -template -bool is_same_dense(const T1 &mat1, const T2 &mat2, typename enable_if::ret&&has_direct_access::ret, T1>::type * = 0) -{ - return (mat1.data()==mat2.data()) && (mat1.innerStride()==mat2.innerStride()) && (mat1.outerStride()==mat2.outerStride()); -} - -template -bool is_same_dense(const T1 &, const T2 &, typename enable_if::ret&&has_direct_access::ret), T1>::type * = 0) -{ - return false; -} - -// Internal helper defining the cost of a scalar division for the type T. -// The default heuristic can be specialized for each scalar type and architecture. -template -struct scalar_div_cost { - enum { value = 8*NumTraits::MulCost }; -}; - -template -struct scalar_div_cost, Vectorized> { - enum { value = 2*scalar_div_cost::value - + 6*NumTraits::MulCost - + 3*NumTraits::AddCost - }; -}; - - -template -struct scalar_div_cost::type> { enum { value = 24 }; }; -template -struct scalar_div_cost::type> { enum { value = 21 }; }; - - -#ifdef EIGEN_DEBUG_ASSIGN -std::string demangle_traversal(int t) -{ - if(t==DefaultTraversal) return "DefaultTraversal"; - if(t==LinearTraversal) return "LinearTraversal"; - if(t==InnerVectorizedTraversal) return "InnerVectorizedTraversal"; - if(t==LinearVectorizedTraversal) return "LinearVectorizedTraversal"; - if(t==SliceVectorizedTraversal) return "SliceVectorizedTraversal"; - return "?"; -} -std::string demangle_unrolling(int t) -{ - if(t==NoUnrolling) return "NoUnrolling"; - if(t==InnerUnrolling) return "InnerUnrolling"; - if(t==CompleteUnrolling) return "CompleteUnrolling"; - return "?"; -} -std::string demangle_flags(int f) -{ - std::string res; - if(f&RowMajorBit) res += " | RowMajor"; - if(f&PacketAccessBit) res += " | Packet"; - if(f&LinearAccessBit) res += " | Linear"; - if(f&LvalueBit) res += " | Lvalue"; - if(f&DirectAccessBit) res += " | Direct"; - if(f&NestByRefBit) res += " | NestByRef"; - if(f&NoPreferredStorageOrderBit) res += " | NoPreferredStorageOrderBit"; - - return res; -} -#endif - -} // end namespace internal - - -/** \class ScalarBinaryOpTraits - * \ingroup Core_Module - * - * \brief Determines whether the given binary operation of two numeric types is allowed and what the scalar return type is. - * - * This class permits to control the scalar return type of any binary operation performed on two different scalar types through (partial) template specializations. - * - * For instance, let \c U1, \c U2 and \c U3 be three user defined scalar types for which most operations between instances of \c U1 and \c U2 returns an \c U3. - * You can let %Eigen knows that by defining: - \code - template - struct ScalarBinaryOpTraits { typedef U3 ReturnType; }; - template - struct ScalarBinaryOpTraits { typedef U3 ReturnType; }; - \endcode - * You can then explicitly disable some particular operations to get more explicit error messages: - \code - template<> - struct ScalarBinaryOpTraits > {}; - \endcode - * Or customize the return type for individual operation: - \code - template<> - struct ScalarBinaryOpTraits > { typedef U1 ReturnType; }; - \endcode - * - * By default, the following generic combinations are supported: - - - - - -
ScalarAScalarBBinaryOpReturnTypeNote
\c T \c T \c * \c T
\c NumTraits::Real \c T \c * \c T Only if \c NumTraits::IsComplex
\c T \c NumTraits::Real \c * \c T Only if \c NumTraits::IsComplex
- * - * \sa CwiseBinaryOp - */ -template > -struct ScalarBinaryOpTraits -#ifndef EIGEN_PARSED_BY_DOXYGEN - // for backward compatibility, use the hints given by the (deprecated) internal::scalar_product_traits class. - : internal::scalar_product_traits -#endif // EIGEN_PARSED_BY_DOXYGEN -{}; - -template -struct ScalarBinaryOpTraits -{ - typedef T ReturnType; -}; - -template -struct ScalarBinaryOpTraits::IsComplex,T>::type>::Real, BinaryOp> -{ - typedef T ReturnType; -}; -template -struct ScalarBinaryOpTraits::IsComplex,T>::type>::Real, T, BinaryOp> -{ - typedef T ReturnType; -}; - -// For Matrix * Permutation -template -struct ScalarBinaryOpTraits -{ - typedef T ReturnType; -}; - -// For Permutation * Matrix -template -struct ScalarBinaryOpTraits -{ - typedef T ReturnType; -}; - -// for Permutation*Permutation -template -struct ScalarBinaryOpTraits -{ - typedef void ReturnType; -}; - -// We require Lhs and Rhs to have "compatible" scalar types. -// It is tempting to always allow mixing different types but remember that this is often impossible in the vectorized paths. -// So allowing mixing different types gives very unexpected errors when enabling vectorization, when the user tries to -// add together a float matrix and a double matrix. -#define EIGEN_CHECK_BINARY_COMPATIBILIY(BINOP,LHS,RHS) \ - EIGEN_STATIC_ASSERT((Eigen::internal::has_ReturnType >::value), \ - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - -} // end namespace Eigen - -#endif // EIGEN_XPRHELPER_H diff --git a/Eigen/src/Eigenvalues/ComplexEigenSolver.h b/Eigen/src/Eigenvalues/ComplexEigenSolver.h deleted file mode 100644 index dc5fae06a..000000000 --- a/Eigen/src/Eigenvalues/ComplexEigenSolver.h +++ /dev/null @@ -1,346 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Claire Maurice -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2010,2012 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX_EIGEN_SOLVER_H -#define EIGEN_COMPLEX_EIGEN_SOLVER_H - -#include "./ComplexSchur.h" - -namespace Eigen { - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class ComplexEigenSolver - * - * \brief Computes eigenvalues and eigenvectors of general complex matrices - * - * \tparam _MatrixType the type of the matrix of which we are - * computing the eigendecomposition; this is expected to be an - * instantiation of the Matrix class template. - * - * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars - * \f$ \lambda \f$ and vectors \f$ v \f$ such that \f$ Av = \lambda v - * \f$. If \f$ D \f$ is a diagonal matrix with the eigenvalues on - * the diagonal, and \f$ V \f$ is a matrix with the eigenvectors as - * its columns, then \f$ A V = V D \f$. The matrix \f$ V \f$ is - * almost always invertible, in which case we have \f$ A = V D V^{-1} - * \f$. This is called the eigendecomposition. - * - * The main function in this class is compute(), which computes the - * eigenvalues and eigenvectors of a given function. The - * documentation for that function contains an example showing the - * main features of the class. - * - * \sa class EigenSolver, class SelfAdjointEigenSolver - */ -template class ComplexEigenSolver -{ - public: - - /** \brief Synonym for the template parameter \p _MatrixType. */ - typedef _MatrixType MatrixType; - - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - /** \brief Scalar type for matrices of type #MatrixType. */ - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - /** \brief Complex scalar type for #MatrixType. - * - * This is \c std::complex if #Scalar is real (e.g., - * \c float or \c double) and just \c Scalar if #Scalar is - * complex. - */ - typedef std::complex ComplexScalar; - - /** \brief Type for vector of eigenvalues as returned by eigenvalues(). - * - * This is a column vector with entries of type #ComplexScalar. - * The length of the vector is the size of #MatrixType. - */ - typedef Matrix EigenvalueType; - - /** \brief Type for matrix of eigenvectors as returned by eigenvectors(). - * - * This is a square matrix with entries of type #ComplexScalar. - * The size is the same as the size of #MatrixType. - */ - typedef Matrix EigenvectorType; - - /** \brief Default constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). - */ - ComplexEigenSolver() - : m_eivec(), - m_eivalues(), - m_schur(), - m_isInitialized(false), - m_eigenvectorsOk(false), - m_matX() - {} - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa ComplexEigenSolver() - */ - explicit ComplexEigenSolver(Index size) - : m_eivec(size, size), - m_eivalues(size), - m_schur(size), - m_isInitialized(false), - m_eigenvectorsOk(false), - m_matX(size, size) - {} - - /** \brief Constructor; computes eigendecomposition of given matrix. - * - * \param[in] matrix Square matrix whose eigendecomposition is to be computed. - * \param[in] computeEigenvectors If true, both the eigenvectors and the - * eigenvalues are computed; if false, only the eigenvalues are - * computed. - * - * This constructor calls compute() to compute the eigendecomposition. - */ - template - explicit ComplexEigenSolver(const EigenBase& matrix, bool computeEigenvectors = true) - : m_eivec(matrix.rows(),matrix.cols()), - m_eivalues(matrix.cols()), - m_schur(matrix.rows()), - m_isInitialized(false), - m_eigenvectorsOk(false), - m_matX(matrix.rows(),matrix.cols()) - { - compute(matrix.derived(), computeEigenvectors); - } - - /** \brief Returns the eigenvectors of given matrix. - * - * \returns A const reference to the matrix whose columns are the eigenvectors. - * - * \pre Either the constructor - * ComplexEigenSolver(const MatrixType& matrix, bool) or the member - * function compute(const MatrixType& matrix, bool) has been called before - * to compute the eigendecomposition of a matrix, and - * \p computeEigenvectors was set to true (the default). - * - * This function returns a matrix whose columns are the eigenvectors. Column - * \f$ k \f$ is an eigenvector corresponding to eigenvalue number \f$ k - * \f$ as returned by eigenvalues(). The eigenvectors are normalized to - * have (Euclidean) norm equal to one. The matrix returned by this - * function is the matrix \f$ V \f$ in the eigendecomposition \f$ A = V D - * V^{-1} \f$, if it exists. - * - * Example: \include ComplexEigenSolver_eigenvectors.cpp - * Output: \verbinclude ComplexEigenSolver_eigenvectors.out - */ - const EigenvectorType& eigenvectors() const - { - eigen_assert(m_isInitialized && "ComplexEigenSolver is not initialized."); - eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues."); - return m_eivec; - } - - /** \brief Returns the eigenvalues of given matrix. - * - * \returns A const reference to the column vector containing the eigenvalues. - * - * \pre Either the constructor - * ComplexEigenSolver(const MatrixType& matrix, bool) or the member - * function compute(const MatrixType& matrix, bool) has been called before - * to compute the eigendecomposition of a matrix. - * - * This function returns a column vector containing the - * eigenvalues. Eigenvalues are repeated according to their - * algebraic multiplicity, so there are as many eigenvalues as - * rows in the matrix. The eigenvalues are not sorted in any particular - * order. - * - * Example: \include ComplexEigenSolver_eigenvalues.cpp - * Output: \verbinclude ComplexEigenSolver_eigenvalues.out - */ - const EigenvalueType& eigenvalues() const - { - eigen_assert(m_isInitialized && "ComplexEigenSolver is not initialized."); - return m_eivalues; - } - - /** \brief Computes eigendecomposition of given matrix. - * - * \param[in] matrix Square matrix whose eigendecomposition is to be computed. - * \param[in] computeEigenvectors If true, both the eigenvectors and the - * eigenvalues are computed; if false, only the eigenvalues are - * computed. - * \returns Reference to \c *this - * - * This function computes the eigenvalues of the complex matrix \p matrix. - * The eigenvalues() function can be used to retrieve them. If - * \p computeEigenvectors is true, then the eigenvectors are also computed - * and can be retrieved by calling eigenvectors(). - * - * The matrix is first reduced to Schur form using the - * ComplexSchur class. The Schur decomposition is then used to - * compute the eigenvalues and eigenvectors. - * - * The cost of the computation is dominated by the cost of the - * Schur decomposition, which is \f$ O(n^3) \f$ where \f$ n \f$ - * is the size of the matrix. - * - * Example: \include ComplexEigenSolver_compute.cpp - * Output: \verbinclude ComplexEigenSolver_compute.out - */ - template - ComplexEigenSolver& compute(const EigenBase& matrix, bool computeEigenvectors = true); - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, \c NoConvergence otherwise. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "ComplexEigenSolver is not initialized."); - return m_schur.info(); - } - - /** \brief Sets the maximum number of iterations allowed. */ - ComplexEigenSolver& setMaxIterations(Index maxIters) - { - m_schur.setMaxIterations(maxIters); - return *this; - } - - /** \brief Returns the maximum number of iterations. */ - Index getMaxIterations() - { - return m_schur.getMaxIterations(); - } - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - EigenvectorType m_eivec; - EigenvalueType m_eivalues; - ComplexSchur m_schur; - bool m_isInitialized; - bool m_eigenvectorsOk; - EigenvectorType m_matX; - - private: - void doComputeEigenvectors(RealScalar matrixnorm); - void sortEigenvalues(bool computeEigenvectors); -}; - - -template -template -ComplexEigenSolver& -ComplexEigenSolver::compute(const EigenBase& matrix, bool computeEigenvectors) -{ - check_template_parameters(); - - // this code is inspired from Jampack - eigen_assert(matrix.cols() == matrix.rows()); - - // Do a complex Schur decomposition, A = U T U^* - // The eigenvalues are on the diagonal of T. - m_schur.compute(matrix.derived(), computeEigenvectors); - - if(m_schur.info() == Success) - { - m_eivalues = m_schur.matrixT().diagonal(); - if(computeEigenvectors) - doComputeEigenvectors(m_schur.matrixT().norm()); - sortEigenvalues(computeEigenvectors); - } - - m_isInitialized = true; - m_eigenvectorsOk = computeEigenvectors; - return *this; -} - - -template -void ComplexEigenSolver::doComputeEigenvectors(RealScalar matrixnorm) -{ - const Index n = m_eivalues.size(); - - matrixnorm = numext::maxi(matrixnorm,(std::numeric_limits::min)()); - - // Compute X such that T = X D X^(-1), where D is the diagonal of T. - // The matrix X is unit triangular. - m_matX = EigenvectorType::Zero(n, n); - for(Index k=n-1 ; k>=0 ; k--) - { - m_matX.coeffRef(k,k) = ComplexScalar(1.0,0.0); - // Compute X(i,k) using the (i,k) entry of the equation X T = D X - for(Index i=k-1 ; i>=0 ; i--) - { - m_matX.coeffRef(i,k) = -m_schur.matrixT().coeff(i,k); - if(k-i-1>0) - m_matX.coeffRef(i,k) -= (m_schur.matrixT().row(i).segment(i+1,k-i-1) * m_matX.col(k).segment(i+1,k-i-1)).value(); - ComplexScalar z = m_schur.matrixT().coeff(i,i) - m_schur.matrixT().coeff(k,k); - if(z==ComplexScalar(0)) - { - // If the i-th and k-th eigenvalue are equal, then z equals 0. - // Use a small value instead, to prevent division by zero. - numext::real_ref(z) = NumTraits::epsilon() * matrixnorm; - } - m_matX.coeffRef(i,k) = m_matX.coeff(i,k) / z; - } - } - - // Compute V as V = U X; now A = U T U^* = U X D X^(-1) U^* = V D V^(-1) - m_eivec.noalias() = m_schur.matrixU() * m_matX; - // .. and normalize the eigenvectors - for(Index k=0 ; k -void ComplexEigenSolver::sortEigenvalues(bool computeEigenvectors) -{ - const Index n = m_eivalues.size(); - for (Index i=0; i -// Copyright (C) 2010,2012 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLEX_SCHUR_H -#define EIGEN_COMPLEX_SCHUR_H - -#include "./HessenbergDecomposition.h" - -namespace Eigen { - -namespace internal { -template struct complex_schur_reduce_to_hessenberg; -} - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class ComplexSchur - * - * \brief Performs a complex Schur decomposition of a real or complex square matrix - * - * \tparam _MatrixType the type of the matrix of which we are - * computing the Schur decomposition; this is expected to be an - * instantiation of the Matrix class template. - * - * Given a real or complex square matrix A, this class computes the - * Schur decomposition: \f$ A = U T U^*\f$ where U is a unitary - * complex matrix, and T is a complex upper triangular matrix. The - * diagonal of the matrix T corresponds to the eigenvalues of the - * matrix A. - * - * Call the function compute() to compute the Schur decomposition of - * a given matrix. Alternatively, you can use the - * ComplexSchur(const MatrixType&, bool) constructor which computes - * the Schur decomposition at construction time. Once the - * decomposition is computed, you can use the matrixU() and matrixT() - * functions to retrieve the matrices U and V in the decomposition. - * - * \note This code is inspired from Jampack - * - * \sa class RealSchur, class EigenSolver, class ComplexEigenSolver - */ -template class ComplexSchur -{ - public: - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - /** \brief Scalar type for matrices of type \p _MatrixType. */ - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - /** \brief Complex scalar type for \p _MatrixType. - * - * This is \c std::complex if #Scalar is real (e.g., - * \c float or \c double) and just \c Scalar if #Scalar is - * complex. - */ - typedef std::complex ComplexScalar; - - /** \brief Type for the matrices in the Schur decomposition. - * - * This is a square matrix with entries of type #ComplexScalar. - * The size is the same as the size of \p _MatrixType. - */ - typedef Matrix ComplexMatrixType; - - /** \brief Default constructor. - * - * \param [in] size Positive integer, size of the matrix whose Schur decomposition will be computed. - * - * The default constructor is useful in cases in which the user - * intends to perform decompositions via compute(). The \p size - * parameter is only used as a hint. It is not an error to give a - * wrong \p size, but it may impair performance. - * - * \sa compute() for an example. - */ - explicit ComplexSchur(Index size = RowsAtCompileTime==Dynamic ? 1 : RowsAtCompileTime) - : m_matT(size,size), - m_matU(size,size), - m_hess(size), - m_isInitialized(false), - m_matUisUptodate(false), - m_maxIters(-1) - {} - - /** \brief Constructor; computes Schur decomposition of given matrix. - * - * \param[in] matrix Square matrix whose Schur decomposition is to be computed. - * \param[in] computeU If true, both T and U are computed; if false, only T is computed. - * - * This constructor calls compute() to compute the Schur decomposition. - * - * \sa matrixT() and matrixU() for examples. - */ - template - explicit ComplexSchur(const EigenBase& matrix, bool computeU = true) - : m_matT(matrix.rows(),matrix.cols()), - m_matU(matrix.rows(),matrix.cols()), - m_hess(matrix.rows()), - m_isInitialized(false), - m_matUisUptodate(false), - m_maxIters(-1) - { - compute(matrix.derived(), computeU); - } - - /** \brief Returns the unitary matrix in the Schur decomposition. - * - * \returns A const reference to the matrix U. - * - * It is assumed that either the constructor - * ComplexSchur(const MatrixType& matrix, bool computeU) or the - * member function compute(const MatrixType& matrix, bool computeU) - * has been called before to compute the Schur decomposition of a - * matrix, and that \p computeU was set to true (the default - * value). - * - * Example: \include ComplexSchur_matrixU.cpp - * Output: \verbinclude ComplexSchur_matrixU.out - */ - const ComplexMatrixType& matrixU() const - { - eigen_assert(m_isInitialized && "ComplexSchur is not initialized."); - eigen_assert(m_matUisUptodate && "The matrix U has not been computed during the ComplexSchur decomposition."); - return m_matU; - } - - /** \brief Returns the triangular matrix in the Schur decomposition. - * - * \returns A const reference to the matrix T. - * - * It is assumed that either the constructor - * ComplexSchur(const MatrixType& matrix, bool computeU) or the - * member function compute(const MatrixType& matrix, bool computeU) - * has been called before to compute the Schur decomposition of a - * matrix. - * - * Note that this function returns a plain square matrix. If you want to reference - * only the upper triangular part, use: - * \code schur.matrixT().triangularView() \endcode - * - * Example: \include ComplexSchur_matrixT.cpp - * Output: \verbinclude ComplexSchur_matrixT.out - */ - const ComplexMatrixType& matrixT() const - { - eigen_assert(m_isInitialized && "ComplexSchur is not initialized."); - return m_matT; - } - - /** \brief Computes Schur decomposition of given matrix. - * - * \param[in] matrix Square matrix whose Schur decomposition is to be computed. - * \param[in] computeU If true, both T and U are computed; if false, only T is computed. - - * \returns Reference to \c *this - * - * The Schur decomposition is computed by first reducing the - * matrix to Hessenberg form using the class - * HessenbergDecomposition. The Hessenberg matrix is then reduced - * to triangular form by performing QR iterations with a single - * shift. The cost of computing the Schur decomposition depends - * on the number of iterations; as a rough guide, it may be taken - * on the number of iterations; as a rough guide, it may be taken - * to be \f$25n^3\f$ complex flops, or \f$10n^3\f$ complex flops - * if \a computeU is false. - * - * Example: \include ComplexSchur_compute.cpp - * Output: \verbinclude ComplexSchur_compute.out - * - * \sa compute(const MatrixType&, bool, Index) - */ - template - ComplexSchur& compute(const EigenBase& matrix, bool computeU = true); - - /** \brief Compute Schur decomposition from a given Hessenberg matrix - * \param[in] matrixH Matrix in Hessenberg form H - * \param[in] matrixQ orthogonal matrix Q that transform a matrix A to H : A = Q H Q^T - * \param computeU Computes the matriX U of the Schur vectors - * \return Reference to \c *this - * - * This routine assumes that the matrix is already reduced in Hessenberg form matrixH - * using either the class HessenbergDecomposition or another mean. - * It computes the upper quasi-triangular matrix T of the Schur decomposition of H - * When computeU is true, this routine computes the matrix U such that - * A = U T U^T = (QZ) T (QZ)^T = Q H Q^T where A is the initial matrix - * - * NOTE Q is referenced if computeU is true; so, if the initial orthogonal matrix - * is not available, the user should give an identity matrix (Q.setIdentity()) - * - * \sa compute(const MatrixType&, bool) - */ - template - ComplexSchur& computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU=true); - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, \c NoConvergence otherwise. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "ComplexSchur is not initialized."); - return m_info; - } - - /** \brief Sets the maximum number of iterations allowed. - * - * If not specified by the user, the maximum number of iterations is m_maxIterationsPerRow times the size - * of the matrix. - */ - ComplexSchur& setMaxIterations(Index maxIters) - { - m_maxIters = maxIters; - return *this; - } - - /** \brief Returns the maximum number of iterations. */ - Index getMaxIterations() - { - return m_maxIters; - } - - /** \brief Maximum number of iterations per row. - * - * If not otherwise specified, the maximum number of iterations is this number times the size of the - * matrix. It is currently set to 30. - */ - static const int m_maxIterationsPerRow = 30; - - protected: - ComplexMatrixType m_matT, m_matU; - HessenbergDecomposition m_hess; - ComputationInfo m_info; - bool m_isInitialized; - bool m_matUisUptodate; - Index m_maxIters; - - private: - bool subdiagonalEntryIsNeglegible(Index i); - ComplexScalar computeShift(Index iu, Index iter); - void reduceToTriangularForm(bool computeU); - friend struct internal::complex_schur_reduce_to_hessenberg::IsComplex>; -}; - -/** If m_matT(i+1,i) is neglegible in floating point arithmetic - * compared to m_matT(i,i) and m_matT(j,j), then set it to zero and - * return true, else return false. */ -template -inline bool ComplexSchur::subdiagonalEntryIsNeglegible(Index i) -{ - RealScalar d = numext::norm1(m_matT.coeff(i,i)) + numext::norm1(m_matT.coeff(i+1,i+1)); - RealScalar sd = numext::norm1(m_matT.coeff(i+1,i)); - if (internal::isMuchSmallerThan(sd, d, NumTraits::epsilon())) - { - m_matT.coeffRef(i+1,i) = ComplexScalar(0); - return true; - } - return false; -} - - -/** Compute the shift in the current QR iteration. */ -template -typename ComplexSchur::ComplexScalar ComplexSchur::computeShift(Index iu, Index iter) -{ - using std::abs; - if (iter == 10 || iter == 20) - { - // exceptional shift, taken from http://www.netlib.org/eispack/comqr.f - return abs(numext::real(m_matT.coeff(iu,iu-1))) + abs(numext::real(m_matT.coeff(iu-1,iu-2))); - } - - // compute the shift as one of the eigenvalues of t, the 2x2 - // diagonal block on the bottom of the active submatrix - Matrix t = m_matT.template block<2,2>(iu-1,iu-1); - RealScalar normt = t.cwiseAbs().sum(); - t /= normt; // the normalization by sf is to avoid under/overflow - - ComplexScalar b = t.coeff(0,1) * t.coeff(1,0); - ComplexScalar c = t.coeff(0,0) - t.coeff(1,1); - ComplexScalar disc = sqrt(c*c + RealScalar(4)*b); - ComplexScalar det = t.coeff(0,0) * t.coeff(1,1) - b; - ComplexScalar trace = t.coeff(0,0) + t.coeff(1,1); - ComplexScalar eival1 = (trace + disc) / RealScalar(2); - ComplexScalar eival2 = (trace - disc) / RealScalar(2); - - if(numext::norm1(eival1) > numext::norm1(eival2)) - eival2 = det / eival1; - else - eival1 = det / eival2; - - // choose the eigenvalue closest to the bottom entry of the diagonal - if(numext::norm1(eival1-t.coeff(1,1)) < numext::norm1(eival2-t.coeff(1,1))) - return normt * eival1; - else - return normt * eival2; -} - - -template -template -ComplexSchur& ComplexSchur::compute(const EigenBase& matrix, bool computeU) -{ - m_matUisUptodate = false; - eigen_assert(matrix.cols() == matrix.rows()); - - if(matrix.cols() == 1) - { - m_matT = matrix.derived().template cast(); - if(computeU) m_matU = ComplexMatrixType::Identity(1,1); - m_info = Success; - m_isInitialized = true; - m_matUisUptodate = computeU; - return *this; - } - - internal::complex_schur_reduce_to_hessenberg::IsComplex>::run(*this, matrix.derived(), computeU); - computeFromHessenberg(m_matT, m_matU, computeU); - return *this; -} - -template -template -ComplexSchur& ComplexSchur::computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) -{ - m_matT = matrixH; - if(computeU) - m_matU = matrixQ; - reduceToTriangularForm(computeU); - return *this; -} -namespace internal { - -/* Reduce given matrix to Hessenberg form */ -template -struct complex_schur_reduce_to_hessenberg -{ - // this is the implementation for the case IsComplex = true - static void run(ComplexSchur& _this, const MatrixType& matrix, bool computeU) - { - _this.m_hess.compute(matrix); - _this.m_matT = _this.m_hess.matrixH(); - if(computeU) _this.m_matU = _this.m_hess.matrixQ(); - } -}; - -template -struct complex_schur_reduce_to_hessenberg -{ - static void run(ComplexSchur& _this, const MatrixType& matrix, bool computeU) - { - typedef typename ComplexSchur::ComplexScalar ComplexScalar; - - // Note: m_hess is over RealScalar; m_matT and m_matU is over ComplexScalar - _this.m_hess.compute(matrix); - _this.m_matT = _this.m_hess.matrixH().template cast(); - if(computeU) - { - // This may cause an allocation which seems to be avoidable - MatrixType Q = _this.m_hess.matrixQ(); - _this.m_matU = Q.template cast(); - } - } -}; - -} // end namespace internal - -// Reduce the Hessenberg matrix m_matT to triangular form by QR iteration. -template -void ComplexSchur::reduceToTriangularForm(bool computeU) -{ - Index maxIters = m_maxIters; - if (maxIters == -1) - maxIters = m_maxIterationsPerRow * m_matT.rows(); - - // The matrix m_matT is divided in three parts. - // Rows 0,...,il-1 are decoupled from the rest because m_matT(il,il-1) is zero. - // Rows il,...,iu is the part we are working on (the active submatrix). - // Rows iu+1,...,end are already brought in triangular form. - Index iu = m_matT.cols() - 1; - Index il; - Index iter = 0; // number of iterations we are working on the (iu,iu) element - Index totalIter = 0; // number of iterations for whole matrix - - while(true) - { - // find iu, the bottom row of the active submatrix - while(iu > 0) - { - if(!subdiagonalEntryIsNeglegible(iu-1)) break; - iter = 0; - --iu; - } - - // if iu is zero then we are done; the whole matrix is triangularized - if(iu==0) break; - - // if we spent too many iterations, we give up - iter++; - totalIter++; - if(totalIter > maxIters) break; - - // find il, the top row of the active submatrix - il = iu-1; - while(il > 0 && !subdiagonalEntryIsNeglegible(il-1)) - { - --il; - } - - /* perform the QR step using Givens rotations. The first rotation - creates a bulge; the (il+2,il) element becomes nonzero. This - bulge is chased down to the bottom of the active submatrix. */ - - ComplexScalar shift = computeShift(iu, iter); - JacobiRotation rot; - rot.makeGivens(m_matT.coeff(il,il) - shift, m_matT.coeff(il+1,il)); - m_matT.rightCols(m_matT.cols()-il).applyOnTheLeft(il, il+1, rot.adjoint()); - m_matT.topRows((std::min)(il+2,iu)+1).applyOnTheRight(il, il+1, rot); - if(computeU) m_matU.applyOnTheRight(il, il+1, rot); - - for(Index i=il+1 ; i template inline \ -ComplexSchur >& \ -ComplexSchur >::compute(const EigenBase& matrix, bool computeU) \ -{ \ - typedef Matrix MatrixType; \ - typedef MatrixType::RealScalar RealScalar; \ - typedef std::complex ComplexScalar; \ -\ - eigen_assert(matrix.cols() == matrix.rows()); \ -\ - m_matUisUptodate = false; \ - if(matrix.cols() == 1) \ - { \ - m_matT = matrix.derived().template cast(); \ - if(computeU) m_matU = ComplexMatrixType::Identity(1,1); \ - m_info = Success; \ - m_isInitialized = true; \ - m_matUisUptodate = computeU; \ - return *this; \ - } \ - lapack_int n = internal::convert_index(matrix.cols()), sdim, info; \ - lapack_int matrix_order = LAPACKE_COLROW; \ - char jobvs, sort='N'; \ - LAPACK_##LAPACKE_PREFIX_U##_SELECT1 select = 0; \ - jobvs = (computeU) ? 'V' : 'N'; \ - m_matU.resize(n, n); \ - lapack_int ldvs = internal::convert_index(m_matU.outerStride()); \ - m_matT = matrix; \ - lapack_int lda = internal::convert_index(m_matT.outerStride()); \ - Matrix w; \ - w.resize(n, 1);\ - info = LAPACKE_##LAPACKE_PREFIX##gees( matrix_order, jobvs, sort, select, n, (LAPACKE_TYPE*)m_matT.data(), lda, &sdim, (LAPACKE_TYPE*)w.data(), (LAPACKE_TYPE*)m_matU.data(), ldvs ); \ - if(info == 0) \ - m_info = Success; \ - else \ - m_info = NoConvergence; \ -\ - m_isInitialized = true; \ - m_matUisUptodate = computeU; \ - return *this; \ -\ -} - -EIGEN_LAPACKE_SCHUR_COMPLEX(dcomplex, lapack_complex_double, z, Z, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_SCHUR_COMPLEX(scomplex, lapack_complex_float, c, C, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_SCHUR_COMPLEX(dcomplex, lapack_complex_double, z, Z, RowMajor, LAPACK_ROW_MAJOR) -EIGEN_LAPACKE_SCHUR_COMPLEX(scomplex, lapack_complex_float, c, C, RowMajor, LAPACK_ROW_MAJOR) - -} // end namespace Eigen - -#endif // EIGEN_COMPLEX_SCHUR_LAPACKE_H diff --git a/Eigen/src/Eigenvalues/EigenSolver.h b/Eigen/src/Eigenvalues/EigenSolver.h deleted file mode 100644 index f205b185d..000000000 --- a/Eigen/src/Eigenvalues/EigenSolver.h +++ /dev/null @@ -1,622 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2010,2012 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_EIGENSOLVER_H -#define EIGEN_EIGENSOLVER_H - -#include "./RealSchur.h" - -namespace Eigen { - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class EigenSolver - * - * \brief Computes eigenvalues and eigenvectors of general matrices - * - * \tparam _MatrixType the type of the matrix of which we are computing the - * eigendecomposition; this is expected to be an instantiation of the Matrix - * class template. Currently, only real matrices are supported. - * - * The eigenvalues and eigenvectors of a matrix \f$ A \f$ are scalars - * \f$ \lambda \f$ and vectors \f$ v \f$ such that \f$ Av = \lambda v \f$. If - * \f$ D \f$ is a diagonal matrix with the eigenvalues on the diagonal, and - * \f$ V \f$ is a matrix with the eigenvectors as its columns, then \f$ A V = - * V D \f$. The matrix \f$ V \f$ is almost always invertible, in which case we - * have \f$ A = V D V^{-1} \f$. This is called the eigendecomposition. - * - * The eigenvalues and eigenvectors of a matrix may be complex, even when the - * matrix is real. However, we can choose real matrices \f$ V \f$ and \f$ D - * \f$ satisfying \f$ A V = V D \f$, just like the eigendecomposition, if the - * matrix \f$ D \f$ is not required to be diagonal, but if it is allowed to - * have blocks of the form - * \f[ \begin{bmatrix} u & v \\ -v & u \end{bmatrix} \f] - * (where \f$ u \f$ and \f$ v \f$ are real numbers) on the diagonal. These - * blocks correspond to complex eigenvalue pairs \f$ u \pm iv \f$. We call - * this variant of the eigendecomposition the pseudo-eigendecomposition. - * - * Call the function compute() to compute the eigenvalues and eigenvectors of - * a given matrix. Alternatively, you can use the - * EigenSolver(const MatrixType&, bool) constructor which computes the - * eigenvalues and eigenvectors at construction time. Once the eigenvalue and - * eigenvectors are computed, they can be retrieved with the eigenvalues() and - * eigenvectors() functions. The pseudoEigenvalueMatrix() and - * pseudoEigenvectors() methods allow the construction of the - * pseudo-eigendecomposition. - * - * The documentation for EigenSolver(const MatrixType&, bool) contains an - * example of the typical use of this class. - * - * \note The implementation is adapted from - * JAMA (public domain). - * Their code is based on EISPACK. - * - * \sa MatrixBase::eigenvalues(), class ComplexEigenSolver, class SelfAdjointEigenSolver - */ -template class EigenSolver -{ - public: - - /** \brief Synonym for the template parameter \p _MatrixType. */ - typedef _MatrixType MatrixType; - - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - /** \brief Scalar type for matrices of type #MatrixType. */ - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - /** \brief Complex scalar type for #MatrixType. - * - * This is \c std::complex if #Scalar is real (e.g., - * \c float or \c double) and just \c Scalar if #Scalar is - * complex. - */ - typedef std::complex ComplexScalar; - - /** \brief Type for vector of eigenvalues as returned by eigenvalues(). - * - * This is a column vector with entries of type #ComplexScalar. - * The length of the vector is the size of #MatrixType. - */ - typedef Matrix EigenvalueType; - - /** \brief Type for matrix of eigenvectors as returned by eigenvectors(). - * - * This is a square matrix with entries of type #ComplexScalar. - * The size is the same as the size of #MatrixType. - */ - typedef Matrix EigenvectorsType; - - /** \brief Default constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via EigenSolver::compute(const MatrixType&, bool). - * - * \sa compute() for an example. - */ - EigenSolver() : m_eivec(), m_eivalues(), m_isInitialized(false), m_realSchur(), m_matT(), m_tmp() {} - - /** \brief Default constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa EigenSolver() - */ - explicit EigenSolver(Index size) - : m_eivec(size, size), - m_eivalues(size), - m_isInitialized(false), - m_eigenvectorsOk(false), - m_realSchur(size), - m_matT(size, size), - m_tmp(size) - {} - - /** \brief Constructor; computes eigendecomposition of given matrix. - * - * \param[in] matrix Square matrix whose eigendecomposition is to be computed. - * \param[in] computeEigenvectors If true, both the eigenvectors and the - * eigenvalues are computed; if false, only the eigenvalues are - * computed. - * - * This constructor calls compute() to compute the eigenvalues - * and eigenvectors. - * - * Example: \include EigenSolver_EigenSolver_MatrixType.cpp - * Output: \verbinclude EigenSolver_EigenSolver_MatrixType.out - * - * \sa compute() - */ - template - explicit EigenSolver(const EigenBase& matrix, bool computeEigenvectors = true) - : m_eivec(matrix.rows(), matrix.cols()), - m_eivalues(matrix.cols()), - m_isInitialized(false), - m_eigenvectorsOk(false), - m_realSchur(matrix.cols()), - m_matT(matrix.rows(), matrix.cols()), - m_tmp(matrix.cols()) - { - compute(matrix.derived(), computeEigenvectors); - } - - /** \brief Returns the eigenvectors of given matrix. - * - * \returns %Matrix whose columns are the (possibly complex) eigenvectors. - * - * \pre Either the constructor - * EigenSolver(const MatrixType&,bool) or the member function - * compute(const MatrixType&, bool) has been called before, and - * \p computeEigenvectors was set to true (the default). - * - * Column \f$ k \f$ of the returned matrix is an eigenvector corresponding - * to eigenvalue number \f$ k \f$ as returned by eigenvalues(). The - * eigenvectors are normalized to have (Euclidean) norm equal to one. The - * matrix returned by this function is the matrix \f$ V \f$ in the - * eigendecomposition \f$ A = V D V^{-1} \f$, if it exists. - * - * Example: \include EigenSolver_eigenvectors.cpp - * Output: \verbinclude EigenSolver_eigenvectors.out - * - * \sa eigenvalues(), pseudoEigenvectors() - */ - EigenvectorsType eigenvectors() const; - - /** \brief Returns the pseudo-eigenvectors of given matrix. - * - * \returns Const reference to matrix whose columns are the pseudo-eigenvectors. - * - * \pre Either the constructor - * EigenSolver(const MatrixType&,bool) or the member function - * compute(const MatrixType&, bool) has been called before, and - * \p computeEigenvectors was set to true (the default). - * - * The real matrix \f$ V \f$ returned by this function and the - * block-diagonal matrix \f$ D \f$ returned by pseudoEigenvalueMatrix() - * satisfy \f$ AV = VD \f$. - * - * Example: \include EigenSolver_pseudoEigenvectors.cpp - * Output: \verbinclude EigenSolver_pseudoEigenvectors.out - * - * \sa pseudoEigenvalueMatrix(), eigenvectors() - */ - const MatrixType& pseudoEigenvectors() const - { - eigen_assert(m_isInitialized && "EigenSolver is not initialized."); - eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues."); - return m_eivec; - } - - /** \brief Returns the block-diagonal matrix in the pseudo-eigendecomposition. - * - * \returns A block-diagonal matrix. - * - * \pre Either the constructor - * EigenSolver(const MatrixType&,bool) or the member function - * compute(const MatrixType&, bool) has been called before. - * - * The matrix \f$ D \f$ returned by this function is real and - * block-diagonal. The blocks on the diagonal are either 1-by-1 or 2-by-2 - * blocks of the form - * \f$ \begin{bmatrix} u & v \\ -v & u \end{bmatrix} \f$. - * These blocks are not sorted in any particular order. - * The matrix \f$ D \f$ and the matrix \f$ V \f$ returned by - * pseudoEigenvectors() satisfy \f$ AV = VD \f$. - * - * \sa pseudoEigenvectors() for an example, eigenvalues() - */ - MatrixType pseudoEigenvalueMatrix() const; - - /** \brief Returns the eigenvalues of given matrix. - * - * \returns A const reference to the column vector containing the eigenvalues. - * - * \pre Either the constructor - * EigenSolver(const MatrixType&,bool) or the member function - * compute(const MatrixType&, bool) has been called before. - * - * The eigenvalues are repeated according to their algebraic multiplicity, - * so there are as many eigenvalues as rows in the matrix. The eigenvalues - * are not sorted in any particular order. - * - * Example: \include EigenSolver_eigenvalues.cpp - * Output: \verbinclude EigenSolver_eigenvalues.out - * - * \sa eigenvectors(), pseudoEigenvalueMatrix(), - * MatrixBase::eigenvalues() - */ - const EigenvalueType& eigenvalues() const - { - eigen_assert(m_isInitialized && "EigenSolver is not initialized."); - return m_eivalues; - } - - /** \brief Computes eigendecomposition of given matrix. - * - * \param[in] matrix Square matrix whose eigendecomposition is to be computed. - * \param[in] computeEigenvectors If true, both the eigenvectors and the - * eigenvalues are computed; if false, only the eigenvalues are - * computed. - * \returns Reference to \c *this - * - * This function computes the eigenvalues of the real matrix \p matrix. - * The eigenvalues() function can be used to retrieve them. If - * \p computeEigenvectors is true, then the eigenvectors are also computed - * and can be retrieved by calling eigenvectors(). - * - * The matrix is first reduced to real Schur form using the RealSchur - * class. The Schur decomposition is then used to compute the eigenvalues - * and eigenvectors. - * - * The cost of the computation is dominated by the cost of the - * Schur decomposition, which is very approximately \f$ 25n^3 \f$ - * (where \f$ n \f$ is the size of the matrix) if \p computeEigenvectors - * is true, and \f$ 10n^3 \f$ if \p computeEigenvectors is false. - * - * This method reuses of the allocated data in the EigenSolver object. - * - * Example: \include EigenSolver_compute.cpp - * Output: \verbinclude EigenSolver_compute.out - */ - template - EigenSolver& compute(const EigenBase& matrix, bool computeEigenvectors = true); - - /** \returns NumericalIssue if the input contains INF or NaN values or overflow occured. Returns Success otherwise. */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "EigenSolver is not initialized."); - return m_info; - } - - /** \brief Sets the maximum number of iterations allowed. */ - EigenSolver& setMaxIterations(Index maxIters) - { - m_realSchur.setMaxIterations(maxIters); - return *this; - } - - /** \brief Returns the maximum number of iterations. */ - Index getMaxIterations() - { - return m_realSchur.getMaxIterations(); - } - - private: - void doComputeEigenvectors(); - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - EIGEN_STATIC_ASSERT(!NumTraits::IsComplex, NUMERIC_TYPE_MUST_BE_REAL); - } - - MatrixType m_eivec; - EigenvalueType m_eivalues; - bool m_isInitialized; - bool m_eigenvectorsOk; - ComputationInfo m_info; - RealSchur m_realSchur; - MatrixType m_matT; - - typedef Matrix ColumnVectorType; - ColumnVectorType m_tmp; -}; - -template -MatrixType EigenSolver::pseudoEigenvalueMatrix() const -{ - eigen_assert(m_isInitialized && "EigenSolver is not initialized."); - const RealScalar precision = RealScalar(2)*NumTraits::epsilon(); - Index n = m_eivalues.rows(); - MatrixType matD = MatrixType::Zero(n,n); - for (Index i=0; i(i,i) << numext::real(m_eivalues.coeff(i)), numext::imag(m_eivalues.coeff(i)), - -numext::imag(m_eivalues.coeff(i)), numext::real(m_eivalues.coeff(i)); - ++i; - } - } - return matD; -} - -template -typename EigenSolver::EigenvectorsType EigenSolver::eigenvectors() const -{ - eigen_assert(m_isInitialized && "EigenSolver is not initialized."); - eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues."); - const RealScalar precision = RealScalar(2)*NumTraits::epsilon(); - Index n = m_eivec.cols(); - EigenvectorsType matV(n,n); - for (Index j=0; j(); - matV.col(j).normalize(); - } - else - { - // we have a pair of complex eigen values - for (Index i=0; i -template -EigenSolver& -EigenSolver::compute(const EigenBase& matrix, bool computeEigenvectors) -{ - check_template_parameters(); - - using std::sqrt; - using std::abs; - using numext::isfinite; - eigen_assert(matrix.cols() == matrix.rows()); - - // Reduce to real Schur form. - m_realSchur.compute(matrix.derived(), computeEigenvectors); - - m_info = m_realSchur.info(); - - if (m_info == Success) - { - m_matT = m_realSchur.matrixT(); - if (computeEigenvectors) - m_eivec = m_realSchur.matrixU(); - - // Compute eigenvalues from matT - m_eivalues.resize(matrix.cols()); - Index i = 0; - while (i < matrix.cols()) - { - if (i == matrix.cols() - 1 || m_matT.coeff(i+1, i) == Scalar(0)) - { - m_eivalues.coeffRef(i) = m_matT.coeff(i, i); - if(!(isfinite)(m_eivalues.coeffRef(i))) - { - m_isInitialized = true; - m_eigenvectorsOk = false; - m_info = NumericalIssue; - return *this; - } - ++i; - } - else - { - Scalar p = Scalar(0.5) * (m_matT.coeff(i, i) - m_matT.coeff(i+1, i+1)); - Scalar z; - // Compute z = sqrt(abs(p * p + m_matT.coeff(i+1, i) * m_matT.coeff(i, i+1))); - // without overflow - { - Scalar t0 = m_matT.coeff(i+1, i); - Scalar t1 = m_matT.coeff(i, i+1); - Scalar maxval = numext::maxi(abs(p),numext::maxi(abs(t0),abs(t1))); - t0 /= maxval; - t1 /= maxval; - Scalar p0 = p/maxval; - z = maxval * sqrt(abs(p0 * p0 + t0 * t1)); - } - - m_eivalues.coeffRef(i) = ComplexScalar(m_matT.coeff(i+1, i+1) + p, z); - m_eivalues.coeffRef(i+1) = ComplexScalar(m_matT.coeff(i+1, i+1) + p, -z); - if(!((isfinite)(m_eivalues.coeffRef(i)) && (isfinite)(m_eivalues.coeffRef(i+1)))) - { - m_isInitialized = true; - m_eigenvectorsOk = false; - m_info = NumericalIssue; - return *this; - } - i += 2; - } - } - - // Compute eigenvectors. - if (computeEigenvectors) - doComputeEigenvectors(); - } - - m_isInitialized = true; - m_eigenvectorsOk = computeEigenvectors; - - return *this; -} - - -template -void EigenSolver::doComputeEigenvectors() -{ - using std::abs; - const Index size = m_eivec.cols(); - const Scalar eps = NumTraits::epsilon(); - - // inefficient! this is already computed in RealSchur - Scalar norm(0); - for (Index j = 0; j < size; ++j) - { - norm += m_matT.row(j).segment((std::max)(j-1,Index(0)), size-(std::max)(j-1,Index(0))).cwiseAbs().sum(); - } - - // Backsubstitute to find vectors of upper triangular form - if (norm == Scalar(0)) - { - return; - } - - for (Index n = size-1; n >= 0; n--) - { - Scalar p = m_eivalues.coeff(n).real(); - Scalar q = m_eivalues.coeff(n).imag(); - - // Scalar vector - if (q == Scalar(0)) - { - Scalar lastr(0), lastw(0); - Index l = n; - - m_matT.coeffRef(n,n) = Scalar(1); - for (Index i = n-1; i >= 0; i--) - { - Scalar w = m_matT.coeff(i,i) - p; - Scalar r = m_matT.row(i).segment(l,n-l+1).dot(m_matT.col(n).segment(l, n-l+1)); - - if (m_eivalues.coeff(i).imag() < Scalar(0)) - { - lastw = w; - lastr = r; - } - else - { - l = i; - if (m_eivalues.coeff(i).imag() == Scalar(0)) - { - if (w != Scalar(0)) - m_matT.coeffRef(i,n) = -r / w; - else - m_matT.coeffRef(i,n) = -r / (eps * norm); - } - else // Solve real equations - { - Scalar x = m_matT.coeff(i,i+1); - Scalar y = m_matT.coeff(i+1,i); - Scalar denom = (m_eivalues.coeff(i).real() - p) * (m_eivalues.coeff(i).real() - p) + m_eivalues.coeff(i).imag() * m_eivalues.coeff(i).imag(); - Scalar t = (x * lastr - lastw * r) / denom; - m_matT.coeffRef(i,n) = t; - if (abs(x) > abs(lastw)) - m_matT.coeffRef(i+1,n) = (-r - w * t) / x; - else - m_matT.coeffRef(i+1,n) = (-lastr - y * t) / lastw; - } - - // Overflow control - Scalar t = abs(m_matT.coeff(i,n)); - if ((eps * t) * t > Scalar(1)) - m_matT.col(n).tail(size-i) /= t; - } - } - } - else if (q < Scalar(0) && n > 0) // Complex vector - { - Scalar lastra(0), lastsa(0), lastw(0); - Index l = n-1; - - // Last vector component imaginary so matrix is triangular - if (abs(m_matT.coeff(n,n-1)) > abs(m_matT.coeff(n-1,n))) - { - m_matT.coeffRef(n-1,n-1) = q / m_matT.coeff(n,n-1); - m_matT.coeffRef(n-1,n) = -(m_matT.coeff(n,n) - p) / m_matT.coeff(n,n-1); - } - else - { - ComplexScalar cc = ComplexScalar(Scalar(0),-m_matT.coeff(n-1,n)) / ComplexScalar(m_matT.coeff(n-1,n-1)-p,q); - m_matT.coeffRef(n-1,n-1) = numext::real(cc); - m_matT.coeffRef(n-1,n) = numext::imag(cc); - } - m_matT.coeffRef(n,n-1) = Scalar(0); - m_matT.coeffRef(n,n) = Scalar(1); - for (Index i = n-2; i >= 0; i--) - { - Scalar ra = m_matT.row(i).segment(l, n-l+1).dot(m_matT.col(n-1).segment(l, n-l+1)); - Scalar sa = m_matT.row(i).segment(l, n-l+1).dot(m_matT.col(n).segment(l, n-l+1)); - Scalar w = m_matT.coeff(i,i) - p; - - if (m_eivalues.coeff(i).imag() < Scalar(0)) - { - lastw = w; - lastra = ra; - lastsa = sa; - } - else - { - l = i; - if (m_eivalues.coeff(i).imag() == RealScalar(0)) - { - ComplexScalar cc = ComplexScalar(-ra,-sa) / ComplexScalar(w,q); - m_matT.coeffRef(i,n-1) = numext::real(cc); - m_matT.coeffRef(i,n) = numext::imag(cc); - } - else - { - // Solve complex equations - Scalar x = m_matT.coeff(i,i+1); - Scalar y = m_matT.coeff(i+1,i); - Scalar vr = (m_eivalues.coeff(i).real() - p) * (m_eivalues.coeff(i).real() - p) + m_eivalues.coeff(i).imag() * m_eivalues.coeff(i).imag() - q * q; - Scalar vi = (m_eivalues.coeff(i).real() - p) * Scalar(2) * q; - if ((vr == Scalar(0)) && (vi == Scalar(0))) - vr = eps * norm * (abs(w) + abs(q) + abs(x) + abs(y) + abs(lastw)); - - ComplexScalar cc = ComplexScalar(x*lastra-lastw*ra+q*sa,x*lastsa-lastw*sa-q*ra) / ComplexScalar(vr,vi); - m_matT.coeffRef(i,n-1) = numext::real(cc); - m_matT.coeffRef(i,n) = numext::imag(cc); - if (abs(x) > (abs(lastw) + abs(q))) - { - m_matT.coeffRef(i+1,n-1) = (-ra - w * m_matT.coeff(i,n-1) + q * m_matT.coeff(i,n)) / x; - m_matT.coeffRef(i+1,n) = (-sa - w * m_matT.coeff(i,n) - q * m_matT.coeff(i,n-1)) / x; - } - else - { - cc = ComplexScalar(-lastra-y*m_matT.coeff(i,n-1),-lastsa-y*m_matT.coeff(i,n)) / ComplexScalar(lastw,q); - m_matT.coeffRef(i+1,n-1) = numext::real(cc); - m_matT.coeffRef(i+1,n) = numext::imag(cc); - } - } - - // Overflow control - Scalar t = numext::maxi(abs(m_matT.coeff(i,n-1)),abs(m_matT.coeff(i,n))); - if ((eps * t) * t > Scalar(1)) - m_matT.block(i, n-1, size-i, 2) /= t; - - } - } - - // We handled a pair of complex conjugate eigenvalues, so need to skip them both - n--; - } - else - { - eigen_assert(0 && "Internal bug in EigenSolver (INF or NaN has not been detected)"); // this should not happen - } - } - - // Back transformation to get eigenvectors of original matrix - for (Index j = size-1; j >= 0; j--) - { - m_tmp.noalias() = m_eivec.leftCols(j+1) * m_matT.col(j).segment(0, j+1); - m_eivec.col(j) = m_tmp; - } -} - -} // end namespace Eigen - -#endif // EIGEN_EIGENSOLVER_H diff --git a/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h b/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h deleted file mode 100644 index 36a91dffc..000000000 --- a/Eigen/src/Eigenvalues/GeneralizedEigenSolver.h +++ /dev/null @@ -1,419 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012-2016 Gael Guennebaud -// Copyright (C) 2010,2012 Jitse Niesen -// Copyright (C) 2016 Tobias Wood -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GENERALIZEDEIGENSOLVER_H -#define EIGEN_GENERALIZEDEIGENSOLVER_H - -#include "./RealQZ.h" - -namespace Eigen { - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class GeneralizedEigenSolver - * - * \brief Computes the generalized eigenvalues and eigenvectors of a pair of general matrices - * - * \tparam _MatrixType the type of the matrices of which we are computing the - * eigen-decomposition; this is expected to be an instantiation of the Matrix - * class template. Currently, only real matrices are supported. - * - * The generalized eigenvalues and eigenvectors of a matrix pair \f$ A \f$ and \f$ B \f$ are scalars - * \f$ \lambda \f$ and vectors \f$ v \f$ such that \f$ Av = \lambda Bv \f$. If - * \f$ D \f$ is a diagonal matrix with the eigenvalues on the diagonal, and - * \f$ V \f$ is a matrix with the eigenvectors as its columns, then \f$ A V = - * B V D \f$. The matrix \f$ V \f$ is almost always invertible, in which case we - * have \f$ A = B V D V^{-1} \f$. This is called the generalized eigen-decomposition. - * - * The generalized eigenvalues and eigenvectors of a matrix pair may be complex, even when the - * matrices are real. Moreover, the generalized eigenvalue might be infinite if the matrix B is - * singular. To workaround this difficulty, the eigenvalues are provided as a pair of complex \f$ \alpha \f$ - * and real \f$ \beta \f$ such that: \f$ \lambda_i = \alpha_i / \beta_i \f$. If \f$ \beta_i \f$ is (nearly) zero, - * then one can consider the well defined left eigenvalue \f$ \mu = \beta_i / \alpha_i\f$ such that: - * \f$ \mu_i A v_i = B v_i \f$, or even \f$ \mu_i u_i^T A = u_i^T B \f$ where \f$ u_i \f$ is - * called the left eigenvector. - * - * Call the function compute() to compute the generalized eigenvalues and eigenvectors of - * a given matrix pair. Alternatively, you can use the - * GeneralizedEigenSolver(const MatrixType&, const MatrixType&, bool) constructor which computes the - * eigenvalues and eigenvectors at construction time. Once the eigenvalue and - * eigenvectors are computed, they can be retrieved with the eigenvalues() and - * eigenvectors() functions. - * - * Here is an usage example of this class: - * Example: \include GeneralizedEigenSolver.cpp - * Output: \verbinclude GeneralizedEigenSolver.out - * - * \sa MatrixBase::eigenvalues(), class ComplexEigenSolver, class SelfAdjointEigenSolver - */ -template class GeneralizedEigenSolver -{ - public: - - /** \brief Synonym for the template parameter \p _MatrixType. */ - typedef _MatrixType MatrixType; - - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - /** \brief Scalar type for matrices of type #MatrixType. */ - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - /** \brief Complex scalar type for #MatrixType. - * - * This is \c std::complex if #Scalar is real (e.g., - * \c float or \c double) and just \c Scalar if #Scalar is - * complex. - */ - typedef std::complex ComplexScalar; - - /** \brief Type for vector of real scalar values eigenvalues as returned by betas(). - * - * This is a column vector with entries of type #Scalar. - * The length of the vector is the size of #MatrixType. - */ - typedef Matrix VectorType; - - /** \brief Type for vector of complex scalar values eigenvalues as returned by alphas(). - * - * This is a column vector with entries of type #ComplexScalar. - * The length of the vector is the size of #MatrixType. - */ - typedef Matrix ComplexVectorType; - - /** \brief Expression type for the eigenvalues as returned by eigenvalues(). - */ - typedef CwiseBinaryOp,ComplexVectorType,VectorType> EigenvalueType; - - /** \brief Type for matrix of eigenvectors as returned by eigenvectors(). - * - * This is a square matrix with entries of type #ComplexScalar. - * The size is the same as the size of #MatrixType. - */ - typedef Matrix EigenvectorsType; - - /** \brief Default constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via EigenSolver::compute(const MatrixType&, bool). - * - * \sa compute() for an example. - */ - GeneralizedEigenSolver() - : m_eivec(), - m_alphas(), - m_betas(), - m_valuesOkay(false), - m_vectorsOkay(false), - m_realQZ() - {} - - /** \brief Default constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa GeneralizedEigenSolver() - */ - explicit GeneralizedEigenSolver(Index size) - : m_eivec(size, size), - m_alphas(size), - m_betas(size), - m_valuesOkay(false), - m_vectorsOkay(false), - m_realQZ(size), - m_tmp(size) - {} - - /** \brief Constructor; computes the generalized eigendecomposition of given matrix pair. - * - * \param[in] A Square matrix whose eigendecomposition is to be computed. - * \param[in] B Square matrix whose eigendecomposition is to be computed. - * \param[in] computeEigenvectors If true, both the eigenvectors and the - * eigenvalues are computed; if false, only the eigenvalues are computed. - * - * This constructor calls compute() to compute the generalized eigenvalues - * and eigenvectors. - * - * \sa compute() - */ - GeneralizedEigenSolver(const MatrixType& A, const MatrixType& B, bool computeEigenvectors = true) - : m_eivec(A.rows(), A.cols()), - m_alphas(A.cols()), - m_betas(A.cols()), - m_valuesOkay(false), - m_vectorsOkay(false), - m_realQZ(A.cols()), - m_tmp(A.cols()) - { - compute(A, B, computeEigenvectors); - } - - /* \brief Returns the computed generalized eigenvectors. - * - * \returns %Matrix whose columns are the (possibly complex) right eigenvectors. - * i.e. the eigenvectors that solve (A - l*B)x = 0. The ordering matches the eigenvalues. - * - * \pre Either the constructor - * GeneralizedEigenSolver(const MatrixType&,const MatrixType&, bool) or the member function - * compute(const MatrixType&, const MatrixType& bool) has been called before, and - * \p computeEigenvectors was set to true (the default). - * - * \sa eigenvalues() - */ - EigenvectorsType eigenvectors() const { - eigen_assert(m_vectorsOkay && "Eigenvectors for GeneralizedEigenSolver were not calculated."); - return m_eivec; - } - - /** \brief Returns an expression of the computed generalized eigenvalues. - * - * \returns An expression of the column vector containing the eigenvalues. - * - * It is a shortcut for \code this->alphas().cwiseQuotient(this->betas()); \endcode - * Not that betas might contain zeros. It is therefore not recommended to use this function, - * but rather directly deal with the alphas and betas vectors. - * - * \pre Either the constructor - * GeneralizedEigenSolver(const MatrixType&,const MatrixType&,bool) or the member function - * compute(const MatrixType&,const MatrixType&,bool) has been called before. - * - * The eigenvalues are repeated according to their algebraic multiplicity, - * so there are as many eigenvalues as rows in the matrix. The eigenvalues - * are not sorted in any particular order. - * - * \sa alphas(), betas(), eigenvectors() - */ - EigenvalueType eigenvalues() const - { - eigen_assert(m_valuesOkay && "GeneralizedEigenSolver is not initialized."); - return EigenvalueType(m_alphas,m_betas); - } - - /** \returns A const reference to the vectors containing the alpha values - * - * This vector permits to reconstruct the j-th eigenvalues as alphas(i)/betas(j). - * - * \sa betas(), eigenvalues() */ - ComplexVectorType alphas() const - { - eigen_assert(m_valuesOkay && "GeneralizedEigenSolver is not initialized."); - return m_alphas; - } - - /** \returns A const reference to the vectors containing the beta values - * - * This vector permits to reconstruct the j-th eigenvalues as alphas(i)/betas(j). - * - * \sa alphas(), eigenvalues() */ - VectorType betas() const - { - eigen_assert(m_valuesOkay && "GeneralizedEigenSolver is not initialized."); - return m_betas; - } - - /** \brief Computes generalized eigendecomposition of given matrix. - * - * \param[in] A Square matrix whose eigendecomposition is to be computed. - * \param[in] B Square matrix whose eigendecomposition is to be computed. - * \param[in] computeEigenvectors If true, both the eigenvectors and the - * eigenvalues are computed; if false, only the eigenvalues are - * computed. - * \returns Reference to \c *this - * - * This function computes the eigenvalues of the real matrix \p matrix. - * The eigenvalues() function can be used to retrieve them. If - * \p computeEigenvectors is true, then the eigenvectors are also computed - * and can be retrieved by calling eigenvectors(). - * - * The matrix is first reduced to real generalized Schur form using the RealQZ - * class. The generalized Schur decomposition is then used to compute the eigenvalues - * and eigenvectors. - * - * The cost of the computation is dominated by the cost of the - * generalized Schur decomposition. - * - * This method reuses of the allocated data in the GeneralizedEigenSolver object. - */ - GeneralizedEigenSolver& compute(const MatrixType& A, const MatrixType& B, bool computeEigenvectors = true); - - ComputationInfo info() const - { - eigen_assert(m_valuesOkay && "EigenSolver is not initialized."); - return m_realQZ.info(); - } - - /** Sets the maximal number of iterations allowed. - */ - GeneralizedEigenSolver& setMaxIterations(Index maxIters) - { - m_realQZ.setMaxIterations(maxIters); - return *this; - } - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - EIGEN_STATIC_ASSERT(!NumTraits::IsComplex, NUMERIC_TYPE_MUST_BE_REAL); - } - - EigenvectorsType m_eivec; - ComplexVectorType m_alphas; - VectorType m_betas; - bool m_valuesOkay, m_vectorsOkay; - RealQZ m_realQZ; - ComplexVectorType m_tmp; -}; - -template -GeneralizedEigenSolver& -GeneralizedEigenSolver::compute(const MatrixType& A, const MatrixType& B, bool computeEigenvectors) -{ - check_template_parameters(); - - using std::sqrt; - using std::abs; - eigen_assert(A.cols() == A.rows() && B.cols() == A.rows() && B.cols() == B.rows()); - Index size = A.cols(); - m_valuesOkay = false; - m_vectorsOkay = false; - // Reduce to generalized real Schur form: - // A = Q S Z and B = Q T Z - m_realQZ.compute(A, B, computeEigenvectors); - if (m_realQZ.info() == Success) - { - // Resize storage - m_alphas.resize(size); - m_betas.resize(size); - if (computeEigenvectors) - { - m_eivec.resize(size,size); - m_tmp.resize(size); - } - - // Aliases: - Map v(reinterpret_cast(m_tmp.data()), size); - ComplexVectorType &cv = m_tmp; - const MatrixType &mZ = m_realQZ.matrixZ(); - const MatrixType &mS = m_realQZ.matrixS(); - const MatrixType &mT = m_realQZ.matrixT(); - - Index i = 0; - while (i < size) - { - if (i == size - 1 || mS.coeff(i+1, i) == Scalar(0)) - { - // Real eigenvalue - m_alphas.coeffRef(i) = mS.diagonal().coeff(i); - m_betas.coeffRef(i) = mT.diagonal().coeff(i); - if (computeEigenvectors) - { - v.setConstant(Scalar(0.0)); - v.coeffRef(i) = Scalar(1.0); - // For singular eigenvalues do nothing more - if(abs(m_betas.coeffRef(i)) >= (std::numeric_limits::min)()) - { - // Non-singular eigenvalue - const Scalar alpha = real(m_alphas.coeffRef(i)); - const Scalar beta = m_betas.coeffRef(i); - for (Index j = i-1; j >= 0; j--) - { - const Index st = j+1; - const Index sz = i-j; - if (j > 0 && mS.coeff(j, j-1) != Scalar(0)) - { - // 2x2 block - Matrix rhs = (alpha*mT.template block<2,Dynamic>(j-1,st,2,sz) - beta*mS.template block<2,Dynamic>(j-1,st,2,sz)) .lazyProduct( v.segment(st,sz) ); - Matrix lhs = beta * mS.template block<2,2>(j-1,j-1) - alpha * mT.template block<2,2>(j-1,j-1); - v.template segment<2>(j-1) = lhs.partialPivLu().solve(rhs); - j--; - } - else - { - v.coeffRef(j) = -v.segment(st,sz).transpose().cwiseProduct(beta*mS.block(j,st,1,sz) - alpha*mT.block(j,st,1,sz)).sum() / (beta*mS.coeffRef(j,j) - alpha*mT.coeffRef(j,j)); - } - } - } - m_eivec.col(i).real().noalias() = mZ.transpose() * v; - m_eivec.col(i).real().normalize(); - m_eivec.col(i).imag().setConstant(0); - } - ++i; - } - else - { - // We need to extract the generalized eigenvalues of the pair of a general 2x2 block S and a positive diagonal 2x2 block T - // Then taking beta=T_00*T_11, we can avoid any division, and alpha is the eigenvalues of A = (U^-1 * S * U) * diag(T_11,T_00): - - // T = [a 0] - // [0 b] - RealScalar a = mT.diagonal().coeff(i), - b = mT.diagonal().coeff(i+1); - const RealScalar beta = m_betas.coeffRef(i) = m_betas.coeffRef(i+1) = a*b; - - // ^^ NOTE: using diagonal()(i) instead of coeff(i,i) workarounds a MSVC bug. - Matrix S2 = mS.template block<2,2>(i,i) * Matrix(b,a).asDiagonal(); - - Scalar p = Scalar(0.5) * (S2.coeff(0,0) - S2.coeff(1,1)); - Scalar z = sqrt(abs(p * p + S2.coeff(1,0) * S2.coeff(0,1))); - const ComplexScalar alpha = ComplexScalar(S2.coeff(1,1) + p, (beta > 0) ? z : -z); - m_alphas.coeffRef(i) = conj(alpha); - m_alphas.coeffRef(i+1) = alpha; - - if (computeEigenvectors) { - // Compute eigenvector in position (i+1) and then position (i) is just the conjugate - cv.setZero(); - cv.coeffRef(i+1) = Scalar(1.0); - // here, the "static_cast" workaound expression template issues. - cv.coeffRef(i) = -(static_cast(beta*mS.coeffRef(i,i+1)) - alpha*mT.coeffRef(i,i+1)) - / (static_cast(beta*mS.coeffRef(i,i)) - alpha*mT.coeffRef(i,i)); - for (Index j = i-1; j >= 0; j--) - { - const Index st = j+1; - const Index sz = i+1-j; - if (j > 0 && mS.coeff(j, j-1) != Scalar(0)) - { - // 2x2 block - Matrix rhs = (alpha*mT.template block<2,Dynamic>(j-1,st,2,sz) - beta*mS.template block<2,Dynamic>(j-1,st,2,sz)) .lazyProduct( cv.segment(st,sz) ); - Matrix lhs = beta * mS.template block<2,2>(j-1,j-1) - alpha * mT.template block<2,2>(j-1,j-1); - cv.template segment<2>(j-1) = lhs.partialPivLu().solve(rhs); - j--; - } else { - cv.coeffRef(j) = cv.segment(st,sz).transpose().cwiseProduct(beta*mS.block(j,st,1,sz) - alpha*mT.block(j,st,1,sz)).sum() - / (alpha*mT.coeffRef(j,j) - static_cast(beta*mS.coeffRef(j,j))); - } - } - m_eivec.col(i+1).noalias() = (mZ.transpose() * cv); - m_eivec.col(i+1).normalize(); - m_eivec.col(i) = m_eivec.col(i+1).conjugate(); - } - i += 2; - } - } - - m_valuesOkay = true; - m_vectorsOkay = computeEigenvectors; - } - return *this; -} - -} // end namespace Eigen - -#endif // EIGEN_GENERALIZEDEIGENSOLVER_H diff --git a/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h deleted file mode 100644 index 5f6bb8289..000000000 --- a/Eigen/src/Eigenvalues/GeneralizedSelfAdjointEigenSolver.h +++ /dev/null @@ -1,226 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2010 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GENERALIZEDSELFADJOINTEIGENSOLVER_H -#define EIGEN_GENERALIZEDSELFADJOINTEIGENSOLVER_H - -#include "./Tridiagonalization.h" - -namespace Eigen { - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class GeneralizedSelfAdjointEigenSolver - * - * \brief Computes eigenvalues and eigenvectors of the generalized selfadjoint eigen problem - * - * \tparam _MatrixType the type of the matrix of which we are computing the - * eigendecomposition; this is expected to be an instantiation of the Matrix - * class template. - * - * This class solves the generalized eigenvalue problem - * \f$ Av = \lambda Bv \f$. In this case, the matrix \f$ A \f$ should be - * selfadjoint and the matrix \f$ B \f$ should be positive definite. - * - * Only the \b lower \b triangular \b part of the input matrix is referenced. - * - * Call the function compute() to compute the eigenvalues and eigenvectors of - * a given matrix. Alternatively, you can use the - * GeneralizedSelfAdjointEigenSolver(const MatrixType&, const MatrixType&, int) - * constructor which computes the eigenvalues and eigenvectors at construction time. - * Once the eigenvalue and eigenvectors are computed, they can be retrieved with the eigenvalues() - * and eigenvectors() functions. - * - * The documentation for GeneralizedSelfAdjointEigenSolver(const MatrixType&, const MatrixType&, int) - * contains an example of the typical use of this class. - * - * \sa class SelfAdjointEigenSolver, class EigenSolver, class ComplexEigenSolver - */ -template -class GeneralizedSelfAdjointEigenSolver : public SelfAdjointEigenSolver<_MatrixType> -{ - typedef SelfAdjointEigenSolver<_MatrixType> Base; - public: - - typedef _MatrixType MatrixType; - - /** \brief Default constructor for fixed-size matrices. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). This constructor - * can only be used if \p _MatrixType is a fixed-size matrix; use - * GeneralizedSelfAdjointEigenSolver(Index) for dynamic-size matrices. - */ - GeneralizedSelfAdjointEigenSolver() : Base() {} - - /** \brief Constructor, pre-allocates memory for dynamic-size matrices. - * - * \param [in] size Positive integer, size of the matrix whose - * eigenvalues and eigenvectors will be computed. - * - * This constructor is useful for dynamic-size matrices, when the user - * intends to perform decompositions via compute(). The \p size - * parameter is only used as a hint. It is not an error to give a wrong - * \p size, but it may impair performance. - * - * \sa compute() for an example - */ - explicit GeneralizedSelfAdjointEigenSolver(Index size) - : Base(size) - {} - - /** \brief Constructor; computes generalized eigendecomposition of given matrix pencil. - * - * \param[in] matA Selfadjoint matrix in matrix pencil. - * Only the lower triangular part of the matrix is referenced. - * \param[in] matB Positive-definite matrix in matrix pencil. - * Only the lower triangular part of the matrix is referenced. - * \param[in] options A or-ed set of flags {#ComputeEigenvectors,#EigenvaluesOnly} | {#Ax_lBx,#ABx_lx,#BAx_lx}. - * Default is #ComputeEigenvectors|#Ax_lBx. - * - * This constructor calls compute(const MatrixType&, const MatrixType&, int) - * to compute the eigenvalues and (if requested) the eigenvectors of the - * generalized eigenproblem \f$ Ax = \lambda B x \f$ with \a matA the - * selfadjoint matrix \f$ A \f$ and \a matB the positive definite matrix - * \f$ B \f$. Each eigenvector \f$ x \f$ satisfies the property - * \f$ x^* B x = 1 \f$. The eigenvectors are computed if - * \a options contains ComputeEigenvectors. - * - * In addition, the two following variants can be solved via \p options: - * - \c ABx_lx: \f$ ABx = \lambda x \f$ - * - \c BAx_lx: \f$ BAx = \lambda x \f$ - * - * Example: \include SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType2.cpp - * Output: \verbinclude SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType2.out - * - * \sa compute(const MatrixType&, const MatrixType&, int) - */ - GeneralizedSelfAdjointEigenSolver(const MatrixType& matA, const MatrixType& matB, - int options = ComputeEigenvectors|Ax_lBx) - : Base(matA.cols()) - { - compute(matA, matB, options); - } - - /** \brief Computes generalized eigendecomposition of given matrix pencil. - * - * \param[in] matA Selfadjoint matrix in matrix pencil. - * Only the lower triangular part of the matrix is referenced. - * \param[in] matB Positive-definite matrix in matrix pencil. - * Only the lower triangular part of the matrix is referenced. - * \param[in] options A or-ed set of flags {#ComputeEigenvectors,#EigenvaluesOnly} | {#Ax_lBx,#ABx_lx,#BAx_lx}. - * Default is #ComputeEigenvectors|#Ax_lBx. - * - * \returns Reference to \c *this - * - * Accoring to \p options, this function computes eigenvalues and (if requested) - * the eigenvectors of one of the following three generalized eigenproblems: - * - \c Ax_lBx: \f$ Ax = \lambda B x \f$ - * - \c ABx_lx: \f$ ABx = \lambda x \f$ - * - \c BAx_lx: \f$ BAx = \lambda x \f$ - * with \a matA the selfadjoint matrix \f$ A \f$ and \a matB the positive definite - * matrix \f$ B \f$. - * In addition, each eigenvector \f$ x \f$ satisfies the property \f$ x^* B x = 1 \f$. - * - * The eigenvalues() function can be used to retrieve - * the eigenvalues. If \p options contains ComputeEigenvectors, then the - * eigenvectors are also computed and can be retrieved by calling - * eigenvectors(). - * - * The implementation uses LLT to compute the Cholesky decomposition - * \f$ B = LL^* \f$ and computes the classical eigendecomposition - * of the selfadjoint matrix \f$ L^{-1} A (L^*)^{-1} \f$ if \p options contains Ax_lBx - * and of \f$ L^{*} A L \f$ otherwise. This solves the - * generalized eigenproblem, because any solution of the generalized - * eigenproblem \f$ Ax = \lambda B x \f$ corresponds to a solution - * \f$ L^{-1} A (L^*)^{-1} (L^* x) = \lambda (L^* x) \f$ of the - * eigenproblem for \f$ L^{-1} A (L^*)^{-1} \f$. Similar statements - * can be made for the two other variants. - * - * Example: \include SelfAdjointEigenSolver_compute_MatrixType2.cpp - * Output: \verbinclude SelfAdjointEigenSolver_compute_MatrixType2.out - * - * \sa GeneralizedSelfAdjointEigenSolver(const MatrixType&, const MatrixType&, int) - */ - GeneralizedSelfAdjointEigenSolver& compute(const MatrixType& matA, const MatrixType& matB, - int options = ComputeEigenvectors|Ax_lBx); - - protected: - -}; - - -template -GeneralizedSelfAdjointEigenSolver& GeneralizedSelfAdjointEigenSolver:: -compute(const MatrixType& matA, const MatrixType& matB, int options) -{ - eigen_assert(matA.cols()==matA.rows() && matB.rows()==matA.rows() && matB.cols()==matB.rows()); - eigen_assert((options&~(EigVecMask|GenEigMask))==0 - && (options&EigVecMask)!=EigVecMask - && ((options&GenEigMask)==0 || (options&GenEigMask)==Ax_lBx - || (options&GenEigMask)==ABx_lx || (options&GenEigMask)==BAx_lx) - && "invalid option parameter"); - - bool computeEigVecs = ((options&EigVecMask)==0) || ((options&EigVecMask)==ComputeEigenvectors); - - // Compute the cholesky decomposition of matB = L L' = U'U - LLT cholB(matB); - - int type = (options&GenEigMask); - if(type==0) - type = Ax_lBx; - - if(type==Ax_lBx) - { - // compute C = inv(L) A inv(L') - MatrixType matC = matA.template selfadjointView(); - cholB.matrixL().template solveInPlace(matC); - cholB.matrixU().template solveInPlace(matC); - - Base::compute(matC, computeEigVecs ? ComputeEigenvectors : EigenvaluesOnly ); - - // transform back the eigen vectors: evecs = inv(U) * evecs - if(computeEigVecs) - cholB.matrixU().solveInPlace(Base::m_eivec); - } - else if(type==ABx_lx) - { - // compute C = L' A L - MatrixType matC = matA.template selfadjointView(); - matC = matC * cholB.matrixL(); - matC = cholB.matrixU() * matC; - - Base::compute(matC, computeEigVecs ? ComputeEigenvectors : EigenvaluesOnly); - - // transform back the eigen vectors: evecs = inv(U) * evecs - if(computeEigVecs) - cholB.matrixU().solveInPlace(Base::m_eivec); - } - else if(type==BAx_lx) - { - // compute C = L' A L - MatrixType matC = matA.template selfadjointView(); - matC = matC * cholB.matrixL(); - matC = cholB.matrixU() * matC; - - Base::compute(matC, computeEigVecs ? ComputeEigenvectors : EigenvaluesOnly); - - // transform back the eigen vectors: evecs = L * evecs - if(computeEigVecs) - Base::m_eivec = cholB.matrixL() * Base::m_eivec; - } - - return *this; -} - -} // end namespace Eigen - -#endif // EIGEN_GENERALIZEDSELFADJOINTEIGENSOLVER_H diff --git a/Eigen/src/Eigenvalues/HessenbergDecomposition.h b/Eigen/src/Eigenvalues/HessenbergDecomposition.h deleted file mode 100644 index f647f69b0..000000000 --- a/Eigen/src/Eigenvalues/HessenbergDecomposition.h +++ /dev/null @@ -1,374 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2010 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_HESSENBERGDECOMPOSITION_H -#define EIGEN_HESSENBERGDECOMPOSITION_H - -namespace Eigen { - -namespace internal { - -template struct HessenbergDecompositionMatrixHReturnType; -template -struct traits > -{ - typedef MatrixType ReturnType; -}; - -} - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class HessenbergDecomposition - * - * \brief Reduces a square matrix to Hessenberg form by an orthogonal similarity transformation - * - * \tparam _MatrixType the type of the matrix of which we are computing the Hessenberg decomposition - * - * This class performs an Hessenberg decomposition of a matrix \f$ A \f$. In - * the real case, the Hessenberg decomposition consists of an orthogonal - * matrix \f$ Q \f$ and a Hessenberg matrix \f$ H \f$ such that \f$ A = Q H - * Q^T \f$. An orthogonal matrix is a matrix whose inverse equals its - * transpose (\f$ Q^{-1} = Q^T \f$). A Hessenberg matrix has zeros below the - * subdiagonal, so it is almost upper triangular. The Hessenberg decomposition - * of a complex matrix is \f$ A = Q H Q^* \f$ with \f$ Q \f$ unitary (that is, - * \f$ Q^{-1} = Q^* \f$). - * - * Call the function compute() to compute the Hessenberg decomposition of a - * given matrix. Alternatively, you can use the - * HessenbergDecomposition(const MatrixType&) constructor which computes the - * Hessenberg decomposition at construction time. Once the decomposition is - * computed, you can use the matrixH() and matrixQ() functions to construct - * the matrices H and Q in the decomposition. - * - * The documentation for matrixH() contains an example of the typical use of - * this class. - * - * \sa class ComplexSchur, class Tridiagonalization, \ref QR_Module "QR Module" - */ -template class HessenbergDecomposition -{ - public: - - /** \brief Synonym for the template parameter \p _MatrixType. */ - typedef _MatrixType MatrixType; - - enum { - Size = MatrixType::RowsAtCompileTime, - SizeMinusOne = Size == Dynamic ? Dynamic : Size - 1, - Options = MatrixType::Options, - MaxSize = MatrixType::MaxRowsAtCompileTime, - MaxSizeMinusOne = MaxSize == Dynamic ? Dynamic : MaxSize - 1 - }; - - /** \brief Scalar type for matrices of type #MatrixType. */ - typedef typename MatrixType::Scalar Scalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - /** \brief Type for vector of Householder coefficients. - * - * This is column vector with entries of type #Scalar. The length of the - * vector is one less than the size of #MatrixType, if it is a fixed-side - * type. - */ - typedef Matrix CoeffVectorType; - - /** \brief Return type of matrixQ() */ - typedef HouseholderSequence::type> HouseholderSequenceType; - - typedef internal::HessenbergDecompositionMatrixHReturnType MatrixHReturnType; - - /** \brief Default constructor; the decomposition will be computed later. - * - * \param [in] size The size of the matrix whose Hessenberg decomposition will be computed. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). The \p size parameter is only - * used as a hint. It is not an error to give a wrong \p size, but it may - * impair performance. - * - * \sa compute() for an example. - */ - explicit HessenbergDecomposition(Index size = Size==Dynamic ? 2 : Size) - : m_matrix(size,size), - m_temp(size), - m_isInitialized(false) - { - if(size>1) - m_hCoeffs.resize(size-1); - } - - /** \brief Constructor; computes Hessenberg decomposition of given matrix. - * - * \param[in] matrix Square matrix whose Hessenberg decomposition is to be computed. - * - * This constructor calls compute() to compute the Hessenberg - * decomposition. - * - * \sa matrixH() for an example. - */ - template - explicit HessenbergDecomposition(const EigenBase& matrix) - : m_matrix(matrix.derived()), - m_temp(matrix.rows()), - m_isInitialized(false) - { - if(matrix.rows()<2) - { - m_isInitialized = true; - return; - } - m_hCoeffs.resize(matrix.rows()-1,1); - _compute(m_matrix, m_hCoeffs, m_temp); - m_isInitialized = true; - } - - /** \brief Computes Hessenberg decomposition of given matrix. - * - * \param[in] matrix Square matrix whose Hessenberg decomposition is to be computed. - * \returns Reference to \c *this - * - * The Hessenberg decomposition is computed by bringing the columns of the - * matrix successively in the required form using Householder reflections - * (see, e.g., Algorithm 7.4.2 in Golub \& Van Loan, %Matrix - * Computations). The cost is \f$ 10n^3/3 \f$ flops, where \f$ n \f$ - * denotes the size of the given matrix. - * - * This method reuses of the allocated data in the HessenbergDecomposition - * object. - * - * Example: \include HessenbergDecomposition_compute.cpp - * Output: \verbinclude HessenbergDecomposition_compute.out - */ - template - HessenbergDecomposition& compute(const EigenBase& matrix) - { - m_matrix = matrix.derived(); - if(matrix.rows()<2) - { - m_isInitialized = true; - return *this; - } - m_hCoeffs.resize(matrix.rows()-1,1); - _compute(m_matrix, m_hCoeffs, m_temp); - m_isInitialized = true; - return *this; - } - - /** \brief Returns the Householder coefficients. - * - * \returns a const reference to the vector of Householder coefficients - * - * \pre Either the constructor HessenbergDecomposition(const MatrixType&) - * or the member function compute(const MatrixType&) has been called - * before to compute the Hessenberg decomposition of a matrix. - * - * The Householder coefficients allow the reconstruction of the matrix - * \f$ Q \f$ in the Hessenberg decomposition from the packed data. - * - * \sa packedMatrix(), \ref Householder_Module "Householder module" - */ - const CoeffVectorType& householderCoefficients() const - { - eigen_assert(m_isInitialized && "HessenbergDecomposition is not initialized."); - return m_hCoeffs; - } - - /** \brief Returns the internal representation of the decomposition - * - * \returns a const reference to a matrix with the internal representation - * of the decomposition. - * - * \pre Either the constructor HessenbergDecomposition(const MatrixType&) - * or the member function compute(const MatrixType&) has been called - * before to compute the Hessenberg decomposition of a matrix. - * - * The returned matrix contains the following information: - * - the upper part and lower sub-diagonal represent the Hessenberg matrix H - * - the rest of the lower part contains the Householder vectors that, combined with - * Householder coefficients returned by householderCoefficients(), - * allows to reconstruct the matrix Q as - * \f$ Q = H_{N-1} \ldots H_1 H_0 \f$. - * Here, the matrices \f$ H_i \f$ are the Householder transformations - * \f$ H_i = (I - h_i v_i v_i^T) \f$ - * where \f$ h_i \f$ is the \f$ i \f$th Householder coefficient and - * \f$ v_i \f$ is the Householder vector defined by - * \f$ v_i = [ 0, \ldots, 0, 1, M(i+2,i), \ldots, M(N-1,i) ]^T \f$ - * with M the matrix returned by this function. - * - * See LAPACK for further details on this packed storage. - * - * Example: \include HessenbergDecomposition_packedMatrix.cpp - * Output: \verbinclude HessenbergDecomposition_packedMatrix.out - * - * \sa householderCoefficients() - */ - const MatrixType& packedMatrix() const - { - eigen_assert(m_isInitialized && "HessenbergDecomposition is not initialized."); - return m_matrix; - } - - /** \brief Reconstructs the orthogonal matrix Q in the decomposition - * - * \returns object representing the matrix Q - * - * \pre Either the constructor HessenbergDecomposition(const MatrixType&) - * or the member function compute(const MatrixType&) has been called - * before to compute the Hessenberg decomposition of a matrix. - * - * This function returns a light-weight object of template class - * HouseholderSequence. You can either apply it directly to a matrix or - * you can convert it to a matrix of type #MatrixType. - * - * \sa matrixH() for an example, class HouseholderSequence - */ - HouseholderSequenceType matrixQ() const - { - eigen_assert(m_isInitialized && "HessenbergDecomposition is not initialized."); - return HouseholderSequenceType(m_matrix, m_hCoeffs.conjugate()) - .setLength(m_matrix.rows() - 1) - .setShift(1); - } - - /** \brief Constructs the Hessenberg matrix H in the decomposition - * - * \returns expression object representing the matrix H - * - * \pre Either the constructor HessenbergDecomposition(const MatrixType&) - * or the member function compute(const MatrixType&) has been called - * before to compute the Hessenberg decomposition of a matrix. - * - * The object returned by this function constructs the Hessenberg matrix H - * when it is assigned to a matrix or otherwise evaluated. The matrix H is - * constructed from the packed matrix as returned by packedMatrix(): The - * upper part (including the subdiagonal) of the packed matrix contains - * the matrix H. It may sometimes be better to directly use the packed - * matrix instead of constructing the matrix H. - * - * Example: \include HessenbergDecomposition_matrixH.cpp - * Output: \verbinclude HessenbergDecomposition_matrixH.out - * - * \sa matrixQ(), packedMatrix() - */ - MatrixHReturnType matrixH() const - { - eigen_assert(m_isInitialized && "HessenbergDecomposition is not initialized."); - return MatrixHReturnType(*this); - } - - private: - - typedef Matrix VectorType; - typedef typename NumTraits::Real RealScalar; - static void _compute(MatrixType& matA, CoeffVectorType& hCoeffs, VectorType& temp); - - protected: - MatrixType m_matrix; - CoeffVectorType m_hCoeffs; - VectorType m_temp; - bool m_isInitialized; -}; - -/** \internal - * Performs a tridiagonal decomposition of \a matA in place. - * - * \param matA the input selfadjoint matrix - * \param hCoeffs returned Householder coefficients - * - * The result is written in the lower triangular part of \a matA. - * - * Implemented from Golub's "%Matrix Computations", algorithm 8.3.1. - * - * \sa packedMatrix() - */ -template -void HessenbergDecomposition::_compute(MatrixType& matA, CoeffVectorType& hCoeffs, VectorType& temp) -{ - eigen_assert(matA.rows()==matA.cols()); - Index n = matA.rows(); - temp.resize(n); - for (Index i = 0; i struct HessenbergDecompositionMatrixHReturnType -: public ReturnByValue > -{ - public: - /** \brief Constructor. - * - * \param[in] hess Hessenberg decomposition - */ - HessenbergDecompositionMatrixHReturnType(const HessenbergDecomposition& hess) : m_hess(hess) { } - - /** \brief Hessenberg matrix in decomposition. - * - * \param[out] result Hessenberg matrix in decomposition \p hess which - * was passed to the constructor - */ - template - inline void evalTo(ResultType& result) const - { - result = m_hess.packedMatrix(); - Index n = result.rows(); - if (n>2) - result.bottomLeftCorner(n-2, n-2).template triangularView().setZero(); - } - - Index rows() const { return m_hess.packedMatrix().rows(); } - Index cols() const { return m_hess.packedMatrix().cols(); } - - protected: - const HessenbergDecomposition& m_hess; -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_HESSENBERGDECOMPOSITION_H diff --git a/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h b/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h deleted file mode 100644 index dbbd4806a..000000000 --- a/Eigen/src/Eigenvalues/MatrixBaseEigenvalues.h +++ /dev/null @@ -1,160 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2010 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MATRIXBASEEIGENVALUES_H -#define EIGEN_MATRIXBASEEIGENVALUES_H - -namespace Eigen { - -namespace internal { - -template -struct eigenvalues_selector -{ - // this is the implementation for the case IsComplex = true - static inline typename MatrixBase::EigenvaluesReturnType const - run(const MatrixBase& m) - { - typedef typename Derived::PlainObject PlainObject; - PlainObject m_eval(m); - return ComplexEigenSolver(m_eval, false).eigenvalues(); - } -}; - -template -struct eigenvalues_selector -{ - static inline typename MatrixBase::EigenvaluesReturnType const - run(const MatrixBase& m) - { - typedef typename Derived::PlainObject PlainObject; - PlainObject m_eval(m); - return EigenSolver(m_eval, false).eigenvalues(); - } -}; - -} // end namespace internal - -/** \brief Computes the eigenvalues of a matrix - * \returns Column vector containing the eigenvalues. - * - * \eigenvalues_module - * This function computes the eigenvalues with the help of the EigenSolver - * class (for real matrices) or the ComplexEigenSolver class (for complex - * matrices). - * - * The eigenvalues are repeated according to their algebraic multiplicity, - * so there are as many eigenvalues as rows in the matrix. - * - * The SelfAdjointView class provides a better algorithm for selfadjoint - * matrices. - * - * Example: \include MatrixBase_eigenvalues.cpp - * Output: \verbinclude MatrixBase_eigenvalues.out - * - * \sa EigenSolver::eigenvalues(), ComplexEigenSolver::eigenvalues(), - * SelfAdjointView::eigenvalues() - */ -template -inline typename MatrixBase::EigenvaluesReturnType -MatrixBase::eigenvalues() const -{ - typedef typename internal::traits::Scalar Scalar; - return internal::eigenvalues_selector::IsComplex>::run(derived()); -} - -/** \brief Computes the eigenvalues of a matrix - * \returns Column vector containing the eigenvalues. - * - * \eigenvalues_module - * This function computes the eigenvalues with the help of the - * SelfAdjointEigenSolver class. The eigenvalues are repeated according to - * their algebraic multiplicity, so there are as many eigenvalues as rows in - * the matrix. - * - * Example: \include SelfAdjointView_eigenvalues.cpp - * Output: \verbinclude SelfAdjointView_eigenvalues.out - * - * \sa SelfAdjointEigenSolver::eigenvalues(), MatrixBase::eigenvalues() - */ -template -EIGEN_DEVICE_FUNC inline typename SelfAdjointView::EigenvaluesReturnType -SelfAdjointView::eigenvalues() const -{ - typedef typename SelfAdjointView::PlainObject PlainObject; - PlainObject thisAsMatrix(*this); - return SelfAdjointEigenSolver(thisAsMatrix, false).eigenvalues(); -} - - - -/** \brief Computes the L2 operator norm - * \returns Operator norm of the matrix. - * - * \eigenvalues_module - * This function computes the L2 operator norm of a matrix, which is also - * known as the spectral norm. The norm of a matrix \f$ A \f$ is defined to be - * \f[ \|A\|_2 = \max_x \frac{\|Ax\|_2}{\|x\|_2} \f] - * where the maximum is over all vectors and the norm on the right is the - * Euclidean vector norm. The norm equals the largest singular value, which is - * the square root of the largest eigenvalue of the positive semi-definite - * matrix \f$ A^*A \f$. - * - * The current implementation uses the eigenvalues of \f$ A^*A \f$, as computed - * by SelfAdjointView::eigenvalues(), to compute the operator norm of a - * matrix. The SelfAdjointView class provides a better algorithm for - * selfadjoint matrices. - * - * Example: \include MatrixBase_operatorNorm.cpp - * Output: \verbinclude MatrixBase_operatorNorm.out - * - * \sa SelfAdjointView::eigenvalues(), SelfAdjointView::operatorNorm() - */ -template -inline typename MatrixBase::RealScalar -MatrixBase::operatorNorm() const -{ - using std::sqrt; - typename Derived::PlainObject m_eval(derived()); - // FIXME if it is really guaranteed that the eigenvalues are already sorted, - // then we don't need to compute a maxCoeff() here, comparing the 1st and last ones is enough. - return sqrt((m_eval*m_eval.adjoint()) - .eval() - .template selfadjointView() - .eigenvalues() - .maxCoeff() - ); -} - -/** \brief Computes the L2 operator norm - * \returns Operator norm of the matrix. - * - * \eigenvalues_module - * This function computes the L2 operator norm of a self-adjoint matrix. For a - * self-adjoint matrix, the operator norm is the largest eigenvalue. - * - * The current implementation uses the eigenvalues of the matrix, as computed - * by eigenvalues(), to compute the operator norm of the matrix. - * - * Example: \include SelfAdjointView_operatorNorm.cpp - * Output: \verbinclude SelfAdjointView_operatorNorm.out - * - * \sa eigenvalues(), MatrixBase::operatorNorm() - */ -template -EIGEN_DEVICE_FUNC inline typename SelfAdjointView::RealScalar -SelfAdjointView::operatorNorm() const -{ - return eigenvalues().cwiseAbs().maxCoeff(); -} - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/Eigenvalues/RealQZ.h b/Eigen/src/Eigenvalues/RealQZ.h deleted file mode 100644 index b3a910dd9..000000000 --- a/Eigen/src/Eigenvalues/RealQZ.h +++ /dev/null @@ -1,654 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Alexey Korepanov -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_REAL_QZ_H -#define EIGEN_REAL_QZ_H - -namespace Eigen { - - /** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class RealQZ - * - * \brief Performs a real QZ decomposition of a pair of square matrices - * - * \tparam _MatrixType the type of the matrix of which we are computing the - * real QZ decomposition; this is expected to be an instantiation of the - * Matrix class template. - * - * Given a real square matrices A and B, this class computes the real QZ - * decomposition: \f$ A = Q S Z \f$, \f$ B = Q T Z \f$ where Q and Z are - * real orthogonal matrixes, T is upper-triangular matrix, and S is upper - * quasi-triangular matrix. An orthogonal matrix is a matrix whose - * inverse is equal to its transpose, \f$ U^{-1} = U^T \f$. A quasi-triangular - * matrix is a block-triangular matrix whose diagonal consists of 1-by-1 - * blocks and 2-by-2 blocks where further reduction is impossible due to - * complex eigenvalues. - * - * The eigenvalues of the pencil \f$ A - z B \f$ can be obtained from - * 1x1 and 2x2 blocks on the diagonals of S and T. - * - * Call the function compute() to compute the real QZ decomposition of a - * given pair of matrices. Alternatively, you can use the - * RealQZ(const MatrixType& B, const MatrixType& B, bool computeQZ) - * constructor which computes the real QZ decomposition at construction - * time. Once the decomposition is computed, you can use the matrixS(), - * matrixT(), matrixQ() and matrixZ() functions to retrieve the matrices - * S, T, Q and Z in the decomposition. If computeQZ==false, some time - * is saved by not computing matrices Q and Z. - * - * Example: \include RealQZ_compute.cpp - * Output: \include RealQZ_compute.out - * - * \note The implementation is based on the algorithm in "Matrix Computations" - * by Gene H. Golub and Charles F. Van Loan, and a paper "An algorithm for - * generalized eigenvalue problems" by C.B.Moler and G.W.Stewart. - * - * \sa class RealSchur, class ComplexSchur, class EigenSolver, class ComplexEigenSolver - */ - - template class RealQZ - { - public: - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename MatrixType::Scalar Scalar; - typedef std::complex::Real> ComplexScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - typedef Matrix EigenvalueType; - typedef Matrix ColumnVectorType; - - /** \brief Default constructor. - * - * \param [in] size Positive integer, size of the matrix whose QZ decomposition will be computed. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). The \p size parameter is only - * used as a hint. It is not an error to give a wrong \p size, but it may - * impair performance. - * - * \sa compute() for an example. - */ - explicit RealQZ(Index size = RowsAtCompileTime==Dynamic ? 1 : RowsAtCompileTime) : - m_S(size, size), - m_T(size, size), - m_Q(size, size), - m_Z(size, size), - m_workspace(size*2), - m_maxIters(400), - m_isInitialized(false) - { } - - /** \brief Constructor; computes real QZ decomposition of given matrices - * - * \param[in] A Matrix A. - * \param[in] B Matrix B. - * \param[in] computeQZ If false, A and Z are not computed. - * - * This constructor calls compute() to compute the QZ decomposition. - */ - RealQZ(const MatrixType& A, const MatrixType& B, bool computeQZ = true) : - m_S(A.rows(),A.cols()), - m_T(A.rows(),A.cols()), - m_Q(A.rows(),A.cols()), - m_Z(A.rows(),A.cols()), - m_workspace(A.rows()*2), - m_maxIters(400), - m_isInitialized(false) { - compute(A, B, computeQZ); - } - - /** \brief Returns matrix Q in the QZ decomposition. - * - * \returns A const reference to the matrix Q. - */ - const MatrixType& matrixQ() const { - eigen_assert(m_isInitialized && "RealQZ is not initialized."); - eigen_assert(m_computeQZ && "The matrices Q and Z have not been computed during the QZ decomposition."); - return m_Q; - } - - /** \brief Returns matrix Z in the QZ decomposition. - * - * \returns A const reference to the matrix Z. - */ - const MatrixType& matrixZ() const { - eigen_assert(m_isInitialized && "RealQZ is not initialized."); - eigen_assert(m_computeQZ && "The matrices Q and Z have not been computed during the QZ decomposition."); - return m_Z; - } - - /** \brief Returns matrix S in the QZ decomposition. - * - * \returns A const reference to the matrix S. - */ - const MatrixType& matrixS() const { - eigen_assert(m_isInitialized && "RealQZ is not initialized."); - return m_S; - } - - /** \brief Returns matrix S in the QZ decomposition. - * - * \returns A const reference to the matrix S. - */ - const MatrixType& matrixT() const { - eigen_assert(m_isInitialized && "RealQZ is not initialized."); - return m_T; - } - - /** \brief Computes QZ decomposition of given matrix. - * - * \param[in] A Matrix A. - * \param[in] B Matrix B. - * \param[in] computeQZ If false, A and Z are not computed. - * \returns Reference to \c *this - */ - RealQZ& compute(const MatrixType& A, const MatrixType& B, bool computeQZ = true); - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, \c NoConvergence otherwise. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "RealQZ is not initialized."); - return m_info; - } - - /** \brief Returns number of performed QR-like iterations. - */ - Index iterations() const - { - eigen_assert(m_isInitialized && "RealQZ is not initialized."); - return m_global_iter; - } - - /** Sets the maximal number of iterations allowed to converge to one eigenvalue - * or decouple the problem. - */ - RealQZ& setMaxIterations(Index maxIters) - { - m_maxIters = maxIters; - return *this; - } - - private: - - MatrixType m_S, m_T, m_Q, m_Z; - Matrix m_workspace; - ComputationInfo m_info; - Index m_maxIters; - bool m_isInitialized; - bool m_computeQZ; - Scalar m_normOfT, m_normOfS; - Index m_global_iter; - - typedef Matrix Vector3s; - typedef Matrix Vector2s; - typedef Matrix Matrix2s; - typedef JacobiRotation JRs; - - void hessenbergTriangular(); - void computeNorms(); - Index findSmallSubdiagEntry(Index iu); - Index findSmallDiagEntry(Index f, Index l); - void splitOffTwoRows(Index i); - void pushDownZero(Index z, Index f, Index l); - void step(Index f, Index l, Index iter); - - }; // RealQZ - - /** \internal Reduces S and T to upper Hessenberg - triangular form */ - template - void RealQZ::hessenbergTriangular() - { - - const Index dim = m_S.cols(); - - // perform QR decomposition of T, overwrite T with R, save Q - HouseholderQR qrT(m_T); - m_T = qrT.matrixQR(); - m_T.template triangularView().setZero(); - m_Q = qrT.householderQ(); - // overwrite S with Q* S - m_S.applyOnTheLeft(m_Q.adjoint()); - // init Z as Identity - if (m_computeQZ) - m_Z = MatrixType::Identity(dim,dim); - // reduce S to upper Hessenberg with Givens rotations - for (Index j=0; j<=dim-3; j++) { - for (Index i=dim-1; i>=j+2; i--) { - JRs G; - // kill S(i,j) - if(m_S.coeff(i,j) != 0) - { - G.makeGivens(m_S.coeff(i-1,j), m_S.coeff(i,j), &m_S.coeffRef(i-1, j)); - m_S.coeffRef(i,j) = Scalar(0.0); - m_S.rightCols(dim-j-1).applyOnTheLeft(i-1,i,G.adjoint()); - m_T.rightCols(dim-i+1).applyOnTheLeft(i-1,i,G.adjoint()); - // update Q - if (m_computeQZ) - m_Q.applyOnTheRight(i-1,i,G); - } - // kill T(i,i-1) - if(m_T.coeff(i,i-1)!=Scalar(0)) - { - G.makeGivens(m_T.coeff(i,i), m_T.coeff(i,i-1), &m_T.coeffRef(i,i)); - m_T.coeffRef(i,i-1) = Scalar(0.0); - m_S.applyOnTheRight(i,i-1,G); - m_T.topRows(i).applyOnTheRight(i,i-1,G); - // update Z - if (m_computeQZ) - m_Z.applyOnTheLeft(i,i-1,G.adjoint()); - } - } - } - } - - /** \internal Computes vector L1 norms of S and T when in Hessenberg-Triangular form already */ - template - inline void RealQZ::computeNorms() - { - const Index size = m_S.cols(); - m_normOfS = Scalar(0.0); - m_normOfT = Scalar(0.0); - for (Index j = 0; j < size; ++j) - { - m_normOfS += m_S.col(j).segment(0, (std::min)(size,j+2)).cwiseAbs().sum(); - m_normOfT += m_T.row(j).segment(j, size - j).cwiseAbs().sum(); - } - } - - - /** \internal Look for single small sub-diagonal element S(res, res-1) and return res (or 0) */ - template - inline Index RealQZ::findSmallSubdiagEntry(Index iu) - { - using std::abs; - Index res = iu; - while (res > 0) - { - Scalar s = abs(m_S.coeff(res-1,res-1)) + abs(m_S.coeff(res,res)); - if (s == Scalar(0.0)) - s = m_normOfS; - if (abs(m_S.coeff(res,res-1)) < NumTraits::epsilon() * s) - break; - res--; - } - return res; - } - - /** \internal Look for single small diagonal element T(res, res) for res between f and l, and return res (or f-1) */ - template - inline Index RealQZ::findSmallDiagEntry(Index f, Index l) - { - using std::abs; - Index res = l; - while (res >= f) { - if (abs(m_T.coeff(res,res)) <= NumTraits::epsilon() * m_normOfT) - break; - res--; - } - return res; - } - - /** \internal decouple 2x2 diagonal block in rows i, i+1 if eigenvalues are real */ - template - inline void RealQZ::splitOffTwoRows(Index i) - { - using std::abs; - using std::sqrt; - const Index dim=m_S.cols(); - if (abs(m_S.coeff(i+1,i))==Scalar(0)) - return; - Index j = findSmallDiagEntry(i,i+1); - if (j==i-1) - { - // block of (S T^{-1}) - Matrix2s STi = m_T.template block<2,2>(i,i).template triangularView(). - template solve(m_S.template block<2,2>(i,i)); - Scalar p = Scalar(0.5)*(STi(0,0)-STi(1,1)); - Scalar q = p*p + STi(1,0)*STi(0,1); - if (q>=0) { - Scalar z = sqrt(q); - // one QR-like iteration for ABi - lambda I - // is enough - when we know exact eigenvalue in advance, - // convergence is immediate - JRs G; - if (p>=0) - G.makeGivens(p + z, STi(1,0)); - else - G.makeGivens(p - z, STi(1,0)); - m_S.rightCols(dim-i).applyOnTheLeft(i,i+1,G.adjoint()); - m_T.rightCols(dim-i).applyOnTheLeft(i,i+1,G.adjoint()); - // update Q - if (m_computeQZ) - m_Q.applyOnTheRight(i,i+1,G); - - G.makeGivens(m_T.coeff(i+1,i+1), m_T.coeff(i+1,i)); - m_S.topRows(i+2).applyOnTheRight(i+1,i,G); - m_T.topRows(i+2).applyOnTheRight(i+1,i,G); - // update Z - if (m_computeQZ) - m_Z.applyOnTheLeft(i+1,i,G.adjoint()); - - m_S.coeffRef(i+1,i) = Scalar(0.0); - m_T.coeffRef(i+1,i) = Scalar(0.0); - } - } - else - { - pushDownZero(j,i,i+1); - } - } - - /** \internal use zero in T(z,z) to zero S(l,l-1), working in block f..l */ - template - inline void RealQZ::pushDownZero(Index z, Index f, Index l) - { - JRs G; - const Index dim = m_S.cols(); - for (Index zz=z; zzf ? (zz-1) : zz; - G.makeGivens(m_T.coeff(zz, zz+1), m_T.coeff(zz+1, zz+1)); - m_S.rightCols(dim-firstColS).applyOnTheLeft(zz,zz+1,G.adjoint()); - m_T.rightCols(dim-zz).applyOnTheLeft(zz,zz+1,G.adjoint()); - m_T.coeffRef(zz+1,zz+1) = Scalar(0.0); - // update Q - if (m_computeQZ) - m_Q.applyOnTheRight(zz,zz+1,G); - // kill S(zz+1, zz-1) - if (zz>f) - { - G.makeGivens(m_S.coeff(zz+1, zz), m_S.coeff(zz+1,zz-1)); - m_S.topRows(zz+2).applyOnTheRight(zz, zz-1,G); - m_T.topRows(zz+1).applyOnTheRight(zz, zz-1,G); - m_S.coeffRef(zz+1,zz-1) = Scalar(0.0); - // update Z - if (m_computeQZ) - m_Z.applyOnTheLeft(zz,zz-1,G.adjoint()); - } - } - // finally kill S(l,l-1) - G.makeGivens(m_S.coeff(l,l), m_S.coeff(l,l-1)); - m_S.applyOnTheRight(l,l-1,G); - m_T.applyOnTheRight(l,l-1,G); - m_S.coeffRef(l,l-1)=Scalar(0.0); - // update Z - if (m_computeQZ) - m_Z.applyOnTheLeft(l,l-1,G.adjoint()); - } - - /** \internal QR-like iterative step for block f..l */ - template - inline void RealQZ::step(Index f, Index l, Index iter) - { - using std::abs; - const Index dim = m_S.cols(); - - // x, y, z - Scalar x, y, z; - if (iter==10) - { - // Wilkinson ad hoc shift - const Scalar - a11=m_S.coeff(f+0,f+0), a12=m_S.coeff(f+0,f+1), - a21=m_S.coeff(f+1,f+0), a22=m_S.coeff(f+1,f+1), a32=m_S.coeff(f+2,f+1), - b12=m_T.coeff(f+0,f+1), - b11i=Scalar(1.0)/m_T.coeff(f+0,f+0), - b22i=Scalar(1.0)/m_T.coeff(f+1,f+1), - a87=m_S.coeff(l-1,l-2), - a98=m_S.coeff(l-0,l-1), - b77i=Scalar(1.0)/m_T.coeff(l-2,l-2), - b88i=Scalar(1.0)/m_T.coeff(l-1,l-1); - Scalar ss = abs(a87*b77i) + abs(a98*b88i), - lpl = Scalar(1.5)*ss, - ll = ss*ss; - x = ll + a11*a11*b11i*b11i - lpl*a11*b11i + a12*a21*b11i*b22i - - a11*a21*b12*b11i*b11i*b22i; - y = a11*a21*b11i*b11i - lpl*a21*b11i + a21*a22*b11i*b22i - - a21*a21*b12*b11i*b11i*b22i; - z = a21*a32*b11i*b22i; - } - else if (iter==16) - { - // another exceptional shift - x = m_S.coeff(f,f)/m_T.coeff(f,f)-m_S.coeff(l,l)/m_T.coeff(l,l) + m_S.coeff(l,l-1)*m_T.coeff(l-1,l) / - (m_T.coeff(l-1,l-1)*m_T.coeff(l,l)); - y = m_S.coeff(f+1,f)/m_T.coeff(f,f); - z = 0; - } - else if (iter>23 && !(iter%8)) - { - // extremely exceptional shift - x = internal::random(-1.0,1.0); - y = internal::random(-1.0,1.0); - z = internal::random(-1.0,1.0); - } - else - { - // Compute the shifts: (x,y,z,0...) = (AB^-1 - l1 I) (AB^-1 - l2 I) e1 - // where l1 and l2 are the eigenvalues of the 2x2 matrix C = U V^-1 where - // U and V are 2x2 bottom right sub matrices of A and B. Thus: - // = AB^-1AB^-1 + l1 l2 I - (l1+l2)(AB^-1) - // = AB^-1AB^-1 + det(M) - tr(M)(AB^-1) - // Since we are only interested in having x, y, z with a correct ratio, we have: - const Scalar - a11 = m_S.coeff(f,f), a12 = m_S.coeff(f,f+1), - a21 = m_S.coeff(f+1,f), a22 = m_S.coeff(f+1,f+1), - a32 = m_S.coeff(f+2,f+1), - - a88 = m_S.coeff(l-1,l-1), a89 = m_S.coeff(l-1,l), - a98 = m_S.coeff(l,l-1), a99 = m_S.coeff(l,l), - - b11 = m_T.coeff(f,f), b12 = m_T.coeff(f,f+1), - b22 = m_T.coeff(f+1,f+1), - - b88 = m_T.coeff(l-1,l-1), b89 = m_T.coeff(l-1,l), - b99 = m_T.coeff(l,l); - - x = ( (a88/b88 - a11/b11)*(a99/b99 - a11/b11) - (a89/b99)*(a98/b88) + (a98/b88)*(b89/b99)*(a11/b11) ) * (b11/a21) - + a12/b22 - (a11/b11)*(b12/b22); - y = (a22/b22-a11/b11) - (a21/b11)*(b12/b22) - (a88/b88-a11/b11) - (a99/b99-a11/b11) + (a98/b88)*(b89/b99); - z = a32/b22; - } - - JRs G; - - for (Index k=f; k<=l-2; k++) - { - // variables for Householder reflections - Vector2s essential2; - Scalar tau, beta; - - Vector3s hr(x,y,z); - - // Q_k to annihilate S(k+1,k-1) and S(k+2,k-1) - hr.makeHouseholderInPlace(tau, beta); - essential2 = hr.template bottomRows<2>(); - Index fc=(std::max)(k-1,Index(0)); // first col to update - m_S.template middleRows<3>(k).rightCols(dim-fc).applyHouseholderOnTheLeft(essential2, tau, m_workspace.data()); - m_T.template middleRows<3>(k).rightCols(dim-fc).applyHouseholderOnTheLeft(essential2, tau, m_workspace.data()); - if (m_computeQZ) - m_Q.template middleCols<3>(k).applyHouseholderOnTheRight(essential2, tau, m_workspace.data()); - if (k>f) - m_S.coeffRef(k+2,k-1) = m_S.coeffRef(k+1,k-1) = Scalar(0.0); - - // Z_{k1} to annihilate T(k+2,k+1) and T(k+2,k) - hr << m_T.coeff(k+2,k+2),m_T.coeff(k+2,k),m_T.coeff(k+2,k+1); - hr.makeHouseholderInPlace(tau, beta); - essential2 = hr.template bottomRows<2>(); - { - Index lr = (std::min)(k+4,dim); // last row to update - Map > tmp(m_workspace.data(),lr); - // S - tmp = m_S.template middleCols<2>(k).topRows(lr) * essential2; - tmp += m_S.col(k+2).head(lr); - m_S.col(k+2).head(lr) -= tau*tmp; - m_S.template middleCols<2>(k).topRows(lr) -= (tau*tmp) * essential2.adjoint(); - // T - tmp = m_T.template middleCols<2>(k).topRows(lr) * essential2; - tmp += m_T.col(k+2).head(lr); - m_T.col(k+2).head(lr) -= tau*tmp; - m_T.template middleCols<2>(k).topRows(lr) -= (tau*tmp) * essential2.adjoint(); - } - if (m_computeQZ) - { - // Z - Map > tmp(m_workspace.data(),dim); - tmp = essential2.adjoint()*(m_Z.template middleRows<2>(k)); - tmp += m_Z.row(k+2); - m_Z.row(k+2) -= tau*tmp; - m_Z.template middleRows<2>(k) -= essential2 * (tau*tmp); - } - m_T.coeffRef(k+2,k) = m_T.coeffRef(k+2,k+1) = Scalar(0.0); - - // Z_{k2} to annihilate T(k+1,k) - G.makeGivens(m_T.coeff(k+1,k+1), m_T.coeff(k+1,k)); - m_S.applyOnTheRight(k+1,k,G); - m_T.applyOnTheRight(k+1,k,G); - // update Z - if (m_computeQZ) - m_Z.applyOnTheLeft(k+1,k,G.adjoint()); - m_T.coeffRef(k+1,k) = Scalar(0.0); - - // update x,y,z - x = m_S.coeff(k+1,k); - y = m_S.coeff(k+2,k); - if (k < l-2) - z = m_S.coeff(k+3,k); - } // loop over k - - // Q_{n-1} to annihilate y = S(l,l-2) - G.makeGivens(x,y); - m_S.applyOnTheLeft(l-1,l,G.adjoint()); - m_T.applyOnTheLeft(l-1,l,G.adjoint()); - if (m_computeQZ) - m_Q.applyOnTheRight(l-1,l,G); - m_S.coeffRef(l,l-2) = Scalar(0.0); - - // Z_{n-1} to annihilate T(l,l-1) - G.makeGivens(m_T.coeff(l,l),m_T.coeff(l,l-1)); - m_S.applyOnTheRight(l,l-1,G); - m_T.applyOnTheRight(l,l-1,G); - if (m_computeQZ) - m_Z.applyOnTheLeft(l,l-1,G.adjoint()); - m_T.coeffRef(l,l-1) = Scalar(0.0); - } - - template - RealQZ& RealQZ::compute(const MatrixType& A_in, const MatrixType& B_in, bool computeQZ) - { - - const Index dim = A_in.cols(); - - eigen_assert (A_in.rows()==dim && A_in.cols()==dim - && B_in.rows()==dim && B_in.cols()==dim - && "Need square matrices of the same dimension"); - - m_isInitialized = true; - m_computeQZ = computeQZ; - m_S = A_in; m_T = B_in; - m_workspace.resize(dim*2); - m_global_iter = 0; - - // entrance point: hessenberg triangular decomposition - hessenbergTriangular(); - // compute L1 vector norms of T, S into m_normOfS, m_normOfT - computeNorms(); - - Index l = dim-1, - f, - local_iter = 0; - - while (l>0 && local_iter0) m_S.coeffRef(f,f-1) = Scalar(0.0); - if (f == l) // One root found - { - l--; - local_iter = 0; - } - else if (f == l-1) // Two roots found - { - splitOffTwoRows(f); - l -= 2; - local_iter = 0; - } - else // No convergence yet - { - // if there's zero on diagonal of T, we can isolate an eigenvalue with Givens rotations - Index z = findSmallDiagEntry(f,l); - if (z>=f) - { - // zero found - pushDownZero(z,f,l); - } - else - { - // We are sure now that S.block(f,f, l-f+1,l-f+1) is underuced upper-Hessenberg - // and T.block(f,f, l-f+1,l-f+1) is invertible uper-triangular, which allows to - // apply a QR-like iteration to rows and columns f..l. - step(f,l, local_iter); - local_iter++; - m_global_iter++; - } - } - } - // check if we converged before reaching iterations limit - m_info = (local_iter j_left, j_right; - internal::real_2x2_jacobi_svd(m_T, i, i+1, &j_left, &j_right); - - // Apply resulting Jacobi rotations - m_S.applyOnTheLeft(i,i+1,j_left); - m_S.applyOnTheRight(i,i+1,j_right); - m_T.applyOnTheLeft(i,i+1,j_left); - m_T.applyOnTheRight(i,i+1,j_right); - m_T(i+1,i) = m_T(i,i+1) = Scalar(0); - - if(m_computeQZ) { - m_Q.applyOnTheRight(i,i+1,j_left.transpose()); - m_Z.applyOnTheLeft(i,i+1,j_right.transpose()); - } - - i++; - } - } - } - - return *this; - } // end compute - -} // end namespace Eigen - -#endif //EIGEN_REAL_QZ diff --git a/Eigen/src/Eigenvalues/RealSchur.h b/Eigen/src/Eigenvalues/RealSchur.h deleted file mode 100644 index f5c86041d..000000000 --- a/Eigen/src/Eigenvalues/RealSchur.h +++ /dev/null @@ -1,546 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2010,2012 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_REAL_SCHUR_H -#define EIGEN_REAL_SCHUR_H - -#include "./HessenbergDecomposition.h" - -namespace Eigen { - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class RealSchur - * - * \brief Performs a real Schur decomposition of a square matrix - * - * \tparam _MatrixType the type of the matrix of which we are computing the - * real Schur decomposition; this is expected to be an instantiation of the - * Matrix class template. - * - * Given a real square matrix A, this class computes the real Schur - * decomposition: \f$ A = U T U^T \f$ where U is a real orthogonal matrix and - * T is a real quasi-triangular matrix. An orthogonal matrix is a matrix whose - * inverse is equal to its transpose, \f$ U^{-1} = U^T \f$. A quasi-triangular - * matrix is a block-triangular matrix whose diagonal consists of 1-by-1 - * blocks and 2-by-2 blocks with complex eigenvalues. The eigenvalues of the - * blocks on the diagonal of T are the same as the eigenvalues of the matrix - * A, and thus the real Schur decomposition is used in EigenSolver to compute - * the eigendecomposition of a matrix. - * - * Call the function compute() to compute the real Schur decomposition of a - * given matrix. Alternatively, you can use the RealSchur(const MatrixType&, bool) - * constructor which computes the real Schur decomposition at construction - * time. Once the decomposition is computed, you can use the matrixU() and - * matrixT() functions to retrieve the matrices U and T in the decomposition. - * - * The documentation of RealSchur(const MatrixType&, bool) contains an example - * of the typical use of this class. - * - * \note The implementation is adapted from - * JAMA (public domain). - * Their code is based on EISPACK. - * - * \sa class ComplexSchur, class EigenSolver, class ComplexEigenSolver - */ -template class RealSchur -{ - public: - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename MatrixType::Scalar Scalar; - typedef std::complex::Real> ComplexScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - typedef Matrix EigenvalueType; - typedef Matrix ColumnVectorType; - - /** \brief Default constructor. - * - * \param [in] size Positive integer, size of the matrix whose Schur decomposition will be computed. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). The \p size parameter is only - * used as a hint. It is not an error to give a wrong \p size, but it may - * impair performance. - * - * \sa compute() for an example. - */ - explicit RealSchur(Index size = RowsAtCompileTime==Dynamic ? 1 : RowsAtCompileTime) - : m_matT(size, size), - m_matU(size, size), - m_workspaceVector(size), - m_hess(size), - m_isInitialized(false), - m_matUisUptodate(false), - m_maxIters(-1) - { } - - /** \brief Constructor; computes real Schur decomposition of given matrix. - * - * \param[in] matrix Square matrix whose Schur decomposition is to be computed. - * \param[in] computeU If true, both T and U are computed; if false, only T is computed. - * - * This constructor calls compute() to compute the Schur decomposition. - * - * Example: \include RealSchur_RealSchur_MatrixType.cpp - * Output: \verbinclude RealSchur_RealSchur_MatrixType.out - */ - template - explicit RealSchur(const EigenBase& matrix, bool computeU = true) - : m_matT(matrix.rows(),matrix.cols()), - m_matU(matrix.rows(),matrix.cols()), - m_workspaceVector(matrix.rows()), - m_hess(matrix.rows()), - m_isInitialized(false), - m_matUisUptodate(false), - m_maxIters(-1) - { - compute(matrix.derived(), computeU); - } - - /** \brief Returns the orthogonal matrix in the Schur decomposition. - * - * \returns A const reference to the matrix U. - * - * \pre Either the constructor RealSchur(const MatrixType&, bool) or the - * member function compute(const MatrixType&, bool) has been called before - * to compute the Schur decomposition of a matrix, and \p computeU was set - * to true (the default value). - * - * \sa RealSchur(const MatrixType&, bool) for an example - */ - const MatrixType& matrixU() const - { - eigen_assert(m_isInitialized && "RealSchur is not initialized."); - eigen_assert(m_matUisUptodate && "The matrix U has not been computed during the RealSchur decomposition."); - return m_matU; - } - - /** \brief Returns the quasi-triangular matrix in the Schur decomposition. - * - * \returns A const reference to the matrix T. - * - * \pre Either the constructor RealSchur(const MatrixType&, bool) or the - * member function compute(const MatrixType&, bool) has been called before - * to compute the Schur decomposition of a matrix. - * - * \sa RealSchur(const MatrixType&, bool) for an example - */ - const MatrixType& matrixT() const - { - eigen_assert(m_isInitialized && "RealSchur is not initialized."); - return m_matT; - } - - /** \brief Computes Schur decomposition of given matrix. - * - * \param[in] matrix Square matrix whose Schur decomposition is to be computed. - * \param[in] computeU If true, both T and U are computed; if false, only T is computed. - * \returns Reference to \c *this - * - * The Schur decomposition is computed by first reducing the matrix to - * Hessenberg form using the class HessenbergDecomposition. The Hessenberg - * matrix is then reduced to triangular form by performing Francis QR - * iterations with implicit double shift. The cost of computing the Schur - * decomposition depends on the number of iterations; as a rough guide, it - * may be taken to be \f$25n^3\f$ flops if \a computeU is true and - * \f$10n^3\f$ flops if \a computeU is false. - * - * Example: \include RealSchur_compute.cpp - * Output: \verbinclude RealSchur_compute.out - * - * \sa compute(const MatrixType&, bool, Index) - */ - template - RealSchur& compute(const EigenBase& matrix, bool computeU = true); - - /** \brief Computes Schur decomposition of a Hessenberg matrix H = Z T Z^T - * \param[in] matrixH Matrix in Hessenberg form H - * \param[in] matrixQ orthogonal matrix Q that transform a matrix A to H : A = Q H Q^T - * \param computeU Computes the matriX U of the Schur vectors - * \return Reference to \c *this - * - * This routine assumes that the matrix is already reduced in Hessenberg form matrixH - * using either the class HessenbergDecomposition or another mean. - * It computes the upper quasi-triangular matrix T of the Schur decomposition of H - * When computeU is true, this routine computes the matrix U such that - * A = U T U^T = (QZ) T (QZ)^T = Q H Q^T where A is the initial matrix - * - * NOTE Q is referenced if computeU is true; so, if the initial orthogonal matrix - * is not available, the user should give an identity matrix (Q.setIdentity()) - * - * \sa compute(const MatrixType&, bool) - */ - template - RealSchur& computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU); - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, \c NoConvergence otherwise. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "RealSchur is not initialized."); - return m_info; - } - - /** \brief Sets the maximum number of iterations allowed. - * - * If not specified by the user, the maximum number of iterations is m_maxIterationsPerRow times the size - * of the matrix. - */ - RealSchur& setMaxIterations(Index maxIters) - { - m_maxIters = maxIters; - return *this; - } - - /** \brief Returns the maximum number of iterations. */ - Index getMaxIterations() - { - return m_maxIters; - } - - /** \brief Maximum number of iterations per row. - * - * If not otherwise specified, the maximum number of iterations is this number times the size of the - * matrix. It is currently set to 40. - */ - static const int m_maxIterationsPerRow = 40; - - private: - - MatrixType m_matT; - MatrixType m_matU; - ColumnVectorType m_workspaceVector; - HessenbergDecomposition m_hess; - ComputationInfo m_info; - bool m_isInitialized; - bool m_matUisUptodate; - Index m_maxIters; - - typedef Matrix Vector3s; - - Scalar computeNormOfT(); - Index findSmallSubdiagEntry(Index iu); - void splitOffTwoRows(Index iu, bool computeU, const Scalar& exshift); - void computeShift(Index iu, Index iter, Scalar& exshift, Vector3s& shiftInfo); - void initFrancisQRStep(Index il, Index iu, const Vector3s& shiftInfo, Index& im, Vector3s& firstHouseholderVector); - void performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace); -}; - - -template -template -RealSchur& RealSchur::compute(const EigenBase& matrix, bool computeU) -{ - const Scalar considerAsZero = (std::numeric_limits::min)(); - - eigen_assert(matrix.cols() == matrix.rows()); - Index maxIters = m_maxIters; - if (maxIters == -1) - maxIters = m_maxIterationsPerRow * matrix.rows(); - - Scalar scale = matrix.derived().cwiseAbs().maxCoeff(); - if(scale -template -RealSchur& RealSchur::computeFromHessenberg(const HessMatrixType& matrixH, const OrthMatrixType& matrixQ, bool computeU) -{ - using std::abs; - - m_matT = matrixH; - if(computeU) - m_matU = matrixQ; - - Index maxIters = m_maxIters; - if (maxIters == -1) - maxIters = m_maxIterationsPerRow * matrixH.rows(); - m_workspaceVector.resize(m_matT.cols()); - Scalar* workspace = &m_workspaceVector.coeffRef(0); - - // The matrix m_matT is divided in three parts. - // Rows 0,...,il-1 are decoupled from the rest because m_matT(il,il-1) is zero. - // Rows il,...,iu is the part we are working on (the active window). - // Rows iu+1,...,end are already brought in triangular form. - Index iu = m_matT.cols() - 1; - Index iter = 0; // iteration count for current eigenvalue - Index totalIter = 0; // iteration count for whole matrix - Scalar exshift(0); // sum of exceptional shifts - Scalar norm = computeNormOfT(); - - if(norm!=0) - { - while (iu >= 0) - { - Index il = findSmallSubdiagEntry(iu); - - // Check for convergence - if (il == iu) // One root found - { - m_matT.coeffRef(iu,iu) = m_matT.coeff(iu,iu) + exshift; - if (iu > 0) - m_matT.coeffRef(iu, iu-1) = Scalar(0); - iu--; - iter = 0; - } - else if (il == iu-1) // Two roots found - { - splitOffTwoRows(iu, computeU, exshift); - iu -= 2; - iter = 0; - } - else // No convergence yet - { - // The firstHouseholderVector vector has to be initialized to something to get rid of a silly GCC warning (-O1 -Wall -DNDEBUG ) - Vector3s firstHouseholderVector(0,0,0), shiftInfo; - computeShift(iu, iter, exshift, shiftInfo); - iter = iter + 1; - totalIter = totalIter + 1; - if (totalIter > maxIters) break; - Index im; - initFrancisQRStep(il, iu, shiftInfo, im, firstHouseholderVector); - performFrancisQRStep(il, im, iu, computeU, firstHouseholderVector, workspace); - } - } - } - if(totalIter <= maxIters) - m_info = Success; - else - m_info = NoConvergence; - - m_isInitialized = true; - m_matUisUptodate = computeU; - return *this; -} - -/** \internal Computes and returns vector L1 norm of T */ -template -inline typename MatrixType::Scalar RealSchur::computeNormOfT() -{ - const Index size = m_matT.cols(); - // FIXME to be efficient the following would requires a triangular reduxion code - // Scalar norm = m_matT.upper().cwiseAbs().sum() - // + m_matT.bottomLeftCorner(size-1,size-1).diagonal().cwiseAbs().sum(); - Scalar norm(0); - for (Index j = 0; j < size; ++j) - norm += m_matT.col(j).segment(0, (std::min)(size,j+2)).cwiseAbs().sum(); - return norm; -} - -/** \internal Look for single small sub-diagonal element and returns its index */ -template -inline Index RealSchur::findSmallSubdiagEntry(Index iu) -{ - using std::abs; - Index res = iu; - while (res > 0) - { - Scalar s = abs(m_matT.coeff(res-1,res-1)) + abs(m_matT.coeff(res,res)); - if (abs(m_matT.coeff(res,res-1)) <= NumTraits::epsilon() * s) - break; - res--; - } - return res; -} - -/** \internal Update T given that rows iu-1 and iu decouple from the rest. */ -template -inline void RealSchur::splitOffTwoRows(Index iu, bool computeU, const Scalar& exshift) -{ - using std::sqrt; - using std::abs; - const Index size = m_matT.cols(); - - // The eigenvalues of the 2x2 matrix [a b; c d] are - // trace +/- sqrt(discr/4) where discr = tr^2 - 4*det, tr = a + d, det = ad - bc - Scalar p = Scalar(0.5) * (m_matT.coeff(iu-1,iu-1) - m_matT.coeff(iu,iu)); - Scalar q = p * p + m_matT.coeff(iu,iu-1) * m_matT.coeff(iu-1,iu); // q = tr^2 / 4 - det = discr/4 - m_matT.coeffRef(iu,iu) += exshift; - m_matT.coeffRef(iu-1,iu-1) += exshift; - - if (q >= Scalar(0)) // Two real eigenvalues - { - Scalar z = sqrt(abs(q)); - JacobiRotation rot; - if (p >= Scalar(0)) - rot.makeGivens(p + z, m_matT.coeff(iu, iu-1)); - else - rot.makeGivens(p - z, m_matT.coeff(iu, iu-1)); - - m_matT.rightCols(size-iu+1).applyOnTheLeft(iu-1, iu, rot.adjoint()); - m_matT.topRows(iu+1).applyOnTheRight(iu-1, iu, rot); - m_matT.coeffRef(iu, iu-1) = Scalar(0); - if (computeU) - m_matU.applyOnTheRight(iu-1, iu, rot); - } - - if (iu > 1) - m_matT.coeffRef(iu-1, iu-2) = Scalar(0); -} - -/** \internal Form shift in shiftInfo, and update exshift if an exceptional shift is performed. */ -template -inline void RealSchur::computeShift(Index iu, Index iter, Scalar& exshift, Vector3s& shiftInfo) -{ - using std::sqrt; - using std::abs; - shiftInfo.coeffRef(0) = m_matT.coeff(iu,iu); - shiftInfo.coeffRef(1) = m_matT.coeff(iu-1,iu-1); - shiftInfo.coeffRef(2) = m_matT.coeff(iu,iu-1) * m_matT.coeff(iu-1,iu); - - // Wilkinson's original ad hoc shift - if (iter == 10) - { - exshift += shiftInfo.coeff(0); - for (Index i = 0; i <= iu; ++i) - m_matT.coeffRef(i,i) -= shiftInfo.coeff(0); - Scalar s = abs(m_matT.coeff(iu,iu-1)) + abs(m_matT.coeff(iu-1,iu-2)); - shiftInfo.coeffRef(0) = Scalar(0.75) * s; - shiftInfo.coeffRef(1) = Scalar(0.75) * s; - shiftInfo.coeffRef(2) = Scalar(-0.4375) * s * s; - } - - // MATLAB's new ad hoc shift - if (iter == 30) - { - Scalar s = (shiftInfo.coeff(1) - shiftInfo.coeff(0)) / Scalar(2.0); - s = s * s + shiftInfo.coeff(2); - if (s > Scalar(0)) - { - s = sqrt(s); - if (shiftInfo.coeff(1) < shiftInfo.coeff(0)) - s = -s; - s = s + (shiftInfo.coeff(1) - shiftInfo.coeff(0)) / Scalar(2.0); - s = shiftInfo.coeff(0) - shiftInfo.coeff(2) / s; - exshift += s; - for (Index i = 0; i <= iu; ++i) - m_matT.coeffRef(i,i) -= s; - shiftInfo.setConstant(Scalar(0.964)); - } - } -} - -/** \internal Compute index im at which Francis QR step starts and the first Householder vector. */ -template -inline void RealSchur::initFrancisQRStep(Index il, Index iu, const Vector3s& shiftInfo, Index& im, Vector3s& firstHouseholderVector) -{ - using std::abs; - Vector3s& v = firstHouseholderVector; // alias to save typing - - for (im = iu-2; im >= il; --im) - { - const Scalar Tmm = m_matT.coeff(im,im); - const Scalar r = shiftInfo.coeff(0) - Tmm; - const Scalar s = shiftInfo.coeff(1) - Tmm; - v.coeffRef(0) = (r * s - shiftInfo.coeff(2)) / m_matT.coeff(im+1,im) + m_matT.coeff(im,im+1); - v.coeffRef(1) = m_matT.coeff(im+1,im+1) - Tmm - r - s; - v.coeffRef(2) = m_matT.coeff(im+2,im+1); - if (im == il) { - break; - } - const Scalar lhs = m_matT.coeff(im,im-1) * (abs(v.coeff(1)) + abs(v.coeff(2))); - const Scalar rhs = v.coeff(0) * (abs(m_matT.coeff(im-1,im-1)) + abs(Tmm) + abs(m_matT.coeff(im+1,im+1))); - if (abs(lhs) < NumTraits::epsilon() * rhs) - break; - } -} - -/** \internal Perform a Francis QR step involving rows il:iu and columns im:iu. */ -template -inline void RealSchur::performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace) -{ - eigen_assert(im >= il); - eigen_assert(im <= iu-2); - - const Index size = m_matT.cols(); - - for (Index k = im; k <= iu-2; ++k) - { - bool firstIteration = (k == im); - - Vector3s v; - if (firstIteration) - v = firstHouseholderVector; - else - v = m_matT.template block<3,1>(k,k-1); - - Scalar tau, beta; - Matrix ess; - v.makeHouseholder(ess, tau, beta); - - if (beta != Scalar(0)) // if v is not zero - { - if (firstIteration && k > il) - m_matT.coeffRef(k,k-1) = -m_matT.coeff(k,k-1); - else if (!firstIteration) - m_matT.coeffRef(k,k-1) = beta; - - // These Householder transformations form the O(n^3) part of the algorithm - m_matT.block(k, k, 3, size-k).applyHouseholderOnTheLeft(ess, tau, workspace); - m_matT.block(0, k, (std::min)(iu,k+3) + 1, 3).applyHouseholderOnTheRight(ess, tau, workspace); - if (computeU) - m_matU.block(0, k, size, 3).applyHouseholderOnTheRight(ess, tau, workspace); - } - } - - Matrix v = m_matT.template block<2,1>(iu-1, iu-2); - Scalar tau, beta; - Matrix ess; - v.makeHouseholder(ess, tau, beta); - - if (beta != Scalar(0)) // if v is not zero - { - m_matT.coeffRef(iu-1, iu-2) = beta; - m_matT.block(iu-1, iu-1, 2, size-iu+1).applyHouseholderOnTheLeft(ess, tau, workspace); - m_matT.block(0, iu-1, iu+1, 2).applyHouseholderOnTheRight(ess, tau, workspace); - if (computeU) - m_matU.block(0, iu-1, size, 2).applyHouseholderOnTheRight(ess, tau, workspace); - } - - // clean up pollution due to round-off errors - for (Index i = im+2; i <= iu; ++i) - { - m_matT.coeffRef(i,i-2) = Scalar(0); - if (i > im+2) - m_matT.coeffRef(i,i-3) = Scalar(0); - } -} - -} // end namespace Eigen - -#endif // EIGEN_REAL_SCHUR_H diff --git a/Eigen/src/Eigenvalues/RealSchur_LAPACKE.h b/Eigen/src/Eigenvalues/RealSchur_LAPACKE.h deleted file mode 100644 index 2c2251715..000000000 --- a/Eigen/src/Eigenvalues/RealSchur_LAPACKE.h +++ /dev/null @@ -1,77 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to LAPACKe - * Real Schur needed to real unsymmetrical eigenvalues/eigenvectors. - ******************************************************************************** -*/ - -#ifndef EIGEN_REAL_SCHUR_LAPACKE_H -#define EIGEN_REAL_SCHUR_LAPACKE_H - -namespace Eigen { - -/** \internal Specialization for the data types supported by LAPACKe */ - -#define EIGEN_LAPACKE_SCHUR_REAL(EIGTYPE, LAPACKE_TYPE, LAPACKE_PREFIX, LAPACKE_PREFIX_U, EIGCOLROW, LAPACKE_COLROW) \ -template<> template inline \ -RealSchur >& \ -RealSchur >::compute(const EigenBase& matrix, bool computeU) \ -{ \ - eigen_assert(matrix.cols() == matrix.rows()); \ -\ - lapack_int n = internal::convert_index(matrix.cols()), sdim, info; \ - lapack_int matrix_order = LAPACKE_COLROW; \ - char jobvs, sort='N'; \ - LAPACK_##LAPACKE_PREFIX_U##_SELECT2 select = 0; \ - jobvs = (computeU) ? 'V' : 'N'; \ - m_matU.resize(n, n); \ - lapack_int ldvs = internal::convert_index(m_matU.outerStride()); \ - m_matT = matrix; \ - lapack_int lda = internal::convert_index(m_matT.outerStride()); \ - Matrix wr, wi; \ - wr.resize(n, 1); wi.resize(n, 1); \ - info = LAPACKE_##LAPACKE_PREFIX##gees( matrix_order, jobvs, sort, select, n, (LAPACKE_TYPE*)m_matT.data(), lda, &sdim, (LAPACKE_TYPE*)wr.data(), (LAPACKE_TYPE*)wi.data(), (LAPACKE_TYPE*)m_matU.data(), ldvs ); \ - if(info == 0) \ - m_info = Success; \ - else \ - m_info = NoConvergence; \ -\ - m_isInitialized = true; \ - m_matUisUptodate = computeU; \ - return *this; \ -\ -} - -EIGEN_LAPACKE_SCHUR_REAL(double, double, d, D, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_SCHUR_REAL(float, float, s, S, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_SCHUR_REAL(double, double, d, D, RowMajor, LAPACK_ROW_MAJOR) -EIGEN_LAPACKE_SCHUR_REAL(float, float, s, S, RowMajor, LAPACK_ROW_MAJOR) - -} // end namespace Eigen - -#endif // EIGEN_REAL_SCHUR_LAPACKE_H diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h deleted file mode 100644 index 9ddd553f2..000000000 --- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver.h +++ /dev/null @@ -1,870 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2010 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SELFADJOINTEIGENSOLVER_H -#define EIGEN_SELFADJOINTEIGENSOLVER_H - -#include "./Tridiagonalization.h" - -namespace Eigen { - -template -class GeneralizedSelfAdjointEigenSolver; - -namespace internal { -template struct direct_selfadjoint_eigenvalues; -template -ComputationInfo computeFromTridiagonal_impl(DiagType& diag, SubDiagType& subdiag, const Index maxIterations, bool computeEigenvectors, MatrixType& eivec); -} - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class SelfAdjointEigenSolver - * - * \brief Computes eigenvalues and eigenvectors of selfadjoint matrices - * - * \tparam _MatrixType the type of the matrix of which we are computing the - * eigendecomposition; this is expected to be an instantiation of the Matrix - * class template. - * - * A matrix \f$ A \f$ is selfadjoint if it equals its adjoint. For real - * matrices, this means that the matrix is symmetric: it equals its - * transpose. This class computes the eigenvalues and eigenvectors of a - * selfadjoint matrix. These are the scalars \f$ \lambda \f$ and vectors - * \f$ v \f$ such that \f$ Av = \lambda v \f$. The eigenvalues of a - * selfadjoint matrix are always real. If \f$ D \f$ is a diagonal matrix with - * the eigenvalues on the diagonal, and \f$ V \f$ is a matrix with the - * eigenvectors as its columns, then \f$ A = V D V^{-1} \f$ (for selfadjoint - * matrices, the matrix \f$ V \f$ is always invertible). This is called the - * eigendecomposition. - * - * The algorithm exploits the fact that the matrix is selfadjoint, making it - * faster and more accurate than the general purpose eigenvalue algorithms - * implemented in EigenSolver and ComplexEigenSolver. - * - * Only the \b lower \b triangular \b part of the input matrix is referenced. - * - * Call the function compute() to compute the eigenvalues and eigenvectors of - * a given matrix. Alternatively, you can use the - * SelfAdjointEigenSolver(const MatrixType&, int) constructor which computes - * the eigenvalues and eigenvectors at construction time. Once the eigenvalue - * and eigenvectors are computed, they can be retrieved with the eigenvalues() - * and eigenvectors() functions. - * - * The documentation for SelfAdjointEigenSolver(const MatrixType&, int) - * contains an example of the typical use of this class. - * - * To solve the \em generalized eigenvalue problem \f$ Av = \lambda Bv \f$ and - * the likes, see the class GeneralizedSelfAdjointEigenSolver. - * - * \sa MatrixBase::eigenvalues(), class EigenSolver, class ComplexEigenSolver - */ -template class SelfAdjointEigenSolver -{ - public: - - typedef _MatrixType MatrixType; - enum { - Size = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - Options = MatrixType::Options, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - /** \brief Scalar type for matrices of type \p _MatrixType. */ - typedef typename MatrixType::Scalar Scalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - typedef Matrix EigenvectorsType; - - /** \brief Real scalar type for \p _MatrixType. - * - * This is just \c Scalar if #Scalar is real (e.g., \c float or - * \c double), and the type of the real part of \c Scalar if #Scalar is - * complex. - */ - typedef typename NumTraits::Real RealScalar; - - friend struct internal::direct_selfadjoint_eigenvalues::IsComplex>; - - /** \brief Type for vector of eigenvalues as returned by eigenvalues(). - * - * This is a column vector with entries of type #RealScalar. - * The length of the vector is the size of \p _MatrixType. - */ - typedef typename internal::plain_col_type::type RealVectorType; - typedef Tridiagonalization TridiagonalizationType; - typedef typename TridiagonalizationType::SubDiagonalType SubDiagonalType; - - /** \brief Default constructor for fixed-size matrices. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). This constructor - * can only be used if \p _MatrixType is a fixed-size matrix; use - * SelfAdjointEigenSolver(Index) for dynamic-size matrices. - * - * Example: \include SelfAdjointEigenSolver_SelfAdjointEigenSolver.cpp - * Output: \verbinclude SelfAdjointEigenSolver_SelfAdjointEigenSolver.out - */ - EIGEN_DEVICE_FUNC - SelfAdjointEigenSolver() - : m_eivec(), - m_eivalues(), - m_subdiag(), - m_isInitialized(false) - { } - - /** \brief Constructor, pre-allocates memory for dynamic-size matrices. - * - * \param [in] size Positive integer, size of the matrix whose - * eigenvalues and eigenvectors will be computed. - * - * This constructor is useful for dynamic-size matrices, when the user - * intends to perform decompositions via compute(). The \p size - * parameter is only used as a hint. It is not an error to give a wrong - * \p size, but it may impair performance. - * - * \sa compute() for an example - */ - EIGEN_DEVICE_FUNC - explicit SelfAdjointEigenSolver(Index size) - : m_eivec(size, size), - m_eivalues(size), - m_subdiag(size > 1 ? size - 1 : 1), - m_isInitialized(false) - {} - - /** \brief Constructor; computes eigendecomposition of given matrix. - * - * \param[in] matrix Selfadjoint matrix whose eigendecomposition is to - * be computed. Only the lower triangular part of the matrix is referenced. - * \param[in] options Can be #ComputeEigenvectors (default) or #EigenvaluesOnly. - * - * This constructor calls compute(const MatrixType&, int) to compute the - * eigenvalues of the matrix \p matrix. The eigenvectors are computed if - * \p options equals #ComputeEigenvectors. - * - * Example: \include SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.cpp - * Output: \verbinclude SelfAdjointEigenSolver_SelfAdjointEigenSolver_MatrixType.out - * - * \sa compute(const MatrixType&, int) - */ - template - EIGEN_DEVICE_FUNC - explicit SelfAdjointEigenSolver(const EigenBase& matrix, int options = ComputeEigenvectors) - : m_eivec(matrix.rows(), matrix.cols()), - m_eivalues(matrix.cols()), - m_subdiag(matrix.rows() > 1 ? matrix.rows() - 1 : 1), - m_isInitialized(false) - { - compute(matrix.derived(), options); - } - - /** \brief Computes eigendecomposition of given matrix. - * - * \param[in] matrix Selfadjoint matrix whose eigendecomposition is to - * be computed. Only the lower triangular part of the matrix is referenced. - * \param[in] options Can be #ComputeEigenvectors (default) or #EigenvaluesOnly. - * \returns Reference to \c *this - * - * This function computes the eigenvalues of \p matrix. The eigenvalues() - * function can be used to retrieve them. If \p options equals #ComputeEigenvectors, - * then the eigenvectors are also computed and can be retrieved by - * calling eigenvectors(). - * - * This implementation uses a symmetric QR algorithm. The matrix is first - * reduced to tridiagonal form using the Tridiagonalization class. The - * tridiagonal matrix is then brought to diagonal form with implicit - * symmetric QR steps with Wilkinson shift. Details can be found in - * Section 8.3 of Golub \& Van Loan, %Matrix Computations. - * - * The cost of the computation is about \f$ 9n^3 \f$ if the eigenvectors - * are required and \f$ 4n^3/3 \f$ if they are not required. - * - * This method reuses the memory in the SelfAdjointEigenSolver object that - * was allocated when the object was constructed, if the size of the - * matrix does not change. - * - * Example: \include SelfAdjointEigenSolver_compute_MatrixType.cpp - * Output: \verbinclude SelfAdjointEigenSolver_compute_MatrixType.out - * - * \sa SelfAdjointEigenSolver(const MatrixType&, int) - */ - template - EIGEN_DEVICE_FUNC - SelfAdjointEigenSolver& compute(const EigenBase& matrix, int options = ComputeEigenvectors); - - /** \brief Computes eigendecomposition of given matrix using a closed-form algorithm - * - * This is a variant of compute(const MatrixType&, int options) which - * directly solves the underlying polynomial equation. - * - * Currently only 2x2 and 3x3 matrices for which the sizes are known at compile time are supported (e.g., Matrix3d). - * - * This method is usually significantly faster than the QR iterative algorithm - * but it might also be less accurate. It is also worth noting that - * for 3x3 matrices it involves trigonometric operations which are - * not necessarily available for all scalar types. - * - * For the 3x3 case, we observed the following worst case relative error regarding the eigenvalues: - * - double: 1e-8 - * - float: 1e-3 - * - * \sa compute(const MatrixType&, int options) - */ - EIGEN_DEVICE_FUNC - SelfAdjointEigenSolver& computeDirect(const MatrixType& matrix, int options = ComputeEigenvectors); - - /** - *\brief Computes the eigen decomposition from a tridiagonal symmetric matrix - * - * \param[in] diag The vector containing the diagonal of the matrix. - * \param[in] subdiag The subdiagonal of the matrix. - * \param[in] options Can be #ComputeEigenvectors (default) or #EigenvaluesOnly. - * \returns Reference to \c *this - * - * This function assumes that the matrix has been reduced to tridiagonal form. - * - * \sa compute(const MatrixType&, int) for more information - */ - SelfAdjointEigenSolver& computeFromTridiagonal(const RealVectorType& diag, const SubDiagonalType& subdiag , int options=ComputeEigenvectors); - - /** \brief Returns the eigenvectors of given matrix. - * - * \returns A const reference to the matrix whose columns are the eigenvectors. - * - * \pre The eigenvectors have been computed before. - * - * Column \f$ k \f$ of the returned matrix is an eigenvector corresponding - * to eigenvalue number \f$ k \f$ as returned by eigenvalues(). The - * eigenvectors are normalized to have (Euclidean) norm equal to one. If - * this object was used to solve the eigenproblem for the selfadjoint - * matrix \f$ A \f$, then the matrix returned by this function is the - * matrix \f$ V \f$ in the eigendecomposition \f$ A = V D V^{-1} \f$. - * - * Example: \include SelfAdjointEigenSolver_eigenvectors.cpp - * Output: \verbinclude SelfAdjointEigenSolver_eigenvectors.out - * - * \sa eigenvalues() - */ - EIGEN_DEVICE_FUNC - const EigenvectorsType& eigenvectors() const - { - eigen_assert(m_isInitialized && "SelfAdjointEigenSolver is not initialized."); - eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues."); - return m_eivec; - } - - /** \brief Returns the eigenvalues of given matrix. - * - * \returns A const reference to the column vector containing the eigenvalues. - * - * \pre The eigenvalues have been computed before. - * - * The eigenvalues are repeated according to their algebraic multiplicity, - * so there are as many eigenvalues as rows in the matrix. The eigenvalues - * are sorted in increasing order. - * - * Example: \include SelfAdjointEigenSolver_eigenvalues.cpp - * Output: \verbinclude SelfAdjointEigenSolver_eigenvalues.out - * - * \sa eigenvectors(), MatrixBase::eigenvalues() - */ - EIGEN_DEVICE_FUNC - const RealVectorType& eigenvalues() const - { - eigen_assert(m_isInitialized && "SelfAdjointEigenSolver is not initialized."); - return m_eivalues; - } - - /** \brief Computes the positive-definite square root of the matrix. - * - * \returns the positive-definite square root of the matrix - * - * \pre The eigenvalues and eigenvectors of a positive-definite matrix - * have been computed before. - * - * The square root of a positive-definite matrix \f$ A \f$ is the - * positive-definite matrix whose square equals \f$ A \f$. This function - * uses the eigendecomposition \f$ A = V D V^{-1} \f$ to compute the - * square root as \f$ A^{1/2} = V D^{1/2} V^{-1} \f$. - * - * Example: \include SelfAdjointEigenSolver_operatorSqrt.cpp - * Output: \verbinclude SelfAdjointEigenSolver_operatorSqrt.out - * - * \sa operatorInverseSqrt(), MatrixFunctions Module - */ - EIGEN_DEVICE_FUNC - MatrixType operatorSqrt() const - { - eigen_assert(m_isInitialized && "SelfAdjointEigenSolver is not initialized."); - eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues."); - return m_eivec * m_eivalues.cwiseSqrt().asDiagonal() * m_eivec.adjoint(); - } - - /** \brief Computes the inverse square root of the matrix. - * - * \returns the inverse positive-definite square root of the matrix - * - * \pre The eigenvalues and eigenvectors of a positive-definite matrix - * have been computed before. - * - * This function uses the eigendecomposition \f$ A = V D V^{-1} \f$ to - * compute the inverse square root as \f$ V D^{-1/2} V^{-1} \f$. This is - * cheaper than first computing the square root with operatorSqrt() and - * then its inverse with MatrixBase::inverse(). - * - * Example: \include SelfAdjointEigenSolver_operatorInverseSqrt.cpp - * Output: \verbinclude SelfAdjointEigenSolver_operatorInverseSqrt.out - * - * \sa operatorSqrt(), MatrixBase::inverse(), MatrixFunctions Module - */ - EIGEN_DEVICE_FUNC - MatrixType operatorInverseSqrt() const - { - eigen_assert(m_isInitialized && "SelfAdjointEigenSolver is not initialized."); - eigen_assert(m_eigenvectorsOk && "The eigenvectors have not been computed together with the eigenvalues."); - return m_eivec * m_eivalues.cwiseInverse().cwiseSqrt().asDiagonal() * m_eivec.adjoint(); - } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, \c NoConvergence otherwise. - */ - EIGEN_DEVICE_FUNC - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "SelfAdjointEigenSolver is not initialized."); - return m_info; - } - - /** \brief Maximum number of iterations. - * - * The algorithm terminates if it does not converge within m_maxIterations * n iterations, where n - * denotes the size of the matrix. This value is currently set to 30 (copied from LAPACK). - */ - static const int m_maxIterations = 30; - - protected: - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - EigenvectorsType m_eivec; - RealVectorType m_eivalues; - typename TridiagonalizationType::SubDiagonalType m_subdiag; - ComputationInfo m_info; - bool m_isInitialized; - bool m_eigenvectorsOk; -}; - -namespace internal { -/** \internal - * - * \eigenvalues_module \ingroup Eigenvalues_Module - * - * Performs a QR step on a tridiagonal symmetric matrix represented as a - * pair of two vectors \a diag and \a subdiag. - * - * \param diag the diagonal part of the input selfadjoint tridiagonal matrix - * \param subdiag the sub-diagonal part of the input selfadjoint tridiagonal matrix - * \param start starting index of the submatrix to work on - * \param end last+1 index of the submatrix to work on - * \param matrixQ pointer to the column-major matrix holding the eigenvectors, can be 0 - * \param n size of the input matrix - * - * For compilation efficiency reasons, this procedure does not use eigen expression - * for its arguments. - * - * Implemented from Golub's "Matrix Computations", algorithm 8.3.2: - * "implicit symmetric QR step with Wilkinson shift" - */ -template -EIGEN_DEVICE_FUNC -static void tridiagonal_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n); -} - -template -template -EIGEN_DEVICE_FUNC -SelfAdjointEigenSolver& SelfAdjointEigenSolver -::compute(const EigenBase& a_matrix, int options) -{ - check_template_parameters(); - - const InputType &matrix(a_matrix.derived()); - - using std::abs; - eigen_assert(matrix.cols() == matrix.rows()); - eigen_assert((options&~(EigVecMask|GenEigMask))==0 - && (options&EigVecMask)!=EigVecMask - && "invalid option parameter"); - bool computeEigenvectors = (options&ComputeEigenvectors)==ComputeEigenvectors; - Index n = matrix.cols(); - m_eivalues.resize(n,1); - - if(n==1) - { - m_eivec = matrix; - m_eivalues.coeffRef(0,0) = numext::real(m_eivec.coeff(0,0)); - if(computeEigenvectors) - m_eivec.setOnes(n,n); - m_info = Success; - m_isInitialized = true; - m_eigenvectorsOk = computeEigenvectors; - return *this; - } - - // declare some aliases - RealVectorType& diag = m_eivalues; - EigenvectorsType& mat = m_eivec; - - // map the matrix coefficients to [-1:1] to avoid over- and underflow. - mat = matrix.template triangularView(); - RealScalar scale = mat.cwiseAbs().maxCoeff(); - if(scale==RealScalar(0)) scale = RealScalar(1); - mat.template triangularView() /= scale; - m_subdiag.resize(n-1); - internal::tridiagonalization_inplace(mat, diag, m_subdiag, computeEigenvectors); - - m_info = internal::computeFromTridiagonal_impl(diag, m_subdiag, m_maxIterations, computeEigenvectors, m_eivec); - - // scale back the eigen values - m_eivalues *= scale; - - m_isInitialized = true; - m_eigenvectorsOk = computeEigenvectors; - return *this; -} - -template -SelfAdjointEigenSolver& SelfAdjointEigenSolver -::computeFromTridiagonal(const RealVectorType& diag, const SubDiagonalType& subdiag , int options) -{ - //TODO : Add an option to scale the values beforehand - bool computeEigenvectors = (options&ComputeEigenvectors)==ComputeEigenvectors; - - m_eivalues = diag; - m_subdiag = subdiag; - if (computeEigenvectors) - { - m_eivec.setIdentity(diag.size(), diag.size()); - } - m_info = internal::computeFromTridiagonal_impl(m_eivalues, m_subdiag, m_maxIterations, computeEigenvectors, m_eivec); - - m_isInitialized = true; - m_eigenvectorsOk = computeEigenvectors; - return *this; -} - -namespace internal { -/** - * \internal - * \brief Compute the eigendecomposition from a tridiagonal matrix - * - * \param[in,out] diag : On input, the diagonal of the matrix, on output the eigenvalues - * \param[in,out] subdiag : The subdiagonal part of the matrix (entries are modified during the decomposition) - * \param[in] maxIterations : the maximum number of iterations - * \param[in] computeEigenvectors : whether the eigenvectors have to be computed or not - * \param[out] eivec : The matrix to store the eigenvectors if computeEigenvectors==true. Must be allocated on input. - * \returns \c Success or \c NoConvergence - */ -template -ComputationInfo computeFromTridiagonal_impl(DiagType& diag, SubDiagType& subdiag, const Index maxIterations, bool computeEigenvectors, MatrixType& eivec) -{ - using std::abs; - - ComputationInfo info; - typedef typename MatrixType::Scalar Scalar; - - Index n = diag.size(); - Index end = n-1; - Index start = 0; - Index iter = 0; // total number of iterations - - typedef typename DiagType::RealScalar RealScalar; - const RealScalar considerAsZero = (std::numeric_limits::min)(); - const RealScalar precision = RealScalar(2)*NumTraits::epsilon(); - - while (end>0) - { - for (Index i = start; i0 && subdiag[end-1]==RealScalar(0)) - { - end--; - } - if (end<=0) - break; - - // if we spent too many iterations, we give up - iter++; - if(iter > maxIterations * n) break; - - start = end - 1; - while (start>0 && subdiag[start-1]!=0) - start--; - - internal::tridiagonal_qr_step(diag.data(), subdiag.data(), start, end, computeEigenvectors ? eivec.data() : (Scalar*)0, n); - } - if (iter <= maxIterations * n) - info = Success; - else - info = NoConvergence; - - // Sort eigenvalues and corresponding vectors. - // TODO make the sort optional ? - // TODO use a better sort algorithm !! - if (info == Success) - { - for (Index i = 0; i < n-1; ++i) - { - Index k; - diag.segment(i,n-i).minCoeff(&k); - if (k > 0) - { - std::swap(diag[i], diag[k+i]); - if(computeEigenvectors) - eivec.col(i).swap(eivec.col(k+i)); - } - } - } - return info; -} - -template struct direct_selfadjoint_eigenvalues -{ - EIGEN_DEVICE_FUNC - static inline void run(SolverType& eig, const typename SolverType::MatrixType& A, int options) - { eig.compute(A,options); } -}; - -template struct direct_selfadjoint_eigenvalues -{ - typedef typename SolverType::MatrixType MatrixType; - typedef typename SolverType::RealVectorType VectorType; - typedef typename SolverType::Scalar Scalar; - typedef typename SolverType::EigenvectorsType EigenvectorsType; - - - /** \internal - * Computes the roots of the characteristic polynomial of \a m. - * For numerical stability m.trace() should be near zero and to avoid over- or underflow m should be normalized. - */ - EIGEN_DEVICE_FUNC - static inline void computeRoots(const MatrixType& m, VectorType& roots) - { - EIGEN_USING_STD_MATH(sqrt) - EIGEN_USING_STD_MATH(atan2) - EIGEN_USING_STD_MATH(cos) - EIGEN_USING_STD_MATH(sin) - const Scalar s_inv3 = Scalar(1)/Scalar(3); - const Scalar s_sqrt3 = sqrt(Scalar(3)); - - // The characteristic equation is x^3 - c2*x^2 + c1*x - c0 = 0. The - // eigenvalues are the roots to this equation, all guaranteed to be - // real-valued, because the matrix is symmetric. - Scalar c0 = m(0,0)*m(1,1)*m(2,2) + Scalar(2)*m(1,0)*m(2,0)*m(2,1) - m(0,0)*m(2,1)*m(2,1) - m(1,1)*m(2,0)*m(2,0) - m(2,2)*m(1,0)*m(1,0); - Scalar c1 = m(0,0)*m(1,1) - m(1,0)*m(1,0) + m(0,0)*m(2,2) - m(2,0)*m(2,0) + m(1,1)*m(2,2) - m(2,1)*m(2,1); - Scalar c2 = m(0,0) + m(1,1) + m(2,2); - - // Construct the parameters used in classifying the roots of the equation - // and in solving the equation for the roots in closed form. - Scalar c2_over_3 = c2*s_inv3; - Scalar a_over_3 = (c2*c2_over_3 - c1)*s_inv3; - a_over_3 = numext::maxi(a_over_3, Scalar(0)); - - Scalar half_b = Scalar(0.5)*(c0 + c2_over_3*(Scalar(2)*c2_over_3*c2_over_3 - c1)); - - Scalar q = a_over_3*a_over_3*a_over_3 - half_b*half_b; - q = numext::maxi(q, Scalar(0)); - - // Compute the eigenvalues by solving for the roots of the polynomial. - Scalar rho = sqrt(a_over_3); - Scalar theta = atan2(sqrt(q),half_b)*s_inv3; // since sqrt(q) > 0, atan2 is in [0, pi] and theta is in [0, pi/3] - Scalar cos_theta = cos(theta); - Scalar sin_theta = sin(theta); - // roots are already sorted, since cos is monotonically decreasing on [0, pi] - roots(0) = c2_over_3 - rho*(cos_theta + s_sqrt3*sin_theta); // == 2*rho*cos(theta+2pi/3) - roots(1) = c2_over_3 - rho*(cos_theta - s_sqrt3*sin_theta); // == 2*rho*cos(theta+ pi/3) - roots(2) = c2_over_3 + Scalar(2)*rho*cos_theta; - } - - EIGEN_DEVICE_FUNC - static inline bool extract_kernel(MatrixType& mat, Ref res, Ref representative) - { - using std::abs; - Index i0; - // Find non-zero column i0 (by construction, there must exist a non zero coefficient on the diagonal): - mat.diagonal().cwiseAbs().maxCoeff(&i0); - // mat.col(i0) is a good candidate for an orthogonal vector to the current eigenvector, - // so let's save it: - representative = mat.col(i0); - Scalar n0, n1; - VectorType c0, c1; - n0 = (c0 = representative.cross(mat.col((i0+1)%3))).squaredNorm(); - n1 = (c1 = representative.cross(mat.col((i0+2)%3))).squaredNorm(); - if(n0>n1) res = c0/std::sqrt(n0); - else res = c1/std::sqrt(n1); - - return true; - } - - EIGEN_DEVICE_FUNC - static inline void run(SolverType& solver, const MatrixType& mat, int options) - { - eigen_assert(mat.cols() == 3 && mat.cols() == mat.rows()); - eigen_assert((options&~(EigVecMask|GenEigMask))==0 - && (options&EigVecMask)!=EigVecMask - && "invalid option parameter"); - bool computeEigenvectors = (options&ComputeEigenvectors)==ComputeEigenvectors; - - EigenvectorsType& eivecs = solver.m_eivec; - VectorType& eivals = solver.m_eivalues; - - // Shift the matrix to the mean eigenvalue and map the matrix coefficients to [-1:1] to avoid over- and underflow. - Scalar shift = mat.trace() / Scalar(3); - // TODO Avoid this copy. Currently it is necessary to suppress bogus values when determining maxCoeff and for computing the eigenvectors later - MatrixType scaledMat = mat.template selfadjointView(); - scaledMat.diagonal().array() -= shift; - Scalar scale = scaledMat.cwiseAbs().maxCoeff(); - if(scale > 0) scaledMat /= scale; // TODO for scale==0 we could save the remaining operations - - // compute the eigenvalues - computeRoots(scaledMat,eivals); - - // compute the eigenvectors - if(computeEigenvectors) - { - if((eivals(2)-eivals(0))<=Eigen::NumTraits::epsilon()) - { - // All three eigenvalues are numerically the same - eivecs.setIdentity(); - } - else - { - MatrixType tmp; - tmp = scaledMat; - - // Compute the eigenvector of the most distinct eigenvalue - Scalar d0 = eivals(2) - eivals(1); - Scalar d1 = eivals(1) - eivals(0); - Index k(0), l(2); - if(d0 > d1) - { - numext::swap(k,l); - d0 = d1; - } - - // Compute the eigenvector of index k - { - tmp.diagonal().array () -= eivals(k); - // By construction, 'tmp' is of rank 2, and its kernel corresponds to the respective eigenvector. - extract_kernel(tmp, eivecs.col(k), eivecs.col(l)); - } - - // Compute eigenvector of index l - if(d0<=2*Eigen::NumTraits::epsilon()*d1) - { - // If d0 is too small, then the two other eigenvalues are numerically the same, - // and thus we only have to ortho-normalize the near orthogonal vector we saved above. - eivecs.col(l) -= eivecs.col(k).dot(eivecs.col(l))*eivecs.col(l); - eivecs.col(l).normalize(); - } - else - { - tmp = scaledMat; - tmp.diagonal().array () -= eivals(l); - - VectorType dummy; - extract_kernel(tmp, eivecs.col(l), dummy); - } - - // Compute last eigenvector from the other two - eivecs.col(1) = eivecs.col(2).cross(eivecs.col(0)).normalized(); - } - } - - // Rescale back to the original size. - eivals *= scale; - eivals.array() += shift; - - solver.m_info = Success; - solver.m_isInitialized = true; - solver.m_eigenvectorsOk = computeEigenvectors; - } -}; - -// 2x2 direct eigenvalues decomposition, code from Hauke Heibel -template -struct direct_selfadjoint_eigenvalues -{ - typedef typename SolverType::MatrixType MatrixType; - typedef typename SolverType::RealVectorType VectorType; - typedef typename SolverType::Scalar Scalar; - typedef typename SolverType::EigenvectorsType EigenvectorsType; - - EIGEN_DEVICE_FUNC - static inline void computeRoots(const MatrixType& m, VectorType& roots) - { - using std::sqrt; - const Scalar t0 = Scalar(0.5) * sqrt( numext::abs2(m(0,0)-m(1,1)) + Scalar(4)*numext::abs2(m(1,0))); - const Scalar t1 = Scalar(0.5) * (m(0,0) + m(1,1)); - roots(0) = t1 - t0; - roots(1) = t1 + t0; - } - - EIGEN_DEVICE_FUNC - static inline void run(SolverType& solver, const MatrixType& mat, int options) - { - EIGEN_USING_STD_MATH(sqrt); - EIGEN_USING_STD_MATH(abs); - - eigen_assert(mat.cols() == 2 && mat.cols() == mat.rows()); - eigen_assert((options&~(EigVecMask|GenEigMask))==0 - && (options&EigVecMask)!=EigVecMask - && "invalid option parameter"); - bool computeEigenvectors = (options&ComputeEigenvectors)==ComputeEigenvectors; - - EigenvectorsType& eivecs = solver.m_eivec; - VectorType& eivals = solver.m_eivalues; - - // Shift the matrix to the mean eigenvalue and map the matrix coefficients to [-1:1] to avoid over- and underflow. - Scalar shift = mat.trace() / Scalar(2); - MatrixType scaledMat = mat; - scaledMat.coeffRef(0,1) = mat.coeff(1,0); - scaledMat.diagonal().array() -= shift; - Scalar scale = scaledMat.cwiseAbs().maxCoeff(); - if(scale > Scalar(0)) - scaledMat /= scale; - - // Compute the eigenvalues - computeRoots(scaledMat,eivals); - - // compute the eigen vectors - if(computeEigenvectors) - { - if((eivals(1)-eivals(0))<=abs(eivals(1))*Eigen::NumTraits::epsilon()) - { - eivecs.setIdentity(); - } - else - { - scaledMat.diagonal().array () -= eivals(1); - Scalar a2 = numext::abs2(scaledMat(0,0)); - Scalar c2 = numext::abs2(scaledMat(1,1)); - Scalar b2 = numext::abs2(scaledMat(1,0)); - if(a2>c2) - { - eivecs.col(1) << -scaledMat(1,0), scaledMat(0,0); - eivecs.col(1) /= sqrt(a2+b2); - } - else - { - eivecs.col(1) << -scaledMat(1,1), scaledMat(1,0); - eivecs.col(1) /= sqrt(c2+b2); - } - - eivecs.col(0) << eivecs.col(1).unitOrthogonal(); - } - } - - // Rescale back to the original size. - eivals *= scale; - eivals.array() += shift; - - solver.m_info = Success; - solver.m_isInitialized = true; - solver.m_eigenvectorsOk = computeEigenvectors; - } -}; - -} - -template -EIGEN_DEVICE_FUNC -SelfAdjointEigenSolver& SelfAdjointEigenSolver -::computeDirect(const MatrixType& matrix, int options) -{ - internal::direct_selfadjoint_eigenvalues::IsComplex>::run(*this,matrix,options); - return *this; -} - -namespace internal { -template -EIGEN_DEVICE_FUNC -static void tridiagonal_qr_step(RealScalar* diag, RealScalar* subdiag, Index start, Index end, Scalar* matrixQ, Index n) -{ - using std::abs; - RealScalar td = (diag[end-1] - diag[end])*RealScalar(0.5); - RealScalar e = subdiag[end-1]; - // Note that thanks to scaling, e^2 or td^2 cannot overflow, however they can still - // underflow thus leading to inf/NaN values when using the following commented code: -// RealScalar e2 = numext::abs2(subdiag[end-1]); -// RealScalar mu = diag[end] - e2 / (td + (td>0 ? 1 : -1) * sqrt(td*td + e2)); - // This explain the following, somewhat more complicated, version: - RealScalar mu = diag[end]; - if(td==RealScalar(0)) - mu -= abs(e); - else - { - RealScalar e2 = numext::abs2(subdiag[end-1]); - RealScalar h = numext::hypot(td,e); - if(e2==RealScalar(0)) mu -= (e / (td + (td>RealScalar(0) ? RealScalar(1) : RealScalar(-1)))) * (e / h); - else mu -= e2 / (td + (td>RealScalar(0) ? h : -h)); - } - - RealScalar x = diag[start] - mu; - RealScalar z = subdiag[start]; - for (Index k = start; k < end; ++k) - { - JacobiRotation rot; - rot.makeGivens(x, z); - - // do T = G' T G - RealScalar sdk = rot.s() * diag[k] + rot.c() * subdiag[k]; - RealScalar dkp1 = rot.s() * subdiag[k] + rot.c() * diag[k+1]; - - diag[k] = rot.c() * (rot.c() * diag[k] - rot.s() * subdiag[k]) - rot.s() * (rot.c() * subdiag[k] - rot.s() * diag[k+1]); - diag[k+1] = rot.s() * sdk + rot.c() * dkp1; - subdiag[k] = rot.c() * sdk - rot.s() * dkp1; - - - if (k > start) - subdiag[k - 1] = rot.c() * subdiag[k-1] - rot.s() * z; - - x = subdiag[k]; - - if (k < end - 1) - { - z = -rot.s() * subdiag[k+1]; - subdiag[k + 1] = rot.c() * subdiag[k+1]; - } - - // apply the givens rotation to the unit matrix Q = Q * G - if (matrixQ) - { - // FIXME if StorageOrder == RowMajor this operation is not very efficient - Map > q(matrixQ,n,n); - q.applyOnTheRight(k,k+1,rot); - } - } -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SELFADJOINTEIGENSOLVER_H diff --git a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h b/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h deleted file mode 100644 index 3891cf883..000000000 --- a/Eigen/src/Eigenvalues/SelfAdjointEigenSolver_LAPACKE.h +++ /dev/null @@ -1,90 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to LAPACKe - * Self-adjoint eigenvalues/eigenvectors. - ******************************************************************************** -*/ - -#ifndef EIGEN_SAEIGENSOLVER_LAPACKE_H -#define EIGEN_SAEIGENSOLVER_LAPACKE_H - -namespace Eigen { - -/** \internal Specialization for the data types supported by LAPACKe */ - -#define EIGEN_LAPACKE_EIG_SELFADJ(EIGTYPE, LAPACKE_TYPE, LAPACKE_RTYPE, LAPACKE_NAME, EIGCOLROW, LAPACKE_COLROW ) \ -template<> template inline \ -SelfAdjointEigenSolver >& \ -SelfAdjointEigenSolver >::compute(const EigenBase& matrix, int options) \ -{ \ - eigen_assert(matrix.cols() == matrix.rows()); \ - eigen_assert((options&~(EigVecMask|GenEigMask))==0 \ - && (options&EigVecMask)!=EigVecMask \ - && "invalid option parameter"); \ - bool computeEigenvectors = (options&ComputeEigenvectors)==ComputeEigenvectors; \ - lapack_int n = internal::convert_index(matrix.cols()), lda, matrix_order, info; \ - m_eivalues.resize(n,1); \ - m_subdiag.resize(n-1); \ - m_eivec = matrix; \ -\ - if(n==1) \ - { \ - m_eivalues.coeffRef(0,0) = numext::real(m_eivec.coeff(0,0)); \ - if(computeEigenvectors) m_eivec.setOnes(n,n); \ - m_info = Success; \ - m_isInitialized = true; \ - m_eigenvectorsOk = computeEigenvectors; \ - return *this; \ - } \ -\ - lda = internal::convert_index(m_eivec.outerStride()); \ - matrix_order=LAPACKE_COLROW; \ - char jobz, uplo='L'/*, range='A'*/; \ - jobz = computeEigenvectors ? 'V' : 'N'; \ -\ - info = LAPACKE_##LAPACKE_NAME( matrix_order, jobz, uplo, n, (LAPACKE_TYPE*)m_eivec.data(), lda, (LAPACKE_RTYPE*)m_eivalues.data() ); \ - m_info = (info==0) ? Success : NoConvergence; \ - m_isInitialized = true; \ - m_eigenvectorsOk = computeEigenvectors; \ - return *this; \ -} - - -EIGEN_LAPACKE_EIG_SELFADJ(double, double, double, dsyev, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_EIG_SELFADJ(float, float, float, ssyev, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_EIG_SELFADJ(dcomplex, lapack_complex_double, double, zheev, ColMajor, LAPACK_COL_MAJOR) -EIGEN_LAPACKE_EIG_SELFADJ(scomplex, lapack_complex_float, float, cheev, ColMajor, LAPACK_COL_MAJOR) - -EIGEN_LAPACKE_EIG_SELFADJ(double, double, double, dsyev, RowMajor, LAPACK_ROW_MAJOR) -EIGEN_LAPACKE_EIG_SELFADJ(float, float, float, ssyev, RowMajor, LAPACK_ROW_MAJOR) -EIGEN_LAPACKE_EIG_SELFADJ(dcomplex, lapack_complex_double, double, zheev, RowMajor, LAPACK_ROW_MAJOR) -EIGEN_LAPACKE_EIG_SELFADJ(scomplex, lapack_complex_float, float, cheev, RowMajor, LAPACK_ROW_MAJOR) - -} // end namespace Eigen - -#endif // EIGEN_SAEIGENSOLVER_H diff --git a/Eigen/src/Eigenvalues/Tridiagonalization.h b/Eigen/src/Eigenvalues/Tridiagonalization.h deleted file mode 100644 index 1d102c17b..000000000 --- a/Eigen/src/Eigenvalues/Tridiagonalization.h +++ /dev/null @@ -1,556 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2010 Jitse Niesen -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRIDIAGONALIZATION_H -#define EIGEN_TRIDIAGONALIZATION_H - -namespace Eigen { - -namespace internal { - -template struct TridiagonalizationMatrixTReturnType; -template -struct traits > - : public traits -{ - typedef typename MatrixType::PlainObject ReturnType; // FIXME shall it be a BandMatrix? - enum { Flags = 0 }; -}; - -template -void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs); -} - -/** \eigenvalues_module \ingroup Eigenvalues_Module - * - * - * \class Tridiagonalization - * - * \brief Tridiagonal decomposition of a selfadjoint matrix - * - * \tparam _MatrixType the type of the matrix of which we are computing the - * tridiagonal decomposition; this is expected to be an instantiation of the - * Matrix class template. - * - * This class performs a tridiagonal decomposition of a selfadjoint matrix \f$ A \f$ such that: - * \f$ A = Q T Q^* \f$ where \f$ Q \f$ is unitary and \f$ T \f$ a real symmetric tridiagonal matrix. - * - * A tridiagonal matrix is a matrix which has nonzero elements only on the - * main diagonal and the first diagonal below and above it. The Hessenberg - * decomposition of a selfadjoint matrix is in fact a tridiagonal - * decomposition. This class is used in SelfAdjointEigenSolver to compute the - * eigenvalues and eigenvectors of a selfadjoint matrix. - * - * Call the function compute() to compute the tridiagonal decomposition of a - * given matrix. Alternatively, you can use the Tridiagonalization(const MatrixType&) - * constructor which computes the tridiagonal Schur decomposition at - * construction time. Once the decomposition is computed, you can use the - * matrixQ() and matrixT() functions to retrieve the matrices Q and T in the - * decomposition. - * - * The documentation of Tridiagonalization(const MatrixType&) contains an - * example of the typical use of this class. - * - * \sa class HessenbergDecomposition, class SelfAdjointEigenSolver - */ -template class Tridiagonalization -{ - public: - - /** \brief Synonym for the template parameter \p _MatrixType. */ - typedef _MatrixType MatrixType; - - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - - enum { - Size = MatrixType::RowsAtCompileTime, - SizeMinusOne = Size == Dynamic ? Dynamic : (Size > 1 ? Size - 1 : 1), - Options = MatrixType::Options, - MaxSize = MatrixType::MaxRowsAtCompileTime, - MaxSizeMinusOne = MaxSize == Dynamic ? Dynamic : (MaxSize > 1 ? MaxSize - 1 : 1) - }; - - typedef Matrix CoeffVectorType; - typedef typename internal::plain_col_type::type DiagonalType; - typedef Matrix SubDiagonalType; - typedef typename internal::remove_all::type MatrixTypeRealView; - typedef internal::TridiagonalizationMatrixTReturnType MatrixTReturnType; - - typedef typename internal::conditional::IsComplex, - typename internal::add_const_on_value_type::RealReturnType>::type, - const Diagonal - >::type DiagonalReturnType; - - typedef typename internal::conditional::IsComplex, - typename internal::add_const_on_value_type::RealReturnType>::type, - const Diagonal - >::type SubDiagonalReturnType; - - /** \brief Return type of matrixQ() */ - typedef HouseholderSequence::type> HouseholderSequenceType; - - /** \brief Default constructor. - * - * \param [in] size Positive integer, size of the matrix whose tridiagonal - * decomposition will be computed. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via compute(). The \p size parameter is only - * used as a hint. It is not an error to give a wrong \p size, but it may - * impair performance. - * - * \sa compute() for an example. - */ - explicit Tridiagonalization(Index size = Size==Dynamic ? 2 : Size) - : m_matrix(size,size), - m_hCoeffs(size > 1 ? size-1 : 1), - m_isInitialized(false) - {} - - /** \brief Constructor; computes tridiagonal decomposition of given matrix. - * - * \param[in] matrix Selfadjoint matrix whose tridiagonal decomposition - * is to be computed. - * - * This constructor calls compute() to compute the tridiagonal decomposition. - * - * Example: \include Tridiagonalization_Tridiagonalization_MatrixType.cpp - * Output: \verbinclude Tridiagonalization_Tridiagonalization_MatrixType.out - */ - template - explicit Tridiagonalization(const EigenBase& matrix) - : m_matrix(matrix.derived()), - m_hCoeffs(matrix.cols() > 1 ? matrix.cols()-1 : 1), - m_isInitialized(false) - { - internal::tridiagonalization_inplace(m_matrix, m_hCoeffs); - m_isInitialized = true; - } - - /** \brief Computes tridiagonal decomposition of given matrix. - * - * \param[in] matrix Selfadjoint matrix whose tridiagonal decomposition - * is to be computed. - * \returns Reference to \c *this - * - * The tridiagonal decomposition is computed by bringing the columns of - * the matrix successively in the required form using Householder - * reflections. The cost is \f$ 4n^3/3 \f$ flops, where \f$ n \f$ denotes - * the size of the given matrix. - * - * This method reuses of the allocated data in the Tridiagonalization - * object, if the size of the matrix does not change. - * - * Example: \include Tridiagonalization_compute.cpp - * Output: \verbinclude Tridiagonalization_compute.out - */ - template - Tridiagonalization& compute(const EigenBase& matrix) - { - m_matrix = matrix.derived(); - m_hCoeffs.resize(matrix.rows()-1, 1); - internal::tridiagonalization_inplace(m_matrix, m_hCoeffs); - m_isInitialized = true; - return *this; - } - - /** \brief Returns the Householder coefficients. - * - * \returns a const reference to the vector of Householder coefficients - * - * \pre Either the constructor Tridiagonalization(const MatrixType&) or - * the member function compute(const MatrixType&) has been called before - * to compute the tridiagonal decomposition of a matrix. - * - * The Householder coefficients allow the reconstruction of the matrix - * \f$ Q \f$ in the tridiagonal decomposition from the packed data. - * - * Example: \include Tridiagonalization_householderCoefficients.cpp - * Output: \verbinclude Tridiagonalization_householderCoefficients.out - * - * \sa packedMatrix(), \ref Householder_Module "Householder module" - */ - inline CoeffVectorType householderCoefficients() const - { - eigen_assert(m_isInitialized && "Tridiagonalization is not initialized."); - return m_hCoeffs; - } - - /** \brief Returns the internal representation of the decomposition - * - * \returns a const reference to a matrix with the internal representation - * of the decomposition. - * - * \pre Either the constructor Tridiagonalization(const MatrixType&) or - * the member function compute(const MatrixType&) has been called before - * to compute the tridiagonal decomposition of a matrix. - * - * The returned matrix contains the following information: - * - the strict upper triangular part is equal to the input matrix A. - * - the diagonal and lower sub-diagonal represent the real tridiagonal - * symmetric matrix T. - * - the rest of the lower part contains the Householder vectors that, - * combined with Householder coefficients returned by - * householderCoefficients(), allows to reconstruct the matrix Q as - * \f$ Q = H_{N-1} \ldots H_1 H_0 \f$. - * Here, the matrices \f$ H_i \f$ are the Householder transformations - * \f$ H_i = (I - h_i v_i v_i^T) \f$ - * where \f$ h_i \f$ is the \f$ i \f$th Householder coefficient and - * \f$ v_i \f$ is the Householder vector defined by - * \f$ v_i = [ 0, \ldots, 0, 1, M(i+2,i), \ldots, M(N-1,i) ]^T \f$ - * with M the matrix returned by this function. - * - * See LAPACK for further details on this packed storage. - * - * Example: \include Tridiagonalization_packedMatrix.cpp - * Output: \verbinclude Tridiagonalization_packedMatrix.out - * - * \sa householderCoefficients() - */ - inline const MatrixType& packedMatrix() const - { - eigen_assert(m_isInitialized && "Tridiagonalization is not initialized."); - return m_matrix; - } - - /** \brief Returns the unitary matrix Q in the decomposition - * - * \returns object representing the matrix Q - * - * \pre Either the constructor Tridiagonalization(const MatrixType&) or - * the member function compute(const MatrixType&) has been called before - * to compute the tridiagonal decomposition of a matrix. - * - * This function returns a light-weight object of template class - * HouseholderSequence. You can either apply it directly to a matrix or - * you can convert it to a matrix of type #MatrixType. - * - * \sa Tridiagonalization(const MatrixType&) for an example, - * matrixT(), class HouseholderSequence - */ - HouseholderSequenceType matrixQ() const - { - eigen_assert(m_isInitialized && "Tridiagonalization is not initialized."); - return HouseholderSequenceType(m_matrix, m_hCoeffs.conjugate()) - .setLength(m_matrix.rows() - 1) - .setShift(1); - } - - /** \brief Returns an expression of the tridiagonal matrix T in the decomposition - * - * \returns expression object representing the matrix T - * - * \pre Either the constructor Tridiagonalization(const MatrixType&) or - * the member function compute(const MatrixType&) has been called before - * to compute the tridiagonal decomposition of a matrix. - * - * Currently, this function can be used to extract the matrix T from internal - * data and copy it to a dense matrix object. In most cases, it may be - * sufficient to directly use the packed matrix or the vector expressions - * returned by diagonal() and subDiagonal() instead of creating a new - * dense copy matrix with this function. - * - * \sa Tridiagonalization(const MatrixType&) for an example, - * matrixQ(), packedMatrix(), diagonal(), subDiagonal() - */ - MatrixTReturnType matrixT() const - { - eigen_assert(m_isInitialized && "Tridiagonalization is not initialized."); - return MatrixTReturnType(m_matrix.real()); - } - - /** \brief Returns the diagonal of the tridiagonal matrix T in the decomposition. - * - * \returns expression representing the diagonal of T - * - * \pre Either the constructor Tridiagonalization(const MatrixType&) or - * the member function compute(const MatrixType&) has been called before - * to compute the tridiagonal decomposition of a matrix. - * - * Example: \include Tridiagonalization_diagonal.cpp - * Output: \verbinclude Tridiagonalization_diagonal.out - * - * \sa matrixT(), subDiagonal() - */ - DiagonalReturnType diagonal() const; - - /** \brief Returns the subdiagonal of the tridiagonal matrix T in the decomposition. - * - * \returns expression representing the subdiagonal of T - * - * \pre Either the constructor Tridiagonalization(const MatrixType&) or - * the member function compute(const MatrixType&) has been called before - * to compute the tridiagonal decomposition of a matrix. - * - * \sa diagonal() for an example, matrixT() - */ - SubDiagonalReturnType subDiagonal() const; - - protected: - - MatrixType m_matrix; - CoeffVectorType m_hCoeffs; - bool m_isInitialized; -}; - -template -typename Tridiagonalization::DiagonalReturnType -Tridiagonalization::diagonal() const -{ - eigen_assert(m_isInitialized && "Tridiagonalization is not initialized."); - return m_matrix.diagonal().real(); -} - -template -typename Tridiagonalization::SubDiagonalReturnType -Tridiagonalization::subDiagonal() const -{ - eigen_assert(m_isInitialized && "Tridiagonalization is not initialized."); - return m_matrix.template diagonal<-1>().real(); -} - -namespace internal { - -/** \internal - * Performs a tridiagonal decomposition of the selfadjoint matrix \a matA in-place. - * - * \param[in,out] matA On input the selfadjoint matrix. Only the \b lower triangular part is referenced. - * On output, the strict upper part is left unchanged, and the lower triangular part - * represents the T and Q matrices in packed format has detailed below. - * \param[out] hCoeffs returned Householder coefficients (see below) - * - * On output, the tridiagonal selfadjoint matrix T is stored in the diagonal - * and lower sub-diagonal of the matrix \a matA. - * The unitary matrix Q is represented in a compact way as a product of - * Householder reflectors \f$ H_i \f$ such that: - * \f$ Q = H_{N-1} \ldots H_1 H_0 \f$. - * The Householder reflectors are defined as - * \f$ H_i = (I - h_i v_i v_i^T) \f$ - * where \f$ h_i = hCoeffs[i]\f$ is the \f$ i \f$th Householder coefficient and - * \f$ v_i \f$ is the Householder vector defined by - * \f$ v_i = [ 0, \ldots, 0, 1, matA(i+2,i), \ldots, matA(N-1,i) ]^T \f$. - * - * Implemented from Golub's "Matrix Computations", algorithm 8.3.1. - * - * \sa Tridiagonalization::packedMatrix() - */ -template -void tridiagonalization_inplace(MatrixType& matA, CoeffVectorType& hCoeffs) -{ - using numext::conj; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - Index n = matA.rows(); - eigen_assert(n==matA.cols()); - eigen_assert(n==hCoeffs.size()+1 || n==1); - - for (Index i = 0; i() - * (conj(h) * matA.col(i).tail(remainingSize))); - - hCoeffs.tail(n-i-1) += (conj(h)*RealScalar(-0.5)*(hCoeffs.tail(remainingSize).dot(matA.col(i).tail(remainingSize)))) * matA.col(i).tail(n-i-1); - - matA.bottomRightCorner(remainingSize, remainingSize).template selfadjointView() - .rankUpdate(matA.col(i).tail(remainingSize), hCoeffs.tail(remainingSize), Scalar(-1)); - - matA.col(i).coeffRef(i+1) = beta; - hCoeffs.coeffRef(i) = h; - } -} - -// forward declaration, implementation at the end of this file -template::IsComplex> -struct tridiagonalization_inplace_selector; - -/** \brief Performs a full tridiagonalization in place - * - * \param[in,out] mat On input, the selfadjoint matrix whose tridiagonal - * decomposition is to be computed. Only the lower triangular part referenced. - * The rest is left unchanged. On output, the orthogonal matrix Q - * in the decomposition if \p extractQ is true. - * \param[out] diag The diagonal of the tridiagonal matrix T in the - * decomposition. - * \param[out] subdiag The subdiagonal of the tridiagonal matrix T in - * the decomposition. - * \param[in] extractQ If true, the orthogonal matrix Q in the - * decomposition is computed and stored in \p mat. - * - * Computes the tridiagonal decomposition of the selfadjoint matrix \p mat in place - * such that \f$ mat = Q T Q^* \f$ where \f$ Q \f$ is unitary and \f$ T \f$ a real - * symmetric tridiagonal matrix. - * - * The tridiagonal matrix T is passed to the output parameters \p diag and \p subdiag. If - * \p extractQ is true, then the orthogonal matrix Q is passed to \p mat. Otherwise the lower - * part of the matrix \p mat is destroyed. - * - * The vectors \p diag and \p subdiag are not resized. The function - * assumes that they are already of the correct size. The length of the - * vector \p diag should equal the number of rows in \p mat, and the - * length of the vector \p subdiag should be one left. - * - * This implementation contains an optimized path for 3-by-3 matrices - * which is especially useful for plane fitting. - * - * \note Currently, it requires two temporary vectors to hold the intermediate - * Householder coefficients, and to reconstruct the matrix Q from the Householder - * reflectors. - * - * Example (this uses the same matrix as the example in - * Tridiagonalization::Tridiagonalization(const MatrixType&)): - * \include Tridiagonalization_decomposeInPlace.cpp - * Output: \verbinclude Tridiagonalization_decomposeInPlace.out - * - * \sa class Tridiagonalization - */ -template -void tridiagonalization_inplace(MatrixType& mat, DiagonalType& diag, SubDiagonalType& subdiag, bool extractQ) -{ - eigen_assert(mat.cols()==mat.rows() && diag.size()==mat.rows() && subdiag.size()==mat.rows()-1); - tridiagonalization_inplace_selector::run(mat, diag, subdiag, extractQ); -} - -/** \internal - * General full tridiagonalization - */ -template -struct tridiagonalization_inplace_selector -{ - typedef typename Tridiagonalization::CoeffVectorType CoeffVectorType; - typedef typename Tridiagonalization::HouseholderSequenceType HouseholderSequenceType; - template - static void run(MatrixType& mat, DiagonalType& diag, SubDiagonalType& subdiag, bool extractQ) - { - CoeffVectorType hCoeffs(mat.cols()-1); - tridiagonalization_inplace(mat,hCoeffs); - diag = mat.diagonal().real(); - subdiag = mat.template diagonal<-1>().real(); - if(extractQ) - mat = HouseholderSequenceType(mat, hCoeffs.conjugate()) - .setLength(mat.rows() - 1) - .setShift(1); - } -}; - -/** \internal - * Specialization for 3x3 real matrices. - * Especially useful for plane fitting. - */ -template -struct tridiagonalization_inplace_selector -{ - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - - template - static void run(MatrixType& mat, DiagonalType& diag, SubDiagonalType& subdiag, bool extractQ) - { - using std::sqrt; - const RealScalar tol = (std::numeric_limits::min)(); - diag[0] = mat(0,0); - RealScalar v1norm2 = numext::abs2(mat(2,0)); - if(v1norm2 <= tol) - { - diag[1] = mat(1,1); - diag[2] = mat(2,2); - subdiag[0] = mat(1,0); - subdiag[1] = mat(2,1); - if (extractQ) - mat.setIdentity(); - } - else - { - RealScalar beta = sqrt(numext::abs2(mat(1,0)) + v1norm2); - RealScalar invBeta = RealScalar(1)/beta; - Scalar m01 = mat(1,0) * invBeta; - Scalar m02 = mat(2,0) * invBeta; - Scalar q = RealScalar(2)*m01*mat(2,1) + m02*(mat(2,2) - mat(1,1)); - diag[1] = mat(1,1) + m02*q; - diag[2] = mat(2,2) - m02*q; - subdiag[0] = beta; - subdiag[1] = mat(2,1) - m01 * q; - if (extractQ) - { - mat << 1, 0, 0, - 0, m01, m02, - 0, m02, -m01; - } - } - } -}; - -/** \internal - * Trivial specialization for 1x1 matrices - */ -template -struct tridiagonalization_inplace_selector -{ - typedef typename MatrixType::Scalar Scalar; - - template - static void run(MatrixType& mat, DiagonalType& diag, SubDiagonalType&, bool extractQ) - { - diag(0,0) = numext::real(mat(0,0)); - if(extractQ) - mat(0,0) = Scalar(1); - } -}; - -/** \internal - * \eigenvalues_module \ingroup Eigenvalues_Module - * - * \brief Expression type for return value of Tridiagonalization::matrixT() - * - * \tparam MatrixType type of underlying dense matrix - */ -template struct TridiagonalizationMatrixTReturnType -: public ReturnByValue > -{ - public: - /** \brief Constructor. - * - * \param[in] mat The underlying dense matrix - */ - TridiagonalizationMatrixTReturnType(const MatrixType& mat) : m_matrix(mat) { } - - template - inline void evalTo(ResultType& result) const - { - result.setZero(); - result.template diagonal<1>() = m_matrix.template diagonal<-1>().conjugate(); - result.diagonal() = m_matrix.diagonal(); - result.template diagonal<-1>() = m_matrix.template diagonal<-1>(); - } - - Index rows() const { return m_matrix.rows(); } - Index cols() const { return m_matrix.cols(); } - - protected: - typename MatrixType::Nested m_matrix; -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRIDIAGONALIZATION_H diff --git a/Eigen/src/Geometry/AlignedBox.h b/Eigen/src/Geometry/AlignedBox.h deleted file mode 100644 index c902d8f0a..000000000 --- a/Eigen/src/Geometry/AlignedBox.h +++ /dev/null @@ -1,392 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ALIGNEDBOX_H -#define EIGEN_ALIGNEDBOX_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * - * \class AlignedBox - * - * \brief An axis aligned box - * - * \tparam _Scalar the type of the scalar coefficients - * \tparam _AmbientDim the dimension of the ambient space, can be a compile time value or Dynamic. - * - * This class represents an axis aligned box as a pair of the minimal and maximal corners. - * \warning The result of most methods is undefined when applied to an empty box. You can check for empty boxes using isEmpty(). - * \sa alignedboxtypedefs - */ -template -class AlignedBox -{ -public: -EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_AmbientDim) - enum { AmbientDimAtCompileTime = _AmbientDim }; - typedef _Scalar Scalar; - typedef NumTraits ScalarTraits; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - typedef typename ScalarTraits::Real RealScalar; - typedef typename ScalarTraits::NonInteger NonInteger; - typedef Matrix VectorType; - typedef CwiseBinaryOp, const VectorType, const VectorType> VectorTypeSum; - - /** Define constants to name the corners of a 1D, 2D or 3D axis aligned bounding box */ - enum CornerType - { - /** 1D names @{ */ - Min=0, Max=1, - /** @} */ - - /** Identifier for 2D corner @{ */ - BottomLeft=0, BottomRight=1, - TopLeft=2, TopRight=3, - /** @} */ - - /** Identifier for 3D corner @{ */ - BottomLeftFloor=0, BottomRightFloor=1, - TopLeftFloor=2, TopRightFloor=3, - BottomLeftCeil=4, BottomRightCeil=5, - TopLeftCeil=6, TopRightCeil=7 - /** @} */ - }; - - - /** Default constructor initializing a null box. */ - EIGEN_DEVICE_FUNC inline AlignedBox() - { if (EIGEN_CONST_CONDITIONAL(AmbientDimAtCompileTime!=Dynamic)) setEmpty(); } - - /** Constructs a null box with \a _dim the dimension of the ambient space. */ - EIGEN_DEVICE_FUNC inline explicit AlignedBox(Index _dim) : m_min(_dim), m_max(_dim) - { setEmpty(); } - - /** Constructs a box with extremities \a _min and \a _max. - * \warning If either component of \a _min is larger than the same component of \a _max, the constructed box is empty. */ - template - EIGEN_DEVICE_FUNC inline AlignedBox(const OtherVectorType1& _min, const OtherVectorType2& _max) : m_min(_min), m_max(_max) {} - - /** Constructs a box containing a single point \a p. */ - template - EIGEN_DEVICE_FUNC inline explicit AlignedBox(const MatrixBase& p) : m_min(p), m_max(m_min) - { } - - EIGEN_DEVICE_FUNC ~AlignedBox() {} - - /** \returns the dimension in which the box holds */ - EIGEN_DEVICE_FUNC inline Index dim() const { return AmbientDimAtCompileTime==Dynamic ? m_min.size() : Index(AmbientDimAtCompileTime); } - - /** \deprecated use isEmpty() */ - EIGEN_DEVICE_FUNC inline bool isNull() const { return isEmpty(); } - - /** \deprecated use setEmpty() */ - EIGEN_DEVICE_FUNC inline void setNull() { setEmpty(); } - - /** \returns true if the box is empty. - * \sa setEmpty */ - EIGEN_DEVICE_FUNC inline bool isEmpty() const { return (m_min.array() > m_max.array()).any(); } - - /** Makes \c *this an empty box. - * \sa isEmpty */ - EIGEN_DEVICE_FUNC inline void setEmpty() - { - m_min.setConstant( ScalarTraits::highest() ); - m_max.setConstant( ScalarTraits::lowest() ); - } - - /** \returns the minimal corner */ - EIGEN_DEVICE_FUNC inline const VectorType& (min)() const { return m_min; } - /** \returns a non const reference to the minimal corner */ - EIGEN_DEVICE_FUNC inline VectorType& (min)() { return m_min; } - /** \returns the maximal corner */ - EIGEN_DEVICE_FUNC inline const VectorType& (max)() const { return m_max; } - /** \returns a non const reference to the maximal corner */ - EIGEN_DEVICE_FUNC inline VectorType& (max)() { return m_max; } - - /** \returns the center of the box */ - EIGEN_DEVICE_FUNC inline const EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(VectorTypeSum, RealScalar, quotient) - center() const - { return (m_min+m_max)/RealScalar(2); } - - /** \returns the lengths of the sides of the bounding box. - * Note that this function does not get the same - * result for integral or floating scalar types: see - */ - EIGEN_DEVICE_FUNC inline const CwiseBinaryOp< internal::scalar_difference_op, const VectorType, const VectorType> sizes() const - { return m_max - m_min; } - - /** \returns the volume of the bounding box */ - EIGEN_DEVICE_FUNC inline Scalar volume() const - { return sizes().prod(); } - - /** \returns an expression for the bounding box diagonal vector - * if the length of the diagonal is needed: diagonal().norm() - * will provide it. - */ - EIGEN_DEVICE_FUNC inline CwiseBinaryOp< internal::scalar_difference_op, const VectorType, const VectorType> diagonal() const - { return sizes(); } - - /** \returns the vertex of the bounding box at the corner defined by - * the corner-id corner. It works only for a 1D, 2D or 3D bounding box. - * For 1D bounding boxes corners are named by 2 enum constants: - * BottomLeft and BottomRight. - * For 2D bounding boxes, corners are named by 4 enum constants: - * BottomLeft, BottomRight, TopLeft, TopRight. - * For 3D bounding boxes, the following names are added: - * BottomLeftCeil, BottomRightCeil, TopLeftCeil, TopRightCeil. - */ - EIGEN_DEVICE_FUNC inline VectorType corner(CornerType corner) const - { - EIGEN_STATIC_ASSERT(_AmbientDim <= 3, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE); - - VectorType res; - - Index mult = 1; - for(Index d=0; d(Scalar(0), Scalar(1)); - } - else - r[d] = internal::random(m_min[d], m_max[d]); - } - return r; - } - - /** \returns true if the point \a p is inside the box \c *this. */ - template - EIGEN_DEVICE_FUNC inline bool contains(const MatrixBase& p) const - { - typename internal::nested_eval::type p_n(p.derived()); - return (m_min.array()<=p_n.array()).all() && (p_n.array()<=m_max.array()).all(); - } - - /** \returns true if the box \a b is entirely inside the box \c *this. */ - EIGEN_DEVICE_FUNC inline bool contains(const AlignedBox& b) const - { return (m_min.array()<=(b.min)().array()).all() && ((b.max)().array()<=m_max.array()).all(); } - - /** \returns true if the box \a b is intersecting the box \c *this. - * \sa intersection, clamp */ - EIGEN_DEVICE_FUNC inline bool intersects(const AlignedBox& b) const - { return (m_min.array()<=(b.max)().array()).all() && ((b.min)().array()<=m_max.array()).all(); } - - /** Extends \c *this such that it contains the point \a p and returns a reference to \c *this. - * \sa extend(const AlignedBox&) */ - template - EIGEN_DEVICE_FUNC inline AlignedBox& extend(const MatrixBase& p) - { - typename internal::nested_eval::type p_n(p.derived()); - m_min = m_min.cwiseMin(p_n); - m_max = m_max.cwiseMax(p_n); - return *this; - } - - /** Extends \c *this such that it contains the box \a b and returns a reference to \c *this. - * \sa merged, extend(const MatrixBase&) */ - EIGEN_DEVICE_FUNC inline AlignedBox& extend(const AlignedBox& b) - { - m_min = m_min.cwiseMin(b.m_min); - m_max = m_max.cwiseMax(b.m_max); - return *this; - } - - /** Clamps \c *this by the box \a b and returns a reference to \c *this. - * \note If the boxes don't intersect, the resulting box is empty. - * \sa intersection(), intersects() */ - EIGEN_DEVICE_FUNC inline AlignedBox& clamp(const AlignedBox& b) - { - m_min = m_min.cwiseMax(b.m_min); - m_max = m_max.cwiseMin(b.m_max); - return *this; - } - - /** Returns an AlignedBox that is the intersection of \a b and \c *this - * \note If the boxes don't intersect, the resulting box is empty. - * \sa intersects(), clamp, contains() */ - EIGEN_DEVICE_FUNC inline AlignedBox intersection(const AlignedBox& b) const - {return AlignedBox(m_min.cwiseMax(b.m_min), m_max.cwiseMin(b.m_max)); } - - /** Returns an AlignedBox that is the union of \a b and \c *this. - * \note Merging with an empty box may result in a box bigger than \c *this. - * \sa extend(const AlignedBox&) */ - EIGEN_DEVICE_FUNC inline AlignedBox merged(const AlignedBox& b) const - { return AlignedBox(m_min.cwiseMin(b.m_min), m_max.cwiseMax(b.m_max)); } - - /** Translate \c *this by the vector \a t and returns a reference to \c *this. */ - template - EIGEN_DEVICE_FUNC inline AlignedBox& translate(const MatrixBase& a_t) - { - const typename internal::nested_eval::type t(a_t.derived()); - m_min += t; - m_max += t; - return *this; - } - - /** \returns the squared distance between the point \a p and the box \c *this, - * and zero if \a p is inside the box. - * \sa exteriorDistance(const MatrixBase&), squaredExteriorDistance(const AlignedBox&) - */ - template - EIGEN_DEVICE_FUNC inline Scalar squaredExteriorDistance(const MatrixBase& p) const; - - /** \returns the squared distance between the boxes \a b and \c *this, - * and zero if the boxes intersect. - * \sa exteriorDistance(const AlignedBox&), squaredExteriorDistance(const MatrixBase&) - */ - EIGEN_DEVICE_FUNC inline Scalar squaredExteriorDistance(const AlignedBox& b) const; - - /** \returns the distance between the point \a p and the box \c *this, - * and zero if \a p is inside the box. - * \sa squaredExteriorDistance(const MatrixBase&), exteriorDistance(const AlignedBox&) - */ - template - EIGEN_DEVICE_FUNC inline NonInteger exteriorDistance(const MatrixBase& p) const - { EIGEN_USING_STD_MATH(sqrt) return sqrt(NonInteger(squaredExteriorDistance(p))); } - - /** \returns the distance between the boxes \a b and \c *this, - * and zero if the boxes intersect. - * \sa squaredExteriorDistance(const AlignedBox&), exteriorDistance(const MatrixBase&) - */ - EIGEN_DEVICE_FUNC inline NonInteger exteriorDistance(const AlignedBox& b) const - { EIGEN_USING_STD_MATH(sqrt) return sqrt(NonInteger(squaredExteriorDistance(b))); } - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { - return typename internal::cast_return_type >::type(*this); - } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit AlignedBox(const AlignedBox& other) - { - m_min = (other.min)().template cast(); - m_max = (other.max)().template cast(); - } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - EIGEN_DEVICE_FUNC bool isApprox(const AlignedBox& other, const RealScalar& prec = ScalarTraits::dummy_precision()) const - { return m_min.isApprox(other.m_min, prec) && m_max.isApprox(other.m_max, prec); } - -protected: - - VectorType m_min, m_max; -}; - - - -template -template -EIGEN_DEVICE_FUNC inline Scalar AlignedBox::squaredExteriorDistance(const MatrixBase& a_p) const -{ - typename internal::nested_eval::type p(a_p.derived()); - Scalar dist2(0); - Scalar aux; - for (Index k=0; k p[k] ) - { - aux = m_min[k] - p[k]; - dist2 += aux*aux; - } - else if( p[k] > m_max[k] ) - { - aux = p[k] - m_max[k]; - dist2 += aux*aux; - } - } - return dist2; -} - -template -EIGEN_DEVICE_FUNC inline Scalar AlignedBox::squaredExteriorDistance(const AlignedBox& b) const -{ - Scalar dist2(0); - Scalar aux; - for (Index k=0; k b.m_max[k] ) - { - aux = m_min[k] - b.m_max[k]; - dist2 += aux*aux; - } - else if( b.m_min[k] > m_max[k] ) - { - aux = b.m_min[k] - m_max[k]; - dist2 += aux*aux; - } - } - return dist2; -} - -/** \defgroup alignedboxtypedefs Global aligned box typedefs - * - * \ingroup Geometry_Module - * - * Eigen defines several typedef shortcuts for most common aligned box types. - * - * The general patterns are the following: - * - * \c AlignedBoxSizeType where \c Size can be \c 1, \c 2,\c 3,\c 4 for fixed size boxes or \c X for dynamic size, - * and where \c Type can be \c i for integer, \c f for float, \c d for double. - * - * For example, \c AlignedBox3d is a fixed-size 3x3 aligned box type of doubles, and \c AlignedBoxXf is a dynamic-size aligned box of floats. - * - * \sa class AlignedBox - */ - -#define EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, Size, SizeSuffix) \ -/** \ingroup alignedboxtypedefs */ \ -typedef AlignedBox AlignedBox##SizeSuffix##TypeSuffix; - -#define EIGEN_MAKE_TYPEDEFS_ALL_SIZES(Type, TypeSuffix) \ -EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 1, 1) \ -EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 2, 2) \ -EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 3, 3) \ -EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, 4, 4) \ -EIGEN_MAKE_TYPEDEFS(Type, TypeSuffix, Dynamic, X) - -EIGEN_MAKE_TYPEDEFS_ALL_SIZES(int, i) -EIGEN_MAKE_TYPEDEFS_ALL_SIZES(float, f) -EIGEN_MAKE_TYPEDEFS_ALL_SIZES(double, d) - -#undef EIGEN_MAKE_TYPEDEFS_ALL_SIZES -#undef EIGEN_MAKE_TYPEDEFS - -} // end namespace Eigen - -#endif // EIGEN_ALIGNEDBOX_H diff --git a/Eigen/src/Geometry/AngleAxis.h b/Eigen/src/Geometry/AngleAxis.h deleted file mode 100644 index 83ee1be46..000000000 --- a/Eigen/src/Geometry/AngleAxis.h +++ /dev/null @@ -1,247 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ANGLEAXIS_H -#define EIGEN_ANGLEAXIS_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class AngleAxis - * - * \brief Represents a 3D rotation as a rotation angle around an arbitrary 3D axis - * - * \param _Scalar the scalar type, i.e., the type of the coefficients. - * - * \warning When setting up an AngleAxis object, the axis vector \b must \b be \b normalized. - * - * The following two typedefs are provided for convenience: - * \li \c AngleAxisf for \c float - * \li \c AngleAxisd for \c double - * - * Combined with MatrixBase::Unit{X,Y,Z}, AngleAxis can be used to easily - * mimic Euler-angles. Here is an example: - * \include AngleAxis_mimic_euler.cpp - * Output: \verbinclude AngleAxis_mimic_euler.out - * - * \note This class is not aimed to be used to store a rotation transformation, - * but rather to make easier the creation of other rotation (Quaternion, rotation Matrix) - * and transformation objects. - * - * \sa class Quaternion, class Transform, MatrixBase::UnitX() - */ - -namespace internal { -template struct traits > -{ - typedef _Scalar Scalar; -}; -} - -template -class AngleAxis : public RotationBase,3> -{ - typedef RotationBase,3> Base; - -public: - - using Base::operator*; - - enum { Dim = 3 }; - /** the scalar type of the coefficients */ - typedef _Scalar Scalar; - typedef Matrix Matrix3; - typedef Matrix Vector3; - typedef Quaternion QuaternionType; - -protected: - - Vector3 m_axis; - Scalar m_angle; - -public: - - /** Default constructor without initialization. */ - EIGEN_DEVICE_FUNC AngleAxis() {} - /** Constructs and initialize the angle-axis rotation from an \a angle in radian - * and an \a axis which \b must \b be \b normalized. - * - * \warning If the \a axis vector is not normalized, then the angle-axis object - * represents an invalid rotation. */ - template - EIGEN_DEVICE_FUNC - inline AngleAxis(const Scalar& angle, const MatrixBase& axis) : m_axis(axis), m_angle(angle) {} - /** Constructs and initialize the angle-axis rotation from a quaternion \a q. - * This function implicitly normalizes the quaternion \a q. - */ - template - EIGEN_DEVICE_FUNC inline explicit AngleAxis(const QuaternionBase& q) { *this = q; } - /** Constructs and initialize the angle-axis rotation from a 3x3 rotation matrix. */ - template - EIGEN_DEVICE_FUNC inline explicit AngleAxis(const MatrixBase& m) { *this = m; } - - /** \returns the value of the rotation angle in radian */ - EIGEN_DEVICE_FUNC Scalar angle() const { return m_angle; } - /** \returns a read-write reference to the stored angle in radian */ - EIGEN_DEVICE_FUNC Scalar& angle() { return m_angle; } - - /** \returns the rotation axis */ - EIGEN_DEVICE_FUNC const Vector3& axis() const { return m_axis; } - /** \returns a read-write reference to the stored rotation axis. - * - * \warning The rotation axis must remain a \b unit vector. - */ - EIGEN_DEVICE_FUNC Vector3& axis() { return m_axis; } - - /** Concatenates two rotations */ - EIGEN_DEVICE_FUNC inline QuaternionType operator* (const AngleAxis& other) const - { return QuaternionType(*this) * QuaternionType(other); } - - /** Concatenates two rotations */ - EIGEN_DEVICE_FUNC inline QuaternionType operator* (const QuaternionType& other) const - { return QuaternionType(*this) * other; } - - /** Concatenates two rotations */ - friend EIGEN_DEVICE_FUNC inline QuaternionType operator* (const QuaternionType& a, const AngleAxis& b) - { return a * QuaternionType(b); } - - /** \returns the inverse rotation, i.e., an angle-axis with opposite rotation angle */ - EIGEN_DEVICE_FUNC AngleAxis inverse() const - { return AngleAxis(-m_angle, m_axis); } - - template - EIGEN_DEVICE_FUNC AngleAxis& operator=(const QuaternionBase& q); - template - EIGEN_DEVICE_FUNC AngleAxis& operator=(const MatrixBase& m); - - template - EIGEN_DEVICE_FUNC AngleAxis& fromRotationMatrix(const MatrixBase& m); - EIGEN_DEVICE_FUNC Matrix3 toRotationMatrix(void) const; - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { return typename internal::cast_return_type >::type(*this); } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit AngleAxis(const AngleAxis& other) - { - m_axis = other.axis().template cast(); - m_angle = Scalar(other.angle()); - } - - EIGEN_DEVICE_FUNC static inline const AngleAxis Identity() { return AngleAxis(Scalar(0), Vector3::UnitX()); } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - EIGEN_DEVICE_FUNC bool isApprox(const AngleAxis& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return m_axis.isApprox(other.m_axis, prec) && internal::isApprox(m_angle,other.m_angle, prec); } -}; - -/** \ingroup Geometry_Module - * single precision angle-axis type */ -typedef AngleAxis AngleAxisf; -/** \ingroup Geometry_Module - * double precision angle-axis type */ -typedef AngleAxis AngleAxisd; - -/** Set \c *this from a \b unit quaternion. - * - * The resulting axis is normalized, and the computed angle is in the [0,pi] range. - * - * This function implicitly normalizes the quaternion \a q. - */ -template -template -EIGEN_DEVICE_FUNC AngleAxis& AngleAxis::operator=(const QuaternionBase& q) -{ - EIGEN_USING_STD_MATH(atan2) - EIGEN_USING_STD_MATH(abs) - Scalar n = q.vec().norm(); - if(n::epsilon()) - n = q.vec().stableNorm(); - - if (n != Scalar(0)) - { - m_angle = Scalar(2)*atan2(n, abs(q.w())); - if(q.w() < Scalar(0)) - n = -n; - m_axis = q.vec() / n; - } - else - { - m_angle = Scalar(0); - m_axis << Scalar(1), Scalar(0), Scalar(0); - } - return *this; -} - -/** Set \c *this from a 3x3 rotation matrix \a mat. - */ -template -template -EIGEN_DEVICE_FUNC AngleAxis& AngleAxis::operator=(const MatrixBase& mat) -{ - // Since a direct conversion would not be really faster, - // let's use the robust Quaternion implementation: - return *this = QuaternionType(mat); -} - -/** -* \brief Sets \c *this from a 3x3 rotation matrix. -**/ -template -template -EIGEN_DEVICE_FUNC AngleAxis& AngleAxis::fromRotationMatrix(const MatrixBase& mat) -{ - return *this = QuaternionType(mat); -} - -/** Constructs and \returns an equivalent 3x3 rotation matrix. - */ -template -typename AngleAxis::Matrix3 -EIGEN_DEVICE_FUNC AngleAxis::toRotationMatrix(void) const -{ - EIGEN_USING_STD_MATH(sin) - EIGEN_USING_STD_MATH(cos) - Matrix3 res; - Vector3 sin_axis = sin(m_angle) * m_axis; - Scalar c = cos(m_angle); - Vector3 cos1_axis = (Scalar(1)-c) * m_axis; - - Scalar tmp; - tmp = cos1_axis.x() * m_axis.y(); - res.coeffRef(0,1) = tmp - sin_axis.z(); - res.coeffRef(1,0) = tmp + sin_axis.z(); - - tmp = cos1_axis.x() * m_axis.z(); - res.coeffRef(0,2) = tmp + sin_axis.y(); - res.coeffRef(2,0) = tmp - sin_axis.y(); - - tmp = cos1_axis.y() * m_axis.z(); - res.coeffRef(1,2) = tmp - sin_axis.x(); - res.coeffRef(2,1) = tmp + sin_axis.x(); - - res.diagonal() = (cos1_axis.cwiseProduct(m_axis)).array() + c; - - return res; -} - -} // end namespace Eigen - -#endif // EIGEN_ANGLEAXIS_H diff --git a/Eigen/src/Geometry/EulerAngles.h b/Eigen/src/Geometry/EulerAngles.h deleted file mode 100644 index c633268af..000000000 --- a/Eigen/src/Geometry/EulerAngles.h +++ /dev/null @@ -1,114 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_EULERANGLES_H -#define EIGEN_EULERANGLES_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * - * \returns the Euler-angles of the rotation matrix \c *this using the convention defined by the triplet (\a a0,\a a1,\a a2) - * - * Each of the three parameters \a a0,\a a1,\a a2 represents the respective rotation axis as an integer in {0,1,2}. - * For instance, in: - * \code Vector3f ea = mat.eulerAngles(2, 0, 2); \endcode - * "2" represents the z axis and "0" the x axis, etc. The returned angles are such that - * we have the following equality: - * \code - * mat == AngleAxisf(ea[0], Vector3f::UnitZ()) - * * AngleAxisf(ea[1], Vector3f::UnitX()) - * * AngleAxisf(ea[2], Vector3f::UnitZ()); \endcode - * This corresponds to the right-multiply conventions (with right hand side frames). - * - * The returned angles are in the ranges [0:pi]x[-pi:pi]x[-pi:pi]. - * - * \sa class AngleAxis - */ -template -EIGEN_DEVICE_FUNC inline Matrix::Scalar,3,1> -MatrixBase::eulerAngles(Index a0, Index a1, Index a2) const -{ - EIGEN_USING_STD_MATH(atan2) - EIGEN_USING_STD_MATH(sin) - EIGEN_USING_STD_MATH(cos) - /* Implemented from Graphics Gems IV */ - EIGEN_STATIC_ASSERT_MATRIX_SPECIFIC_SIZE(Derived,3,3) - - Matrix res; - typedef Matrix Vector2; - - const Index odd = ((a0+1)%3 == a1) ? 0 : 1; - const Index i = a0; - const Index j = (a0 + 1 + odd)%3; - const Index k = (a0 + 2 - odd)%3; - - if (a0==a2) - { - res[0] = atan2(coeff(j,i), coeff(k,i)); - if((odd && res[0]Scalar(0))) - { - if(res[0] > Scalar(0)) { - res[0] -= Scalar(EIGEN_PI); - } - else { - res[0] += Scalar(EIGEN_PI); - } - Scalar s2 = Vector2(coeff(j,i), coeff(k,i)).norm(); - res[1] = -atan2(s2, coeff(i,i)); - } - else - { - Scalar s2 = Vector2(coeff(j,i), coeff(k,i)).norm(); - res[1] = atan2(s2, coeff(i,i)); - } - - // With a=(0,1,0), we have i=0; j=1; k=2, and after computing the first two angles, - // we can compute their respective rotation, and apply its inverse to M. Since the result must - // be a rotation around x, we have: - // - // c2 s1.s2 c1.s2 1 0 0 - // 0 c1 -s1 * M = 0 c3 s3 - // -s2 s1.c2 c1.c2 0 -s3 c3 - // - // Thus: m11.c1 - m21.s1 = c3 & m12.c1 - m22.s1 = s3 - - Scalar s1 = sin(res[0]); - Scalar c1 = cos(res[0]); - res[2] = atan2(c1*coeff(j,k)-s1*coeff(k,k), c1*coeff(j,j) - s1 * coeff(k,j)); - } - else - { - res[0] = atan2(coeff(j,k), coeff(k,k)); - Scalar c2 = Vector2(coeff(i,i), coeff(i,j)).norm(); - if((odd && res[0]Scalar(0))) { - if(res[0] > Scalar(0)) { - res[0] -= Scalar(EIGEN_PI); - } - else { - res[0] += Scalar(EIGEN_PI); - } - res[1] = atan2(-coeff(i,k), -c2); - } - else - res[1] = atan2(-coeff(i,k), c2); - Scalar s1 = sin(res[0]); - Scalar c1 = cos(res[0]); - res[2] = atan2(s1*coeff(k,i)-c1*coeff(j,i), c1*coeff(j,j) - s1 * coeff(k,j)); - } - if (!odd) - res = -res; - - return res; -} - -} // end namespace Eigen - -#endif // EIGEN_EULERANGLES_H diff --git a/Eigen/src/Geometry/Homogeneous.h b/Eigen/src/Geometry/Homogeneous.h deleted file mode 100644 index 5f0da1a9e..000000000 --- a/Eigen/src/Geometry/Homogeneous.h +++ /dev/null @@ -1,497 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_HOMOGENEOUS_H -#define EIGEN_HOMOGENEOUS_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class Homogeneous - * - * \brief Expression of one (or a set of) homogeneous vector(s) - * - * \param MatrixType the type of the object in which we are making homogeneous - * - * This class represents an expression of one (or a set of) homogeneous vector(s). - * It is the return type of MatrixBase::homogeneous() and most of the time - * this is the only way it is used. - * - * \sa MatrixBase::homogeneous() - */ - -namespace internal { - -template -struct traits > - : traits -{ - typedef typename traits::StorageKind StorageKind; - typedef typename ref_selector::type MatrixTypeNested; - typedef typename remove_reference::type _MatrixTypeNested; - enum { - RowsPlusOne = (MatrixType::RowsAtCompileTime != Dynamic) ? - int(MatrixType::RowsAtCompileTime) + 1 : Dynamic, - ColsPlusOne = (MatrixType::ColsAtCompileTime != Dynamic) ? - int(MatrixType::ColsAtCompileTime) + 1 : Dynamic, - RowsAtCompileTime = Direction==Vertical ? RowsPlusOne : MatrixType::RowsAtCompileTime, - ColsAtCompileTime = Direction==Horizontal ? ColsPlusOne : MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = RowsAtCompileTime, - MaxColsAtCompileTime = ColsAtCompileTime, - TmpFlags = _MatrixTypeNested::Flags & HereditaryBits, - Flags = ColsAtCompileTime==1 ? (TmpFlags & ~RowMajorBit) - : RowsAtCompileTime==1 ? (TmpFlags | RowMajorBit) - : TmpFlags - }; -}; - -template struct homogeneous_left_product_impl; -template struct homogeneous_right_product_impl; - -} // end namespace internal - -template class Homogeneous - : public MatrixBase >, internal::no_assignment_operator -{ - public: - - typedef MatrixType NestedExpression; - enum { Direction = _Direction }; - - typedef MatrixBase Base; - EIGEN_DENSE_PUBLIC_INTERFACE(Homogeneous) - - EIGEN_DEVICE_FUNC explicit inline Homogeneous(const MatrixType& matrix) - : m_matrix(matrix) - {} - - EIGEN_DEVICE_FUNC inline Index rows() const { return m_matrix.rows() + (int(Direction)==Vertical ? 1 : 0); } - EIGEN_DEVICE_FUNC inline Index cols() const { return m_matrix.cols() + (int(Direction)==Horizontal ? 1 : 0); } - - EIGEN_DEVICE_FUNC const NestedExpression& nestedExpression() const { return m_matrix; } - - template - EIGEN_DEVICE_FUNC inline const Product - operator* (const MatrixBase& rhs) const - { - eigen_assert(int(Direction)==Horizontal); - return Product(*this,rhs.derived()); - } - - template friend - EIGEN_DEVICE_FUNC inline const Product - operator* (const MatrixBase& lhs, const Homogeneous& rhs) - { - eigen_assert(int(Direction)==Vertical); - return Product(lhs.derived(),rhs); - } - - template friend - EIGEN_DEVICE_FUNC inline const Product, Homogeneous > - operator* (const Transform& lhs, const Homogeneous& rhs) - { - eigen_assert(int(Direction)==Vertical); - return Product, Homogeneous>(lhs,rhs); - } - - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::result_of::type - redux(const Func& func) const - { - return func(m_matrix.redux(func), Scalar(1)); - } - - protected: - typename MatrixType::Nested m_matrix; -}; - -/** \geometry_module \ingroup Geometry_Module - * - * \returns a vector expression that is one longer than the vector argument, with the value 1 symbolically appended as the last coefficient. - * - * This can be used to convert affine coordinates to homogeneous coordinates. - * - * \only_for_vectors - * - * Example: \include MatrixBase_homogeneous.cpp - * Output: \verbinclude MatrixBase_homogeneous.out - * - * \sa VectorwiseOp::homogeneous(), class Homogeneous - */ -template -EIGEN_DEVICE_FUNC inline typename MatrixBase::HomogeneousReturnType -MatrixBase::homogeneous() const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); - return HomogeneousReturnType(derived()); -} - -/** \geometry_module \ingroup Geometry_Module - * - * \returns an expression where the value 1 is symbolically appended as the final coefficient to each column (or row) of the matrix. - * - * This can be used to convert affine coordinates to homogeneous coordinates. - * - * Example: \include VectorwiseOp_homogeneous.cpp - * Output: \verbinclude VectorwiseOp_homogeneous.out - * - * \sa MatrixBase::homogeneous(), class Homogeneous */ -template -EIGEN_DEVICE_FUNC inline Homogeneous -VectorwiseOp::homogeneous() const -{ - return HomogeneousReturnType(_expression()); -} - -/** \geometry_module \ingroup Geometry_Module - * - * \brief homogeneous normalization - * - * \returns a vector expression of the N-1 first coefficients of \c *this divided by that last coefficient. - * - * This can be used to convert homogeneous coordinates to affine coordinates. - * - * It is essentially a shortcut for: - * \code - this->head(this->size()-1)/this->coeff(this->size()-1); - \endcode - * - * Example: \include MatrixBase_hnormalized.cpp - * Output: \verbinclude MatrixBase_hnormalized.out - * - * \sa VectorwiseOp::hnormalized() */ -template -EIGEN_DEVICE_FUNC inline const typename MatrixBase::HNormalizedReturnType -MatrixBase::hnormalized() const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); - return ConstStartMinusOne(derived(),0,0, - ColsAtCompileTime==1?size()-1:1, - ColsAtCompileTime==1?1:size()-1) / coeff(size()-1); -} - -/** \geometry_module \ingroup Geometry_Module - * - * \brief column or row-wise homogeneous normalization - * - * \returns an expression of the first N-1 coefficients of each column (or row) of \c *this divided by the last coefficient of each column (or row). - * - * This can be used to convert homogeneous coordinates to affine coordinates. - * - * It is conceptually equivalent to calling MatrixBase::hnormalized() to each column (or row) of \c *this. - * - * Example: \include DirectionWise_hnormalized.cpp - * Output: \verbinclude DirectionWise_hnormalized.out - * - * \sa MatrixBase::hnormalized() */ -template -EIGEN_DEVICE_FUNC inline const typename VectorwiseOp::HNormalizedReturnType -VectorwiseOp::hnormalized() const -{ - return HNormalized_Block(_expression(),0,0, - Direction==Vertical ? _expression().rows()-1 : _expression().rows(), - Direction==Horizontal ? _expression().cols()-1 : _expression().cols()).cwiseQuotient( - Replicate - (HNormalized_Factors(_expression(), - Direction==Vertical ? _expression().rows()-1:0, - Direction==Horizontal ? _expression().cols()-1:0, - Direction==Vertical ? 1 : _expression().rows(), - Direction==Horizontal ? 1 : _expression().cols()), - Direction==Vertical ? _expression().rows()-1 : 1, - Direction==Horizontal ? _expression().cols()-1 : 1)); -} - -namespace internal { - -template -struct take_matrix_for_product -{ - typedef MatrixOrTransformType type; - EIGEN_DEVICE_FUNC static const type& run(const type &x) { return x; } -}; - -template -struct take_matrix_for_product > -{ - typedef Transform TransformType; - typedef typename internal::add_const::type type; - EIGEN_DEVICE_FUNC static type run (const TransformType& x) { return x.affine(); } -}; - -template -struct take_matrix_for_product > -{ - typedef Transform TransformType; - typedef typename TransformType::MatrixType type; - EIGEN_DEVICE_FUNC static const type& run (const TransformType& x) { return x.matrix(); } -}; - -template -struct traits,Lhs> > -{ - typedef typename take_matrix_for_product::type LhsMatrixType; - typedef typename remove_all::type MatrixTypeCleaned; - typedef typename remove_all::type LhsMatrixTypeCleaned; - typedef typename make_proper_matrix_type< - typename traits::Scalar, - LhsMatrixTypeCleaned::RowsAtCompileTime, - MatrixTypeCleaned::ColsAtCompileTime, - MatrixTypeCleaned::PlainObject::Options, - LhsMatrixTypeCleaned::MaxRowsAtCompileTime, - MatrixTypeCleaned::MaxColsAtCompileTime>::type ReturnType; -}; - -template -struct homogeneous_left_product_impl,Lhs> - : public ReturnByValue,Lhs> > -{ - typedef typename traits::LhsMatrixType LhsMatrixType; - typedef typename remove_all::type LhsMatrixTypeCleaned; - typedef typename remove_all::type LhsMatrixTypeNested; - EIGEN_DEVICE_FUNC homogeneous_left_product_impl(const Lhs& lhs, const MatrixType& rhs) - : m_lhs(take_matrix_for_product::run(lhs)), - m_rhs(rhs) - {} - - EIGEN_DEVICE_FUNC inline Index rows() const { return m_lhs.rows(); } - EIGEN_DEVICE_FUNC inline Index cols() const { return m_rhs.cols(); } - - template EIGEN_DEVICE_FUNC void evalTo(Dest& dst) const - { - // FIXME investigate how to allow lazy evaluation of this product when possible - dst = Block - (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs; - dst += m_lhs.col(m_lhs.cols()-1).rowwise() - .template replicate(m_rhs.cols()); - } - - typename LhsMatrixTypeCleaned::Nested m_lhs; - typename MatrixType::Nested m_rhs; -}; - -template -struct traits,Rhs> > -{ - typedef typename make_proper_matrix_type::Scalar, - MatrixType::RowsAtCompileTime, - Rhs::ColsAtCompileTime, - MatrixType::PlainObject::Options, - MatrixType::MaxRowsAtCompileTime, - Rhs::MaxColsAtCompileTime>::type ReturnType; -}; - -template -struct homogeneous_right_product_impl,Rhs> - : public ReturnByValue,Rhs> > -{ - typedef typename remove_all::type RhsNested; - EIGEN_DEVICE_FUNC homogeneous_right_product_impl(const MatrixType& lhs, const Rhs& rhs) - : m_lhs(lhs), m_rhs(rhs) - {} - - EIGEN_DEVICE_FUNC inline Index rows() const { return m_lhs.rows(); } - EIGEN_DEVICE_FUNC inline Index cols() const { return m_rhs.cols(); } - - template EIGEN_DEVICE_FUNC void evalTo(Dest& dst) const - { - // FIXME investigate how to allow lazy evaluation of this product when possible - dst = m_lhs * Block - (m_rhs,0,0,m_rhs.rows()-1,m_rhs.cols()); - dst += m_rhs.row(m_rhs.rows()-1).colwise() - .template replicate(m_lhs.rows()); - } - - typename MatrixType::Nested m_lhs; - typename Rhs::Nested m_rhs; -}; - -template -struct evaluator_traits > -{ - typedef typename storage_kind_to_evaluator_kind::Kind Kind; - typedef HomogeneousShape Shape; -}; - -template<> struct AssignmentKind { typedef Dense2Dense Kind; }; - - -template -struct unary_evaluator, IndexBased> - : evaluator::PlainObject > -{ - typedef Homogeneous XprType; - typedef typename XprType::PlainObject PlainObject; - typedef evaluator Base; - - EIGEN_DEVICE_FUNC explicit unary_evaluator(const XprType& op) - : Base(), m_temp(op) - { - ::new (static_cast(this)) Base(m_temp); - } - -protected: - PlainObject m_temp; -}; - -// dense = homogeneous -template< typename DstXprType, typename ArgType, typename Scalar> -struct Assignment, internal::assign_op, Dense2Dense> -{ - typedef Homogeneous SrcXprType; - EIGEN_DEVICE_FUNC static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - dst.template topRows(src.nestedExpression().rows()) = src.nestedExpression(); - dst.row(dst.rows()-1).setOnes(); - } -}; - -// dense = homogeneous -template< typename DstXprType, typename ArgType, typename Scalar> -struct Assignment, internal::assign_op, Dense2Dense> -{ - typedef Homogeneous SrcXprType; - EIGEN_DEVICE_FUNC static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - dst.template leftCols(src.nestedExpression().cols()) = src.nestedExpression(); - dst.col(dst.cols()-1).setOnes(); - } -}; - -template -struct generic_product_impl, Rhs, HomogeneousShape, DenseShape, ProductTag> -{ - template - EIGEN_DEVICE_FUNC static void evalTo(Dest& dst, const Homogeneous& lhs, const Rhs& rhs) - { - homogeneous_right_product_impl, Rhs>(lhs.nestedExpression(), rhs).evalTo(dst); - } -}; - -template -struct homogeneous_right_product_refactoring_helper -{ - enum { - Dim = Lhs::ColsAtCompileTime, - Rows = Lhs::RowsAtCompileTime - }; - typedef typename Rhs::template ConstNRowsBlockXpr::Type LinearBlockConst; - typedef typename remove_const::type LinearBlock; - typedef typename Rhs::ConstRowXpr ConstantColumn; - typedef Replicate ConstantBlock; - typedef Product LinearProduct; - typedef CwiseBinaryOp, const LinearProduct, const ConstantBlock> Xpr; -}; - -template -struct product_evaluator, ProductTag, HomogeneousShape, DenseShape> - : public evaluator::Xpr> -{ - typedef Product XprType; - typedef homogeneous_right_product_refactoring_helper helper; - typedef typename helper::ConstantBlock ConstantBlock; - typedef typename helper::Xpr RefactoredXpr; - typedef evaluator Base; - - EIGEN_DEVICE_FUNC explicit product_evaluator(const XprType& xpr) - : Base( xpr.lhs().nestedExpression() .lazyProduct( xpr.rhs().template topRows(xpr.lhs().nestedExpression().cols()) ) - + ConstantBlock(xpr.rhs().row(xpr.rhs().rows()-1),xpr.lhs().rows(), 1) ) - {} -}; - -template -struct generic_product_impl, DenseShape, HomogeneousShape, ProductTag> -{ - template - EIGEN_DEVICE_FUNC static void evalTo(Dest& dst, const Lhs& lhs, const Homogeneous& rhs) - { - homogeneous_left_product_impl, Lhs>(lhs, rhs.nestedExpression()).evalTo(dst); - } -}; - -// TODO: the following specialization is to address a regression from 3.2 to 3.3 -// In the future, this path should be optimized. -template -struct generic_product_impl, TriangularShape, HomogeneousShape, ProductTag> -{ - template - static void evalTo(Dest& dst, const Lhs& lhs, const Homogeneous& rhs) - { - dst.noalias() = lhs * rhs.eval(); - } -}; - -template -struct homogeneous_left_product_refactoring_helper -{ - enum { - Dim = Rhs::RowsAtCompileTime, - Cols = Rhs::ColsAtCompileTime - }; - typedef typename Lhs::template ConstNColsBlockXpr::Type LinearBlockConst; - typedef typename remove_const::type LinearBlock; - typedef typename Lhs::ConstColXpr ConstantColumn; - typedef Replicate ConstantBlock; - typedef Product LinearProduct; - typedef CwiseBinaryOp, const LinearProduct, const ConstantBlock> Xpr; -}; - -template -struct product_evaluator, ProductTag, DenseShape, HomogeneousShape> - : public evaluator::Xpr> -{ - typedef Product XprType; - typedef homogeneous_left_product_refactoring_helper helper; - typedef typename helper::ConstantBlock ConstantBlock; - typedef typename helper::Xpr RefactoredXpr; - typedef evaluator Base; - - EIGEN_DEVICE_FUNC explicit product_evaluator(const XprType& xpr) - : Base( xpr.lhs().template leftCols(xpr.rhs().nestedExpression().rows()) .lazyProduct( xpr.rhs().nestedExpression() ) - + ConstantBlock(xpr.lhs().col(xpr.lhs().cols()-1),1,xpr.rhs().cols()) ) - {} -}; - -template -struct generic_product_impl, Homogeneous, DenseShape, HomogeneousShape, ProductTag> -{ - typedef Transform TransformType; - template - EIGEN_DEVICE_FUNC static void evalTo(Dest& dst, const TransformType& lhs, const Homogeneous& rhs) - { - homogeneous_left_product_impl, TransformType>(lhs, rhs.nestedExpression()).evalTo(dst); - } -}; - -template -struct permutation_matrix_product - : public permutation_matrix_product -{}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_HOMOGENEOUS_H diff --git a/Eigen/src/Geometry/Hyperplane.h b/Eigen/src/Geometry/Hyperplane.h deleted file mode 100644 index 05929b299..000000000 --- a/Eigen/src/Geometry/Hyperplane.h +++ /dev/null @@ -1,282 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_HYPERPLANE_H -#define EIGEN_HYPERPLANE_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class Hyperplane - * - * \brief A hyperplane - * - * A hyperplane is an affine subspace of dimension n-1 in a space of dimension n. - * For example, a hyperplane in a plane is a line; a hyperplane in 3-space is a plane. - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients - * \tparam _AmbientDim the dimension of the ambient space, can be a compile time value or Dynamic. - * Notice that the dimension of the hyperplane is _AmbientDim-1. - * - * This class represents an hyperplane as the zero set of the implicit equation - * \f$ n \cdot x + d = 0 \f$ where \f$ n \f$ is a unit normal vector of the plane (linear part) - * and \f$ d \f$ is the distance (offset) to the origin. - */ -template -class Hyperplane -{ -public: - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1) - enum { - AmbientDimAtCompileTime = _AmbientDim, - Options = _Options - }; - typedef _Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - typedef Matrix VectorType; - typedef Matrix Coefficients; - typedef Block NormalReturnType; - typedef const Block ConstNormalReturnType; - - /** Default constructor without initialization */ - EIGEN_DEVICE_FUNC inline Hyperplane() {} - - template - EIGEN_DEVICE_FUNC Hyperplane(const Hyperplane& other) - : m_coeffs(other.coeffs()) - {} - - /** Constructs a dynamic-size hyperplane with \a _dim the dimension - * of the ambient space */ - EIGEN_DEVICE_FUNC inline explicit Hyperplane(Index _dim) : m_coeffs(_dim+1) {} - - /** Construct a plane from its normal \a n and a point \a e onto the plane. - * \warning the vector normal is assumed to be normalized. - */ - EIGEN_DEVICE_FUNC inline Hyperplane(const VectorType& n, const VectorType& e) - : m_coeffs(n.size()+1) - { - normal() = n; - offset() = -n.dot(e); - } - - /** Constructs a plane from its normal \a n and distance to the origin \a d - * such that the algebraic equation of the plane is \f$ n \cdot x + d = 0 \f$. - * \warning the vector normal is assumed to be normalized. - */ - EIGEN_DEVICE_FUNC inline Hyperplane(const VectorType& n, const Scalar& d) - : m_coeffs(n.size()+1) - { - normal() = n; - offset() = d; - } - - /** Constructs a hyperplane passing through the two points. If the dimension of the ambient space - * is greater than 2, then there isn't uniqueness, so an arbitrary choice is made. - */ - EIGEN_DEVICE_FUNC static inline Hyperplane Through(const VectorType& p0, const VectorType& p1) - { - Hyperplane result(p0.size()); - result.normal() = (p1 - p0).unitOrthogonal(); - result.offset() = -p0.dot(result.normal()); - return result; - } - - /** Constructs a hyperplane passing through the three points. The dimension of the ambient space - * is required to be exactly 3. - */ - EIGEN_DEVICE_FUNC static inline Hyperplane Through(const VectorType& p0, const VectorType& p1, const VectorType& p2) - { - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(VectorType, 3) - Hyperplane result(p0.size()); - VectorType v0(p2 - p0), v1(p1 - p0); - result.normal() = v0.cross(v1); - RealScalar norm = result.normal().norm(); - if(norm <= v0.norm() * v1.norm() * NumTraits::epsilon()) - { - Matrix m; m << v0.transpose(), v1.transpose(); - JacobiSVD > svd(m, ComputeFullV); - result.normal() = svd.matrixV().col(2); - } - else - result.normal() /= norm; - result.offset() = -p0.dot(result.normal()); - return result; - } - - /** Constructs a hyperplane passing through the parametrized line \a parametrized. - * If the dimension of the ambient space is greater than 2, then there isn't uniqueness, - * so an arbitrary choice is made. - */ - // FIXME to be consitent with the rest this could be implemented as a static Through function ?? - EIGEN_DEVICE_FUNC explicit Hyperplane(const ParametrizedLine& parametrized) - { - normal() = parametrized.direction().unitOrthogonal(); - offset() = -parametrized.origin().dot(normal()); - } - - EIGEN_DEVICE_FUNC ~Hyperplane() {} - - /** \returns the dimension in which the plane holds */ - EIGEN_DEVICE_FUNC inline Index dim() const { return AmbientDimAtCompileTime==Dynamic ? m_coeffs.size()-1 : Index(AmbientDimAtCompileTime); } - - /** normalizes \c *this */ - EIGEN_DEVICE_FUNC void normalize(void) - { - m_coeffs /= normal().norm(); - } - - /** \returns the signed distance between the plane \c *this and a point \a p. - * \sa absDistance() - */ - EIGEN_DEVICE_FUNC inline Scalar signedDistance(const VectorType& p) const { return normal().dot(p) + offset(); } - - /** \returns the absolute distance between the plane \c *this and a point \a p. - * \sa signedDistance() - */ - EIGEN_DEVICE_FUNC inline Scalar absDistance(const VectorType& p) const { return numext::abs(signedDistance(p)); } - - /** \returns the projection of a point \a p onto the plane \c *this. - */ - EIGEN_DEVICE_FUNC inline VectorType projection(const VectorType& p) const { return p - signedDistance(p) * normal(); } - - /** \returns a constant reference to the unit normal vector of the plane, which corresponds - * to the linear part of the implicit equation. - */ - EIGEN_DEVICE_FUNC inline ConstNormalReturnType normal() const { return ConstNormalReturnType(m_coeffs,0,0,dim(),1); } - - /** \returns a non-constant reference to the unit normal vector of the plane, which corresponds - * to the linear part of the implicit equation. - */ - EIGEN_DEVICE_FUNC inline NormalReturnType normal() { return NormalReturnType(m_coeffs,0,0,dim(),1); } - - /** \returns the distance to the origin, which is also the "constant term" of the implicit equation - * \warning the vector normal is assumed to be normalized. - */ - EIGEN_DEVICE_FUNC inline const Scalar& offset() const { return m_coeffs.coeff(dim()); } - - /** \returns a non-constant reference to the distance to the origin, which is also the constant part - * of the implicit equation */ - EIGEN_DEVICE_FUNC inline Scalar& offset() { return m_coeffs(dim()); } - - /** \returns a constant reference to the coefficients c_i of the plane equation: - * \f$ c_0*x_0 + ... + c_{d-1}*x_{d-1} + c_d = 0 \f$ - */ - EIGEN_DEVICE_FUNC inline const Coefficients& coeffs() const { return m_coeffs; } - - /** \returns a non-constant reference to the coefficients c_i of the plane equation: - * \f$ c_0*x_0 + ... + c_{d-1}*x_{d-1} + c_d = 0 \f$ - */ - EIGEN_DEVICE_FUNC inline Coefficients& coeffs() { return m_coeffs; } - - /** \returns the intersection of *this with \a other. - * - * \warning The ambient space must be a plane, i.e. have dimension 2, so that \c *this and \a other are lines. - * - * \note If \a other is approximately parallel to *this, this method will return any point on *this. - */ - EIGEN_DEVICE_FUNC VectorType intersection(const Hyperplane& other) const - { - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(VectorType, 2) - Scalar det = coeffs().coeff(0) * other.coeffs().coeff(1) - coeffs().coeff(1) * other.coeffs().coeff(0); - // since the line equations ax+by=c are normalized with a^2+b^2=1, the following tests - // whether the two lines are approximately parallel. - if(internal::isMuchSmallerThan(det, Scalar(1))) - { // special case where the two lines are approximately parallel. Pick any point on the first line. - if(numext::abs(coeffs().coeff(1))>numext::abs(coeffs().coeff(0))) - return VectorType(coeffs().coeff(1), -coeffs().coeff(2)/coeffs().coeff(1)-coeffs().coeff(0)); - else - return VectorType(-coeffs().coeff(2)/coeffs().coeff(0)-coeffs().coeff(1), coeffs().coeff(0)); - } - else - { // general case - Scalar invdet = Scalar(1) / det; - return VectorType(invdet*(coeffs().coeff(1)*other.coeffs().coeff(2)-other.coeffs().coeff(1)*coeffs().coeff(2)), - invdet*(other.coeffs().coeff(0)*coeffs().coeff(2)-coeffs().coeff(0)*other.coeffs().coeff(2))); - } - } - - /** Applies the transformation matrix \a mat to \c *this and returns a reference to \c *this. - * - * \param mat the Dim x Dim transformation matrix - * \param traits specifies whether the matrix \a mat represents an #Isometry - * or a more generic #Affine transformation. The default is #Affine. - */ - template - EIGEN_DEVICE_FUNC inline Hyperplane& transform(const MatrixBase& mat, TransformTraits traits = Affine) - { - if (traits==Affine) - { - normal() = mat.inverse().transpose() * normal(); - m_coeffs /= normal().norm(); - } - else if (traits==Isometry) - normal() = mat * normal(); - else - { - eigen_assert(0 && "invalid traits value in Hyperplane::transform()"); - } - return *this; - } - - /** Applies the transformation \a t to \c *this and returns a reference to \c *this. - * - * \param t the transformation of dimension Dim - * \param traits specifies whether the transformation \a t represents an #Isometry - * or a more generic #Affine transformation. The default is #Affine. - * Other kind of transformations are not supported. - */ - template - EIGEN_DEVICE_FUNC inline Hyperplane& transform(const Transform& t, - TransformTraits traits = Affine) - { - transform(t.linear(), traits); - offset() -= normal().dot(t.translation()); - return *this; - } - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { - return typename internal::cast_return_type >::type(*this); - } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit Hyperplane(const Hyperplane& other) - { m_coeffs = other.coeffs().template cast(); } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - template - EIGEN_DEVICE_FUNC bool isApprox(const Hyperplane& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return m_coeffs.isApprox(other.m_coeffs, prec); } - -protected: - - Coefficients m_coeffs; -}; - -} // end namespace Eigen - -#endif // EIGEN_HYPERPLANE_H diff --git a/Eigen/src/Geometry/OrthoMethods.h b/Eigen/src/Geometry/OrthoMethods.h deleted file mode 100644 index a035e6310..000000000 --- a/Eigen/src/Geometry/OrthoMethods.h +++ /dev/null @@ -1,234 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ORTHOMETHODS_H -#define EIGEN_ORTHOMETHODS_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \returns the cross product of \c *this and \a other - * - * Here is a very good explanation of cross-product: http://xkcd.com/199/ - * - * With complex numbers, the cross product is implemented as - * \f$ (\mathbf{a}+i\mathbf{b}) \times (\mathbf{c}+i\mathbf{d}) = (\mathbf{a} \times \mathbf{c} - \mathbf{b} \times \mathbf{d}) - i(\mathbf{a} \times \mathbf{d} - \mathbf{b} \times \mathbf{c})\f$ - * - * \sa MatrixBase::cross3() - */ -template -template -#ifndef EIGEN_PARSED_BY_DOXYGEN -EIGEN_DEVICE_FUNC inline typename MatrixBase::template cross_product_return_type::type -#else -inline typename MatrixBase::PlainObject -#endif -MatrixBase::cross(const MatrixBase& other) const -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(Derived,3) - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,3) - - // Note that there is no need for an expression here since the compiler - // optimize such a small temporary very well (even within a complex expression) - typename internal::nested_eval::type lhs(derived()); - typename internal::nested_eval::type rhs(other.derived()); - return typename cross_product_return_type::type( - numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)), - numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)), - numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0)) - ); -} - -namespace internal { - -template< int Arch,typename VectorLhs,typename VectorRhs, - typename Scalar = typename VectorLhs::Scalar, - bool Vectorizable = bool((VectorLhs::Flags&VectorRhs::Flags)&PacketAccessBit)> -struct cross3_impl { - EIGEN_DEVICE_FUNC static inline typename internal::plain_matrix_type::type - run(const VectorLhs& lhs, const VectorRhs& rhs) - { - return typename internal::plain_matrix_type::type( - numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)), - numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)), - numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0)), - 0 - ); - } -}; - -} - -/** \geometry_module \ingroup Geometry_Module - * - * \returns the cross product of \c *this and \a other using only the x, y, and z coefficients - * - * The size of \c *this and \a other must be four. This function is especially useful - * when using 4D vectors instead of 3D ones to get advantage of SSE/AltiVec vectorization. - * - * \sa MatrixBase::cross() - */ -template -template -EIGEN_DEVICE_FUNC inline typename MatrixBase::PlainObject -MatrixBase::cross3(const MatrixBase& other) const -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(Derived,4) - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,4) - - typedef typename internal::nested_eval::type DerivedNested; - typedef typename internal::nested_eval::type OtherDerivedNested; - DerivedNested lhs(derived()); - OtherDerivedNested rhs(other.derived()); - - return internal::cross3_impl::type, - typename internal::remove_all::type>::run(lhs,rhs); -} - -/** \geometry_module \ingroup Geometry_Module - * - * \returns a matrix expression of the cross product of each column or row - * of the referenced expression with the \a other vector. - * - * The referenced matrix must have one dimension equal to 3. - * The result matrix has the same dimensions than the referenced one. - * - * \sa MatrixBase::cross() */ -template -template -EIGEN_DEVICE_FUNC -const typename VectorwiseOp::CrossReturnType -VectorwiseOp::cross(const MatrixBase& other) const -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,3) - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - - typename internal::nested_eval::type mat(_expression()); - typename internal::nested_eval::type vec(other.derived()); - - CrossReturnType res(_expression().rows(),_expression().cols()); - if(Direction==Vertical) - { - eigen_assert(CrossReturnType::RowsAtCompileTime==3 && "the matrix must have exactly 3 rows"); - res.row(0) = (mat.row(1) * vec.coeff(2) - mat.row(2) * vec.coeff(1)).conjugate(); - res.row(1) = (mat.row(2) * vec.coeff(0) - mat.row(0) * vec.coeff(2)).conjugate(); - res.row(2) = (mat.row(0) * vec.coeff(1) - mat.row(1) * vec.coeff(0)).conjugate(); - } - else - { - eigen_assert(CrossReturnType::ColsAtCompileTime==3 && "the matrix must have exactly 3 columns"); - res.col(0) = (mat.col(1) * vec.coeff(2) - mat.col(2) * vec.coeff(1)).conjugate(); - res.col(1) = (mat.col(2) * vec.coeff(0) - mat.col(0) * vec.coeff(2)).conjugate(); - res.col(2) = (mat.col(0) * vec.coeff(1) - mat.col(1) * vec.coeff(0)).conjugate(); - } - return res; -} - -namespace internal { - -template -struct unitOrthogonal_selector -{ - typedef typename plain_matrix_type::type VectorType; - typedef typename traits::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Matrix Vector2; - EIGEN_DEVICE_FUNC - static inline VectorType run(const Derived& src) - { - VectorType perp = VectorType::Zero(src.size()); - Index maxi = 0; - Index sndi = 0; - src.cwiseAbs().maxCoeff(&maxi); - if (maxi==0) - sndi = 1; - RealScalar invnm = RealScalar(1)/(Vector2() << src.coeff(sndi),src.coeff(maxi)).finished().norm(); - perp.coeffRef(maxi) = -numext::conj(src.coeff(sndi)) * invnm; - perp.coeffRef(sndi) = numext::conj(src.coeff(maxi)) * invnm; - - return perp; - } -}; - -template -struct unitOrthogonal_selector -{ - typedef typename plain_matrix_type::type VectorType; - typedef typename traits::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - EIGEN_DEVICE_FUNC - static inline VectorType run(const Derived& src) - { - VectorType perp; - /* Let us compute the crossed product of *this with a vector - * that is not too close to being colinear to *this. - */ - - /* unless the x and y coords are both close to zero, we can - * simply take ( -y, x, 0 ) and normalize it. - */ - if((!isMuchSmallerThan(src.x(), src.z())) - || (!isMuchSmallerThan(src.y(), src.z()))) - { - RealScalar invnm = RealScalar(1)/src.template head<2>().norm(); - perp.coeffRef(0) = -numext::conj(src.y())*invnm; - perp.coeffRef(1) = numext::conj(src.x())*invnm; - perp.coeffRef(2) = 0; - } - /* if both x and y are close to zero, then the vector is close - * to the z-axis, so it's far from colinear to the x-axis for instance. - * So we take the crossed product with (1,0,0) and normalize it. - */ - else - { - RealScalar invnm = RealScalar(1)/src.template tail<2>().norm(); - perp.coeffRef(0) = 0; - perp.coeffRef(1) = -numext::conj(src.z())*invnm; - perp.coeffRef(2) = numext::conj(src.y())*invnm; - } - - return perp; - } -}; - -template -struct unitOrthogonal_selector -{ - typedef typename plain_matrix_type::type VectorType; - EIGEN_DEVICE_FUNC - static inline VectorType run(const Derived& src) - { return VectorType(-numext::conj(src.y()), numext::conj(src.x())).normalized(); } -}; - -} // end namespace internal - -/** \geometry_module \ingroup Geometry_Module - * - * \returns a unit vector which is orthogonal to \c *this - * - * The size of \c *this must be at least 2. If the size is exactly 2, - * then the returned vector is a counter clock wise rotation of \c *this, i.e., (-y,x).normalized(). - * - * \sa cross() - */ -template -EIGEN_DEVICE_FUNC typename MatrixBase::PlainObject -MatrixBase::unitOrthogonal() const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return internal::unitOrthogonal_selector::run(derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_ORTHOMETHODS_H diff --git a/Eigen/src/Geometry/ParametrizedLine.h b/Eigen/src/Geometry/ParametrizedLine.h deleted file mode 100644 index 3929ca87f..000000000 --- a/Eigen/src/Geometry/ParametrizedLine.h +++ /dev/null @@ -1,232 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PARAMETRIZEDLINE_H -#define EIGEN_PARAMETRIZEDLINE_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class ParametrizedLine - * - * \brief A parametrized line - * - * A parametrized line is defined by an origin point \f$ \mathbf{o} \f$ and a unit - * direction vector \f$ \mathbf{d} \f$ such that the line corresponds to - * the set \f$ l(t) = \mathbf{o} + t \mathbf{d} \f$, \f$ t \in \mathbf{R} \f$. - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients - * \tparam _AmbientDim the dimension of the ambient space, can be a compile time value or Dynamic. - */ -template -class ParametrizedLine -{ -public: - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_AmbientDim) - enum { - AmbientDimAtCompileTime = _AmbientDim, - Options = _Options - }; - typedef _Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - typedef Matrix VectorType; - - /** Default constructor without initialization */ - EIGEN_DEVICE_FUNC inline ParametrizedLine() {} - - template - EIGEN_DEVICE_FUNC ParametrizedLine(const ParametrizedLine& other) - : m_origin(other.origin()), m_direction(other.direction()) - {} - - /** Constructs a dynamic-size line with \a _dim the dimension - * of the ambient space */ - EIGEN_DEVICE_FUNC inline explicit ParametrizedLine(Index _dim) : m_origin(_dim), m_direction(_dim) {} - - /** Initializes a parametrized line of direction \a direction and origin \a origin. - * \warning the vector direction is assumed to be normalized. - */ - EIGEN_DEVICE_FUNC ParametrizedLine(const VectorType& origin, const VectorType& direction) - : m_origin(origin), m_direction(direction) {} - - template - EIGEN_DEVICE_FUNC explicit ParametrizedLine(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane); - - /** Constructs a parametrized line going from \a p0 to \a p1. */ - EIGEN_DEVICE_FUNC static inline ParametrizedLine Through(const VectorType& p0, const VectorType& p1) - { return ParametrizedLine(p0, (p1-p0).normalized()); } - - EIGEN_DEVICE_FUNC ~ParametrizedLine() {} - - /** \returns the dimension in which the line holds */ - EIGEN_DEVICE_FUNC inline Index dim() const { return m_direction.size(); } - - EIGEN_DEVICE_FUNC const VectorType& origin() const { return m_origin; } - EIGEN_DEVICE_FUNC VectorType& origin() { return m_origin; } - - EIGEN_DEVICE_FUNC const VectorType& direction() const { return m_direction; } - EIGEN_DEVICE_FUNC VectorType& direction() { return m_direction; } - - /** \returns the squared distance of a point \a p to its projection onto the line \c *this. - * \sa distance() - */ - EIGEN_DEVICE_FUNC RealScalar squaredDistance(const VectorType& p) const - { - VectorType diff = p - origin(); - return (diff - direction().dot(diff) * direction()).squaredNorm(); - } - /** \returns the distance of a point \a p to its projection onto the line \c *this. - * \sa squaredDistance() - */ - EIGEN_DEVICE_FUNC RealScalar distance(const VectorType& p) const { EIGEN_USING_STD_MATH(sqrt) return sqrt(squaredDistance(p)); } - - /** \returns the projection of a point \a p onto the line \c *this. */ - EIGEN_DEVICE_FUNC VectorType projection(const VectorType& p) const - { return origin() + direction().dot(p-origin()) * direction(); } - - EIGEN_DEVICE_FUNC VectorType pointAt(const Scalar& t) const; - - template - EIGEN_DEVICE_FUNC Scalar intersectionParameter(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; - - template - EIGEN_DEVICE_FUNC Scalar intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; - - template - EIGEN_DEVICE_FUNC VectorType intersectionPoint(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; - - /** Applies the transformation matrix \a mat to \c *this and returns a reference to \c *this. - * - * \param mat the Dim x Dim transformation matrix - * \param traits specifies whether the matrix \a mat represents an #Isometry - * or a more generic #Affine transformation. The default is #Affine. - */ - template - EIGEN_DEVICE_FUNC inline ParametrizedLine& transform(const MatrixBase& mat, TransformTraits traits = Affine) - { - if (traits==Affine) - direction() = (mat * direction()).normalized(); - else if (traits==Isometry) - direction() = mat * direction(); - else - { - eigen_assert(0 && "invalid traits value in ParametrizedLine::transform()"); - } - origin() = mat * origin(); - return *this; - } - - /** Applies the transformation \a t to \c *this and returns a reference to \c *this. - * - * \param t the transformation of dimension Dim - * \param traits specifies whether the transformation \a t represents an #Isometry - * or a more generic #Affine transformation. The default is #Affine. - * Other kind of transformations are not supported. - */ - template - EIGEN_DEVICE_FUNC inline ParametrizedLine& transform(const Transform& t, - TransformTraits traits = Affine) - { - transform(t.linear(), traits); - origin() += t.translation(); - return *this; - } - -/** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { - return typename internal::cast_return_type >::type(*this); - } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit ParametrizedLine(const ParametrizedLine& other) - { - m_origin = other.origin().template cast(); - m_direction = other.direction().template cast(); - } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - EIGEN_DEVICE_FUNC bool isApprox(const ParametrizedLine& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return m_origin.isApprox(other.m_origin, prec) && m_direction.isApprox(other.m_direction, prec); } - -protected: - - VectorType m_origin, m_direction; -}; - -/** Constructs a parametrized line from a 2D hyperplane - * - * \warning the ambient space must have dimension 2 such that the hyperplane actually describes a line - */ -template -template -EIGEN_DEVICE_FUNC inline ParametrizedLine<_Scalar, _AmbientDim,_Options>::ParametrizedLine(const Hyperplane<_Scalar, _AmbientDim,OtherOptions>& hyperplane) -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(VectorType, 2) - direction() = hyperplane.normal().unitOrthogonal(); - origin() = -hyperplane.normal()*hyperplane.offset(); -} - -/** \returns the point at \a t along this line - */ -template -EIGEN_DEVICE_FUNC inline typename ParametrizedLine<_Scalar, _AmbientDim,_Options>::VectorType -ParametrizedLine<_Scalar, _AmbientDim,_Options>::pointAt(const _Scalar& t) const -{ - return origin() + (direction()*t); -} - -/** \returns the parameter value of the intersection between \c *this and the given \a hyperplane - */ -template -template -EIGEN_DEVICE_FUNC inline _Scalar ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersectionParameter(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const -{ - return -(hyperplane.offset()+hyperplane.normal().dot(origin())) - / hyperplane.normal().dot(direction()); -} - - -/** \deprecated use intersectionParameter() - * \returns the parameter value of the intersection between \c *this and the given \a hyperplane - */ -template -template -EIGEN_DEVICE_FUNC inline _Scalar ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const -{ - return intersectionParameter(hyperplane); -} - -/** \returns the point of the intersection between \c *this and the given hyperplane - */ -template -template -EIGEN_DEVICE_FUNC inline typename ParametrizedLine<_Scalar, _AmbientDim,_Options>::VectorType -ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersectionPoint(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const -{ - return pointAt(intersectionParameter(hyperplane)); -} - -} // end namespace Eigen - -#endif // EIGEN_PARAMETRIZEDLINE_H diff --git a/Eigen/src/Geometry/Quaternion.h b/Eigen/src/Geometry/Quaternion.h deleted file mode 100644 index c3fd8c3e0..000000000 --- a/Eigen/src/Geometry/Quaternion.h +++ /dev/null @@ -1,814 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2009 Mathieu Gautier -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_QUATERNION_H -#define EIGEN_QUATERNION_H -namespace Eigen { - - -/*************************************************************************** -* Definition of QuaternionBase -* The implementation is at the end of the file -***************************************************************************/ - -namespace internal { -template -struct quaternionbase_assign_impl; -} - -/** \geometry_module \ingroup Geometry_Module - * \class QuaternionBase - * \brief Base class for quaternion expressions - * \tparam Derived derived type (CRTP) - * \sa class Quaternion - */ -template -class QuaternionBase : public RotationBase -{ - public: - typedef RotationBase Base; - - using Base::operator*; - using Base::derived; - - typedef typename internal::traits::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef typename internal::traits::Coefficients Coefficients; - typedef typename Coefficients::CoeffReturnType CoeffReturnType; - typedef typename internal::conditional::Flags&LvalueBit), - Scalar&, CoeffReturnType>::type NonConstCoeffReturnType; - - - enum { - Flags = Eigen::internal::traits::Flags - }; - - // typedef typename Matrix Coefficients; - /** the type of a 3D vector */ - typedef Matrix Vector3; - /** the equivalent rotation matrix type */ - typedef Matrix Matrix3; - /** the equivalent angle-axis type */ - typedef AngleAxis AngleAxisType; - - - - /** \returns the \c x coefficient */ - EIGEN_DEVICE_FUNC inline CoeffReturnType x() const { return this->derived().coeffs().coeff(0); } - /** \returns the \c y coefficient */ - EIGEN_DEVICE_FUNC inline CoeffReturnType y() const { return this->derived().coeffs().coeff(1); } - /** \returns the \c z coefficient */ - EIGEN_DEVICE_FUNC inline CoeffReturnType z() const { return this->derived().coeffs().coeff(2); } - /** \returns the \c w coefficient */ - EIGEN_DEVICE_FUNC inline CoeffReturnType w() const { return this->derived().coeffs().coeff(3); } - - /** \returns a reference to the \c x coefficient (if Derived is a non-const lvalue) */ - EIGEN_DEVICE_FUNC inline NonConstCoeffReturnType x() { return this->derived().coeffs().x(); } - /** \returns a reference to the \c y coefficient (if Derived is a non-const lvalue) */ - EIGEN_DEVICE_FUNC inline NonConstCoeffReturnType y() { return this->derived().coeffs().y(); } - /** \returns a reference to the \c z coefficient (if Derived is a non-const lvalue) */ - EIGEN_DEVICE_FUNC inline NonConstCoeffReturnType z() { return this->derived().coeffs().z(); } - /** \returns a reference to the \c w coefficient (if Derived is a non-const lvalue) */ - EIGEN_DEVICE_FUNC inline NonConstCoeffReturnType w() { return this->derived().coeffs().w(); } - - /** \returns a read-only vector expression of the imaginary part (x,y,z) */ - EIGEN_DEVICE_FUNC inline const VectorBlock vec() const { return coeffs().template head<3>(); } - - /** \returns a vector expression of the imaginary part (x,y,z) */ - EIGEN_DEVICE_FUNC inline VectorBlock vec() { return coeffs().template head<3>(); } - - /** \returns a read-only vector expression of the coefficients (x,y,z,w) */ - EIGEN_DEVICE_FUNC inline const typename internal::traits::Coefficients& coeffs() const { return derived().coeffs(); } - - /** \returns a vector expression of the coefficients (x,y,z,w) */ - EIGEN_DEVICE_FUNC inline typename internal::traits::Coefficients& coeffs() { return derived().coeffs(); } - - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE QuaternionBase& operator=(const QuaternionBase& other); - template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& operator=(const QuaternionBase& other); - -// disabled this copy operator as it is giving very strange compilation errors when compiling -// test_stdvector with GCC 4.4.2. This looks like a GCC bug though, so feel free to re-enable it if it's -// useful; however notice that we already have the templated operator= above and e.g. in MatrixBase -// we didn't have to add, in addition to templated operator=, such a non-templated copy operator. -// Derived& operator=(const QuaternionBase& other) -// { return operator=(other); } - - EIGEN_DEVICE_FUNC Derived& operator=(const AngleAxisType& aa); - template EIGEN_DEVICE_FUNC Derived& operator=(const MatrixBase& m); - - /** \returns a quaternion representing an identity rotation - * \sa MatrixBase::Identity() - */ - EIGEN_DEVICE_FUNC static inline Quaternion Identity() { return Quaternion(Scalar(1), Scalar(0), Scalar(0), Scalar(0)); } - - /** \sa QuaternionBase::Identity(), MatrixBase::setIdentity() - */ - EIGEN_DEVICE_FUNC inline QuaternionBase& setIdentity() { coeffs() << Scalar(0), Scalar(0), Scalar(0), Scalar(1); return *this; } - - /** \returns the squared norm of the quaternion's coefficients - * \sa QuaternionBase::norm(), MatrixBase::squaredNorm() - */ - EIGEN_DEVICE_FUNC inline Scalar squaredNorm() const { return coeffs().squaredNorm(); } - - /** \returns the norm of the quaternion's coefficients - * \sa QuaternionBase::squaredNorm(), MatrixBase::norm() - */ - EIGEN_DEVICE_FUNC inline Scalar norm() const { return coeffs().norm(); } - - /** Normalizes the quaternion \c *this - * \sa normalized(), MatrixBase::normalize() */ - EIGEN_DEVICE_FUNC inline void normalize() { coeffs().normalize(); } - /** \returns a normalized copy of \c *this - * \sa normalize(), MatrixBase::normalized() */ - EIGEN_DEVICE_FUNC inline Quaternion normalized() const { return Quaternion(coeffs().normalized()); } - - /** \returns the dot product of \c *this and \a other - * Geometrically speaking, the dot product of two unit quaternions - * corresponds to the cosine of half the angle between the two rotations. - * \sa angularDistance() - */ - template EIGEN_DEVICE_FUNC inline Scalar dot(const QuaternionBase& other) const { return coeffs().dot(other.coeffs()); } - - template EIGEN_DEVICE_FUNC Scalar angularDistance(const QuaternionBase& other) const; - - /** \returns an equivalent 3x3 rotation matrix */ - EIGEN_DEVICE_FUNC Matrix3 toRotationMatrix() const; - - /** \returns the quaternion which transform \a a into \a b through a rotation */ - template - EIGEN_DEVICE_FUNC Derived& setFromTwoVectors(const MatrixBase& a, const MatrixBase& b); - - template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Quaternion operator* (const QuaternionBase& q) const; - template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& operator*= (const QuaternionBase& q); - - /** \returns the quaternion describing the inverse rotation */ - EIGEN_DEVICE_FUNC Quaternion inverse() const; - - /** \returns the conjugated quaternion */ - EIGEN_DEVICE_FUNC Quaternion conjugate() const; - - template EIGEN_DEVICE_FUNC Quaternion slerp(const Scalar& t, const QuaternionBase& other) const; - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - template - EIGEN_DEVICE_FUNC bool isApprox(const QuaternionBase& other, const RealScalar& prec = NumTraits::dummy_precision()) const - { return coeffs().isApprox(other.coeffs(), prec); } - - /** return the result vector of \a v through the rotation*/ - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Vector3 _transformVector(const Vector3& v) const; - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { - return typename internal::cast_return_type >::type(derived()); - } - -#ifdef EIGEN_QUATERNIONBASE_PLUGIN -# include EIGEN_QUATERNIONBASE_PLUGIN -#endif -}; - -/*************************************************************************** -* Definition/implementation of Quaternion -***************************************************************************/ - -/** \geometry_module \ingroup Geometry_Module - * - * \class Quaternion - * - * \brief The quaternion class used to represent 3D orientations and rotations - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients - * \tparam _Options controls the memory alignment of the coefficients. Can be \# AutoAlign or \# DontAlign. Default is AutoAlign. - * - * This class represents a quaternion \f$ w+xi+yj+zk \f$ that is a convenient representation of - * orientations and rotations of objects in three dimensions. Compared to other representations - * like Euler angles or 3x3 matrices, quaternions offer the following advantages: - * \li \b compact storage (4 scalars) - * \li \b efficient to compose (28 flops), - * \li \b stable spherical interpolation - * - * The following two typedefs are provided for convenience: - * \li \c Quaternionf for \c float - * \li \c Quaterniond for \c double - * - * \warning Operations interpreting the quaternion as rotation have undefined behavior if the quaternion is not normalized. - * - * \sa class AngleAxis, class Transform - */ - -namespace internal { -template -struct traits > -{ - typedef Quaternion<_Scalar,_Options> PlainObject; - typedef _Scalar Scalar; - typedef Matrix<_Scalar,4,1,_Options> Coefficients; - enum{ - Alignment = internal::traits::Alignment, - Flags = LvalueBit - }; -}; -} - -template -class Quaternion : public QuaternionBase > -{ -public: - typedef QuaternionBase > Base; - enum { NeedsAlignment = internal::traits::Alignment>0 }; - - typedef _Scalar Scalar; - - EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Quaternion) - using Base::operator*=; - - typedef typename internal::traits::Coefficients Coefficients; - typedef typename Base::AngleAxisType AngleAxisType; - - /** Default constructor leaving the quaternion uninitialized. */ - EIGEN_DEVICE_FUNC inline Quaternion() {} - - /** Constructs and initializes the quaternion \f$ w+xi+yj+zk \f$ from - * its four coefficients \a w, \a x, \a y and \a z. - * - * \warning Note the order of the arguments: the real \a w coefficient first, - * while internally the coefficients are stored in the following order: - * [\c x, \c y, \c z, \c w] - */ - EIGEN_DEVICE_FUNC inline Quaternion(const Scalar& w, const Scalar& x, const Scalar& y, const Scalar& z) : m_coeffs(x, y, z, w){} - - /** Constructs and initialize a quaternion from the array data */ - EIGEN_DEVICE_FUNC explicit inline Quaternion(const Scalar* data) : m_coeffs(data) {} - - /** Copy constructor */ - template EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Quaternion(const QuaternionBase& other) { this->Base::operator=(other); } - - /** Constructs and initializes a quaternion from the angle-axis \a aa */ - EIGEN_DEVICE_FUNC explicit inline Quaternion(const AngleAxisType& aa) { *this = aa; } - - /** Constructs and initializes a quaternion from either: - * - a rotation matrix expression, - * - a 4D vector expression representing quaternion coefficients. - */ - template - EIGEN_DEVICE_FUNC explicit inline Quaternion(const MatrixBase& other) { *this = other; } - - /** Explicit copy constructor with scalar conversion */ - template - EIGEN_DEVICE_FUNC explicit inline Quaternion(const Quaternion& other) - { m_coeffs = other.coeffs().template cast(); } - - EIGEN_DEVICE_FUNC static Quaternion UnitRandom(); - - template - EIGEN_DEVICE_FUNC static Quaternion FromTwoVectors(const MatrixBase& a, const MatrixBase& b); - - EIGEN_DEVICE_FUNC inline Coefficients& coeffs() { return m_coeffs;} - EIGEN_DEVICE_FUNC inline const Coefficients& coeffs() const { return m_coeffs;} - - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF(bool(NeedsAlignment)) - -#ifdef EIGEN_QUATERNION_PLUGIN -# include EIGEN_QUATERNION_PLUGIN -#endif - -protected: - Coefficients m_coeffs; - -#ifndef EIGEN_PARSED_BY_DOXYGEN - static EIGEN_STRONG_INLINE void _check_template_params() - { - EIGEN_STATIC_ASSERT( (_Options & DontAlign) == _Options, - INVALID_MATRIX_TEMPLATE_PARAMETERS) - } -#endif -}; - -/** \ingroup Geometry_Module - * single precision quaternion type */ -typedef Quaternion Quaternionf; -/** \ingroup Geometry_Module - * double precision quaternion type */ -typedef Quaternion Quaterniond; - -/*************************************************************************** -* Specialization of Map> -***************************************************************************/ - -namespace internal { - template - struct traits, _Options> > : traits > - { - typedef Map, _Options> Coefficients; - }; -} - -namespace internal { - template - struct traits, _Options> > : traits > - { - typedef Map, _Options> Coefficients; - typedef traits > TraitsBase; - enum { - Flags = TraitsBase::Flags & ~LvalueBit - }; - }; -} - -/** \ingroup Geometry_Module - * \brief Quaternion expression mapping a constant memory buffer - * - * \tparam _Scalar the type of the Quaternion coefficients - * \tparam _Options see class Map - * - * This is a specialization of class Map for Quaternion. This class allows to view - * a 4 scalar memory buffer as an Eigen's Quaternion object. - * - * \sa class Map, class Quaternion, class QuaternionBase - */ -template -class Map, _Options > - : public QuaternionBase, _Options> > -{ - public: - typedef QuaternionBase, _Options> > Base; - - typedef _Scalar Scalar; - typedef typename internal::traits::Coefficients Coefficients; - EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Map) - using Base::operator*=; - - /** Constructs a Mapped Quaternion object from the pointer \a coeffs - * - * The pointer \a coeffs must reference the four coefficients of Quaternion in the following order: - * \code *coeffs == {x, y, z, w} \endcode - * - * If the template parameter _Options is set to #Aligned, then the pointer coeffs must be aligned. */ - EIGEN_DEVICE_FUNC explicit EIGEN_STRONG_INLINE Map(const Scalar* coeffs) : m_coeffs(coeffs) {} - - EIGEN_DEVICE_FUNC inline const Coefficients& coeffs() const { return m_coeffs;} - - protected: - const Coefficients m_coeffs; -}; - -/** \ingroup Geometry_Module - * \brief Expression of a quaternion from a memory buffer - * - * \tparam _Scalar the type of the Quaternion coefficients - * \tparam _Options see class Map - * - * This is a specialization of class Map for Quaternion. This class allows to view - * a 4 scalar memory buffer as an Eigen's Quaternion object. - * - * \sa class Map, class Quaternion, class QuaternionBase - */ -template -class Map, _Options > - : public QuaternionBase, _Options> > -{ - public: - typedef QuaternionBase, _Options> > Base; - - typedef _Scalar Scalar; - typedef typename internal::traits::Coefficients Coefficients; - EIGEN_INHERIT_ASSIGNMENT_OPERATORS(Map) - using Base::operator*=; - - /** Constructs a Mapped Quaternion object from the pointer \a coeffs - * - * The pointer \a coeffs must reference the four coefficients of Quaternion in the following order: - * \code *coeffs == {x, y, z, w} \endcode - * - * If the template parameter _Options is set to #Aligned, then the pointer coeffs must be aligned. */ - EIGEN_DEVICE_FUNC explicit EIGEN_STRONG_INLINE Map(Scalar* coeffs) : m_coeffs(coeffs) {} - - EIGEN_DEVICE_FUNC inline Coefficients& coeffs() { return m_coeffs; } - EIGEN_DEVICE_FUNC inline const Coefficients& coeffs() const { return m_coeffs; } - - protected: - Coefficients m_coeffs; -}; - -/** \ingroup Geometry_Module - * Map an unaligned array of single precision scalars as a quaternion */ -typedef Map, 0> QuaternionMapf; -/** \ingroup Geometry_Module - * Map an unaligned array of double precision scalars as a quaternion */ -typedef Map, 0> QuaternionMapd; -/** \ingroup Geometry_Module - * Map a 16-byte aligned array of single precision scalars as a quaternion */ -typedef Map, Aligned> QuaternionMapAlignedf; -/** \ingroup Geometry_Module - * Map a 16-byte aligned array of double precision scalars as a quaternion */ -typedef Map, Aligned> QuaternionMapAlignedd; - -/*************************************************************************** -* Implementation of QuaternionBase methods -***************************************************************************/ - -// Generic Quaternion * Quaternion product -// This product can be specialized for a given architecture via the Arch template argument. -namespace internal { -template struct quat_product -{ - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Quaternion run(const QuaternionBase& a, const QuaternionBase& b){ - return Quaternion - ( - a.w() * b.w() - a.x() * b.x() - a.y() * b.y() - a.z() * b.z(), - a.w() * b.x() + a.x() * b.w() + a.y() * b.z() - a.z() * b.y(), - a.w() * b.y() + a.y() * b.w() + a.z() * b.x() - a.x() * b.z(), - a.w() * b.z() + a.z() * b.w() + a.x() * b.y() - a.y() * b.x() - ); - } -}; -} - -/** \returns the concatenation of two rotations as a quaternion-quaternion product */ -template -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Quaternion::Scalar> -QuaternionBase::operator* (const QuaternionBase& other) const -{ - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - return internal::quat_product::Scalar>::run(*this, other); -} - -/** \sa operator*(Quaternion) */ -template -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& QuaternionBase::operator*= (const QuaternionBase& other) -{ - derived() = derived() * other.derived(); - return derived(); -} - -/** Rotation of a vector by a quaternion. - * \remarks If the quaternion is used to rotate several points (>1) - * then it is much more efficient to first convert it to a 3x3 Matrix. - * Comparison of the operation cost for n transformations: - * - Quaternion2: 30n - * - Via a Matrix3: 24 + 15n - */ -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename QuaternionBase::Vector3 -QuaternionBase::_transformVector(const Vector3& v) const -{ - // Note that this algorithm comes from the optimization by hand - // of the conversion to a Matrix followed by a Matrix/Vector product. - // It appears to be much faster than the common algorithm found - // in the literature (30 versus 39 flops). It also requires two - // Vector3 as temporaries. - Vector3 uv = this->vec().cross(v); - uv += uv; - return v + this->w() * uv + this->vec().cross(uv); -} - -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE QuaternionBase& QuaternionBase::operator=(const QuaternionBase& other) -{ - coeffs() = other.coeffs(); - return derived(); -} - -template -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& QuaternionBase::operator=(const QuaternionBase& other) -{ - coeffs() = other.coeffs(); - return derived(); -} - -/** Set \c *this from an angle-axis \a aa and returns a reference to \c *this - */ -template -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Derived& QuaternionBase::operator=(const AngleAxisType& aa) -{ - EIGEN_USING_STD_MATH(cos) - EIGEN_USING_STD_MATH(sin) - Scalar ha = Scalar(0.5)*aa.angle(); // Scalar(0.5) to suppress precision loss warnings - this->w() = cos(ha); - this->vec() = sin(ha) * aa.axis(); - return derived(); -} - -/** Set \c *this from the expression \a xpr: - * - if \a xpr is a 4x1 vector, then \a xpr is assumed to be a quaternion - * - if \a xpr is a 3x3 matrix, then \a xpr is assumed to be rotation matrix - * and \a xpr is converted to a quaternion - */ - -template -template -EIGEN_DEVICE_FUNC inline Derived& QuaternionBase::operator=(const MatrixBase& xpr) -{ - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - internal::quaternionbase_assign_impl::run(*this, xpr.derived()); - return derived(); -} - -/** Convert the quaternion to a 3x3 rotation matrix. The quaternion is required to - * be normalized, otherwise the result is undefined. - */ -template -EIGEN_DEVICE_FUNC inline typename QuaternionBase::Matrix3 -QuaternionBase::toRotationMatrix(void) const -{ - // NOTE if inlined, then gcc 4.2 and 4.4 get rid of the temporary (not gcc 4.3 !!) - // if not inlined then the cost of the return by value is huge ~ +35%, - // however, not inlining this function is an order of magnitude slower, so - // it has to be inlined, and so the return by value is not an issue - Matrix3 res; - - const Scalar tx = Scalar(2)*this->x(); - const Scalar ty = Scalar(2)*this->y(); - const Scalar tz = Scalar(2)*this->z(); - const Scalar twx = tx*this->w(); - const Scalar twy = ty*this->w(); - const Scalar twz = tz*this->w(); - const Scalar txx = tx*this->x(); - const Scalar txy = ty*this->x(); - const Scalar txz = tz*this->x(); - const Scalar tyy = ty*this->y(); - const Scalar tyz = tz*this->y(); - const Scalar tzz = tz*this->z(); - - res.coeffRef(0,0) = Scalar(1)-(tyy+tzz); - res.coeffRef(0,1) = txy-twz; - res.coeffRef(0,2) = txz+twy; - res.coeffRef(1,0) = txy+twz; - res.coeffRef(1,1) = Scalar(1)-(txx+tzz); - res.coeffRef(1,2) = tyz-twx; - res.coeffRef(2,0) = txz-twy; - res.coeffRef(2,1) = tyz+twx; - res.coeffRef(2,2) = Scalar(1)-(txx+tyy); - - return res; -} - -/** Sets \c *this to be a quaternion representing a rotation between - * the two arbitrary vectors \a a and \a b. In other words, the built - * rotation represent a rotation sending the line of direction \a a - * to the line of direction \a b, both lines passing through the origin. - * - * \returns a reference to \c *this. - * - * Note that the two input vectors do \b not have to be normalized, and - * do not need to have the same norm. - */ -template -template -EIGEN_DEVICE_FUNC inline Derived& QuaternionBase::setFromTwoVectors(const MatrixBase& a, const MatrixBase& b) -{ - EIGEN_USING_STD_MATH(sqrt) - Vector3 v0 = a.normalized(); - Vector3 v1 = b.normalized(); - Scalar c = v1.dot(v0); - - // if dot == -1, vectors are nearly opposites - // => accurately compute the rotation axis by computing the - // intersection of the two planes. This is done by solving: - // x^T v0 = 0 - // x^T v1 = 0 - // under the constraint: - // ||x|| = 1 - // which yields a singular value problem - if (c < Scalar(-1)+NumTraits::dummy_precision()) - { - c = numext::maxi(c,Scalar(-1)); - Matrix m; m << v0.transpose(), v1.transpose(); - JacobiSVD > svd(m, ComputeFullV); - Vector3 axis = svd.matrixV().col(2); - - Scalar w2 = (Scalar(1)+c)*Scalar(0.5); - this->w() = sqrt(w2); - this->vec() = axis * sqrt(Scalar(1) - w2); - return derived(); - } - Vector3 axis = v0.cross(v1); - Scalar s = sqrt((Scalar(1)+c)*Scalar(2)); - Scalar invs = Scalar(1)/s; - this->vec() = axis * invs; - this->w() = s * Scalar(0.5); - - return derived(); -} - -/** \returns a random unit quaternion following a uniform distribution law on SO(3) - * - * \note The implementation is based on http://planning.cs.uiuc.edu/node198.html - */ -template -EIGEN_DEVICE_FUNC Quaternion Quaternion::UnitRandom() -{ - EIGEN_USING_STD_MATH(sqrt) - EIGEN_USING_STD_MATH(sin) - EIGEN_USING_STD_MATH(cos) - const Scalar u1 = internal::random(0, 1), - u2 = internal::random(0, 2*EIGEN_PI), - u3 = internal::random(0, 2*EIGEN_PI); - const Scalar a = sqrt(1 - u1), - b = sqrt(u1); - return Quaternion (a * sin(u2), a * cos(u2), b * sin(u3), b * cos(u3)); -} - - -/** Returns a quaternion representing a rotation between - * the two arbitrary vectors \a a and \a b. In other words, the built - * rotation represent a rotation sending the line of direction \a a - * to the line of direction \a b, both lines passing through the origin. - * - * \returns resulting quaternion - * - * Note that the two input vectors do \b not have to be normalized, and - * do not need to have the same norm. - */ -template -template -EIGEN_DEVICE_FUNC Quaternion Quaternion::FromTwoVectors(const MatrixBase& a, const MatrixBase& b) -{ - Quaternion quat; - quat.setFromTwoVectors(a, b); - return quat; -} - - -/** \returns the multiplicative inverse of \c *this - * Note that in most cases, i.e., if you simply want the opposite rotation, - * and/or the quaternion is normalized, then it is enough to use the conjugate. - * - * \sa QuaternionBase::conjugate() - */ -template -EIGEN_DEVICE_FUNC inline Quaternion::Scalar> QuaternionBase::inverse() const -{ - // FIXME should this function be called multiplicativeInverse and conjugate() be called inverse() or opposite() ?? - Scalar n2 = this->squaredNorm(); - if (n2 > Scalar(0)) - return Quaternion(conjugate().coeffs() / n2); - else - { - // return an invalid result to flag the error - return Quaternion(Coefficients::Zero()); - } -} - -// Generic conjugate of a Quaternion -namespace internal { -template struct quat_conj -{ - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE Quaternion run(const QuaternionBase& q){ - return Quaternion(q.w(),-q.x(),-q.y(),-q.z()); - } -}; -} - -/** \returns the conjugate of the \c *this which is equal to the multiplicative inverse - * if the quaternion is normalized. - * The conjugate of a quaternion represents the opposite rotation. - * - * \sa Quaternion2::inverse() - */ -template -EIGEN_DEVICE_FUNC inline Quaternion::Scalar> -QuaternionBase::conjugate() const -{ - return internal::quat_conj::Scalar>::run(*this); - -} - -/** \returns the angle (in radian) between two rotations - * \sa dot() - */ -template -template -EIGEN_DEVICE_FUNC inline typename internal::traits::Scalar -QuaternionBase::angularDistance(const QuaternionBase& other) const -{ - EIGEN_USING_STD_MATH(atan2) - Quaternion d = (*this) * other.conjugate(); - return Scalar(2) * atan2( d.vec().norm(), numext::abs(d.w()) ); -} - - - -/** \returns the spherical linear interpolation between the two quaternions - * \c *this and \a other at the parameter \a t in [0;1]. - * - * This represents an interpolation for a constant motion between \c *this and \a other, - * see also http://en.wikipedia.org/wiki/Slerp. - */ -template -template -EIGEN_DEVICE_FUNC Quaternion::Scalar> -QuaternionBase::slerp(const Scalar& t, const QuaternionBase& other) const -{ - EIGEN_USING_STD_MATH(acos) - EIGEN_USING_STD_MATH(sin) - const Scalar one = Scalar(1) - NumTraits::epsilon(); - Scalar d = this->dot(other); - Scalar absD = numext::abs(d); - - Scalar scale0; - Scalar scale1; - - if(absD>=one) - { - scale0 = Scalar(1) - t; - scale1 = t; - } - else - { - // theta is the angle between the 2 quaternions - Scalar theta = acos(absD); - Scalar sinTheta = sin(theta); - - scale0 = sin( ( Scalar(1) - t ) * theta) / sinTheta; - scale1 = sin( ( t * theta) ) / sinTheta; - } - if(d(scale0 * coeffs() + scale1 * other.coeffs()); -} - -namespace internal { - -// set from a rotation matrix -template -struct quaternionbase_assign_impl -{ - typedef typename Other::Scalar Scalar; - template EIGEN_DEVICE_FUNC static inline void run(QuaternionBase& q, const Other& a_mat) - { - const typename internal::nested_eval::type mat(a_mat); - EIGEN_USING_STD_MATH(sqrt) - // This algorithm comes from "Quaternion Calculus and Fast Animation", - // Ken Shoemake, 1987 SIGGRAPH course notes - Scalar t = mat.trace(); - if (t > Scalar(0)) - { - t = sqrt(t + Scalar(1.0)); - q.w() = Scalar(0.5)*t; - t = Scalar(0.5)/t; - q.x() = (mat.coeff(2,1) - mat.coeff(1,2)) * t; - q.y() = (mat.coeff(0,2) - mat.coeff(2,0)) * t; - q.z() = (mat.coeff(1,0) - mat.coeff(0,1)) * t; - } - else - { - Index i = 0; - if (mat.coeff(1,1) > mat.coeff(0,0)) - i = 1; - if (mat.coeff(2,2) > mat.coeff(i,i)) - i = 2; - Index j = (i+1)%3; - Index k = (j+1)%3; - - t = sqrt(mat.coeff(i,i)-mat.coeff(j,j)-mat.coeff(k,k) + Scalar(1.0)); - q.coeffs().coeffRef(i) = Scalar(0.5) * t; - t = Scalar(0.5)/t; - q.w() = (mat.coeff(k,j)-mat.coeff(j,k))*t; - q.coeffs().coeffRef(j) = (mat.coeff(j,i)+mat.coeff(i,j))*t; - q.coeffs().coeffRef(k) = (mat.coeff(k,i)+mat.coeff(i,k))*t; - } - } -}; - -// set from a vector of coefficients assumed to be a quaternion -template -struct quaternionbase_assign_impl -{ - typedef typename Other::Scalar Scalar; - template EIGEN_DEVICE_FUNC static inline void run(QuaternionBase& q, const Other& vec) - { - q.coeffs() = vec; - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_QUATERNION_H diff --git a/Eigen/src/Geometry/Rotation2D.h b/Eigen/src/Geometry/Rotation2D.h deleted file mode 100644 index 884b7d0ee..000000000 --- a/Eigen/src/Geometry/Rotation2D.h +++ /dev/null @@ -1,199 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ROTATION2D_H -#define EIGEN_ROTATION2D_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class Rotation2D - * - * \brief Represents a rotation/orientation in a 2 dimensional space. - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients - * - * This class is equivalent to a single scalar representing a counter clock wise rotation - * as a single angle in radian. It provides some additional features such as the automatic - * conversion from/to a 2x2 rotation matrix. Moreover this class aims to provide a similar - * interface to Quaternion in order to facilitate the writing of generic algorithms - * dealing with rotations. - * - * \sa class Quaternion, class Transform - */ - -namespace internal { - -template struct traits > -{ - typedef _Scalar Scalar; -}; -} // end namespace internal - -template -class Rotation2D : public RotationBase,2> -{ - typedef RotationBase,2> Base; - -public: - - using Base::operator*; - - enum { Dim = 2 }; - /** the scalar type of the coefficients */ - typedef _Scalar Scalar; - typedef Matrix Vector2; - typedef Matrix Matrix2; - -protected: - - Scalar m_angle; - -public: - - /** Construct a 2D counter clock wise rotation from the angle \a a in radian. */ - EIGEN_DEVICE_FUNC explicit inline Rotation2D(const Scalar& a) : m_angle(a) {} - - /** Default constructor wihtout initialization. The represented rotation is undefined. */ - EIGEN_DEVICE_FUNC Rotation2D() {} - - /** Construct a 2D rotation from a 2x2 rotation matrix \a mat. - * - * \sa fromRotationMatrix() - */ - template - EIGEN_DEVICE_FUNC explicit Rotation2D(const MatrixBase& m) - { - fromRotationMatrix(m.derived()); - } - - /** \returns the rotation angle */ - EIGEN_DEVICE_FUNC inline Scalar angle() const { return m_angle; } - - /** \returns a read-write reference to the rotation angle */ - EIGEN_DEVICE_FUNC inline Scalar& angle() { return m_angle; } - - /** \returns the rotation angle in [0,2pi] */ - EIGEN_DEVICE_FUNC inline Scalar smallestPositiveAngle() const { - Scalar tmp = numext::fmod(m_angle,Scalar(2*EIGEN_PI)); - return tmpScalar(EIGEN_PI)) tmp -= Scalar(2*EIGEN_PI); - else if(tmp<-Scalar(EIGEN_PI)) tmp += Scalar(2*EIGEN_PI); - return tmp; - } - - /** \returns the inverse rotation */ - EIGEN_DEVICE_FUNC inline Rotation2D inverse() const { return Rotation2D(-m_angle); } - - /** Concatenates two rotations */ - EIGEN_DEVICE_FUNC inline Rotation2D operator*(const Rotation2D& other) const - { return Rotation2D(m_angle + other.m_angle); } - - /** Concatenates two rotations */ - EIGEN_DEVICE_FUNC inline Rotation2D& operator*=(const Rotation2D& other) - { m_angle += other.m_angle; return *this; } - - /** Applies the rotation to a 2D vector */ - EIGEN_DEVICE_FUNC Vector2 operator* (const Vector2& vec) const - { return toRotationMatrix() * vec; } - - template - EIGEN_DEVICE_FUNC Rotation2D& fromRotationMatrix(const MatrixBase& m); - EIGEN_DEVICE_FUNC Matrix2 toRotationMatrix() const; - - /** Set \c *this from a 2x2 rotation matrix \a mat. - * In other words, this function extract the rotation angle from the rotation matrix. - * - * This method is an alias for fromRotationMatrix() - * - * \sa fromRotationMatrix() - */ - template - EIGEN_DEVICE_FUNC Rotation2D& operator=(const MatrixBase& m) - { return fromRotationMatrix(m.derived()); } - - /** \returns the spherical interpolation between \c *this and \a other using - * parameter \a t. It is in fact equivalent to a linear interpolation. - */ - EIGEN_DEVICE_FUNC inline Rotation2D slerp(const Scalar& t, const Rotation2D& other) const - { - Scalar dist = Rotation2D(other.m_angle-m_angle).smallestAngle(); - return Rotation2D(m_angle + dist*t); - } - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { return typename internal::cast_return_type >::type(*this); } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit Rotation2D(const Rotation2D& other) - { - m_angle = Scalar(other.angle()); - } - - EIGEN_DEVICE_FUNC static inline Rotation2D Identity() { return Rotation2D(0); } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - EIGEN_DEVICE_FUNC bool isApprox(const Rotation2D& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return internal::isApprox(m_angle,other.m_angle, prec); } - -}; - -/** \ingroup Geometry_Module - * single precision 2D rotation type */ -typedef Rotation2D Rotation2Df; -/** \ingroup Geometry_Module - * double precision 2D rotation type */ -typedef Rotation2D Rotation2Dd; - -/** Set \c *this from a 2x2 rotation matrix \a mat. - * In other words, this function extract the rotation angle - * from the rotation matrix. - */ -template -template -EIGEN_DEVICE_FUNC Rotation2D& Rotation2D::fromRotationMatrix(const MatrixBase& mat) -{ - EIGEN_USING_STD_MATH(atan2) - EIGEN_STATIC_ASSERT(Derived::RowsAtCompileTime==2 && Derived::ColsAtCompileTime==2,YOU_MADE_A_PROGRAMMING_MISTAKE) - m_angle = atan2(mat.coeff(1,0), mat.coeff(0,0)); - return *this; -} - -/** Constructs and \returns an equivalent 2x2 rotation matrix. - */ -template -typename Rotation2D::Matrix2 -EIGEN_DEVICE_FUNC Rotation2D::toRotationMatrix(void) const -{ - EIGEN_USING_STD_MATH(sin) - EIGEN_USING_STD_MATH(cos) - Scalar sinA = sin(m_angle); - Scalar cosA = cos(m_angle); - return (Matrix2() << cosA, -sinA, sinA, cosA).finished(); -} - -} // end namespace Eigen - -#endif // EIGEN_ROTATION2D_H diff --git a/Eigen/src/Geometry/RotationBase.h b/Eigen/src/Geometry/RotationBase.h deleted file mode 100644 index f0ee0bd03..000000000 --- a/Eigen/src/Geometry/RotationBase.h +++ /dev/null @@ -1,206 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ROTATIONBASE_H -#define EIGEN_ROTATIONBASE_H - -namespace Eigen { - -// forward declaration -namespace internal { -template -struct rotation_base_generic_product_selector; -} - -/** \class RotationBase - * - * \brief Common base class for compact rotation representations - * - * \tparam Derived is the derived type, i.e., a rotation type - * \tparam _Dim the dimension of the space - */ -template -class RotationBase -{ - public: - enum { Dim = _Dim }; - /** the scalar type of the coefficients */ - typedef typename internal::traits::Scalar Scalar; - - /** corresponding linear transformation matrix type */ - typedef Matrix RotationMatrixType; - typedef Matrix VectorType; - - public: - EIGEN_DEVICE_FUNC inline const Derived& derived() const { return *static_cast(this); } - EIGEN_DEVICE_FUNC inline Derived& derived() { return *static_cast(this); } - - /** \returns an equivalent rotation matrix */ - EIGEN_DEVICE_FUNC inline RotationMatrixType toRotationMatrix() const { return derived().toRotationMatrix(); } - - /** \returns an equivalent rotation matrix - * This function is added to be conform with the Transform class' naming scheme. - */ - EIGEN_DEVICE_FUNC inline RotationMatrixType matrix() const { return derived().toRotationMatrix(); } - - /** \returns the inverse rotation */ - EIGEN_DEVICE_FUNC inline Derived inverse() const { return derived().inverse(); } - - /** \returns the concatenation of the rotation \c *this with a translation \a t */ - EIGEN_DEVICE_FUNC inline Transform operator*(const Translation& t) const - { return Transform(*this) * t; } - - /** \returns the concatenation of the rotation \c *this with a uniform scaling \a s */ - EIGEN_DEVICE_FUNC inline RotationMatrixType operator*(const UniformScaling& s) const - { return toRotationMatrix() * s.factor(); } - - /** \returns the concatenation of the rotation \c *this with a generic expression \a e - * \a e can be: - * - a DimxDim linear transformation matrix - * - a DimxDim diagonal matrix (axis aligned scaling) - * - a vector of size Dim - */ - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE typename internal::rotation_base_generic_product_selector::ReturnType - operator*(const EigenBase& e) const - { return internal::rotation_base_generic_product_selector::run(derived(), e.derived()); } - - /** \returns the concatenation of a linear transformation \a l with the rotation \a r */ - template friend - EIGEN_DEVICE_FUNC inline RotationMatrixType operator*(const EigenBase& l, const Derived& r) - { return l.derived() * r.toRotationMatrix(); } - - /** \returns the concatenation of a scaling \a l with the rotation \a r */ - EIGEN_DEVICE_FUNC friend inline Transform operator*(const DiagonalMatrix& l, const Derived& r) - { - Transform res(r); - res.linear().applyOnTheLeft(l); - return res; - } - - /** \returns the concatenation of the rotation \c *this with a transformation \a t */ - template - EIGEN_DEVICE_FUNC inline Transform operator*(const Transform& t) const - { return toRotationMatrix() * t; } - - template - EIGEN_DEVICE_FUNC inline VectorType _transformVector(const OtherVectorType& v) const - { return toRotationMatrix() * v; } -}; - -namespace internal { - -// implementation of the generic product rotation * matrix -template -struct rotation_base_generic_product_selector -{ - enum { Dim = RotationDerived::Dim }; - typedef Matrix ReturnType; - EIGEN_DEVICE_FUNC static inline ReturnType run(const RotationDerived& r, const MatrixType& m) - { return r.toRotationMatrix() * m; } -}; - -template -struct rotation_base_generic_product_selector< RotationDerived, DiagonalMatrix, false > -{ - typedef Transform ReturnType; - EIGEN_DEVICE_FUNC static inline ReturnType run(const RotationDerived& r, const DiagonalMatrix& m) - { - ReturnType res(r); - res.linear() *= m; - return res; - } -}; - -template -struct rotation_base_generic_product_selector -{ - enum { Dim = RotationDerived::Dim }; - typedef Matrix ReturnType; - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE ReturnType run(const RotationDerived& r, const OtherVectorType& v) - { - return r._transformVector(v); - } -}; - -} // end namespace internal - -/** \geometry_module - * - * \brief Constructs a Dim x Dim rotation matrix from the rotation \a r - */ -template -template -EIGEN_DEVICE_FUNC Matrix<_Scalar, _Rows, _Cols, _Storage, _MaxRows, _MaxCols> -::Matrix(const RotationBase& r) -{ - EIGEN_STATIC_ASSERT_MATRIX_SPECIFIC_SIZE(Matrix,int(OtherDerived::Dim),int(OtherDerived::Dim)) - *this = r.toRotationMatrix(); -} - -/** \geometry_module - * - * \brief Set a Dim x Dim rotation matrix from the rotation \a r - */ -template -template -EIGEN_DEVICE_FUNC Matrix<_Scalar, _Rows, _Cols, _Storage, _MaxRows, _MaxCols>& -Matrix<_Scalar, _Rows, _Cols, _Storage, _MaxRows, _MaxCols> -::operator=(const RotationBase& r) -{ - EIGEN_STATIC_ASSERT_MATRIX_SPECIFIC_SIZE(Matrix,int(OtherDerived::Dim),int(OtherDerived::Dim)) - return *this = r.toRotationMatrix(); -} - -namespace internal { - -/** \internal - * - * Helper function to return an arbitrary rotation object to a rotation matrix. - * - * \tparam Scalar the numeric type of the matrix coefficients - * \tparam Dim the dimension of the current space - * - * It returns a Dim x Dim fixed size matrix. - * - * Default specializations are provided for: - * - any scalar type (2D), - * - any matrix expression, - * - any type based on RotationBase (e.g., Quaternion, AngleAxis, Rotation2D) - * - * Currently toRotationMatrix is only used by Transform. - * - * \sa class Transform, class Rotation2D, class Quaternion, class AngleAxis - */ -template -EIGEN_DEVICE_FUNC static inline Matrix toRotationMatrix(const Scalar& s) -{ - EIGEN_STATIC_ASSERT(Dim==2,YOU_MADE_A_PROGRAMMING_MISTAKE) - return Rotation2D(s).toRotationMatrix(); -} - -template -EIGEN_DEVICE_FUNC static inline Matrix toRotationMatrix(const RotationBase& r) -{ - return r.toRotationMatrix(); -} - -template -EIGEN_DEVICE_FUNC static inline const MatrixBase& toRotationMatrix(const MatrixBase& mat) -{ - EIGEN_STATIC_ASSERT(OtherDerived::RowsAtCompileTime==Dim && OtherDerived::ColsAtCompileTime==Dim, - YOU_MADE_A_PROGRAMMING_MISTAKE) - return mat; -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_ROTATIONBASE_H diff --git a/Eigen/src/Geometry/Scaling.h b/Eigen/src/Geometry/Scaling.h deleted file mode 100755 index 8d9acf252..000000000 --- a/Eigen/src/Geometry/Scaling.h +++ /dev/null @@ -1,188 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SCALING_H -#define EIGEN_SCALING_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class Scaling - * - * \brief Represents a generic uniform scaling transformation - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients. - * - * This class represent a uniform scaling transformation. It is the return - * type of Scaling(Scalar), and most of the time this is the only way it - * is used. In particular, this class is not aimed to be used to store a scaling transformation, - * but rather to make easier the constructions and updates of Transform objects. - * - * To represent an axis aligned scaling, use the DiagonalMatrix class. - * - * \sa Scaling(), class DiagonalMatrix, MatrixBase::asDiagonal(), class Translation, class Transform - */ - -namespace internal -{ - // This helper helps nvcc+MSVC to properly parse this file. - // See bug 1412. - template - struct uniformscaling_times_affine_returntype - { - enum - { - NewMode = int(Mode) == int(Isometry) ? Affine : Mode - }; - typedef Transform type; - }; -} - -template -class UniformScaling -{ -public: - /** the scalar type of the coefficients */ - typedef _Scalar Scalar; - -protected: - - Scalar m_factor; - -public: - - /** Default constructor without initialization. */ - UniformScaling() {} - /** Constructs and initialize a uniform scaling transformation */ - explicit inline UniformScaling(const Scalar& s) : m_factor(s) {} - - inline const Scalar& factor() const { return m_factor; } - inline Scalar& factor() { return m_factor; } - - /** Concatenates two uniform scaling */ - inline UniformScaling operator* (const UniformScaling& other) const - { return UniformScaling(m_factor * other.factor()); } - - /** Concatenates a uniform scaling and a translation */ - template - inline Transform operator* (const Translation& t) const; - - /** Concatenates a uniform scaling and an affine transformation */ - template - inline typename - internal::uniformscaling_times_affine_returntype::type - operator* (const Transform& t) const - { - typename internal::uniformscaling_times_affine_returntype::type res = t; - res.prescale(factor()); - return res; - } - - /** Concatenates a uniform scaling and a linear transformation matrix */ - // TODO returns an expression - template - inline typename Eigen::internal::plain_matrix_type::type operator* (const MatrixBase& other) const - { return other * m_factor; } - - template - inline Matrix operator*(const RotationBase& r) const - { return r.toRotationMatrix() * m_factor; } - - /** \returns the inverse scaling */ - inline UniformScaling inverse() const - { return UniformScaling(Scalar(1)/m_factor); } - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - inline UniformScaling cast() const - { return UniformScaling(NewScalarType(m_factor)); } - - /** Copy constructor with scalar type conversion */ - template - inline explicit UniformScaling(const UniformScaling& other) - { m_factor = Scalar(other.factor()); } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - bool isApprox(const UniformScaling& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return internal::isApprox(m_factor, other.factor(), prec); } - -}; - -/** \addtogroup Geometry_Module */ -//@{ - -/** Concatenates a linear transformation matrix and a uniform scaling - * \relates UniformScaling - */ -// NOTE this operator is defiend in MatrixBase and not as a friend function -// of UniformScaling to fix an internal crash of Intel's ICC -template -EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE(Derived,Scalar,product) -operator*(const MatrixBase& matrix, const UniformScaling& s) -{ return matrix.derived() * s.factor(); } - -/** Constructs a uniform scaling from scale factor \a s */ -inline UniformScaling Scaling(float s) { return UniformScaling(s); } -/** Constructs a uniform scaling from scale factor \a s */ -inline UniformScaling Scaling(double s) { return UniformScaling(s); } -/** Constructs a uniform scaling from scale factor \a s */ -template -inline UniformScaling > Scaling(const std::complex& s) -{ return UniformScaling >(s); } - -/** Constructs a 2D axis aligned scaling */ -template -inline DiagonalMatrix Scaling(const Scalar& sx, const Scalar& sy) -{ return DiagonalMatrix(sx, sy); } -/** Constructs a 3D axis aligned scaling */ -template -inline DiagonalMatrix Scaling(const Scalar& sx, const Scalar& sy, const Scalar& sz) -{ return DiagonalMatrix(sx, sy, sz); } - -/** Constructs an axis aligned scaling expression from vector expression \a coeffs - * This is an alias for coeffs.asDiagonal() - */ -template -inline const DiagonalWrapper Scaling(const MatrixBase& coeffs) -{ return coeffs.asDiagonal(); } - -/** \deprecated */ -typedef DiagonalMatrix AlignedScaling2f; -/** \deprecated */ -typedef DiagonalMatrix AlignedScaling2d; -/** \deprecated */ -typedef DiagonalMatrix AlignedScaling3f; -/** \deprecated */ -typedef DiagonalMatrix AlignedScaling3d; -//@} - -template -template -inline Transform -UniformScaling::operator* (const Translation& t) const -{ - Transform res; - res.matrix().setZero(); - res.linear().diagonal().fill(factor()); - res.translation() = factor() * t.vector(); - res(Dim,Dim) = Scalar(1); - return res; -} - -} // end namespace Eigen - -#endif // EIGEN_SCALING_H diff --git a/Eigen/src/Geometry/Transform.h b/Eigen/src/Geometry/Transform.h deleted file mode 100644 index 2d36dfadf..000000000 --- a/Eigen/src/Geometry/Transform.h +++ /dev/null @@ -1,1542 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// Copyright (C) 2009 Benoit Jacob -// Copyright (C) 2010 Hauke Heibel -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRANSFORM_H -#define EIGEN_TRANSFORM_H - -namespace Eigen { - -namespace internal { - -template -struct transform_traits -{ - enum - { - Dim = Transform::Dim, - HDim = Transform::HDim, - Mode = Transform::Mode, - IsProjective = (int(Mode)==int(Projective)) - }; -}; - -template< typename TransformType, - typename MatrixType, - int Case = transform_traits::IsProjective ? 0 - : int(MatrixType::RowsAtCompileTime) == int(transform_traits::HDim) ? 1 - : 2, - int RhsCols = MatrixType::ColsAtCompileTime> -struct transform_right_product_impl; - -template< typename Other, - int Mode, - int Options, - int Dim, - int HDim, - int OtherRows=Other::RowsAtCompileTime, - int OtherCols=Other::ColsAtCompileTime> -struct transform_left_product_impl; - -template< typename Lhs, - typename Rhs, - bool AnyProjective = - transform_traits::IsProjective || - transform_traits::IsProjective> -struct transform_transform_product_impl; - -template< typename Other, - int Mode, - int Options, - int Dim, - int HDim, - int OtherRows=Other::RowsAtCompileTime, - int OtherCols=Other::ColsAtCompileTime> -struct transform_construct_from_matrix; - -template struct transform_take_affine_part; - -template -struct traits > -{ - typedef _Scalar Scalar; - typedef Eigen::Index StorageIndex; - typedef Dense StorageKind; - enum { - Dim1 = _Dim==Dynamic ? _Dim : _Dim + 1, - RowsAtCompileTime = _Mode==Projective ? Dim1 : _Dim, - ColsAtCompileTime = Dim1, - MaxRowsAtCompileTime = RowsAtCompileTime, - MaxColsAtCompileTime = ColsAtCompileTime, - Flags = 0 - }; -}; - -template struct transform_make_affine; - -} // end namespace internal - -/** \geometry_module \ingroup Geometry_Module - * - * \class Transform - * - * \brief Represents an homogeneous transformation in a N dimensional space - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients - * \tparam _Dim the dimension of the space - * \tparam _Mode the type of the transformation. Can be: - * - #Affine: the transformation is stored as a (Dim+1)^2 matrix, - * where the last row is assumed to be [0 ... 0 1]. - * - #AffineCompact: the transformation is stored as a (Dim)x(Dim+1) matrix. - * - #Projective: the transformation is stored as a (Dim+1)^2 matrix - * without any assumption. - * \tparam _Options has the same meaning as in class Matrix. It allows to specify DontAlign and/or RowMajor. - * These Options are passed directly to the underlying matrix type. - * - * The homography is internally represented and stored by a matrix which - * is available through the matrix() method. To understand the behavior of - * this class you have to think a Transform object as its internal - * matrix representation. The chosen convention is right multiply: - * - * \code v' = T * v \endcode - * - * Therefore, an affine transformation matrix M is shaped like this: - * - * \f$ \left( \begin{array}{cc} - * linear & translation\\ - * 0 ... 0 & 1 - * \end{array} \right) \f$ - * - * Note that for a projective transformation the last row can be anything, - * and then the interpretation of different parts might be sightly different. - * - * However, unlike a plain matrix, the Transform class provides many features - * simplifying both its assembly and usage. In particular, it can be composed - * with any other transformations (Transform,Translation,RotationBase,DiagonalMatrix) - * and can be directly used to transform implicit homogeneous vectors. All these - * operations are handled via the operator*. For the composition of transformations, - * its principle consists to first convert the right/left hand sides of the product - * to a compatible (Dim+1)^2 matrix and then perform a pure matrix product. - * Of course, internally, operator* tries to perform the minimal number of operations - * according to the nature of each terms. Likewise, when applying the transform - * to points, the latters are automatically promoted to homogeneous vectors - * before doing the matrix product. The conventions to homogeneous representations - * are performed as follow: - * - * \b Translation t (Dim)x(1): - * \f$ \left( \begin{array}{cc} - * I & t \\ - * 0\,...\,0 & 1 - * \end{array} \right) \f$ - * - * \b Rotation R (Dim)x(Dim): - * \f$ \left( \begin{array}{cc} - * R & 0\\ - * 0\,...\,0 & 1 - * \end{array} \right) \f$ - * - * \b Scaling \b DiagonalMatrix S (Dim)x(Dim): - * \f$ \left( \begin{array}{cc} - * S & 0\\ - * 0\,...\,0 & 1 - * \end{array} \right) \f$ - * - * \b Column \b point v (Dim)x(1): - * \f$ \left( \begin{array}{c} - * v\\ - * 1 - * \end{array} \right) \f$ - * - * \b Set \b of \b column \b points V1...Vn (Dim)x(n): - * \f$ \left( \begin{array}{ccc} - * v_1 & ... & v_n\\ - * 1 & ... & 1 - * \end{array} \right) \f$ - * - * The concatenation of a Transform object with any kind of other transformation - * always returns a Transform object. - * - * A little exception to the "as pure matrix product" rule is the case of the - * transformation of non homogeneous vectors by an affine transformation. In - * that case the last matrix row can be ignored, and the product returns non - * homogeneous vectors. - * - * Since, for instance, a Dim x Dim matrix is interpreted as a linear transformation, - * it is not possible to directly transform Dim vectors stored in a Dim x Dim matrix. - * The solution is either to use a Dim x Dynamic matrix or explicitly request a - * vector transformation by making the vector homogeneous: - * \code - * m' = T * m.colwise().homogeneous(); - * \endcode - * Note that there is zero overhead. - * - * Conversion methods from/to Qt's QMatrix and QTransform are available if the - * preprocessor token EIGEN_QT_SUPPORT is defined. - * - * This class can be extended with the help of the plugin mechanism described on the page - * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_TRANSFORM_PLUGIN. - * - * \sa class Matrix, class Quaternion - */ -template -class Transform -{ -public: - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)) - enum { - Mode = _Mode, - Options = _Options, - Dim = _Dim, ///< space dimension in which the transformation holds - HDim = _Dim+1, ///< size of a respective homogeneous vector - Rows = int(Mode)==(AffineCompact) ? Dim : HDim - }; - /** the scalar type of the coefficients */ - typedef _Scalar Scalar; - typedef Eigen::Index StorageIndex; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - /** type of the matrix used to represent the transformation */ - typedef typename internal::make_proper_matrix_type::type MatrixType; - /** constified MatrixType */ - typedef const MatrixType ConstMatrixType; - /** type of the matrix used to represent the linear part of the transformation */ - typedef Matrix LinearMatrixType; - /** type of read/write reference to the linear part of the transformation */ - typedef Block LinearPart; - /** type of read reference to the linear part of the transformation */ - typedef const Block ConstLinearPart; - /** type of read/write reference to the affine part of the transformation */ - typedef typename internal::conditional >::type AffinePart; - /** type of read reference to the affine part of the transformation */ - typedef typename internal::conditional >::type ConstAffinePart; - /** type of a vector */ - typedef Matrix VectorType; - /** type of a read/write reference to the translation part of the rotation */ - typedef Block::Flags & RowMajorBit)> TranslationPart; - /** type of a read reference to the translation part of the rotation */ - typedef const Block::Flags & RowMajorBit)> ConstTranslationPart; - /** corresponding translation type */ - typedef Translation TranslationType; - - // this intermediate enum is needed to avoid an ICE with gcc 3.4 and 4.0 - enum { TransformTimeDiagonalMode = ((Mode==int(Isometry))?Affine:int(Mode)) }; - /** The return type of the product between a diagonal matrix and a transform */ - typedef Transform TransformTimeDiagonalReturnType; - -protected: - - MatrixType m_matrix; - -public: - - /** Default constructor without initialization of the meaningful coefficients. - * If Mode==Affine, then the last row is set to [0 ... 0 1] */ - EIGEN_DEVICE_FUNC inline Transform() - { - check_template_params(); - internal::transform_make_affine<(int(Mode)==Affine) ? Affine : AffineCompact>::run(m_matrix); - } - - EIGEN_DEVICE_FUNC inline Transform(const Transform& other) - { - check_template_params(); - m_matrix = other.m_matrix; - } - - EIGEN_DEVICE_FUNC inline explicit Transform(const TranslationType& t) - { - check_template_params(); - *this = t; - } - EIGEN_DEVICE_FUNC inline explicit Transform(const UniformScaling& s) - { - check_template_params(); - *this = s; - } - template - EIGEN_DEVICE_FUNC inline explicit Transform(const RotationBase& r) - { - check_template_params(); - *this = r; - } - - EIGEN_DEVICE_FUNC inline Transform& operator=(const Transform& other) - { m_matrix = other.m_matrix; return *this; } - - typedef internal::transform_take_affine_part take_affine_part; - - /** Constructs and initializes a transformation from a Dim^2 or a (Dim+1)^2 matrix. */ - template - EIGEN_DEVICE_FUNC inline explicit Transform(const EigenBase& other) - { - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY); - - check_template_params(); - internal::transform_construct_from_matrix::run(this, other.derived()); - } - - /** Set \c *this from a Dim^2 or (Dim+1)^2 matrix. */ - template - EIGEN_DEVICE_FUNC inline Transform& operator=(const EigenBase& other) - { - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY); - - internal::transform_construct_from_matrix::run(this, other.derived()); - return *this; - } - - template - EIGEN_DEVICE_FUNC inline Transform(const Transform& other) - { - check_template_params(); - // only the options change, we can directly copy the matrices - m_matrix = other.matrix(); - } - - template - EIGEN_DEVICE_FUNC inline Transform(const Transform& other) - { - check_template_params(); - // prevent conversions as: - // Affine | AffineCompact | Isometry = Projective - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(OtherMode==int(Projective), Mode==int(Projective)), - YOU_PERFORMED_AN_INVALID_TRANSFORMATION_CONVERSION) - - // prevent conversions as: - // Isometry = Affine | AffineCompact - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(OtherMode==int(Affine)||OtherMode==int(AffineCompact), Mode!=int(Isometry)), - YOU_PERFORMED_AN_INVALID_TRANSFORMATION_CONVERSION) - - enum { ModeIsAffineCompact = Mode == int(AffineCompact), - OtherModeIsAffineCompact = OtherMode == int(AffineCompact) - }; - - if(EIGEN_CONST_CONDITIONAL(ModeIsAffineCompact == OtherModeIsAffineCompact)) - { - // We need the block expression because the code is compiled for all - // combinations of transformations and will trigger a compile time error - // if one tries to assign the matrices directly - m_matrix.template block(0,0) = other.matrix().template block(0,0); - makeAffine(); - } - else if(EIGEN_CONST_CONDITIONAL(OtherModeIsAffineCompact)) - { - typedef typename Transform::MatrixType OtherMatrixType; - internal::transform_construct_from_matrix::run(this, other.matrix()); - } - else - { - // here we know that Mode == AffineCompact and OtherMode != AffineCompact. - // if OtherMode were Projective, the static assert above would already have caught it. - // So the only possibility is that OtherMode == Affine - linear() = other.linear(); - translation() = other.translation(); - } - } - - template - EIGEN_DEVICE_FUNC Transform(const ReturnByValue& other) - { - check_template_params(); - other.evalTo(*this); - } - - template - EIGEN_DEVICE_FUNC Transform& operator=(const ReturnByValue& other) - { - other.evalTo(*this); - return *this; - } - - #ifdef EIGEN_QT_SUPPORT - inline Transform(const QMatrix& other); - inline Transform& operator=(const QMatrix& other); - inline QMatrix toQMatrix(void) const; - inline Transform(const QTransform& other); - inline Transform& operator=(const QTransform& other); - inline QTransform toQTransform(void) const; - #endif - - EIGEN_DEVICE_FUNC Index rows() const { return int(Mode)==int(Projective) ? m_matrix.cols() : (m_matrix.cols()-1); } - EIGEN_DEVICE_FUNC Index cols() const { return m_matrix.cols(); } - - /** shortcut for m_matrix(row,col); - * \sa MatrixBase::operator(Index,Index) const */ - EIGEN_DEVICE_FUNC inline Scalar operator() (Index row, Index col) const { return m_matrix(row,col); } - /** shortcut for m_matrix(row,col); - * \sa MatrixBase::operator(Index,Index) */ - EIGEN_DEVICE_FUNC inline Scalar& operator() (Index row, Index col) { return m_matrix(row,col); } - - /** \returns a read-only expression of the transformation matrix */ - EIGEN_DEVICE_FUNC inline const MatrixType& matrix() const { return m_matrix; } - /** \returns a writable expression of the transformation matrix */ - EIGEN_DEVICE_FUNC inline MatrixType& matrix() { return m_matrix; } - - /** \returns a read-only expression of the linear part of the transformation */ - EIGEN_DEVICE_FUNC inline ConstLinearPart linear() const { return ConstLinearPart(m_matrix,0,0); } - /** \returns a writable expression of the linear part of the transformation */ - EIGEN_DEVICE_FUNC inline LinearPart linear() { return LinearPart(m_matrix,0,0); } - - /** \returns a read-only expression of the Dim x HDim affine part of the transformation */ - EIGEN_DEVICE_FUNC inline ConstAffinePart affine() const { return take_affine_part::run(m_matrix); } - /** \returns a writable expression of the Dim x HDim affine part of the transformation */ - EIGEN_DEVICE_FUNC inline AffinePart affine() { return take_affine_part::run(m_matrix); } - - /** \returns a read-only expression of the translation vector of the transformation */ - EIGEN_DEVICE_FUNC inline ConstTranslationPart translation() const { return ConstTranslationPart(m_matrix,0,Dim); } - /** \returns a writable expression of the translation vector of the transformation */ - EIGEN_DEVICE_FUNC inline TranslationPart translation() { return TranslationPart(m_matrix,0,Dim); } - - /** \returns an expression of the product between the transform \c *this and a matrix expression \a other. - * - * The right-hand-side \a other can be either: - * \li an homogeneous vector of size Dim+1, - * \li a set of homogeneous vectors of size Dim+1 x N, - * \li a transformation matrix of size Dim+1 x Dim+1. - * - * Moreover, if \c *this represents an affine transformation (i.e., Mode!=Projective), then \a other can also be: - * \li a point of size Dim (computes: \code this->linear() * other + this->translation()\endcode), - * \li a set of N points as a Dim x N matrix (computes: \code (this->linear() * other).colwise() + this->translation()\endcode), - * - * In all cases, the return type is a matrix or vector of same sizes as the right-hand-side \a other. - * - * If you want to interpret \a other as a linear or affine transformation, then first convert it to a Transform<> type, - * or do your own cooking. - * - * Finally, if you want to apply Affine transformations to vectors, then explicitly apply the linear part only: - * \code - * Affine3f A; - * Vector3f v1, v2; - * v2 = A.linear() * v1; - * \endcode - * - */ - // note: this function is defined here because some compilers cannot find the respective declaration - template - EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const typename internal::transform_right_product_impl::ResultType - operator * (const EigenBase &other) const - { return internal::transform_right_product_impl::run(*this,other.derived()); } - - /** \returns the product expression of a transformation matrix \a a times a transform \a b - * - * The left hand side \a other can be either: - * \li a linear transformation matrix of size Dim x Dim, - * \li an affine transformation matrix of size Dim x Dim+1, - * \li a general transformation matrix of size Dim+1 x Dim+1. - */ - template friend - EIGEN_DEVICE_FUNC inline const typename internal::transform_left_product_impl::ResultType - operator * (const EigenBase &a, const Transform &b) - { return internal::transform_left_product_impl::run(a.derived(),b); } - - /** \returns The product expression of a transform \a a times a diagonal matrix \a b - * - * The rhs diagonal matrix is interpreted as an affine scaling transformation. The - * product results in a Transform of the same type (mode) as the lhs only if the lhs - * mode is no isometry. In that case, the returned transform is an affinity. - */ - template - EIGEN_DEVICE_FUNC inline const TransformTimeDiagonalReturnType - operator * (const DiagonalBase &b) const - { - TransformTimeDiagonalReturnType res(*this); - res.linearExt() *= b; - return res; - } - - /** \returns The product expression of a diagonal matrix \a a times a transform \a b - * - * The lhs diagonal matrix is interpreted as an affine scaling transformation. The - * product results in a Transform of the same type (mode) as the lhs only if the lhs - * mode is no isometry. In that case, the returned transform is an affinity. - */ - template - EIGEN_DEVICE_FUNC friend inline TransformTimeDiagonalReturnType - operator * (const DiagonalBase &a, const Transform &b) - { - TransformTimeDiagonalReturnType res; - res.linear().noalias() = a*b.linear(); - res.translation().noalias() = a*b.translation(); - if (EIGEN_CONST_CONDITIONAL(Mode!=int(AffineCompact))) - res.matrix().row(Dim) = b.matrix().row(Dim); - return res; - } - - template - EIGEN_DEVICE_FUNC inline Transform& operator*=(const EigenBase& other) { return *this = *this * other; } - - /** Concatenates two transformations */ - EIGEN_DEVICE_FUNC inline const Transform operator * (const Transform& other) const - { - return internal::transform_transform_product_impl::run(*this,other); - } - - #if EIGEN_COMP_ICC -private: - // this intermediate structure permits to workaround a bug in ICC 11: - // error: template instantiation resulted in unexpected function type of "Eigen::Transform - // (const Eigen::Transform &) const" - // (the meaning of a name may have changed since the template declaration -- the type of the template is: - // "Eigen::internal::transform_transform_product_impl, - // Eigen::Transform, >::ResultType (const Eigen::Transform &) const") - // - template struct icc_11_workaround - { - typedef internal::transform_transform_product_impl > ProductType; - typedef typename ProductType::ResultType ResultType; - }; - -public: - /** Concatenates two different transformations */ - template - inline typename icc_11_workaround::ResultType - operator * (const Transform& other) const - { - typedef typename icc_11_workaround::ProductType ProductType; - return ProductType::run(*this,other); - } - #else - /** Concatenates two different transformations */ - template - EIGEN_DEVICE_FUNC inline typename internal::transform_transform_product_impl >::ResultType - operator * (const Transform& other) const - { - return internal::transform_transform_product_impl >::run(*this,other); - } - #endif - - /** \sa MatrixBase::setIdentity() */ - EIGEN_DEVICE_FUNC void setIdentity() { m_matrix.setIdentity(); } - - /** - * \brief Returns an identity transformation. - * \todo In the future this function should be returning a Transform expression. - */ - EIGEN_DEVICE_FUNC static const Transform Identity() - { - return Transform(MatrixType::Identity()); - } - - template - EIGEN_DEVICE_FUNC - inline Transform& scale(const MatrixBase &other); - - template - EIGEN_DEVICE_FUNC - inline Transform& prescale(const MatrixBase &other); - - EIGEN_DEVICE_FUNC inline Transform& scale(const Scalar& s); - EIGEN_DEVICE_FUNC inline Transform& prescale(const Scalar& s); - - template - EIGEN_DEVICE_FUNC - inline Transform& translate(const MatrixBase &other); - - template - EIGEN_DEVICE_FUNC - inline Transform& pretranslate(const MatrixBase &other); - - template - EIGEN_DEVICE_FUNC - inline Transform& rotate(const RotationType& rotation); - - template - EIGEN_DEVICE_FUNC - inline Transform& prerotate(const RotationType& rotation); - - EIGEN_DEVICE_FUNC Transform& shear(const Scalar& sx, const Scalar& sy); - EIGEN_DEVICE_FUNC Transform& preshear(const Scalar& sx, const Scalar& sy); - - EIGEN_DEVICE_FUNC inline Transform& operator=(const TranslationType& t); - - EIGEN_DEVICE_FUNC - inline Transform& operator*=(const TranslationType& t) { return translate(t.vector()); } - - EIGEN_DEVICE_FUNC inline Transform operator*(const TranslationType& t) const; - - EIGEN_DEVICE_FUNC - inline Transform& operator=(const UniformScaling& t); - - EIGEN_DEVICE_FUNC - inline Transform& operator*=(const UniformScaling& s) { return scale(s.factor()); } - - EIGEN_DEVICE_FUNC - inline TransformTimeDiagonalReturnType operator*(const UniformScaling& s) const - { - TransformTimeDiagonalReturnType res = *this; - res.scale(s.factor()); - return res; - } - - EIGEN_DEVICE_FUNC - inline Transform& operator*=(const DiagonalMatrix& s) { linearExt() *= s; return *this; } - - template - EIGEN_DEVICE_FUNC inline Transform& operator=(const RotationBase& r); - template - EIGEN_DEVICE_FUNC inline Transform& operator*=(const RotationBase& r) { return rotate(r.toRotationMatrix()); } - template - EIGEN_DEVICE_FUNC inline Transform operator*(const RotationBase& r) const; - - EIGEN_DEVICE_FUNC const LinearMatrixType rotation() const; - template - EIGEN_DEVICE_FUNC - void computeRotationScaling(RotationMatrixType *rotation, ScalingMatrixType *scaling) const; - template - EIGEN_DEVICE_FUNC - void computeScalingRotation(ScalingMatrixType *scaling, RotationMatrixType *rotation) const; - - template - EIGEN_DEVICE_FUNC - Transform& fromPositionOrientationScale(const MatrixBase &position, - const OrientationType& orientation, const MatrixBase &scale); - - EIGEN_DEVICE_FUNC - inline Transform inverse(TransformTraits traits = (TransformTraits)Mode) const; - - /** \returns a const pointer to the column major internal matrix */ - EIGEN_DEVICE_FUNC const Scalar* data() const { return m_matrix.data(); } - /** \returns a non-const pointer to the column major internal matrix */ - EIGEN_DEVICE_FUNC Scalar* data() { return m_matrix.data(); } - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { return typename internal::cast_return_type >::type(*this); } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit Transform(const Transform& other) - { - check_template_params(); - m_matrix = other.matrix().template cast(); - } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - EIGEN_DEVICE_FUNC bool isApprox(const Transform& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return m_matrix.isApprox(other.m_matrix, prec); } - - /** Sets the last row to [0 ... 0 1] - */ - EIGEN_DEVICE_FUNC void makeAffine() - { - internal::transform_make_affine::run(m_matrix); - } - - /** \internal - * \returns the Dim x Dim linear part if the transformation is affine, - * and the HDim x Dim part for projective transformations. - */ - EIGEN_DEVICE_FUNC inline Block linearExt() - { return m_matrix.template block(0,0); } - /** \internal - * \returns the Dim x Dim linear part if the transformation is affine, - * and the HDim x Dim part for projective transformations. - */ - EIGEN_DEVICE_FUNC inline const Block linearExt() const - { return m_matrix.template block(0,0); } - - /** \internal - * \returns the translation part if the transformation is affine, - * and the last column for projective transformations. - */ - EIGEN_DEVICE_FUNC inline Block translationExt() - { return m_matrix.template block(0,Dim); } - /** \internal - * \returns the translation part if the transformation is affine, - * and the last column for projective transformations. - */ - EIGEN_DEVICE_FUNC inline const Block translationExt() const - { return m_matrix.template block(0,Dim); } - - - #ifdef EIGEN_TRANSFORM_PLUGIN - #include EIGEN_TRANSFORM_PLUGIN - #endif - -protected: - #ifndef EIGEN_PARSED_BY_DOXYGEN - EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void check_template_params() - { - EIGEN_STATIC_ASSERT((Options & (DontAlign|RowMajor)) == Options, INVALID_MATRIX_TEMPLATE_PARAMETERS) - } - #endif - -}; - -/** \ingroup Geometry_Module */ -typedef Transform Isometry2f; -/** \ingroup Geometry_Module */ -typedef Transform Isometry3f; -/** \ingroup Geometry_Module */ -typedef Transform Isometry2d; -/** \ingroup Geometry_Module */ -typedef Transform Isometry3d; - -/** \ingroup Geometry_Module */ -typedef Transform Affine2f; -/** \ingroup Geometry_Module */ -typedef Transform Affine3f; -/** \ingroup Geometry_Module */ -typedef Transform Affine2d; -/** \ingroup Geometry_Module */ -typedef Transform Affine3d; - -/** \ingroup Geometry_Module */ -typedef Transform AffineCompact2f; -/** \ingroup Geometry_Module */ -typedef Transform AffineCompact3f; -/** \ingroup Geometry_Module */ -typedef Transform AffineCompact2d; -/** \ingroup Geometry_Module */ -typedef Transform AffineCompact3d; - -/** \ingroup Geometry_Module */ -typedef Transform Projective2f; -/** \ingroup Geometry_Module */ -typedef Transform Projective3f; -/** \ingroup Geometry_Module */ -typedef Transform Projective2d; -/** \ingroup Geometry_Module */ -typedef Transform Projective3d; - -/************************** -*** Optional QT support *** -**************************/ - -#ifdef EIGEN_QT_SUPPORT -/** Initializes \c *this from a QMatrix assuming the dimension is 2. - * - * This function is available only if the token EIGEN_QT_SUPPORT is defined. - */ -template -Transform::Transform(const QMatrix& other) -{ - check_template_params(); - *this = other; -} - -/** Set \c *this from a QMatrix assuming the dimension is 2. - * - * This function is available only if the token EIGEN_QT_SUPPORT is defined. - */ -template -Transform& Transform::operator=(const QMatrix& other) -{ - EIGEN_STATIC_ASSERT(Dim==2, YOU_MADE_A_PROGRAMMING_MISTAKE) - if (EIGEN_CONST_CONDITIONAL(Mode == int(AffineCompact))) - m_matrix << other.m11(), other.m21(), other.dx(), - other.m12(), other.m22(), other.dy(); - else - m_matrix << other.m11(), other.m21(), other.dx(), - other.m12(), other.m22(), other.dy(), - 0, 0, 1; - return *this; -} - -/** \returns a QMatrix from \c *this assuming the dimension is 2. - * - * \warning this conversion might loss data if \c *this is not affine - * - * This function is available only if the token EIGEN_QT_SUPPORT is defined. - */ -template -QMatrix Transform::toQMatrix(void) const -{ - check_template_params(); - EIGEN_STATIC_ASSERT(Dim==2, YOU_MADE_A_PROGRAMMING_MISTAKE) - return QMatrix(m_matrix.coeff(0,0), m_matrix.coeff(1,0), - m_matrix.coeff(0,1), m_matrix.coeff(1,1), - m_matrix.coeff(0,2), m_matrix.coeff(1,2)); -} - -/** Initializes \c *this from a QTransform assuming the dimension is 2. - * - * This function is available only if the token EIGEN_QT_SUPPORT is defined. - */ -template -Transform::Transform(const QTransform& other) -{ - check_template_params(); - *this = other; -} - -/** Set \c *this from a QTransform assuming the dimension is 2. - * - * This function is available only if the token EIGEN_QT_SUPPORT is defined. - */ -template -Transform& Transform::operator=(const QTransform& other) -{ - check_template_params(); - EIGEN_STATIC_ASSERT(Dim==2, YOU_MADE_A_PROGRAMMING_MISTAKE) - if (EIGEN_CONST_CONDITIONAL(Mode == int(AffineCompact))) - m_matrix << other.m11(), other.m21(), other.dx(), - other.m12(), other.m22(), other.dy(); - else - m_matrix << other.m11(), other.m21(), other.dx(), - other.m12(), other.m22(), other.dy(), - other.m13(), other.m23(), other.m33(); - return *this; -} - -/** \returns a QTransform from \c *this assuming the dimension is 2. - * - * This function is available only if the token EIGEN_QT_SUPPORT is defined. - */ -template -QTransform Transform::toQTransform(void) const -{ - EIGEN_STATIC_ASSERT(Dim==2, YOU_MADE_A_PROGRAMMING_MISTAKE) - if (EIGEN_CONST_CONDITIONAL(Mode == int(AffineCompact))) - return QTransform(m_matrix.coeff(0,0), m_matrix.coeff(1,0), - m_matrix.coeff(0,1), m_matrix.coeff(1,1), - m_matrix.coeff(0,2), m_matrix.coeff(1,2)); - else - return QTransform(m_matrix.coeff(0,0), m_matrix.coeff(1,0), m_matrix.coeff(2,0), - m_matrix.coeff(0,1), m_matrix.coeff(1,1), m_matrix.coeff(2,1), - m_matrix.coeff(0,2), m_matrix.coeff(1,2), m_matrix.coeff(2,2)); -} -#endif - -/********************* -*** Procedural API *** -*********************/ - -/** Applies on the right the non uniform scale transformation represented - * by the vector \a other to \c *this and returns a reference to \c *this. - * \sa prescale() - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::scale(const MatrixBase &other) -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,int(Dim)) - EIGEN_STATIC_ASSERT(Mode!=int(Isometry), THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) - linearExt().noalias() = (linearExt() * other.asDiagonal()); - return *this; -} - -/** Applies on the right a uniform scale of a factor \a c to \c *this - * and returns a reference to \c *this. - * \sa prescale(Scalar) - */ -template -EIGEN_DEVICE_FUNC inline Transform& Transform::scale(const Scalar& s) -{ - EIGEN_STATIC_ASSERT(Mode!=int(Isometry), THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) - linearExt() *= s; - return *this; -} - -/** Applies on the left the non uniform scale transformation represented - * by the vector \a other to \c *this and returns a reference to \c *this. - * \sa scale() - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::prescale(const MatrixBase &other) -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,int(Dim)) - EIGEN_STATIC_ASSERT(Mode!=int(Isometry), THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) - affine().noalias() = (other.asDiagonal() * affine()); - return *this; -} - -/** Applies on the left a uniform scale of a factor \a c to \c *this - * and returns a reference to \c *this. - * \sa scale(Scalar) - */ -template -EIGEN_DEVICE_FUNC inline Transform& Transform::prescale(const Scalar& s) -{ - EIGEN_STATIC_ASSERT(Mode!=int(Isometry), THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) - m_matrix.template topRows() *= s; - return *this; -} - -/** Applies on the right the translation matrix represented by the vector \a other - * to \c *this and returns a reference to \c *this. - * \sa pretranslate() - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::translate(const MatrixBase &other) -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,int(Dim)) - translationExt() += linearExt() * other; - return *this; -} - -/** Applies on the left the translation matrix represented by the vector \a other - * to \c *this and returns a reference to \c *this. - * \sa translate() - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::pretranslate(const MatrixBase &other) -{ - EIGEN_STATIC_ASSERT_VECTOR_SPECIFIC_SIZE(OtherDerived,int(Dim)) - if(EIGEN_CONST_CONDITIONAL(int(Mode)==int(Projective))) - affine() += other * m_matrix.row(Dim); - else - translation() += other; - return *this; -} - -/** Applies on the right the rotation represented by the rotation \a rotation - * to \c *this and returns a reference to \c *this. - * - * The template parameter \a RotationType is the type of the rotation which - * must be known by internal::toRotationMatrix<>. - * - * Natively supported types includes: - * - any scalar (2D), - * - a Dim x Dim matrix expression, - * - a Quaternion (3D), - * - a AngleAxis (3D) - * - * This mechanism is easily extendable to support user types such as Euler angles, - * or a pair of Quaternion for 4D rotations. - * - * \sa rotate(Scalar), class Quaternion, class AngleAxis, prerotate(RotationType) - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::rotate(const RotationType& rotation) -{ - linearExt() *= internal::toRotationMatrix(rotation); - return *this; -} - -/** Applies on the left the rotation represented by the rotation \a rotation - * to \c *this and returns a reference to \c *this. - * - * See rotate() for further details. - * - * \sa rotate() - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::prerotate(const RotationType& rotation) -{ - m_matrix.template block(0,0) = internal::toRotationMatrix(rotation) - * m_matrix.template block(0,0); - return *this; -} - -/** Applies on the right the shear transformation represented - * by the vector \a other to \c *this and returns a reference to \c *this. - * \warning 2D only. - * \sa preshear() - */ -template -EIGEN_DEVICE_FUNC Transform& -Transform::shear(const Scalar& sx, const Scalar& sy) -{ - EIGEN_STATIC_ASSERT(int(Dim)==2, YOU_MADE_A_PROGRAMMING_MISTAKE) - EIGEN_STATIC_ASSERT(Mode!=int(Isometry), THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) - VectorType tmp = linear().col(0)*sy + linear().col(1); - linear() << linear().col(0) + linear().col(1)*sx, tmp; - return *this; -} - -/** Applies on the left the shear transformation represented - * by the vector \a other to \c *this and returns a reference to \c *this. - * \warning 2D only. - * \sa shear() - */ -template -EIGEN_DEVICE_FUNC Transform& -Transform::preshear(const Scalar& sx, const Scalar& sy) -{ - EIGEN_STATIC_ASSERT(int(Dim)==2, YOU_MADE_A_PROGRAMMING_MISTAKE) - EIGEN_STATIC_ASSERT(Mode!=int(Isometry), THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) - m_matrix.template block(0,0) = LinearMatrixType(1, sx, sy, 1) * m_matrix.template block(0,0); - return *this; -} - -/****************************************************** -*** Scaling, Translation and Rotation compatibility *** -******************************************************/ - -template -EIGEN_DEVICE_FUNC inline Transform& Transform::operator=(const TranslationType& t) -{ - linear().setIdentity(); - translation() = t.vector(); - makeAffine(); - return *this; -} - -template -EIGEN_DEVICE_FUNC inline Transform Transform::operator*(const TranslationType& t) const -{ - Transform res = *this; - res.translate(t.vector()); - return res; -} - -template -EIGEN_DEVICE_FUNC inline Transform& Transform::operator=(const UniformScaling& s) -{ - m_matrix.setZero(); - linear().diagonal().fill(s.factor()); - makeAffine(); - return *this; -} - -template -template -EIGEN_DEVICE_FUNC inline Transform& Transform::operator=(const RotationBase& r) -{ - linear() = internal::toRotationMatrix(r); - translation().setZero(); - makeAffine(); - return *this; -} - -template -template -EIGEN_DEVICE_FUNC inline Transform Transform::operator*(const RotationBase& r) const -{ - Transform res = *this; - res.rotate(r.derived()); - return res; -} - -/************************ -*** Special functions *** -************************/ - -/** \returns the rotation part of the transformation - * - * - * \svd_module - * - * \sa computeRotationScaling(), computeScalingRotation(), class SVD - */ -template -EIGEN_DEVICE_FUNC const typename Transform::LinearMatrixType -Transform::rotation() const -{ - LinearMatrixType result; - computeRotationScaling(&result, (LinearMatrixType*)0); - return result; -} - - -/** decomposes the linear part of the transformation as a product rotation x scaling, the scaling being - * not necessarily positive. - * - * If either pointer is zero, the corresponding computation is skipped. - * - * - * - * \svd_module - * - * \sa computeScalingRotation(), rotation(), class SVD - */ -template -template -EIGEN_DEVICE_FUNC void Transform::computeRotationScaling(RotationMatrixType *rotation, ScalingMatrixType *scaling) const -{ - JacobiSVD svd(linear(), ComputeFullU | ComputeFullV); - - Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 - VectorType sv(svd.singularValues()); - sv.coeffRef(0) *= x; - if(scaling) scaling->lazyAssign(svd.matrixV() * sv.asDiagonal() * svd.matrixV().adjoint()); - if(rotation) - { - LinearMatrixType m(svd.matrixU()); - m.col(0) /= x; - rotation->lazyAssign(m * svd.matrixV().adjoint()); - } -} - -/** decomposes the linear part of the transformation as a product scaling x rotation, the scaling being - * not necessarily positive. - * - * If either pointer is zero, the corresponding computation is skipped. - * - * - * - * \svd_module - * - * \sa computeRotationScaling(), rotation(), class SVD - */ -template -template -EIGEN_DEVICE_FUNC void Transform::computeScalingRotation(ScalingMatrixType *scaling, RotationMatrixType *rotation) const -{ - JacobiSVD svd(linear(), ComputeFullU | ComputeFullV); - - Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); // so x has absolute value 1 - VectorType sv(svd.singularValues()); - sv.coeffRef(0) *= x; - if(scaling) scaling->lazyAssign(svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint()); - if(rotation) - { - LinearMatrixType m(svd.matrixU()); - m.col(0) /= x; - rotation->lazyAssign(m * svd.matrixV().adjoint()); - } -} - -/** Convenient method to set \c *this from a position, orientation and scale - * of a 3D object. - */ -template -template -EIGEN_DEVICE_FUNC Transform& -Transform::fromPositionOrientationScale(const MatrixBase &position, - const OrientationType& orientation, const MatrixBase &scale) -{ - linear() = internal::toRotationMatrix(orientation); - linear() *= scale.asDiagonal(); - translation() = position; - makeAffine(); - return *this; -} - -namespace internal { - -template -struct transform_make_affine -{ - template - EIGEN_DEVICE_FUNC static void run(MatrixType &mat) - { - static const int Dim = MatrixType::ColsAtCompileTime-1; - mat.template block<1,Dim>(Dim,0).setZero(); - mat.coeffRef(Dim,Dim) = typename MatrixType::Scalar(1); - } -}; - -template<> -struct transform_make_affine -{ - template EIGEN_DEVICE_FUNC static void run(MatrixType &) { } -}; - -// selector needed to avoid taking the inverse of a 3x4 matrix -template -struct projective_transform_inverse -{ - EIGEN_DEVICE_FUNC static inline void run(const TransformType&, TransformType&) - {} -}; - -template -struct projective_transform_inverse -{ - EIGEN_DEVICE_FUNC static inline void run(const TransformType& m, TransformType& res) - { - res.matrix() = m.matrix().inverse(); - } -}; - -} // end namespace internal - - -/** - * - * \returns the inverse transformation according to some given knowledge - * on \c *this. - * - * \param hint allows to optimize the inversion process when the transformation - * is known to be not a general transformation (optional). The possible values are: - * - #Projective if the transformation is not necessarily affine, i.e., if the - * last row is not guaranteed to be [0 ... 0 1] - * - #Affine if the last row can be assumed to be [0 ... 0 1] - * - #Isometry if the transformation is only a concatenations of translations - * and rotations. - * The default is the template class parameter \c Mode. - * - * \warning unless \a traits is always set to NoShear or NoScaling, this function - * requires the generic inverse method of MatrixBase defined in the LU module. If - * you forget to include this module, then you will get hard to debug linking errors. - * - * \sa MatrixBase::inverse() - */ -template -EIGEN_DEVICE_FUNC Transform -Transform::inverse(TransformTraits hint) const -{ - Transform res; - if (hint == Projective) - { - internal::projective_transform_inverse::run(*this, res); - } - else - { - if (hint == Isometry) - { - res.matrix().template topLeftCorner() = linear().transpose(); - } - else if(hint&Affine) - { - res.matrix().template topLeftCorner() = linear().inverse(); - } - else - { - eigen_assert(false && "Invalid transform traits in Transform::Inverse"); - } - // translation and remaining parts - res.matrix().template topRightCorner() - = - res.matrix().template topLeftCorner() * translation(); - res.makeAffine(); // we do need this, because in the beginning res is uninitialized - } - return res; -} - -namespace internal { - -/***************************************************** -*** Specializations of take affine part *** -*****************************************************/ - -template struct transform_take_affine_part { - typedef typename TransformType::MatrixType MatrixType; - typedef typename TransformType::AffinePart AffinePart; - typedef typename TransformType::ConstAffinePart ConstAffinePart; - static inline AffinePart run(MatrixType& m) - { return m.template block(0,0); } - static inline ConstAffinePart run(const MatrixType& m) - { return m.template block(0,0); } -}; - -template -struct transform_take_affine_part > { - typedef typename Transform::MatrixType MatrixType; - static inline MatrixType& run(MatrixType& m) { return m; } - static inline const MatrixType& run(const MatrixType& m) { return m; } -}; - -/***************************************************** -*** Specializations of construct from matrix *** -*****************************************************/ - -template -struct transform_construct_from_matrix -{ - static inline void run(Transform *transform, const Other& other) - { - transform->linear() = other; - transform->translation().setZero(); - transform->makeAffine(); - } -}; - -template -struct transform_construct_from_matrix -{ - static inline void run(Transform *transform, const Other& other) - { - transform->affine() = other; - transform->makeAffine(); - } -}; - -template -struct transform_construct_from_matrix -{ - static inline void run(Transform *transform, const Other& other) - { transform->matrix() = other; } -}; - -template -struct transform_construct_from_matrix -{ - static inline void run(Transform *transform, const Other& other) - { transform->matrix() = other.template block(0,0); } -}; - -/********************************************************** -*** Specializations of operator* with rhs EigenBase *** -**********************************************************/ - -template -struct transform_product_result -{ - enum - { - Mode = - (LhsMode == (int)Projective || RhsMode == (int)Projective ) ? Projective : - (LhsMode == (int)Affine || RhsMode == (int)Affine ) ? Affine : - (LhsMode == (int)AffineCompact || RhsMode == (int)AffineCompact ) ? AffineCompact : - (LhsMode == (int)Isometry || RhsMode == (int)Isometry ) ? Isometry : Projective - }; -}; - -template< typename TransformType, typename MatrixType, int RhsCols> -struct transform_right_product_impl< TransformType, MatrixType, 0, RhsCols> -{ - typedef typename MatrixType::PlainObject ResultType; - - static EIGEN_STRONG_INLINE ResultType run(const TransformType& T, const MatrixType& other) - { - return T.matrix() * other; - } -}; - -template< typename TransformType, typename MatrixType, int RhsCols> -struct transform_right_product_impl< TransformType, MatrixType, 1, RhsCols> -{ - enum { - Dim = TransformType::Dim, - HDim = TransformType::HDim, - OtherRows = MatrixType::RowsAtCompileTime, - OtherCols = MatrixType::ColsAtCompileTime - }; - - typedef typename MatrixType::PlainObject ResultType; - - static EIGEN_STRONG_INLINE ResultType run(const TransformType& T, const MatrixType& other) - { - EIGEN_STATIC_ASSERT(OtherRows==HDim, YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES); - - typedef Block TopLeftLhs; - - ResultType res(other.rows(),other.cols()); - TopLeftLhs(res, 0, 0, Dim, other.cols()).noalias() = T.affine() * other; - res.row(OtherRows-1) = other.row(OtherRows-1); - - return res; - } -}; - -template< typename TransformType, typename MatrixType, int RhsCols> -struct transform_right_product_impl< TransformType, MatrixType, 2, RhsCols> -{ - enum { - Dim = TransformType::Dim, - HDim = TransformType::HDim, - OtherRows = MatrixType::RowsAtCompileTime, - OtherCols = MatrixType::ColsAtCompileTime - }; - - typedef typename MatrixType::PlainObject ResultType; - - static EIGEN_STRONG_INLINE ResultType run(const TransformType& T, const MatrixType& other) - { - EIGEN_STATIC_ASSERT(OtherRows==Dim, YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES); - - typedef Block TopLeftLhs; - ResultType res(Replicate(T.translation(),1,other.cols())); - TopLeftLhs(res, 0, 0, Dim, other.cols()).noalias() += T.linear() * other; - - return res; - } -}; - -template< typename TransformType, typename MatrixType > -struct transform_right_product_impl< TransformType, MatrixType, 2, 1> // rhs is a vector of size Dim -{ - typedef typename TransformType::MatrixType TransformMatrix; - enum { - Dim = TransformType::Dim, - HDim = TransformType::HDim, - OtherRows = MatrixType::RowsAtCompileTime, - WorkingRows = EIGEN_PLAIN_ENUM_MIN(TransformMatrix::RowsAtCompileTime,HDim) - }; - - typedef typename MatrixType::PlainObject ResultType; - - static EIGEN_STRONG_INLINE ResultType run(const TransformType& T, const MatrixType& other) - { - EIGEN_STATIC_ASSERT(OtherRows==Dim, YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES); - - Matrix rhs; - rhs.template head() = other; rhs[Dim] = typename ResultType::Scalar(1); - Matrix res(T.matrix() * rhs); - return res.template head(); - } -}; - -/********************************************************** -*** Specializations of operator* with lhs EigenBase *** -**********************************************************/ - -// generic HDim x HDim matrix * T => Projective -template -struct transform_left_product_impl -{ - typedef Transform TransformType; - typedef typename TransformType::MatrixType MatrixType; - typedef Transform ResultType; - static ResultType run(const Other& other,const TransformType& tr) - { return ResultType(other * tr.matrix()); } -}; - -// generic HDim x HDim matrix * AffineCompact => Projective -template -struct transform_left_product_impl -{ - typedef Transform TransformType; - typedef typename TransformType::MatrixType MatrixType; - typedef Transform ResultType; - static ResultType run(const Other& other,const TransformType& tr) - { - ResultType res; - res.matrix().noalias() = other.template block(0,0) * tr.matrix(); - res.matrix().col(Dim) += other.col(Dim); - return res; - } -}; - -// affine matrix * T -template -struct transform_left_product_impl -{ - typedef Transform TransformType; - typedef typename TransformType::MatrixType MatrixType; - typedef TransformType ResultType; - static ResultType run(const Other& other,const TransformType& tr) - { - ResultType res; - res.affine().noalias() = other * tr.matrix(); - res.matrix().row(Dim) = tr.matrix().row(Dim); - return res; - } -}; - -// affine matrix * AffineCompact -template -struct transform_left_product_impl -{ - typedef Transform TransformType; - typedef typename TransformType::MatrixType MatrixType; - typedef TransformType ResultType; - static ResultType run(const Other& other,const TransformType& tr) - { - ResultType res; - res.matrix().noalias() = other.template block(0,0) * tr.matrix(); - res.translation() += other.col(Dim); - return res; - } -}; - -// linear matrix * T -template -struct transform_left_product_impl -{ - typedef Transform TransformType; - typedef typename TransformType::MatrixType MatrixType; - typedef TransformType ResultType; - static ResultType run(const Other& other, const TransformType& tr) - { - TransformType res; - if(Mode!=int(AffineCompact)) - res.matrix().row(Dim) = tr.matrix().row(Dim); - res.matrix().template topRows().noalias() - = other * tr.matrix().template topRows(); - return res; - } -}; - -/********************************************************** -*** Specializations of operator* with another Transform *** -**********************************************************/ - -template -struct transform_transform_product_impl,Transform,false > -{ - enum { ResultMode = transform_product_result::Mode }; - typedef Transform Lhs; - typedef Transform Rhs; - typedef Transform ResultType; - static ResultType run(const Lhs& lhs, const Rhs& rhs) - { - ResultType res; - res.linear() = lhs.linear() * rhs.linear(); - res.translation() = lhs.linear() * rhs.translation() + lhs.translation(); - res.makeAffine(); - return res; - } -}; - -template -struct transform_transform_product_impl,Transform,true > -{ - typedef Transform Lhs; - typedef Transform Rhs; - typedef Transform ResultType; - static ResultType run(const Lhs& lhs, const Rhs& rhs) - { - return ResultType( lhs.matrix() * rhs.matrix() ); - } -}; - -template -struct transform_transform_product_impl,Transform,true > -{ - typedef Transform Lhs; - typedef Transform Rhs; - typedef Transform ResultType; - static ResultType run(const Lhs& lhs, const Rhs& rhs) - { - ResultType res; - res.matrix().template topRows() = lhs.matrix() * rhs.matrix(); - res.matrix().row(Dim) = rhs.matrix().row(Dim); - return res; - } -}; - -template -struct transform_transform_product_impl,Transform,true > -{ - typedef Transform Lhs; - typedef Transform Rhs; - typedef Transform ResultType; - static ResultType run(const Lhs& lhs, const Rhs& rhs) - { - ResultType res(lhs.matrix().template leftCols() * rhs.matrix()); - res.matrix().col(Dim) += lhs.matrix().col(Dim); - return res; - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_TRANSFORM_H diff --git a/Eigen/src/Geometry/Translation.h b/Eigen/src/Geometry/Translation.h deleted file mode 100644 index 51d9a82eb..000000000 --- a/Eigen/src/Geometry/Translation.h +++ /dev/null @@ -1,208 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_TRANSLATION_H -#define EIGEN_TRANSLATION_H - -namespace Eigen { - -/** \geometry_module \ingroup Geometry_Module - * - * \class Translation - * - * \brief Represents a translation transformation - * - * \tparam _Scalar the scalar type, i.e., the type of the coefficients. - * \tparam _Dim the dimension of the space, can be a compile time value or Dynamic - * - * \note This class is not aimed to be used to store a translation transformation, - * but rather to make easier the constructions and updates of Transform objects. - * - * \sa class Scaling, class Transform - */ -template -class Translation -{ -public: - EIGEN_MAKE_ALIGNED_OPERATOR_NEW_IF_VECTORIZABLE_FIXED_SIZE(_Scalar,_Dim) - /** dimension of the space */ - enum { Dim = _Dim }; - /** the scalar type of the coefficients */ - typedef _Scalar Scalar; - /** corresponding vector type */ - typedef Matrix VectorType; - /** corresponding linear transformation matrix type */ - typedef Matrix LinearMatrixType; - /** corresponding affine transformation type */ - typedef Transform AffineTransformType; - /** corresponding isometric transformation type */ - typedef Transform IsometryTransformType; - -protected: - - VectorType m_coeffs; - -public: - - /** Default constructor without initialization. */ - EIGEN_DEVICE_FUNC Translation() {} - /** */ - EIGEN_DEVICE_FUNC inline Translation(const Scalar& sx, const Scalar& sy) - { - eigen_assert(Dim==2); - m_coeffs.x() = sx; - m_coeffs.y() = sy; - } - /** */ - EIGEN_DEVICE_FUNC inline Translation(const Scalar& sx, const Scalar& sy, const Scalar& sz) - { - eigen_assert(Dim==3); - m_coeffs.x() = sx; - m_coeffs.y() = sy; - m_coeffs.z() = sz; - } - /** Constructs and initialize the translation transformation from a vector of translation coefficients */ - EIGEN_DEVICE_FUNC explicit inline Translation(const VectorType& vector) : m_coeffs(vector) {} - - /** \brief Retruns the x-translation by value. **/ - EIGEN_DEVICE_FUNC inline Scalar x() const { return m_coeffs.x(); } - /** \brief Retruns the y-translation by value. **/ - EIGEN_DEVICE_FUNC inline Scalar y() const { return m_coeffs.y(); } - /** \brief Retruns the z-translation by value. **/ - EIGEN_DEVICE_FUNC inline Scalar z() const { return m_coeffs.z(); } - - /** \brief Retruns the x-translation as a reference. **/ - EIGEN_DEVICE_FUNC inline Scalar& x() { return m_coeffs.x(); } - /** \brief Retruns the y-translation as a reference. **/ - EIGEN_DEVICE_FUNC inline Scalar& y() { return m_coeffs.y(); } - /** \brief Retruns the z-translation as a reference. **/ - EIGEN_DEVICE_FUNC inline Scalar& z() { return m_coeffs.z(); } - - EIGEN_DEVICE_FUNC const VectorType& vector() const { return m_coeffs; } - EIGEN_DEVICE_FUNC VectorType& vector() { return m_coeffs; } - - EIGEN_DEVICE_FUNC const VectorType& translation() const { return m_coeffs; } - EIGEN_DEVICE_FUNC VectorType& translation() { return m_coeffs; } - - /** Concatenates two translation */ - EIGEN_DEVICE_FUNC inline Translation operator* (const Translation& other) const - { return Translation(m_coeffs + other.m_coeffs); } - - /** Concatenates a translation and a uniform scaling */ - EIGEN_DEVICE_FUNC inline AffineTransformType operator* (const UniformScaling& other) const; - - /** Concatenates a translation and a linear transformation */ - template - EIGEN_DEVICE_FUNC inline AffineTransformType operator* (const EigenBase& linear) const; - - /** Concatenates a translation and a rotation */ - template - EIGEN_DEVICE_FUNC inline IsometryTransformType operator*(const RotationBase& r) const - { return *this * IsometryTransformType(r); } - - /** \returns the concatenation of a linear transformation \a l with the translation \a t */ - // its a nightmare to define a templated friend function outside its declaration - template friend - EIGEN_DEVICE_FUNC inline AffineTransformType operator*(const EigenBase& linear, const Translation& t) - { - AffineTransformType res; - res.matrix().setZero(); - res.linear() = linear.derived(); - res.translation() = linear.derived() * t.m_coeffs; - res.matrix().row(Dim).setZero(); - res(Dim,Dim) = Scalar(1); - return res; - } - - /** Concatenates a translation and a transformation */ - template - EIGEN_DEVICE_FUNC inline Transform operator* (const Transform& t) const - { - Transform res = t; - res.pretranslate(m_coeffs); - return res; - } - - /** Applies translation to vector */ - template - inline typename internal::enable_if::type - operator* (const MatrixBase& vec) const - { return m_coeffs + vec.derived(); } - - /** \returns the inverse translation (opposite) */ - Translation inverse() const { return Translation(-m_coeffs); } - - Translation& operator=(const Translation& other) - { - m_coeffs = other.m_coeffs; - return *this; - } - - static const Translation Identity() { return Translation(VectorType::Zero()); } - - /** \returns \c *this with scalar type casted to \a NewScalarType - * - * Note that if \a NewScalarType is equal to the current scalar type of \c *this - * then this function smartly returns a const reference to \c *this. - */ - template - EIGEN_DEVICE_FUNC inline typename internal::cast_return_type >::type cast() const - { return typename internal::cast_return_type >::type(*this); } - - /** Copy constructor with scalar type conversion */ - template - EIGEN_DEVICE_FUNC inline explicit Translation(const Translation& other) - { m_coeffs = other.vector().template cast(); } - - /** \returns \c true if \c *this is approximately equal to \a other, within the precision - * determined by \a prec. - * - * \sa MatrixBase::isApprox() */ - EIGEN_DEVICE_FUNC bool isApprox(const Translation& other, const typename NumTraits::Real& prec = NumTraits::dummy_precision()) const - { return m_coeffs.isApprox(other.m_coeffs, prec); } - -}; - -/** \addtogroup Geometry_Module */ -//@{ -typedef Translation Translation2f; -typedef Translation Translation2d; -typedef Translation Translation3f; -typedef Translation Translation3d; -//@} - -template -EIGEN_DEVICE_FUNC inline typename Translation::AffineTransformType -Translation::operator* (const UniformScaling& other) const -{ - AffineTransformType res; - res.matrix().setZero(); - res.linear().diagonal().fill(other.factor()); - res.translation() = m_coeffs; - res(Dim,Dim) = Scalar(1); - return res; -} - -template -template -EIGEN_DEVICE_FUNC inline typename Translation::AffineTransformType -Translation::operator* (const EigenBase& linear) const -{ - AffineTransformType res; - res.matrix().setZero(); - res.linear() = linear.derived(); - res.translation() = m_coeffs; - res.matrix().row(Dim).setZero(); - res(Dim,Dim) = Scalar(1); - return res; -} - -} // end namespace Eigen - -#endif // EIGEN_TRANSLATION_H diff --git a/Eigen/src/Geometry/Umeyama.h b/Eigen/src/Geometry/Umeyama.h deleted file mode 100644 index 7e933fca1..000000000 --- a/Eigen/src/Geometry/Umeyama.h +++ /dev/null @@ -1,166 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Hauke Heibel -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_UMEYAMA_H -#define EIGEN_UMEYAMA_H - -// This file requires the user to include -// * Eigen/Core -// * Eigen/LU -// * Eigen/SVD -// * Eigen/Array - -namespace Eigen { - -#ifndef EIGEN_PARSED_BY_DOXYGEN - -// These helpers are required since it allows to use mixed types as parameters -// for the Umeyama. The problem with mixed parameters is that the return type -// cannot trivially be deduced when float and double types are mixed. -namespace internal { - -// Compile time return type deduction for different MatrixBase types. -// Different means here different alignment and parameters but the same underlying -// real scalar type. -template -struct umeyama_transform_matrix_type -{ - enum { - MinRowsAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(MatrixType::RowsAtCompileTime, OtherMatrixType::RowsAtCompileTime), - - // When possible we want to choose some small fixed size value since the result - // is likely to fit on the stack. So here, EIGEN_SIZE_MIN_PREFER_DYNAMIC is not what we want. - HomogeneousDimension = int(MinRowsAtCompileTime) == Dynamic ? Dynamic : int(MinRowsAtCompileTime)+1 - }; - - typedef Matrix::Scalar, - HomogeneousDimension, - HomogeneousDimension, - AutoAlign | (traits::Flags & RowMajorBit ? RowMajor : ColMajor), - HomogeneousDimension, - HomogeneousDimension - > type; -}; - -} - -#endif - -/** -* \geometry_module \ingroup Geometry_Module -* -* \brief Returns the transformation between two point sets. -* -* The algorithm is based on: -* "Least-squares estimation of transformation parameters between two point patterns", -* Shinji Umeyama, PAMI 1991, DOI: 10.1109/34.88573 -* -* It estimates parameters \f$ c, \mathbf{R}, \f$ and \f$ \mathbf{t} \f$ such that -* \f{align*} -* \frac{1}{n} \sum_{i=1}^n \vert\vert y_i - (c\mathbf{R}x_i + \mathbf{t}) \vert\vert_2^2 -* \f} -* is minimized. -* -* The algorithm is based on the analysis of the covariance matrix -* \f$ \Sigma_{\mathbf{x}\mathbf{y}} \in \mathbb{R}^{d \times d} \f$ -* of the input point sets \f$ \mathbf{x} \f$ and \f$ \mathbf{y} \f$ where -* \f$d\f$ is corresponding to the dimension (which is typically small). -* The analysis is involving the SVD having a complexity of \f$O(d^3)\f$ -* though the actual computational effort lies in the covariance -* matrix computation which has an asymptotic lower bound of \f$O(dm)\f$ when -* the input point sets have dimension \f$d \times m\f$. -* -* Currently the method is working only for floating point matrices. -* -* \todo Should the return type of umeyama() become a Transform? -* -* \param src Source points \f$ \mathbf{x} = \left( x_1, \hdots, x_n \right) \f$. -* \param dst Destination points \f$ \mathbf{y} = \left( y_1, \hdots, y_n \right) \f$. -* \param with_scaling Sets \f$ c=1 \f$ when false is passed. -* \return The homogeneous transformation -* \f{align*} -* T = \begin{bmatrix} c\mathbf{R} & \mathbf{t} \\ \mathbf{0} & 1 \end{bmatrix} -* \f} -* minimizing the resudiual above. This transformation is always returned as an -* Eigen::Matrix. -*/ -template -typename internal::umeyama_transform_matrix_type::type -umeyama(const MatrixBase& src, const MatrixBase& dst, bool with_scaling = true) -{ - typedef typename internal::umeyama_transform_matrix_type::type TransformationMatrixType; - typedef typename internal::traits::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - - EIGEN_STATIC_ASSERT(!NumTraits::IsComplex, NUMERIC_TYPE_MUST_BE_REAL) - EIGEN_STATIC_ASSERT((internal::is_same::Scalar>::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - - enum { Dimension = EIGEN_SIZE_MIN_PREFER_DYNAMIC(Derived::RowsAtCompileTime, OtherDerived::RowsAtCompileTime) }; - - typedef Matrix VectorType; - typedef Matrix MatrixType; - typedef typename internal::plain_matrix_type_row_major::type RowMajorMatrixType; - - const Index m = src.rows(); // dimension - const Index n = src.cols(); // number of measurements - - // required for demeaning ... - const RealScalar one_over_n = RealScalar(1) / static_cast(n); - - // computation of mean - const VectorType src_mean = src.rowwise().sum() * one_over_n; - const VectorType dst_mean = dst.rowwise().sum() * one_over_n; - - // demeaning of src and dst points - const RowMajorMatrixType src_demean = src.colwise() - src_mean; - const RowMajorMatrixType dst_demean = dst.colwise() - dst_mean; - - // Eq. (36)-(37) - const Scalar src_var = src_demean.rowwise().squaredNorm().sum() * one_over_n; - - // Eq. (38) - const MatrixType sigma = one_over_n * dst_demean * src_demean.transpose(); - - JacobiSVD svd(sigma, ComputeFullU | ComputeFullV); - - // Initialize the resulting transformation with an identity matrix... - TransformationMatrixType Rt = TransformationMatrixType::Identity(m+1,m+1); - - // Eq. (39) - VectorType S = VectorType::Ones(m); - - if ( svd.matrixU().determinant() * svd.matrixV().determinant() < 0 ) - S(m-1) = -1; - - // Eq. (40) and (43) - Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose(); - - if (with_scaling) - { - // Eq. (42) - const Scalar c = Scalar(1)/src_var * svd.singularValues().dot(S); - - // Eq. (41) - Rt.col(m).head(m) = dst_mean; - Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean; - Rt.block(0,0,m,m) *= c; - } - else - { - Rt.col(m).head(m) = dst_mean; - Rt.col(m).head(m).noalias() -= Rt.topLeftCorner(m,m)*src_mean; - } - - return Rt; -} - -} // end namespace Eigen - -#endif // EIGEN_UMEYAMA_H diff --git a/Eigen/src/Geometry/arch/Geometry_SSE.h b/Eigen/src/Geometry/arch/Geometry_SSE.h deleted file mode 100644 index f68cab583..000000000 --- a/Eigen/src/Geometry/arch/Geometry_SSE.h +++ /dev/null @@ -1,161 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Rohit Garg -// Copyright (C) 2009-2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_GEOMETRY_SSE_H -#define EIGEN_GEOMETRY_SSE_H - -namespace Eigen { - -namespace internal { - -template -struct quat_product -{ - enum { - AAlignment = traits::Alignment, - BAlignment = traits::Alignment, - ResAlignment = traits >::Alignment - }; - static inline Quaternion run(const QuaternionBase& _a, const QuaternionBase& _b) - { - Quaternion res; - const __m128 mask = _mm_setr_ps(0.f,0.f,0.f,-0.f); - __m128 a = _a.coeffs().template packet(0); - __m128 b = _b.coeffs().template packet(0); - __m128 s1 = _mm_mul_ps(vec4f_swizzle1(a,1,2,0,2),vec4f_swizzle1(b,2,0,1,2)); - __m128 s2 = _mm_mul_ps(vec4f_swizzle1(a,3,3,3,1),vec4f_swizzle1(b,0,1,2,1)); - pstoret( - &res.x(), - _mm_add_ps(_mm_sub_ps(_mm_mul_ps(a,vec4f_swizzle1(b,3,3,3,3)), - _mm_mul_ps(vec4f_swizzle1(a,2,0,1,0), - vec4f_swizzle1(b,1,2,0,0))), - _mm_xor_ps(mask,_mm_add_ps(s1,s2)))); - - return res; - } -}; - -template -struct quat_conj -{ - enum { - ResAlignment = traits >::Alignment - }; - static inline Quaternion run(const QuaternionBase& q) - { - Quaternion res; - const __m128 mask = _mm_setr_ps(-0.f,-0.f,-0.f,0.f); - pstoret(&res.x(), _mm_xor_ps(mask, q.coeffs().template packet::Alignment>(0))); - return res; - } -}; - - -template -struct cross3_impl -{ - enum { - ResAlignment = traits::type>::Alignment - }; - static inline typename plain_matrix_type::type - run(const VectorLhs& lhs, const VectorRhs& rhs) - { - __m128 a = lhs.template packet::Alignment>(0); - __m128 b = rhs.template packet::Alignment>(0); - __m128 mul1=_mm_mul_ps(vec4f_swizzle1(a,1,2,0,3),vec4f_swizzle1(b,2,0,1,3)); - __m128 mul2=_mm_mul_ps(vec4f_swizzle1(a,2,0,1,3),vec4f_swizzle1(b,1,2,0,3)); - typename plain_matrix_type::type res; - pstoret(&res.x(),_mm_sub_ps(mul1,mul2)); - return res; - } -}; - - - - -template -struct quat_product -{ - enum { - BAlignment = traits::Alignment, - ResAlignment = traits >::Alignment - }; - - static inline Quaternion run(const QuaternionBase& _a, const QuaternionBase& _b) - { - const Packet2d mask = _mm_castsi128_pd(_mm_set_epi32(0x0,0x0,0x80000000,0x0)); - - Quaternion res; - - const double* a = _a.coeffs().data(); - Packet2d b_xy = _b.coeffs().template packet(0); - Packet2d b_zw = _b.coeffs().template packet(2); - Packet2d a_xx = pset1(a[0]); - Packet2d a_yy = pset1(a[1]); - Packet2d a_zz = pset1(a[2]); - Packet2d a_ww = pset1(a[3]); - - // two temporaries: - Packet2d t1, t2; - - /* - * t1 = ww*xy + yy*zw - * t2 = zz*xy - xx*zw - * res.xy = t1 +/- swap(t2) - */ - t1 = padd(pmul(a_ww, b_xy), pmul(a_yy, b_zw)); - t2 = psub(pmul(a_zz, b_xy), pmul(a_xx, b_zw)); -#ifdef EIGEN_VECTORIZE_SSE3 - EIGEN_UNUSED_VARIABLE(mask) - pstoret(&res.x(), _mm_addsub_pd(t1, preverse(t2))); -#else - pstoret(&res.x(), padd(t1, pxor(mask,preverse(t2)))); -#endif - - /* - * t1 = ww*zw - yy*xy - * t2 = zz*zw + xx*xy - * res.zw = t1 -/+ swap(t2) = swap( swap(t1) +/- t2) - */ - t1 = psub(pmul(a_ww, b_zw), pmul(a_yy, b_xy)); - t2 = padd(pmul(a_zz, b_zw), pmul(a_xx, b_xy)); -#ifdef EIGEN_VECTORIZE_SSE3 - EIGEN_UNUSED_VARIABLE(mask) - pstoret(&res.z(), preverse(_mm_addsub_pd(preverse(t1), t2))); -#else - pstoret(&res.z(), psub(t1, pxor(mask,preverse(t2)))); -#endif - - return res; -} -}; - -template -struct quat_conj -{ - enum { - ResAlignment = traits >::Alignment - }; - static inline Quaternion run(const QuaternionBase& q) - { - Quaternion res; - const __m128d mask0 = _mm_setr_pd(-0.,-0.); - const __m128d mask2 = _mm_setr_pd(-0.,0.); - pstoret(&res.x(), _mm_xor_pd(mask0, q.coeffs().template packet::Alignment>(0))); - pstoret(&res.z(), _mm_xor_pd(mask2, q.coeffs().template packet::Alignment>(2))); - return res; - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_GEOMETRY_SSE_H diff --git a/Eigen/src/Householder/BlockHouseholder.h b/Eigen/src/Householder/BlockHouseholder.h deleted file mode 100644 index 01a7ed188..000000000 --- a/Eigen/src/Householder/BlockHouseholder.h +++ /dev/null @@ -1,103 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Vincent Lejeune -// Copyright (C) 2010 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BLOCK_HOUSEHOLDER_H -#define EIGEN_BLOCK_HOUSEHOLDER_H - -// This file contains some helper function to deal with block householder reflectors - -namespace Eigen { - -namespace internal { - -/** \internal */ -// template -// void make_block_householder_triangular_factor(TriangularFactorType& triFactor, const VectorsType& vectors, const CoeffsType& hCoeffs) -// { -// typedef typename VectorsType::Scalar Scalar; -// const Index nbVecs = vectors.cols(); -// eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs); -// -// for(Index i = 0; i < nbVecs; i++) -// { -// Index rs = vectors.rows() - i; -// // Warning, note that hCoeffs may alias with vectors. -// // It is then necessary to copy it before modifying vectors(i,i). -// typename CoeffsType::Scalar h = hCoeffs(i); -// // This hack permits to pass trough nested Block<> and Transpose<> expressions. -// Scalar *Vii_ptr = const_cast(vectors.data() + vectors.outerStride()*i + vectors.innerStride()*i); -// Scalar Vii = *Vii_ptr; -// *Vii_ptr = Scalar(1); -// triFactor.col(i).head(i).noalias() = -h * vectors.block(i, 0, rs, i).adjoint() -// * vectors.col(i).tail(rs); -// *Vii_ptr = Vii; -// // FIXME add .noalias() once the triangular product can work inplace -// triFactor.col(i).head(i) = triFactor.block(0,0,i,i).template triangularView() -// * triFactor.col(i).head(i); -// triFactor(i,i) = hCoeffs(i); -// } -// } - -/** \internal */ -// This variant avoid modifications in vectors -template -void make_block_householder_triangular_factor(TriangularFactorType& triFactor, const VectorsType& vectors, const CoeffsType& hCoeffs) -{ - const Index nbVecs = vectors.cols(); - eigen_assert(triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs); - - for(Index i = nbVecs-1; i >=0 ; --i) - { - Index rs = vectors.rows() - i - 1; - Index rt = nbVecs-i-1; - - if(rt>0) - { - triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint() - * vectors.bottomRightCorner(rs, rt).template triangularView(); - - // FIXME add .noalias() once the triangular product can work inplace - triFactor.row(i).tail(rt) = triFactor.row(i).tail(rt) * triFactor.bottomRightCorner(rt,rt).template triangularView(); - - } - triFactor(i,i) = hCoeffs(i); - } -} - -/** \internal - * if forward then perform mat = H0 * H1 * H2 * mat - * otherwise perform mat = H2 * H1 * H0 * mat - */ -template -void apply_block_householder_on_the_left(MatrixType& mat, const VectorsType& vectors, const CoeffsType& hCoeffs, bool forward) -{ - enum { TFactorSize = MatrixType::ColsAtCompileTime }; - Index nbVecs = vectors.cols(); - Matrix T(nbVecs,nbVecs); - - if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs); - else make_block_householder_triangular_factor(T, vectors, hCoeffs.conjugate()); - const TriangularView V(vectors); - - // A -= V T V^* A - Matrix tmp = V.adjoint() * mat; - // FIXME add .noalias() once the triangular product can work inplace - if(forward) tmp = T.template triangularView() * tmp; - else tmp = T.template triangularView().adjoint() * tmp; - mat.noalias() -= V * tmp; -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_BLOCK_HOUSEHOLDER_H diff --git a/Eigen/src/Householder/Householder.h b/Eigen/src/Householder/Householder.h deleted file mode 100644 index 80de2c305..000000000 --- a/Eigen/src/Householder/Householder.h +++ /dev/null @@ -1,172 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Benoit Jacob -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_HOUSEHOLDER_H -#define EIGEN_HOUSEHOLDER_H - -namespace Eigen { - -namespace internal { -template struct decrement_size -{ - enum { - ret = n==Dynamic ? n : n-1 - }; -}; -} - -/** Computes the elementary reflector H such that: - * \f$ H *this = [ beta 0 ... 0]^T \f$ - * where the transformation H is: - * \f$ H = I - tau v v^*\f$ - * and the vector v is: - * \f$ v^T = [1 essential^T] \f$ - * - * The essential part of the vector \c v is stored in *this. - * - * On output: - * \param tau the scaling factor of the Householder transformation - * \param beta the result of H * \c *this - * - * \sa MatrixBase::makeHouseholder(), MatrixBase::applyHouseholderOnTheLeft(), - * MatrixBase::applyHouseholderOnTheRight() - */ -template -void MatrixBase::makeHouseholderInPlace(Scalar& tau, RealScalar& beta) -{ - VectorBlock::ret> essentialPart(derived(), 1, size()-1); - makeHouseholder(essentialPart, tau, beta); -} - -/** Computes the elementary reflector H such that: - * \f$ H *this = [ beta 0 ... 0]^T \f$ - * where the transformation H is: - * \f$ H = I - tau v v^*\f$ - * and the vector v is: - * \f$ v^T = [1 essential^T] \f$ - * - * On output: - * \param essential the essential part of the vector \c v - * \param tau the scaling factor of the Householder transformation - * \param beta the result of H * \c *this - * - * \sa MatrixBase::makeHouseholderInPlace(), MatrixBase::applyHouseholderOnTheLeft(), - * MatrixBase::applyHouseholderOnTheRight() - */ -template -template -void MatrixBase::makeHouseholder( - EssentialPart& essential, - Scalar& tau, - RealScalar& beta) const -{ - using std::sqrt; - using numext::conj; - - EIGEN_STATIC_ASSERT_VECTOR_ONLY(EssentialPart) - VectorBlock tail(derived(), 1, size()-1); - - RealScalar tailSqNorm = size()==1 ? RealScalar(0) : tail.squaredNorm(); - Scalar c0 = coeff(0); - const RealScalar tol = (std::numeric_limits::min)(); - - if(tailSqNorm <= tol && numext::abs2(numext::imag(c0))<=tol) - { - tau = RealScalar(0); - beta = numext::real(c0); - essential.setZero(); - } - else - { - beta = sqrt(numext::abs2(c0) + tailSqNorm); - if (numext::real(c0)>=RealScalar(0)) - beta = -beta; - essential = tail / (c0 - beta); - tau = conj((beta - c0) / beta); - } -} - -/** Apply the elementary reflector H given by - * \f$ H = I - tau v v^*\f$ - * with - * \f$ v^T = [1 essential^T] \f$ - * from the left to a vector or matrix. - * - * On input: - * \param essential the essential part of the vector \c v - * \param tau the scaling factor of the Householder transformation - * \param workspace a pointer to working space with at least - * this->cols() * essential.size() entries - * - * \sa MatrixBase::makeHouseholder(), MatrixBase::makeHouseholderInPlace(), - * MatrixBase::applyHouseholderOnTheRight() - */ -template -template -void MatrixBase::applyHouseholderOnTheLeft( - const EssentialPart& essential, - const Scalar& tau, - Scalar* workspace) -{ - if(rows() == 1) - { - *this *= Scalar(1)-tau; - } - else if(tau!=Scalar(0)) - { - Map::type> tmp(workspace,cols()); - Block bottom(derived(), 1, 0, rows()-1, cols()); - tmp.noalias() = essential.adjoint() * bottom; - tmp += this->row(0); - this->row(0) -= tau * tmp; - bottom.noalias() -= tau * essential * tmp; - } -} - -/** Apply the elementary reflector H given by - * \f$ H = I - tau v v^*\f$ - * with - * \f$ v^T = [1 essential^T] \f$ - * from the right to a vector or matrix. - * - * On input: - * \param essential the essential part of the vector \c v - * \param tau the scaling factor of the Householder transformation - * \param workspace a pointer to working space with at least - * this->cols() * essential.size() entries - * - * \sa MatrixBase::makeHouseholder(), MatrixBase::makeHouseholderInPlace(), - * MatrixBase::applyHouseholderOnTheLeft() - */ -template -template -void MatrixBase::applyHouseholderOnTheRight( - const EssentialPart& essential, - const Scalar& tau, - Scalar* workspace) -{ - if(cols() == 1) - { - *this *= Scalar(1)-tau; - } - else if(tau!=Scalar(0)) - { - Map::type> tmp(workspace,rows()); - Block right(derived(), 0, 1, rows(), cols()-1); - tmp.noalias() = right * essential.conjugate(); - tmp += this->col(0); - this->col(0) -= tau * tmp; - right.noalias() -= tau * tmp * essential.transpose(); - } -} - -} // end namespace Eigen - -#endif // EIGEN_HOUSEHOLDER_H diff --git a/Eigen/src/Householder/HouseholderSequence.h b/Eigen/src/Householder/HouseholderSequence.h deleted file mode 100644 index 3ce0a693d..000000000 --- a/Eigen/src/Householder/HouseholderSequence.h +++ /dev/null @@ -1,470 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2010 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_HOUSEHOLDER_SEQUENCE_H -#define EIGEN_HOUSEHOLDER_SEQUENCE_H - -namespace Eigen { - -/** \ingroup Householder_Module - * \householder_module - * \class HouseholderSequence - * \brief Sequence of Householder reflections acting on subspaces with decreasing size - * \tparam VectorsType type of matrix containing the Householder vectors - * \tparam CoeffsType type of vector containing the Householder coefficients - * \tparam Side either OnTheLeft (the default) or OnTheRight - * - * This class represents a product sequence of Householder reflections where the first Householder reflection - * acts on the whole space, the second Householder reflection leaves the one-dimensional subspace spanned by - * the first unit vector invariant, the third Householder reflection leaves the two-dimensional subspace - * spanned by the first two unit vectors invariant, and so on up to the last reflection which leaves all but - * one dimensions invariant and acts only on the last dimension. Such sequences of Householder reflections - * are used in several algorithms to zero out certain parts of a matrix. Indeed, the methods - * HessenbergDecomposition::matrixQ(), Tridiagonalization::matrixQ(), HouseholderQR::householderQ(), - * and ColPivHouseholderQR::householderQ() all return a %HouseholderSequence. - * - * More precisely, the class %HouseholderSequence represents an \f$ n \times n \f$ matrix \f$ H \f$ of the - * form \f$ H = \prod_{i=0}^{n-1} H_i \f$ where the i-th Householder reflection is \f$ H_i = I - h_i v_i - * v_i^* \f$. The i-th Householder coefficient \f$ h_i \f$ is a scalar and the i-th Householder vector \f$ - * v_i \f$ is a vector of the form - * \f[ - * v_i = [\underbrace{0, \ldots, 0}_{i-1\mbox{ zeros}}, 1, \underbrace{*, \ldots,*}_{n-i\mbox{ arbitrary entries}} ]. - * \f] - * The last \f$ n-i \f$ entries of \f$ v_i \f$ are called the essential part of the Householder vector. - * - * Typical usages are listed below, where H is a HouseholderSequence: - * \code - * A.applyOnTheRight(H); // A = A * H - * A.applyOnTheLeft(H); // A = H * A - * A.applyOnTheRight(H.adjoint()); // A = A * H^* - * A.applyOnTheLeft(H.adjoint()); // A = H^* * A - * MatrixXd Q = H; // conversion to a dense matrix - * \endcode - * In addition to the adjoint, you can also apply the inverse (=adjoint), the transpose, and the conjugate operators. - * - * See the documentation for HouseholderSequence(const VectorsType&, const CoeffsType&) for an example. - * - * \sa MatrixBase::applyOnTheLeft(), MatrixBase::applyOnTheRight() - */ - -namespace internal { - -template -struct traits > -{ - typedef typename VectorsType::Scalar Scalar; - typedef typename VectorsType::StorageIndex StorageIndex; - typedef typename VectorsType::StorageKind StorageKind; - enum { - RowsAtCompileTime = Side==OnTheLeft ? traits::RowsAtCompileTime - : traits::ColsAtCompileTime, - ColsAtCompileTime = RowsAtCompileTime, - MaxRowsAtCompileTime = Side==OnTheLeft ? traits::MaxRowsAtCompileTime - : traits::MaxColsAtCompileTime, - MaxColsAtCompileTime = MaxRowsAtCompileTime, - Flags = 0 - }; -}; - -struct HouseholderSequenceShape {}; - -template -struct evaluator_traits > - : public evaluator_traits_base > -{ - typedef HouseholderSequenceShape Shape; -}; - -template -struct hseq_side_dependent_impl -{ - typedef Block EssentialVectorType; - typedef HouseholderSequence HouseholderSequenceType; - static inline const EssentialVectorType essentialVector(const HouseholderSequenceType& h, Index k) - { - Index start = k+1+h.m_shift; - return Block(h.m_vectors, start, k, h.rows()-start, 1); - } -}; - -template -struct hseq_side_dependent_impl -{ - typedef Transpose > EssentialVectorType; - typedef HouseholderSequence HouseholderSequenceType; - static inline const EssentialVectorType essentialVector(const HouseholderSequenceType& h, Index k) - { - Index start = k+1+h.m_shift; - return Block(h.m_vectors, k, start, 1, h.rows()-start).transpose(); - } -}; - -template struct matrix_type_times_scalar_type -{ - typedef typename ScalarBinaryOpTraits::ReturnType - ResultScalar; - typedef Matrix Type; -}; - -} // end namespace internal - -template class HouseholderSequence - : public EigenBase > -{ - typedef typename internal::hseq_side_dependent_impl::EssentialVectorType EssentialVectorType; - - public: - enum { - RowsAtCompileTime = internal::traits::RowsAtCompileTime, - ColsAtCompileTime = internal::traits::ColsAtCompileTime, - MaxRowsAtCompileTime = internal::traits::MaxRowsAtCompileTime, - MaxColsAtCompileTime = internal::traits::MaxColsAtCompileTime - }; - typedef typename internal::traits::Scalar Scalar; - - typedef HouseholderSequence< - typename internal::conditional::IsComplex, - typename internal::remove_all::type, - VectorsType>::type, - typename internal::conditional::IsComplex, - typename internal::remove_all::type, - CoeffsType>::type, - Side - > ConjugateReturnType; - - /** \brief Constructor. - * \param[in] v %Matrix containing the essential parts of the Householder vectors - * \param[in] h Vector containing the Householder coefficients - * - * Constructs the Householder sequence with coefficients given by \p h and vectors given by \p v. The - * i-th Householder coefficient \f$ h_i \f$ is given by \p h(i) and the essential part of the i-th - * Householder vector \f$ v_i \f$ is given by \p v(k,i) with \p k > \p i (the subdiagonal part of the - * i-th column). If \p v has fewer columns than rows, then the Householder sequence contains as many - * Householder reflections as there are columns. - * - * \note The %HouseholderSequence object stores \p v and \p h by reference. - * - * Example: \include HouseholderSequence_HouseholderSequence.cpp - * Output: \verbinclude HouseholderSequence_HouseholderSequence.out - * - * \sa setLength(), setShift() - */ - HouseholderSequence(const VectorsType& v, const CoeffsType& h) - : m_vectors(v), m_coeffs(h), m_trans(false), m_length(v.diagonalSize()), - m_shift(0) - { - } - - /** \brief Copy constructor. */ - HouseholderSequence(const HouseholderSequence& other) - : m_vectors(other.m_vectors), - m_coeffs(other.m_coeffs), - m_trans(other.m_trans), - m_length(other.m_length), - m_shift(other.m_shift) - { - } - - /** \brief Number of rows of transformation viewed as a matrix. - * \returns Number of rows - * \details This equals the dimension of the space that the transformation acts on. - */ - Index rows() const { return Side==OnTheLeft ? m_vectors.rows() : m_vectors.cols(); } - - /** \brief Number of columns of transformation viewed as a matrix. - * \returns Number of columns - * \details This equals the dimension of the space that the transformation acts on. - */ - Index cols() const { return rows(); } - - /** \brief Essential part of a Householder vector. - * \param[in] k Index of Householder reflection - * \returns Vector containing non-trivial entries of k-th Householder vector - * - * This function returns the essential part of the Householder vector \f$ v_i \f$. This is a vector of - * length \f$ n-i \f$ containing the last \f$ n-i \f$ entries of the vector - * \f[ - * v_i = [\underbrace{0, \ldots, 0}_{i-1\mbox{ zeros}}, 1, \underbrace{*, \ldots,*}_{n-i\mbox{ arbitrary entries}} ]. - * \f] - * The index \f$ i \f$ equals \p k + shift(), corresponding to the k-th column of the matrix \p v - * passed to the constructor. - * - * \sa setShift(), shift() - */ - const EssentialVectorType essentialVector(Index k) const - { - eigen_assert(k >= 0 && k < m_length); - return internal::hseq_side_dependent_impl::essentialVector(*this, k); - } - - /** \brief %Transpose of the Householder sequence. */ - HouseholderSequence transpose() const - { - return HouseholderSequence(*this).setTrans(!m_trans); - } - - /** \brief Complex conjugate of the Householder sequence. */ - ConjugateReturnType conjugate() const - { - return ConjugateReturnType(m_vectors.conjugate(), m_coeffs.conjugate()) - .setTrans(m_trans) - .setLength(m_length) - .setShift(m_shift); - } - - /** \brief Adjoint (conjugate transpose) of the Householder sequence. */ - ConjugateReturnType adjoint() const - { - return conjugate().setTrans(!m_trans); - } - - /** \brief Inverse of the Householder sequence (equals the adjoint). */ - ConjugateReturnType inverse() const { return adjoint(); } - - /** \internal */ - template inline void evalTo(DestType& dst) const - { - Matrix workspace(rows()); - evalTo(dst, workspace); - } - - /** \internal */ - template - void evalTo(Dest& dst, Workspace& workspace) const - { - workspace.resize(rows()); - Index vecs = m_length; - if(internal::is_same_dense(dst,m_vectors)) - { - // in-place - dst.diagonal().setOnes(); - dst.template triangularView().setZero(); - for(Index k = vecs-1; k >= 0; --k) - { - Index cornerSize = rows() - k - m_shift; - if(m_trans) - dst.bottomRightCorner(cornerSize, cornerSize) - .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data()); - else - dst.bottomRightCorner(cornerSize, cornerSize) - .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data()); - - // clear the off diagonal vector - dst.col(k).tail(rows()-k-1).setZero(); - } - // clear the remaining columns if needed - for(Index k = 0; k= 0; --k) - { - Index cornerSize = rows() - k - m_shift; - if(m_trans) - dst.bottomRightCorner(cornerSize, cornerSize) - .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), &workspace.coeffRef(0)); - else - dst.bottomRightCorner(cornerSize, cornerSize) - .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), &workspace.coeffRef(0)); - } - } - } - - /** \internal */ - template inline void applyThisOnTheRight(Dest& dst) const - { - Matrix workspace(dst.rows()); - applyThisOnTheRight(dst, workspace); - } - - /** \internal */ - template - inline void applyThisOnTheRight(Dest& dst, Workspace& workspace) const - { - workspace.resize(dst.rows()); - for(Index k = 0; k < m_length; ++k) - { - Index actual_k = m_trans ? m_length-k-1 : k; - dst.rightCols(rows()-m_shift-actual_k) - .applyHouseholderOnTheRight(essentialVector(actual_k), m_coeffs.coeff(actual_k), workspace.data()); - } - } - - /** \internal */ - template inline void applyThisOnTheLeft(Dest& dst) const - { - Matrix workspace; - applyThisOnTheLeft(dst, workspace); - } - - /** \internal */ - template - inline void applyThisOnTheLeft(Dest& dst, Workspace& workspace) const - { - const Index BlockSize = 48; - // if the entries are large enough, then apply the reflectors by block - if(m_length>=BlockSize && dst.cols()>1) - { - for(Index i = 0; i < m_length; i+=BlockSize) - { - Index end = m_trans ? (std::min)(m_length,i+BlockSize) : m_length-i; - Index k = m_trans ? i : (std::max)(Index(0),end-BlockSize); - Index bs = end-k; - Index start = k + m_shift; - - typedef Block::type,Dynamic,Dynamic> SubVectorsType; - SubVectorsType sub_vecs1(m_vectors.const_cast_derived(), Side==OnTheRight ? k : start, - Side==OnTheRight ? start : k, - Side==OnTheRight ? bs : m_vectors.rows()-start, - Side==OnTheRight ? m_vectors.cols()-start : bs); - typename internal::conditional, SubVectorsType&>::type sub_vecs(sub_vecs1); - Block sub_dst(dst,dst.rows()-rows()+m_shift+k,0, rows()-m_shift-k,dst.cols()); - apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_trans); - } - } - else - { - workspace.resize(dst.cols()); - for(Index k = 0; k < m_length; ++k) - { - Index actual_k = m_trans ? k : m_length-k-1; - dst.bottomRows(rows()-m_shift-actual_k) - .applyHouseholderOnTheLeft(essentialVector(actual_k), m_coeffs.coeff(actual_k), workspace.data()); - } - } - } - - /** \brief Computes the product of a Householder sequence with a matrix. - * \param[in] other %Matrix being multiplied. - * \returns Expression object representing the product. - * - * This function computes \f$ HM \f$ where \f$ H \f$ is the Householder sequence represented by \p *this - * and \f$ M \f$ is the matrix \p other. - */ - template - typename internal::matrix_type_times_scalar_type::Type operator*(const MatrixBase& other) const - { - typename internal::matrix_type_times_scalar_type::Type - res(other.template cast::ResultScalar>()); - applyThisOnTheLeft(res); - return res; - } - - template friend struct internal::hseq_side_dependent_impl; - - /** \brief Sets the length of the Householder sequence. - * \param [in] length New value for the length. - * - * By default, the length \f$ n \f$ of the Householder sequence \f$ H = H_0 H_1 \ldots H_{n-1} \f$ is set - * to the number of columns of the matrix \p v passed to the constructor, or the number of rows if that - * is smaller. After this function is called, the length equals \p length. - * - * \sa length() - */ - HouseholderSequence& setLength(Index length) - { - m_length = length; - return *this; - } - - /** \brief Sets the shift of the Householder sequence. - * \param [in] shift New value for the shift. - * - * By default, a %HouseholderSequence object represents \f$ H = H_0 H_1 \ldots H_{n-1} \f$ and the i-th - * column of the matrix \p v passed to the constructor corresponds to the i-th Householder - * reflection. After this function is called, the object represents \f$ H = H_{\mathrm{shift}} - * H_{\mathrm{shift}+1} \ldots H_{n-1} \f$ and the i-th column of \p v corresponds to the (shift+i)-th - * Householder reflection. - * - * \sa shift() - */ - HouseholderSequence& setShift(Index shift) - { - m_shift = shift; - return *this; - } - - Index length() const { return m_length; } /**< \brief Returns the length of the Householder sequence. */ - Index shift() const { return m_shift; } /**< \brief Returns the shift of the Householder sequence. */ - - /* Necessary for .adjoint() and .conjugate() */ - template friend class HouseholderSequence; - - protected: - - /** \brief Sets the transpose flag. - * \param [in] trans New value of the transpose flag. - * - * By default, the transpose flag is not set. If the transpose flag is set, then this object represents - * \f$ H^T = H_{n-1}^T \ldots H_1^T H_0^T \f$ instead of \f$ H = H_0 H_1 \ldots H_{n-1} \f$. - * - * \sa trans() - */ - HouseholderSequence& setTrans(bool trans) - { - m_trans = trans; - return *this; - } - - bool trans() const { return m_trans; } /**< \brief Returns the transpose flag. */ - - typename VectorsType::Nested m_vectors; - typename CoeffsType::Nested m_coeffs; - bool m_trans; - Index m_length; - Index m_shift; -}; - -/** \brief Computes the product of a matrix with a Householder sequence. - * \param[in] other %Matrix being multiplied. - * \param[in] h %HouseholderSequence being multiplied. - * \returns Expression object representing the product. - * - * This function computes \f$ MH \f$ where \f$ M \f$ is the matrix \p other and \f$ H \f$ is the - * Householder sequence represented by \p h. - */ -template -typename internal::matrix_type_times_scalar_type::Type operator*(const MatrixBase& other, const HouseholderSequence& h) -{ - typename internal::matrix_type_times_scalar_type::Type - res(other.template cast::ResultScalar>()); - h.applyThisOnTheRight(res); - return res; -} - -/** \ingroup Householder_Module \householder_module - * \brief Convenience function for constructing a Householder sequence. - * \returns A HouseholderSequence constructed from the specified arguments. - */ -template -HouseholderSequence householderSequence(const VectorsType& v, const CoeffsType& h) -{ - return HouseholderSequence(v, h); -} - -/** \ingroup Householder_Module \householder_module - * \brief Convenience function for constructing a Householder sequence. - * \returns A HouseholderSequence constructed from the specified arguments. - * \details This function differs from householderSequence() in that the template argument \p OnTheSide of - * the constructed HouseholderSequence is set to OnTheRight, instead of the default OnTheLeft. - */ -template -HouseholderSequence rightHouseholderSequence(const VectorsType& v, const CoeffsType& h) -{ - return HouseholderSequence(v, h); -} - -} // end namespace Eigen - -#endif // EIGEN_HOUSEHOLDER_SEQUENCE_H diff --git a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h b/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h deleted file mode 100644 index f66c846ef..000000000 --- a/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h +++ /dev/null @@ -1,226 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2011-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BASIC_PRECONDITIONERS_H -#define EIGEN_BASIC_PRECONDITIONERS_H - -namespace Eigen { - -/** \ingroup IterativeLinearSolvers_Module - * \brief A preconditioner based on the digonal entries - * - * This class allows to approximately solve for A.x = b problems assuming A is a diagonal matrix. - * In other words, this preconditioner neglects all off diagonal entries and, in Eigen's language, solves for: - \code - A.diagonal().asDiagonal() . x = b - \endcode - * - * \tparam _Scalar the type of the scalar. - * - * \implsparsesolverconcept - * - * This preconditioner is suitable for both selfadjoint and general problems. - * The diagonal entries are pre-inverted and stored into a dense vector. - * - * \note A variant that has yet to be implemented would attempt to preserve the norm of each column. - * - * \sa class LeastSquareDiagonalPreconditioner, class ConjugateGradient - */ -template -class DiagonalPreconditioner -{ - typedef _Scalar Scalar; - typedef Matrix Vector; - public: - typedef typename Vector::StorageIndex StorageIndex; - enum { - ColsAtCompileTime = Dynamic, - MaxColsAtCompileTime = Dynamic - }; - - DiagonalPreconditioner() : m_isInitialized(false) {} - - template - explicit DiagonalPreconditioner(const MatType& mat) : m_invdiag(mat.cols()) - { - compute(mat); - } - - Index rows() const { return m_invdiag.size(); } - Index cols() const { return m_invdiag.size(); } - - template - DiagonalPreconditioner& analyzePattern(const MatType& ) - { - return *this; - } - - template - DiagonalPreconditioner& factorize(const MatType& mat) - { - m_invdiag.resize(mat.cols()); - for(int j=0; j - DiagonalPreconditioner& compute(const MatType& mat) - { - return factorize(mat); - } - - /** \internal */ - template - void _solve_impl(const Rhs& b, Dest& x) const - { - x = m_invdiag.array() * b.array() ; - } - - template inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "DiagonalPreconditioner is not initialized."); - eigen_assert(m_invdiag.size()==b.rows() - && "DiagonalPreconditioner::solve(): invalid number of rows of the right hand side matrix b"); - return Solve(*this, b.derived()); - } - - ComputationInfo info() { return Success; } - - protected: - Vector m_invdiag; - bool m_isInitialized; -}; - -/** \ingroup IterativeLinearSolvers_Module - * \brief Jacobi preconditioner for LeastSquaresConjugateGradient - * - * This class allows to approximately solve for A' A x = A' b problems assuming A' A is a diagonal matrix. - * In other words, this preconditioner neglects all off diagonal entries and, in Eigen's language, solves for: - \code - (A.adjoint() * A).diagonal().asDiagonal() * x = b - \endcode - * - * \tparam _Scalar the type of the scalar. - * - * \implsparsesolverconcept - * - * The diagonal entries are pre-inverted and stored into a dense vector. - * - * \sa class LeastSquaresConjugateGradient, class DiagonalPreconditioner - */ -template -class LeastSquareDiagonalPreconditioner : public DiagonalPreconditioner<_Scalar> -{ - typedef _Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef DiagonalPreconditioner<_Scalar> Base; - using Base::m_invdiag; - public: - - LeastSquareDiagonalPreconditioner() : Base() {} - - template - explicit LeastSquareDiagonalPreconditioner(const MatType& mat) : Base() - { - compute(mat); - } - - template - LeastSquareDiagonalPreconditioner& analyzePattern(const MatType& ) - { - return *this; - } - - template - LeastSquareDiagonalPreconditioner& factorize(const MatType& mat) - { - // Compute the inverse squared-norm of each column of mat - m_invdiag.resize(mat.cols()); - if(MatType::IsRowMajor) - { - m_invdiag.setZero(); - for(Index j=0; jRealScalar(0)) - m_invdiag(j) = RealScalar(1)/numext::real(m_invdiag(j)); - } - else - { - for(Index j=0; jRealScalar(0)) - m_invdiag(j) = RealScalar(1)/sum; - else - m_invdiag(j) = RealScalar(1); - } - } - Base::m_isInitialized = true; - return *this; - } - - template - LeastSquareDiagonalPreconditioner& compute(const MatType& mat) - { - return factorize(mat); - } - - ComputationInfo info() { return Success; } - - protected: -}; - -/** \ingroup IterativeLinearSolvers_Module - * \brief A naive preconditioner which approximates any matrix as the identity matrix - * - * \implsparsesolverconcept - * - * \sa class DiagonalPreconditioner - */ -class IdentityPreconditioner -{ - public: - - IdentityPreconditioner() {} - - template - explicit IdentityPreconditioner(const MatrixType& ) {} - - template - IdentityPreconditioner& analyzePattern(const MatrixType& ) { return *this; } - - template - IdentityPreconditioner& factorize(const MatrixType& ) { return *this; } - - template - IdentityPreconditioner& compute(const MatrixType& ) { return *this; } - - template - inline const Rhs& solve(const Rhs& b) const { return b; } - - ComputationInfo info() { return Success; } -}; - -} // end namespace Eigen - -#endif // EIGEN_BASIC_PRECONDITIONERS_H diff --git a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h deleted file mode 100644 index 454f46814..000000000 --- a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +++ /dev/null @@ -1,228 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2011-2014 Gael Guennebaud -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BICGSTAB_H -#define EIGEN_BICGSTAB_H - -namespace Eigen { - -namespace internal { - -/** \internal Low-level bi conjugate gradient stabilized algorithm - * \param mat The matrix A - * \param rhs The right hand side vector b - * \param x On input and initial solution, on output the computed solution. - * \param precond A preconditioner being able to efficiently solve for an - * approximation of Ax=b (regardless of b) - * \param iters On input the max number of iteration, on output the number of performed iterations. - * \param tol_error On input the tolerance error, on output an estimation of the relative error. - * \return false in the case of numerical issue, for example a break down of BiCGSTAB. - */ -template -bool bicgstab(const MatrixType& mat, const Rhs& rhs, Dest& x, - const Preconditioner& precond, Index& iters, - typename Dest::RealScalar& tol_error) -{ - using std::sqrt; - using std::abs; - typedef typename Dest::RealScalar RealScalar; - typedef typename Dest::Scalar Scalar; - typedef Matrix VectorType; - RealScalar tol = tol_error; - Index maxIters = iters; - - Index n = mat.cols(); - VectorType r = rhs - mat * x; - VectorType r0 = r; - - RealScalar r0_sqnorm = r0.squaredNorm(); - RealScalar rhs_sqnorm = rhs.squaredNorm(); - if(rhs_sqnorm == 0) - { - x.setZero(); - return true; - } - Scalar rho = 1; - Scalar alpha = 1; - Scalar w = 1; - - VectorType v = VectorType::Zero(n), p = VectorType::Zero(n); - VectorType y(n), z(n); - VectorType kt(n), ks(n); - - VectorType s(n), t(n); - - RealScalar tol2 = tol*tol*rhs_sqnorm; - RealScalar eps2 = NumTraits::epsilon()*NumTraits::epsilon(); - Index i = 0; - Index restarts = 0; - - while ( r.squaredNorm() > tol2 && iRealScalar(0)) - w = t.dot(s) / tmp; - else - w = Scalar(0); - x += alpha * y + w * z; - r = s - w * t; - ++i; - } - tol_error = sqrt(r.squaredNorm()/rhs_sqnorm); - iters = i; - return true; -} - -} - -template< typename _MatrixType, - typename _Preconditioner = DiagonalPreconditioner > -class BiCGSTAB; - -namespace internal { - -template< typename _MatrixType, typename _Preconditioner> -struct traits > -{ - typedef _MatrixType MatrixType; - typedef _Preconditioner Preconditioner; -}; - -} - -/** \ingroup IterativeLinearSolvers_Module - * \brief A bi conjugate gradient stabilized solver for sparse square problems - * - * This class allows to solve for A.x = b sparse linear problems using a bi conjugate gradient - * stabilized algorithm. The vectors x and b can be either dense or sparse. - * - * \tparam _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix. - * \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner - * - * \implsparsesolverconcept - * - * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations() - * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations - * and NumTraits::epsilon() for the tolerance. - * - * The tolerance corresponds to the relative residual error: |Ax-b|/|b| - * - * \b Performance: when using sparse matrices, best performance is achied for a row-major sparse matrix format. - * Moreover, in this case multi-threading can be exploited if the user code is compiled with OpenMP enabled. - * See \ref TopicMultiThreading for details. - * - * This class can be used as the direct solver classes. Here is a typical usage example: - * \include BiCGSTAB_simple.cpp - * - * By default the iterations start with x=0 as an initial guess of the solution. - * One can control the start using the solveWithGuess() method. - * - * BiCGSTAB can also be used in a matrix-free context, see the following \link MatrixfreeSolverExample example \endlink. - * - * \sa class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner - */ -template< typename _MatrixType, typename _Preconditioner> -class BiCGSTAB : public IterativeSolverBase > -{ - typedef IterativeSolverBase Base; - using Base::matrix; - using Base::m_error; - using Base::m_iterations; - using Base::m_info; - using Base::m_isInitialized; -public: - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef _Preconditioner Preconditioner; - -public: - - /** Default constructor. */ - BiCGSTAB() : Base() {} - - /** Initialize the solver with matrix \a A for further \c Ax=b solving. - * - * This constructor is a shortcut for the default constructor followed - * by a call to compute(). - * - * \warning this class stores a reference to the matrix A as well as some - * precomputed values that depend on it. Therefore, if \a A is changed - * this class becomes invalid. Call compute() to update it with the new - * matrix A, or modify a copy of A. - */ - template - explicit BiCGSTAB(const EigenBase& A) : Base(A.derived()) {} - - ~BiCGSTAB() {} - - /** \internal */ - template - void _solve_with_guess_impl(const Rhs& b, Dest& x) const - { - bool failed = false; - for(Index j=0; j - void _solve_impl(const MatrixBase& b, Dest& x) const - { - x.resize(this->rows(),b.cols()); - x.setZero(); - _solve_with_guess_impl(b,x); - } - -protected: - -}; - -} // end namespace Eigen - -#endif // EIGEN_BICGSTAB_H diff --git a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h deleted file mode 100644 index 395daa8e4..000000000 --- a/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h +++ /dev/null @@ -1,245 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2011-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_CONJUGATE_GRADIENT_H -#define EIGEN_CONJUGATE_GRADIENT_H - -namespace Eigen { - -namespace internal { - -/** \internal Low-level conjugate gradient algorithm - * \param mat The matrix A - * \param rhs The right hand side vector b - * \param x On input and initial solution, on output the computed solution. - * \param precond A preconditioner being able to efficiently solve for an - * approximation of Ax=b (regardless of b) - * \param iters On input the max number of iteration, on output the number of performed iterations. - * \param tol_error On input the tolerance error, on output an estimation of the relative error. - */ -template -EIGEN_DONT_INLINE -void conjugate_gradient(const MatrixType& mat, const Rhs& rhs, Dest& x, - const Preconditioner& precond, Index& iters, - typename Dest::RealScalar& tol_error) -{ - using std::sqrt; - using std::abs; - typedef typename Dest::RealScalar RealScalar; - typedef typename Dest::Scalar Scalar; - typedef Matrix VectorType; - - RealScalar tol = tol_error; - Index maxIters = iters; - - Index n = mat.cols(); - - VectorType residual = rhs - mat * x; //initial residual - - RealScalar rhsNorm2 = rhs.squaredNorm(); - if(rhsNorm2 == 0) - { - x.setZero(); - iters = 0; - tol_error = 0; - return; - } - RealScalar threshold = tol*tol*rhsNorm2; - RealScalar residualNorm2 = residual.squaredNorm(); - if (residualNorm2 < threshold) - { - iters = 0; - tol_error = sqrt(residualNorm2 / rhsNorm2); - return; - } - - VectorType p(n); - p = precond.solve(residual); // initial search direction - - VectorType z(n), tmp(n); - RealScalar absNew = numext::real(residual.dot(p)); // the square of the absolute value of r scaled by invM - Index i = 0; - while(i < maxIters) - { - tmp.noalias() = mat * p; // the bottleneck of the algorithm - - Scalar alpha = absNew / p.dot(tmp); // the amount we travel on dir - x += alpha * p; // update solution - residual -= alpha * tmp; // update residual - - residualNorm2 = residual.squaredNorm(); - if(residualNorm2 < threshold) - break; - - z = precond.solve(residual); // approximately solve for "A z = residual" - - RealScalar absOld = absNew; - absNew = numext::real(residual.dot(z)); // update the absolute value of r - RealScalar beta = absNew / absOld; // calculate the Gram-Schmidt value used to create the new search direction - p = z + beta * p; // update search direction - i++; - } - tol_error = sqrt(residualNorm2 / rhsNorm2); - iters = i; -} - -} - -template< typename _MatrixType, int _UpLo=Lower, - typename _Preconditioner = DiagonalPreconditioner > -class ConjugateGradient; - -namespace internal { - -template< typename _MatrixType, int _UpLo, typename _Preconditioner> -struct traits > -{ - typedef _MatrixType MatrixType; - typedef _Preconditioner Preconditioner; -}; - -} - -/** \ingroup IterativeLinearSolvers_Module - * \brief A conjugate gradient solver for sparse (or dense) self-adjoint problems - * - * This class allows to solve for A.x = b linear problems using an iterative conjugate gradient algorithm. - * The matrix A must be selfadjoint. The matrix A and the vectors x and b can be either dense or sparse. - * - * \tparam _MatrixType the type of the matrix A, can be a dense or a sparse matrix. - * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower, - * \c Upper, or \c Lower|Upper in which the full matrix entries will be considered. - * Default is \c Lower, best performance is \c Lower|Upper. - * \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner - * - * \implsparsesolverconcept - * - * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations() - * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations - * and NumTraits::epsilon() for the tolerance. - * - * The tolerance corresponds to the relative residual error: |Ax-b|/|b| - * - * \b Performance: Even though the default value of \c _UpLo is \c Lower, significantly higher performance is - * achieved when using a complete matrix and \b Lower|Upper as the \a _UpLo template parameter. Moreover, in this - * case multi-threading can be exploited if the user code is compiled with OpenMP enabled. - * See \ref TopicMultiThreading for details. - * - * This class can be used as the direct solver classes. Here is a typical usage example: - \code - int n = 10000; - VectorXd x(n), b(n); - SparseMatrix A(n,n); - // fill A and b - ConjugateGradient, Lower|Upper> cg; - cg.compute(A); - x = cg.solve(b); - std::cout << "#iterations: " << cg.iterations() << std::endl; - std::cout << "estimated error: " << cg.error() << std::endl; - // update b, and solve again - x = cg.solve(b); - \endcode - * - * By default the iterations start with x=0 as an initial guess of the solution. - * One can control the start using the solveWithGuess() method. - * - * ConjugateGradient can also be used in a matrix-free context, see the following \link MatrixfreeSolverExample example \endlink. - * - * \sa class LeastSquaresConjugateGradient, class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner - */ -template< typename _MatrixType, int _UpLo, typename _Preconditioner> -class ConjugateGradient : public IterativeSolverBase > -{ - typedef IterativeSolverBase Base; - using Base::matrix; - using Base::m_error; - using Base::m_iterations; - using Base::m_info; - using Base::m_isInitialized; -public: - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef _Preconditioner Preconditioner; - - enum { - UpLo = _UpLo - }; - -public: - - /** Default constructor. */ - ConjugateGradient() : Base() {} - - /** Initialize the solver with matrix \a A for further \c Ax=b solving. - * - * This constructor is a shortcut for the default constructor followed - * by a call to compute(). - * - * \warning this class stores a reference to the matrix A as well as some - * precomputed values that depend on it. Therefore, if \a A is changed - * this class becomes invalid. Call compute() to update it with the new - * matrix A, or modify a copy of A. - */ - template - explicit ConjugateGradient(const EigenBase& A) : Base(A.derived()) {} - - ~ConjugateGradient() {} - - /** \internal */ - template - void _solve_with_guess_impl(const Rhs& b, Dest& x) const - { - typedef typename Base::MatrixWrapper MatrixWrapper; - typedef typename Base::ActualMatrixType ActualMatrixType; - enum { - TransposeInput = (!MatrixWrapper::MatrixFree) - && (UpLo==(Lower|Upper)) - && (!MatrixType::IsRowMajor) - && (!NumTraits::IsComplex) - }; - typedef typename internal::conditional, ActualMatrixType const&>::type RowMajorWrapper; - EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(MatrixWrapper::MatrixFree,UpLo==(Lower|Upper)),MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY); - typedef typename internal::conditional::Type - >::type SelfAdjointWrapper; - m_iterations = Base::maxIterations(); - m_error = Base::m_tolerance; - - for(Index j=0; j - void _solve_impl(const MatrixBase& b, Dest& x) const - { - x.setZero(); - _solve_with_guess_impl(b.derived(),x); - } - -protected: - -}; - -} // end namespace Eigen - -#endif // EIGEN_CONJUGATE_GRADIENT_H diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h b/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h deleted file mode 100644 index e45c272b4..000000000 --- a/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h +++ /dev/null @@ -1,400 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// Copyright (C) 2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_INCOMPLETE_CHOlESKY_H -#define EIGEN_INCOMPLETE_CHOlESKY_H - -#include -#include - -namespace Eigen { -/** - * \brief Modified Incomplete Cholesky with dual threshold - * - * References : C-J. Lin and J. J. Mor̩, Incomplete Cholesky Factorizations with - * Limited memory, SIAM J. Sci. Comput. 21(1), pp. 24-45, 1999 - * - * \tparam Scalar the scalar type of the input matrices - * \tparam _UpLo The triangular part that will be used for the computations. It can be Lower - * or Upper. Default is Lower. - * \tparam _OrderingType The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering, - * unless EIGEN_MPL2_ONLY is defined, in which case the default is NaturalOrdering. - * - * \implsparsesolverconcept - * - * It performs the following incomplete factorization: \f$ S P A P' S \approx L L' \f$ - * where L is a lower triangular factor, S is a diagonal scaling matrix, and P is a - * fill-in reducing permutation as computed by the ordering method. - * - * \b Shifting \b strategy: Let \f$ B = S P A P' S \f$ be the scaled matrix on which the factorization is carried out, - * and \f$ \beta \f$ be the minimum value of the diagonal. If \f$ \beta > 0 \f$ then, the factorization is directly performed - * on the matrix B. Otherwise, the factorization is performed on the shifted matrix \f$ B + (\sigma+|\beta| I \f$ where - * \f$ \sigma \f$ is the initial shift value as returned and set by setInitialShift() method. The default value is \f$ \sigma = 10^{-3} \f$. - * If the factorization fails, then the shift in doubled until it succeed or a maximum of ten attempts. If it still fails, as returned by - * the info() method, then you can either increase the initial shift, or better use another preconditioning technique. - * - */ -template -#else -NaturalOrdering -#endif -> -class IncompleteCholesky : public SparseSolverBase > -{ - protected: - typedef SparseSolverBase > Base; - using Base::m_isInitialized; - public: - typedef typename NumTraits::Real RealScalar; - typedef _OrderingType OrderingType; - typedef typename OrderingType::PermutationType PermutationType; - typedef typename PermutationType::StorageIndex StorageIndex; - typedef SparseMatrix FactorType; - typedef Matrix VectorSx; - typedef Matrix VectorRx; - typedef Matrix VectorIx; - typedef std::vector > VectorList; - enum { UpLo = _UpLo }; - enum { - ColsAtCompileTime = Dynamic, - MaxColsAtCompileTime = Dynamic - }; - public: - - /** Default constructor leaving the object in a partly non-initialized stage. - * - * You must call compute() or the pair analyzePattern()/factorize() to make it valid. - * - * \sa IncompleteCholesky(const MatrixType&) - */ - IncompleteCholesky() : m_initialShift(1e-3),m_factorizationIsOk(false) {} - - /** Constructor computing the incomplete factorization for the given matrix \a matrix. - */ - template - IncompleteCholesky(const MatrixType& matrix) : m_initialShift(1e-3),m_factorizationIsOk(false) - { - compute(matrix); - } - - /** \returns number of rows of the factored matrix */ - Index rows() const { return m_L.rows(); } - - /** \returns number of columns of the factored matrix */ - Index cols() const { return m_L.cols(); } - - - /** \brief Reports whether previous computation was successful. - * - * It triggers an assertion if \c *this has not been initialized through the respective constructor, - * or a call to compute() or analyzePattern(). - * - * \returns \c Success if computation was successful, - * \c NumericalIssue if the matrix appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "IncompleteCholesky is not initialized."); - return m_info; - } - - /** \brief Set the initial shift parameter \f$ \sigma \f$. - */ - void setInitialShift(RealScalar shift) { m_initialShift = shift; } - - /** \brief Computes the fill reducing permutation vector using the sparsity pattern of \a mat - */ - template - void analyzePattern(const MatrixType& mat) - { - OrderingType ord; - PermutationType pinv; - ord(mat.template selfadjointView(), pinv); - if(pinv.size()>0) m_perm = pinv.inverse(); - else m_perm.resize(0); - m_L.resize(mat.rows(), mat.cols()); - m_analysisIsOk = true; - m_isInitialized = true; - m_info = Success; - } - - /** \brief Performs the numerical factorization of the input matrix \a mat - * - * The method analyzePattern() or compute() must have been called beforehand - * with a matrix having the same pattern. - * - * \sa compute(), analyzePattern() - */ - template - void factorize(const MatrixType& mat); - - /** Computes or re-computes the incomplete Cholesky factorization of the input matrix \a mat - * - * It is a shortcut for a sequential call to the analyzePattern() and factorize() methods. - * - * \sa analyzePattern(), factorize() - */ - template - void compute(const MatrixType& mat) - { - analyzePattern(mat); - factorize(mat); - } - - // internal - template - void _solve_impl(const Rhs& b, Dest& x) const - { - eigen_assert(m_factorizationIsOk && "factorize() should be called first"); - if (m_perm.rows() == b.rows()) x = m_perm * b; - else x = b; - x = m_scale.asDiagonal() * x; - x = m_L.template triangularView().solve(x); - x = m_L.adjoint().template triangularView().solve(x); - x = m_scale.asDiagonal() * x; - if (m_perm.rows() == b.rows()) - x = m_perm.inverse() * x; - } - - /** \returns the sparse lower triangular factor L */ - const FactorType& matrixL() const { eigen_assert("m_factorizationIsOk"); return m_L; } - - /** \returns a vector representing the scaling factor S */ - const VectorRx& scalingS() const { eigen_assert("m_factorizationIsOk"); return m_scale; } - - /** \returns the fill-in reducing permutation P (can be empty for a natural ordering) */ - const PermutationType& permutationP() const { eigen_assert("m_analysisIsOk"); return m_perm; } - - protected: - FactorType m_L; // The lower part stored in CSC - VectorRx m_scale; // The vector for scaling the matrix - RealScalar m_initialShift; // The initial shift parameter - bool m_analysisIsOk; - bool m_factorizationIsOk; - ComputationInfo m_info; - PermutationType m_perm; - - private: - inline void updateList(Ref colPtr, Ref rowIdx, Ref vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol); -}; - -// Based on the following paper: -// C-J. Lin and J. J. Mor̩, Incomplete Cholesky Factorizations with -// Limited memory, SIAM J. Sci. Comput. 21(1), pp. 24-45, 1999 -// http://ftp.mcs.anl.gov/pub/tech_reports/reports/P682.pdf -template -template -void IncompleteCholesky::factorize(const _MatrixType& mat) -{ - using std::sqrt; - eigen_assert(m_analysisIsOk && "analyzePattern() should be called first"); - - // Dropping strategy : Keep only the p largest elements per column, where p is the number of elements in the column of the original matrix. Other strategies will be added - - // Apply the fill-reducing permutation computed in analyzePattern() - if (m_perm.rows() == mat.rows() ) // To detect the null permutation - { - // The temporary is needed to make sure that the diagonal entry is properly sorted - FactorType tmp(mat.rows(), mat.cols()); - tmp = mat.template selfadjointView<_UpLo>().twistedBy(m_perm); - m_L.template selfadjointView() = tmp.template selfadjointView(); - } - else - { - m_L.template selfadjointView() = mat.template selfadjointView<_UpLo>(); - } - - Index n = m_L.cols(); - Index nnz = m_L.nonZeros(); - Map vals(m_L.valuePtr(), nnz); //values - Map rowIdx(m_L.innerIndexPtr(), nnz); //Row indices - Map colPtr( m_L.outerIndexPtr(), n+1); // Pointer to the beginning of each row - VectorIx firstElt(n-1); // for each j, points to the next entry in vals that will be used in the factorization - VectorList listCol(n); // listCol(j) is a linked list of columns to update column j - VectorSx col_vals(n); // Store a nonzero values in each column - VectorIx col_irow(n); // Row indices of nonzero elements in each column - VectorIx col_pattern(n); - col_pattern.fill(-1); - StorageIndex col_nnz; - - - // Computes the scaling factors - m_scale.resize(n); - m_scale.setZero(); - for (Index j = 0; j < n; j++) - for (Index k = colPtr[j]; k < colPtr[j+1]; k++) - { - m_scale(j) += numext::abs2(vals(k)); - if(rowIdx[k]!=j) - m_scale(rowIdx[k]) += numext::abs2(vals(k)); - } - - m_scale = m_scale.cwiseSqrt().cwiseSqrt(); - - for (Index j = 0; j < n; ++j) - if(m_scale(j)>(std::numeric_limits::min)()) - m_scale(j) = RealScalar(1)/m_scale(j); - else - m_scale(j) = 1; - - // TODO disable scaling if not needed, i.e., if it is roughly uniform? (this will make solve() faster) - - // Scale and compute the shift for the matrix - RealScalar mindiag = NumTraits::highest(); - for (Index j = 0; j < n; j++) - { - for (Index k = colPtr[j]; k < colPtr[j+1]; k++) - vals[k] *= (m_scale(j)*m_scale(rowIdx[k])); - eigen_internal_assert(rowIdx[colPtr[j]]==j && "IncompleteCholesky: only the lower triangular part must be stored"); - mindiag = numext::mini(numext::real(vals[colPtr[j]]), mindiag); - } - - FactorType L_save = m_L; - - RealScalar shift = 0; - if(mindiag <= RealScalar(0.)) - shift = m_initialShift - mindiag; - - m_info = NumericalIssue; - - // Try to perform the incomplete factorization using the current shift - int iter = 0; - do - { - // Apply the shift to the diagonal elements of the matrix - for (Index j = 0; j < n; j++) - vals[colPtr[j]] += shift; - - // jki version of the Cholesky factorization - Index j=0; - for (; j < n; ++j) - { - // Left-looking factorization of the j-th column - // First, load the j-th column into col_vals - Scalar diag = vals[colPtr[j]]; // It is assumed that only the lower part is stored - col_nnz = 0; - for (Index i = colPtr[j] + 1; i < colPtr[j+1]; i++) - { - StorageIndex l = rowIdx[i]; - col_vals(col_nnz) = vals[i]; - col_irow(col_nnz) = l; - col_pattern(l) = col_nnz; - col_nnz++; - } - { - typename std::list::iterator k; - // Browse all previous columns that will update column j - for(k = listCol[j].begin(); k != listCol[j].end(); k++) - { - Index jk = firstElt(*k); // First element to use in the column - eigen_internal_assert(rowIdx[jk]==j); - Scalar v_j_jk = numext::conj(vals[jk]); - - jk += 1; - for (Index i = jk; i < colPtr[*k+1]; i++) - { - StorageIndex l = rowIdx[i]; - if(col_pattern[l]<0) - { - col_vals(col_nnz) = vals[i] * v_j_jk; - col_irow[col_nnz] = l; - col_pattern(l) = col_nnz; - col_nnz++; - } - else - col_vals(col_pattern[l]) -= vals[i] * v_j_jk; - } - updateList(colPtr,rowIdx,vals, *k, jk, firstElt, listCol); - } - } - - // Scale the current column - if(numext::real(diag) <= 0) - { - if(++iter>=10) - return; - - // increase shift - shift = numext::maxi(m_initialShift,RealScalar(2)*shift); - // restore m_L, col_pattern, and listCol - vals = Map(L_save.valuePtr(), nnz); - rowIdx = Map(L_save.innerIndexPtr(), nnz); - colPtr = Map(L_save.outerIndexPtr(), n+1); - col_pattern.fill(-1); - for(Index i=0; i cvals = col_vals.head(col_nnz); - Ref cirow = col_irow.head(col_nnz); - internal::QuickSplit(cvals,cirow, p); - // Insert the largest p elements in the matrix - Index cpt = 0; - for (Index i = colPtr[j]+1; i < colPtr[j+1]; i++) - { - vals[i] = col_vals(cpt); - rowIdx[i] = col_irow(cpt); - // restore col_pattern: - col_pattern(col_irow(cpt)) = -1; - cpt++; - } - // Get the first smallest row index and put it after the diagonal element - Index jk = colPtr(j)+1; - updateList(colPtr,rowIdx,vals,j,jk,firstElt,listCol); - } - - if(j==n) - { - m_factorizationIsOk = true; - m_info = Success; - } - } while(m_info!=Success); -} - -template -inline void IncompleteCholesky::updateList(Ref colPtr, Ref rowIdx, Ref vals, const Index& col, const Index& jk, VectorIx& firstElt, VectorList& listCol) -{ - if (jk < colPtr(col+1) ) - { - Index p = colPtr(col+1) - jk; - Index minpos; - rowIdx.segment(jk,p).minCoeff(&minpos); - minpos += jk; - if (rowIdx(minpos) != rowIdx(jk)) - { - //Swap - std::swap(rowIdx(jk),rowIdx(minpos)); - std::swap(vals(jk),vals(minpos)); - } - firstElt(col) = internal::convert_index(jk); - listCol[rowIdx(jk)].push_back(internal::convert_index(col)); - } -} - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h deleted file mode 100644 index 338e6f10a..000000000 --- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h +++ /dev/null @@ -1,462 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// Copyright (C) 2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_INCOMPLETE_LUT_H -#define EIGEN_INCOMPLETE_LUT_H - - -namespace Eigen { - -namespace internal { - -/** \internal - * Compute a quick-sort split of a vector - * On output, the vector row is permuted such that its elements satisfy - * abs(row(i)) >= abs(row(ncut)) if incut - * \param row The vector of values - * \param ind The array of index for the elements in @p row - * \param ncut The number of largest elements to keep - **/ -template -Index QuickSplit(VectorV &row, VectorI &ind, Index ncut) -{ - typedef typename VectorV::RealScalar RealScalar; - using std::swap; - using std::abs; - Index mid; - Index n = row.size(); /* length of the vector */ - Index first, last ; - - ncut--; /* to fit the zero-based indices */ - first = 0; - last = n-1; - if (ncut < first || ncut > last ) return 0; - - do { - mid = first; - RealScalar abskey = abs(row(mid)); - for (Index j = first + 1; j <= last; j++) { - if ( abs(row(j)) > abskey) { - ++mid; - swap(row(mid), row(j)); - swap(ind(mid), ind(j)); - } - } - /* Interchange for the pivot element */ - swap(row(mid), row(first)); - swap(ind(mid), ind(first)); - - if (mid > ncut) last = mid - 1; - else if (mid < ncut ) first = mid + 1; - } while (mid != ncut ); - - return 0; /* mid is equal to ncut */ -} - -}// end namespace internal - -/** \ingroup IterativeLinearSolvers_Module - * \class IncompleteLUT - * \brief Incomplete LU factorization with dual-threshold strategy - * - * \implsparsesolverconcept - * - * During the numerical factorization, two dropping rules are used : - * 1) any element whose magnitude is less than some tolerance is dropped. - * This tolerance is obtained by multiplying the input tolerance @p droptol - * by the average magnitude of all the original elements in the current row. - * 2) After the elimination of the row, only the @p fill largest elements in - * the L part and the @p fill largest elements in the U part are kept - * (in addition to the diagonal element ). Note that @p fill is computed from - * the input parameter @p fillfactor which is used the ratio to control the fill_in - * relatively to the initial number of nonzero elements. - * - * The two extreme cases are when @p droptol=0 (to keep all the @p fill*2 largest elements) - * and when @p fill=n/2 with @p droptol being different to zero. - * - * References : Yousef Saad, ILUT: A dual threshold incomplete LU factorization, - * Numerical Linear Algebra with Applications, 1(4), pp 387-402, 1994. - * - * NOTE : The following implementation is derived from the ILUT implementation - * in the SPARSKIT package, Copyright (C) 2005, the Regents of the University of Minnesota - * released under the terms of the GNU LGPL: - * http://www-users.cs.umn.edu/~saad/software/SPARSKIT/README - * However, Yousef Saad gave us permission to relicense his ILUT code to MPL2. - * See the Eigen mailing list archive, thread: ILUT, date: July 8, 2012: - * http://listengine.tuxfamily.org/lists.tuxfamily.org/eigen/2012/07/msg00064.html - * alternatively, on GMANE: - * http://comments.gmane.org/gmane.comp.lib.eigen/3302 - */ -template -class IncompleteLUT : public SparseSolverBase > -{ - protected: - typedef SparseSolverBase Base; - using Base::m_isInitialized; - public: - typedef _Scalar Scalar; - typedef _StorageIndex StorageIndex; - typedef typename NumTraits::Real RealScalar; - typedef Matrix Vector; - typedef Matrix VectorI; - typedef SparseMatrix FactorType; - - enum { - ColsAtCompileTime = Dynamic, - MaxColsAtCompileTime = Dynamic - }; - - public: - - IncompleteLUT() - : m_droptol(NumTraits::dummy_precision()), m_fillfactor(10), - m_analysisIsOk(false), m_factorizationIsOk(false) - {} - - template - explicit IncompleteLUT(const MatrixType& mat, const RealScalar& droptol=NumTraits::dummy_precision(), int fillfactor = 10) - : m_droptol(droptol),m_fillfactor(fillfactor), - m_analysisIsOk(false),m_factorizationIsOk(false) - { - eigen_assert(fillfactor != 0); - compute(mat); - } - - Index rows() const { return m_lu.rows(); } - - Index cols() const { return m_lu.cols(); } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the matrix.appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "IncompleteLUT is not initialized."); - return m_info; - } - - template - void analyzePattern(const MatrixType& amat); - - template - void factorize(const MatrixType& amat); - - /** - * Compute an incomplete LU factorization with dual threshold on the matrix mat - * No pivoting is done in this version - * - **/ - template - IncompleteLUT& compute(const MatrixType& amat) - { - analyzePattern(amat); - factorize(amat); - return *this; - } - - void setDroptol(const RealScalar& droptol); - void setFillfactor(int fillfactor); - - template - void _solve_impl(const Rhs& b, Dest& x) const - { - x = m_Pinv * b; - x = m_lu.template triangularView().solve(x); - x = m_lu.template triangularView().solve(x); - x = m_P * x; - } - -protected: - - /** keeps off-diagonal entries; drops diagonal entries */ - struct keep_diag { - inline bool operator() (const Index& row, const Index& col, const Scalar&) const - { - return row!=col; - } - }; - -protected: - - FactorType m_lu; - RealScalar m_droptol; - int m_fillfactor; - bool m_analysisIsOk; - bool m_factorizationIsOk; - ComputationInfo m_info; - PermutationMatrix m_P; // Fill-reducing permutation - PermutationMatrix m_Pinv; // Inverse permutation -}; - -/** - * Set control parameter droptol - * \param droptol Drop any element whose magnitude is less than this tolerance - **/ -template -void IncompleteLUT::setDroptol(const RealScalar& droptol) -{ - this->m_droptol = droptol; -} - -/** - * Set control parameter fillfactor - * \param fillfactor This is used to compute the number @p fill_in of largest elements to keep on each row. - **/ -template -void IncompleteLUT::setFillfactor(int fillfactor) -{ - this->m_fillfactor = fillfactor; -} - -template -template -void IncompleteLUT::analyzePattern(const _MatrixType& amat) -{ - // Compute the Fill-reducing permutation - // Since ILUT does not perform any numerical pivoting, - // it is highly preferable to keep the diagonal through symmetric permutations. -#ifndef EIGEN_MPL2_ONLY - // To this end, let's symmetrize the pattern and perform AMD on it. - SparseMatrix mat1 = amat; - SparseMatrix mat2 = amat.transpose(); - // FIXME for a matrix with nearly symmetric pattern, mat2+mat1 is the appropriate choice. - // on the other hand for a really non-symmetric pattern, mat2*mat1 should be prefered... - SparseMatrix AtA = mat2 + mat1; - AMDOrdering ordering; - ordering(AtA,m_P); - m_Pinv = m_P.inverse(); // cache the inverse permutation -#else - // If AMD is not available, (MPL2-only), then let's use the slower COLAMD routine. - SparseMatrix mat1 = amat; - COLAMDOrdering ordering; - ordering(mat1,m_Pinv); - m_P = m_Pinv.inverse(); -#endif - - m_analysisIsOk = true; - m_factorizationIsOk = false; - m_isInitialized = true; -} - -template -template -void IncompleteLUT::factorize(const _MatrixType& amat) -{ - using std::sqrt; - using std::swap; - using std::abs; - using internal::convert_index; - - eigen_assert((amat.rows() == amat.cols()) && "The factorization should be done on a square matrix"); - Index n = amat.cols(); // Size of the matrix - m_lu.resize(n,n); - // Declare Working vectors and variables - Vector u(n) ; // real values of the row -- maximum size is n -- - VectorI ju(n); // column position of the values in u -- maximum size is n - VectorI jr(n); // Indicate the position of the nonzero elements in the vector u -- A zero location is indicated by -1 - - // Apply the fill-reducing permutation - eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); - SparseMatrix mat; - mat = amat.twistedBy(m_Pinv); - - // Initialization - jr.fill(-1); - ju.fill(0); - u.fill(0); - - // number of largest elements to keep in each row: - Index fill_in = (amat.nonZeros()*m_fillfactor)/n + 1; - if (fill_in > n) fill_in = n; - - // number of largest nonzero elements to keep in the L and the U part of the current row: - Index nnzL = fill_in/2; - Index nnzU = nnzL; - m_lu.reserve(n * (nnzL + nnzU + 1)); - - // global loop over the rows of the sparse matrix - for (Index ii = 0; ii < n; ii++) - { - // 1 - copy the lower and the upper part of the row i of mat in the working vector u - - Index sizeu = 1; // number of nonzero elements in the upper part of the current row - Index sizel = 0; // number of nonzero elements in the lower part of the current row - ju(ii) = convert_index(ii); - u(ii) = 0; - jr(ii) = convert_index(ii); - RealScalar rownorm = 0; - - typename FactorType::InnerIterator j_it(mat, ii); // Iterate through the current row ii - for (; j_it; ++j_it) - { - Index k = j_it.index(); - if (k < ii) - { - // copy the lower part - ju(sizel) = convert_index(k); - u(sizel) = j_it.value(); - jr(k) = convert_index(sizel); - ++sizel; - } - else if (k == ii) - { - u(ii) = j_it.value(); - } - else - { - // copy the upper part - Index jpos = ii + sizeu; - ju(jpos) = convert_index(k); - u(jpos) = j_it.value(); - jr(k) = convert_index(jpos); - ++sizeu; - } - rownorm += numext::abs2(j_it.value()); - } - - // 2 - detect possible zero row - if(rownorm==0) - { - m_info = NumericalIssue; - return; - } - // Take the 2-norm of the current row as a relative tolerance - rownorm = sqrt(rownorm); - - // 3 - eliminate the previous nonzero rows - Index jj = 0; - Index len = 0; - while (jj < sizel) - { - // In order to eliminate in the correct order, - // we must select first the smallest column index among ju(jj:sizel) - Index k; - Index minrow = ju.segment(jj,sizel-jj).minCoeff(&k); // k is relative to the segment - k += jj; - if (minrow != ju(jj)) - { - // swap the two locations - Index j = ju(jj); - swap(ju(jj), ju(k)); - jr(minrow) = convert_index(jj); - jr(j) = convert_index(k); - swap(u(jj), u(k)); - } - // Reset this location - jr(minrow) = -1; - - // Start elimination - typename FactorType::InnerIterator ki_it(m_lu, minrow); - while (ki_it && ki_it.index() < minrow) ++ki_it; - eigen_internal_assert(ki_it && ki_it.col()==minrow); - Scalar fact = u(jj) / ki_it.value(); - - // drop too small elements - if(abs(fact) <= m_droptol) - { - jj++; - continue; - } - - // linear combination of the current row ii and the row minrow - ++ki_it; - for (; ki_it; ++ki_it) - { - Scalar prod = fact * ki_it.value(); - Index j = ki_it.index(); - Index jpos = jr(j); - if (jpos == -1) // fill-in element - { - Index newpos; - if (j >= ii) // dealing with the upper part - { - newpos = ii + sizeu; - sizeu++; - eigen_internal_assert(sizeu<=n); - } - else // dealing with the lower part - { - newpos = sizel; - sizel++; - eigen_internal_assert(sizel<=ii); - } - ju(newpos) = convert_index(j); - u(newpos) = -prod; - jr(j) = convert_index(newpos); - } - else - u(jpos) -= prod; - } - // store the pivot element - u(len) = fact; - ju(len) = convert_index(minrow); - ++len; - - jj++; - } // end of the elimination on the row ii - - // reset the upper part of the pointer jr to zero - for(Index k = 0; k m_droptol * rownorm ) - { - ++len; - u(ii + len) = u(ii + k); - ju(ii + len) = ju(ii + k); - } - } - sizeu = len + 1; // +1 to take into account the diagonal element - len = (std::min)(sizeu, nnzU); - typename Vector::SegmentReturnType uu(u.segment(ii+1, sizeu-1)); - typename VectorI::SegmentReturnType juu(ju.segment(ii+1, sizeu-1)); - internal::QuickSplit(uu, juu, len); - - // store the largest elements of the U part - for(Index k = ii + 1; k < ii + len; k++) - m_lu.insertBackByOuterInnerUnordered(ii,ju(k)) = u(k); - } - m_lu.finalize(); - m_lu.makeCompressed(); - - m_factorizationIsOk = true; - m_info = Success; -} - -} // end namespace Eigen - -#endif // EIGEN_INCOMPLETE_LUT_H diff --git a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h b/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h deleted file mode 100644 index 7c2326eb7..000000000 --- a/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h +++ /dev/null @@ -1,394 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2011-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ITERATIVE_SOLVER_BASE_H -#define EIGEN_ITERATIVE_SOLVER_BASE_H - -namespace Eigen { - -namespace internal { - -template -struct is_ref_compatible_impl -{ -private: - template - struct any_conversion - { - template any_conversion(const volatile T&); - template any_conversion(T&); - }; - struct yes {int a[1];}; - struct no {int a[2];}; - - template - static yes test(const Ref&, int); - template - static no test(any_conversion, ...); - -public: - static MatrixType ms_from; - enum { value = sizeof(test(ms_from, 0))==sizeof(yes) }; -}; - -template -struct is_ref_compatible -{ - enum { value = is_ref_compatible_impl::type>::value }; -}; - -template::value> -class generic_matrix_wrapper; - -// We have an explicit matrix at hand, compatible with Ref<> -template -class generic_matrix_wrapper -{ -public: - typedef Ref ActualMatrixType; - template struct ConstSelfAdjointViewReturnType { - typedef typename ActualMatrixType::template ConstSelfAdjointViewReturnType::Type Type; - }; - - enum { - MatrixFree = false - }; - - generic_matrix_wrapper() - : m_dummy(0,0), m_matrix(m_dummy) - {} - - template - generic_matrix_wrapper(const InputType &mat) - : m_matrix(mat) - {} - - const ActualMatrixType& matrix() const - { - return m_matrix; - } - - template - void grab(const EigenBase &mat) - { - m_matrix.~Ref(); - ::new (&m_matrix) Ref(mat.derived()); - } - - void grab(const Ref &mat) - { - if(&(mat.derived()) != &m_matrix) - { - m_matrix.~Ref(); - ::new (&m_matrix) Ref(mat); - } - } - -protected: - MatrixType m_dummy; // used to default initialize the Ref<> object - ActualMatrixType m_matrix; -}; - -// MatrixType is not compatible with Ref<> -> matrix-free wrapper -template -class generic_matrix_wrapper -{ -public: - typedef MatrixType ActualMatrixType; - template struct ConstSelfAdjointViewReturnType - { - typedef ActualMatrixType Type; - }; - - enum { - MatrixFree = true - }; - - generic_matrix_wrapper() - : mp_matrix(0) - {} - - generic_matrix_wrapper(const MatrixType &mat) - : mp_matrix(&mat) - {} - - const ActualMatrixType& matrix() const - { - return *mp_matrix; - } - - void grab(const MatrixType &mat) - { - mp_matrix = &mat; - } - -protected: - const ActualMatrixType *mp_matrix; -}; - -} - -/** \ingroup IterativeLinearSolvers_Module - * \brief Base class for linear iterative solvers - * - * \sa class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner - */ -template< typename Derived> -class IterativeSolverBase : public SparseSolverBase -{ -protected: - typedef SparseSolverBase Base; - using Base::m_isInitialized; - -public: - typedef typename internal::traits::MatrixType MatrixType; - typedef typename internal::traits::Preconditioner Preconditioner; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef typename MatrixType::RealScalar RealScalar; - - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - -public: - - using Base::derived; - - /** Default constructor. */ - IterativeSolverBase() - { - init(); - } - - /** Initialize the solver with matrix \a A for further \c Ax=b solving. - * - * This constructor is a shortcut for the default constructor followed - * by a call to compute(). - * - * \warning this class stores a reference to the matrix A as well as some - * precomputed values that depend on it. Therefore, if \a A is changed - * this class becomes invalid. Call compute() to update it with the new - * matrix A, or modify a copy of A. - */ - template - explicit IterativeSolverBase(const EigenBase& A) - : m_matrixWrapper(A.derived()) - { - init(); - compute(matrix()); - } - - ~IterativeSolverBase() {} - - /** Initializes the iterative solver for the sparsity pattern of the matrix \a A for further solving \c Ax=b problems. - * - * Currently, this function mostly calls analyzePattern on the preconditioner. In the future - * we might, for instance, implement column reordering for faster matrix vector products. - */ - template - Derived& analyzePattern(const EigenBase& A) - { - grab(A.derived()); - m_preconditioner.analyzePattern(matrix()); - m_isInitialized = true; - m_analysisIsOk = true; - m_info = m_preconditioner.info(); - return derived(); - } - - /** Initializes the iterative solver with the numerical values of the matrix \a A for further solving \c Ax=b problems. - * - * Currently, this function mostly calls factorize on the preconditioner. - * - * \warning this class stores a reference to the matrix A as well as some - * precomputed values that depend on it. Therefore, if \a A is changed - * this class becomes invalid. Call compute() to update it with the new - * matrix A, or modify a copy of A. - */ - template - Derived& factorize(const EigenBase& A) - { - eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); - grab(A.derived()); - m_preconditioner.factorize(matrix()); - m_factorizationIsOk = true; - m_info = m_preconditioner.info(); - return derived(); - } - - /** Initializes the iterative solver with the matrix \a A for further solving \c Ax=b problems. - * - * Currently, this function mostly initializes/computes the preconditioner. In the future - * we might, for instance, implement column reordering for faster matrix vector products. - * - * \warning this class stores a reference to the matrix A as well as some - * precomputed values that depend on it. Therefore, if \a A is changed - * this class becomes invalid. Call compute() to update it with the new - * matrix A, or modify a copy of A. - */ - template - Derived& compute(const EigenBase& A) - { - grab(A.derived()); - m_preconditioner.compute(matrix()); - m_isInitialized = true; - m_analysisIsOk = true; - m_factorizationIsOk = true; - m_info = m_preconditioner.info(); - return derived(); - } - - /** \internal */ - Index rows() const { return matrix().rows(); } - - /** \internal */ - Index cols() const { return matrix().cols(); } - - /** \returns the tolerance threshold used by the stopping criteria. - * \sa setTolerance() - */ - RealScalar tolerance() const { return m_tolerance; } - - /** Sets the tolerance threshold used by the stopping criteria. - * - * This value is used as an upper bound to the relative residual error: |Ax-b|/|b|. - * The default value is the machine precision given by NumTraits::epsilon() - */ - Derived& setTolerance(const RealScalar& tolerance) - { - m_tolerance = tolerance; - return derived(); - } - - /** \returns a read-write reference to the preconditioner for custom configuration. */ - Preconditioner& preconditioner() { return m_preconditioner; } - - /** \returns a read-only reference to the preconditioner. */ - const Preconditioner& preconditioner() const { return m_preconditioner; } - - /** \returns the max number of iterations. - * It is either the value setted by setMaxIterations or, by default, - * twice the number of columns of the matrix. - */ - Index maxIterations() const - { - return (m_maxIterations<0) ? 2*matrix().cols() : m_maxIterations; - } - - /** Sets the max number of iterations. - * Default is twice the number of columns of the matrix. - */ - Derived& setMaxIterations(Index maxIters) - { - m_maxIterations = maxIters; - return derived(); - } - - /** \returns the number of iterations performed during the last solve */ - Index iterations() const - { - eigen_assert(m_isInitialized && "ConjugateGradient is not initialized."); - return m_iterations; - } - - /** \returns the tolerance error reached during the last solve. - * It is a close approximation of the true relative residual error |Ax-b|/|b|. - */ - RealScalar error() const - { - eigen_assert(m_isInitialized && "ConjugateGradient is not initialized."); - return m_error; - } - - /** \returns the solution x of \f$ A x = b \f$ using the current decomposition of A - * and \a x0 as an initial solution. - * - * \sa solve(), compute() - */ - template - inline const SolveWithGuess - solveWithGuess(const MatrixBase& b, const Guess& x0) const - { - eigen_assert(m_isInitialized && "Solver is not initialized."); - eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b"); - return SolveWithGuess(derived(), b.derived(), x0); - } - - /** \returns Success if the iterations converged, and NoConvergence otherwise. */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "IterativeSolverBase is not initialized."); - return m_info; - } - - /** \internal */ - template - void _solve_impl(const Rhs& b, SparseMatrixBase &aDest) const - { - eigen_assert(rows()==b.rows()); - - Index rhsCols = b.cols(); - Index size = b.rows(); - DestDerived& dest(aDest.derived()); - typedef typename DestDerived::Scalar DestScalar; - Eigen::Matrix tb(size); - Eigen::Matrix tx(cols()); - // We do not directly fill dest because sparse expressions have to be free of aliasing issue. - // For non square least-square problems, b and dest might not have the same size whereas they might alias each-other. - typename DestDerived::PlainObject tmp(cols(),rhsCols); - for(Index k=0; k::epsilon(); - } - - typedef internal::generic_matrix_wrapper MatrixWrapper; - typedef typename MatrixWrapper::ActualMatrixType ActualMatrixType; - - const ActualMatrixType& matrix() const - { - return m_matrixWrapper.matrix(); - } - - template - void grab(const InputType &A) - { - m_matrixWrapper.grab(A); - } - - MatrixWrapper m_matrixWrapper; - Preconditioner m_preconditioner; - - Index m_maxIterations; - RealScalar m_tolerance; - - mutable RealScalar m_error; - mutable Index m_iterations; - mutable ComputationInfo m_info; - mutable bool m_analysisIsOk, m_factorizationIsOk; -}; - -} // end namespace Eigen - -#endif // EIGEN_ITERATIVE_SOLVER_BASE_H diff --git a/Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h b/Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h deleted file mode 100644 index 0aea0e099..000000000 --- a/Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h +++ /dev/null @@ -1,216 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_LEAST_SQUARE_CONJUGATE_GRADIENT_H -#define EIGEN_LEAST_SQUARE_CONJUGATE_GRADIENT_H - -namespace Eigen { - -namespace internal { - -/** \internal Low-level conjugate gradient algorithm for least-square problems - * \param mat The matrix A - * \param rhs The right hand side vector b - * \param x On input and initial solution, on output the computed solution. - * \param precond A preconditioner being able to efficiently solve for an - * approximation of A'Ax=b (regardless of b) - * \param iters On input the max number of iteration, on output the number of performed iterations. - * \param tol_error On input the tolerance error, on output an estimation of the relative error. - */ -template -EIGEN_DONT_INLINE -void least_square_conjugate_gradient(const MatrixType& mat, const Rhs& rhs, Dest& x, - const Preconditioner& precond, Index& iters, - typename Dest::RealScalar& tol_error) -{ - using std::sqrt; - using std::abs; - typedef typename Dest::RealScalar RealScalar; - typedef typename Dest::Scalar Scalar; - typedef Matrix VectorType; - - RealScalar tol = tol_error; - Index maxIters = iters; - - Index m = mat.rows(), n = mat.cols(); - - VectorType residual = rhs - mat * x; - VectorType normal_residual = mat.adjoint() * residual; - - RealScalar rhsNorm2 = (mat.adjoint()*rhs).squaredNorm(); - if(rhsNorm2 == 0) - { - x.setZero(); - iters = 0; - tol_error = 0; - return; - } - RealScalar threshold = tol*tol*rhsNorm2; - RealScalar residualNorm2 = normal_residual.squaredNorm(); - if (residualNorm2 < threshold) - { - iters = 0; - tol_error = sqrt(residualNorm2 / rhsNorm2); - return; - } - - VectorType p(n); - p = precond.solve(normal_residual); // initial search direction - - VectorType z(n), tmp(m); - RealScalar absNew = numext::real(normal_residual.dot(p)); // the square of the absolute value of r scaled by invM - Index i = 0; - while(i < maxIters) - { - tmp.noalias() = mat * p; - - Scalar alpha = absNew / tmp.squaredNorm(); // the amount we travel on dir - x += alpha * p; // update solution - residual -= alpha * tmp; // update residual - normal_residual = mat.adjoint() * residual; // update residual of the normal equation - - residualNorm2 = normal_residual.squaredNorm(); - if(residualNorm2 < threshold) - break; - - z = precond.solve(normal_residual); // approximately solve for "A'A z = normal_residual" - - RealScalar absOld = absNew; - absNew = numext::real(normal_residual.dot(z)); // update the absolute value of r - RealScalar beta = absNew / absOld; // calculate the Gram-Schmidt value used to create the new search direction - p = z + beta * p; // update search direction - i++; - } - tol_error = sqrt(residualNorm2 / rhsNorm2); - iters = i; -} - -} - -template< typename _MatrixType, - typename _Preconditioner = LeastSquareDiagonalPreconditioner > -class LeastSquaresConjugateGradient; - -namespace internal { - -template< typename _MatrixType, typename _Preconditioner> -struct traits > -{ - typedef _MatrixType MatrixType; - typedef _Preconditioner Preconditioner; -}; - -} - -/** \ingroup IterativeLinearSolvers_Module - * \brief A conjugate gradient solver for sparse (or dense) least-square problems - * - * This class allows to solve for A x = b linear problems using an iterative conjugate gradient algorithm. - * The matrix A can be non symmetric and rectangular, but the matrix A' A should be positive-definite to guaranty stability. - * Otherwise, the SparseLU or SparseQR classes might be preferable. - * The matrix A and the vectors x and b can be either dense or sparse. - * - * \tparam _MatrixType the type of the matrix A, can be a dense or a sparse matrix. - * \tparam _Preconditioner the type of the preconditioner. Default is LeastSquareDiagonalPreconditioner - * - * \implsparsesolverconcept - * - * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations() - * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations - * and NumTraits::epsilon() for the tolerance. - * - * This class can be used as the direct solver classes. Here is a typical usage example: - \code - int m=1000000, n = 10000; - VectorXd x(n), b(m); - SparseMatrix A(m,n); - // fill A and b - LeastSquaresConjugateGradient > lscg; - lscg.compute(A); - x = lscg.solve(b); - std::cout << "#iterations: " << lscg.iterations() << std::endl; - std::cout << "estimated error: " << lscg.error() << std::endl; - // update b, and solve again - x = lscg.solve(b); - \endcode - * - * By default the iterations start with x=0 as an initial guess of the solution. - * One can control the start using the solveWithGuess() method. - * - * \sa class ConjugateGradient, SparseLU, SparseQR - */ -template< typename _MatrixType, typename _Preconditioner> -class LeastSquaresConjugateGradient : public IterativeSolverBase > -{ - typedef IterativeSolverBase Base; - using Base::matrix; - using Base::m_error; - using Base::m_iterations; - using Base::m_info; - using Base::m_isInitialized; -public: - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef _Preconditioner Preconditioner; - -public: - - /** Default constructor. */ - LeastSquaresConjugateGradient() : Base() {} - - /** Initialize the solver with matrix \a A for further \c Ax=b solving. - * - * This constructor is a shortcut for the default constructor followed - * by a call to compute(). - * - * \warning this class stores a reference to the matrix A as well as some - * precomputed values that depend on it. Therefore, if \a A is changed - * this class becomes invalid. Call compute() to update it with the new - * matrix A, or modify a copy of A. - */ - template - explicit LeastSquaresConjugateGradient(const EigenBase& A) : Base(A.derived()) {} - - ~LeastSquaresConjugateGradient() {} - - /** \internal */ - template - void _solve_with_guess_impl(const Rhs& b, Dest& x) const - { - m_iterations = Base::maxIterations(); - m_error = Base::m_tolerance; - - for(Index j=0; j - void _solve_impl(const MatrixBase& b, Dest& x) const - { - x.setZero(); - _solve_with_guess_impl(b.derived(),x); - } - -}; - -} // end namespace Eigen - -#endif // EIGEN_LEAST_SQUARE_CONJUGATE_GRADIENT_H diff --git a/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h b/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h deleted file mode 100644 index 0ace45177..000000000 --- a/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h +++ /dev/null @@ -1,115 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SOLVEWITHGUESS_H -#define EIGEN_SOLVEWITHGUESS_H - -namespace Eigen { - -template class SolveWithGuess; - -/** \class SolveWithGuess - * \ingroup IterativeLinearSolvers_Module - * - * \brief Pseudo expression representing a solving operation - * - * \tparam Decomposition the type of the matrix or decomposion object - * \tparam Rhstype the type of the right-hand side - * - * This class represents an expression of A.solve(B) - * and most of the time this is the only way it is used. - * - */ -namespace internal { - - -template -struct traits > - : traits > -{}; - -} - - -template -class SolveWithGuess : public internal::generic_xpr_base, MatrixXpr, typename internal::traits::StorageKind>::type -{ -public: - typedef typename internal::traits::Scalar Scalar; - typedef typename internal::traits::PlainObject PlainObject; - typedef typename internal::generic_xpr_base, MatrixXpr, typename internal::traits::StorageKind>::type Base; - typedef typename internal::ref_selector::type Nested; - - SolveWithGuess(const Decomposition &dec, const RhsType &rhs, const GuessType &guess) - : m_dec(dec), m_rhs(rhs), m_guess(guess) - {} - - EIGEN_DEVICE_FUNC Index rows() const { return m_dec.cols(); } - EIGEN_DEVICE_FUNC Index cols() const { return m_rhs.cols(); } - - EIGEN_DEVICE_FUNC const Decomposition& dec() const { return m_dec; } - EIGEN_DEVICE_FUNC const RhsType& rhs() const { return m_rhs; } - EIGEN_DEVICE_FUNC const GuessType& guess() const { return m_guess; } - -protected: - const Decomposition &m_dec; - const RhsType &m_rhs; - const GuessType &m_guess; - -private: - Scalar coeff(Index row, Index col) const; - Scalar coeff(Index i) const; -}; - -namespace internal { - -// Evaluator of SolveWithGuess -> eval into a temporary -template -struct evaluator > - : public evaluator::PlainObject> -{ - typedef SolveWithGuess SolveType; - typedef typename SolveType::PlainObject PlainObject; - typedef evaluator Base; - - evaluator(const SolveType& solve) - : m_result(solve.rows(), solve.cols()) - { - ::new (static_cast(this)) Base(m_result); - m_result = solve.guess(); - solve.dec()._solve_with_guess_impl(solve.rhs(), m_result); - } - -protected: - PlainObject m_result; -}; - -// Specialization for "dst = dec.solveWithGuess(rhs)" -// NOTE we need to specialize it for Dense2Dense to avoid ambiguous specialization error and a Sparse2Sparse specialization must exist somewhere -template -struct Assignment, internal::assign_op, Dense2Dense> -{ - typedef SolveWithGuess SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - dst = src.guess(); - src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/); - } -}; - -} // end namepsace internal - -} // end namespace Eigen - -#endif // EIGEN_SOLVEWITHGUESS_H diff --git a/Eigen/src/Jacobi/Jacobi.h b/Eigen/src/Jacobi/Jacobi.h deleted file mode 100644 index af1228cb8..000000000 --- a/Eigen/src/Jacobi/Jacobi.h +++ /dev/null @@ -1,474 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Benoit Jacob -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_JACOBI_H -#define EIGEN_JACOBI_H - -namespace Eigen { - -/** \ingroup Jacobi_Module - * \jacobi_module - * \class JacobiRotation - * \brief Rotation given by a cosine-sine pair. - * - * This class represents a Jacobi or Givens rotation. - * This is a 2D rotation in the plane \c J of angle \f$ \theta \f$ defined by - * its cosine \c c and sine \c s as follow: - * \f$ J = \left ( \begin{array}{cc} c & \overline s \\ -s & \overline c \end{array} \right ) \f$ - * - * You can apply the respective counter-clockwise rotation to a column vector \c v by - * applying its adjoint on the left: \f$ v = J^* v \f$ that translates to the following Eigen code: - * \code - * v.applyOnTheLeft(J.adjoint()); - * \endcode - * - * \sa MatrixBase::applyOnTheLeft(), MatrixBase::applyOnTheRight() - */ -template class JacobiRotation -{ - public: - typedef typename NumTraits::Real RealScalar; - - /** Default constructor without any initialization. */ - EIGEN_DEVICE_FUNC - JacobiRotation() {} - - /** Construct a planar rotation from a cosine-sine pair (\a c, \c s). */ - EIGEN_DEVICE_FUNC - JacobiRotation(const Scalar& c, const Scalar& s) : m_c(c), m_s(s) {} - - EIGEN_DEVICE_FUNC Scalar& c() { return m_c; } - EIGEN_DEVICE_FUNC Scalar c() const { return m_c; } - EIGEN_DEVICE_FUNC Scalar& s() { return m_s; } - EIGEN_DEVICE_FUNC Scalar s() const { return m_s; } - - /** Concatenates two planar rotation */ - EIGEN_DEVICE_FUNC - JacobiRotation operator*(const JacobiRotation& other) - { - using numext::conj; - return JacobiRotation(m_c * other.m_c - conj(m_s) * other.m_s, - conj(m_c * conj(other.m_s) + conj(m_s) * conj(other.m_c))); - } - - /** Returns the transposed transformation */ - EIGEN_DEVICE_FUNC - JacobiRotation transpose() const { using numext::conj; return JacobiRotation(m_c, -conj(m_s)); } - - /** Returns the adjoint transformation */ - EIGEN_DEVICE_FUNC - JacobiRotation adjoint() const { using numext::conj; return JacobiRotation(conj(m_c), -m_s); } - - template - EIGEN_DEVICE_FUNC - bool makeJacobi(const MatrixBase&, Index p, Index q); - EIGEN_DEVICE_FUNC - bool makeJacobi(const RealScalar& x, const Scalar& y, const RealScalar& z); - - EIGEN_DEVICE_FUNC - void makeGivens(const Scalar& p, const Scalar& q, Scalar* z=0); - - protected: - EIGEN_DEVICE_FUNC - void makeGivens(const Scalar& p, const Scalar& q, Scalar* z, internal::true_type); - EIGEN_DEVICE_FUNC - void makeGivens(const Scalar& p, const Scalar& q, Scalar* z, internal::false_type); - - Scalar m_c, m_s; -}; - -/** Makes \c *this as a Jacobi rotation \a J such that applying \a J on both the right and left sides of the selfadjoint 2x2 matrix - * \f$ B = \left ( \begin{array}{cc} x & y \\ \overline y & z \end{array} \right )\f$ yields a diagonal matrix \f$ A = J^* B J \f$ - * - * \sa MatrixBase::makeJacobi(const MatrixBase&, Index, Index), MatrixBase::applyOnTheLeft(), MatrixBase::applyOnTheRight() - */ -template -bool JacobiRotation::makeJacobi(const RealScalar& x, const Scalar& y, const RealScalar& z) -{ - using std::sqrt; - using std::abs; - typedef typename NumTraits::Real RealScalar; - RealScalar deno = RealScalar(2)*abs(y); - if(deno < (std::numeric_limits::min)()) - { - m_c = Scalar(1); - m_s = Scalar(0); - return false; - } - else - { - RealScalar tau = (x-z)/deno; - RealScalar w = sqrt(numext::abs2(tau) + RealScalar(1)); - RealScalar t; - if(tau>RealScalar(0)) - { - t = RealScalar(1) / (tau + w); - } - else - { - t = RealScalar(1) / (tau - w); - } - RealScalar sign_t = t > RealScalar(0) ? RealScalar(1) : RealScalar(-1); - RealScalar n = RealScalar(1) / sqrt(numext::abs2(t)+RealScalar(1)); - m_s = - sign_t * (numext::conj(y) / abs(y)) * abs(t) * n; - m_c = n; - return true; - } -} - -/** Makes \c *this as a Jacobi rotation \c J such that applying \a J on both the right and left sides of the 2x2 selfadjoint matrix - * \f$ B = \left ( \begin{array}{cc} \text{this}_{pp} & \text{this}_{pq} \\ (\text{this}_{pq})^* & \text{this}_{qq} \end{array} \right )\f$ yields - * a diagonal matrix \f$ A = J^* B J \f$ - * - * Example: \include Jacobi_makeJacobi.cpp - * Output: \verbinclude Jacobi_makeJacobi.out - * - * \sa JacobiRotation::makeJacobi(RealScalar, Scalar, RealScalar), MatrixBase::applyOnTheLeft(), MatrixBase::applyOnTheRight() - */ -template -template -inline bool JacobiRotation::makeJacobi(const MatrixBase& m, Index p, Index q) -{ - return makeJacobi(numext::real(m.coeff(p,p)), m.coeff(p,q), numext::real(m.coeff(q,q))); -} - -/** Makes \c *this as a Givens rotation \c G such that applying \f$ G^* \f$ to the left of the vector - * \f$ V = \left ( \begin{array}{c} p \\ q \end{array} \right )\f$ yields: - * \f$ G^* V = \left ( \begin{array}{c} r \\ 0 \end{array} \right )\f$. - * - * The value of \a z is returned if \a z is not null (the default is null). - * Also note that G is built such that the cosine is always real. - * - * Example: \include Jacobi_makeGivens.cpp - * Output: \verbinclude Jacobi_makeGivens.out - * - * This function implements the continuous Givens rotation generation algorithm - * found in Anderson (2000), Discontinuous Plane Rotations and the Symmetric Eigenvalue Problem. - * LAPACK Working Note 150, University of Tennessee, UT-CS-00-454, December 4, 2000. - * - * \sa MatrixBase::applyOnTheLeft(), MatrixBase::applyOnTheRight() - */ -template -void JacobiRotation::makeGivens(const Scalar& p, const Scalar& q, Scalar* z) -{ - makeGivens(p, q, z, typename internal::conditional::IsComplex, internal::true_type, internal::false_type>::type()); -} - - -// specialization for complexes -template -void JacobiRotation::makeGivens(const Scalar& p, const Scalar& q, Scalar* r, internal::true_type) -{ - using std::sqrt; - using std::abs; - using numext::conj; - - if(q==Scalar(0)) - { - m_c = numext::real(p)<0 ? Scalar(-1) : Scalar(1); - m_s = 0; - if(r) *r = m_c * p; - } - else if(p==Scalar(0)) - { - m_c = 0; - m_s = -q/abs(q); - if(r) *r = abs(q); - } - else - { - RealScalar p1 = numext::norm1(p); - RealScalar q1 = numext::norm1(q); - if(p1>=q1) - { - Scalar ps = p / p1; - RealScalar p2 = numext::abs2(ps); - Scalar qs = q / p1; - RealScalar q2 = numext::abs2(qs); - - RealScalar u = sqrt(RealScalar(1) + q2/p2); - if(numext::real(p) -void JacobiRotation::makeGivens(const Scalar& p, const Scalar& q, Scalar* r, internal::false_type) -{ - using std::sqrt; - using std::abs; - if(q==Scalar(0)) - { - m_c = p abs(q)) - { - Scalar t = q/p; - Scalar u = sqrt(Scalar(1) + numext::abs2(t)); - if(p -EIGEN_DEVICE_FUNC -void apply_rotation_in_the_plane(DenseBase& xpr_x, DenseBase& xpr_y, const JacobiRotation& j); -} - -/** \jacobi_module - * Applies the rotation in the plane \a j to the rows \a p and \a q of \c *this, i.e., it computes B = J * B, - * with \f$ B = \left ( \begin{array}{cc} \text{*this.row}(p) \\ \text{*this.row}(q) \end{array} \right ) \f$. - * - * \sa class JacobiRotation, MatrixBase::applyOnTheRight(), internal::apply_rotation_in_the_plane() - */ -template -template -inline void MatrixBase::applyOnTheLeft(Index p, Index q, const JacobiRotation& j) -{ - RowXpr x(this->row(p)); - RowXpr y(this->row(q)); - internal::apply_rotation_in_the_plane(x, y, j); -} - -/** \ingroup Jacobi_Module - * Applies the rotation in the plane \a j to the columns \a p and \a q of \c *this, i.e., it computes B = B * J - * with \f$ B = \left ( \begin{array}{cc} \text{*this.col}(p) & \text{*this.col}(q) \end{array} \right ) \f$. - * - * \sa class JacobiRotation, MatrixBase::applyOnTheLeft(), internal::apply_rotation_in_the_plane() - */ -template -template -inline void MatrixBase::applyOnTheRight(Index p, Index q, const JacobiRotation& j) -{ - ColXpr x(this->col(p)); - ColXpr y(this->col(q)); - internal::apply_rotation_in_the_plane(x, y, j.transpose()); -} - -namespace internal { - -template -struct apply_rotation_in_the_plane_selector -{ - static inline void run(Scalar *x, Index incrx, Scalar *y, Index incry, Index size, OtherScalar c, OtherScalar s) - { - for(Index i=0; i -struct apply_rotation_in_the_plane_selector -{ - static inline void run(Scalar *x, Index incrx, Scalar *y, Index incry, Index size, OtherScalar c, OtherScalar s) - { - enum { - PacketSize = packet_traits::size, - OtherPacketSize = packet_traits::size - }; - typedef typename packet_traits::type Packet; - typedef typename packet_traits::type OtherPacket; - - /*** dynamic-size vectorized paths ***/ - if(SizeAtCompileTime == Dynamic && ((incrx==1 && incry==1) || PacketSize == 1)) - { - // both vectors are sequentially stored in memory => vectorization - enum { Peeling = 2 }; - - Index alignedStart = internal::first_default_aligned(y, size); - Index alignedEnd = alignedStart + ((size-alignedStart)/PacketSize)*PacketSize; - - const OtherPacket pc = pset1(c); - const OtherPacket ps = pset1(s); - conj_helper::IsComplex,false> pcj; - conj_helper pm; - - for(Index i=0; i(px); - Packet yi = pload(py); - pstore(px, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); - pstore(py, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); - px += PacketSize; - py += PacketSize; - } - } - else - { - Index peelingEnd = alignedStart + ((size-alignedStart)/(Peeling*PacketSize))*(Peeling*PacketSize); - for(Index i=alignedStart; i(px); - Packet xi1 = ploadu(px+PacketSize); - Packet yi = pload (py); - Packet yi1 = pload (py+PacketSize); - pstoreu(px, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); - pstoreu(px+PacketSize, padd(pm.pmul(pc,xi1),pcj.pmul(ps,yi1))); - pstore (py, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); - pstore (py+PacketSize, psub(pcj.pmul(pc,yi1),pm.pmul(ps,xi1))); - px += Peeling*PacketSize; - py += Peeling*PacketSize; - } - if(alignedEnd!=peelingEnd) - { - Packet xi = ploadu(x+peelingEnd); - Packet yi = pload (y+peelingEnd); - pstoreu(x+peelingEnd, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); - pstore (y+peelingEnd, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); - } - } - - for(Index i=alignedEnd; i0) // FIXME should be compared to the required alignment - { - const OtherPacket pc = pset1(c); - const OtherPacket ps = pset1(s); - conj_helper::IsComplex,false> pcj; - conj_helper pm; - Scalar* EIGEN_RESTRICT px = x; - Scalar* EIGEN_RESTRICT py = y; - for(Index i=0; i(px); - Packet yi = pload(py); - pstore(px, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); - pstore(py, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); - px += PacketSize; - py += PacketSize; - } - } - - /*** non-vectorized path ***/ - else - { - apply_rotation_in_the_plane_selector::run(x,incrx,y,incry,size,c,s); - } - } -}; - -template -void /*EIGEN_DONT_INLINE*/ apply_rotation_in_the_plane(DenseBase& xpr_x, DenseBase& xpr_y, const JacobiRotation& j) -{ - typedef typename VectorX::Scalar Scalar; - const bool Vectorizable = (VectorX::Flags & VectorY::Flags & PacketAccessBit) - && (int(packet_traits::size) == int(packet_traits::size)); - - eigen_assert(xpr_x.size() == xpr_y.size()); - Index size = xpr_x.size(); - Index incrx = xpr_x.derived().innerStride(); - Index incry = xpr_y.derived().innerStride(); - - Scalar* EIGEN_RESTRICT x = &xpr_x.derived().coeffRef(0); - Scalar* EIGEN_RESTRICT y = &xpr_y.derived().coeffRef(0); - - OtherScalar c = j.c(); - OtherScalar s = j.s(); - if (c==OtherScalar(1) && s==OtherScalar(0)) - return; - - apply_rotation_in_the_plane_selector< - Scalar,OtherScalar, - VectorX::SizeAtCompileTime, - EIGEN_PLAIN_ENUM_MIN(evaluator::Alignment, evaluator::Alignment), - Vectorizable>::run(x,incrx,y,incry,size,c,s); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_JACOBI_H diff --git a/Eigen/src/KLUSupport/KLUSupport.h b/Eigen/src/KLUSupport/KLUSupport.h deleted file mode 100644 index a9e8633d9..000000000 --- a/Eigen/src/KLUSupport/KLUSupport.h +++ /dev/null @@ -1,358 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2017 Kyle Macfarlan -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_KLUSUPPORT_H -#define EIGEN_KLUSUPPORT_H - -namespace Eigen { - -/* TODO extract L, extract U, compute det, etc... */ - -/** \ingroup KLUSupport_Module - * \brief A sparse LU factorization and solver based on KLU - * - * This class allows to solve for A.X = B sparse linear problems via a LU factorization - * using the KLU library. The sparse matrix A must be squared and full rank. - * The vectors or matrices X and B can be either dense or sparse. - * - * \warning The input matrix A should be in a \b compressed and \b column-major form. - * Otherwise an expensive copy will be made. You can call the inexpensive makeCompressed() to get a compressed matrix. - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class UmfPackLU, class SparseLU - */ - - -inline int klu_solve(klu_symbolic *Symbolic, klu_numeric *Numeric, Index ldim, Index nrhs, double B [ ], klu_common *Common, double) { - return klu_solve(Symbolic, Numeric, internal::convert_index(ldim), internal::convert_index(nrhs), B, Common); -} - -inline int klu_solve(klu_symbolic *Symbolic, klu_numeric *Numeric, Index ldim, Index nrhs, std::complexB[], klu_common *Common, std::complex) { - return klu_z_solve(Symbolic, Numeric, internal::convert_index(ldim), internal::convert_index(nrhs), &numext::real_ref(B[0]), Common); -} - -inline int klu_tsolve(klu_symbolic *Symbolic, klu_numeric *Numeric, Index ldim, Index nrhs, double B[], klu_common *Common, double) { - return klu_tsolve(Symbolic, Numeric, internal::convert_index(ldim), internal::convert_index(nrhs), B, Common); -} - -inline int klu_tsolve(klu_symbolic *Symbolic, klu_numeric *Numeric, Index ldim, Index nrhs, std::complexB[], klu_common *Common, std::complex) { - return klu_z_tsolve(Symbolic, Numeric, internal::convert_index(ldim), internal::convert_index(nrhs), &numext::real_ref(B[0]), 0, Common); -} - -inline klu_numeric* klu_factor(int Ap [ ], int Ai [ ], double Ax [ ], klu_symbolic *Symbolic, klu_common *Common, double) { - return klu_factor(Ap, Ai, Ax, Symbolic, Common); -} - -inline klu_numeric* klu_factor(int Ap[], int Ai[], std::complex Ax[], klu_symbolic *Symbolic, klu_common *Common, std::complex) { - return klu_z_factor(Ap, Ai, &numext::real_ref(Ax[0]), Symbolic, Common); -} - - -template -class KLU : public SparseSolverBase > -{ - protected: - typedef SparseSolverBase > Base; - using Base::m_isInitialized; - public: - using Base::_solve_impl; - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Matrix Vector; - typedef Matrix IntRowVectorType; - typedef Matrix IntColVectorType; - typedef SparseMatrix LUMatrixType; - typedef SparseMatrix KLUMatrixType; - typedef Ref KLUMatrixRef; - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - - KLU() - : m_dummy(0,0), mp_matrix(m_dummy) - { - init(); - } - - template - explicit KLU(const InputMatrixType& matrix) - : mp_matrix(matrix) - { - init(); - compute(matrix); - } - - ~KLU() - { - if(m_symbolic) klu_free_symbolic(&m_symbolic,&m_common); - if(m_numeric) klu_free_numeric(&m_numeric,&m_common); - } - - inline Index rows() const { return mp_matrix.rows(); } - inline Index cols() const { return mp_matrix.cols(); } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the matrix.appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } -#if 0 // not implemented yet - inline const LUMatrixType& matrixL() const - { - if (m_extractedDataAreDirty) extractData(); - return m_l; - } - - inline const LUMatrixType& matrixU() const - { - if (m_extractedDataAreDirty) extractData(); - return m_u; - } - - inline const IntColVectorType& permutationP() const - { - if (m_extractedDataAreDirty) extractData(); - return m_p; - } - - inline const IntRowVectorType& permutationQ() const - { - if (m_extractedDataAreDirty) extractData(); - return m_q; - } -#endif - /** Computes the sparse Cholesky decomposition of \a matrix - * Note that the matrix should be column-major, and in compressed format for best performance. - * \sa SparseMatrix::makeCompressed(). - */ - template - void compute(const InputMatrixType& matrix) - { - if(m_symbolic) klu_free_symbolic(&m_symbolic, &m_common); - if(m_numeric) klu_free_numeric(&m_numeric, &m_common); - grab(matrix.derived()); - analyzePattern_impl(); - factorize_impl(); - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize(), compute() - */ - template - void analyzePattern(const InputMatrixType& matrix) - { - if(m_symbolic) klu_free_symbolic(&m_symbolic, &m_common); - if(m_numeric) klu_free_numeric(&m_numeric, &m_common); - - grab(matrix.derived()); - - analyzePattern_impl(); - } - - - /** Provides access to the control settings array used by KLU. - * - * See KLU documentation for details. - */ - inline const klu_common& kluCommon() const - { - return m_common; - } - - /** Provides access to the control settings array used by UmfPack. - * - * If this array contains NaN's, the default values are used. - * - * See KLU documentation for details. - */ - inline klu_common& kluCommon() - { - return m_common; - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the pattern anylysis has been performed. - * - * \sa analyzePattern(), compute() - */ - template - void factorize(const InputMatrixType& matrix) - { - eigen_assert(m_analysisIsOk && "KLU: you must first call analyzePattern()"); - if(m_numeric) - klu_free_numeric(&m_numeric,&m_common); - - grab(matrix.derived()); - - factorize_impl(); - } - - /** \internal */ - template - bool _solve_impl(const MatrixBase &b, MatrixBase &x) const; - -#if 0 // not implemented yet - Scalar determinant() const; - - void extractData() const; -#endif - - protected: - - void init() - { - m_info = InvalidInput; - m_isInitialized = false; - m_numeric = 0; - m_symbolic = 0; - m_extractedDataAreDirty = true; - - klu_defaults(&m_common); - } - - void analyzePattern_impl() - { - m_info = InvalidInput; - m_analysisIsOk = false; - m_factorizationIsOk = false; - m_symbolic = klu_analyze(internal::convert_index(mp_matrix.rows()), - const_cast(mp_matrix.outerIndexPtr()), const_cast(mp_matrix.innerIndexPtr()), - &m_common); - if (m_symbolic) { - m_isInitialized = true; - m_info = Success; - m_analysisIsOk = true; - m_extractedDataAreDirty = true; - } - } - - void factorize_impl() - { - - m_numeric = klu_factor(const_cast(mp_matrix.outerIndexPtr()), const_cast(mp_matrix.innerIndexPtr()), const_cast(mp_matrix.valuePtr()), - m_symbolic, &m_common, Scalar()); - - - m_info = m_numeric ? Success : NumericalIssue; - m_factorizationIsOk = m_numeric ? 1 : 0; - m_extractedDataAreDirty = true; - } - - template - void grab(const EigenBase &A) - { - mp_matrix.~KLUMatrixRef(); - ::new (&mp_matrix) KLUMatrixRef(A.derived()); - } - - void grab(const KLUMatrixRef &A) - { - if(&(A.derived()) != &mp_matrix) - { - mp_matrix.~KLUMatrixRef(); - ::new (&mp_matrix) KLUMatrixRef(A); - } - } - - // cached data to reduce reallocation, etc. -#if 0 // not implemented yet - mutable LUMatrixType m_l; - mutable LUMatrixType m_u; - mutable IntColVectorType m_p; - mutable IntRowVectorType m_q; -#endif - - KLUMatrixType m_dummy; - KLUMatrixRef mp_matrix; - - klu_numeric* m_numeric; - klu_symbolic* m_symbolic; - klu_common m_common; - mutable ComputationInfo m_info; - int m_factorizationIsOk; - int m_analysisIsOk; - mutable bool m_extractedDataAreDirty; - - private: - KLU(const KLU& ) { } -}; - -#if 0 // not implemented yet -template -void KLU::extractData() const -{ - if (m_extractedDataAreDirty) - { - eigen_assert(false && "KLU: extractData Not Yet Implemented"); - - // get size of the data - int lnz, unz, rows, cols, nz_udiag; - umfpack_get_lunz(&lnz, &unz, &rows, &cols, &nz_udiag, m_numeric, Scalar()); - - // allocate data - m_l.resize(rows,(std::min)(rows,cols)); - m_l.resizeNonZeros(lnz); - - m_u.resize((std::min)(rows,cols),cols); - m_u.resizeNonZeros(unz); - - m_p.resize(rows); - m_q.resize(cols); - - // extract - umfpack_get_numeric(m_l.outerIndexPtr(), m_l.innerIndexPtr(), m_l.valuePtr(), - m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), - m_p.data(), m_q.data(), 0, 0, 0, m_numeric); - - m_extractedDataAreDirty = false; - } -} - -template -typename KLU::Scalar KLU::determinant() const -{ - eigen_assert(false && "KLU: extractData Not Yet Implemented"); - return Scalar(); -} -#endif - -template -template -bool KLU::_solve_impl(const MatrixBase &b, MatrixBase &x) const -{ - Index rhsCols = b.cols(); - EIGEN_STATIC_ASSERT((XDerived::Flags&RowMajorBit)==0, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); - eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()"); - - x = b; - int info = klu_solve(m_symbolic, m_numeric, b.rows(), rhsCols, x.const_cast_derived().data(), const_cast(&m_common), Scalar()); - - m_info = info!=0 ? Success : NumericalIssue; - return true; -} - -} // end namespace Eigen - -#endif // EIGEN_KLUSUPPORT_H diff --git a/Eigen/src/LU/Determinant.h b/Eigen/src/LU/Determinant.h deleted file mode 100644 index d6a3c1e5a..000000000 --- a/Eigen/src/LU/Determinant.h +++ /dev/null @@ -1,101 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_DETERMINANT_H -#define EIGEN_DETERMINANT_H - -namespace Eigen { - -namespace internal { - -template -inline const typename Derived::Scalar bruteforce_det3_helper -(const MatrixBase& matrix, int a, int b, int c) -{ - return matrix.coeff(0,a) - * (matrix.coeff(1,b) * matrix.coeff(2,c) - matrix.coeff(1,c) * matrix.coeff(2,b)); -} - -template -const typename Derived::Scalar bruteforce_det4_helper -(const MatrixBase& matrix, int j, int k, int m, int n) -{ - return (matrix.coeff(j,0) * matrix.coeff(k,1) - matrix.coeff(k,0) * matrix.coeff(j,1)) - * (matrix.coeff(m,2) * matrix.coeff(n,3) - matrix.coeff(n,2) * matrix.coeff(m,3)); -} - -template struct determinant_impl -{ - static inline typename traits::Scalar run(const Derived& m) - { - if(Derived::ColsAtCompileTime==Dynamic && m.rows()==0) - return typename traits::Scalar(1); - return m.partialPivLu().determinant(); - } -}; - -template struct determinant_impl -{ - static inline typename traits::Scalar run(const Derived& m) - { - return m.coeff(0,0); - } -}; - -template struct determinant_impl -{ - static inline typename traits::Scalar run(const Derived& m) - { - return m.coeff(0,0) * m.coeff(1,1) - m.coeff(1,0) * m.coeff(0,1); - } -}; - -template struct determinant_impl -{ - static inline typename traits::Scalar run(const Derived& m) - { - return bruteforce_det3_helper(m,0,1,2) - - bruteforce_det3_helper(m,1,0,2) - + bruteforce_det3_helper(m,2,0,1); - } -}; - -template struct determinant_impl -{ - static typename traits::Scalar run(const Derived& m) - { - // trick by Martin Costabel to compute 4x4 det with only 30 muls - return bruteforce_det4_helper(m,0,1,2,3) - - bruteforce_det4_helper(m,0,2,1,3) - + bruteforce_det4_helper(m,0,3,1,2) - + bruteforce_det4_helper(m,1,2,0,3) - - bruteforce_det4_helper(m,1,3,0,2) - + bruteforce_det4_helper(m,2,3,0,1); - } -}; - -} // end namespace internal - -/** \lu_module - * - * \returns the determinant of this matrix - */ -template -inline typename internal::traits::Scalar MatrixBase::determinant() const -{ - eigen_assert(rows() == cols()); - typedef typename internal::nested_eval::type Nested; - return internal::determinant_impl::type>::run(derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_DETERMINANT_H diff --git a/Eigen/src/LU/FullPivLU.h b/Eigen/src/LU/FullPivLU.h deleted file mode 100644 index ec61086d5..000000000 --- a/Eigen/src/LU/FullPivLU.h +++ /dev/null @@ -1,889 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2006-2009 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_LU_H -#define EIGEN_LU_H - -namespace Eigen { - -namespace internal { -template struct traits > - : traits<_MatrixType> -{ - typedef MatrixXpr XprKind; - typedef SolverStorage StorageKind; - enum { Flags = 0 }; -}; - -} // end namespace internal - -/** \ingroup LU_Module - * - * \class FullPivLU - * - * \brief LU decomposition of a matrix with complete pivoting, and related features - * - * \tparam _MatrixType the type of the matrix of which we are computing the LU decomposition - * - * This class represents a LU decomposition of any matrix, with complete pivoting: the matrix A is - * decomposed as \f$ A = P^{-1} L U Q^{-1} \f$ where L is unit-lower-triangular, U is - * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU - * decomposition. The eigenvalues (diagonal coefficients) of U are sorted in such a way that any - * zeros are at the end. - * - * This decomposition provides the generic approach to solving systems of linear equations, computing - * the rank, invertibility, inverse, kernel, and determinant. - * - * This LU decomposition is very stable and well tested with large matrices. However there are use cases where the SVD - * decomposition is inherently more stable and/or flexible. For example, when computing the kernel of a matrix, - * working with the SVD allows to select the smallest singular values of the matrix, something that - * the LU decomposition doesn't see. - * - * The data of the LU decomposition can be directly accessed through the methods matrixLU(), - * permutationP(), permutationQ(). - * - * As an exemple, here is how the original matrix can be retrieved: - * \include class_FullPivLU.cpp - * Output: \verbinclude class_FullPivLU.out - * - * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. - * - * \sa MatrixBase::fullPivLu(), MatrixBase::determinant(), MatrixBase::inverse() - */ -template class FullPivLU - : public SolverBase > -{ - public: - typedef _MatrixType MatrixType; - typedef SolverBase Base; - - EIGEN_GENERIC_PUBLIC_INTERFACE(FullPivLU) - // FIXME StorageIndex defined in EIGEN_GENERIC_PUBLIC_INTERFACE should be int - enum { - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename internal::plain_row_type::type IntRowVectorType; - typedef typename internal::plain_col_type::type IntColVectorType; - typedef PermutationMatrix PermutationQType; - typedef PermutationMatrix PermutationPType; - typedef typename MatrixType::PlainObject PlainObject; - - /** - * \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via LU::compute(const MatrixType&). - */ - FullPivLU(); - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa FullPivLU() - */ - FullPivLU(Index rows, Index cols); - - /** Constructor. - * - * \param matrix the matrix of which to compute the LU decomposition. - * It is required to be nonzero. - */ - template - explicit FullPivLU(const EigenBase& matrix); - - /** \brief Constructs a LU factorization from a given matrix - * - * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when \c MatrixType is a Eigen::Ref. - * - * \sa FullPivLU(const EigenBase&) - */ - template - explicit FullPivLU(EigenBase& matrix); - - /** Computes the LU decomposition of the given matrix. - * - * \param matrix the matrix of which to compute the LU decomposition. - * It is required to be nonzero. - * - * \returns a reference to *this - */ - template - FullPivLU& compute(const EigenBase& matrix) { - m_lu = matrix.derived(); - computeInPlace(); - return *this; - } - - /** \returns the LU decomposition matrix: the upper-triangular part is U, the - * unit-lower-triangular part is L (at least for square matrices; in the non-square - * case, special care is needed, see the documentation of class FullPivLU). - * - * \sa matrixL(), matrixU() - */ - inline const MatrixType& matrixLU() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return m_lu; - } - - /** \returns the number of nonzero pivots in the LU decomposition. - * Here nonzero is meant in the exact sense, not in a fuzzy sense. - * So that notion isn't really intrinsically interesting, but it is - * still useful when implementing algorithms. - * - * \sa rank() - */ - inline Index nonzeroPivots() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return m_nonzero_pivots; - } - - /** \returns the absolute value of the biggest pivot, i.e. the biggest - * diagonal coefficient of U. - */ - RealScalar maxPivot() const { return m_maxpivot; } - - /** \returns the permutation matrix P - * - * \sa permutationQ() - */ - EIGEN_DEVICE_FUNC inline const PermutationPType& permutationP() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return m_p; - } - - /** \returns the permutation matrix Q - * - * \sa permutationP() - */ - inline const PermutationQType& permutationQ() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return m_q; - } - - /** \returns the kernel of the matrix, also called its null-space. The columns of the returned matrix - * will form a basis of the kernel. - * - * \note If the kernel has dimension zero, then the returned matrix is a column-vector filled with zeros. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - * - * Example: \include FullPivLU_kernel.cpp - * Output: \verbinclude FullPivLU_kernel.out - * - * \sa image() - */ - inline const internal::kernel_retval kernel() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return internal::kernel_retval(*this); - } - - /** \returns the image of the matrix, also called its column-space. The columns of the returned matrix - * will form a basis of the image (column-space). - * - * \param originalMatrix the original matrix, of which *this is the LU decomposition. - * The reason why it is needed to pass it here, is that this allows - * a large optimization, as otherwise this method would need to reconstruct it - * from the LU decomposition. - * - * \note If the image has dimension zero, then the returned matrix is a column-vector filled with zeros. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - * - * Example: \include FullPivLU_image.cpp - * Output: \verbinclude FullPivLU_image.out - * - * \sa kernel() - */ - inline const internal::image_retval - image(const MatrixType& originalMatrix) const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return internal::image_retval(*this, originalMatrix); - } - - /** \return a solution x to the equation Ax=b, where A is the matrix of which - * *this is the LU decomposition. - * - * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix, - * the only requirement in order for the equation to make sense is that - * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition. - * - * \returns a solution. - * - * \note_about_checking_solutions - * - * \note_about_arbitrary_choice_of_solution - * \note_about_using_kernel_to_study_multiple_solutions - * - * Example: \include FullPivLU_solve.cpp - * Output: \verbinclude FullPivLU_solve.out - * - * \sa TriangularView::solve(), kernel(), inverse() - */ - // FIXME this is a copy-paste of the base-class member to add the isInitialized assertion. - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return Solve(*this, b.derived()); - } - - /** \returns an estimate of the reciprocal condition number of the matrix of which \c *this is - the LU decomposition. - */ - inline RealScalar rcond() const - { - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return internal::rcond_estimate_helper(m_l1_norm, *this); - } - - /** \returns the determinant of the matrix of which - * *this is the LU decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the LU decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \note For fixed-size matrices of size up to 4, MatrixBase::determinant() offers - * optimized paths. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * - * \sa MatrixBase::determinant() - */ - typename internal::traits::Scalar determinant() const; - - /** Allows to prescribe a threshold to be used by certain methods, such as rank(), - * who need to determine when pivots are to be considered nonzero. This is not used for the - * LU decomposition itself. - * - * When it needs to get the threshold value, Eigen calls threshold(). By default, this - * uses a formula to automatically determine a reasonable threshold. - * Once you have called the present method setThreshold(const RealScalar&), - * your value is used instead. - * - * \param threshold The new value to use as the threshold. - * - * A pivot will be considered nonzero if its absolute value is strictly greater than - * \f$ \vert pivot \vert \leqslant threshold \times \vert maxpivot \vert \f$ - * where maxpivot is the biggest pivot. - * - * If you want to come back to the default behavior, call setThreshold(Default_t) - */ - FullPivLU& setThreshold(const RealScalar& threshold) - { - m_usePrescribedThreshold = true; - m_prescribedThreshold = threshold; - return *this; - } - - /** Allows to come back to the default behavior, letting Eigen use its default formula for - * determining the threshold. - * - * You should pass the special object Eigen::Default as parameter here. - * \code lu.setThreshold(Eigen::Default); \endcode - * - * See the documentation of setThreshold(const RealScalar&). - */ - FullPivLU& setThreshold(Default_t) - { - m_usePrescribedThreshold = false; - return *this; - } - - /** Returns the threshold that will be used by certain methods such as rank(). - * - * See the documentation of setThreshold(const RealScalar&). - */ - RealScalar threshold() const - { - eigen_assert(m_isInitialized || m_usePrescribedThreshold); - return m_usePrescribedThreshold ? m_prescribedThreshold - // this formula comes from experimenting (see "LU precision tuning" thread on the list) - // and turns out to be identical to Higham's formula used already in LDLt. - : NumTraits::epsilon() * m_lu.diagonalSize(); - } - - /** \returns the rank of the matrix of which *this is the LU decomposition. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index rank() const - { - using std::abs; - eigen_assert(m_isInitialized && "LU is not initialized."); - RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); - Index result = 0; - for(Index i = 0; i < m_nonzero_pivots; ++i) - result += (abs(m_lu.coeff(i,i)) > premultiplied_threshold); - return result; - } - - /** \returns the dimension of the kernel of the matrix of which *this is the LU decomposition. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index dimensionOfKernel() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return cols() - rank(); - } - - /** \returns true if the matrix of which *this is the LU decomposition represents an injective - * linear map, i.e. has trivial kernel; false otherwise. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isInjective() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return rank() == cols(); - } - - /** \returns true if the matrix of which *this is the LU decomposition represents a surjective - * linear map; false otherwise. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isSurjective() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return rank() == rows(); - } - - /** \returns true if the matrix of which *this is the LU decomposition is invertible. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isInvertible() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return isInjective() && (m_lu.rows() == m_lu.cols()); - } - - /** \returns the inverse of the matrix of which *this is the LU decomposition. - * - * \note If this matrix is not invertible, the returned matrix has undefined coefficients. - * Use isInvertible() to first determine whether this matrix is invertible. - * - * \sa MatrixBase::inverse() - */ - inline const Inverse inverse() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!"); - return Inverse(*this); - } - - MatrixType reconstructedMatrix() const; - - EIGEN_DEVICE_FUNC inline Index rows() const { return m_lu.rows(); } - EIGEN_DEVICE_FUNC inline Index cols() const { return m_lu.cols(); } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - void _solve_impl(const RhsType &rhs, DstType &dst) const; - - template - void _solve_impl_transposed(const RhsType &rhs, DstType &dst) const; - #endif - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - void computeInPlace(); - - MatrixType m_lu; - PermutationPType m_p; - PermutationQType m_q; - IntColVectorType m_rowsTranspositions; - IntRowVectorType m_colsTranspositions; - Index m_nonzero_pivots; - RealScalar m_l1_norm; - RealScalar m_maxpivot, m_prescribedThreshold; - signed char m_det_pq; - bool m_isInitialized, m_usePrescribedThreshold; -}; - -template -FullPivLU::FullPivLU() - : m_isInitialized(false), m_usePrescribedThreshold(false) -{ -} - -template -FullPivLU::FullPivLU(Index rows, Index cols) - : m_lu(rows, cols), - m_p(rows), - m_q(cols), - m_rowsTranspositions(rows), - m_colsTranspositions(cols), - m_isInitialized(false), - m_usePrescribedThreshold(false) -{ -} - -template -template -FullPivLU::FullPivLU(const EigenBase& matrix) - : m_lu(matrix.rows(), matrix.cols()), - m_p(matrix.rows()), - m_q(matrix.cols()), - m_rowsTranspositions(matrix.rows()), - m_colsTranspositions(matrix.cols()), - m_isInitialized(false), - m_usePrescribedThreshold(false) -{ - compute(matrix.derived()); -} - -template -template -FullPivLU::FullPivLU(EigenBase& matrix) - : m_lu(matrix.derived()), - m_p(matrix.rows()), - m_q(matrix.cols()), - m_rowsTranspositions(matrix.rows()), - m_colsTranspositions(matrix.cols()), - m_isInitialized(false), - m_usePrescribedThreshold(false) -{ - computeInPlace(); -} - -template -void FullPivLU::computeInPlace() -{ - check_template_parameters(); - - // the permutations are stored as int indices, so just to be sure: - eigen_assert(m_lu.rows()<=NumTraits::highest() && m_lu.cols()<=NumTraits::highest()); - - m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff(); - - const Index size = m_lu.diagonalSize(); - const Index rows = m_lu.rows(); - const Index cols = m_lu.cols(); - - // will store the transpositions, before we accumulate them at the end. - // can't accumulate on-the-fly because that will be done in reverse order for the rows. - m_rowsTranspositions.resize(m_lu.rows()); - m_colsTranspositions.resize(m_lu.cols()); - Index number_of_transpositions = 0; // number of NONTRIVIAL transpositions, i.e. m_rowsTranspositions[i]!=i - - m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case) - m_maxpivot = RealScalar(0); - - for(Index k = 0; k < size; ++k) - { - // First, we need to find the pivot. - - // biggest coefficient in the remaining bottom-right corner (starting at row k, col k) - Index row_of_biggest_in_corner, col_of_biggest_in_corner; - typedef internal::scalar_score_coeff_op Scoring; - typedef typename Scoring::result_type Score; - Score biggest_in_corner; - biggest_in_corner = m_lu.bottomRightCorner(rows-k, cols-k) - .unaryExpr(Scoring()) - .maxCoeff(&row_of_biggest_in_corner, &col_of_biggest_in_corner); - row_of_biggest_in_corner += k; // correct the values! since they were computed in the corner, - col_of_biggest_in_corner += k; // need to add k to them. - - if(biggest_in_corner==Score(0)) - { - // before exiting, make sure to initialize the still uninitialized transpositions - // in a sane state without destroying what we already have. - m_nonzero_pivots = k; - for(Index i = k; i < size; ++i) - { - m_rowsTranspositions.coeffRef(i) = i; - m_colsTranspositions.coeffRef(i) = i; - } - break; - } - - RealScalar abs_pivot = internal::abs_knowing_score()(m_lu(row_of_biggest_in_corner, col_of_biggest_in_corner), biggest_in_corner); - if(abs_pivot > m_maxpivot) m_maxpivot = abs_pivot; - - // Now that we've found the pivot, we need to apply the row/col swaps to - // bring it to the location (k,k). - - m_rowsTranspositions.coeffRef(k) = row_of_biggest_in_corner; - m_colsTranspositions.coeffRef(k) = col_of_biggest_in_corner; - if(k != row_of_biggest_in_corner) { - m_lu.row(k).swap(m_lu.row(row_of_biggest_in_corner)); - ++number_of_transpositions; - } - if(k != col_of_biggest_in_corner) { - m_lu.col(k).swap(m_lu.col(col_of_biggest_in_corner)); - ++number_of_transpositions; - } - - // Now that the pivot is at the right location, we update the remaining - // bottom-right corner by Gaussian elimination. - - if(k= 0; --k) - m_p.applyTranspositionOnTheRight(k, m_rowsTranspositions.coeff(k)); - - m_q.setIdentity(cols); - for(Index k = 0; k < size; ++k) - m_q.applyTranspositionOnTheRight(k, m_colsTranspositions.coeff(k)); - - m_det_pq = (number_of_transpositions%2) ? -1 : 1; - - m_isInitialized = true; -} - -template -typename internal::traits::Scalar FullPivLU::determinant() const -{ - eigen_assert(m_isInitialized && "LU is not initialized."); - eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the determinant of a non-square matrix!"); - return Scalar(m_det_pq) * Scalar(m_lu.diagonal().prod()); -} - -/** \returns the matrix represented by the decomposition, - * i.e., it returns the product: \f$ P^{-1} L U Q^{-1} \f$. - * This function is provided for debug purposes. */ -template -MatrixType FullPivLU::reconstructedMatrix() const -{ - eigen_assert(m_isInitialized && "LU is not initialized."); - const Index smalldim = (std::min)(m_lu.rows(), m_lu.cols()); - // LU - MatrixType res(m_lu.rows(),m_lu.cols()); - // FIXME the .toDenseMatrix() should not be needed... - res = m_lu.leftCols(smalldim) - .template triangularView().toDenseMatrix() - * m_lu.topRows(smalldim) - .template triangularView().toDenseMatrix(); - - // P^{-1}(LU) - res = m_p.inverse() * res; - - // (P^{-1}LU)Q^{-1} - res = res * m_q.inverse(); - - return res; -} - -/********* Implementation of kernel() **************************************************/ - -namespace internal { -template -struct kernel_retval > - : kernel_retval_base > -{ - EIGEN_MAKE_KERNEL_HELPERS(FullPivLU<_MatrixType>) - - enum { MaxSmallDimAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED( - MatrixType::MaxColsAtCompileTime, - MatrixType::MaxRowsAtCompileTime) - }; - - template void evalTo(Dest& dst) const - { - using std::abs; - const Index cols = dec().matrixLU().cols(), dimker = cols - rank(); - if(dimker == 0) - { - // The Kernel is just {0}, so it doesn't have a basis properly speaking, but let's - // avoid crashing/asserting as that depends on floating point calculations. Let's - // just return a single column vector filled with zeros. - dst.setZero(); - return; - } - - /* Let us use the following lemma: - * - * Lemma: If the matrix A has the LU decomposition PAQ = LU, - * then Ker A = Q(Ker U). - * - * Proof: trivial: just keep in mind that P, Q, L are invertible. - */ - - /* Thus, all we need to do is to compute Ker U, and then apply Q. - * - * U is upper triangular, with eigenvalues sorted so that any zeros appear at the end. - * Thus, the diagonal of U ends with exactly - * dimKer zero's. Let us use that to construct dimKer linearly - * independent vectors in Ker U. - */ - - Matrix pivots(rank()); - RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold(); - Index p = 0; - for(Index i = 0; i < dec().nonzeroPivots(); ++i) - if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold) - pivots.coeffRef(p++) = i; - eigen_internal_assert(p == rank()); - - // we construct a temporaty trapezoid matrix m, by taking the U matrix and - // permuting the rows and cols to bring the nonnegligible pivots to the top of - // the main diagonal. We need that to be able to apply our triangular solvers. - // FIXME when we get triangularView-for-rectangular-matrices, this can be simplified - Matrix - m(dec().matrixLU().block(0, 0, rank(), cols)); - for(Index i = 0; i < rank(); ++i) - { - if(i) m.row(i).head(i).setZero(); - m.row(i).tail(cols-i) = dec().matrixLU().row(pivots.coeff(i)).tail(cols-i); - } - m.block(0, 0, rank(), rank()); - m.block(0, 0, rank(), rank()).template triangularView().setZero(); - for(Index i = 0; i < rank(); ++i) - m.col(i).swap(m.col(pivots.coeff(i))); - - // ok, we have our trapezoid matrix, we can apply the triangular solver. - // notice that the math behind this suggests that we should apply this to the - // negative of the RHS, but for performance we just put the negative sign elsewhere, see below. - m.topLeftCorner(rank(), rank()) - .template triangularView().solveInPlace( - m.topRightCorner(rank(), dimker) - ); - - // now we must undo the column permutation that we had applied! - for(Index i = rank()-1; i >= 0; --i) - m.col(i).swap(m.col(pivots.coeff(i))); - - // see the negative sign in the next line, that's what we were talking about above. - for(Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker); - for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero(); - for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) = Scalar(1); - } -}; - -/***** Implementation of image() *****************************************************/ - -template -struct image_retval > - : image_retval_base > -{ - EIGEN_MAKE_IMAGE_HELPERS(FullPivLU<_MatrixType>) - - enum { MaxSmallDimAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED( - MatrixType::MaxColsAtCompileTime, - MatrixType::MaxRowsAtCompileTime) - }; - - template void evalTo(Dest& dst) const - { - using std::abs; - if(rank() == 0) - { - // The Image is just {0}, so it doesn't have a basis properly speaking, but let's - // avoid crashing/asserting as that depends on floating point calculations. Let's - // just return a single column vector filled with zeros. - dst.setZero(); - return; - } - - Matrix pivots(rank()); - RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold(); - Index p = 0; - for(Index i = 0; i < dec().nonzeroPivots(); ++i) - if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold) - pivots.coeffRef(p++) = i; - eigen_internal_assert(p == rank()); - - for(Index i = 0; i < rank(); ++i) - dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i))); - } -}; - -/***** Implementation of solve() *****************************************************/ - -} // end namespace internal - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void FullPivLU<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const -{ - /* The decomposition PAQ = LU can be rewritten as A = P^{-1} L U Q^{-1}. - * So we proceed as follows: - * Step 1: compute c = P * rhs. - * Step 2: replace c by the solution x to Lx = c. Exists because L is invertible. - * Step 3: replace c by the solution x to Ux = c. May or may not exist. - * Step 4: result = Q * c; - */ - - const Index rows = this->rows(), - cols = this->cols(), - nonzero_pivots = this->rank(); - eigen_assert(rhs.rows() == rows); - const Index smalldim = (std::min)(rows, cols); - - if(nonzero_pivots == 0) - { - dst.setZero(); - return; - } - - typename RhsType::PlainObject c(rhs.rows(), rhs.cols()); - - // Step 1 - c = permutationP() * rhs; - - // Step 2 - m_lu.topLeftCorner(smalldim,smalldim) - .template triangularView() - .solveInPlace(c.topRows(smalldim)); - if(rows>cols) - c.bottomRows(rows-cols) -= m_lu.bottomRows(rows-cols) * c.topRows(cols); - - // Step 3 - m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots) - .template triangularView() - .solveInPlace(c.topRows(nonzero_pivots)); - - // Step 4 - for(Index i = 0; i < nonzero_pivots; ++i) - dst.row(permutationQ().indices().coeff(i)) = c.row(i); - for(Index i = nonzero_pivots; i < m_lu.cols(); ++i) - dst.row(permutationQ().indices().coeff(i)).setZero(); -} - -template -template -void FullPivLU<_MatrixType>::_solve_impl_transposed(const RhsType &rhs, DstType &dst) const -{ - /* The decomposition PAQ = LU can be rewritten as A = P^{-1} L U Q^{-1}, - * and since permutations are real and unitary, we can write this - * as A^T = Q U^T L^T P, - * So we proceed as follows: - * Step 1: compute c = Q^T rhs. - * Step 2: replace c by the solution x to U^T x = c. May or may not exist. - * Step 3: replace c by the solution x to L^T x = c. - * Step 4: result = P^T c. - * If Conjugate is true, replace "^T" by "^*" above. - */ - - const Index rows = this->rows(), cols = this->cols(), - nonzero_pivots = this->rank(); - eigen_assert(rhs.rows() == cols); - const Index smalldim = (std::min)(rows, cols); - - if(nonzero_pivots == 0) - { - dst.setZero(); - return; - } - - typename RhsType::PlainObject c(rhs.rows(), rhs.cols()); - - // Step 1 - c = permutationQ().inverse() * rhs; - - if (Conjugate) { - // Step 2 - m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots) - .template triangularView() - .adjoint() - .solveInPlace(c.topRows(nonzero_pivots)); - // Step 3 - m_lu.topLeftCorner(smalldim, smalldim) - .template triangularView() - .adjoint() - .solveInPlace(c.topRows(smalldim)); - } else { - // Step 2 - m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots) - .template triangularView() - .transpose() - .solveInPlace(c.topRows(nonzero_pivots)); - // Step 3 - m_lu.topLeftCorner(smalldim, smalldim) - .template triangularView() - .transpose() - .solveInPlace(c.topRows(smalldim)); - } - - // Step 4 - PermutationPType invp = permutationP().inverse().eval(); - for(Index i = 0; i < smalldim; ++i) - dst.row(invp.indices().coeff(i)) = c.row(i); - for(Index i = smalldim; i < rows; ++i) - dst.row(invp.indices().coeff(i)).setZero(); -} - -#endif - -namespace internal { - - -/***** Implementation of inverse() *****************************************************/ -template -struct Assignment >, internal::assign_op::Scalar>, Dense2Dense> -{ - typedef FullPivLU LuType; - typedef Inverse SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); - } -}; -} // end namespace internal - -/******* MatrixBase methods *****************************************************************/ - -/** \lu_module - * - * \return the full-pivoting LU decomposition of \c *this. - * - * \sa class FullPivLU - */ -template -inline const FullPivLU::PlainObject> -MatrixBase::fullPivLu() const -{ - return FullPivLU(eval()); -} - -} // end namespace Eigen - -#endif // EIGEN_LU_H diff --git a/Eigen/src/LU/InverseImpl.h b/Eigen/src/LU/InverseImpl.h deleted file mode 100644 index 018f99b58..000000000 --- a/Eigen/src/LU/InverseImpl.h +++ /dev/null @@ -1,415 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Benoit Jacob -// Copyright (C) 2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_INVERSE_IMPL_H -#define EIGEN_INVERSE_IMPL_H - -namespace Eigen { - -namespace internal { - -/********************************** -*** General case implementation *** -**********************************/ - -template -struct compute_inverse -{ - EIGEN_DEVICE_FUNC - static inline void run(const MatrixType& matrix, ResultType& result) - { - result = matrix.partialPivLu().inverse(); - } -}; - -template -struct compute_inverse_and_det_with_check { /* nothing! general case not supported. */ }; - -/**************************** -*** Size 1 implementation *** -****************************/ - -template -struct compute_inverse -{ - EIGEN_DEVICE_FUNC - static inline void run(const MatrixType& matrix, ResultType& result) - { - typedef typename MatrixType::Scalar Scalar; - internal::evaluator matrixEval(matrix); - result.coeffRef(0,0) = Scalar(1) / matrixEval.coeff(0,0); - } -}; - -template -struct compute_inverse_and_det_with_check -{ - EIGEN_DEVICE_FUNC - static inline void run( - const MatrixType& matrix, - const typename MatrixType::RealScalar& absDeterminantThreshold, - ResultType& result, - typename ResultType::Scalar& determinant, - bool& invertible - ) - { - using std::abs; - determinant = matrix.coeff(0,0); - invertible = abs(determinant) > absDeterminantThreshold; - if(invertible) result.coeffRef(0,0) = typename ResultType::Scalar(1) / determinant; - } -}; - -/**************************** -*** Size 2 implementation *** -****************************/ - -template -EIGEN_DEVICE_FUNC -inline void compute_inverse_size2_helper( - const MatrixType& matrix, const typename ResultType::Scalar& invdet, - ResultType& result) -{ - result.coeffRef(0,0) = matrix.coeff(1,1) * invdet; - result.coeffRef(1,0) = -matrix.coeff(1,0) * invdet; - result.coeffRef(0,1) = -matrix.coeff(0,1) * invdet; - result.coeffRef(1,1) = matrix.coeff(0,0) * invdet; -} - -template -struct compute_inverse -{ - EIGEN_DEVICE_FUNC - static inline void run(const MatrixType& matrix, ResultType& result) - { - typedef typename ResultType::Scalar Scalar; - const Scalar invdet = typename MatrixType::Scalar(1) / matrix.determinant(); - compute_inverse_size2_helper(matrix, invdet, result); - } -}; - -template -struct compute_inverse_and_det_with_check -{ - EIGEN_DEVICE_FUNC - static inline void run( - const MatrixType& matrix, - const typename MatrixType::RealScalar& absDeterminantThreshold, - ResultType& inverse, - typename ResultType::Scalar& determinant, - bool& invertible - ) - { - using std::abs; - typedef typename ResultType::Scalar Scalar; - determinant = matrix.determinant(); - invertible = abs(determinant) > absDeterminantThreshold; - if(!invertible) return; - const Scalar invdet = Scalar(1) / determinant; - compute_inverse_size2_helper(matrix, invdet, inverse); - } -}; - -/**************************** -*** Size 3 implementation *** -****************************/ - -template -EIGEN_DEVICE_FUNC -inline typename MatrixType::Scalar cofactor_3x3(const MatrixType& m) -{ - enum { - i1 = (i+1) % 3, - i2 = (i+2) % 3, - j1 = (j+1) % 3, - j2 = (j+2) % 3 - }; - return m.coeff(i1, j1) * m.coeff(i2, j2) - - m.coeff(i1, j2) * m.coeff(i2, j1); -} - -template -EIGEN_DEVICE_FUNC -inline void compute_inverse_size3_helper( - const MatrixType& matrix, - const typename ResultType::Scalar& invdet, - const Matrix& cofactors_col0, - ResultType& result) -{ - result.row(0) = cofactors_col0 * invdet; - result.coeffRef(1,0) = cofactor_3x3(matrix) * invdet; - result.coeffRef(1,1) = cofactor_3x3(matrix) * invdet; - result.coeffRef(1,2) = cofactor_3x3(matrix) * invdet; - result.coeffRef(2,0) = cofactor_3x3(matrix) * invdet; - result.coeffRef(2,1) = cofactor_3x3(matrix) * invdet; - result.coeffRef(2,2) = cofactor_3x3(matrix) * invdet; -} - -template -struct compute_inverse -{ - EIGEN_DEVICE_FUNC - static inline void run(const MatrixType& matrix, ResultType& result) - { - typedef typename ResultType::Scalar Scalar; - Matrix cofactors_col0; - cofactors_col0.coeffRef(0) = cofactor_3x3(matrix); - cofactors_col0.coeffRef(1) = cofactor_3x3(matrix); - cofactors_col0.coeffRef(2) = cofactor_3x3(matrix); - const Scalar det = (cofactors_col0.cwiseProduct(matrix.col(0))).sum(); - const Scalar invdet = Scalar(1) / det; - compute_inverse_size3_helper(matrix, invdet, cofactors_col0, result); - } -}; - -template -struct compute_inverse_and_det_with_check -{ - EIGEN_DEVICE_FUNC - static inline void run( - const MatrixType& matrix, - const typename MatrixType::RealScalar& absDeterminantThreshold, - ResultType& inverse, - typename ResultType::Scalar& determinant, - bool& invertible - ) - { - using std::abs; - typedef typename ResultType::Scalar Scalar; - Matrix cofactors_col0; - cofactors_col0.coeffRef(0) = cofactor_3x3(matrix); - cofactors_col0.coeffRef(1) = cofactor_3x3(matrix); - cofactors_col0.coeffRef(2) = cofactor_3x3(matrix); - determinant = (cofactors_col0.cwiseProduct(matrix.col(0))).sum(); - invertible = abs(determinant) > absDeterminantThreshold; - if(!invertible) return; - const Scalar invdet = Scalar(1) / determinant; - compute_inverse_size3_helper(matrix, invdet, cofactors_col0, inverse); - } -}; - -/**************************** -*** Size 4 implementation *** -****************************/ - -template -EIGEN_DEVICE_FUNC -inline const typename Derived::Scalar general_det3_helper -(const MatrixBase& matrix, int i1, int i2, int i3, int j1, int j2, int j3) -{ - return matrix.coeff(i1,j1) - * (matrix.coeff(i2,j2) * matrix.coeff(i3,j3) - matrix.coeff(i2,j3) * matrix.coeff(i3,j2)); -} - -template -EIGEN_DEVICE_FUNC -inline typename MatrixType::Scalar cofactor_4x4(const MatrixType& matrix) -{ - enum { - i1 = (i+1) % 4, - i2 = (i+2) % 4, - i3 = (i+3) % 4, - j1 = (j+1) % 4, - j2 = (j+2) % 4, - j3 = (j+3) % 4 - }; - return general_det3_helper(matrix, i1, i2, i3, j1, j2, j3) - + general_det3_helper(matrix, i2, i3, i1, j1, j2, j3) - + general_det3_helper(matrix, i3, i1, i2, j1, j2, j3); -} - -template -struct compute_inverse_size4 -{ - EIGEN_DEVICE_FUNC - static void run(const MatrixType& matrix, ResultType& result) - { - result.coeffRef(0,0) = cofactor_4x4(matrix); - result.coeffRef(1,0) = -cofactor_4x4(matrix); - result.coeffRef(2,0) = cofactor_4x4(matrix); - result.coeffRef(3,0) = -cofactor_4x4(matrix); - result.coeffRef(0,2) = cofactor_4x4(matrix); - result.coeffRef(1,2) = -cofactor_4x4(matrix); - result.coeffRef(2,2) = cofactor_4x4(matrix); - result.coeffRef(3,2) = -cofactor_4x4(matrix); - result.coeffRef(0,1) = -cofactor_4x4(matrix); - result.coeffRef(1,1) = cofactor_4x4(matrix); - result.coeffRef(2,1) = -cofactor_4x4(matrix); - result.coeffRef(3,1) = cofactor_4x4(matrix); - result.coeffRef(0,3) = -cofactor_4x4(matrix); - result.coeffRef(1,3) = cofactor_4x4(matrix); - result.coeffRef(2,3) = -cofactor_4x4(matrix); - result.coeffRef(3,3) = cofactor_4x4(matrix); - result /= (matrix.col(0).cwiseProduct(result.row(0).transpose())).sum(); - } -}; - -template -struct compute_inverse - : compute_inverse_size4 -{ -}; - -template -struct compute_inverse_and_det_with_check -{ - EIGEN_DEVICE_FUNC - static inline void run( - const MatrixType& matrix, - const typename MatrixType::RealScalar& absDeterminantThreshold, - ResultType& inverse, - typename ResultType::Scalar& determinant, - bool& invertible - ) - { - using std::abs; - determinant = matrix.determinant(); - invertible = abs(determinant) > absDeterminantThreshold; - if(invertible) compute_inverse::run(matrix, inverse); - } -}; - -/************************* -*** MatrixBase methods *** -*************************/ - -} // end namespace internal - -namespace internal { - -// Specialization for "dense = dense_xpr.inverse()" -template -struct Assignment, internal::assign_op, Dense2Dense> -{ - typedef Inverse SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - const int Size = EIGEN_PLAIN_ENUM_MIN(XprType::ColsAtCompileTime,DstXprType::ColsAtCompileTime); - EIGEN_ONLY_USED_FOR_DEBUG(Size); - eigen_assert(( (Size<=1) || (Size>4) || (extract_data(src.nestedExpression())!=extract_data(dst))) - && "Aliasing problem detected in inverse(), you need to do inverse().eval() here."); - - typedef typename internal::nested_eval::type ActualXprType; - typedef typename internal::remove_all::type ActualXprTypeCleanded; - - ActualXprType actual_xpr(src.nestedExpression()); - - compute_inverse::run(actual_xpr, dst); - } -}; - - -} // end namespace internal - -/** \lu_module - * - * \returns the matrix inverse of this matrix. - * - * For small fixed sizes up to 4x4, this method uses cofactors. - * In the general case, this method uses class PartialPivLU. - * - * \note This matrix must be invertible, otherwise the result is undefined. If you need an - * invertibility check, do the following: - * \li for fixed sizes up to 4x4, use computeInverseAndDetWithCheck(). - * \li for the general case, use class FullPivLU. - * - * Example: \include MatrixBase_inverse.cpp - * Output: \verbinclude MatrixBase_inverse.out - * - * \sa computeInverseAndDetWithCheck() - */ -template -inline const Inverse MatrixBase::inverse() const -{ - EIGEN_STATIC_ASSERT(!NumTraits::IsInteger,THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) - eigen_assert(rows() == cols()); - return Inverse(derived()); -} - -/** \lu_module - * - * Computation of matrix inverse and determinant, with invertibility check. - * - * This is only for fixed-size square matrices of size up to 4x4. - * - * \param inverse Reference to the matrix in which to store the inverse. - * \param determinant Reference to the variable in which to store the determinant. - * \param invertible Reference to the bool variable in which to store whether the matrix is invertible. - * \param absDeterminantThreshold Optional parameter controlling the invertibility check. - * The matrix will be declared invertible if the absolute value of its - * determinant is greater than this threshold. - * - * Example: \include MatrixBase_computeInverseAndDetWithCheck.cpp - * Output: \verbinclude MatrixBase_computeInverseAndDetWithCheck.out - * - * \sa inverse(), computeInverseWithCheck() - */ -template -template -inline void MatrixBase::computeInverseAndDetWithCheck( - ResultType& inverse, - typename ResultType::Scalar& determinant, - bool& invertible, - const RealScalar& absDeterminantThreshold - ) const -{ - // i'd love to put some static assertions there, but SFINAE means that they have no effect... - eigen_assert(rows() == cols()); - // for 2x2, it's worth giving a chance to avoid evaluating. - // for larger sizes, evaluating has negligible cost and limits code size. - typedef typename internal::conditional< - RowsAtCompileTime == 2, - typename internal::remove_all::type>::type, - PlainObject - >::type MatrixType; - internal::compute_inverse_and_det_with_check::run - (derived(), absDeterminantThreshold, inverse, determinant, invertible); -} - -/** \lu_module - * - * Computation of matrix inverse, with invertibility check. - * - * This is only for fixed-size square matrices of size up to 4x4. - * - * \param inverse Reference to the matrix in which to store the inverse. - * \param invertible Reference to the bool variable in which to store whether the matrix is invertible. - * \param absDeterminantThreshold Optional parameter controlling the invertibility check. - * The matrix will be declared invertible if the absolute value of its - * determinant is greater than this threshold. - * - * Example: \include MatrixBase_computeInverseWithCheck.cpp - * Output: \verbinclude MatrixBase_computeInverseWithCheck.out - * - * \sa inverse(), computeInverseAndDetWithCheck() - */ -template -template -inline void MatrixBase::computeInverseWithCheck( - ResultType& inverse, - bool& invertible, - const RealScalar& absDeterminantThreshold - ) const -{ - RealScalar determinant; - // i'd love to put some static assertions there, but SFINAE means that they have no effect... - eigen_assert(rows() == cols()); - computeInverseAndDetWithCheck(inverse,determinant,invertible,absDeterminantThreshold); -} - -} // end namespace Eigen - -#endif // EIGEN_INVERSE_IMPL_H diff --git a/Eigen/src/LU/PartialPivLU.h b/Eigen/src/LU/PartialPivLU.h deleted file mode 100644 index d43961887..000000000 --- a/Eigen/src/LU/PartialPivLU.h +++ /dev/null @@ -1,611 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2006-2009 Benoit Jacob -// Copyright (C) 2009 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PARTIALLU_H -#define EIGEN_PARTIALLU_H - -namespace Eigen { - -namespace internal { -template struct traits > - : traits<_MatrixType> -{ - typedef MatrixXpr XprKind; - typedef SolverStorage StorageKind; - typedef traits<_MatrixType> BaseTraits; - enum { - Flags = BaseTraits::Flags & RowMajorBit, - CoeffReadCost = Dynamic - }; -}; - -template -struct enable_if_ref; -// { -// typedef Derived type; -// }; - -template -struct enable_if_ref,Derived> { - typedef Derived type; -}; - -} // end namespace internal - -/** \ingroup LU_Module - * - * \class PartialPivLU - * - * \brief LU decomposition of a matrix with partial pivoting, and related features - * - * \tparam _MatrixType the type of the matrix of which we are computing the LU decomposition - * - * This class represents a LU decomposition of a \b square \b invertible matrix, with partial pivoting: the matrix A - * is decomposed as A = PLU where L is unit-lower-triangular, U is upper-triangular, and P - * is a permutation matrix. - * - * Typically, partial pivoting LU decomposition is only considered numerically stable for square invertible - * matrices. Thus LAPACK's dgesv and dgesvx require the matrix to be square and invertible. The present class - * does the same. It will assert that the matrix is square, but it won't (actually it can't) check that the - * matrix is invertible: it is your task to check that you only use this decomposition on invertible matrices. - * - * The guaranteed safe alternative, working for all matrices, is the full pivoting LU decomposition, provided - * by class FullPivLU. - * - * This is \b not a rank-revealing LU decomposition. Many features are intentionally absent from this class, - * such as rank computation. If you need these features, use class FullPivLU. - * - * This LU decomposition is suitable to invert invertible matrices. It is what MatrixBase::inverse() uses - * in the general case. - * On the other hand, it is \b not suitable to determine whether a given matrix is invertible. - * - * The data of the LU decomposition can be directly accessed through the methods matrixLU(), permutationP(). - * - * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. - * - * \sa MatrixBase::partialPivLu(), MatrixBase::determinant(), MatrixBase::inverse(), MatrixBase::computeInverse(), class FullPivLU - */ -template class PartialPivLU - : public SolverBase > -{ - public: - - typedef _MatrixType MatrixType; - typedef SolverBase Base; - EIGEN_GENERIC_PUBLIC_INTERFACE(PartialPivLU) - // FIXME StorageIndex defined in EIGEN_GENERIC_PUBLIC_INTERFACE should be int - enum { - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef PermutationMatrix PermutationType; - typedef Transpositions TranspositionType; - typedef typename MatrixType::PlainObject PlainObject; - - /** - * \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via PartialPivLU::compute(const MatrixType&). - */ - PartialPivLU(); - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa PartialPivLU() - */ - explicit PartialPivLU(Index size); - - /** Constructor. - * - * \param matrix the matrix of which to compute the LU decomposition. - * - * \warning The matrix should have full rank (e.g. if it's square, it should be invertible). - * If you need to deal with non-full rank, use class FullPivLU instead. - */ - template - explicit PartialPivLU(const EigenBase& matrix); - - /** Constructor for \link InplaceDecomposition inplace decomposition \endlink - * - * \param matrix the matrix of which to compute the LU decomposition. - * - * \warning The matrix should have full rank (e.g. if it's square, it should be invertible). - * If you need to deal with non-full rank, use class FullPivLU instead. - */ - template - explicit PartialPivLU(EigenBase& matrix); - - template - PartialPivLU& compute(const EigenBase& matrix) { - m_lu = matrix.derived(); - compute(); - return *this; - } - - /** \returns the LU decomposition matrix: the upper-triangular part is U, the - * unit-lower-triangular part is L (at least for square matrices; in the non-square - * case, special care is needed, see the documentation of class FullPivLU). - * - * \sa matrixL(), matrixU() - */ - inline const MatrixType& matrixLU() const - { - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return m_lu; - } - - /** \returns the permutation matrix P. - */ - inline const PermutationType& permutationP() const - { - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return m_p; - } - - /** This method returns the solution x to the equation Ax=b, where A is the matrix of which - * *this is the LU decomposition. - * - * \param b the right-hand-side of the equation to solve. Can be a vector or a matrix, - * the only requirement in order for the equation to make sense is that - * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition. - * - * \returns the solution. - * - * Example: \include PartialPivLU_solve.cpp - * Output: \verbinclude PartialPivLU_solve.out - * - * Since this PartialPivLU class assumes anyway that the matrix A is invertible, the solution - * theoretically exists and is unique regardless of b. - * - * \sa TriangularView::solve(), inverse(), computeInverse() - */ - // FIXME this is a copy-paste of the base-class member to add the isInitialized assertion. - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return Solve(*this, b.derived()); - } - - /** \returns an estimate of the reciprocal condition number of the matrix of which \c *this is - the LU decomposition. - */ - inline RealScalar rcond() const - { - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return internal::rcond_estimate_helper(m_l1_norm, *this); - } - - /** \returns the inverse of the matrix of which *this is the LU decomposition. - * - * \warning The matrix being decomposed here is assumed to be invertible. If you need to check for - * invertibility, use class FullPivLU instead. - * - * \sa MatrixBase::inverse(), LU::inverse() - */ - inline const Inverse inverse() const - { - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return Inverse(*this); - } - - /** \returns the determinant of the matrix of which - * *this is the LU decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the LU decomposition has already been computed. - * - * \note For fixed-size matrices of size up to 4, MatrixBase::determinant() offers - * optimized paths. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * - * \sa MatrixBase::determinant() - */ - Scalar determinant() const; - - MatrixType reconstructedMatrix() const; - - inline Index rows() const { return m_lu.rows(); } - inline Index cols() const { return m_lu.cols(); } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - EIGEN_DEVICE_FUNC - void _solve_impl(const RhsType &rhs, DstType &dst) const { - /* The decomposition PA = LU can be rewritten as A = P^{-1} L U. - * So we proceed as follows: - * Step 1: compute c = Pb. - * Step 2: replace c by the solution x to Lx = c. - * Step 3: replace c by the solution x to Ux = c. - */ - - eigen_assert(rhs.rows() == m_lu.rows()); - - // Step 1 - dst = permutationP() * rhs; - - // Step 2 - m_lu.template triangularView().solveInPlace(dst); - - // Step 3 - m_lu.template triangularView().solveInPlace(dst); - } - - template - EIGEN_DEVICE_FUNC - void _solve_impl_transposed(const RhsType &rhs, DstType &dst) const { - /* The decomposition PA = LU can be rewritten as A = P^{-1} L U. - * So we proceed as follows: - * Step 1: compute c = Pb. - * Step 2: replace c by the solution x to Lx = c. - * Step 3: replace c by the solution x to Ux = c. - */ - - eigen_assert(rhs.rows() == m_lu.cols()); - - if (Conjugate) { - // Step 1 - dst = m_lu.template triangularView().adjoint().solve(rhs); - // Step 2 - m_lu.template triangularView().adjoint().solveInPlace(dst); - } else { - // Step 1 - dst = m_lu.template triangularView().transpose().solve(rhs); - // Step 2 - m_lu.template triangularView().transpose().solveInPlace(dst); - } - // Step 3 - dst = permutationP().transpose() * dst; - } - #endif - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - void compute(); - - MatrixType m_lu; - PermutationType m_p; - TranspositionType m_rowsTranspositions; - RealScalar m_l1_norm; - signed char m_det_p; - bool m_isInitialized; -}; - -template -PartialPivLU::PartialPivLU() - : m_lu(), - m_p(), - m_rowsTranspositions(), - m_l1_norm(0), - m_det_p(0), - m_isInitialized(false) -{ -} - -template -PartialPivLU::PartialPivLU(Index size) - : m_lu(size, size), - m_p(size), - m_rowsTranspositions(size), - m_l1_norm(0), - m_det_p(0), - m_isInitialized(false) -{ -} - -template -template -PartialPivLU::PartialPivLU(const EigenBase& matrix) - : m_lu(matrix.rows(),matrix.cols()), - m_p(matrix.rows()), - m_rowsTranspositions(matrix.rows()), - m_l1_norm(0), - m_det_p(0), - m_isInitialized(false) -{ - compute(matrix.derived()); -} - -template -template -PartialPivLU::PartialPivLU(EigenBase& matrix) - : m_lu(matrix.derived()), - m_p(matrix.rows()), - m_rowsTranspositions(matrix.rows()), - m_l1_norm(0), - m_det_p(0), - m_isInitialized(false) -{ - compute(); -} - -namespace internal { - -/** \internal This is the blocked version of fullpivlu_unblocked() */ -template -struct partial_lu_impl -{ - // FIXME add a stride to Map, so that the following mapping becomes easier, - // another option would be to create an expression being able to automatically - // warp any Map, Matrix, and Block expressions as a unique type, but since that's exactly - // a Map + stride, why not adding a stride to Map, and convenient ctors from a Matrix, - // and Block. - typedef Map > MapLU; - typedef Block MatrixType; - typedef Block BlockType; - typedef typename MatrixType::RealScalar RealScalar; - - /** \internal performs the LU decomposition in-place of the matrix \a lu - * using an unblocked algorithm. - * - * In addition, this function returns the row transpositions in the - * vector \a row_transpositions which must have a size equal to the number - * of columns of the matrix \a lu, and an integer \a nb_transpositions - * which returns the actual number of transpositions. - * - * \returns The index of the first pivot which is exactly zero if any, or a negative number otherwise. - */ - static Index unblocked_lu(MatrixType& lu, PivIndex* row_transpositions, PivIndex& nb_transpositions) - { - typedef scalar_score_coeff_op Scoring; - typedef typename Scoring::result_type Score; - const Index rows = lu.rows(); - const Index cols = lu.cols(); - const Index size = (std::min)(rows,cols); - nb_transpositions = 0; - Index first_zero_pivot = -1; - for(Index k = 0; k < size; ++k) - { - Index rrows = rows-k-1; - Index rcols = cols-k-1; - - Index row_of_biggest_in_col; - Score biggest_in_corner - = lu.col(k).tail(rows-k).unaryExpr(Scoring()).maxCoeff(&row_of_biggest_in_col); - row_of_biggest_in_col += k; - - row_transpositions[k] = PivIndex(row_of_biggest_in_col); - - if(biggest_in_corner != Score(0)) - { - if(k != row_of_biggest_in_col) - { - lu.row(k).swap(lu.row(row_of_biggest_in_col)); - ++nb_transpositions; - } - - // FIXME shall we introduce a safe quotient expression in cas 1/lu.coeff(k,k) - // overflow but not the actual quotient? - lu.col(k).tail(rrows) /= lu.coeff(k,k); - } - else if(first_zero_pivot==-1) - { - // the pivot is exactly zero, we record the index of the first pivot which is exactly 0, - // and continue the factorization such we still have A = PLU - first_zero_pivot = k; - } - - if(k > > - */ - static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256) - { - MapLU lu1(lu_data,StorageOrder==RowMajor?rows:luStride,StorageOrder==RowMajor?luStride:cols); - MatrixType lu(lu1,0,0,rows,cols); - - const Index size = (std::min)(rows,cols); - - // if the matrix is too small, no blocking: - if(size<=16) - { - return unblocked_lu(lu, row_transpositions, nb_transpositions); - } - - // automatically adjust the number of subdivisions to the size - // of the matrix so that there is enough sub blocks: - Index blockSize; - { - blockSize = size/8; - blockSize = (blockSize/16)*16; - blockSize = (std::min)((std::max)(blockSize,Index(8)), maxBlockSize); - } - - nb_transpositions = 0; - Index first_zero_pivot = -1; - for(Index k = 0; k < size; k+=blockSize) - { - Index bs = (std::min)(size-k,blockSize); // actual size of the block - Index trows = rows - k - bs; // trailing rows - Index tsize = size - k - bs; // trailing size - - // partition the matrix: - // A00 | A01 | A02 - // lu = A_0 | A_1 | A_2 = A10 | A11 | A12 - // A20 | A21 | A22 - BlockType A_0(lu,0,0,rows,k); - BlockType A_2(lu,0,k+bs,rows,tsize); - BlockType A11(lu,k,k,bs,bs); - BlockType A12(lu,k,k+bs,bs,tsize); - BlockType A21(lu,k+bs,k,trows,bs); - BlockType A22(lu,k+bs,k+bs,trows,tsize); - - PivIndex nb_transpositions_in_panel; - // recursively call the blocked LU algorithm on [A11^T A21^T]^T - // with a very small blocking size: - Index ret = blocked_lu(trows+bs, bs, &lu.coeffRef(k,k), luStride, - row_transpositions+k, nb_transpositions_in_panel, 16); - if(ret>=0 && first_zero_pivot==-1) - first_zero_pivot = k+ret; - - nb_transpositions += nb_transpositions_in_panel; - // update permutations and apply them to A_0 - for(Index i=k; i(k)); - A_0.row(i).swap(A_0.row(piv)); - } - - if(trows) - { - // apply permutations to A_2 - for(Index i=k;i().solveInPlace(A12); - - A22.noalias() -= A21 * A12; - } - } - return first_zero_pivot; - } -}; - -/** \internal performs the LU decomposition with partial pivoting in-place. - */ -template -void partial_lu_inplace(MatrixType& lu, TranspositionType& row_transpositions, typename TranspositionType::StorageIndex& nb_transpositions) -{ - eigen_assert(lu.cols() == row_transpositions.size()); - eigen_assert((&row_transpositions.coeffRef(1)-&row_transpositions.coeffRef(0)) == 1); - - partial_lu_impl - - ::blocked_lu(lu.rows(), lu.cols(), &lu.coeffRef(0,0), lu.outerStride(), &row_transpositions.coeffRef(0), nb_transpositions); -} - -} // end namespace internal - -template -void PartialPivLU::compute() -{ - check_template_parameters(); - - // the row permutation is stored as int indices, so just to be sure: - eigen_assert(m_lu.rows()::highest()); - - m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff(); - - eigen_assert(m_lu.rows() == m_lu.cols() && "PartialPivLU is only for square (and moreover invertible) matrices"); - const Index size = m_lu.rows(); - - m_rowsTranspositions.resize(size); - - typename TranspositionType::StorageIndex nb_transpositions; - internal::partial_lu_inplace(m_lu, m_rowsTranspositions, nb_transpositions); - m_det_p = (nb_transpositions%2) ? -1 : 1; - - m_p = m_rowsTranspositions; - - m_isInitialized = true; -} - -template -typename PartialPivLU::Scalar PartialPivLU::determinant() const -{ - eigen_assert(m_isInitialized && "PartialPivLU is not initialized."); - return Scalar(m_det_p) * m_lu.diagonal().prod(); -} - -/** \returns the matrix represented by the decomposition, - * i.e., it returns the product: P^{-1} L U. - * This function is provided for debug purpose. */ -template -MatrixType PartialPivLU::reconstructedMatrix() const -{ - eigen_assert(m_isInitialized && "LU is not initialized."); - // LU - MatrixType res = m_lu.template triangularView().toDenseMatrix() - * m_lu.template triangularView(); - - // P^{-1}(LU) - res = m_p.inverse() * res; - - return res; -} - -/***** Implementation details *****************************************************/ - -namespace internal { - -/***** Implementation of inverse() *****************************************************/ -template -struct Assignment >, internal::assign_op::Scalar>, Dense2Dense> -{ - typedef PartialPivLU LuType; - typedef Inverse SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); - } -}; -} // end namespace internal - -/******** MatrixBase methods *******/ - -/** \lu_module - * - * \return the partial-pivoting LU decomposition of \c *this. - * - * \sa class PartialPivLU - */ -template -inline const PartialPivLU::PlainObject> -MatrixBase::partialPivLu() const -{ - return PartialPivLU(eval()); -} - -/** \lu_module - * - * Synonym of partialPivLu(). - * - * \return the partial-pivoting LU decomposition of \c *this. - * - * \sa class PartialPivLU - */ -template -inline const PartialPivLU::PlainObject> -MatrixBase::lu() const -{ - return PartialPivLU(eval()); -} - -} // end namespace Eigen - -#endif // EIGEN_PARTIALLU_H diff --git a/Eigen/src/LU/PartialPivLU_LAPACKE.h b/Eigen/src/LU/PartialPivLU_LAPACKE.h deleted file mode 100644 index 755168a94..000000000 --- a/Eigen/src/LU/PartialPivLU_LAPACKE.h +++ /dev/null @@ -1,83 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to LAPACKe - * LU decomposition with partial pivoting based on LAPACKE_?getrf function. - ******************************************************************************** -*/ - -#ifndef EIGEN_PARTIALLU_LAPACK_H -#define EIGEN_PARTIALLU_LAPACK_H - -namespace Eigen { - -namespace internal { - -/** \internal Specialization for the data types supported by LAPACKe */ - -#define EIGEN_LAPACKE_LU_PARTPIV(EIGTYPE, LAPACKE_TYPE, LAPACKE_PREFIX) \ -template \ -struct partial_lu_impl \ -{ \ - /* \internal performs the LU decomposition in-place of the matrix represented */ \ - static lapack_int blocked_lu(Index rows, Index cols, EIGTYPE* lu_data, Index luStride, lapack_int* row_transpositions, lapack_int& nb_transpositions, lapack_int maxBlockSize=256) \ - { \ - EIGEN_UNUSED_VARIABLE(maxBlockSize);\ - lapack_int matrix_order, first_zero_pivot; \ - lapack_int m, n, lda, *ipiv, info; \ - EIGTYPE* a; \ -/* Set up parameters for ?getrf */ \ - matrix_order = StorageOrder==RowMajor ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR; \ - lda = convert_index(luStride); \ - a = lu_data; \ - ipiv = row_transpositions; \ - m = convert_index(rows); \ - n = convert_index(cols); \ - nb_transpositions = 0; \ -\ - info = LAPACKE_##LAPACKE_PREFIX##getrf( matrix_order, m, n, (LAPACKE_TYPE*)a, lda, ipiv ); \ -\ - for(int i=0;i= 0); \ -/* something should be done with nb_transpositions */ \ -\ - first_zero_pivot = info; \ - return first_zero_pivot; \ - } \ -}; - -EIGEN_LAPACKE_LU_PARTPIV(double, double, d) -EIGEN_LAPACKE_LU_PARTPIV(float, float, s) -EIGEN_LAPACKE_LU_PARTPIV(dcomplex, lapack_complex_double, z) -EIGEN_LAPACKE_LU_PARTPIV(scomplex, lapack_complex_float, c) - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_PARTIALLU_LAPACK_H diff --git a/Eigen/src/LU/arch/Inverse_SSE.h b/Eigen/src/LU/arch/Inverse_SSE.h deleted file mode 100644 index ebb64a62b..000000000 --- a/Eigen/src/LU/arch/Inverse_SSE.h +++ /dev/null @@ -1,338 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2001 Intel Corporation -// Copyright (C) 2010 Gael Guennebaud -// Copyright (C) 2009 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -// The SSE code for the 4x4 float and double matrix inverse in this file -// comes from the following Intel's library: -// http://software.intel.com/en-us/articles/optimized-matrix-library-for-use-with-the-intel-pentiumr-4-processors-sse2-instructions/ -// -// Here is the respective copyright and license statement: -// -// Copyright (c) 2001 Intel Corporation. -// -// Permition is granted to use, copy, distribute and prepare derivative works -// of this library for any purpose and without fee, provided, that the above -// copyright notice and this statement appear in all copies. -// Intel makes no representations about the suitability of this software for -// any purpose, and specifically disclaims all warranties. -// See LEGAL.TXT for all the legal information. - -#ifndef EIGEN_INVERSE_SSE_H -#define EIGEN_INVERSE_SSE_H - -namespace Eigen { - -namespace internal { - -template -struct compute_inverse_size4 -{ - enum { - MatrixAlignment = traits::Alignment, - ResultAlignment = traits::Alignment, - StorageOrdersMatch = (MatrixType::Flags&RowMajorBit) == (ResultType::Flags&RowMajorBit) - }; - typedef typename conditional<(MatrixType::Flags&LinearAccessBit),MatrixType const &,typename MatrixType::PlainObject>::type ActualMatrixType; - - static void run(const MatrixType& mat, ResultType& result) - { - ActualMatrixType matrix(mat); - EIGEN_ALIGN16 const unsigned int _Sign_PNNP[4] = { 0x00000000, 0x80000000, 0x80000000, 0x00000000 }; - - // Load the full matrix into registers - __m128 _L1 = matrix.template packet( 0); - __m128 _L2 = matrix.template packet( 4); - __m128 _L3 = matrix.template packet( 8); - __m128 _L4 = matrix.template packet(12); - - // The inverse is calculated using "Divide and Conquer" technique. The - // original matrix is divide into four 2x2 sub-matrices. Since each - // register holds four matrix element, the smaller matrices are - // represented as a registers. Hence we get a better locality of the - // calculations. - - __m128 A, B, C, D; // the four sub-matrices - if(!StorageOrdersMatch) - { - A = _mm_unpacklo_ps(_L1, _L2); - B = _mm_unpacklo_ps(_L3, _L4); - C = _mm_unpackhi_ps(_L1, _L2); - D = _mm_unpackhi_ps(_L3, _L4); - } - else - { - A = _mm_movelh_ps(_L1, _L2); - B = _mm_movehl_ps(_L2, _L1); - C = _mm_movelh_ps(_L3, _L4); - D = _mm_movehl_ps(_L4, _L3); - } - - __m128 iA, iB, iC, iD, // partial inverse of the sub-matrices - DC, AB; - __m128 dA, dB, dC, dD; // determinant of the sub-matrices - __m128 det, d, d1, d2; - __m128 rd; // reciprocal of the determinant - - // AB = A# * B - AB = _mm_mul_ps(_mm_shuffle_ps(A,A,0x0F), B); - AB = _mm_sub_ps(AB,_mm_mul_ps(_mm_shuffle_ps(A,A,0xA5), _mm_shuffle_ps(B,B,0x4E))); - // DC = D# * C - DC = _mm_mul_ps(_mm_shuffle_ps(D,D,0x0F), C); - DC = _mm_sub_ps(DC,_mm_mul_ps(_mm_shuffle_ps(D,D,0xA5), _mm_shuffle_ps(C,C,0x4E))); - - // dA = |A| - dA = _mm_mul_ps(_mm_shuffle_ps(A, A, 0x5F),A); - dA = _mm_sub_ss(dA, _mm_movehl_ps(dA,dA)); - // dB = |B| - dB = _mm_mul_ps(_mm_shuffle_ps(B, B, 0x5F),B); - dB = _mm_sub_ss(dB, _mm_movehl_ps(dB,dB)); - - // dC = |C| - dC = _mm_mul_ps(_mm_shuffle_ps(C, C, 0x5F),C); - dC = _mm_sub_ss(dC, _mm_movehl_ps(dC,dC)); - // dD = |D| - dD = _mm_mul_ps(_mm_shuffle_ps(D, D, 0x5F),D); - dD = _mm_sub_ss(dD, _mm_movehl_ps(dD,dD)); - - // d = trace(AB*DC) = trace(A#*B*D#*C) - d = _mm_mul_ps(_mm_shuffle_ps(DC,DC,0xD8),AB); - - // iD = C*A#*B - iD = _mm_mul_ps(_mm_shuffle_ps(C,C,0xA0), _mm_movelh_ps(AB,AB)); - iD = _mm_add_ps(iD,_mm_mul_ps(_mm_shuffle_ps(C,C,0xF5), _mm_movehl_ps(AB,AB))); - // iA = B*D#*C - iA = _mm_mul_ps(_mm_shuffle_ps(B,B,0xA0), _mm_movelh_ps(DC,DC)); - iA = _mm_add_ps(iA,_mm_mul_ps(_mm_shuffle_ps(B,B,0xF5), _mm_movehl_ps(DC,DC))); - - // d = trace(AB*DC) = trace(A#*B*D#*C) [continue] - d = _mm_add_ps(d, _mm_movehl_ps(d, d)); - d = _mm_add_ss(d, _mm_shuffle_ps(d, d, 1)); - d1 = _mm_mul_ss(dA,dD); - d2 = _mm_mul_ss(dB,dC); - - // iD = D*|A| - C*A#*B - iD = _mm_sub_ps(_mm_mul_ps(D,_mm_shuffle_ps(dA,dA,0)), iD); - - // iA = A*|D| - B*D#*C; - iA = _mm_sub_ps(_mm_mul_ps(A,_mm_shuffle_ps(dD,dD,0)), iA); - - // det = |A|*|D| + |B|*|C| - trace(A#*B*D#*C) - det = _mm_sub_ss(_mm_add_ss(d1,d2),d); - rd = _mm_div_ss(_mm_set_ss(1.0f), det); - -// #ifdef ZERO_SINGULAR -// rd = _mm_and_ps(_mm_cmpneq_ss(det,_mm_setzero_ps()), rd); -// #endif - - // iB = D * (A#B)# = D*B#*A - iB = _mm_mul_ps(D, _mm_shuffle_ps(AB,AB,0x33)); - iB = _mm_sub_ps(iB, _mm_mul_ps(_mm_shuffle_ps(D,D,0xB1), _mm_shuffle_ps(AB,AB,0x66))); - // iC = A * (D#C)# = A*C#*D - iC = _mm_mul_ps(A, _mm_shuffle_ps(DC,DC,0x33)); - iC = _mm_sub_ps(iC, _mm_mul_ps(_mm_shuffle_ps(A,A,0xB1), _mm_shuffle_ps(DC,DC,0x66))); - - rd = _mm_shuffle_ps(rd,rd,0); - rd = _mm_xor_ps(rd, _mm_load_ps((float*)_Sign_PNNP)); - - // iB = C*|B| - D*B#*A - iB = _mm_sub_ps(_mm_mul_ps(C,_mm_shuffle_ps(dB,dB,0)), iB); - - // iC = B*|C| - A*C#*D; - iC = _mm_sub_ps(_mm_mul_ps(B,_mm_shuffle_ps(dC,dC,0)), iC); - - // iX = iX / det - iA = _mm_mul_ps(rd,iA); - iB = _mm_mul_ps(rd,iB); - iC = _mm_mul_ps(rd,iC); - iD = _mm_mul_ps(rd,iD); - - Index res_stride = result.outerStride(); - float* res = result.data(); - pstoret(res+0, _mm_shuffle_ps(iA,iB,0x77)); - pstoret(res+res_stride, _mm_shuffle_ps(iA,iB,0x22)); - pstoret(res+2*res_stride, _mm_shuffle_ps(iC,iD,0x77)); - pstoret(res+3*res_stride, _mm_shuffle_ps(iC,iD,0x22)); - } - -}; - -template -struct compute_inverse_size4 -{ - enum { - MatrixAlignment = traits::Alignment, - ResultAlignment = traits::Alignment, - StorageOrdersMatch = (MatrixType::Flags&RowMajorBit) == (ResultType::Flags&RowMajorBit) - }; - typedef typename conditional<(MatrixType::Flags&LinearAccessBit),MatrixType const &,typename MatrixType::PlainObject>::type ActualMatrixType; - - static void run(const MatrixType& mat, ResultType& result) - { - ActualMatrixType matrix(mat); - const __m128d _Sign_NP = _mm_castsi128_pd(_mm_set_epi32(0x0,0x0,0x80000000,0x0)); - const __m128d _Sign_PN = _mm_castsi128_pd(_mm_set_epi32(0x80000000,0x0,0x0,0x0)); - - // The inverse is calculated using "Divide and Conquer" technique. The - // original matrix is divide into four 2x2 sub-matrices. Since each - // register of the matrix holds two elements, the smaller matrices are - // consisted of two registers. Hence we get a better locality of the - // calculations. - - // the four sub-matrices - __m128d A1, A2, B1, B2, C1, C2, D1, D2; - - if(StorageOrdersMatch) - { - A1 = matrix.template packet( 0); B1 = matrix.template packet( 2); - A2 = matrix.template packet( 4); B2 = matrix.template packet( 6); - C1 = matrix.template packet( 8); D1 = matrix.template packet(10); - C2 = matrix.template packet(12); D2 = matrix.template packet(14); - } - else - { - __m128d tmp; - A1 = matrix.template packet( 0); C1 = matrix.template packet( 2); - A2 = matrix.template packet( 4); C2 = matrix.template packet( 6); - tmp = A1; - A1 = _mm_unpacklo_pd(A1,A2); - A2 = _mm_unpackhi_pd(tmp,A2); - tmp = C1; - C1 = _mm_unpacklo_pd(C1,C2); - C2 = _mm_unpackhi_pd(tmp,C2); - - B1 = matrix.template packet( 8); D1 = matrix.template packet(10); - B2 = matrix.template packet(12); D2 = matrix.template packet(14); - tmp = B1; - B1 = _mm_unpacklo_pd(B1,B2); - B2 = _mm_unpackhi_pd(tmp,B2); - tmp = D1; - D1 = _mm_unpacklo_pd(D1,D2); - D2 = _mm_unpackhi_pd(tmp,D2); - } - - __m128d iA1, iA2, iB1, iB2, iC1, iC2, iD1, iD2, // partial invese of the sub-matrices - DC1, DC2, AB1, AB2; - __m128d dA, dB, dC, dD; // determinant of the sub-matrices - __m128d det, d1, d2, rd; - - // dA = |A| - dA = _mm_shuffle_pd(A2, A2, 1); - dA = _mm_mul_pd(A1, dA); - dA = _mm_sub_sd(dA, _mm_shuffle_pd(dA,dA,3)); - // dB = |B| - dB = _mm_shuffle_pd(B2, B2, 1); - dB = _mm_mul_pd(B1, dB); - dB = _mm_sub_sd(dB, _mm_shuffle_pd(dB,dB,3)); - - // AB = A# * B - AB1 = _mm_mul_pd(B1, _mm_shuffle_pd(A2,A2,3)); - AB2 = _mm_mul_pd(B2, _mm_shuffle_pd(A1,A1,0)); - AB1 = _mm_sub_pd(AB1, _mm_mul_pd(B2, _mm_shuffle_pd(A1,A1,3))); - AB2 = _mm_sub_pd(AB2, _mm_mul_pd(B1, _mm_shuffle_pd(A2,A2,0))); - - // dC = |C| - dC = _mm_shuffle_pd(C2, C2, 1); - dC = _mm_mul_pd(C1, dC); - dC = _mm_sub_sd(dC, _mm_shuffle_pd(dC,dC,3)); - // dD = |D| - dD = _mm_shuffle_pd(D2, D2, 1); - dD = _mm_mul_pd(D1, dD); - dD = _mm_sub_sd(dD, _mm_shuffle_pd(dD,dD,3)); - - // DC = D# * C - DC1 = _mm_mul_pd(C1, _mm_shuffle_pd(D2,D2,3)); - DC2 = _mm_mul_pd(C2, _mm_shuffle_pd(D1,D1,0)); - DC1 = _mm_sub_pd(DC1, _mm_mul_pd(C2, _mm_shuffle_pd(D1,D1,3))); - DC2 = _mm_sub_pd(DC2, _mm_mul_pd(C1, _mm_shuffle_pd(D2,D2,0))); - - // rd = trace(AB*DC) = trace(A#*B*D#*C) - d1 = _mm_mul_pd(AB1, _mm_shuffle_pd(DC1, DC2, 0)); - d2 = _mm_mul_pd(AB2, _mm_shuffle_pd(DC1, DC2, 3)); - rd = _mm_add_pd(d1, d2); - rd = _mm_add_sd(rd, _mm_shuffle_pd(rd, rd,3)); - - // iD = C*A#*B - iD1 = _mm_mul_pd(AB1, _mm_shuffle_pd(C1,C1,0)); - iD2 = _mm_mul_pd(AB1, _mm_shuffle_pd(C2,C2,0)); - iD1 = _mm_add_pd(iD1, _mm_mul_pd(AB2, _mm_shuffle_pd(C1,C1,3))); - iD2 = _mm_add_pd(iD2, _mm_mul_pd(AB2, _mm_shuffle_pd(C2,C2,3))); - - // iA = B*D#*C - iA1 = _mm_mul_pd(DC1, _mm_shuffle_pd(B1,B1,0)); - iA2 = _mm_mul_pd(DC1, _mm_shuffle_pd(B2,B2,0)); - iA1 = _mm_add_pd(iA1, _mm_mul_pd(DC2, _mm_shuffle_pd(B1,B1,3))); - iA2 = _mm_add_pd(iA2, _mm_mul_pd(DC2, _mm_shuffle_pd(B2,B2,3))); - - // iD = D*|A| - C*A#*B - dA = _mm_shuffle_pd(dA,dA,0); - iD1 = _mm_sub_pd(_mm_mul_pd(D1, dA), iD1); - iD2 = _mm_sub_pd(_mm_mul_pd(D2, dA), iD2); - - // iA = A*|D| - B*D#*C; - dD = _mm_shuffle_pd(dD,dD,0); - iA1 = _mm_sub_pd(_mm_mul_pd(A1, dD), iA1); - iA2 = _mm_sub_pd(_mm_mul_pd(A2, dD), iA2); - - d1 = _mm_mul_sd(dA, dD); - d2 = _mm_mul_sd(dB, dC); - - // iB = D * (A#B)# = D*B#*A - iB1 = _mm_mul_pd(D1, _mm_shuffle_pd(AB2,AB1,1)); - iB2 = _mm_mul_pd(D2, _mm_shuffle_pd(AB2,AB1,1)); - iB1 = _mm_sub_pd(iB1, _mm_mul_pd(_mm_shuffle_pd(D1,D1,1), _mm_shuffle_pd(AB2,AB1,2))); - iB2 = _mm_sub_pd(iB2, _mm_mul_pd(_mm_shuffle_pd(D2,D2,1), _mm_shuffle_pd(AB2,AB1,2))); - - // det = |A|*|D| + |B|*|C| - trace(A#*B*D#*C) - det = _mm_add_sd(d1, d2); - det = _mm_sub_sd(det, rd); - - // iC = A * (D#C)# = A*C#*D - iC1 = _mm_mul_pd(A1, _mm_shuffle_pd(DC2,DC1,1)); - iC2 = _mm_mul_pd(A2, _mm_shuffle_pd(DC2,DC1,1)); - iC1 = _mm_sub_pd(iC1, _mm_mul_pd(_mm_shuffle_pd(A1,A1,1), _mm_shuffle_pd(DC2,DC1,2))); - iC2 = _mm_sub_pd(iC2, _mm_mul_pd(_mm_shuffle_pd(A2,A2,1), _mm_shuffle_pd(DC2,DC1,2))); - - rd = _mm_div_sd(_mm_set_sd(1.0), det); -// #ifdef ZERO_SINGULAR -// rd = _mm_and_pd(_mm_cmpneq_sd(det,_mm_setzero_pd()), rd); -// #endif - rd = _mm_shuffle_pd(rd,rd,0); - - // iB = C*|B| - D*B#*A - dB = _mm_shuffle_pd(dB,dB,0); - iB1 = _mm_sub_pd(_mm_mul_pd(C1, dB), iB1); - iB2 = _mm_sub_pd(_mm_mul_pd(C2, dB), iB2); - - d1 = _mm_xor_pd(rd, _Sign_PN); - d2 = _mm_xor_pd(rd, _Sign_NP); - - // iC = B*|C| - A*C#*D; - dC = _mm_shuffle_pd(dC,dC,0); - iC1 = _mm_sub_pd(_mm_mul_pd(B1, dC), iC1); - iC2 = _mm_sub_pd(_mm_mul_pd(B2, dC), iC2); - - Index res_stride = result.outerStride(); - double* res = result.data(); - pstoret(res+0, _mm_mul_pd(_mm_shuffle_pd(iA2, iA1, 3), d1)); - pstoret(res+res_stride, _mm_mul_pd(_mm_shuffle_pd(iA2, iA1, 0), d2)); - pstoret(res+2, _mm_mul_pd(_mm_shuffle_pd(iB2, iB1, 3), d1)); - pstoret(res+res_stride+2, _mm_mul_pd(_mm_shuffle_pd(iB2, iB1, 0), d2)); - pstoret(res+2*res_stride, _mm_mul_pd(_mm_shuffle_pd(iC2, iC1, 3), d1)); - pstoret(res+3*res_stride, _mm_mul_pd(_mm_shuffle_pd(iC2, iC1, 0), d2)); - pstoret(res+2*res_stride+2,_mm_mul_pd(_mm_shuffle_pd(iD2, iD1, 3), d1)); - pstoret(res+3*res_stride+2,_mm_mul_pd(_mm_shuffle_pd(iD2, iD1, 0), d2)); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_INVERSE_SSE_H diff --git a/Eigen/src/MetisSupport/MetisSupport.h b/Eigen/src/MetisSupport/MetisSupport.h deleted file mode 100644 index 4c15304ad..000000000 --- a/Eigen/src/MetisSupport/MetisSupport.h +++ /dev/null @@ -1,137 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. -#ifndef METIS_SUPPORT_H -#define METIS_SUPPORT_H - -namespace Eigen { -/** - * Get the fill-reducing ordering from the METIS package - * - * If A is the original matrix and Ap is the permuted matrix, - * the fill-reducing permutation is defined as follows : - * Row (column) i of A is the matperm(i) row (column) of Ap. - * WARNING: As computed by METIS, this corresponds to the vector iperm (instead of perm) - */ -template -class MetisOrdering -{ -public: - typedef PermutationMatrix PermutationType; - typedef Matrix IndexVector; - - template - void get_symmetrized_graph(const MatrixType& A) - { - Index m = A.cols(); - eigen_assert((A.rows() == A.cols()) && "ONLY FOR SQUARED MATRICES"); - // Get the transpose of the input matrix - MatrixType At = A.transpose(); - // Get the number of nonzeros elements in each row/col of At+A - Index TotNz = 0; - IndexVector visited(m); - visited.setConstant(-1); - for (StorageIndex j = 0; j < m; j++) - { - // Compute the union structure of of A(j,:) and At(j,:) - visited(j) = j; // Do not include the diagonal element - // Get the nonzeros in row/column j of A - for (typename MatrixType::InnerIterator it(A, j); it; ++it) - { - Index idx = it.index(); // Get the row index (for column major) or column index (for row major) - if (visited(idx) != j ) - { - visited(idx) = j; - ++TotNz; - } - } - //Get the nonzeros in row/column j of At - for (typename MatrixType::InnerIterator it(At, j); it; ++it) - { - Index idx = it.index(); - if(visited(idx) != j) - { - visited(idx) = j; - ++TotNz; - } - } - } - // Reserve place for A + At - m_indexPtr.resize(m+1); - m_innerIndices.resize(TotNz); - - // Now compute the real adjacency list of each column/row - visited.setConstant(-1); - StorageIndex CurNz = 0; - for (StorageIndex j = 0; j < m; j++) - { - m_indexPtr(j) = CurNz; - - visited(j) = j; // Do not include the diagonal element - // Add the pattern of row/column j of A to A+At - for (typename MatrixType::InnerIterator it(A,j); it; ++it) - { - StorageIndex idx = it.index(); // Get the row index (for column major) or column index (for row major) - if (visited(idx) != j ) - { - visited(idx) = j; - m_innerIndices(CurNz) = idx; - CurNz++; - } - } - //Add the pattern of row/column j of At to A+At - for (typename MatrixType::InnerIterator it(At, j); it; ++it) - { - StorageIndex idx = it.index(); - if(visited(idx) != j) - { - visited(idx) = j; - m_innerIndices(CurNz) = idx; - ++CurNz; - } - } - } - m_indexPtr(m) = CurNz; - } - - template - void operator() (const MatrixType& A, PermutationType& matperm) - { - StorageIndex m = internal::convert_index(A.cols()); // must be StorageIndex, because it is passed by address to METIS - IndexVector perm(m),iperm(m); - // First, symmetrize the matrix graph. - get_symmetrized_graph(A); - int output_error; - - // Call the fill-reducing routine from METIS - output_error = METIS_NodeND(&m, m_indexPtr.data(), m_innerIndices.data(), NULL, NULL, perm.data(), iperm.data()); - - if(output_error != METIS_OK) - { - //FIXME The ordering interface should define a class of possible errors - std::cerr << "ERROR WHILE CALLING THE METIS PACKAGE \n"; - return; - } - - // Get the fill-reducing permutation - //NOTE: If Ap is the permuted matrix then perm and iperm vectors are defined as follows - // Row (column) i of Ap is the perm(i) row(column) of A, and row (column) i of A is the iperm(i) row(column) of Ap - - matperm.resize(m); - for (int j = 0; j < m; j++) - matperm.indices()(iperm(j)) = j; - - } - - protected: - IndexVector m_indexPtr; // Pointer to the adjacenccy list of each row/column - IndexVector m_innerIndices; // Adjacency list -}; - -}// end namespace eigen -#endif diff --git a/Eigen/src/OrderingMethods/Amd.h b/Eigen/src/OrderingMethods/Amd.h deleted file mode 100644 index f91ecb24e..000000000 --- a/Eigen/src/OrderingMethods/Amd.h +++ /dev/null @@ -1,445 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Gael Guennebaud - -/* - -NOTE: this routine has been adapted from the CSparse library: - -Copyright (c) 2006, Timothy A. Davis. -http://www.suitesparse.com - -CSparse is free software; you can redistribute it and/or -modify it under the terms of the GNU Lesser General Public -License as published by the Free Software Foundation; either -version 2.1 of the License, or (at your option) any later version. - -CSparse 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 -Lesser General Public License for more details. - -You should have received a copy of the GNU Lesser General Public -License along with this Module; if not, write to the Free Software -Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA - -*/ - -#include "../Core/util/NonMPL2.h" - -#ifndef EIGEN_SPARSE_AMD_H -#define EIGEN_SPARSE_AMD_H - -namespace Eigen { - -namespace internal { - -template inline T amd_flip(const T& i) { return -i-2; } -template inline T amd_unflip(const T& i) { return i<0 ? amd_flip(i) : i; } -template inline bool amd_marked(const T0* w, const T1& j) { return w[j]<0; } -template inline void amd_mark(const T0* w, const T1& j) { return w[j] = amd_flip(w[j]); } - -/* clear w */ -template -static StorageIndex cs_wclear (StorageIndex mark, StorageIndex lemax, StorageIndex *w, StorageIndex n) -{ - StorageIndex k; - if(mark < 2 || (mark + lemax < 0)) - { - for(k = 0; k < n; k++) - if(w[k] != 0) - w[k] = 1; - mark = 2; - } - return (mark); /* at this point, w[0..n-1] < mark holds */ -} - -/* depth-first search and postorder of a tree rooted at node j */ -template -StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex *head, const StorageIndex *next, StorageIndex *post, StorageIndex *stack) -{ - StorageIndex i, p, top = 0; - if(!head || !next || !post || !stack) return (-1); /* check inputs */ - stack[0] = j; /* place j on the stack */ - while (top >= 0) /* while (stack is not empty) */ - { - p = stack[top]; /* p = top of stack */ - i = head[p]; /* i = youngest child of p */ - if(i == -1) - { - top--; /* p has no unordered children left */ - post[k++] = p; /* node p is the kth postordered node */ - } - else - { - head[p] = next[i]; /* remove i from children of p */ - stack[++top] = i; /* start dfs on child node i */ - } - } - return k; -} - - -/** \internal - * \ingroup OrderingMethods_Module - * Approximate minimum degree ordering algorithm. - * - * \param[in] C the input selfadjoint matrix stored in compressed column major format. - * \param[out] perm the permutation P reducing the fill-in of the input matrix \a C - * - * Note that the input matrix \a C must be complete, that is both the upper and lower parts have to be stored, as well as the diagonal entries. - * On exit the values of C are destroyed */ -template -void minimum_degree_ordering(SparseMatrix& C, PermutationMatrix& perm) -{ - using std::sqrt; - - StorageIndex d, dk, dext, lemax = 0, e, elenk, eln, i, j, k, k1, - k2, k3, jlast, ln, dense, nzmax, mindeg = 0, nvi, nvj, nvk, mark, wnvi, - ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t, h; - - StorageIndex n = StorageIndex(C.cols()); - dense = std::max (16, StorageIndex(10 * sqrt(double(n)))); /* find dense threshold */ - dense = (std::min)(n-2, dense); - - StorageIndex cnz = StorageIndex(C.nonZeros()); - perm.resize(n+1); - t = cnz + cnz/5 + 2*n; /* add elbow room to C */ - C.resizeNonZeros(t); - - // get workspace - ei_declare_aligned_stack_constructed_variable(StorageIndex,W,8*(n+1),0); - StorageIndex* len = W; - StorageIndex* nv = W + (n+1); - StorageIndex* next = W + 2*(n+1); - StorageIndex* head = W + 3*(n+1); - StorageIndex* elen = W + 4*(n+1); - StorageIndex* degree = W + 5*(n+1); - StorageIndex* w = W + 6*(n+1); - StorageIndex* hhead = W + 7*(n+1); - StorageIndex* last = perm.indices().data(); /* use P as workspace for last */ - - /* --- Initialize quotient graph ---------------------------------------- */ - StorageIndex* Cp = C.outerIndexPtr(); - StorageIndex* Ci = C.innerIndexPtr(); - for(k = 0; k < n; k++) - len[k] = Cp[k+1] - Cp[k]; - len[n] = 0; - nzmax = t; - - for(i = 0; i <= n; i++) - { - head[i] = -1; // degree list i is empty - last[i] = -1; - next[i] = -1; - hhead[i] = -1; // hash list i is empty - nv[i] = 1; // node i is just one node - w[i] = 1; // node i is alive - elen[i] = 0; // Ek of node i is empty - degree[i] = len[i]; // degree of node i - } - mark = internal::cs_wclear(0, 0, w, n); /* clear w */ - - /* --- Initialize degree lists ------------------------------------------ */ - for(i = 0; i < n; i++) - { - bool has_diag = false; - for(p = Cp[i]; p dense || !has_diag) /* node i is dense or has no structural diagonal element */ - { - nv[i] = 0; /* absorb i into element n */ - elen[i] = -1; /* node i is dead */ - nel++; - Cp[i] = amd_flip (n); - nv[n]++; - } - else - { - if(head[d] != -1) last[head[d]] = i; - next[i] = head[d]; /* put node i in degree list d */ - head[d] = i; - } - } - - elen[n] = -2; /* n is a dead element */ - Cp[n] = -1; /* n is a root of assembly tree */ - w[n] = 0; /* n is a dead element */ - - while (nel < n) /* while (selecting pivots) do */ - { - /* --- Select node of minimum approximate degree -------------------- */ - for(k = -1; mindeg < n && (k = head[mindeg]) == -1; mindeg++) {} - if(next[k] != -1) last[next[k]] = -1; - head[mindeg] = next[k]; /* remove k from degree list */ - elenk = elen[k]; /* elenk = |Ek| */ - nvk = nv[k]; /* # of nodes k represents */ - nel += nvk; /* nv[k] nodes of A eliminated */ - - /* --- Garbage collection ------------------------------------------- */ - if(elenk > 0 && cnz + mindeg >= nzmax) - { - for(j = 0; j < n; j++) - { - if((p = Cp[j]) >= 0) /* j is a live node or element */ - { - Cp[j] = Ci[p]; /* save first entry of object */ - Ci[p] = amd_flip (j); /* first entry is now amd_flip(j) */ - } - } - for(q = 0, p = 0; p < cnz; ) /* scan all of memory */ - { - if((j = amd_flip (Ci[p++])) >= 0) /* found object j */ - { - Ci[q] = Cp[j]; /* restore first entry of object */ - Cp[j] = q++; /* new pointer to object j */ - for(k3 = 0; k3 < len[j]-1; k3++) Ci[q++] = Ci[p++]; - } - } - cnz = q; /* Ci[cnz...nzmax-1] now free */ - } - - /* --- Construct new element ---------------------------------------- */ - dk = 0; - nv[k] = -nvk; /* flag k as in Lk */ - p = Cp[k]; - pk1 = (elenk == 0) ? p : cnz; /* do in place if elen[k] == 0 */ - pk2 = pk1; - for(k1 = 1; k1 <= elenk + 1; k1++) - { - if(k1 > elenk) - { - e = k; /* search the nodes in k */ - pj = p; /* list of nodes starts at Ci[pj]*/ - ln = len[k] - elenk; /* length of list of nodes in k */ - } - else - { - e = Ci[p++]; /* search the nodes in e */ - pj = Cp[e]; - ln = len[e]; /* length of list of nodes in e */ - } - for(k2 = 1; k2 <= ln; k2++) - { - i = Ci[pj++]; - if((nvi = nv[i]) <= 0) continue; /* node i dead, or seen */ - dk += nvi; /* degree[Lk] += size of node i */ - nv[i] = -nvi; /* negate nv[i] to denote i in Lk*/ - Ci[pk2++] = i; /* place i in Lk */ - if(next[i] != -1) last[next[i]] = last[i]; - if(last[i] != -1) /* remove i from degree list */ - { - next[last[i]] = next[i]; - } - else - { - head[degree[i]] = next[i]; - } - } - if(e != k) - { - Cp[e] = amd_flip (k); /* absorb e into k */ - w[e] = 0; /* e is now a dead element */ - } - } - if(elenk != 0) cnz = pk2; /* Ci[cnz...nzmax] is free */ - degree[k] = dk; /* external degree of k - |Lk\i| */ - Cp[k] = pk1; /* element k is in Ci[pk1..pk2-1] */ - len[k] = pk2 - pk1; - elen[k] = -2; /* k is now an element */ - - /* --- Find set differences ----------------------------------------- */ - mark = internal::cs_wclear(mark, lemax, w, n); /* clear w if necessary */ - for(pk = pk1; pk < pk2; pk++) /* scan 1: find |Le\Lk| */ - { - i = Ci[pk]; - if((eln = elen[i]) <= 0) continue;/* skip if elen[i] empty */ - nvi = -nv[i]; /* nv[i] was negated */ - wnvi = mark - nvi; - for(p = Cp[i]; p <= Cp[i] + eln - 1; p++) /* scan Ei */ - { - e = Ci[p]; - if(w[e] >= mark) - { - w[e] -= nvi; /* decrement |Le\Lk| */ - } - else if(w[e] != 0) /* ensure e is a live element */ - { - w[e] = degree[e] + wnvi; /* 1st time e seen in scan 1 */ - } - } - } - - /* --- Degree update ------------------------------------------------ */ - for(pk = pk1; pk < pk2; pk++) /* scan2: degree update */ - { - i = Ci[pk]; /* consider node i in Lk */ - p1 = Cp[i]; - p2 = p1 + elen[i] - 1; - pn = p1; - for(h = 0, d = 0, p = p1; p <= p2; p++) /* scan Ei */ - { - e = Ci[p]; - if(w[e] != 0) /* e is an unabsorbed element */ - { - dext = w[e] - mark; /* dext = |Le\Lk| */ - if(dext > 0) - { - d += dext; /* sum up the set differences */ - Ci[pn++] = e; /* keep e in Ei */ - h += e; /* compute the hash of node i */ - } - else - { - Cp[e] = amd_flip (k); /* aggressive absorb. e->k */ - w[e] = 0; /* e is a dead element */ - } - } - } - elen[i] = pn - p1 + 1; /* elen[i] = |Ei| */ - p3 = pn; - p4 = p1 + len[i]; - for(p = p2 + 1; p < p4; p++) /* prune edges in Ai */ - { - j = Ci[p]; - if((nvj = nv[j]) <= 0) continue; /* node j dead or in Lk */ - d += nvj; /* degree(i) += |j| */ - Ci[pn++] = j; /* place j in node list of i */ - h += j; /* compute hash for node i */ - } - if(d == 0) /* check for mass elimination */ - { - Cp[i] = amd_flip (k); /* absorb i into k */ - nvi = -nv[i]; - dk -= nvi; /* |Lk| -= |i| */ - nvk += nvi; /* |k| += nv[i] */ - nel += nvi; - nv[i] = 0; - elen[i] = -1; /* node i is dead */ - } - else - { - degree[i] = std::min (degree[i], d); /* update degree(i) */ - Ci[pn] = Ci[p3]; /* move first node to end */ - Ci[p3] = Ci[p1]; /* move 1st el. to end of Ei */ - Ci[p1] = k; /* add k as 1st element in of Ei */ - len[i] = pn - p1 + 1; /* new len of adj. list of node i */ - h %= n; /* finalize hash of i */ - next[i] = hhead[h]; /* place i in hash bucket */ - hhead[h] = i; - last[i] = h; /* save hash of i in last[i] */ - } - } /* scan2 is done */ - degree[k] = dk; /* finalize |Lk| */ - lemax = std::max(lemax, dk); - mark = internal::cs_wclear(mark+lemax, lemax, w, n); /* clear w */ - - /* --- Supernode detection ------------------------------------------ */ - for(pk = pk1; pk < pk2; pk++) - { - i = Ci[pk]; - if(nv[i] >= 0) continue; /* skip if i is dead */ - h = last[i]; /* scan hash bucket of node i */ - i = hhead[h]; - hhead[h] = -1; /* hash bucket will be empty */ - for(; i != -1 && next[i] != -1; i = next[i], mark++) - { - ln = len[i]; - eln = elen[i]; - for(p = Cp[i]+1; p <= Cp[i] + ln-1; p++) w[Ci[p]] = mark; - jlast = i; - for(j = next[i]; j != -1; ) /* compare i with all j */ - { - ok = (len[j] == ln) && (elen[j] == eln); - for(p = Cp[j] + 1; ok && p <= Cp[j] + ln - 1; p++) - { - if(w[Ci[p]] != mark) ok = 0; /* compare i and j*/ - } - if(ok) /* i and j are identical */ - { - Cp[j] = amd_flip (i); /* absorb j into i */ - nv[i] += nv[j]; - nv[j] = 0; - elen[j] = -1; /* node j is dead */ - j = next[j]; /* delete j from hash bucket */ - next[jlast] = j; - } - else - { - jlast = j; /* j and i are different */ - j = next[j]; - } - } - } - } - - /* --- Finalize new element------------------------------------------ */ - for(p = pk1, pk = pk1; pk < pk2; pk++) /* finalize Lk */ - { - i = Ci[pk]; - if((nvi = -nv[i]) <= 0) continue;/* skip if i is dead */ - nv[i] = nvi; /* restore nv[i] */ - d = degree[i] + dk - nvi; /* compute external degree(i) */ - d = std::min (d, n - nel - nvi); - if(head[d] != -1) last[head[d]] = i; - next[i] = head[d]; /* put i back in degree list */ - last[i] = -1; - head[d] = i; - mindeg = std::min (mindeg, d); /* find new minimum degree */ - degree[i] = d; - Ci[p++] = i; /* place i in Lk */ - } - nv[k] = nvk; /* # nodes absorbed into k */ - if((len[k] = p-pk1) == 0) /* length of adj list of element k*/ - { - Cp[k] = -1; /* k is a root of the tree */ - w[k] = 0; /* k is now a dead element */ - } - if(elenk != 0) cnz = p; /* free unused space in Lk */ - } - - /* --- Postordering ----------------------------------------------------- */ - for(i = 0; i < n; i++) Cp[i] = amd_flip (Cp[i]);/* fix assembly tree */ - for(j = 0; j <= n; j++) head[j] = -1; - for(j = n; j >= 0; j--) /* place unordered nodes in lists */ - { - if(nv[j] > 0) continue; /* skip if j is an element */ - next[j] = head[Cp[j]]; /* place j in list of its parent */ - head[Cp[j]] = j; - } - for(e = n; e >= 0; e--) /* place elements in lists */ - { - if(nv[e] <= 0) continue; /* skip unless e is an element */ - if(Cp[e] != -1) - { - next[e] = head[Cp[e]]; /* place e in list of its parent */ - head[Cp[e]] = e; - } - } - for(k = 0, i = 0; i <= n; i++) /* postorder the assembly tree */ - { - if(Cp[i] == -1) k = internal::cs_tdfs(i, k, head, next, perm.indices().data(), w); - } - - perm.indices().conservativeResize(n); -} - -} // namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_AMD_H diff --git a/Eigen/src/OrderingMethods/Eigen_Colamd.h b/Eigen/src/OrderingMethods/Eigen_Colamd.h deleted file mode 100644 index da85b4d6e..000000000 --- a/Eigen/src/OrderingMethods/Eigen_Colamd.h +++ /dev/null @@ -1,1843 +0,0 @@ -// // This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Desire Nuentsa Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -// This file is modified from the colamd/symamd library. The copyright is below - -// The authors of the code itself are Stefan I. Larimore and Timothy A. -// Davis (davis@cise.ufl.edu), University of Florida. The algorithm was -// developed in collaboration with John Gilbert, Xerox PARC, and Esmond -// Ng, Oak Ridge National Laboratory. -// -// Date: -// -// September 8, 2003. Version 2.3. -// -// Acknowledgements: -// -// This work was supported by the National Science Foundation, under -// grants DMS-9504974 and DMS-9803599. -// -// Notice: -// -// Copyright (c) 1998-2003 by the University of Florida. -// All Rights Reserved. -// -// THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY -// EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. -// -// Permission is hereby granted to use, copy, modify, and/or distribute -// this program, provided that the Copyright, this License, and the -// Availability of the original version is retained on all copies and made -// accessible to the end-user of any code or package that includes COLAMD -// or any modified version of COLAMD. -// -// Availability: -// -// The colamd/symamd library is available at -// -// http://www.suitesparse.com - - -#ifndef EIGEN_COLAMD_H -#define EIGEN_COLAMD_H - -namespace internal { -/* Ensure that debugging is turned off: */ -#ifndef COLAMD_NDEBUG -#define COLAMD_NDEBUG -#endif /* NDEBUG */ -/* ========================================================================== */ -/* === Knob and statistics definitions ====================================== */ -/* ========================================================================== */ - -/* size of the knobs [ ] array. Only knobs [0..1] are currently used. */ -#define COLAMD_KNOBS 20 - -/* number of output statistics. Only stats [0..6] are currently used. */ -#define COLAMD_STATS 20 - -/* knobs [0] and stats [0]: dense row knob and output statistic. */ -#define COLAMD_DENSE_ROW 0 - -/* knobs [1] and stats [1]: dense column knob and output statistic. */ -#define COLAMD_DENSE_COL 1 - -/* stats [2]: memory defragmentation count output statistic */ -#define COLAMD_DEFRAG_COUNT 2 - -/* stats [3]: colamd status: zero OK, > 0 warning or notice, < 0 error */ -#define COLAMD_STATUS 3 - -/* stats [4..6]: error info, or info on jumbled columns */ -#define COLAMD_INFO1 4 -#define COLAMD_INFO2 5 -#define COLAMD_INFO3 6 - -/* error codes returned in stats [3]: */ -#define COLAMD_OK (0) -#define COLAMD_OK_BUT_JUMBLED (1) -#define COLAMD_ERROR_A_not_present (-1) -#define COLAMD_ERROR_p_not_present (-2) -#define COLAMD_ERROR_nrow_negative (-3) -#define COLAMD_ERROR_ncol_negative (-4) -#define COLAMD_ERROR_nnz_negative (-5) -#define COLAMD_ERROR_p0_nonzero (-6) -#define COLAMD_ERROR_A_too_small (-7) -#define COLAMD_ERROR_col_length_negative (-8) -#define COLAMD_ERROR_row_index_out_of_bounds (-9) -#define COLAMD_ERROR_out_of_memory (-10) -#define COLAMD_ERROR_internal_error (-999) - -/* ========================================================================== */ -/* === Definitions ========================================================== */ -/* ========================================================================== */ - -#define ONES_COMPLEMENT(r) (-(r)-1) - -/* -------------------------------------------------------------------------- */ - -#define COLAMD_EMPTY (-1) - -/* Row and column status */ -#define ALIVE (0) -#define DEAD (-1) - -/* Column status */ -#define DEAD_PRINCIPAL (-1) -#define DEAD_NON_PRINCIPAL (-2) - -/* Macros for row and column status update and checking. */ -#define ROW_IS_DEAD(r) ROW_IS_MARKED_DEAD (Row[r].shared2.mark) -#define ROW_IS_MARKED_DEAD(row_mark) (row_mark < ALIVE) -#define ROW_IS_ALIVE(r) (Row [r].shared2.mark >= ALIVE) -#define COL_IS_DEAD(c) (Col [c].start < ALIVE) -#define COL_IS_ALIVE(c) (Col [c].start >= ALIVE) -#define COL_IS_DEAD_PRINCIPAL(c) (Col [c].start == DEAD_PRINCIPAL) -#define KILL_ROW(r) { Row [r].shared2.mark = DEAD ; } -#define KILL_PRINCIPAL_COL(c) { Col [c].start = DEAD_PRINCIPAL ; } -#define KILL_NON_PRINCIPAL_COL(c) { Col [c].start = DEAD_NON_PRINCIPAL ; } - -/* ========================================================================== */ -/* === Colamd reporting mechanism =========================================== */ -/* ========================================================================== */ - -// == Row and Column structures == -template -struct colamd_col -{ - IndexType start ; /* index for A of first row in this column, or DEAD */ - /* if column is dead */ - IndexType length ; /* number of rows in this column */ - union - { - IndexType thickness ; /* number of original columns represented by this */ - /* col, if the column is alive */ - IndexType parent ; /* parent in parent tree super-column structure, if */ - /* the column is dead */ - } shared1 ; - union - { - IndexType score ; /* the score used to maintain heap, if col is alive */ - IndexType order ; /* pivot ordering of this column, if col is dead */ - } shared2 ; - union - { - IndexType headhash ; /* head of a hash bucket, if col is at the head of */ - /* a degree list */ - IndexType hash ; /* hash value, if col is not in a degree list */ - IndexType prev ; /* previous column in degree list, if col is in a */ - /* degree list (but not at the head of a degree list) */ - } shared3 ; - union - { - IndexType degree_next ; /* next column, if col is in a degree list */ - IndexType hash_next ; /* next column, if col is in a hash list */ - } shared4 ; - -}; - -template -struct Colamd_Row -{ - IndexType start ; /* index for A of first col in this row */ - IndexType length ; /* number of principal columns in this row */ - union - { - IndexType degree ; /* number of principal & non-principal columns in row */ - IndexType p ; /* used as a row pointer in init_rows_cols () */ - } shared1 ; - union - { - IndexType mark ; /* for computing set differences and marking dead rows*/ - IndexType first_column ;/* first column in row (used in garbage collection) */ - } shared2 ; - -}; - -/* ========================================================================== */ -/* === Colamd recommended memory size ======================================= */ -/* ========================================================================== */ - -/* - The recommended length Alen of the array A passed to colamd is given by - the COLAMD_RECOMMENDED (nnz, n_row, n_col) macro. It returns -1 if any - argument is negative. 2*nnz space is required for the row and column - indices of the matrix. colamd_c (n_col) + colamd_r (n_row) space is - required for the Col and Row arrays, respectively, which are internal to - colamd. An additional n_col space is the minimal amount of "elbow room", - and nnz/5 more space is recommended for run time efficiency. - - This macro is not needed when using symamd. - - Explicit typecast to IndexType added Sept. 23, 2002, COLAMD version 2.2, to avoid - gcc -pedantic warning messages. -*/ -template -inline IndexType colamd_c(IndexType n_col) -{ return IndexType( ((n_col) + 1) * sizeof (colamd_col) / sizeof (IndexType) ) ; } - -template -inline IndexType colamd_r(IndexType n_row) -{ return IndexType(((n_row) + 1) * sizeof (Colamd_Row) / sizeof (IndexType)); } - -// Prototypes of non-user callable routines -template -static IndexType init_rows_cols (IndexType n_row, IndexType n_col, Colamd_Row Row [], colamd_col col [], IndexType A [], IndexType p [], IndexType stats[COLAMD_STATS] ); - -template -static void init_scoring (IndexType n_row, IndexType n_col, Colamd_Row Row [], colamd_col Col [], IndexType A [], IndexType head [], double knobs[COLAMD_KNOBS], IndexType *p_n_row2, IndexType *p_n_col2, IndexType *p_max_deg); - -template -static IndexType find_ordering (IndexType n_row, IndexType n_col, IndexType Alen, Colamd_Row Row [], colamd_col Col [], IndexType A [], IndexType head [], IndexType n_col2, IndexType max_deg, IndexType pfree); - -template -static void order_children (IndexType n_col, colamd_col Col [], IndexType p []); - -template -static void detect_super_cols (colamd_col Col [], IndexType A [], IndexType head [], IndexType row_start, IndexType row_length ) ; - -template -static IndexType garbage_collection (IndexType n_row, IndexType n_col, Colamd_Row Row [], colamd_col Col [], IndexType A [], IndexType *pfree) ; - -template -static inline IndexType clear_mark (IndexType n_row, Colamd_Row Row [] ) ; - -/* === No debugging ========================================================= */ - -#define COLAMD_DEBUG0(params) ; -#define COLAMD_DEBUG1(params) ; -#define COLAMD_DEBUG2(params) ; -#define COLAMD_DEBUG3(params) ; -#define COLAMD_DEBUG4(params) ; - -#define COLAMD_ASSERT(expression) ((void) 0) - - -/** - * \brief Returns the recommended value of Alen - * - * Returns recommended value of Alen for use by colamd. - * Returns -1 if any input argument is negative. - * The use of this routine or macro is optional. - * Note that the macro uses its arguments more than once, - * so be careful for side effects, if you pass expressions as arguments to COLAMD_RECOMMENDED. - * - * \param nnz nonzeros in A - * \param n_row number of rows in A - * \param n_col number of columns in A - * \return recommended value of Alen for use by colamd - */ -template -inline IndexType colamd_recommended ( IndexType nnz, IndexType n_row, IndexType n_col) -{ - if ((nnz) < 0 || (n_row) < 0 || (n_col) < 0) - return (-1); - else - return (2 * (nnz) + colamd_c (n_col) + colamd_r (n_row) + (n_col) + ((nnz) / 5)); -} - -/** - * \brief set default parameters The use of this routine is optional. - * - * Colamd: rows with more than (knobs [COLAMD_DENSE_ROW] * n_col) - * entries are removed prior to ordering. Columns with more than - * (knobs [COLAMD_DENSE_COL] * n_row) entries are removed prior to - * ordering, and placed last in the output column ordering. - * - * COLAMD_DENSE_ROW and COLAMD_DENSE_COL are defined as 0 and 1, - * respectively, in colamd.h. Default values of these two knobs - * are both 0.5. Currently, only knobs [0] and knobs [1] are - * used, but future versions may use more knobs. If so, they will - * be properly set to their defaults by the future version of - * colamd_set_defaults, so that the code that calls colamd will - * not need to change, assuming that you either use - * colamd_set_defaults, or pass a (double *) NULL pointer as the - * knobs array to colamd or symamd. - * - * \param knobs parameter settings for colamd - */ - -static inline void colamd_set_defaults(double knobs[COLAMD_KNOBS]) -{ - /* === Local variables ================================================== */ - - int i ; - - if (!knobs) - { - return ; /* no knobs to initialize */ - } - for (i = 0 ; i < COLAMD_KNOBS ; i++) - { - knobs [i] = 0 ; - } - knobs [COLAMD_DENSE_ROW] = 0.5 ; /* ignore rows over 50% dense */ - knobs [COLAMD_DENSE_COL] = 0.5 ; /* ignore columns over 50% dense */ -} - -/** - * \brief Computes a column ordering using the column approximate minimum degree ordering - * - * Computes a column ordering (Q) of A such that P(AQ)=LU or - * (AQ)'AQ=LL' have less fill-in and require fewer floating point - * operations than factorizing the unpermuted matrix A or A'A, - * respectively. - * - * - * \param n_row number of rows in A - * \param n_col number of columns in A - * \param Alen, size of the array A - * \param A row indices of the matrix, of size ALen - * \param p column pointers of A, of size n_col+1 - * \param knobs parameter settings for colamd - * \param stats colamd output statistics and error codes - */ -template -static bool colamd(IndexType n_row, IndexType n_col, IndexType Alen, IndexType *A, IndexType *p, double knobs[COLAMD_KNOBS], IndexType stats[COLAMD_STATS]) -{ - /* === Local variables ================================================== */ - - IndexType i ; /* loop index */ - IndexType nnz ; /* nonzeros in A */ - IndexType Row_size ; /* size of Row [], in integers */ - IndexType Col_size ; /* size of Col [], in integers */ - IndexType need ; /* minimum required length of A */ - Colamd_Row *Row ; /* pointer into A of Row [0..n_row] array */ - colamd_col *Col ; /* pointer into A of Col [0..n_col] array */ - IndexType n_col2 ; /* number of non-dense, non-empty columns */ - IndexType n_row2 ; /* number of non-dense, non-empty rows */ - IndexType ngarbage ; /* number of garbage collections performed */ - IndexType max_deg ; /* maximum row degree */ - double default_knobs [COLAMD_KNOBS] ; /* default knobs array */ - - - /* === Check the input arguments ======================================== */ - - if (!stats) - { - COLAMD_DEBUG0 (("colamd: stats not present\n")) ; - return (false) ; - } - for (i = 0 ; i < COLAMD_STATS ; i++) - { - stats [i] = 0 ; - } - stats [COLAMD_STATUS] = COLAMD_OK ; - stats [COLAMD_INFO1] = -1 ; - stats [COLAMD_INFO2] = -1 ; - - if (!A) /* A is not present */ - { - stats [COLAMD_STATUS] = COLAMD_ERROR_A_not_present ; - COLAMD_DEBUG0 (("colamd: A not present\n")) ; - return (false) ; - } - - if (!p) /* p is not present */ - { - stats [COLAMD_STATUS] = COLAMD_ERROR_p_not_present ; - COLAMD_DEBUG0 (("colamd: p not present\n")) ; - return (false) ; - } - - if (n_row < 0) /* n_row must be >= 0 */ - { - stats [COLAMD_STATUS] = COLAMD_ERROR_nrow_negative ; - stats [COLAMD_INFO1] = n_row ; - COLAMD_DEBUG0 (("colamd: nrow negative %d\n", n_row)) ; - return (false) ; - } - - if (n_col < 0) /* n_col must be >= 0 */ - { - stats [COLAMD_STATUS] = COLAMD_ERROR_ncol_negative ; - stats [COLAMD_INFO1] = n_col ; - COLAMD_DEBUG0 (("colamd: ncol negative %d\n", n_col)) ; - return (false) ; - } - - nnz = p [n_col] ; - if (nnz < 0) /* nnz must be >= 0 */ - { - stats [COLAMD_STATUS] = COLAMD_ERROR_nnz_negative ; - stats [COLAMD_INFO1] = nnz ; - COLAMD_DEBUG0 (("colamd: number of entries negative %d\n", nnz)) ; - return (false) ; - } - - if (p [0] != 0) - { - stats [COLAMD_STATUS] = COLAMD_ERROR_p0_nonzero ; - stats [COLAMD_INFO1] = p [0] ; - COLAMD_DEBUG0 (("colamd: p[0] not zero %d\n", p [0])) ; - return (false) ; - } - - /* === If no knobs, set default knobs =================================== */ - - if (!knobs) - { - colamd_set_defaults (default_knobs) ; - knobs = default_knobs ; - } - - /* === Allocate the Row and Col arrays from array A ===================== */ - - Col_size = colamd_c (n_col) ; - Row_size = colamd_r (n_row) ; - need = 2*nnz + n_col + Col_size + Row_size ; - - if (need > Alen) - { - /* not enough space in array A to perform the ordering */ - stats [COLAMD_STATUS] = COLAMD_ERROR_A_too_small ; - stats [COLAMD_INFO1] = need ; - stats [COLAMD_INFO2] = Alen ; - COLAMD_DEBUG0 (("colamd: Need Alen >= %d, given only Alen = %d\n", need,Alen)); - return (false) ; - } - - Alen -= Col_size + Row_size ; - Col = (colamd_col *) &A [Alen] ; - Row = (Colamd_Row *) &A [Alen + Col_size] ; - - /* === Construct the row and column data structures ===================== */ - - if (!Eigen::internal::init_rows_cols (n_row, n_col, Row, Col, A, p, stats)) - { - /* input matrix is invalid */ - COLAMD_DEBUG0 (("colamd: Matrix invalid\n")) ; - return (false) ; - } - - /* === Initialize scores, kill dense rows/columns ======================= */ - - Eigen::internal::init_scoring (n_row, n_col, Row, Col, A, p, knobs, - &n_row2, &n_col2, &max_deg) ; - - /* === Order the supercolumns =========================================== */ - - ngarbage = Eigen::internal::find_ordering (n_row, n_col, Alen, Row, Col, A, p, - n_col2, max_deg, 2*nnz) ; - - /* === Order the non-principal columns ================================== */ - - Eigen::internal::order_children (n_col, Col, p) ; - - /* === Return statistics in stats ======================================= */ - - stats [COLAMD_DENSE_ROW] = n_row - n_row2 ; - stats [COLAMD_DENSE_COL] = n_col - n_col2 ; - stats [COLAMD_DEFRAG_COUNT] = ngarbage ; - COLAMD_DEBUG0 (("colamd: done.\n")) ; - return (true) ; -} - -/* ========================================================================== */ -/* === NON-USER-CALLABLE ROUTINES: ========================================== */ -/* ========================================================================== */ - -/* There are no user-callable routines beyond this point in the file */ - - -/* ========================================================================== */ -/* === init_rows_cols ======================================================= */ -/* ========================================================================== */ - -/* - Takes the column form of the matrix in A and creates the row form of the - matrix. Also, row and column attributes are stored in the Col and Row - structs. If the columns are un-sorted or contain duplicate row indices, - this routine will also sort and remove duplicate row indices from the - column form of the matrix. Returns false if the matrix is invalid, - true otherwise. Not user-callable. -*/ -template -static IndexType init_rows_cols /* returns true if OK, or false otherwise */ - ( - /* === Parameters ======================================================= */ - - IndexType n_row, /* number of rows of A */ - IndexType n_col, /* number of columns of A */ - Colamd_Row Row [], /* of size n_row+1 */ - colamd_col Col [], /* of size n_col+1 */ - IndexType A [], /* row indices of A, of size Alen */ - IndexType p [], /* pointers to columns in A, of size n_col+1 */ - IndexType stats [COLAMD_STATS] /* colamd statistics */ - ) -{ - /* === Local variables ================================================== */ - - IndexType col ; /* a column index */ - IndexType row ; /* a row index */ - IndexType *cp ; /* a column pointer */ - IndexType *cp_end ; /* a pointer to the end of a column */ - IndexType *rp ; /* a row pointer */ - IndexType *rp_end ; /* a pointer to the end of a row */ - IndexType last_row ; /* previous row */ - - /* === Initialize columns, and check column pointers ==================== */ - - for (col = 0 ; col < n_col ; col++) - { - Col [col].start = p [col] ; - Col [col].length = p [col+1] - p [col] ; - - if ((Col [col].length) < 0) // extra parentheses to work-around gcc bug 10200 - { - /* column pointers must be non-decreasing */ - stats [COLAMD_STATUS] = COLAMD_ERROR_col_length_negative ; - stats [COLAMD_INFO1] = col ; - stats [COLAMD_INFO2] = Col [col].length ; - COLAMD_DEBUG0 (("colamd: col %d length %d < 0\n", col, Col [col].length)) ; - return (false) ; - } - - Col [col].shared1.thickness = 1 ; - Col [col].shared2.score = 0 ; - Col [col].shared3.prev = COLAMD_EMPTY ; - Col [col].shared4.degree_next = COLAMD_EMPTY ; - } - - /* p [0..n_col] no longer needed, used as "head" in subsequent routines */ - - /* === Scan columns, compute row degrees, and check row indices ========= */ - - stats [COLAMD_INFO3] = 0 ; /* number of duplicate or unsorted row indices*/ - - for (row = 0 ; row < n_row ; row++) - { - Row [row].length = 0 ; - Row [row].shared2.mark = -1 ; - } - - for (col = 0 ; col < n_col ; col++) - { - last_row = -1 ; - - cp = &A [p [col]] ; - cp_end = &A [p [col+1]] ; - - while (cp < cp_end) - { - row = *cp++ ; - - /* make sure row indices within range */ - if (row < 0 || row >= n_row) - { - stats [COLAMD_STATUS] = COLAMD_ERROR_row_index_out_of_bounds ; - stats [COLAMD_INFO1] = col ; - stats [COLAMD_INFO2] = row ; - stats [COLAMD_INFO3] = n_row ; - COLAMD_DEBUG0 (("colamd: row %d col %d out of bounds\n", row, col)) ; - return (false) ; - } - - if (row <= last_row || Row [row].shared2.mark == col) - { - /* row index are unsorted or repeated (or both), thus col */ - /* is jumbled. This is a notice, not an error condition. */ - stats [COLAMD_STATUS] = COLAMD_OK_BUT_JUMBLED ; - stats [COLAMD_INFO1] = col ; - stats [COLAMD_INFO2] = row ; - (stats [COLAMD_INFO3]) ++ ; - COLAMD_DEBUG1 (("colamd: row %d col %d unsorted/duplicate\n",row,col)); - } - - if (Row [row].shared2.mark != col) - { - Row [row].length++ ; - } - else - { - /* this is a repeated entry in the column, */ - /* it will be removed */ - Col [col].length-- ; - } - - /* mark the row as having been seen in this column */ - Row [row].shared2.mark = col ; - - last_row = row ; - } - } - - /* === Compute row pointers ============================================= */ - - /* row form of the matrix starts directly after the column */ - /* form of matrix in A */ - Row [0].start = p [n_col] ; - Row [0].shared1.p = Row [0].start ; - Row [0].shared2.mark = -1 ; - for (row = 1 ; row < n_row ; row++) - { - Row [row].start = Row [row-1].start + Row [row-1].length ; - Row [row].shared1.p = Row [row].start ; - Row [row].shared2.mark = -1 ; - } - - /* === Create row form ================================================== */ - - if (stats [COLAMD_STATUS] == COLAMD_OK_BUT_JUMBLED) - { - /* if cols jumbled, watch for repeated row indices */ - for (col = 0 ; col < n_col ; col++) - { - cp = &A [p [col]] ; - cp_end = &A [p [col+1]] ; - while (cp < cp_end) - { - row = *cp++ ; - if (Row [row].shared2.mark != col) - { - A [(Row [row].shared1.p)++] = col ; - Row [row].shared2.mark = col ; - } - } - } - } - else - { - /* if cols not jumbled, we don't need the mark (this is faster) */ - for (col = 0 ; col < n_col ; col++) - { - cp = &A [p [col]] ; - cp_end = &A [p [col+1]] ; - while (cp < cp_end) - { - A [(Row [*cp++].shared1.p)++] = col ; - } - } - } - - /* === Clear the row marks and set row degrees ========================== */ - - for (row = 0 ; row < n_row ; row++) - { - Row [row].shared2.mark = 0 ; - Row [row].shared1.degree = Row [row].length ; - } - - /* === See if we need to re-create columns ============================== */ - - if (stats [COLAMD_STATUS] == COLAMD_OK_BUT_JUMBLED) - { - COLAMD_DEBUG0 (("colamd: reconstructing column form, matrix jumbled\n")) ; - - - /* === Compute col pointers ========================================= */ - - /* col form of the matrix starts at A [0]. */ - /* Note, we may have a gap between the col form and the row */ - /* form if there were duplicate entries, if so, it will be */ - /* removed upon the first garbage collection */ - Col [0].start = 0 ; - p [0] = Col [0].start ; - for (col = 1 ; col < n_col ; col++) - { - /* note that the lengths here are for pruned columns, i.e. */ - /* no duplicate row indices will exist for these columns */ - Col [col].start = Col [col-1].start + Col [col-1].length ; - p [col] = Col [col].start ; - } - - /* === Re-create col form =========================================== */ - - for (row = 0 ; row < n_row ; row++) - { - rp = &A [Row [row].start] ; - rp_end = rp + Row [row].length ; - while (rp < rp_end) - { - A [(p [*rp++])++] = row ; - } - } - } - - /* === Done. Matrix is not (or no longer) jumbled ====================== */ - - return (true) ; -} - - -/* ========================================================================== */ -/* === init_scoring ========================================================= */ -/* ========================================================================== */ - -/* - Kills dense or empty columns and rows, calculates an initial score for - each column, and places all columns in the degree lists. Not user-callable. -*/ -template -static void init_scoring - ( - /* === Parameters ======================================================= */ - - IndexType n_row, /* number of rows of A */ - IndexType n_col, /* number of columns of A */ - Colamd_Row Row [], /* of size n_row+1 */ - colamd_col Col [], /* of size n_col+1 */ - IndexType A [], /* column form and row form of A */ - IndexType head [], /* of size n_col+1 */ - double knobs [COLAMD_KNOBS],/* parameters */ - IndexType *p_n_row2, /* number of non-dense, non-empty rows */ - IndexType *p_n_col2, /* number of non-dense, non-empty columns */ - IndexType *p_max_deg /* maximum row degree */ - ) -{ - /* === Local variables ================================================== */ - - IndexType c ; /* a column index */ - IndexType r, row ; /* a row index */ - IndexType *cp ; /* a column pointer */ - IndexType deg ; /* degree of a row or column */ - IndexType *cp_end ; /* a pointer to the end of a column */ - IndexType *new_cp ; /* new column pointer */ - IndexType col_length ; /* length of pruned column */ - IndexType score ; /* current column score */ - IndexType n_col2 ; /* number of non-dense, non-empty columns */ - IndexType n_row2 ; /* number of non-dense, non-empty rows */ - IndexType dense_row_count ; /* remove rows with more entries than this */ - IndexType dense_col_count ; /* remove cols with more entries than this */ - IndexType min_score ; /* smallest column score */ - IndexType max_deg ; /* maximum row degree */ - IndexType next_col ; /* Used to add to degree list.*/ - - - /* === Extract knobs ==================================================== */ - - dense_row_count = numext::maxi(IndexType(0), numext::mini(IndexType(knobs [COLAMD_DENSE_ROW] * n_col), n_col)) ; - dense_col_count = numext::maxi(IndexType(0), numext::mini(IndexType(knobs [COLAMD_DENSE_COL] * n_row), n_row)) ; - COLAMD_DEBUG1 (("colamd: densecount: %d %d\n", dense_row_count, dense_col_count)) ; - max_deg = 0 ; - n_col2 = n_col ; - n_row2 = n_row ; - - /* === Kill empty columns =============================================== */ - - /* Put the empty columns at the end in their natural order, so that LU */ - /* factorization can proceed as far as possible. */ - for (c = n_col-1 ; c >= 0 ; c--) - { - deg = Col [c].length ; - if (deg == 0) - { - /* this is a empty column, kill and order it last */ - Col [c].shared2.order = --n_col2 ; - KILL_PRINCIPAL_COL (c) ; - } - } - COLAMD_DEBUG1 (("colamd: null columns killed: %d\n", n_col - n_col2)) ; - - /* === Kill dense columns =============================================== */ - - /* Put the dense columns at the end, in their natural order */ - for (c = n_col-1 ; c >= 0 ; c--) - { - /* skip any dead columns */ - if (COL_IS_DEAD (c)) - { - continue ; - } - deg = Col [c].length ; - if (deg > dense_col_count) - { - /* this is a dense column, kill and order it last */ - Col [c].shared2.order = --n_col2 ; - /* decrement the row degrees */ - cp = &A [Col [c].start] ; - cp_end = cp + Col [c].length ; - while (cp < cp_end) - { - Row [*cp++].shared1.degree-- ; - } - KILL_PRINCIPAL_COL (c) ; - } - } - COLAMD_DEBUG1 (("colamd: Dense and null columns killed: %d\n", n_col - n_col2)) ; - - /* === Kill dense and empty rows ======================================== */ - - for (r = 0 ; r < n_row ; r++) - { - deg = Row [r].shared1.degree ; - COLAMD_ASSERT (deg >= 0 && deg <= n_col) ; - if (deg > dense_row_count || deg == 0) - { - /* kill a dense or empty row */ - KILL_ROW (r) ; - --n_row2 ; - } - else - { - /* keep track of max degree of remaining rows */ - max_deg = numext::maxi(max_deg, deg) ; - } - } - COLAMD_DEBUG1 (("colamd: Dense and null rows killed: %d\n", n_row - n_row2)) ; - - /* === Compute initial column scores ==================================== */ - - /* At this point the row degrees are accurate. They reflect the number */ - /* of "live" (non-dense) columns in each row. No empty rows exist. */ - /* Some "live" columns may contain only dead rows, however. These are */ - /* pruned in the code below. */ - - /* now find the initial matlab score for each column */ - for (c = n_col-1 ; c >= 0 ; c--) - { - /* skip dead column */ - if (COL_IS_DEAD (c)) - { - continue ; - } - score = 0 ; - cp = &A [Col [c].start] ; - new_cp = cp ; - cp_end = cp + Col [c].length ; - while (cp < cp_end) - { - /* get a row */ - row = *cp++ ; - /* skip if dead */ - if (ROW_IS_DEAD (row)) - { - continue ; - } - /* compact the column */ - *new_cp++ = row ; - /* add row's external degree */ - score += Row [row].shared1.degree - 1 ; - /* guard against integer overflow */ - score = numext::mini(score, n_col) ; - } - /* determine pruned column length */ - col_length = (IndexType) (new_cp - &A [Col [c].start]) ; - if (col_length == 0) - { - /* a newly-made null column (all rows in this col are "dense" */ - /* and have already been killed) */ - COLAMD_DEBUG2 (("Newly null killed: %d\n", c)) ; - Col [c].shared2.order = --n_col2 ; - KILL_PRINCIPAL_COL (c) ; - } - else - { - /* set column length and set score */ - COLAMD_ASSERT (score >= 0) ; - COLAMD_ASSERT (score <= n_col) ; - Col [c].length = col_length ; - Col [c].shared2.score = score ; - } - } - COLAMD_DEBUG1 (("colamd: Dense, null, and newly-null columns killed: %d\n", - n_col-n_col2)) ; - - /* At this point, all empty rows and columns are dead. All live columns */ - /* are "clean" (containing no dead rows) and simplicial (no supercolumns */ - /* yet). Rows may contain dead columns, but all live rows contain at */ - /* least one live column. */ - - /* === Initialize degree lists ========================================== */ - - - /* clear the hash buckets */ - for (c = 0 ; c <= n_col ; c++) - { - head [c] = COLAMD_EMPTY ; - } - min_score = n_col ; - /* place in reverse order, so low column indices are at the front */ - /* of the lists. This is to encourage natural tie-breaking */ - for (c = n_col-1 ; c >= 0 ; c--) - { - /* only add principal columns to degree lists */ - if (COL_IS_ALIVE (c)) - { - COLAMD_DEBUG4 (("place %d score %d minscore %d ncol %d\n", - c, Col [c].shared2.score, min_score, n_col)) ; - - /* === Add columns score to DList =============================== */ - - score = Col [c].shared2.score ; - - COLAMD_ASSERT (min_score >= 0) ; - COLAMD_ASSERT (min_score <= n_col) ; - COLAMD_ASSERT (score >= 0) ; - COLAMD_ASSERT (score <= n_col) ; - COLAMD_ASSERT (head [score] >= COLAMD_EMPTY) ; - - /* now add this column to dList at proper score location */ - next_col = head [score] ; - Col [c].shared3.prev = COLAMD_EMPTY ; - Col [c].shared4.degree_next = next_col ; - - /* if there already was a column with the same score, set its */ - /* previous pointer to this new column */ - if (next_col != COLAMD_EMPTY) - { - Col [next_col].shared3.prev = c ; - } - head [score] = c ; - - /* see if this score is less than current min */ - min_score = numext::mini(min_score, score) ; - - - } - } - - - /* === Return number of remaining columns, and max row degree =========== */ - - *p_n_col2 = n_col2 ; - *p_n_row2 = n_row2 ; - *p_max_deg = max_deg ; -} - - -/* ========================================================================== */ -/* === find_ordering ======================================================== */ -/* ========================================================================== */ - -/* - Order the principal columns of the supercolumn form of the matrix - (no supercolumns on input). Uses a minimum approximate column minimum - degree ordering method. Not user-callable. -*/ -template -static IndexType find_ordering /* return the number of garbage collections */ - ( - /* === Parameters ======================================================= */ - - IndexType n_row, /* number of rows of A */ - IndexType n_col, /* number of columns of A */ - IndexType Alen, /* size of A, 2*nnz + n_col or larger */ - Colamd_Row Row [], /* of size n_row+1 */ - colamd_col Col [], /* of size n_col+1 */ - IndexType A [], /* column form and row form of A */ - IndexType head [], /* of size n_col+1 */ - IndexType n_col2, /* Remaining columns to order */ - IndexType max_deg, /* Maximum row degree */ - IndexType pfree /* index of first free slot (2*nnz on entry) */ - ) -{ - /* === Local variables ================================================== */ - - IndexType k ; /* current pivot ordering step */ - IndexType pivot_col ; /* current pivot column */ - IndexType *cp ; /* a column pointer */ - IndexType *rp ; /* a row pointer */ - IndexType pivot_row ; /* current pivot row */ - IndexType *new_cp ; /* modified column pointer */ - IndexType *new_rp ; /* modified row pointer */ - IndexType pivot_row_start ; /* pointer to start of pivot row */ - IndexType pivot_row_degree ; /* number of columns in pivot row */ - IndexType pivot_row_length ; /* number of supercolumns in pivot row */ - IndexType pivot_col_score ; /* score of pivot column */ - IndexType needed_memory ; /* free space needed for pivot row */ - IndexType *cp_end ; /* pointer to the end of a column */ - IndexType *rp_end ; /* pointer to the end of a row */ - IndexType row ; /* a row index */ - IndexType col ; /* a column index */ - IndexType max_score ; /* maximum possible score */ - IndexType cur_score ; /* score of current column */ - unsigned int hash ; /* hash value for supernode detection */ - IndexType head_column ; /* head of hash bucket */ - IndexType first_col ; /* first column in hash bucket */ - IndexType tag_mark ; /* marker value for mark array */ - IndexType row_mark ; /* Row [row].shared2.mark */ - IndexType set_difference ; /* set difference size of row with pivot row */ - IndexType min_score ; /* smallest column score */ - IndexType col_thickness ; /* "thickness" (no. of columns in a supercol) */ - IndexType max_mark ; /* maximum value of tag_mark */ - IndexType pivot_col_thickness ; /* number of columns represented by pivot col */ - IndexType prev_col ; /* Used by Dlist operations. */ - IndexType next_col ; /* Used by Dlist operations. */ - IndexType ngarbage ; /* number of garbage collections performed */ - - - /* === Initialization and clear mark ==================================== */ - - max_mark = INT_MAX - n_col ; /* INT_MAX defined in */ - tag_mark = Eigen::internal::clear_mark (n_row, Row) ; - min_score = 0 ; - ngarbage = 0 ; - COLAMD_DEBUG1 (("colamd: Ordering, n_col2=%d\n", n_col2)) ; - - /* === Order the columns ================================================ */ - - for (k = 0 ; k < n_col2 ; /* 'k' is incremented below */) - { - - /* === Select pivot column, and order it ============================ */ - - /* make sure degree list isn't empty */ - COLAMD_ASSERT (min_score >= 0) ; - COLAMD_ASSERT (min_score <= n_col) ; - COLAMD_ASSERT (head [min_score] >= COLAMD_EMPTY) ; - - /* get pivot column from head of minimum degree list */ - while (min_score < n_col && head [min_score] == COLAMD_EMPTY) - { - min_score++ ; - } - pivot_col = head [min_score] ; - COLAMD_ASSERT (pivot_col >= 0 && pivot_col <= n_col) ; - next_col = Col [pivot_col].shared4.degree_next ; - head [min_score] = next_col ; - if (next_col != COLAMD_EMPTY) - { - Col [next_col].shared3.prev = COLAMD_EMPTY ; - } - - COLAMD_ASSERT (COL_IS_ALIVE (pivot_col)) ; - COLAMD_DEBUG3 (("Pivot col: %d\n", pivot_col)) ; - - /* remember score for defrag check */ - pivot_col_score = Col [pivot_col].shared2.score ; - - /* the pivot column is the kth column in the pivot order */ - Col [pivot_col].shared2.order = k ; - - /* increment order count by column thickness */ - pivot_col_thickness = Col [pivot_col].shared1.thickness ; - k += pivot_col_thickness ; - COLAMD_ASSERT (pivot_col_thickness > 0) ; - - /* === Garbage_collection, if necessary ============================= */ - - needed_memory = numext::mini(pivot_col_score, n_col - k) ; - if (pfree + needed_memory >= Alen) - { - pfree = Eigen::internal::garbage_collection (n_row, n_col, Row, Col, A, &A [pfree]) ; - ngarbage++ ; - /* after garbage collection we will have enough */ - COLAMD_ASSERT (pfree + needed_memory < Alen) ; - /* garbage collection has wiped out the Row[].shared2.mark array */ - tag_mark = Eigen::internal::clear_mark (n_row, Row) ; - - } - - /* === Compute pivot row pattern ==================================== */ - - /* get starting location for this new merged row */ - pivot_row_start = pfree ; - - /* initialize new row counts to zero */ - pivot_row_degree = 0 ; - - /* tag pivot column as having been visited so it isn't included */ - /* in merged pivot row */ - Col [pivot_col].shared1.thickness = -pivot_col_thickness ; - - /* pivot row is the union of all rows in the pivot column pattern */ - cp = &A [Col [pivot_col].start] ; - cp_end = cp + Col [pivot_col].length ; - while (cp < cp_end) - { - /* get a row */ - row = *cp++ ; - COLAMD_DEBUG4 (("Pivot col pattern %d %d\n", ROW_IS_ALIVE (row), row)) ; - /* skip if row is dead */ - if (ROW_IS_DEAD (row)) - { - continue ; - } - rp = &A [Row [row].start] ; - rp_end = rp + Row [row].length ; - while (rp < rp_end) - { - /* get a column */ - col = *rp++ ; - /* add the column, if alive and untagged */ - col_thickness = Col [col].shared1.thickness ; - if (col_thickness > 0 && COL_IS_ALIVE (col)) - { - /* tag column in pivot row */ - Col [col].shared1.thickness = -col_thickness ; - COLAMD_ASSERT (pfree < Alen) ; - /* place column in pivot row */ - A [pfree++] = col ; - pivot_row_degree += col_thickness ; - } - } - } - - /* clear tag on pivot column */ - Col [pivot_col].shared1.thickness = pivot_col_thickness ; - max_deg = numext::maxi(max_deg, pivot_row_degree) ; - - - /* === Kill all rows used to construct pivot row ==================== */ - - /* also kill pivot row, temporarily */ - cp = &A [Col [pivot_col].start] ; - cp_end = cp + Col [pivot_col].length ; - while (cp < cp_end) - { - /* may be killing an already dead row */ - row = *cp++ ; - COLAMD_DEBUG3 (("Kill row in pivot col: %d\n", row)) ; - KILL_ROW (row) ; - } - - /* === Select a row index to use as the new pivot row =============== */ - - pivot_row_length = pfree - pivot_row_start ; - if (pivot_row_length > 0) - { - /* pick the "pivot" row arbitrarily (first row in col) */ - pivot_row = A [Col [pivot_col].start] ; - COLAMD_DEBUG3 (("Pivotal row is %d\n", pivot_row)) ; - } - else - { - /* there is no pivot row, since it is of zero length */ - pivot_row = COLAMD_EMPTY ; - COLAMD_ASSERT (pivot_row_length == 0) ; - } - COLAMD_ASSERT (Col [pivot_col].length > 0 || pivot_row_length == 0) ; - - /* === Approximate degree computation =============================== */ - - /* Here begins the computation of the approximate degree. The column */ - /* score is the sum of the pivot row "length", plus the size of the */ - /* set differences of each row in the column minus the pattern of the */ - /* pivot row itself. The column ("thickness") itself is also */ - /* excluded from the column score (we thus use an approximate */ - /* external degree). */ - - /* The time taken by the following code (compute set differences, and */ - /* add them up) is proportional to the size of the data structure */ - /* being scanned - that is, the sum of the sizes of each column in */ - /* the pivot row. Thus, the amortized time to compute a column score */ - /* is proportional to the size of that column (where size, in this */ - /* context, is the column "length", or the number of row indices */ - /* in that column). The number of row indices in a column is */ - /* monotonically non-decreasing, from the length of the original */ - /* column on input to colamd. */ - - /* === Compute set differences ====================================== */ - - COLAMD_DEBUG3 (("** Computing set differences phase. **\n")) ; - - /* pivot row is currently dead - it will be revived later. */ - - COLAMD_DEBUG3 (("Pivot row: ")) ; - /* for each column in pivot row */ - rp = &A [pivot_row_start] ; - rp_end = rp + pivot_row_length ; - while (rp < rp_end) - { - col = *rp++ ; - COLAMD_ASSERT (COL_IS_ALIVE (col) && col != pivot_col) ; - COLAMD_DEBUG3 (("Col: %d\n", col)) ; - - /* clear tags used to construct pivot row pattern */ - col_thickness = -Col [col].shared1.thickness ; - COLAMD_ASSERT (col_thickness > 0) ; - Col [col].shared1.thickness = col_thickness ; - - /* === Remove column from degree list =========================== */ - - cur_score = Col [col].shared2.score ; - prev_col = Col [col].shared3.prev ; - next_col = Col [col].shared4.degree_next ; - COLAMD_ASSERT (cur_score >= 0) ; - COLAMD_ASSERT (cur_score <= n_col) ; - COLAMD_ASSERT (cur_score >= COLAMD_EMPTY) ; - if (prev_col == COLAMD_EMPTY) - { - head [cur_score] = next_col ; - } - else - { - Col [prev_col].shared4.degree_next = next_col ; - } - if (next_col != COLAMD_EMPTY) - { - Col [next_col].shared3.prev = prev_col ; - } - - /* === Scan the column ========================================== */ - - cp = &A [Col [col].start] ; - cp_end = cp + Col [col].length ; - while (cp < cp_end) - { - /* get a row */ - row = *cp++ ; - row_mark = Row [row].shared2.mark ; - /* skip if dead */ - if (ROW_IS_MARKED_DEAD (row_mark)) - { - continue ; - } - COLAMD_ASSERT (row != pivot_row) ; - set_difference = row_mark - tag_mark ; - /* check if the row has been seen yet */ - if (set_difference < 0) - { - COLAMD_ASSERT (Row [row].shared1.degree <= max_deg) ; - set_difference = Row [row].shared1.degree ; - } - /* subtract column thickness from this row's set difference */ - set_difference -= col_thickness ; - COLAMD_ASSERT (set_difference >= 0) ; - /* absorb this row if the set difference becomes zero */ - if (set_difference == 0) - { - COLAMD_DEBUG3 (("aggressive absorption. Row: %d\n", row)) ; - KILL_ROW (row) ; - } - else - { - /* save the new mark */ - Row [row].shared2.mark = set_difference + tag_mark ; - } - } - } - - - /* === Add up set differences for each column ======================= */ - - COLAMD_DEBUG3 (("** Adding set differences phase. **\n")) ; - - /* for each column in pivot row */ - rp = &A [pivot_row_start] ; - rp_end = rp + pivot_row_length ; - while (rp < rp_end) - { - /* get a column */ - col = *rp++ ; - COLAMD_ASSERT (COL_IS_ALIVE (col) && col != pivot_col) ; - hash = 0 ; - cur_score = 0 ; - cp = &A [Col [col].start] ; - /* compact the column */ - new_cp = cp ; - cp_end = cp + Col [col].length ; - - COLAMD_DEBUG4 (("Adding set diffs for Col: %d.\n", col)) ; - - while (cp < cp_end) - { - /* get a row */ - row = *cp++ ; - COLAMD_ASSERT(row >= 0 && row < n_row) ; - row_mark = Row [row].shared2.mark ; - /* skip if dead */ - if (ROW_IS_MARKED_DEAD (row_mark)) - { - continue ; - } - COLAMD_ASSERT (row_mark > tag_mark) ; - /* compact the column */ - *new_cp++ = row ; - /* compute hash function */ - hash += row ; - /* add set difference */ - cur_score += row_mark - tag_mark ; - /* integer overflow... */ - cur_score = numext::mini(cur_score, n_col) ; - } - - /* recompute the column's length */ - Col [col].length = (IndexType) (new_cp - &A [Col [col].start]) ; - - /* === Further mass elimination ================================= */ - - if (Col [col].length == 0) - { - COLAMD_DEBUG4 (("further mass elimination. Col: %d\n", col)) ; - /* nothing left but the pivot row in this column */ - KILL_PRINCIPAL_COL (col) ; - pivot_row_degree -= Col [col].shared1.thickness ; - COLAMD_ASSERT (pivot_row_degree >= 0) ; - /* order it */ - Col [col].shared2.order = k ; - /* increment order count by column thickness */ - k += Col [col].shared1.thickness ; - } - else - { - /* === Prepare for supercolumn detection ==================== */ - - COLAMD_DEBUG4 (("Preparing supercol detection for Col: %d.\n", col)) ; - - /* save score so far */ - Col [col].shared2.score = cur_score ; - - /* add column to hash table, for supercolumn detection */ - hash %= n_col + 1 ; - - COLAMD_DEBUG4 ((" Hash = %d, n_col = %d.\n", hash, n_col)) ; - COLAMD_ASSERT (hash <= n_col) ; - - head_column = head [hash] ; - if (head_column > COLAMD_EMPTY) - { - /* degree list "hash" is non-empty, use prev (shared3) of */ - /* first column in degree list as head of hash bucket */ - first_col = Col [head_column].shared3.headhash ; - Col [head_column].shared3.headhash = col ; - } - else - { - /* degree list "hash" is empty, use head as hash bucket */ - first_col = - (head_column + 2) ; - head [hash] = - (col + 2) ; - } - Col [col].shared4.hash_next = first_col ; - - /* save hash function in Col [col].shared3.hash */ - Col [col].shared3.hash = (IndexType) hash ; - COLAMD_ASSERT (COL_IS_ALIVE (col)) ; - } - } - - /* The approximate external column degree is now computed. */ - - /* === Supercolumn detection ======================================== */ - - COLAMD_DEBUG3 (("** Supercolumn detection phase. **\n")) ; - - Eigen::internal::detect_super_cols (Col, A, head, pivot_row_start, pivot_row_length) ; - - /* === Kill the pivotal column ====================================== */ - - KILL_PRINCIPAL_COL (pivot_col) ; - - /* === Clear mark =================================================== */ - - tag_mark += (max_deg + 1) ; - if (tag_mark >= max_mark) - { - COLAMD_DEBUG2 (("clearing tag_mark\n")) ; - tag_mark = Eigen::internal::clear_mark (n_row, Row) ; - } - - /* === Finalize the new pivot row, and column scores ================ */ - - COLAMD_DEBUG3 (("** Finalize scores phase. **\n")) ; - - /* for each column in pivot row */ - rp = &A [pivot_row_start] ; - /* compact the pivot row */ - new_rp = rp ; - rp_end = rp + pivot_row_length ; - while (rp < rp_end) - { - col = *rp++ ; - /* skip dead columns */ - if (COL_IS_DEAD (col)) - { - continue ; - } - *new_rp++ = col ; - /* add new pivot row to column */ - A [Col [col].start + (Col [col].length++)] = pivot_row ; - - /* retrieve score so far and add on pivot row's degree. */ - /* (we wait until here for this in case the pivot */ - /* row's degree was reduced due to mass elimination). */ - cur_score = Col [col].shared2.score + pivot_row_degree ; - - /* calculate the max possible score as the number of */ - /* external columns minus the 'k' value minus the */ - /* columns thickness */ - max_score = n_col - k - Col [col].shared1.thickness ; - - /* make the score the external degree of the union-of-rows */ - cur_score -= Col [col].shared1.thickness ; - - /* make sure score is less or equal than the max score */ - cur_score = numext::mini(cur_score, max_score) ; - COLAMD_ASSERT (cur_score >= 0) ; - - /* store updated score */ - Col [col].shared2.score = cur_score ; - - /* === Place column back in degree list ========================= */ - - COLAMD_ASSERT (min_score >= 0) ; - COLAMD_ASSERT (min_score <= n_col) ; - COLAMD_ASSERT (cur_score >= 0) ; - COLAMD_ASSERT (cur_score <= n_col) ; - COLAMD_ASSERT (head [cur_score] >= COLAMD_EMPTY) ; - next_col = head [cur_score] ; - Col [col].shared4.degree_next = next_col ; - Col [col].shared3.prev = COLAMD_EMPTY ; - if (next_col != COLAMD_EMPTY) - { - Col [next_col].shared3.prev = col ; - } - head [cur_score] = col ; - - /* see if this score is less than current min */ - min_score = numext::mini(min_score, cur_score) ; - - } - - /* === Resurrect the new pivot row ================================== */ - - if (pivot_row_degree > 0) - { - /* update pivot row length to reflect any cols that were killed */ - /* during super-col detection and mass elimination */ - Row [pivot_row].start = pivot_row_start ; - Row [pivot_row].length = (IndexType) (new_rp - &A[pivot_row_start]) ; - Row [pivot_row].shared1.degree = pivot_row_degree ; - Row [pivot_row].shared2.mark = 0 ; - /* pivot row is no longer dead */ - } - } - - /* === All principal columns have now been ordered ====================== */ - - return (ngarbage) ; -} - - -/* ========================================================================== */ -/* === order_children ======================================================= */ -/* ========================================================================== */ - -/* - The find_ordering routine has ordered all of the principal columns (the - representatives of the supercolumns). The non-principal columns have not - yet been ordered. This routine orders those columns by walking up the - parent tree (a column is a child of the column which absorbed it). The - final permutation vector is then placed in p [0 ... n_col-1], with p [0] - being the first column, and p [n_col-1] being the last. It doesn't look - like it at first glance, but be assured that this routine takes time linear - in the number of columns. Although not immediately obvious, the time - taken by this routine is O (n_col), that is, linear in the number of - columns. Not user-callable. -*/ -template -static inline void order_children -( - /* === Parameters ======================================================= */ - - IndexType n_col, /* number of columns of A */ - colamd_col Col [], /* of size n_col+1 */ - IndexType p [] /* p [0 ... n_col-1] is the column permutation*/ - ) -{ - /* === Local variables ================================================== */ - - IndexType i ; /* loop counter for all columns */ - IndexType c ; /* column index */ - IndexType parent ; /* index of column's parent */ - IndexType order ; /* column's order */ - - /* === Order each non-principal column ================================== */ - - for (i = 0 ; i < n_col ; i++) - { - /* find an un-ordered non-principal column */ - COLAMD_ASSERT (COL_IS_DEAD (i)) ; - if (!COL_IS_DEAD_PRINCIPAL (i) && Col [i].shared2.order == COLAMD_EMPTY) - { - parent = i ; - /* once found, find its principal parent */ - do - { - parent = Col [parent].shared1.parent ; - } while (!COL_IS_DEAD_PRINCIPAL (parent)) ; - - /* now, order all un-ordered non-principal columns along path */ - /* to this parent. collapse tree at the same time */ - c = i ; - /* get order of parent */ - order = Col [parent].shared2.order ; - - do - { - COLAMD_ASSERT (Col [c].shared2.order == COLAMD_EMPTY) ; - - /* order this column */ - Col [c].shared2.order = order++ ; - /* collaps tree */ - Col [c].shared1.parent = parent ; - - /* get immediate parent of this column */ - c = Col [c].shared1.parent ; - - /* continue until we hit an ordered column. There are */ - /* guarranteed not to be anymore unordered columns */ - /* above an ordered column */ - } while (Col [c].shared2.order == COLAMD_EMPTY) ; - - /* re-order the super_col parent to largest order for this group */ - Col [parent].shared2.order = order ; - } - } - - /* === Generate the permutation ========================================= */ - - for (c = 0 ; c < n_col ; c++) - { - p [Col [c].shared2.order] = c ; - } -} - - -/* ========================================================================== */ -/* === detect_super_cols ==================================================== */ -/* ========================================================================== */ - -/* - Detects supercolumns by finding matches between columns in the hash buckets. - Check amongst columns in the set A [row_start ... row_start + row_length-1]. - The columns under consideration are currently *not* in the degree lists, - and have already been placed in the hash buckets. - - The hash bucket for columns whose hash function is equal to h is stored - as follows: - - if head [h] is >= 0, then head [h] contains a degree list, so: - - head [h] is the first column in degree bucket h. - Col [head [h]].headhash gives the first column in hash bucket h. - - otherwise, the degree list is empty, and: - - -(head [h] + 2) is the first column in hash bucket h. - - For a column c in a hash bucket, Col [c].shared3.prev is NOT a "previous - column" pointer. Col [c].shared3.hash is used instead as the hash number - for that column. The value of Col [c].shared4.hash_next is the next column - in the same hash bucket. - - Assuming no, or "few" hash collisions, the time taken by this routine is - linear in the sum of the sizes (lengths) of each column whose score has - just been computed in the approximate degree computation. - Not user-callable. -*/ -template -static void detect_super_cols -( - /* === Parameters ======================================================= */ - - colamd_col Col [], /* of size n_col+1 */ - IndexType A [], /* row indices of A */ - IndexType head [], /* head of degree lists and hash buckets */ - IndexType row_start, /* pointer to set of columns to check */ - IndexType row_length /* number of columns to check */ -) -{ - /* === Local variables ================================================== */ - - IndexType hash ; /* hash value for a column */ - IndexType *rp ; /* pointer to a row */ - IndexType c ; /* a column index */ - IndexType super_c ; /* column index of the column to absorb into */ - IndexType *cp1 ; /* column pointer for column super_c */ - IndexType *cp2 ; /* column pointer for column c */ - IndexType length ; /* length of column super_c */ - IndexType prev_c ; /* column preceding c in hash bucket */ - IndexType i ; /* loop counter */ - IndexType *rp_end ; /* pointer to the end of the row */ - IndexType col ; /* a column index in the row to check */ - IndexType head_column ; /* first column in hash bucket or degree list */ - IndexType first_col ; /* first column in hash bucket */ - - /* === Consider each column in the row ================================== */ - - rp = &A [row_start] ; - rp_end = rp + row_length ; - while (rp < rp_end) - { - col = *rp++ ; - if (COL_IS_DEAD (col)) - { - continue ; - } - - /* get hash number for this column */ - hash = Col [col].shared3.hash ; - COLAMD_ASSERT (hash <= n_col) ; - - /* === Get the first column in this hash bucket ===================== */ - - head_column = head [hash] ; - if (head_column > COLAMD_EMPTY) - { - first_col = Col [head_column].shared3.headhash ; - } - else - { - first_col = - (head_column + 2) ; - } - - /* === Consider each column in the hash bucket ====================== */ - - for (super_c = first_col ; super_c != COLAMD_EMPTY ; - super_c = Col [super_c].shared4.hash_next) - { - COLAMD_ASSERT (COL_IS_ALIVE (super_c)) ; - COLAMD_ASSERT (Col [super_c].shared3.hash == hash) ; - length = Col [super_c].length ; - - /* prev_c is the column preceding column c in the hash bucket */ - prev_c = super_c ; - - /* === Compare super_c with all columns after it ================ */ - - for (c = Col [super_c].shared4.hash_next ; - c != COLAMD_EMPTY ; c = Col [c].shared4.hash_next) - { - COLAMD_ASSERT (c != super_c) ; - COLAMD_ASSERT (COL_IS_ALIVE (c)) ; - COLAMD_ASSERT (Col [c].shared3.hash == hash) ; - - /* not identical if lengths or scores are different */ - if (Col [c].length != length || - Col [c].shared2.score != Col [super_c].shared2.score) - { - prev_c = c ; - continue ; - } - - /* compare the two columns */ - cp1 = &A [Col [super_c].start] ; - cp2 = &A [Col [c].start] ; - - for (i = 0 ; i < length ; i++) - { - /* the columns are "clean" (no dead rows) */ - COLAMD_ASSERT (ROW_IS_ALIVE (*cp1)) ; - COLAMD_ASSERT (ROW_IS_ALIVE (*cp2)) ; - /* row indices will same order for both supercols, */ - /* no gather scatter nessasary */ - if (*cp1++ != *cp2++) - { - break ; - } - } - - /* the two columns are different if the for-loop "broke" */ - if (i != length) - { - prev_c = c ; - continue ; - } - - /* === Got it! two columns are identical =================== */ - - COLAMD_ASSERT (Col [c].shared2.score == Col [super_c].shared2.score) ; - - Col [super_c].shared1.thickness += Col [c].shared1.thickness ; - Col [c].shared1.parent = super_c ; - KILL_NON_PRINCIPAL_COL (c) ; - /* order c later, in order_children() */ - Col [c].shared2.order = COLAMD_EMPTY ; - /* remove c from hash bucket */ - Col [prev_c].shared4.hash_next = Col [c].shared4.hash_next ; - } - } - - /* === Empty this hash bucket ======================================= */ - - if (head_column > COLAMD_EMPTY) - { - /* corresponding degree list "hash" is not empty */ - Col [head_column].shared3.headhash = COLAMD_EMPTY ; - } - else - { - /* corresponding degree list "hash" is empty */ - head [hash] = COLAMD_EMPTY ; - } - } -} - - -/* ========================================================================== */ -/* === garbage_collection =================================================== */ -/* ========================================================================== */ - -/* - Defragments and compacts columns and rows in the workspace A. Used when - all avaliable memory has been used while performing row merging. Returns - the index of the first free position in A, after garbage collection. The - time taken by this routine is linear is the size of the array A, which is - itself linear in the number of nonzeros in the input matrix. - Not user-callable. -*/ -template -static IndexType garbage_collection /* returns the new value of pfree */ - ( - /* === Parameters ======================================================= */ - - IndexType n_row, /* number of rows */ - IndexType n_col, /* number of columns */ - Colamd_Row Row [], /* row info */ - colamd_col Col [], /* column info */ - IndexType A [], /* A [0 ... Alen-1] holds the matrix */ - IndexType *pfree /* &A [0] ... pfree is in use */ - ) -{ - /* === Local variables ================================================== */ - - IndexType *psrc ; /* source pointer */ - IndexType *pdest ; /* destination pointer */ - IndexType j ; /* counter */ - IndexType r ; /* a row index */ - IndexType c ; /* a column index */ - IndexType length ; /* length of a row or column */ - - /* === Defragment the columns =========================================== */ - - pdest = &A[0] ; - for (c = 0 ; c < n_col ; c++) - { - if (COL_IS_ALIVE (c)) - { - psrc = &A [Col [c].start] ; - - /* move and compact the column */ - COLAMD_ASSERT (pdest <= psrc) ; - Col [c].start = (IndexType) (pdest - &A [0]) ; - length = Col [c].length ; - for (j = 0 ; j < length ; j++) - { - r = *psrc++ ; - if (ROW_IS_ALIVE (r)) - { - *pdest++ = r ; - } - } - Col [c].length = (IndexType) (pdest - &A [Col [c].start]) ; - } - } - - /* === Prepare to defragment the rows =================================== */ - - for (r = 0 ; r < n_row ; r++) - { - if (ROW_IS_ALIVE (r)) - { - if (Row [r].length == 0) - { - /* this row is of zero length. cannot compact it, so kill it */ - COLAMD_DEBUG3 (("Defrag row kill\n")) ; - KILL_ROW (r) ; - } - else - { - /* save first column index in Row [r].shared2.first_column */ - psrc = &A [Row [r].start] ; - Row [r].shared2.first_column = *psrc ; - COLAMD_ASSERT (ROW_IS_ALIVE (r)) ; - /* flag the start of the row with the one's complement of row */ - *psrc = ONES_COMPLEMENT (r) ; - - } - } - } - - /* === Defragment the rows ============================================== */ - - psrc = pdest ; - while (psrc < pfree) - { - /* find a negative number ... the start of a row */ - if (*psrc++ < 0) - { - psrc-- ; - /* get the row index */ - r = ONES_COMPLEMENT (*psrc) ; - COLAMD_ASSERT (r >= 0 && r < n_row) ; - /* restore first column index */ - *psrc = Row [r].shared2.first_column ; - COLAMD_ASSERT (ROW_IS_ALIVE (r)) ; - - /* move and compact the row */ - COLAMD_ASSERT (pdest <= psrc) ; - Row [r].start = (IndexType) (pdest - &A [0]) ; - length = Row [r].length ; - for (j = 0 ; j < length ; j++) - { - c = *psrc++ ; - if (COL_IS_ALIVE (c)) - { - *pdest++ = c ; - } - } - Row [r].length = (IndexType) (pdest - &A [Row [r].start]) ; - - } - } - /* ensure we found all the rows */ - COLAMD_ASSERT (debug_rows == 0) ; - - /* === Return the new value of pfree ==================================== */ - - return ((IndexType) (pdest - &A [0])) ; -} - - -/* ========================================================================== */ -/* === clear_mark =========================================================== */ -/* ========================================================================== */ - -/* - Clears the Row [].shared2.mark array, and returns the new tag_mark. - Return value is the new tag_mark. Not user-callable. -*/ -template -static inline IndexType clear_mark /* return the new value for tag_mark */ - ( - /* === Parameters ======================================================= */ - - IndexType n_row, /* number of rows in A */ - Colamd_Row Row [] /* Row [0 ... n_row-1].shared2.mark is set to zero */ - ) -{ - /* === Local variables ================================================== */ - - IndexType r ; - - for (r = 0 ; r < n_row ; r++) - { - if (ROW_IS_ALIVE (r)) - { - Row [r].shared2.mark = 0 ; - } - } - return (1) ; -} - - -} // namespace internal -#endif diff --git a/Eigen/src/OrderingMethods/Ordering.h b/Eigen/src/OrderingMethods/Ordering.h deleted file mode 100644 index 34dbef487..000000000 --- a/Eigen/src/OrderingMethods/Ordering.h +++ /dev/null @@ -1,157 +0,0 @@ - -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_ORDERING_H -#define EIGEN_ORDERING_H - -namespace Eigen { - -#include "Eigen_Colamd.h" - -namespace internal { - -/** \internal - * \ingroup OrderingMethods_Module - * \param[in] A the input non-symmetric matrix - * \param[out] symmat the symmetric pattern A^T+A from the input matrix \a A. - * FIXME: The values should not be considered here - */ -template -void ordering_helper_at_plus_a(const MatrixType& A, MatrixType& symmat) -{ - MatrixType C; - C = A.transpose(); // NOTE: Could be costly - for (int i = 0; i < C.rows(); i++) - { - for (typename MatrixType::InnerIterator it(C, i); it; ++it) - it.valueRef() = typename MatrixType::Scalar(0); - } - symmat = C + A; -} - -} - -#ifndef EIGEN_MPL2_ONLY - -/** \ingroup OrderingMethods_Module - * \class AMDOrdering - * - * Functor computing the \em approximate \em minimum \em degree ordering - * If the matrix is not structurally symmetric, an ordering of A^T+A is computed - * \tparam StorageIndex The type of indices of the matrix - * \sa COLAMDOrdering - */ -template -class AMDOrdering -{ - public: - typedef PermutationMatrix PermutationType; - - /** Compute the permutation vector from a sparse matrix - * This routine is much faster if the input matrix is column-major - */ - template - void operator()(const MatrixType& mat, PermutationType& perm) - { - // Compute the symmetric pattern - SparseMatrix symm; - internal::ordering_helper_at_plus_a(mat,symm); - - // Call the AMD routine - //m_mat.prune(keep_diag()); - internal::minimum_degree_ordering(symm, perm); - } - - /** Compute the permutation with a selfadjoint matrix */ - template - void operator()(const SparseSelfAdjointView& mat, PermutationType& perm) - { - SparseMatrix C; C = mat; - - // Call the AMD routine - // m_mat.prune(keep_diag()); //Remove the diagonal elements - internal::minimum_degree_ordering(C, perm); - } -}; - -#endif // EIGEN_MPL2_ONLY - -/** \ingroup OrderingMethods_Module - * \class NaturalOrdering - * - * Functor computing the natural ordering (identity) - * - * \note Returns an empty permutation matrix - * \tparam StorageIndex The type of indices of the matrix - */ -template -class NaturalOrdering -{ - public: - typedef PermutationMatrix PermutationType; - - /** Compute the permutation vector from a column-major sparse matrix */ - template - void operator()(const MatrixType& /*mat*/, PermutationType& perm) - { - perm.resize(0); - } - -}; - -/** \ingroup OrderingMethods_Module - * \class COLAMDOrdering - * - * \tparam StorageIndex The type of indices of the matrix - * - * Functor computing the \em column \em approximate \em minimum \em degree ordering - * The matrix should be in column-major and \b compressed format (see SparseMatrix::makeCompressed()). - */ -template -class COLAMDOrdering -{ - public: - typedef PermutationMatrix PermutationType; - typedef Matrix IndexVector; - - /** Compute the permutation vector \a perm form the sparse matrix \a mat - * \warning The input sparse matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()). - */ - template - void operator() (const MatrixType& mat, PermutationType& perm) - { - eigen_assert(mat.isCompressed() && "COLAMDOrdering requires a sparse matrix in compressed mode. Call .makeCompressed() before passing it to COLAMDOrdering"); - - StorageIndex m = StorageIndex(mat.rows()); - StorageIndex n = StorageIndex(mat.cols()); - StorageIndex nnz = StorageIndex(mat.nonZeros()); - // Get the recommended value of Alen to be used by colamd - StorageIndex Alen = internal::colamd_recommended(nnz, m, n); - // Set the default parameters - double knobs [COLAMD_KNOBS]; - StorageIndex stats [COLAMD_STATS]; - internal::colamd_set_defaults(knobs); - - IndexVector p(n+1), A(Alen); - for(StorageIndex i=0; i <= n; i++) p(i) = mat.outerIndexPtr()[i]; - for(StorageIndex i=0; i < nnz; i++) A(i) = mat.innerIndexPtr()[i]; - // Call Colamd routine to compute the ordering - StorageIndex info = internal::colamd(m, n, Alen, A.data(), p.data(), knobs, stats); - EIGEN_UNUSED_VARIABLE(info); - eigen_assert( info && "COLAMD failed " ); - - perm.resize(n); - for (StorageIndex i = 0; i < n; i++) perm.indices()(p(i)) = i; - } -}; - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/PaStiXSupport/PaStiXSupport.h b/Eigen/src/PaStiXSupport/PaStiXSupport.h deleted file mode 100644 index 160d8a523..000000000 --- a/Eigen/src/PaStiXSupport/PaStiXSupport.h +++ /dev/null @@ -1,678 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PASTIXSUPPORT_H -#define EIGEN_PASTIXSUPPORT_H - -namespace Eigen { - -#if defined(DCOMPLEX) - #define PASTIX_COMPLEX COMPLEX - #define PASTIX_DCOMPLEX DCOMPLEX -#else - #define PASTIX_COMPLEX std::complex - #define PASTIX_DCOMPLEX std::complex -#endif - -/** \ingroup PaStiXSupport_Module - * \brief Interface to the PaStix solver - * - * This class is used to solve the linear systems A.X = B via the PaStix library. - * The matrix can be either real or complex, symmetric or not. - * - * \sa TutorialSparseDirectSolvers - */ -template class PastixLU; -template class PastixLLT; -template class PastixLDLT; - -namespace internal -{ - - template struct pastix_traits; - - template - struct pastix_traits< PastixLU<_MatrixType> > - { - typedef _MatrixType MatrixType; - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef typename _MatrixType::StorageIndex StorageIndex; - }; - - template - struct pastix_traits< PastixLLT<_MatrixType,Options> > - { - typedef _MatrixType MatrixType; - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef typename _MatrixType::StorageIndex StorageIndex; - }; - - template - struct pastix_traits< PastixLDLT<_MatrixType,Options> > - { - typedef _MatrixType MatrixType; - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef typename _MatrixType::StorageIndex StorageIndex; - }; - - inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, float *vals, int *perm, int * invp, float *x, int nbrhs, int *iparm, double *dparm) - { - if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; } - if (nbrhs == 0) {x = NULL; nbrhs=1;} - s_pastix(pastix_data, pastix_comm, n, ptr, idx, vals, perm, invp, x, nbrhs, iparm, dparm); - } - - inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, double *vals, int *perm, int * invp, double *x, int nbrhs, int *iparm, double *dparm) - { - if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; } - if (nbrhs == 0) {x = NULL; nbrhs=1;} - d_pastix(pastix_data, pastix_comm, n, ptr, idx, vals, perm, invp, x, nbrhs, iparm, dparm); - } - - inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, std::complex *vals, int *perm, int * invp, std::complex *x, int nbrhs, int *iparm, double *dparm) - { - if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; } - if (nbrhs == 0) {x = NULL; nbrhs=1;} - c_pastix(pastix_data, pastix_comm, n, ptr, idx, reinterpret_cast(vals), perm, invp, reinterpret_cast(x), nbrhs, iparm, dparm); - } - - inline void eigen_pastix(pastix_data_t **pastix_data, int pastix_comm, int n, int *ptr, int *idx, std::complex *vals, int *perm, int * invp, std::complex *x, int nbrhs, int *iparm, double *dparm) - { - if (n == 0) { ptr = NULL; idx = NULL; vals = NULL; } - if (nbrhs == 0) {x = NULL; nbrhs=1;} - z_pastix(pastix_data, pastix_comm, n, ptr, idx, reinterpret_cast(vals), perm, invp, reinterpret_cast(x), nbrhs, iparm, dparm); - } - - // Convert the matrix to Fortran-style Numbering - template - void c_to_fortran_numbering (MatrixType& mat) - { - if ( !(mat.outerIndexPtr()[0]) ) - { - int i; - for(i = 0; i <= mat.rows(); ++i) - ++mat.outerIndexPtr()[i]; - for(i = 0; i < mat.nonZeros(); ++i) - ++mat.innerIndexPtr()[i]; - } - } - - // Convert to C-style Numbering - template - void fortran_to_c_numbering (MatrixType& mat) - { - // Check the Numbering - if ( mat.outerIndexPtr()[0] == 1 ) - { // Convert to C-style numbering - int i; - for(i = 0; i <= mat.rows(); ++i) - --mat.outerIndexPtr()[i]; - for(i = 0; i < mat.nonZeros(); ++i) - --mat.innerIndexPtr()[i]; - } - } -} - -// This is the base class to interface with PaStiX functions. -// Users should not used this class directly. -template -class PastixBase : public SparseSolverBase -{ - protected: - typedef SparseSolverBase Base; - using Base::derived; - using Base::m_isInitialized; - public: - using Base::_solve_impl; - - typedef typename internal::pastix_traits::MatrixType _MatrixType; - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Matrix Vector; - typedef SparseMatrix ColSpMatrix; - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - - PastixBase() : m_initisOk(false), m_analysisIsOk(false), m_factorizationIsOk(false), m_pastixdata(0), m_size(0) - { - init(); - } - - ~PastixBase() - { - clean(); - } - - template - bool _solve_impl(const MatrixBase &b, MatrixBase &x) const; - - /** Returns a reference to the integer vector IPARM of PaStiX parameters - * to modify the default parameters. - * The statistics related to the different phases of factorization and solve are saved here as well - * \sa analyzePattern() factorize() - */ - Array& iparm() - { - return m_iparm; - } - - /** Return a reference to a particular index parameter of the IPARM vector - * \sa iparm() - */ - - int& iparm(int idxparam) - { - return m_iparm(idxparam); - } - - /** Returns a reference to the double vector DPARM of PaStiX parameters - * The statistics related to the different phases of factorization and solve are saved here as well - * \sa analyzePattern() factorize() - */ - Array& dparm() - { - return m_dparm; - } - - - /** Return a reference to a particular index parameter of the DPARM vector - * \sa dparm() - */ - double& dparm(int idxparam) - { - return m_dparm(idxparam); - } - - inline Index cols() const { return m_size; } - inline Index rows() const { return m_size; } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the PaStiX reports a problem - * \c InvalidInput if the input matrix is invalid - * - * \sa iparm() - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - protected: - - // Initialize the Pastix data structure, check the matrix - void init(); - - // Compute the ordering and the symbolic factorization - void analyzePattern(ColSpMatrix& mat); - - // Compute the numerical factorization - void factorize(ColSpMatrix& mat); - - // Free all the data allocated by Pastix - void clean() - { - eigen_assert(m_initisOk && "The Pastix structure should be allocated first"); - m_iparm(IPARM_START_TASK) = API_TASK_CLEAN; - m_iparm(IPARM_END_TASK) = API_TASK_CLEAN; - internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, 0, 0, 0, (Scalar*)0, - m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data()); - } - - void compute(ColSpMatrix& mat); - - int m_initisOk; - int m_analysisIsOk; - int m_factorizationIsOk; - mutable ComputationInfo m_info; - mutable pastix_data_t *m_pastixdata; // Data structure for pastix - mutable int m_comm; // The MPI communicator identifier - mutable Array m_iparm; // integer vector for the input parameters - mutable Array m_dparm; // Scalar vector for the input parameters - mutable Matrix m_perm; // Permutation vector - mutable Matrix m_invp; // Inverse permutation vector - mutable int m_size; // Size of the matrix -}; - - /** Initialize the PaStiX data structure. - *A first call to this function fills iparm and dparm with the default PaStiX parameters - * \sa iparm() dparm() - */ -template -void PastixBase::init() -{ - m_size = 0; - m_iparm.setZero(IPARM_SIZE); - m_dparm.setZero(DPARM_SIZE); - - m_iparm(IPARM_MODIFY_PARAMETER) = API_NO; - pastix(&m_pastixdata, MPI_COMM_WORLD, - 0, 0, 0, 0, - 0, 0, 0, 1, m_iparm.data(), m_dparm.data()); - - m_iparm[IPARM_MATRIX_VERIFICATION] = API_NO; - m_iparm[IPARM_VERBOSE] = API_VERBOSE_NOT; - m_iparm[IPARM_ORDERING] = API_ORDER_SCOTCH; - m_iparm[IPARM_INCOMPLETE] = API_NO; - m_iparm[IPARM_OOC_LIMIT] = 2000; - m_iparm[IPARM_RHS_MAKING] = API_RHS_B; - m_iparm(IPARM_MATRIX_VERIFICATION) = API_NO; - - m_iparm(IPARM_START_TASK) = API_TASK_INIT; - m_iparm(IPARM_END_TASK) = API_TASK_INIT; - internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, 0, 0, 0, (Scalar*)0, - 0, 0, 0, 0, m_iparm.data(), m_dparm.data()); - - // Check the returned error - if(m_iparm(IPARM_ERROR_NUMBER)) { - m_info = InvalidInput; - m_initisOk = false; - } - else { - m_info = Success; - m_initisOk = true; - } -} - -template -void PastixBase::compute(ColSpMatrix& mat) -{ - eigen_assert(mat.rows() == mat.cols() && "The input matrix should be squared"); - - analyzePattern(mat); - factorize(mat); - - m_iparm(IPARM_MATRIX_VERIFICATION) = API_NO; -} - - -template -void PastixBase::analyzePattern(ColSpMatrix& mat) -{ - eigen_assert(m_initisOk && "The initialization of PaSTiX failed"); - - // clean previous calls - if(m_size>0) - clean(); - - m_size = internal::convert_index(mat.rows()); - m_perm.resize(m_size); - m_invp.resize(m_size); - - m_iparm(IPARM_START_TASK) = API_TASK_ORDERING; - m_iparm(IPARM_END_TASK) = API_TASK_ANALYSE; - internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(), - mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data()); - - // Check the returned error - if(m_iparm(IPARM_ERROR_NUMBER)) - { - m_info = NumericalIssue; - m_analysisIsOk = false; - } - else - { - m_info = Success; - m_analysisIsOk = true; - } -} - -template -void PastixBase::factorize(ColSpMatrix& mat) -{ -// if(&m_cpyMat != &mat) m_cpyMat = mat; - eigen_assert(m_analysisIsOk && "The analysis phase should be called before the factorization phase"); - m_iparm(IPARM_START_TASK) = API_TASK_NUMFACT; - m_iparm(IPARM_END_TASK) = API_TASK_NUMFACT; - m_size = internal::convert_index(mat.rows()); - - internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, m_size, mat.outerIndexPtr(), mat.innerIndexPtr(), - mat.valuePtr(), m_perm.data(), m_invp.data(), 0, 0, m_iparm.data(), m_dparm.data()); - - // Check the returned error - if(m_iparm(IPARM_ERROR_NUMBER)) - { - m_info = NumericalIssue; - m_factorizationIsOk = false; - m_isInitialized = false; - } - else - { - m_info = Success; - m_factorizationIsOk = true; - m_isInitialized = true; - } -} - -/* Solve the system */ -template -template -bool PastixBase::_solve_impl(const MatrixBase &b, MatrixBase &x) const -{ - eigen_assert(m_isInitialized && "The matrix should be factorized first"); - EIGEN_STATIC_ASSERT((Dest::Flags&RowMajorBit)==0, - THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); - int rhs = 1; - - x = b; /* on return, x is overwritten by the computed solution */ - - for (int i = 0; i < b.cols(); i++){ - m_iparm[IPARM_START_TASK] = API_TASK_SOLVE; - m_iparm[IPARM_END_TASK] = API_TASK_REFINE; - - internal::eigen_pastix(&m_pastixdata, MPI_COMM_WORLD, internal::convert_index(x.rows()), 0, 0, 0, - m_perm.data(), m_invp.data(), &x(0, i), rhs, m_iparm.data(), m_dparm.data()); - } - - // Check the returned error - m_info = m_iparm(IPARM_ERROR_NUMBER)==0 ? Success : NumericalIssue; - - return m_iparm(IPARM_ERROR_NUMBER)==0; -} - -/** \ingroup PaStiXSupport_Module - * \class PastixLU - * \brief Sparse direct LU solver based on PaStiX library - * - * This class is used to solve the linear systems A.X = B with a supernodal LU - * factorization in the PaStiX library. The matrix A should be squared and nonsingular - * PaStiX requires that the matrix A has a symmetric structural pattern. - * This interface can symmetrize the input matrix otherwise. - * The vectors or matrices X and B can be either dense or sparse. - * - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * \tparam IsStrSym Indicates if the input matrix has a symmetric pattern, default is false - * NOTE : Note that if the analysis and factorization phase are called separately, - * the input matrix will be symmetrized at each call, hence it is advised to - * symmetrize the matrix in a end-user program and set \p IsStrSym to true - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SparseLU - * - */ -template -class PastixLU : public PastixBase< PastixLU<_MatrixType> > -{ - public: - typedef _MatrixType MatrixType; - typedef PastixBase > Base; - typedef typename Base::ColSpMatrix ColSpMatrix; - typedef typename MatrixType::StorageIndex StorageIndex; - - public: - PastixLU() : Base() - { - init(); - } - - explicit PastixLU(const MatrixType& matrix):Base() - { - init(); - compute(matrix); - } - /** Compute the LU supernodal factorization of \p matrix. - * iparm and dparm can be used to tune the PaStiX parameters. - * see the PaStiX user's manual - * \sa analyzePattern() factorize() - */ - void compute (const MatrixType& matrix) - { - m_structureIsUptodate = false; - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::compute(temp); - } - /** Compute the LU symbolic factorization of \p matrix using its sparsity pattern. - * Several ordering methods can be used at this step. See the PaStiX user's manual. - * The result of this operation can be used with successive matrices having the same pattern as \p matrix - * \sa factorize() - */ - void analyzePattern(const MatrixType& matrix) - { - m_structureIsUptodate = false; - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::analyzePattern(temp); - } - - /** Compute the LU supernodal factorization of \p matrix - * WARNING The matrix \p matrix should have the same structural pattern - * as the same used in the analysis phase. - * \sa analyzePattern() - */ - void factorize(const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::factorize(temp); - } - protected: - - void init() - { - m_structureIsUptodate = false; - m_iparm(IPARM_SYM) = API_SYM_NO; - m_iparm(IPARM_FACTORIZATION) = API_FACT_LU; - } - - void grabMatrix(const MatrixType& matrix, ColSpMatrix& out) - { - if(IsStrSym) - out = matrix; - else - { - if(!m_structureIsUptodate) - { - // update the transposed structure - m_transposedStructure = matrix.transpose(); - - // Set the elements of the matrix to zero - for (Index j=0; j - * \tparam UpLo The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SimplicialLLT - */ -template -class PastixLLT : public PastixBase< PastixLLT<_MatrixType, _UpLo> > -{ - public: - typedef _MatrixType MatrixType; - typedef PastixBase > Base; - typedef typename Base::ColSpMatrix ColSpMatrix; - - public: - enum { UpLo = _UpLo }; - PastixLLT() : Base() - { - init(); - } - - explicit PastixLLT(const MatrixType& matrix):Base() - { - init(); - compute(matrix); - } - - /** Compute the L factor of the LL^T supernodal factorization of \p matrix - * \sa analyzePattern() factorize() - */ - void compute (const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::compute(temp); - } - - /** Compute the LL^T symbolic factorization of \p matrix using its sparsity pattern - * The result of this operation can be used with successive matrices having the same pattern as \p matrix - * \sa factorize() - */ - void analyzePattern(const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::analyzePattern(temp); - } - /** Compute the LL^T supernodal numerical factorization of \p matrix - * \sa analyzePattern() - */ - void factorize(const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::factorize(temp); - } - protected: - using Base::m_iparm; - - void init() - { - m_iparm(IPARM_SYM) = API_SYM_YES; - m_iparm(IPARM_FACTORIZATION) = API_FACT_LLT; - } - - void grabMatrix(const MatrixType& matrix, ColSpMatrix& out) - { - out.resize(matrix.rows(), matrix.cols()); - // Pastix supports only lower, column-major matrices - out.template selfadjointView() = matrix.template selfadjointView(); - internal::c_to_fortran_numbering(out); - } -}; - -/** \ingroup PaStiXSupport_Module - * \class PastixLDLT - * \brief A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library - * - * This class is used to solve the linear systems A.X = B via a LDL^T supernodal Cholesky factorization - * available in the PaStiX library. The matrix A should be symmetric and positive definite - * WARNING Selfadjoint complex matrices are not supported in the current version of PaStiX - * The vectors or matrices X and B can be either dense or sparse - * - * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * \tparam UpLo The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SimplicialLDLT - */ -template -class PastixLDLT : public PastixBase< PastixLDLT<_MatrixType, _UpLo> > -{ - public: - typedef _MatrixType MatrixType; - typedef PastixBase > Base; - typedef typename Base::ColSpMatrix ColSpMatrix; - - public: - enum { UpLo = _UpLo }; - PastixLDLT():Base() - { - init(); - } - - explicit PastixLDLT(const MatrixType& matrix):Base() - { - init(); - compute(matrix); - } - - /** Compute the L and D factors of the LDL^T factorization of \p matrix - * \sa analyzePattern() factorize() - */ - void compute (const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::compute(temp); - } - - /** Compute the LDL^T symbolic factorization of \p matrix using its sparsity pattern - * The result of this operation can be used with successive matrices having the same pattern as \p matrix - * \sa factorize() - */ - void analyzePattern(const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::analyzePattern(temp); - } - /** Compute the LDL^T supernodal numerical factorization of \p matrix - * - */ - void factorize(const MatrixType& matrix) - { - ColSpMatrix temp; - grabMatrix(matrix, temp); - Base::factorize(temp); - } - - protected: - using Base::m_iparm; - - void init() - { - m_iparm(IPARM_SYM) = API_SYM_YES; - m_iparm(IPARM_FACTORIZATION) = API_FACT_LDLT; - } - - void grabMatrix(const MatrixType& matrix, ColSpMatrix& out) - { - // Pastix supports only lower, column-major matrices - out.resize(matrix.rows(), matrix.cols()); - out.template selfadjointView() = matrix.template selfadjointView(); - internal::c_to_fortran_numbering(out); - } -}; - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/PardisoSupport/PardisoSupport.h b/Eigen/src/PardisoSupport/PardisoSupport.h deleted file mode 100644 index 091c3970e..000000000 --- a/Eigen/src/PardisoSupport/PardisoSupport.h +++ /dev/null @@ -1,543 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to Intel(R) MKL PARDISO - ******************************************************************************** -*/ - -#ifndef EIGEN_PARDISOSUPPORT_H -#define EIGEN_PARDISOSUPPORT_H - -namespace Eigen { - -template class PardisoLU; -template class PardisoLLT; -template class PardisoLDLT; - -namespace internal -{ - template - struct pardiso_run_selector - { - static IndexType run( _MKL_DSS_HANDLE_t pt, IndexType maxfct, IndexType mnum, IndexType type, IndexType phase, IndexType n, void *a, - IndexType *ia, IndexType *ja, IndexType *perm, IndexType nrhs, IndexType *iparm, IndexType msglvl, void *b, void *x) - { - IndexType error = 0; - ::pardiso(pt, &maxfct, &mnum, &type, &phase, &n, a, ia, ja, perm, &nrhs, iparm, &msglvl, b, x, &error); - return error; - } - }; - template<> - struct pardiso_run_selector - { - typedef long long int IndexType; - static IndexType run( _MKL_DSS_HANDLE_t pt, IndexType maxfct, IndexType mnum, IndexType type, IndexType phase, IndexType n, void *a, - IndexType *ia, IndexType *ja, IndexType *perm, IndexType nrhs, IndexType *iparm, IndexType msglvl, void *b, void *x) - { - IndexType error = 0; - ::pardiso_64(pt, &maxfct, &mnum, &type, &phase, &n, a, ia, ja, perm, &nrhs, iparm, &msglvl, b, x, &error); - return error; - } - }; - - template struct pardiso_traits; - - template - struct pardiso_traits< PardisoLU<_MatrixType> > - { - typedef _MatrixType MatrixType; - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef typename _MatrixType::StorageIndex StorageIndex; - }; - - template - struct pardiso_traits< PardisoLLT<_MatrixType, Options> > - { - typedef _MatrixType MatrixType; - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef typename _MatrixType::StorageIndex StorageIndex; - }; - - template - struct pardiso_traits< PardisoLDLT<_MatrixType, Options> > - { - typedef _MatrixType MatrixType; - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef typename _MatrixType::StorageIndex StorageIndex; - }; - -} // end namespace internal - -template -class PardisoImpl : public SparseSolverBase -{ - protected: - typedef SparseSolverBase Base; - using Base::derived; - using Base::m_isInitialized; - - typedef internal::pardiso_traits Traits; - public: - using Base::_solve_impl; - - typedef typename Traits::MatrixType MatrixType; - typedef typename Traits::Scalar Scalar; - typedef typename Traits::RealScalar RealScalar; - typedef typename Traits::StorageIndex StorageIndex; - typedef SparseMatrix SparseMatrixType; - typedef Matrix VectorType; - typedef Matrix IntRowVectorType; - typedef Matrix IntColVectorType; - typedef Array ParameterType; - enum { - ScalarIsComplex = NumTraits::IsComplex, - ColsAtCompileTime = Dynamic, - MaxColsAtCompileTime = Dynamic - }; - - PardisoImpl() - { - eigen_assert((sizeof(StorageIndex) >= sizeof(_INTEGER_t) && sizeof(StorageIndex) <= 8) && "Non-supported index type"); - m_iparm.setZero(); - m_msglvl = 0; // No output - m_isInitialized = false; - } - - ~PardisoImpl() - { - pardisoRelease(); - } - - inline Index cols() const { return m_size; } - inline Index rows() const { return m_size; } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the matrix appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - /** \warning for advanced usage only. - * \returns a reference to the parameter array controlling PARDISO. - * See the PARDISO manual to know how to use it. */ - ParameterType& pardisoParameterArray() - { - return m_iparm; - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - Derived& analyzePattern(const MatrixType& matrix); - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed. - * - * \sa analyzePattern() - */ - Derived& factorize(const MatrixType& matrix); - - Derived& compute(const MatrixType& matrix); - - template - void _solve_impl(const MatrixBase &b, MatrixBase &dest) const; - - protected: - void pardisoRelease() - { - if(m_isInitialized) // Factorization ran at least once - { - internal::pardiso_run_selector::run(m_pt, 1, 1, m_type, -1, internal::convert_index(m_size),0, 0, 0, m_perm.data(), 0, - m_iparm.data(), m_msglvl, NULL, NULL); - m_isInitialized = false; - } - } - - void pardisoInit(int type) - { - m_type = type; - bool symmetric = std::abs(m_type) < 10; - m_iparm[0] = 1; // No solver default - m_iparm[1] = 2; // use Metis for the ordering - m_iparm[2] = 0; // Reserved. Set to zero. (??Numbers of processors, value of OMP_NUM_THREADS??) - m_iparm[3] = 0; // No iterative-direct algorithm - m_iparm[4] = 0; // No user fill-in reducing permutation - m_iparm[5] = 0; // Write solution into x, b is left unchanged - m_iparm[6] = 0; // Not in use - m_iparm[7] = 2; // Max numbers of iterative refinement steps - m_iparm[8] = 0; // Not in use - m_iparm[9] = 13; // Perturb the pivot elements with 1E-13 - m_iparm[10] = symmetric ? 0 : 1; // Use nonsymmetric permutation and scaling MPS - m_iparm[11] = 0; // Not in use - m_iparm[12] = symmetric ? 0 : 1; // Maximum weighted matching algorithm is switched-off (default for symmetric). - // Try m_iparm[12] = 1 in case of inappropriate accuracy - m_iparm[13] = 0; // Output: Number of perturbed pivots - m_iparm[14] = 0; // Not in use - m_iparm[15] = 0; // Not in use - m_iparm[16] = 0; // Not in use - m_iparm[17] = -1; // Output: Number of nonzeros in the factor LU - m_iparm[18] = -1; // Output: Mflops for LU factorization - m_iparm[19] = 0; // Output: Numbers of CG Iterations - - m_iparm[20] = 0; // 1x1 pivoting - m_iparm[26] = 0; // No matrix checker - m_iparm[27] = (sizeof(RealScalar) == 4) ? 1 : 0; - m_iparm[34] = 1; // C indexing - m_iparm[36] = 0; // CSR - m_iparm[59] = 0; // 0 - In-Core ; 1 - Automatic switch between In-Core and Out-of-Core modes ; 2 - Out-of-Core - - memset(m_pt, 0, sizeof(m_pt)); - } - - protected: - // cached data to reduce reallocation, etc. - - void manageErrorCode(Index error) const - { - switch(error) - { - case 0: - m_info = Success; - break; - case -4: - case -7: - m_info = NumericalIssue; - break; - default: - m_info = InvalidInput; - } - } - - mutable SparseMatrixType m_matrix; - mutable ComputationInfo m_info; - bool m_analysisIsOk, m_factorizationIsOk; - StorageIndex m_type, m_msglvl; - mutable void *m_pt[64]; - mutable ParameterType m_iparm; - mutable IntColVectorType m_perm; - Index m_size; - -}; - -template -Derived& PardisoImpl::compute(const MatrixType& a) -{ - m_size = a.rows(); - eigen_assert(a.rows() == a.cols()); - - pardisoRelease(); - m_perm.setZero(m_size); - derived().getMatrix(a); - - Index error; - error = internal::pardiso_run_selector::run(m_pt, 1, 1, m_type, 12, internal::convert_index(m_size), - m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), - m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL); - manageErrorCode(error); - m_analysisIsOk = true; - m_factorizationIsOk = true; - m_isInitialized = true; - return derived(); -} - -template -Derived& PardisoImpl::analyzePattern(const MatrixType& a) -{ - m_size = a.rows(); - eigen_assert(m_size == a.cols()); - - pardisoRelease(); - m_perm.setZero(m_size); - derived().getMatrix(a); - - Index error; - error = internal::pardiso_run_selector::run(m_pt, 1, 1, m_type, 11, internal::convert_index(m_size), - m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), - m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL); - - manageErrorCode(error); - m_analysisIsOk = true; - m_factorizationIsOk = false; - m_isInitialized = true; - return derived(); -} - -template -Derived& PardisoImpl::factorize(const MatrixType& a) -{ - eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); - eigen_assert(m_size == a.rows() && m_size == a.cols()); - - derived().getMatrix(a); - - Index error; - error = internal::pardiso_run_selector::run(m_pt, 1, 1, m_type, 22, internal::convert_index(m_size), - m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), - m_perm.data(), 0, m_iparm.data(), m_msglvl, NULL, NULL); - - manageErrorCode(error); - m_factorizationIsOk = true; - return derived(); -} - -template -template -void PardisoImpl::_solve_impl(const MatrixBase &b, MatrixBase& x) const -{ - if(m_iparm[0] == 0) // Factorization was not computed - { - m_info = InvalidInput; - return; - } - - //Index n = m_matrix.rows(); - Index nrhs = Index(b.cols()); - eigen_assert(m_size==b.rows()); - eigen_assert(((MatrixBase::Flags & RowMajorBit) == 0 || nrhs == 1) && "Row-major right hand sides are not supported"); - eigen_assert(((MatrixBase::Flags & RowMajorBit) == 0 || nrhs == 1) && "Row-major matrices of unknowns are not supported"); - eigen_assert(((nrhs == 1) || b.outerStride() == b.rows())); - - -// switch (transposed) { -// case SvNoTrans : m_iparm[11] = 0 ; break; -// case SvTranspose : m_iparm[11] = 2 ; break; -// case SvAdjoint : m_iparm[11] = 1 ; break; -// default: -// //std::cerr << "Eigen: transposition option \"" << transposed << "\" not supported by the PARDISO backend\n"; -// m_iparm[11] = 0; -// } - - Scalar* rhs_ptr = const_cast(b.derived().data()); - Matrix tmp; - - // Pardiso cannot solve in-place - if(rhs_ptr == x.derived().data()) - { - tmp = b; - rhs_ptr = tmp.data(); - } - - Index error; - error = internal::pardiso_run_selector::run(m_pt, 1, 1, m_type, 33, internal::convert_index(m_size), - m_matrix.valuePtr(), m_matrix.outerIndexPtr(), m_matrix.innerIndexPtr(), - m_perm.data(), internal::convert_index(nrhs), m_iparm.data(), m_msglvl, - rhs_ptr, x.derived().data()); - - manageErrorCode(error); -} - - -/** \ingroup PardisoSupport_Module - * \class PardisoLU - * \brief A sparse direct LU factorization and solver based on the PARDISO library - * - * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization - * using the Intel MKL PARDISO library. The sparse matrix A must be squared and invertible. - * The vectors or matrices X and B can be either dense or sparse. - * - * By default, it runs in in-core mode. To enable PARDISO's out-of-core feature, set: - * \code solver.pardisoParameterArray()[59] = 1; \endcode - * - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SparseLU - */ -template -class PardisoLU : public PardisoImpl< PardisoLU > -{ - protected: - typedef PardisoImpl Base; - typedef typename Base::Scalar Scalar; - typedef typename Base::RealScalar RealScalar; - using Base::pardisoInit; - using Base::m_matrix; - friend class PardisoImpl< PardisoLU >; - - public: - - using Base::compute; - using Base::solve; - - PardisoLU() - : Base() - { - pardisoInit(Base::ScalarIsComplex ? 13 : 11); - } - - explicit PardisoLU(const MatrixType& matrix) - : Base() - { - pardisoInit(Base::ScalarIsComplex ? 13 : 11); - compute(matrix); - } - protected: - void getMatrix(const MatrixType& matrix) - { - m_matrix = matrix; - m_matrix.makeCompressed(); - } -}; - -/** \ingroup PardisoSupport_Module - * \class PardisoLLT - * \brief A sparse direct Cholesky (LLT) factorization and solver based on the PARDISO library - * - * This class allows to solve for A.X = B sparse linear problems via a LL^T Cholesky factorization - * using the Intel MKL PARDISO library. The sparse matrix A must be selfajoint and positive definite. - * The vectors or matrices X and B can be either dense or sparse. - * - * By default, it runs in in-core mode. To enable PARDISO's out-of-core feature, set: - * \code solver.pardisoParameterArray()[59] = 1; \endcode - * - * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used. - * Upper|Lower can be used to tell both triangular parts can be used as input. - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SimplicialLLT - */ -template -class PardisoLLT : public PardisoImpl< PardisoLLT > -{ - protected: - typedef PardisoImpl< PardisoLLT > Base; - typedef typename Base::Scalar Scalar; - typedef typename Base::RealScalar RealScalar; - using Base::pardisoInit; - using Base::m_matrix; - friend class PardisoImpl< PardisoLLT >; - - public: - - typedef typename Base::StorageIndex StorageIndex; - enum { UpLo = _UpLo }; - using Base::compute; - - PardisoLLT() - : Base() - { - pardisoInit(Base::ScalarIsComplex ? 4 : 2); - } - - explicit PardisoLLT(const MatrixType& matrix) - : Base() - { - pardisoInit(Base::ScalarIsComplex ? 4 : 2); - compute(matrix); - } - - protected: - - void getMatrix(const MatrixType& matrix) - { - // PARDISO supports only upper, row-major matrices - PermutationMatrix p_null; - m_matrix.resize(matrix.rows(), matrix.cols()); - m_matrix.template selfadjointView() = matrix.template selfadjointView().twistedBy(p_null); - m_matrix.makeCompressed(); - } -}; - -/** \ingroup PardisoSupport_Module - * \class PardisoLDLT - * \brief A sparse direct Cholesky (LDLT) factorization and solver based on the PARDISO library - * - * This class allows to solve for A.X = B sparse linear problems via a LDL^T Cholesky factorization - * using the Intel MKL PARDISO library. The sparse matrix A is assumed to be selfajoint and positive definite. - * For complex matrices, A can also be symmetric only, see the \a Options template parameter. - * The vectors or matrices X and B can be either dense or sparse. - * - * By default, it runs in in-core mode. To enable PARDISO's out-of-core feature, set: - * \code solver.pardisoParameterArray()[59] = 1; \endcode - * - * \tparam MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * \tparam Options can be any bitwise combination of Upper, Lower, and Symmetric. The default is Upper, meaning only the upper triangular part has to be used. - * Symmetric can be used for symmetric, non-selfadjoint complex matrices, the default being to assume a selfadjoint matrix. - * Upper|Lower can be used to tell both triangular parts can be used as input. - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SimplicialLDLT - */ -template -class PardisoLDLT : public PardisoImpl< PardisoLDLT > -{ - protected: - typedef PardisoImpl< PardisoLDLT > Base; - typedef typename Base::Scalar Scalar; - typedef typename Base::RealScalar RealScalar; - using Base::pardisoInit; - using Base::m_matrix; - friend class PardisoImpl< PardisoLDLT >; - - public: - - typedef typename Base::StorageIndex StorageIndex; - using Base::compute; - enum { UpLo = Options&(Upper|Lower) }; - - PardisoLDLT() - : Base() - { - pardisoInit(Base::ScalarIsComplex ? ( bool(Options&Symmetric) ? 6 : -4 ) : -2); - } - - explicit PardisoLDLT(const MatrixType& matrix) - : Base() - { - pardisoInit(Base::ScalarIsComplex ? ( bool(Options&Symmetric) ? 6 : -4 ) : -2); - compute(matrix); - } - - void getMatrix(const MatrixType& matrix) - { - // PARDISO supports only upper, row-major matrices - PermutationMatrix p_null; - m_matrix.resize(matrix.rows(), matrix.cols()); - m_matrix.template selfadjointView() = matrix.template selfadjointView().twistedBy(p_null); - m_matrix.makeCompressed(); - } -}; - -} // end namespace Eigen - -#endif // EIGEN_PARDISOSUPPORT_H diff --git a/Eigen/src/QR/ColPivHouseholderQR.h b/Eigen/src/QR/ColPivHouseholderQR.h deleted file mode 100644 index 5270eaca2..000000000 --- a/Eigen/src/QR/ColPivHouseholderQR.h +++ /dev/null @@ -1,652 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2009 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COLPIVOTINGHOUSEHOLDERQR_H -#define EIGEN_COLPIVOTINGHOUSEHOLDERQR_H - -namespace Eigen { - -namespace internal { -template struct traits > - : traits<_MatrixType> -{ - enum { Flags = 0 }; -}; - -} // end namespace internal - -/** \ingroup QR_Module - * - * \class ColPivHouseholderQR - * - * \brief Householder rank-revealing QR decomposition of a matrix with column-pivoting - * - * \tparam _MatrixType the type of the matrix of which we are computing the QR decomposition - * - * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R - * such that - * \f[ - * \mathbf{A} \, \mathbf{P} = \mathbf{Q} \, \mathbf{R} - * \f] - * by using Householder transformations. Here, \b P is a permutation matrix, \b Q a unitary matrix and \b R an - * upper triangular matrix. - * - * This decomposition performs column pivoting in order to be rank-revealing and improve - * numerical stability. It is slower than HouseholderQR, and faster than FullPivHouseholderQR. - * - * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. - * - * \sa MatrixBase::colPivHouseholderQr() - */ -template class ColPivHouseholderQR -{ - public: - - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - // FIXME should be int - typedef typename MatrixType::StorageIndex StorageIndex; - typedef typename internal::plain_diag_type::type HCoeffsType; - typedef PermutationMatrix PermutationType; - typedef typename internal::plain_row_type::type IntRowVectorType; - typedef typename internal::plain_row_type::type RowVectorType; - typedef typename internal::plain_row_type::type RealRowVectorType; - typedef HouseholderSequence::type> HouseholderSequenceType; - typedef typename MatrixType::PlainObject PlainObject; - - private: - - typedef typename PermutationType::StorageIndex PermIndexType; - - public: - - /** - * \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via ColPivHouseholderQR::compute(const MatrixType&). - */ - ColPivHouseholderQR() - : m_qr(), - m_hCoeffs(), - m_colsPermutation(), - m_colsTranspositions(), - m_temp(), - m_colNormsUpdated(), - m_colNormsDirect(), - m_isInitialized(false), - m_usePrescribedThreshold(false) {} - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa ColPivHouseholderQR() - */ - ColPivHouseholderQR(Index rows, Index cols) - : m_qr(rows, cols), - m_hCoeffs((std::min)(rows,cols)), - m_colsPermutation(PermIndexType(cols)), - m_colsTranspositions(cols), - m_temp(cols), - m_colNormsUpdated(cols), - m_colNormsDirect(cols), - m_isInitialized(false), - m_usePrescribedThreshold(false) {} - - /** \brief Constructs a QR factorization from a given matrix - * - * This constructor computes the QR factorization of the matrix \a matrix by calling - * the method compute(). It is a short cut for: - * - * \code - * ColPivHouseholderQR qr(matrix.rows(), matrix.cols()); - * qr.compute(matrix); - * \endcode - * - * \sa compute() - */ - template - explicit ColPivHouseholderQR(const EigenBase& matrix) - : m_qr(matrix.rows(), matrix.cols()), - m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), - m_colsPermutation(PermIndexType(matrix.cols())), - m_colsTranspositions(matrix.cols()), - m_temp(matrix.cols()), - m_colNormsUpdated(matrix.cols()), - m_colNormsDirect(matrix.cols()), - m_isInitialized(false), - m_usePrescribedThreshold(false) - { - compute(matrix.derived()); - } - - /** \brief Constructs a QR factorization from a given matrix - * - * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when \c MatrixType is a Eigen::Ref. - * - * \sa ColPivHouseholderQR(const EigenBase&) - */ - template - explicit ColPivHouseholderQR(EigenBase& matrix) - : m_qr(matrix.derived()), - m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), - m_colsPermutation(PermIndexType(matrix.cols())), - m_colsTranspositions(matrix.cols()), - m_temp(matrix.cols()), - m_colNormsUpdated(matrix.cols()), - m_colNormsDirect(matrix.cols()), - m_isInitialized(false), - m_usePrescribedThreshold(false) - { - computeInPlace(); - } - - /** This method finds a solution x to the equation Ax=b, where A is the matrix of which - * *this is the QR decomposition, if any exists. - * - * \param b the right-hand-side of the equation to solve. - * - * \returns a solution. - * - * \note_about_checking_solutions - * - * \note_about_arbitrary_choice_of_solution - * - * Example: \include ColPivHouseholderQR_solve.cpp - * Output: \verbinclude ColPivHouseholderQR_solve.out - */ - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return Solve(*this, b.derived()); - } - - HouseholderSequenceType householderQ() const; - HouseholderSequenceType matrixQ() const - { - return householderQ(); - } - - /** \returns a reference to the matrix where the Householder QR decomposition is stored - */ - const MatrixType& matrixQR() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return m_qr; - } - - /** \returns a reference to the matrix where the result Householder QR is stored - * \warning The strict lower part of this matrix contains internal values. - * Only the upper triangular part should be referenced. To get it, use - * \code matrixR().template triangularView() \endcode - * For rank-deficient matrices, use - * \code - * matrixR().topLeftCorner(rank(), rank()).template triangularView() - * \endcode - */ - const MatrixType& matrixR() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return m_qr; - } - - template - ColPivHouseholderQR& compute(const EigenBase& matrix); - - /** \returns a const reference to the column permutation matrix */ - const PermutationType& colsPermutation() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return m_colsPermutation; - } - - /** \returns the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the QR decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * One way to work around that is to use logAbsDeterminant() instead. - * - * \sa logAbsDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar absDeterminant() const; - - /** \returns the natural log of the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the QR decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \note This method is useful to work around the risk of overflow/underflow that's inherent - * to determinant computation. - * - * \sa absDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar logAbsDeterminant() const; - - /** \returns the rank of the matrix of which *this is the QR decomposition. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index rank() const - { - using std::abs; - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); - Index result = 0; - for(Index i = 0; i < m_nonzero_pivots; ++i) - result += (abs(m_qr.coeff(i,i)) > premultiplied_threshold); - return result; - } - - /** \returns the dimension of the kernel of the matrix of which *this is the QR decomposition. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index dimensionOfKernel() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return cols() - rank(); - } - - /** \returns true if the matrix of which *this is the QR decomposition represents an injective - * linear map, i.e. has trivial kernel; false otherwise. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isInjective() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return rank() == cols(); - } - - /** \returns true if the matrix of which *this is the QR decomposition represents a surjective - * linear map; false otherwise. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isSurjective() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return rank() == rows(); - } - - /** \returns true if the matrix of which *this is the QR decomposition is invertible. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isInvertible() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return isInjective() && isSurjective(); - } - - /** \returns the inverse of the matrix of which *this is the QR decomposition. - * - * \note If this matrix is not invertible, the returned matrix has undefined coefficients. - * Use isInvertible() to first determine whether this matrix is invertible. - */ - inline const Inverse inverse() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return Inverse(*this); - } - - inline Index rows() const { return m_qr.rows(); } - inline Index cols() const { return m_qr.cols(); } - - /** \returns a const reference to the vector of Householder coefficients used to represent the factor \c Q. - * - * For advanced uses only. - */ - const HCoeffsType& hCoeffs() const { return m_hCoeffs; } - - /** Allows to prescribe a threshold to be used by certain methods, such as rank(), - * who need to determine when pivots are to be considered nonzero. This is not used for the - * QR decomposition itself. - * - * When it needs to get the threshold value, Eigen calls threshold(). By default, this - * uses a formula to automatically determine a reasonable threshold. - * Once you have called the present method setThreshold(const RealScalar&), - * your value is used instead. - * - * \param threshold The new value to use as the threshold. - * - * A pivot will be considered nonzero if its absolute value is strictly greater than - * \f$ \vert pivot \vert \leqslant threshold \times \vert maxpivot \vert \f$ - * where maxpivot is the biggest pivot. - * - * If you want to come back to the default behavior, call setThreshold(Default_t) - */ - ColPivHouseholderQR& setThreshold(const RealScalar& threshold) - { - m_usePrescribedThreshold = true; - m_prescribedThreshold = threshold; - return *this; - } - - /** Allows to come back to the default behavior, letting Eigen use its default formula for - * determining the threshold. - * - * You should pass the special object Eigen::Default as parameter here. - * \code qr.setThreshold(Eigen::Default); \endcode - * - * See the documentation of setThreshold(const RealScalar&). - */ - ColPivHouseholderQR& setThreshold(Default_t) - { - m_usePrescribedThreshold = false; - return *this; - } - - /** Returns the threshold that will be used by certain methods such as rank(). - * - * See the documentation of setThreshold(const RealScalar&). - */ - RealScalar threshold() const - { - eigen_assert(m_isInitialized || m_usePrescribedThreshold); - return m_usePrescribedThreshold ? m_prescribedThreshold - // this formula comes from experimenting (see "LU precision tuning" thread on the list) - // and turns out to be identical to Higham's formula used already in LDLt. - : NumTraits::epsilon() * RealScalar(m_qr.diagonalSize()); - } - - /** \returns the number of nonzero pivots in the QR decomposition. - * Here nonzero is meant in the exact sense, not in a fuzzy sense. - * So that notion isn't really intrinsically interesting, but it is - * still useful when implementing algorithms. - * - * \sa rank() - */ - inline Index nonzeroPivots() const - { - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return m_nonzero_pivots; - } - - /** \returns the absolute value of the biggest pivot, i.e. the biggest - * diagonal coefficient of R. - */ - RealScalar maxPivot() const { return m_maxpivot; } - - /** \brief Reports whether the QR factorization was succesful. - * - * \note This function always returns \c Success. It is provided for compatibility - * with other factorization routines. - * \returns \c Success - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return Success; - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - void _solve_impl(const RhsType &rhs, DstType &dst) const; - #endif - - protected: - - friend class CompleteOrthogonalDecomposition; - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - void computeInPlace(); - - MatrixType m_qr; - HCoeffsType m_hCoeffs; - PermutationType m_colsPermutation; - IntRowVectorType m_colsTranspositions; - RowVectorType m_temp; - RealRowVectorType m_colNormsUpdated; - RealRowVectorType m_colNormsDirect; - bool m_isInitialized, m_usePrescribedThreshold; - RealScalar m_prescribedThreshold, m_maxpivot; - Index m_nonzero_pivots; - Index m_det_pq; -}; - -template -typename MatrixType::RealScalar ColPivHouseholderQR::absDeterminant() const -{ - using std::abs; - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!"); - return abs(m_qr.diagonal().prod()); -} - -template -typename MatrixType::RealScalar ColPivHouseholderQR::logAbsDeterminant() const -{ - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!"); - return m_qr.diagonal().cwiseAbs().array().log().sum(); -} - -/** Performs the QR factorization of the given matrix \a matrix. The result of - * the factorization is stored into \c *this, and a reference to \c *this - * is returned. - * - * \sa class ColPivHouseholderQR, ColPivHouseholderQR(const MatrixType&) - */ -template -template -ColPivHouseholderQR& ColPivHouseholderQR::compute(const EigenBase& matrix) -{ - m_qr = matrix.derived(); - computeInPlace(); - return *this; -} - -template -void ColPivHouseholderQR::computeInPlace() -{ - check_template_parameters(); - - // the column permutation is stored as int indices, so just to be sure: - eigen_assert(m_qr.cols()<=NumTraits::highest()); - - using std::abs; - - Index rows = m_qr.rows(); - Index cols = m_qr.cols(); - Index size = m_qr.diagonalSize(); - - m_hCoeffs.resize(size); - - m_temp.resize(cols); - - m_colsTranspositions.resize(m_qr.cols()); - Index number_of_transpositions = 0; - - m_colNormsUpdated.resize(cols); - m_colNormsDirect.resize(cols); - for (Index k = 0; k < cols; ++k) { - // colNormsDirect(k) caches the most recent directly computed norm of - // column k. - m_colNormsDirect.coeffRef(k) = m_qr.col(k).norm(); - m_colNormsUpdated.coeffRef(k) = m_colNormsDirect.coeffRef(k); - } - - RealScalar threshold_helper = numext::abs2(m_colNormsUpdated.maxCoeff() * NumTraits::epsilon()) / RealScalar(rows); - RealScalar norm_downdate_threshold = numext::sqrt(NumTraits::epsilon()); - - m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case) - m_maxpivot = RealScalar(0); - - for(Index k = 0; k < size; ++k) - { - // first, we look up in our table m_colNormsUpdated which column has the biggest norm - Index biggest_col_index; - RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols-k).maxCoeff(&biggest_col_index)); - biggest_col_index += k; - - // Track the number of meaningful pivots but do not stop the decomposition to make - // sure that the initial matrix is properly reproduced. See bug 941. - if(m_nonzero_pivots==size && biggest_col_sq_norm < threshold_helper * RealScalar(rows-k)) - m_nonzero_pivots = k; - - // apply the transposition to the columns - m_colsTranspositions.coeffRef(k) = biggest_col_index; - if(k != biggest_col_index) { - m_qr.col(k).swap(m_qr.col(biggest_col_index)); - std::swap(m_colNormsUpdated.coeffRef(k), m_colNormsUpdated.coeffRef(biggest_col_index)); - std::swap(m_colNormsDirect.coeffRef(k), m_colNormsDirect.coeffRef(biggest_col_index)); - ++number_of_transpositions; - } - - // generate the householder vector, store it below the diagonal - RealScalar beta; - m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta); - - // apply the householder transformation to the diagonal coefficient - m_qr.coeffRef(k,k) = beta; - - // remember the maximum absolute value of diagonal coefficients - if(abs(beta) > m_maxpivot) m_maxpivot = abs(beta); - - // apply the householder transformation - m_qr.bottomRightCorner(rows-k, cols-k-1) - .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1)); - - // update our table of norms of the columns - for (Index j = k + 1; j < cols; ++j) { - // The following implements the stable norm downgrade step discussed in - // http://www.netlib.org/lapack/lawnspdf/lawn176.pdf - // and used in LAPACK routines xGEQPF and xGEQP3. - // See lines 278-297 in http://www.netlib.org/lapack/explore-html/dc/df4/sgeqpf_8f_source.html - if (m_colNormsUpdated.coeffRef(j) != RealScalar(0)) { - RealScalar temp = abs(m_qr.coeffRef(k, j)) / m_colNormsUpdated.coeffRef(j); - temp = (RealScalar(1) + temp) * (RealScalar(1) - temp); - temp = temp < RealScalar(0) ? RealScalar(0) : temp; - RealScalar temp2 = temp * numext::abs2(m_colNormsUpdated.coeffRef(j) / - m_colNormsDirect.coeffRef(j)); - if (temp2 <= norm_downdate_threshold) { - // The updated norm has become too inaccurate so re-compute the column - // norm directly. - m_colNormsDirect.coeffRef(j) = m_qr.col(j).tail(rows - k - 1).norm(); - m_colNormsUpdated.coeffRef(j) = m_colNormsDirect.coeffRef(j); - } else { - m_colNormsUpdated.coeffRef(j) *= numext::sqrt(temp); - } - } - } - } - - m_colsPermutation.setIdentity(PermIndexType(cols)); - for(PermIndexType k = 0; k < size/*m_nonzero_pivots*/; ++k) - m_colsPermutation.applyTranspositionOnTheRight(k, PermIndexType(m_colsTranspositions.coeff(k))); - - m_det_pq = (number_of_transpositions%2) ? -1 : 1; - m_isInitialized = true; -} - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void ColPivHouseholderQR<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const -{ - eigen_assert(rhs.rows() == rows()); - - const Index nonzero_pivots = nonzeroPivots(); - - if(nonzero_pivots == 0) - { - dst.setZero(); - return; - } - - typename RhsType::PlainObject c(rhs); - - // Note that the matrix Q = H_0^* H_1^*... so its inverse is Q^* = (H_0 H_1 ...)^T - c.applyOnTheLeft(householderSequence(m_qr, m_hCoeffs) - .setLength(nonzero_pivots) - .transpose() - ); - - m_qr.topLeftCorner(nonzero_pivots, nonzero_pivots) - .template triangularView() - .solveInPlace(c.topRows(nonzero_pivots)); - - for(Index i = 0; i < nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i); - for(Index i = nonzero_pivots; i < cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero(); -} -#endif - -namespace internal { - -template -struct Assignment >, internal::assign_op::Scalar>, Dense2Dense> -{ - typedef ColPivHouseholderQR QrType; - typedef Inverse SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); - } -}; - -} // end namespace internal - -/** \returns the matrix Q as a sequence of householder transformations. - * You can extract the meaningful part only by using: - * \code qr.householderQ().setLength(qr.nonzeroPivots()) \endcode*/ -template -typename ColPivHouseholderQR::HouseholderSequenceType ColPivHouseholderQR - ::householderQ() const -{ - eigen_assert(m_isInitialized && "ColPivHouseholderQR is not initialized."); - return HouseholderSequenceType(m_qr, m_hCoeffs.conjugate()); -} - -/** \return the column-pivoting Householder QR decomposition of \c *this. - * - * \sa class ColPivHouseholderQR - */ -template -const ColPivHouseholderQR::PlainObject> -MatrixBase::colPivHouseholderQr() const -{ - return ColPivHouseholderQR(eval()); -} - -} // end namespace Eigen - -#endif // EIGEN_COLPIVOTINGHOUSEHOLDERQR_H diff --git a/Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h b/Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h deleted file mode 100644 index 4e9651f83..000000000 --- a/Eigen/src/QR/ColPivHouseholderQR_LAPACKE.h +++ /dev/null @@ -1,97 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to LAPACKe - * Householder QR decomposition of a matrix with column pivoting based on - * LAPACKE_?geqp3 function. - ******************************************************************************** -*/ - -#ifndef EIGEN_COLPIVOTINGHOUSEHOLDERQR_LAPACKE_H -#define EIGEN_COLPIVOTINGHOUSEHOLDERQR_LAPACKE_H - -namespace Eigen { - -/** \internal Specialization for the data types supported by LAPACKe */ - -#define EIGEN_LAPACKE_QR_COLPIV(EIGTYPE, LAPACKE_TYPE, LAPACKE_PREFIX, EIGCOLROW, LAPACKE_COLROW) \ -template<> template inline \ -ColPivHouseholderQR >& \ -ColPivHouseholderQR >::compute( \ - const EigenBase& matrix) \ -\ -{ \ - using std::abs; \ - typedef Matrix MatrixType; \ - typedef MatrixType::RealScalar RealScalar; \ - Index rows = matrix.rows();\ - Index cols = matrix.cols();\ -\ - m_qr = matrix;\ - Index size = m_qr.diagonalSize();\ - m_hCoeffs.resize(size);\ -\ - m_colsTranspositions.resize(cols);\ - /*Index number_of_transpositions = 0;*/ \ -\ - m_nonzero_pivots = 0; \ - m_maxpivot = RealScalar(0);\ - m_colsPermutation.resize(cols); \ - m_colsPermutation.indices().setZero(); \ -\ - lapack_int lda = internal::convert_index(m_qr.outerStride()); \ - lapack_int matrix_order = LAPACKE_COLROW; \ - LAPACKE_##LAPACKE_PREFIX##geqp3( matrix_order, internal::convert_index(rows), internal::convert_index(cols), \ - (LAPACKE_TYPE*)m_qr.data(), lda, (lapack_int*)m_colsPermutation.indices().data(), (LAPACKE_TYPE*)m_hCoeffs.data()); \ - m_isInitialized = true; \ - m_maxpivot=m_qr.diagonal().cwiseAbs().maxCoeff(); \ - m_hCoeffs.adjointInPlace(); \ - RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); \ - lapack_int *perm = m_colsPermutation.indices().data(); \ - for(Index i=0;i premultiplied_threshold);\ - } \ - for(Index i=0;i -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPLETEORTHOGONALDECOMPOSITION_H -#define EIGEN_COMPLETEORTHOGONALDECOMPOSITION_H - -namespace Eigen { - -namespace internal { -template -struct traits > - : traits<_MatrixType> { - enum { Flags = 0 }; -}; - -} // end namespace internal - -/** \ingroup QR_Module - * - * \class CompleteOrthogonalDecomposition - * - * \brief Complete orthogonal decomposition (COD) of a matrix. - * - * \param MatrixType the type of the matrix of which we are computing the COD. - * - * This class performs a rank-revealing complete orthogonal decomposition of a - * matrix \b A into matrices \b P, \b Q, \b T, and \b Z such that - * \f[ - * \mathbf{A} \, \mathbf{P} = \mathbf{Q} \, - * \begin{bmatrix} \mathbf{T} & \mathbf{0} \\ - * \mathbf{0} & \mathbf{0} \end{bmatrix} \, \mathbf{Z} - * \f] - * by using Householder transformations. Here, \b P is a permutation matrix, - * \b Q and \b Z are unitary matrices and \b T an upper triangular matrix of - * size rank-by-rank. \b A may be rank deficient. - * - * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. - * - * \sa MatrixBase::completeOrthogonalDecomposition() - */ -template -class CompleteOrthogonalDecomposition { - public: - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef typename internal::plain_diag_type::type HCoeffsType; - typedef PermutationMatrix - PermutationType; - typedef typename internal::plain_row_type::type - IntRowVectorType; - typedef typename internal::plain_row_type::type RowVectorType; - typedef typename internal::plain_row_type::type - RealRowVectorType; - typedef HouseholderSequence< - MatrixType, typename internal::remove_all< - typename HCoeffsType::ConjugateReturnType>::type> - HouseholderSequenceType; - typedef typename MatrixType::PlainObject PlainObject; - - private: - typedef typename PermutationType::Index PermIndexType; - - public: - /** - * \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via - * \c CompleteOrthogonalDecomposition::compute(const* MatrixType&). - */ - CompleteOrthogonalDecomposition() : m_cpqr(), m_zCoeffs(), m_temp() {} - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa CompleteOrthogonalDecomposition() - */ - CompleteOrthogonalDecomposition(Index rows, Index cols) - : m_cpqr(rows, cols), m_zCoeffs((std::min)(rows, cols)), m_temp(cols) {} - - /** \brief Constructs a complete orthogonal decomposition from a given - * matrix. - * - * This constructor computes the complete orthogonal decomposition of the - * matrix \a matrix by calling the method compute(). The default - * threshold for rank determination will be used. It is a short cut for: - * - * \code - * CompleteOrthogonalDecomposition cod(matrix.rows(), - * matrix.cols()); - * cod.setThreshold(Default); - * cod.compute(matrix); - * \endcode - * - * \sa compute() - */ - template - explicit CompleteOrthogonalDecomposition(const EigenBase& matrix) - : m_cpqr(matrix.rows(), matrix.cols()), - m_zCoeffs((std::min)(matrix.rows(), matrix.cols())), - m_temp(matrix.cols()) - { - compute(matrix.derived()); - } - - /** \brief Constructs a complete orthogonal decomposition from a given matrix - * - * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when \c MatrixType is a Eigen::Ref. - * - * \sa CompleteOrthogonalDecomposition(const EigenBase&) - */ - template - explicit CompleteOrthogonalDecomposition(EigenBase& matrix) - : m_cpqr(matrix.derived()), - m_zCoeffs((std::min)(matrix.rows(), matrix.cols())), - m_temp(matrix.cols()) - { - computeInPlace(); - } - - - /** This method computes the minimum-norm solution X to a least squares - * problem \f[\mathrm{minimize} \|A X - B\|, \f] where \b A is the matrix of - * which \c *this is the complete orthogonal decomposition. - * - * \param b the right-hand sides of the problem to solve. - * - * \returns a solution. - * - */ - template - inline const Solve solve( - const MatrixBase& b) const { - eigen_assert(m_cpqr.m_isInitialized && - "CompleteOrthogonalDecomposition is not initialized."); - return Solve(*this, b.derived()); - } - - HouseholderSequenceType householderQ(void) const; - HouseholderSequenceType matrixQ(void) const { return m_cpqr.householderQ(); } - - /** \returns the matrix \b Z. - */ - MatrixType matrixZ() const { - MatrixType Z = MatrixType::Identity(m_cpqr.cols(), m_cpqr.cols()); - applyZAdjointOnTheLeftInPlace(Z); - return Z.adjoint(); - } - - /** \returns a reference to the matrix where the complete orthogonal - * decomposition is stored - */ - const MatrixType& matrixQTZ() const { return m_cpqr.matrixQR(); } - - /** \returns a reference to the matrix where the complete orthogonal - * decomposition is stored. - * \warning The strict lower part and \code cols() - rank() \endcode right - * columns of this matrix contains internal values. - * Only the upper triangular part should be referenced. To get it, use - * \code matrixT().template triangularView() \endcode - * For rank-deficient matrices, use - * \code - * matrixR().topLeftCorner(rank(), rank()).template triangularView() - * \endcode - */ - const MatrixType& matrixT() const { return m_cpqr.matrixQR(); } - - template - CompleteOrthogonalDecomposition& compute(const EigenBase& matrix) { - // Compute the column pivoted QR factorization A P = Q R. - m_cpqr.compute(matrix); - computeInPlace(); - return *this; - } - - /** \returns a const reference to the column permutation matrix */ - const PermutationType& colsPermutation() const { - return m_cpqr.colsPermutation(); - } - - /** \returns the absolute value of the determinant of the matrix of which - * *this is the complete orthogonal decomposition. It has only linear - * complexity (that is, O(n) where n is the dimension of the square matrix) - * as the complete orthogonal decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * One way to work around that is to use logAbsDeterminant() instead. - * - * \sa logAbsDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar absDeterminant() const; - - /** \returns the natural log of the absolute value of the determinant of the - * matrix of which *this is the complete orthogonal decomposition. It has - * only linear complexity (that is, O(n) where n is the dimension of the - * square matrix) as the complete orthogonal decomposition has already been - * computed. - * - * \note This is only for square matrices. - * - * \note This method is useful to work around the risk of overflow/underflow - * that's inherent to determinant computation. - * - * \sa absDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar logAbsDeterminant() const; - - /** \returns the rank of the matrix of which *this is the complete orthogonal - * decomposition. - * - * \note This method has to determine which pivots should be considered - * nonzero. For that, it uses the threshold value that you can control by - * calling setThreshold(const RealScalar&). - */ - inline Index rank() const { return m_cpqr.rank(); } - - /** \returns the dimension of the kernel of the matrix of which *this is the - * complete orthogonal decomposition. - * - * \note This method has to determine which pivots should be considered - * nonzero. For that, it uses the threshold value that you can control by - * calling setThreshold(const RealScalar&). - */ - inline Index dimensionOfKernel() const { return m_cpqr.dimensionOfKernel(); } - - /** \returns true if the matrix of which *this is the decomposition represents - * an injective linear map, i.e. has trivial kernel; false otherwise. - * - * \note This method has to determine which pivots should be considered - * nonzero. For that, it uses the threshold value that you can control by - * calling setThreshold(const RealScalar&). - */ - inline bool isInjective() const { return m_cpqr.isInjective(); } - - /** \returns true if the matrix of which *this is the decomposition represents - * a surjective linear map; false otherwise. - * - * \note This method has to determine which pivots should be considered - * nonzero. For that, it uses the threshold value that you can control by - * calling setThreshold(const RealScalar&). - */ - inline bool isSurjective() const { return m_cpqr.isSurjective(); } - - /** \returns true if the matrix of which *this is the complete orthogonal - * decomposition is invertible. - * - * \note This method has to determine which pivots should be considered - * nonzero. For that, it uses the threshold value that you can control by - * calling setThreshold(const RealScalar&). - */ - inline bool isInvertible() const { return m_cpqr.isInvertible(); } - - /** \returns the pseudo-inverse of the matrix of which *this is the complete - * orthogonal decomposition. - * \warning: Do not compute \c this->pseudoInverse()*rhs to solve a linear systems. - * It is more efficient and numerically stable to call \c this->solve(rhs). - */ - inline const Inverse pseudoInverse() const - { - return Inverse(*this); - } - - inline Index rows() const { return m_cpqr.rows(); } - inline Index cols() const { return m_cpqr.cols(); } - - /** \returns a const reference to the vector of Householder coefficients used - * to represent the factor \c Q. - * - * For advanced uses only. - */ - inline const HCoeffsType& hCoeffs() const { return m_cpqr.hCoeffs(); } - - /** \returns a const reference to the vector of Householder coefficients - * used to represent the factor \c Z. - * - * For advanced uses only. - */ - const HCoeffsType& zCoeffs() const { return m_zCoeffs; } - - /** Allows to prescribe a threshold to be used by certain methods, such as - * rank(), who need to determine when pivots are to be considered nonzero. - * Most be called before calling compute(). - * - * When it needs to get the threshold value, Eigen calls threshold(). By - * default, this uses a formula to automatically determine a reasonable - * threshold. Once you have called the present method - * setThreshold(const RealScalar&), your value is used instead. - * - * \param threshold The new value to use as the threshold. - * - * A pivot will be considered nonzero if its absolute value is strictly - * greater than - * \f$ \vert pivot \vert \leqslant threshold \times \vert maxpivot \vert \f$ - * where maxpivot is the biggest pivot. - * - * If you want to come back to the default behavior, call - * setThreshold(Default_t) - */ - CompleteOrthogonalDecomposition& setThreshold(const RealScalar& threshold) { - m_cpqr.setThreshold(threshold); - return *this; - } - - /** Allows to come back to the default behavior, letting Eigen use its default - * formula for determining the threshold. - * - * You should pass the special object Eigen::Default as parameter here. - * \code qr.setThreshold(Eigen::Default); \endcode - * - * See the documentation of setThreshold(const RealScalar&). - */ - CompleteOrthogonalDecomposition& setThreshold(Default_t) { - m_cpqr.setThreshold(Default); - return *this; - } - - /** Returns the threshold that will be used by certain methods such as rank(). - * - * See the documentation of setThreshold(const RealScalar&). - */ - RealScalar threshold() const { return m_cpqr.threshold(); } - - /** \returns the number of nonzero pivots in the complete orthogonal - * decomposition. Here nonzero is meant in the exact sense, not in a - * fuzzy sense. So that notion isn't really intrinsically interesting, - * but it is still useful when implementing algorithms. - * - * \sa rank() - */ - inline Index nonzeroPivots() const { return m_cpqr.nonzeroPivots(); } - - /** \returns the absolute value of the biggest pivot, i.e. the biggest - * diagonal coefficient of R. - */ - inline RealScalar maxPivot() const { return m_cpqr.maxPivot(); } - - /** \brief Reports whether the complete orthogonal decomposition was - * succesful. - * - * \note This function always returns \c Success. It is provided for - * compatibility - * with other factorization routines. - * \returns \c Success - */ - ComputationInfo info() const { - eigen_assert(m_cpqr.m_isInitialized && "Decomposition is not initialized."); - return Success; - } - -#ifndef EIGEN_PARSED_BY_DOXYGEN - template - void _solve_impl(const RhsType& rhs, DstType& dst) const; -#endif - - protected: - static void check_template_parameters() { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - void computeInPlace(); - - /** Overwrites \b rhs with \f$ \mathbf{Z}^* * \mathbf{rhs} \f$. - */ - template - void applyZAdjointOnTheLeftInPlace(Rhs& rhs) const; - - ColPivHouseholderQR m_cpqr; - HCoeffsType m_zCoeffs; - RowVectorType m_temp; -}; - -template -typename MatrixType::RealScalar -CompleteOrthogonalDecomposition::absDeterminant() const { - return m_cpqr.absDeterminant(); -} - -template -typename MatrixType::RealScalar -CompleteOrthogonalDecomposition::logAbsDeterminant() const { - return m_cpqr.logAbsDeterminant(); -} - -/** Performs the complete orthogonal decomposition of the given matrix \a - * matrix. The result of the factorization is stored into \c *this, and a - * reference to \c *this is returned. - * - * \sa class CompleteOrthogonalDecomposition, - * CompleteOrthogonalDecomposition(const MatrixType&) - */ -template -void CompleteOrthogonalDecomposition::computeInPlace() -{ - check_template_parameters(); - - // the column permutation is stored as int indices, so just to be sure: - eigen_assert(m_cpqr.cols() <= NumTraits::highest()); - - const Index rank = m_cpqr.rank(); - const Index cols = m_cpqr.cols(); - const Index rows = m_cpqr.rows(); - m_zCoeffs.resize((std::min)(rows, cols)); - m_temp.resize(cols); - - if (rank < cols) { - // We have reduced the (permuted) matrix to the form - // [R11 R12] - // [ 0 R22] - // where R11 is r-by-r (r = rank) upper triangular, R12 is - // r-by-(n-r), and R22 is empty or the norm of R22 is negligible. - // We now compute the complete orthogonal decomposition by applying - // Householder transformations from the right to the upper trapezoidal - // matrix X = [R11 R12] to zero out R12 and obtain the factorization - // [R11 R12] = [T11 0] * Z, where T11 is r-by-r upper triangular and - // Z = Z(0) * Z(1) ... Z(r-1) is an n-by-n orthogonal matrix. - // We store the data representing Z in R12 and m_zCoeffs. - for (Index k = rank - 1; k >= 0; --k) { - if (k != rank - 1) { - // Given the API for Householder reflectors, it is more convenient if - // we swap the leading parts of columns k and r-1 (zero-based) to form - // the matrix X_k = [X(0:k, k), X(0:k, r:n)] - m_cpqr.m_qr.col(k).head(k + 1).swap( - m_cpqr.m_qr.col(rank - 1).head(k + 1)); - } - // Construct Householder reflector Z(k) to zero out the last row of X_k, - // i.e. choose Z(k) such that - // [X(k, k), X(k, r:n)] * Z(k) = [beta, 0, .., 0]. - RealScalar beta; - m_cpqr.m_qr.row(k) - .tail(cols - rank + 1) - .makeHouseholderInPlace(m_zCoeffs(k), beta); - m_cpqr.m_qr(k, rank - 1) = beta; - if (k > 0) { - // Apply Z(k) to the first k rows of X_k - m_cpqr.m_qr.topRightCorner(k, cols - rank + 1) - .applyHouseholderOnTheRight( - m_cpqr.m_qr.row(k).tail(cols - rank).transpose(), m_zCoeffs(k), - &m_temp(0)); - } - if (k != rank - 1) { - // Swap X(0:k,k) back to its proper location. - m_cpqr.m_qr.col(k).head(k + 1).swap( - m_cpqr.m_qr.col(rank - 1).head(k + 1)); - } - } - } -} - -template -template -void CompleteOrthogonalDecomposition::applyZAdjointOnTheLeftInPlace( - Rhs& rhs) const { - const Index cols = this->cols(); - const Index nrhs = rhs.cols(); - const Index rank = this->rank(); - Matrix temp((std::max)(cols, nrhs)); - for (Index k = 0; k < rank; ++k) { - if (k != rank - 1) { - rhs.row(k).swap(rhs.row(rank - 1)); - } - rhs.middleRows(rank - 1, cols - rank + 1) - .applyHouseholderOnTheLeft( - matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), - &temp(0)); - if (k != rank - 1) { - rhs.row(k).swap(rhs.row(rank - 1)); - } - } -} - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void CompleteOrthogonalDecomposition<_MatrixType>::_solve_impl( - const RhsType& rhs, DstType& dst) const { - eigen_assert(rhs.rows() == this->rows()); - - const Index rank = this->rank(); - if (rank == 0) { - dst.setZero(); - return; - } - - // Compute c = Q^* * rhs - // Note that the matrix Q = H_0^* H_1^*... so its inverse is - // Q^* = (H_0 H_1 ...)^T - typename RhsType::PlainObject c(rhs); - c.applyOnTheLeft( - householderSequence(matrixQTZ(), hCoeffs()).setLength(rank).transpose()); - - // Solve T z = c(1:rank, :) - dst.topRows(rank) = matrixT() - .topLeftCorner(rank, rank) - .template triangularView() - .solve(c.topRows(rank)); - - const Index cols = this->cols(); - if (rank < cols) { - // Compute y = Z^* * [ z ] - // [ 0 ] - dst.bottomRows(cols - rank).setZero(); - applyZAdjointOnTheLeftInPlace(dst); - } - - // Undo permutation to get x = P^{-1} * y. - dst = colsPermutation() * dst; -} -#endif - -namespace internal { - -template -struct Assignment >, internal::assign_op::Scalar>, Dense2Dense> -{ - typedef CompleteOrthogonalDecomposition CodType; - typedef Inverse SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.rows())); - } -}; - -} // end namespace internal - -/** \returns the matrix Q as a sequence of householder transformations */ -template -typename CompleteOrthogonalDecomposition::HouseholderSequenceType -CompleteOrthogonalDecomposition::householderQ() const { - return m_cpqr.householderQ(); -} - -/** \return the complete orthogonal decomposition of \c *this. - * - * \sa class CompleteOrthogonalDecomposition - */ -template -const CompleteOrthogonalDecomposition::PlainObject> -MatrixBase::completeOrthogonalDecomposition() const { - return CompleteOrthogonalDecomposition(eval()); -} - -} // end namespace Eigen - -#endif // EIGEN_COMPLETEORTHOGONALDECOMPOSITION_H diff --git a/Eigen/src/QR/FullPivHouseholderQR.h b/Eigen/src/QR/FullPivHouseholderQR.h deleted file mode 100644 index c31e47cc4..000000000 --- a/Eigen/src/QR/FullPivHouseholderQR.h +++ /dev/null @@ -1,675 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2009 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_FULLPIVOTINGHOUSEHOLDERQR_H -#define EIGEN_FULLPIVOTINGHOUSEHOLDERQR_H - -namespace Eigen { - -namespace internal { - -template struct traits > - : traits<_MatrixType> -{ - enum { Flags = 0 }; -}; - -template struct FullPivHouseholderQRMatrixQReturnType; - -template -struct traits > -{ - typedef typename MatrixType::PlainObject ReturnType; -}; - -} // end namespace internal - -/** \ingroup QR_Module - * - * \class FullPivHouseholderQR - * - * \brief Householder rank-revealing QR decomposition of a matrix with full pivoting - * - * \tparam _MatrixType the type of the matrix of which we are computing the QR decomposition - * - * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b P', \b Q and \b R - * such that - * \f[ - * \mathbf{P} \, \mathbf{A} \, \mathbf{P}' = \mathbf{Q} \, \mathbf{R} - * \f] - * by using Householder transformations. Here, \b P and \b P' are permutation matrices, \b Q a unitary matrix - * and \b R an upper triangular matrix. - * - * This decomposition performs a very prudent full pivoting in order to be rank-revealing and achieve optimal - * numerical stability. The trade-off is that it is slower than HouseholderQR and ColPivHouseholderQR. - * - * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. - * - * \sa MatrixBase::fullPivHouseholderQr() - */ -template class FullPivHouseholderQR -{ - public: - - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - // FIXME should be int - typedef typename MatrixType::StorageIndex StorageIndex; - typedef internal::FullPivHouseholderQRMatrixQReturnType MatrixQReturnType; - typedef typename internal::plain_diag_type::type HCoeffsType; - typedef Matrix IntDiagSizeVectorType; - typedef PermutationMatrix PermutationType; - typedef typename internal::plain_row_type::type RowVectorType; - typedef typename internal::plain_col_type::type ColVectorType; - typedef typename MatrixType::PlainObject PlainObject; - - /** \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via FullPivHouseholderQR::compute(const MatrixType&). - */ - FullPivHouseholderQR() - : m_qr(), - m_hCoeffs(), - m_rows_transpositions(), - m_cols_transpositions(), - m_cols_permutation(), - m_temp(), - m_isInitialized(false), - m_usePrescribedThreshold(false) {} - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa FullPivHouseholderQR() - */ - FullPivHouseholderQR(Index rows, Index cols) - : m_qr(rows, cols), - m_hCoeffs((std::min)(rows,cols)), - m_rows_transpositions((std::min)(rows,cols)), - m_cols_transpositions((std::min)(rows,cols)), - m_cols_permutation(cols), - m_temp(cols), - m_isInitialized(false), - m_usePrescribedThreshold(false) {} - - /** \brief Constructs a QR factorization from a given matrix - * - * This constructor computes the QR factorization of the matrix \a matrix by calling - * the method compute(). It is a short cut for: - * - * \code - * FullPivHouseholderQR qr(matrix.rows(), matrix.cols()); - * qr.compute(matrix); - * \endcode - * - * \sa compute() - */ - template - explicit FullPivHouseholderQR(const EigenBase& matrix) - : m_qr(matrix.rows(), matrix.cols()), - m_hCoeffs((std::min)(matrix.rows(), matrix.cols())), - m_rows_transpositions((std::min)(matrix.rows(), matrix.cols())), - m_cols_transpositions((std::min)(matrix.rows(), matrix.cols())), - m_cols_permutation(matrix.cols()), - m_temp(matrix.cols()), - m_isInitialized(false), - m_usePrescribedThreshold(false) - { - compute(matrix.derived()); - } - - /** \brief Constructs a QR factorization from a given matrix - * - * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when \c MatrixType is a Eigen::Ref. - * - * \sa FullPivHouseholderQR(const EigenBase&) - */ - template - explicit FullPivHouseholderQR(EigenBase& matrix) - : m_qr(matrix.derived()), - m_hCoeffs((std::min)(matrix.rows(), matrix.cols())), - m_rows_transpositions((std::min)(matrix.rows(), matrix.cols())), - m_cols_transpositions((std::min)(matrix.rows(), matrix.cols())), - m_cols_permutation(matrix.cols()), - m_temp(matrix.cols()), - m_isInitialized(false), - m_usePrescribedThreshold(false) - { - computeInPlace(); - } - - /** This method finds a solution x to the equation Ax=b, where A is the matrix of which - * \c *this is the QR decomposition. - * - * \param b the right-hand-side of the equation to solve. - * - * \returns the exact or least-square solution if the rank is greater or equal to the number of columns of A, - * and an arbitrary solution otherwise. - * - * \note_about_checking_solutions - * - * \note_about_arbitrary_choice_of_solution - * - * Example: \include FullPivHouseholderQR_solve.cpp - * Output: \verbinclude FullPivHouseholderQR_solve.out - */ - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return Solve(*this, b.derived()); - } - - /** \returns Expression object representing the matrix Q - */ - MatrixQReturnType matrixQ(void) const; - - /** \returns a reference to the matrix where the Householder QR decomposition is stored - */ - const MatrixType& matrixQR() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return m_qr; - } - - template - FullPivHouseholderQR& compute(const EigenBase& matrix); - - /** \returns a const reference to the column permutation matrix */ - const PermutationType& colsPermutation() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return m_cols_permutation; - } - - /** \returns a const reference to the vector of indices representing the rows transpositions */ - const IntDiagSizeVectorType& rowsTranspositions() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return m_rows_transpositions; - } - - /** \returns the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the QR decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * One way to work around that is to use logAbsDeterminant() instead. - * - * \sa logAbsDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar absDeterminant() const; - - /** \returns the natural log of the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the QR decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \note This method is useful to work around the risk of overflow/underflow that's inherent - * to determinant computation. - * - * \sa absDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar logAbsDeterminant() const; - - /** \returns the rank of the matrix of which *this is the QR decomposition. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index rank() const - { - using std::abs; - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); - Index result = 0; - for(Index i = 0; i < m_nonzero_pivots; ++i) - result += (abs(m_qr.coeff(i,i)) > premultiplied_threshold); - return result; - } - - /** \returns the dimension of the kernel of the matrix of which *this is the QR decomposition. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index dimensionOfKernel() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return cols() - rank(); - } - - /** \returns true if the matrix of which *this is the QR decomposition represents an injective - * linear map, i.e. has trivial kernel; false otherwise. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isInjective() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return rank() == cols(); - } - - /** \returns true if the matrix of which *this is the QR decomposition represents a surjective - * linear map; false otherwise. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isSurjective() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return rank() == rows(); - } - - /** \returns true if the matrix of which *this is the QR decomposition is invertible. - * - * \note This method has to determine which pivots should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline bool isInvertible() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return isInjective() && isSurjective(); - } - - /** \returns the inverse of the matrix of which *this is the QR decomposition. - * - * \note If this matrix is not invertible, the returned matrix has undefined coefficients. - * Use isInvertible() to first determine whether this matrix is invertible. - */ - inline const Inverse inverse() const - { - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return Inverse(*this); - } - - inline Index rows() const { return m_qr.rows(); } - inline Index cols() const { return m_qr.cols(); } - - /** \returns a const reference to the vector of Householder coefficients used to represent the factor \c Q. - * - * For advanced uses only. - */ - const HCoeffsType& hCoeffs() const { return m_hCoeffs; } - - /** Allows to prescribe a threshold to be used by certain methods, such as rank(), - * who need to determine when pivots are to be considered nonzero. This is not used for the - * QR decomposition itself. - * - * When it needs to get the threshold value, Eigen calls threshold(). By default, this - * uses a formula to automatically determine a reasonable threshold. - * Once you have called the present method setThreshold(const RealScalar&), - * your value is used instead. - * - * \param threshold The new value to use as the threshold. - * - * A pivot will be considered nonzero if its absolute value is strictly greater than - * \f$ \vert pivot \vert \leqslant threshold \times \vert maxpivot \vert \f$ - * where maxpivot is the biggest pivot. - * - * If you want to come back to the default behavior, call setThreshold(Default_t) - */ - FullPivHouseholderQR& setThreshold(const RealScalar& threshold) - { - m_usePrescribedThreshold = true; - m_prescribedThreshold = threshold; - return *this; - } - - /** Allows to come back to the default behavior, letting Eigen use its default formula for - * determining the threshold. - * - * You should pass the special object Eigen::Default as parameter here. - * \code qr.setThreshold(Eigen::Default); \endcode - * - * See the documentation of setThreshold(const RealScalar&). - */ - FullPivHouseholderQR& setThreshold(Default_t) - { - m_usePrescribedThreshold = false; - return *this; - } - - /** Returns the threshold that will be used by certain methods such as rank(). - * - * See the documentation of setThreshold(const RealScalar&). - */ - RealScalar threshold() const - { - eigen_assert(m_isInitialized || m_usePrescribedThreshold); - return m_usePrescribedThreshold ? m_prescribedThreshold - // this formula comes from experimenting (see "LU precision tuning" thread on the list) - // and turns out to be identical to Higham's formula used already in LDLt. - : NumTraits::epsilon() * RealScalar(m_qr.diagonalSize()); - } - - /** \returns the number of nonzero pivots in the QR decomposition. - * Here nonzero is meant in the exact sense, not in a fuzzy sense. - * So that notion isn't really intrinsically interesting, but it is - * still useful when implementing algorithms. - * - * \sa rank() - */ - inline Index nonzeroPivots() const - { - eigen_assert(m_isInitialized && "LU is not initialized."); - return m_nonzero_pivots; - } - - /** \returns the absolute value of the biggest pivot, i.e. the biggest - * diagonal coefficient of U. - */ - RealScalar maxPivot() const { return m_maxpivot; } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - void _solve_impl(const RhsType &rhs, DstType &dst) const; - #endif - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - void computeInPlace(); - - MatrixType m_qr; - HCoeffsType m_hCoeffs; - IntDiagSizeVectorType m_rows_transpositions; - IntDiagSizeVectorType m_cols_transpositions; - PermutationType m_cols_permutation; - RowVectorType m_temp; - bool m_isInitialized, m_usePrescribedThreshold; - RealScalar m_prescribedThreshold, m_maxpivot; - Index m_nonzero_pivots; - RealScalar m_precision; - Index m_det_pq; -}; - -template -typename MatrixType::RealScalar FullPivHouseholderQR::absDeterminant() const -{ - using std::abs; - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!"); - return abs(m_qr.diagonal().prod()); -} - -template -typename MatrixType::RealScalar FullPivHouseholderQR::logAbsDeterminant() const -{ - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!"); - return m_qr.diagonal().cwiseAbs().array().log().sum(); -} - -/** Performs the QR factorization of the given matrix \a matrix. The result of - * the factorization is stored into \c *this, and a reference to \c *this - * is returned. - * - * \sa class FullPivHouseholderQR, FullPivHouseholderQR(const MatrixType&) - */ -template -template -FullPivHouseholderQR& FullPivHouseholderQR::compute(const EigenBase& matrix) -{ - m_qr = matrix.derived(); - computeInPlace(); - return *this; -} - -template -void FullPivHouseholderQR::computeInPlace() -{ - check_template_parameters(); - - using std::abs; - Index rows = m_qr.rows(); - Index cols = m_qr.cols(); - Index size = (std::min)(rows,cols); - - - m_hCoeffs.resize(size); - - m_temp.resize(cols); - - m_precision = NumTraits::epsilon() * RealScalar(size); - - m_rows_transpositions.resize(size); - m_cols_transpositions.resize(size); - Index number_of_transpositions = 0; - - RealScalar biggest(0); - - m_nonzero_pivots = size; // the generic case is that in which all pivots are nonzero (invertible case) - m_maxpivot = RealScalar(0); - - for (Index k = 0; k < size; ++k) - { - Index row_of_biggest_in_corner, col_of_biggest_in_corner; - typedef internal::scalar_score_coeff_op Scoring; - typedef typename Scoring::result_type Score; - - Score score = m_qr.bottomRightCorner(rows-k, cols-k) - .unaryExpr(Scoring()) - .maxCoeff(&row_of_biggest_in_corner, &col_of_biggest_in_corner); - row_of_biggest_in_corner += k; - col_of_biggest_in_corner += k; - RealScalar biggest_in_corner = internal::abs_knowing_score()(m_qr(row_of_biggest_in_corner, col_of_biggest_in_corner), score); - if(k==0) biggest = biggest_in_corner; - - // if the corner is negligible, then we have less than full rank, and we can finish early - if(internal::isMuchSmallerThan(biggest_in_corner, biggest, m_precision)) - { - m_nonzero_pivots = k; - for(Index i = k; i < size; i++) - { - m_rows_transpositions.coeffRef(i) = i; - m_cols_transpositions.coeffRef(i) = i; - m_hCoeffs.coeffRef(i) = Scalar(0); - } - break; - } - - m_rows_transpositions.coeffRef(k) = row_of_biggest_in_corner; - m_cols_transpositions.coeffRef(k) = col_of_biggest_in_corner; - if(k != row_of_biggest_in_corner) { - m_qr.row(k).tail(cols-k).swap(m_qr.row(row_of_biggest_in_corner).tail(cols-k)); - ++number_of_transpositions; - } - if(k != col_of_biggest_in_corner) { - m_qr.col(k).swap(m_qr.col(col_of_biggest_in_corner)); - ++number_of_transpositions; - } - - RealScalar beta; - m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta); - m_qr.coeffRef(k,k) = beta; - - // remember the maximum absolute value of diagonal coefficients - if(abs(beta) > m_maxpivot) m_maxpivot = abs(beta); - - m_qr.bottomRightCorner(rows-k, cols-k-1) - .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1)); - } - - m_cols_permutation.setIdentity(cols); - for(Index k = 0; k < size; ++k) - m_cols_permutation.applyTranspositionOnTheRight(k, m_cols_transpositions.coeff(k)); - - m_det_pq = (number_of_transpositions%2) ? -1 : 1; - m_isInitialized = true; -} - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void FullPivHouseholderQR<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const -{ - eigen_assert(rhs.rows() == rows()); - const Index l_rank = rank(); - - // FIXME introduce nonzeroPivots() and use it here. and more generally, - // make the same improvements in this dec as in FullPivLU. - if(l_rank==0) - { - dst.setZero(); - return; - } - - typename RhsType::PlainObject c(rhs); - - Matrix temp(rhs.cols()); - for (Index k = 0; k < l_rank; ++k) - { - Index remainingSize = rows()-k; - c.row(k).swap(c.row(m_rows_transpositions.coeff(k))); - c.bottomRightCorner(remainingSize, rhs.cols()) - .applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize-1), - m_hCoeffs.coeff(k), &temp.coeffRef(0)); - } - - m_qr.topLeftCorner(l_rank, l_rank) - .template triangularView() - .solveInPlace(c.topRows(l_rank)); - - for(Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i); - for(Index i = l_rank; i < cols(); ++i) dst.row(m_cols_permutation.indices().coeff(i)).setZero(); -} -#endif - -namespace internal { - -template -struct Assignment >, internal::assign_op::Scalar>, Dense2Dense> -{ - typedef FullPivHouseholderQR QrType; - typedef Inverse SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); - } -}; - -/** \ingroup QR_Module - * - * \brief Expression type for return value of FullPivHouseholderQR::matrixQ() - * - * \tparam MatrixType type of underlying dense matrix - */ -template struct FullPivHouseholderQRMatrixQReturnType - : public ReturnByValue > -{ -public: - typedef typename FullPivHouseholderQR::IntDiagSizeVectorType IntDiagSizeVectorType; - typedef typename internal::plain_diag_type::type HCoeffsType; - typedef Matrix WorkVectorType; - - FullPivHouseholderQRMatrixQReturnType(const MatrixType& qr, - const HCoeffsType& hCoeffs, - const IntDiagSizeVectorType& rowsTranspositions) - : m_qr(qr), - m_hCoeffs(hCoeffs), - m_rowsTranspositions(rowsTranspositions) - {} - - template - void evalTo(ResultType& result) const - { - const Index rows = m_qr.rows(); - WorkVectorType workspace(rows); - evalTo(result, workspace); - } - - template - void evalTo(ResultType& result, WorkVectorType& workspace) const - { - using numext::conj; - // compute the product H'_0 H'_1 ... H'_n-1, - // where H_k is the k-th Householder transformation I - h_k v_k v_k' - // and v_k is the k-th Householder vector [1,m_qr(k+1,k), m_qr(k+2,k), ...] - const Index rows = m_qr.rows(); - const Index cols = m_qr.cols(); - const Index size = (std::min)(rows, cols); - workspace.resize(rows); - result.setIdentity(rows, rows); - for (Index k = size-1; k >= 0; k--) - { - result.block(k, k, rows-k, rows-k) - .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), conj(m_hCoeffs.coeff(k)), &workspace.coeffRef(k)); - result.row(k).swap(result.row(m_rowsTranspositions.coeff(k))); - } - } - - Index rows() const { return m_qr.rows(); } - Index cols() const { return m_qr.rows(); } - -protected: - typename MatrixType::Nested m_qr; - typename HCoeffsType::Nested m_hCoeffs; - typename IntDiagSizeVectorType::Nested m_rowsTranspositions; -}; - -// template -// struct evaluator > -// : public evaluator > > -// {}; - -} // end namespace internal - -template -inline typename FullPivHouseholderQR::MatrixQReturnType FullPivHouseholderQR::matrixQ() const -{ - eigen_assert(m_isInitialized && "FullPivHouseholderQR is not initialized."); - return MatrixQReturnType(m_qr, m_hCoeffs, m_rows_transpositions); -} - -/** \return the full-pivoting Householder QR decomposition of \c *this. - * - * \sa class FullPivHouseholderQR - */ -template -const FullPivHouseholderQR::PlainObject> -MatrixBase::fullPivHouseholderQr() const -{ - return FullPivHouseholderQR(eval()); -} - -} // end namespace Eigen - -#endif // EIGEN_FULLPIVOTINGHOUSEHOLDERQR_H diff --git a/Eigen/src/QR/HouseholderQR.h b/Eigen/src/QR/HouseholderQR.h deleted file mode 100644 index 762b21c36..000000000 --- a/Eigen/src/QR/HouseholderQR.h +++ /dev/null @@ -1,408 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2009 Benoit Jacob -// Copyright (C) 2010 Vincent Lejeune -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_QR_H -#define EIGEN_QR_H - -namespace Eigen { - -/** \ingroup QR_Module - * - * - * \class HouseholderQR - * - * \brief Householder QR decomposition of a matrix - * - * \tparam _MatrixType the type of the matrix of which we are computing the QR decomposition - * - * This class performs a QR decomposition of a matrix \b A into matrices \b Q and \b R - * such that - * \f[ - * \mathbf{A} = \mathbf{Q} \, \mathbf{R} - * \f] - * by using Householder transformations. Here, \b Q a unitary matrix and \b R an upper triangular matrix. - * The result is stored in a compact way compatible with LAPACK. - * - * Note that no pivoting is performed. This is \b not a rank-revealing decomposition. - * If you want that feature, use FullPivHouseholderQR or ColPivHouseholderQR instead. - * - * This Householder QR decomposition is faster, but less numerically stable and less feature-full than - * FullPivHouseholderQR or ColPivHouseholderQR. - * - * This class supports the \link InplaceDecomposition inplace decomposition \endlink mechanism. - * - * \sa MatrixBase::householderQr() - */ -template class HouseholderQR -{ - public: - - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - // FIXME should be int - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Matrix MatrixQType; - typedef typename internal::plain_diag_type::type HCoeffsType; - typedef typename internal::plain_row_type::type RowVectorType; - typedef HouseholderSequence::type> HouseholderSequenceType; - - /** - * \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via HouseholderQR::compute(const MatrixType&). - */ - HouseholderQR() : m_qr(), m_hCoeffs(), m_temp(), m_isInitialized(false) {} - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem \a size. - * \sa HouseholderQR() - */ - HouseholderQR(Index rows, Index cols) - : m_qr(rows, cols), - m_hCoeffs((std::min)(rows,cols)), - m_temp(cols), - m_isInitialized(false) {} - - /** \brief Constructs a QR factorization from a given matrix - * - * This constructor computes the QR factorization of the matrix \a matrix by calling - * the method compute(). It is a short cut for: - * - * \code - * HouseholderQR qr(matrix.rows(), matrix.cols()); - * qr.compute(matrix); - * \endcode - * - * \sa compute() - */ - template - explicit HouseholderQR(const EigenBase& matrix) - : m_qr(matrix.rows(), matrix.cols()), - m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), - m_temp(matrix.cols()), - m_isInitialized(false) - { - compute(matrix.derived()); - } - - - /** \brief Constructs a QR factorization from a given matrix - * - * This overloaded constructor is provided for \link InplaceDecomposition inplace decomposition \endlink when - * \c MatrixType is a Eigen::Ref. - * - * \sa HouseholderQR(const EigenBase&) - */ - template - explicit HouseholderQR(EigenBase& matrix) - : m_qr(matrix.derived()), - m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), - m_temp(matrix.cols()), - m_isInitialized(false) - { - computeInPlace(); - } - - /** This method finds a solution x to the equation Ax=b, where A is the matrix of which - * *this is the QR decomposition, if any exists. - * - * \param b the right-hand-side of the equation to solve. - * - * \returns a solution. - * - * \note_about_checking_solutions - * - * \note_about_arbitrary_choice_of_solution - * - * Example: \include HouseholderQR_solve.cpp - * Output: \verbinclude HouseholderQR_solve.out - */ - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "HouseholderQR is not initialized."); - return Solve(*this, b.derived()); - } - - /** This method returns an expression of the unitary matrix Q as a sequence of Householder transformations. - * - * The returned expression can directly be used to perform matrix products. It can also be assigned to a dense Matrix object. - * Here is an example showing how to recover the full or thin matrix Q, as well as how to perform matrix products using operator*: - * - * Example: \include HouseholderQR_householderQ.cpp - * Output: \verbinclude HouseholderQR_householderQ.out - */ - HouseholderSequenceType householderQ() const - { - eigen_assert(m_isInitialized && "HouseholderQR is not initialized."); - return HouseholderSequenceType(m_qr, m_hCoeffs.conjugate()); - } - - /** \returns a reference to the matrix where the Householder QR decomposition is stored - * in a LAPACK-compatible way. - */ - const MatrixType& matrixQR() const - { - eigen_assert(m_isInitialized && "HouseholderQR is not initialized."); - return m_qr; - } - - template - HouseholderQR& compute(const EigenBase& matrix) { - m_qr = matrix.derived(); - computeInPlace(); - return *this; - } - - /** \returns the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the QR decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * One way to work around that is to use logAbsDeterminant() instead. - * - * \sa logAbsDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar absDeterminant() const; - - /** \returns the natural log of the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. It has only linear complexity - * (that is, O(n) where n is the dimension of the square matrix) - * as the QR decomposition has already been computed. - * - * \note This is only for square matrices. - * - * \note This method is useful to work around the risk of overflow/underflow that's inherent - * to determinant computation. - * - * \sa absDeterminant(), MatrixBase::determinant() - */ - typename MatrixType::RealScalar logAbsDeterminant() const; - - inline Index rows() const { return m_qr.rows(); } - inline Index cols() const { return m_qr.cols(); } - - /** \returns a const reference to the vector of Householder coefficients used to represent the factor \c Q. - * - * For advanced uses only. - */ - const HCoeffsType& hCoeffs() const { return m_hCoeffs; } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - void _solve_impl(const RhsType &rhs, DstType &dst) const; - #endif - - protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - void computeInPlace(); - - MatrixType m_qr; - HCoeffsType m_hCoeffs; - RowVectorType m_temp; - bool m_isInitialized; -}; - -template -typename MatrixType::RealScalar HouseholderQR::absDeterminant() const -{ - using std::abs; - eigen_assert(m_isInitialized && "HouseholderQR is not initialized."); - eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!"); - return abs(m_qr.diagonal().prod()); -} - -template -typename MatrixType::RealScalar HouseholderQR::logAbsDeterminant() const -{ - eigen_assert(m_isInitialized && "HouseholderQR is not initialized."); - eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!"); - return m_qr.diagonal().cwiseAbs().array().log().sum(); -} - -namespace internal { - -/** \internal */ -template -void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename MatrixQR::Scalar* tempData = 0) -{ - typedef typename MatrixQR::Scalar Scalar; - typedef typename MatrixQR::RealScalar RealScalar; - Index rows = mat.rows(); - Index cols = mat.cols(); - Index size = (std::min)(rows,cols); - - eigen_assert(hCoeffs.size() == size); - - typedef Matrix TempType; - TempType tempVector; - if(tempData==0) - { - tempVector.resize(cols); - tempData = tempVector.data(); - } - - for(Index k = 0; k < size; ++k) - { - Index remainingRows = rows - k; - Index remainingCols = cols - k - 1; - - RealScalar beta; - mat.col(k).tail(remainingRows).makeHouseholderInPlace(hCoeffs.coeffRef(k), beta); - mat.coeffRef(k,k) = beta; - - // apply H to remaining part of m_qr from the left - mat.bottomRightCorner(remainingRows, remainingCols) - .applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows-1), hCoeffs.coeffRef(k), tempData+k+1); - } -} - -/** \internal */ -template -struct householder_qr_inplace_blocked -{ - // This is specialized for MKL-supported Scalar types in HouseholderQR_MKL.h - static void run(MatrixQR& mat, HCoeffs& hCoeffs, Index maxBlockSize=32, - typename MatrixQR::Scalar* tempData = 0) - { - typedef typename MatrixQR::Scalar Scalar; - typedef Block BlockType; - - Index rows = mat.rows(); - Index cols = mat.cols(); - Index size = (std::min)(rows, cols); - - typedef Matrix TempType; - TempType tempVector; - if(tempData==0) - { - tempVector.resize(cols); - tempData = tempVector.data(); - } - - Index blockSize = (std::min)(maxBlockSize,size); - - Index k = 0; - for (k = 0; k < size; k += blockSize) - { - Index bs = (std::min)(size-k,blockSize); // actual size of the block - Index tcols = cols - k - bs; // trailing columns - Index brows = rows-k; // rows of the block - - // partition the matrix: - // A00 | A01 | A02 - // mat = A10 | A11 | A12 - // A20 | A21 | A22 - // and performs the qr dec of [A11^T A12^T]^T - // and update [A21^T A22^T]^T using level 3 operations. - // Finally, the algorithm continue on A22 - - BlockType A11_21 = mat.block(k,k,brows,bs); - Block hCoeffsSegment = hCoeffs.segment(k,bs); - - householder_qr_inplace_unblocked(A11_21, hCoeffsSegment, tempData); - - if(tcols) - { - BlockType A21_22 = mat.block(k,k+bs,brows,tcols); - apply_block_householder_on_the_left(A21_22,A11_21,hCoeffsSegment, false); // false == backward - } - } - } -}; - -} // end namespace internal - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void HouseholderQR<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const -{ - const Index rank = (std::min)(rows(), cols()); - eigen_assert(rhs.rows() == rows()); - - typename RhsType::PlainObject c(rhs); - - // Note that the matrix Q = H_0^* H_1^*... so its inverse is Q^* = (H_0 H_1 ...)^T - c.applyOnTheLeft(householderSequence( - m_qr.leftCols(rank), - m_hCoeffs.head(rank)).transpose() - ); - - m_qr.topLeftCorner(rank, rank) - .template triangularView() - .solveInPlace(c.topRows(rank)); - - dst.topRows(rank) = c.topRows(rank); - dst.bottomRows(cols()-rank).setZero(); -} -#endif - -/** Performs the QR factorization of the given matrix \a matrix. The result of - * the factorization is stored into \c *this, and a reference to \c *this - * is returned. - * - * \sa class HouseholderQR, HouseholderQR(const MatrixType&) - */ -template -void HouseholderQR::computeInPlace() -{ - check_template_parameters(); - - Index rows = m_qr.rows(); - Index cols = m_qr.cols(); - Index size = (std::min)(rows,cols); - - m_hCoeffs.resize(size); - - m_temp.resize(cols); - - internal::householder_qr_inplace_blocked::run(m_qr, m_hCoeffs, 48, m_temp.data()); - - m_isInitialized = true; -} - -/** \return the Householder QR decomposition of \c *this. - * - * \sa class HouseholderQR - */ -template -const HouseholderQR::PlainObject> -MatrixBase::householderQr() const -{ - return HouseholderQR(eval()); -} - -} // end namespace Eigen - -#endif // EIGEN_QR_H diff --git a/Eigen/src/QR/HouseholderQR_LAPACKE.h b/Eigen/src/QR/HouseholderQR_LAPACKE.h deleted file mode 100644 index 1dc7d5363..000000000 --- a/Eigen/src/QR/HouseholderQR_LAPACKE.h +++ /dev/null @@ -1,68 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to LAPACKe - * Householder QR decomposition of a matrix w/o pivoting based on - * LAPACKE_?geqrf function. - ******************************************************************************** -*/ - -#ifndef EIGEN_QR_LAPACKE_H -#define EIGEN_QR_LAPACKE_H - -namespace Eigen { - -namespace internal { - -/** \internal Specialization for the data types supported by LAPACKe */ - -#define EIGEN_LAPACKE_QR_NOPIV(EIGTYPE, LAPACKE_TYPE, LAPACKE_PREFIX) \ -template \ -struct householder_qr_inplace_blocked \ -{ \ - static void run(MatrixQR& mat, HCoeffs& hCoeffs, Index = 32, \ - typename MatrixQR::Scalar* = 0) \ - { \ - lapack_int m = (lapack_int) mat.rows(); \ - lapack_int n = (lapack_int) mat.cols(); \ - lapack_int lda = (lapack_int) mat.outerStride(); \ - lapack_int matrix_order = (MatrixQR::IsRowMajor) ? LAPACK_ROW_MAJOR : LAPACK_COL_MAJOR; \ - LAPACKE_##LAPACKE_PREFIX##geqrf( matrix_order, m, n, (LAPACKE_TYPE*)mat.data(), lda, (LAPACKE_TYPE*)hCoeffs.data()); \ - hCoeffs.adjointInPlace(); \ - } \ -}; - -EIGEN_LAPACKE_QR_NOPIV(double, double, d) -EIGEN_LAPACKE_QR_NOPIV(float, float, s) -EIGEN_LAPACKE_QR_NOPIV(dcomplex, lapack_complex_double, z) -EIGEN_LAPACKE_QR_NOPIV(scomplex, lapack_complex_float, c) - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_QR_LAPACKE_H diff --git a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h b/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h deleted file mode 100644 index 953d57c9d..000000000 --- a/Eigen/src/SPQRSupport/SuiteSparseQRSupport.h +++ /dev/null @@ -1,313 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Desire Nuentsa -// Copyright (C) 2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SUITESPARSEQRSUPPORT_H -#define EIGEN_SUITESPARSEQRSUPPORT_H - -namespace Eigen { - - template class SPQR; - template struct SPQRMatrixQReturnType; - template struct SPQRMatrixQTransposeReturnType; - template struct SPQR_QProduct; - namespace internal { - template struct traits > - { - typedef typename SPQRType::MatrixType ReturnType; - }; - template struct traits > - { - typedef typename SPQRType::MatrixType ReturnType; - }; - template struct traits > - { - typedef typename Derived::PlainObject ReturnType; - }; - } // End namespace internal - -/** - * \ingroup SPQRSupport_Module - * \class SPQR - * \brief Sparse QR factorization based on SuiteSparseQR library - * - * This class is used to perform a multithreaded and multifrontal rank-revealing QR decomposition - * of sparse matrices. The result is then used to solve linear leasts_square systems. - * Clearly, a QR factorization is returned such that A*P = Q*R where : - * - * P is the column permutation. Use colsPermutation() to get it. - * - * Q is the orthogonal matrix represented as Householder reflectors. - * Use matrixQ() to get an expression and matrixQ().transpose() to get the transpose. - * You can then apply it to a vector. - * - * R is the sparse triangular factor. Use matrixQR() to get it as SparseMatrix. - * NOTE : The Index type of R is always SuiteSparse_long. You can get it with SPQR::Index - * - * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<> - * - * \implsparsesolverconcept - * - * - */ -template -class SPQR : public SparseSolverBase > -{ - protected: - typedef SparseSolverBase > Base; - using Base::m_isInitialized; - public: - typedef typename _MatrixType::Scalar Scalar; - typedef typename _MatrixType::RealScalar RealScalar; - typedef SuiteSparse_long StorageIndex ; - typedef SparseMatrix MatrixType; - typedef Map > PermutationType; - enum { - ColsAtCompileTime = Dynamic, - MaxColsAtCompileTime = Dynamic - }; - public: - SPQR() - : m_ordering(SPQR_ORDERING_DEFAULT), m_allow_tol(SPQR_DEFAULT_TOL), m_tolerance (NumTraits::epsilon()), m_useDefaultThreshold(true) - { - cholmod_l_start(&m_cc); - } - - explicit SPQR(const _MatrixType& matrix) - : m_ordering(SPQR_ORDERING_DEFAULT), m_allow_tol(SPQR_DEFAULT_TOL), m_tolerance (NumTraits::epsilon()), m_useDefaultThreshold(true) - { - cholmod_l_start(&m_cc); - compute(matrix); - } - - ~SPQR() - { - SPQR_free(); - cholmod_l_finish(&m_cc); - } - void SPQR_free() - { - cholmod_l_free_sparse(&m_H, &m_cc); - cholmod_l_free_sparse(&m_cR, &m_cc); - cholmod_l_free_dense(&m_HTau, &m_cc); - std::free(m_E); - std::free(m_HPinv); - } - - void compute(const _MatrixType& matrix) - { - if(m_isInitialized) SPQR_free(); - - MatrixType mat(matrix); - - /* Compute the default threshold as in MatLab, see: - * Tim Davis, "Algorithm 915, SuiteSparseQR: Multifrontal Multithreaded Rank-Revealing - * Sparse QR Factorization, ACM Trans. on Math. Soft. 38(1), 2011, Page 8:3 - */ - RealScalar pivotThreshold = m_tolerance; - if(m_useDefaultThreshold) - { - RealScalar max2Norm = 0.0; - for (int j = 0; j < mat.cols(); j++) max2Norm = numext::maxi(max2Norm, mat.col(j).norm()); - if(max2Norm==RealScalar(0)) - max2Norm = RealScalar(1); - pivotThreshold = 20 * (mat.rows() + mat.cols()) * max2Norm * NumTraits::epsilon(); - } - cholmod_sparse A; - A = viewAsCholmod(mat); - m_rows = matrix.rows(); - Index col = matrix.cols(); - m_rank = SuiteSparseQR(m_ordering, pivotThreshold, col, &A, - &m_cR, &m_E, &m_H, &m_HPinv, &m_HTau, &m_cc); - - if (!m_cR) - { - m_info = NumericalIssue; - m_isInitialized = false; - return; - } - m_info = Success; - m_isInitialized = true; - m_isRUpToDate = false; - } - /** - * Get the number of rows of the input matrix and the Q matrix - */ - inline Index rows() const {return m_rows; } - - /** - * Get the number of columns of the input matrix. - */ - inline Index cols() const { return m_cR->ncol; } - - template - void _solve_impl(const MatrixBase &b, MatrixBase &dest) const - { - eigen_assert(m_isInitialized && " The QR factorization should be computed first, call compute()"); - eigen_assert(b.cols()==1 && "This method is for vectors only"); - - //Compute Q^T * b - typename Dest::PlainObject y, y2; - y = matrixQ().transpose() * b; - - // Solves with the triangular matrix R - Index rk = this->rank(); - y2 = y; - y.resize((std::max)(cols(),Index(y.rows())),y.cols()); - y.topRows(rk) = this->matrixR().topLeftCorner(rk, rk).template triangularView().solve(y2.topRows(rk)); - - // Apply the column permutation - // colsPermutation() performs a copy of the permutation, - // so let's apply it manually: - for(Index i = 0; i < rk; ++i) dest.row(m_E[i]) = y.row(i); - for(Index i = rk; i < cols(); ++i) dest.row(m_E[i]).setZero(); - -// y.bottomRows(y.rows()-rk).setZero(); -// dest = colsPermutation() * y.topRows(cols()); - - m_info = Success; - } - - /** \returns the sparse triangular factor R. It is a sparse matrix - */ - const MatrixType matrixR() const - { - eigen_assert(m_isInitialized && " The QR factorization should be computed first, call compute()"); - if(!m_isRUpToDate) { - m_R = viewAsEigen(*m_cR); - m_isRUpToDate = true; - } - return m_R; - } - /// Get an expression of the matrix Q - SPQRMatrixQReturnType matrixQ() const - { - return SPQRMatrixQReturnType(*this); - } - /// Get the permutation that was applied to columns of A - PermutationType colsPermutation() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return PermutationType(m_E, m_cR->ncol); - } - /** - * Gets the rank of the matrix. - * It should be equal to matrixQR().cols if the matrix is full-rank - */ - Index rank() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_cc.SPQR_istat[4]; - } - /// Set the fill-reducing ordering method to be used - void setSPQROrdering(int ord) { m_ordering = ord;} - /// Set the tolerance tol to treat columns with 2-norm < =tol as zero - void setPivotThreshold(const RealScalar& tol) - { - m_useDefaultThreshold = false; - m_tolerance = tol; - } - - /** \returns a pointer to the SPQR workspace */ - cholmod_common *cholmodCommon() const { return &m_cc; } - - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the sparse QR can not be computed - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - protected: - bool m_analysisIsOk; - bool m_factorizationIsOk; - mutable bool m_isRUpToDate; - mutable ComputationInfo m_info; - int m_ordering; // Ordering method to use, see SPQR's manual - int m_allow_tol; // Allow to use some tolerance during numerical factorization. - RealScalar m_tolerance; // treat columns with 2-norm below this tolerance as zero - mutable cholmod_sparse *m_cR; // The sparse R factor in cholmod format - mutable MatrixType m_R; // The sparse matrix R in Eigen format - mutable StorageIndex *m_E; // The permutation applied to columns - mutable cholmod_sparse *m_H; //The householder vectors - mutable StorageIndex *m_HPinv; // The row permutation of H - mutable cholmod_dense *m_HTau; // The Householder coefficients - mutable Index m_rank; // The rank of the matrix - mutable cholmod_common m_cc; // Workspace and parameters - bool m_useDefaultThreshold; // Use default threshold - Index m_rows; - template friend struct SPQR_QProduct; -}; - -template -struct SPQR_QProduct : ReturnByValue > -{ - typedef typename SPQRType::Scalar Scalar; - typedef typename SPQRType::StorageIndex StorageIndex; - //Define the constructor to get reference to argument types - SPQR_QProduct(const SPQRType& spqr, const Derived& other, bool transpose) : m_spqr(spqr),m_other(other),m_transpose(transpose) {} - - inline Index rows() const { return m_transpose ? m_spqr.rows() : m_spqr.cols(); } - inline Index cols() const { return m_other.cols(); } - // Assign to a vector - template - void evalTo(ResType& res) const - { - cholmod_dense y_cd; - cholmod_dense *x_cd; - int method = m_transpose ? SPQR_QTX : SPQR_QX; - cholmod_common *cc = m_spqr.cholmodCommon(); - y_cd = viewAsCholmod(m_other.const_cast_derived()); - x_cd = SuiteSparseQR_qmult(method, m_spqr.m_H, m_spqr.m_HTau, m_spqr.m_HPinv, &y_cd, cc); - res = Matrix::Map(reinterpret_cast(x_cd->x), x_cd->nrow, x_cd->ncol); - cholmod_l_free_dense(&x_cd, cc); - } - const SPQRType& m_spqr; - const Derived& m_other; - bool m_transpose; - -}; -template -struct SPQRMatrixQReturnType{ - - SPQRMatrixQReturnType(const SPQRType& spqr) : m_spqr(spqr) {} - template - SPQR_QProduct operator*(const MatrixBase& other) - { - return SPQR_QProduct(m_spqr,other.derived(),false); - } - SPQRMatrixQTransposeReturnType adjoint() const - { - return SPQRMatrixQTransposeReturnType(m_spqr); - } - // To use for operations with the transpose of Q - SPQRMatrixQTransposeReturnType transpose() const - { - return SPQRMatrixQTransposeReturnType(m_spqr); - } - const SPQRType& m_spqr; -}; - -template -struct SPQRMatrixQTransposeReturnType{ - SPQRMatrixQTransposeReturnType(const SPQRType& spqr) : m_spqr(spqr) {} - template - SPQR_QProduct operator*(const MatrixBase& other) - { - return SPQR_QProduct(m_spqr,other.derived(), true); - } - const SPQRType& m_spqr; -}; - -}// End namespace Eigen -#endif diff --git a/Eigen/src/SVD/BDCSVD.h b/Eigen/src/SVD/BDCSVD.h deleted file mode 100644 index 06865a331..000000000 --- a/Eigen/src/SVD/BDCSVD.h +++ /dev/null @@ -1,1319 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// We used the "A Divide-And-Conquer Algorithm for the Bidiagonal SVD" -// research report written by Ming Gu and Stanley C.Eisenstat -// The code variable names correspond to the names they used in their -// report -// -// Copyright (C) 2013 Gauthier Brun -// Copyright (C) 2013 Nicolas Carre -// Copyright (C) 2013 Jean Ceccato -// Copyright (C) 2013 Pierre Zoppitelli -// Copyright (C) 2013 Jitse Niesen -// Copyright (C) 2014-2017 Gael Guennebaud -// -// Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BDCSVD_H -#define EIGEN_BDCSVD_H -// #define EIGEN_BDCSVD_DEBUG_VERBOSE -// #define EIGEN_BDCSVD_SANITY_CHECKS - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS -#undef eigen_internal_assert -#define eigen_internal_assert(X) assert(X); -#endif - -namespace Eigen { - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE -IOFormat bdcsvdfmt(8, 0, ", ", "\n", " [", "]"); -#endif - -template class BDCSVD; - -namespace internal { - -template -struct traits > -{ - typedef _MatrixType MatrixType; -}; - -} // end namespace internal - - -/** \ingroup SVD_Module - * - * - * \class BDCSVD - * - * \brief class Bidiagonal Divide and Conquer SVD - * - * \tparam _MatrixType the type of the matrix of which we are computing the SVD decomposition - * - * This class first reduces the input matrix to bi-diagonal form using class UpperBidiagonalization, - * and then performs a divide-and-conquer diagonalization. Small blocks are diagonalized using class JacobiSVD. - * You can control the switching size with the setSwitchSize() method, default is 16. - * For small matrice (<16), it is thus preferable to directly use JacobiSVD. For larger ones, BDCSVD is highly - * recommended and can several order of magnitude faster. - * - * \warning this algorithm is unlikely to provide accurate result when compiled with unsafe math optimizations. - * For instance, this concerns Intel's compiler (ICC), which perfroms such optimization by default unless - * you compile with the \c -fp-model \c precise option. Likewise, the \c -ffast-math option of GCC or clang will - * significantly degrade the accuracy. - * - * \sa class JacobiSVD - */ -template -class BDCSVD : public SVDBase > -{ - typedef SVDBase Base; - -public: - using Base::rows; - using Base::cols; - using Base::computeU; - using Base::computeV; - - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef typename NumTraits::Literal Literal; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - DiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime, ColsAtCompileTime), - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, - MaxDiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(MaxRowsAtCompileTime, MaxColsAtCompileTime), - MatrixOptions = MatrixType::Options - }; - - typedef typename Base::MatrixUType MatrixUType; - typedef typename Base::MatrixVType MatrixVType; - typedef typename Base::SingularValuesType SingularValuesType; - - typedef Matrix MatrixX; - typedef Matrix MatrixXr; - typedef Matrix VectorType; - typedef Array ArrayXr; - typedef Array ArrayXi; - typedef Ref ArrayRef; - typedef Ref IndicesRef; - - /** \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via BDCSVD::compute(const MatrixType&). - */ - BDCSVD() : m_algoswap(16), m_numIters(0) - {} - - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem size. - * \sa BDCSVD() - */ - BDCSVD(Index rows, Index cols, unsigned int computationOptions = 0) - : m_algoswap(16), m_numIters(0) - { - allocate(rows, cols, computationOptions); - } - - /** \brief Constructor performing the decomposition of given matrix. - * - * \param matrix the matrix to decompose - * \param computationOptions optional parameter allowing to specify if you want full or thin U or V unitaries to be computed. - * By default, none is computed. This is a bit - field, the possible bits are #ComputeFullU, #ComputeThinU, - * #ComputeFullV, #ComputeThinV. - * - * Thin unitaries are only available if your matrix type has a Dynamic number of columns (for example MatrixXf). They also are not - * available with the (non - default) FullPivHouseholderQR preconditioner. - */ - BDCSVD(const MatrixType& matrix, unsigned int computationOptions = 0) - : m_algoswap(16), m_numIters(0) - { - compute(matrix, computationOptions); - } - - ~BDCSVD() - { - } - - /** \brief Method performing the decomposition of given matrix using custom options. - * - * \param matrix the matrix to decompose - * \param computationOptions optional parameter allowing to specify if you want full or thin U or V unitaries to be computed. - * By default, none is computed. This is a bit - field, the possible bits are #ComputeFullU, #ComputeThinU, - * #ComputeFullV, #ComputeThinV. - * - * Thin unitaries are only available if your matrix type has a Dynamic number of columns (for example MatrixXf). They also are not - * available with the (non - default) FullPivHouseholderQR preconditioner. - */ - BDCSVD& compute(const MatrixType& matrix, unsigned int computationOptions); - - /** \brief Method performing the decomposition of given matrix using current options. - * - * \param matrix the matrix to decompose - * - * This method uses the current \a computationOptions, as already passed to the constructor or to compute(const MatrixType&, unsigned int). - */ - BDCSVD& compute(const MatrixType& matrix) - { - return compute(matrix, this->m_computationOptions); - } - - void setSwitchSize(int s) - { - eigen_assert(s>3 && "BDCSVD the size of the algo switch has to be greater than 3"); - m_algoswap = s; - } - -private: - void allocate(Index rows, Index cols, unsigned int computationOptions); - void divide(Index firstCol, Index lastCol, Index firstRowW, Index firstColW, Index shift); - void computeSVDofM(Index firstCol, Index n, MatrixXr& U, VectorType& singVals, MatrixXr& V); - void computeSingVals(const ArrayRef& col0, const ArrayRef& diag, const IndicesRef& perm, VectorType& singVals, ArrayRef shifts, ArrayRef mus); - void perturbCol0(const ArrayRef& col0, const ArrayRef& diag, const IndicesRef& perm, const VectorType& singVals, const ArrayRef& shifts, const ArrayRef& mus, ArrayRef zhat); - void computeSingVecs(const ArrayRef& zhat, const ArrayRef& diag, const IndicesRef& perm, const VectorType& singVals, const ArrayRef& shifts, const ArrayRef& mus, MatrixXr& U, MatrixXr& V); - void deflation43(Index firstCol, Index shift, Index i, Index size); - void deflation44(Index firstColu , Index firstColm, Index firstRowW, Index firstColW, Index i, Index j, Index size); - void deflation(Index firstCol, Index lastCol, Index k, Index firstRowW, Index firstColW, Index shift); - template - void copyUV(const HouseholderU &householderU, const HouseholderV &householderV, const NaiveU &naiveU, const NaiveV &naivev); - void structured_update(Block A, const MatrixXr &B, Index n1); - static RealScalar secularEq(RealScalar x, const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, const ArrayRef& diagShifted, RealScalar shift); - -protected: - MatrixXr m_naiveU, m_naiveV; - MatrixXr m_computed; - Index m_nRec; - ArrayXr m_workspace; - ArrayXi m_workspaceI; - int m_algoswap; - bool m_isTranspose, m_compU, m_compV; - - using Base::m_singularValues; - using Base::m_diagSize; - using Base::m_computeFullU; - using Base::m_computeFullV; - using Base::m_computeThinU; - using Base::m_computeThinV; - using Base::m_matrixU; - using Base::m_matrixV; - using Base::m_isInitialized; - using Base::m_nonzeroSingularValues; - -public: - int m_numIters; -}; //end class BDCSVD - - -// Method to allocate and initialize matrix and attributes -template -void BDCSVD::allocate(Eigen::Index rows, Eigen::Index cols, unsigned int computationOptions) -{ - m_isTranspose = (cols > rows); - - if (Base::allocate(rows, cols, computationOptions)) - return; - - m_computed = MatrixXr::Zero(m_diagSize + 1, m_diagSize ); - m_compU = computeV(); - m_compV = computeU(); - if (m_isTranspose) - std::swap(m_compU, m_compV); - - if (m_compU) m_naiveU = MatrixXr::Zero(m_diagSize + 1, m_diagSize + 1 ); - else m_naiveU = MatrixXr::Zero(2, m_diagSize + 1 ); - - if (m_compV) m_naiveV = MatrixXr::Zero(m_diagSize, m_diagSize); - - m_workspace.resize((m_diagSize+1)*(m_diagSize+1)*3); - m_workspaceI.resize(3*m_diagSize); -}// end allocate - -template -BDCSVD& BDCSVD::compute(const MatrixType& matrix, unsigned int computationOptions) -{ -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "\n\n\n======================================================================================================================\n\n\n"; -#endif - allocate(matrix.rows(), matrix.cols(), computationOptions); - using std::abs; - - const RealScalar considerZero = (std::numeric_limits::min)(); - - //**** step -1 - If the problem is too small, directly falls back to JacobiSVD and return - if(matrix.cols() < m_algoswap) - { - // FIXME this line involves temporaries - JacobiSVD jsvd(matrix,computationOptions); - if(computeU()) m_matrixU = jsvd.matrixU(); - if(computeV()) m_matrixV = jsvd.matrixV(); - m_singularValues = jsvd.singularValues(); - m_nonzeroSingularValues = jsvd.nonzeroSingularValues(); - m_isInitialized = true; - return *this; - } - - //**** step 0 - Copy the input matrix and apply scaling to reduce over/under-flows - RealScalar scale = matrix.cwiseAbs().maxCoeff(); - if(scale==Literal(0)) scale = Literal(1); - MatrixX copy; - if (m_isTranspose) copy = matrix.adjoint()/scale; - else copy = matrix/scale; - - //**** step 1 - Bidiagonalization - // FIXME this line involves temporaries - internal::UpperBidiagonalization bid(copy); - - //**** step 2 - Divide & Conquer - m_naiveU.setZero(); - m_naiveV.setZero(); - // FIXME this line involves a temporary matrix - m_computed.topRows(m_diagSize) = bid.bidiagonal().toDenseMatrix().transpose(); - m_computed.template bottomRows<1>().setZero(); - divide(0, m_diagSize - 1, 0, 0, 0); - - //**** step 3 - Copy singular values and vectors - for (int i=0; i -template -void BDCSVD::copyUV(const HouseholderU &householderU, const HouseholderV &householderV, const NaiveU &naiveU, const NaiveV &naiveV) -{ - // Note exchange of U and V: m_matrixU is set from m_naiveV and vice versa - if (computeU()) - { - Index Ucols = m_computeThinU ? m_diagSize : householderU.cols(); - m_matrixU = MatrixX::Identity(householderU.cols(), Ucols); - m_matrixU.topLeftCorner(m_diagSize, m_diagSize) = naiveV.template cast().topLeftCorner(m_diagSize, m_diagSize); - householderU.applyThisOnTheLeft(m_matrixU); // FIXME this line involves a temporary buffer - } - if (computeV()) - { - Index Vcols = m_computeThinV ? m_diagSize : householderV.cols(); - m_matrixV = MatrixX::Identity(householderV.cols(), Vcols); - m_matrixV.topLeftCorner(m_diagSize, m_diagSize) = naiveU.template cast().topLeftCorner(m_diagSize, m_diagSize); - householderV.applyThisOnTheLeft(m_matrixV); // FIXME this line involves a temporary buffer - } -} - -/** \internal - * Performs A = A * B exploiting the special structure of the matrix A. Splitting A as: - * A = [A1] - * [A2] - * such that A1.rows()==n1, then we assume that at least half of the columns of A1 and A2 are zeros. - * We can thus pack them prior to the the matrix product. However, this is only worth the effort if the matrix is large - * enough. - */ -template -void BDCSVD::structured_update(Block A, const MatrixXr &B, Index n1) -{ - Index n = A.rows(); - if(n>100) - { - // If the matrices are large enough, let's exploit the sparse structure of A by - // splitting it in half (wrt n1), and packing the non-zero columns. - Index n2 = n - n1; - Map A1(m_workspace.data() , n1, n); - Map A2(m_workspace.data()+ n1*n, n2, n); - Map B1(m_workspace.data()+ n*n, n, n); - Map B2(m_workspace.data()+2*n*n, n, n); - Index k1=0, k2=0; - for(Index j=0; j tmp(m_workspace.data(),n,n); - tmp.noalias() = A*B; - A = tmp; - } -} - -// The divide algorithm is done "in place", we are always working on subsets of the same matrix. The divide methods takes as argument the -// place of the submatrix we are currently working on. - -//@param firstCol : The Index of the first column of the submatrix of m_computed and for m_naiveU; -//@param lastCol : The Index of the last column of the submatrix of m_computed and for m_naiveU; -// lastCol + 1 - firstCol is the size of the submatrix. -//@param firstRowW : The Index of the first row of the matrix W that we are to change. (see the reference paper section 1 for more information on W) -//@param firstRowW : Same as firstRowW with the column. -//@param shift : Each time one takes the left submatrix, one must add 1 to the shift. Why? Because! We actually want the last column of the U submatrix -// to become the first column (*coeff) and to shift all the other columns to the right. There are more details on the reference paper. -template -void BDCSVD::divide (Eigen::Index firstCol, Eigen::Index lastCol, Eigen::Index firstRowW, Eigen::Index firstColW, Eigen::Index shift) -{ - // requires rows = cols + 1; - using std::pow; - using std::sqrt; - using std::abs; - const Index n = lastCol - firstCol + 1; - const Index k = n/2; - const RealScalar considerZero = (std::numeric_limits::min)(); - RealScalar alphaK; - RealScalar betaK; - RealScalar r0; - RealScalar lambda, phi, c0, s0; - VectorType l, f; - // We use the other algorithm which is more efficient for small - // matrices. - if (n < m_algoswap) - { - // FIXME this line involves temporaries - JacobiSVD b(m_computed.block(firstCol, firstCol, n + 1, n), ComputeFullU | (m_compV ? ComputeFullV : 0)); - if (m_compU) - m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = b.matrixU(); - else - { - m_naiveU.row(0).segment(firstCol, n + 1).real() = b.matrixU().row(0); - m_naiveU.row(1).segment(firstCol, n + 1).real() = b.matrixU().row(n); - } - if (m_compV) m_naiveV.block(firstRowW, firstColW, n, n).real() = b.matrixV(); - m_computed.block(firstCol + shift, firstCol + shift, n + 1, n).setZero(); - m_computed.diagonal().segment(firstCol + shift, n) = b.singularValues().head(n); - return; - } - // We use the divide and conquer algorithm - alphaK = m_computed(firstCol + k, firstCol + k); - betaK = m_computed(firstCol + k + 1, firstCol + k); - // The divide must be done in that order in order to have good results. Divide change the data inside the submatrices - // and the divide of the right submatrice reads one column of the left submatrice. That's why we need to treat the - // right submatrix before the left one. - divide(k + 1 + firstCol, lastCol, k + 1 + firstRowW, k + 1 + firstColW, shift); - divide(firstCol, k - 1 + firstCol, firstRowW, firstColW + 1, shift + 1); - - if (m_compU) - { - lambda = m_naiveU(firstCol + k, firstCol + k); - phi = m_naiveU(firstCol + k + 1, lastCol + 1); - } - else - { - lambda = m_naiveU(1, firstCol + k); - phi = m_naiveU(0, lastCol + 1); - } - r0 = sqrt((abs(alphaK * lambda) * abs(alphaK * lambda)) + abs(betaK * phi) * abs(betaK * phi)); - if (m_compU) - { - l = m_naiveU.row(firstCol + k).segment(firstCol, k); - f = m_naiveU.row(firstCol + k + 1).segment(firstCol + k + 1, n - k - 1); - } - else - { - l = m_naiveU.row(1).segment(firstCol, k); - f = m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1); - } - if (m_compV) m_naiveV(firstRowW+k, firstColW) = Literal(1); - if (r0= firstCol; i--) - m_naiveU.col(i + 1).segment(firstCol, k + 1) = m_naiveU.col(i).segment(firstCol, k + 1); - // we shift q1 at the left with a factor c0 - m_naiveU.col(firstCol).segment( firstCol, k + 1) = (q1 * c0); - // last column = q1 * - s0 - m_naiveU.col(lastCol + 1).segment(firstCol, k + 1) = (q1 * ( - s0)); - // first column = q2 * s0 - m_naiveU.col(firstCol).segment(firstCol + k + 1, n - k) = m_naiveU.col(lastCol + 1).segment(firstCol + k + 1, n - k) * s0; - // q2 *= c0 - m_naiveU.col(lastCol + 1).segment(firstCol + k + 1, n - k) *= c0; - } - else - { - RealScalar q1 = m_naiveU(0, firstCol + k); - // we shift Q1 to the right - for (Index i = firstCol + k - 1; i >= firstCol; i--) - m_naiveU(0, i + 1) = m_naiveU(0, i); - // we shift q1 at the left with a factor c0 - m_naiveU(0, firstCol) = (q1 * c0); - // last column = q1 * - s0 - m_naiveU(0, lastCol + 1) = (q1 * ( - s0)); - // first column = q2 * s0 - m_naiveU(1, firstCol) = m_naiveU(1, lastCol + 1) *s0; - // q2 *= c0 - m_naiveU(1, lastCol + 1) *= c0; - m_naiveU.row(1).segment(firstCol + 1, k).setZero(); - m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1).setZero(); - } - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(m_naiveU.allFinite()); - assert(m_naiveV.allFinite()); - assert(m_computed.allFinite()); -#endif - - m_computed(firstCol + shift, firstCol + shift) = r0; - m_computed.col(firstCol + shift).segment(firstCol + shift + 1, k) = alphaK * l.transpose().real(); - m_computed.col(firstCol + shift).segment(firstCol + shift + k + 1, n - k - 1) = betaK * f.transpose().real(); - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - ArrayXr tmp1 = (m_computed.block(firstCol+shift, firstCol+shift, n, n)).jacobiSvd().singularValues(); -#endif - // Second part: try to deflate singular values in combined matrix - deflation(firstCol, lastCol, k, firstRowW, firstColW, shift); -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - ArrayXr tmp2 = (m_computed.block(firstCol+shift, firstCol+shift, n, n)).jacobiSvd().singularValues(); - std::cout << "\n\nj1 = " << tmp1.transpose().format(bdcsvdfmt) << "\n"; - std::cout << "j2 = " << tmp2.transpose().format(bdcsvdfmt) << "\n\n"; - std::cout << "err: " << ((tmp1-tmp2).abs()>1e-12*tmp2.abs()).transpose() << "\n"; - static int count = 0; - std::cout << "# " << ++count << "\n\n"; - assert((tmp1-tmp2).matrix().norm() < 1e-14*tmp2.matrix().norm()); -// assert(count<681); -// assert(((tmp1-tmp2).abs()<1e-13*tmp2.abs()).all()); -#endif - - // Third part: compute SVD of combined matrix - MatrixXr UofSVD, VofSVD; - VectorType singVals; - computeSVDofM(firstCol + shift, n, UofSVD, singVals, VofSVD); - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(UofSVD.allFinite()); - assert(VofSVD.allFinite()); -#endif - - if (m_compU) - structured_update(m_naiveU.block(firstCol, firstCol, n + 1, n + 1), UofSVD, (n+2)/2); - else - { - Map,Aligned> tmp(m_workspace.data(),2,n+1); - tmp.noalias() = m_naiveU.middleCols(firstCol, n+1) * UofSVD; - m_naiveU.middleCols(firstCol, n + 1) = tmp; - } - - if (m_compV) structured_update(m_naiveV.block(firstRowW, firstColW, n, n), VofSVD, (n+1)/2); - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(m_naiveU.allFinite()); - assert(m_naiveV.allFinite()); - assert(m_computed.allFinite()); -#endif - - m_computed.block(firstCol + shift, firstCol + shift, n, n).setZero(); - m_computed.block(firstCol + shift, firstCol + shift, n, n).diagonal() = singVals; -}// end divide - -// Compute SVD of m_computed.block(firstCol, firstCol, n + 1, n); this block only has non-zeros in -// the first column and on the diagonal and has undergone deflation, so diagonal is in increasing -// order except for possibly the (0,0) entry. The computed SVD is stored U, singVals and V, except -// that if m_compV is false, then V is not computed. Singular values are sorted in decreasing order. -// -// TODO Opportunities for optimization: better root finding algo, better stopping criterion, better -// handling of round-off errors, be consistent in ordering -// For instance, to solve the secular equation using FMM, see http://www.stat.uchicago.edu/~lekheng/courses/302/classics/greengard-rokhlin.pdf -template -void BDCSVD::computeSVDofM(Eigen::Index firstCol, Eigen::Index n, MatrixXr& U, VectorType& singVals, MatrixXr& V) -{ - const RealScalar considerZero = (std::numeric_limits::min)(); - using std::abs; - ArrayRef col0 = m_computed.col(firstCol).segment(firstCol, n); - m_workspace.head(n) = m_computed.block(firstCol, firstCol, n, n).diagonal(); - ArrayRef diag = m_workspace.head(n); - diag(0) = Literal(0); - - // Allocate space for singular values and vectors - singVals.resize(n); - U.resize(n+1, n+1); - if (m_compV) V.resize(n, n); - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - if (col0.hasNaN() || diag.hasNaN()) - std::cout << "\n\nHAS NAN\n\n"; -#endif - - // Many singular values might have been deflated, the zero ones have been moved to the end, - // but others are interleaved and we must ignore them at this stage. - // To this end, let's compute a permutation skipping them: - Index actual_n = n; - while(actual_n>1 && diag(actual_n-1)==Literal(0)) {--actual_n; eigen_internal_assert(col0(actual_n)==Literal(0)); } - Index m = 0; // size of the deflated problem - for(Index k=0;kconsiderZero) - m_workspaceI(m++) = k; - Map perm(m_workspaceI.data(),m); - - Map shifts(m_workspace.data()+1*n, n); - Map mus(m_workspace.data()+2*n, n); - Map zhat(m_workspace.data()+3*n, n); - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "computeSVDofM using:\n"; - std::cout << " z: " << col0.transpose() << "\n"; - std::cout << " d: " << diag.transpose() << "\n"; -#endif - - // Compute singVals, shifts, and mus - computeSingVals(col0, diag, perm, singVals, shifts, mus); - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << " j: " << (m_computed.block(firstCol, firstCol, n, n)).jacobiSvd().singularValues().transpose().reverse() << "\n\n"; - std::cout << " sing-val: " << singVals.transpose() << "\n"; - std::cout << " mu: " << mus.transpose() << "\n"; - std::cout << " shift: " << shifts.transpose() << "\n"; - - { - std::cout << "\n\n mus: " << mus.head(actual_n).transpose() << "\n\n"; - std::cout << " check1 (expect0) : " << ((singVals.array()-(shifts+mus)) / singVals.array()).head(actual_n).transpose() << "\n\n"; - assert((((singVals.array()-(shifts+mus)) / singVals.array()).head(actual_n) >= 0).all()); - std::cout << " check2 (>0) : " << ((singVals.array()-diag) / singVals.array()).head(actual_n).transpose() << "\n\n"; - assert((((singVals.array()-diag) / singVals.array()).head(actual_n) >= 0).all()); - } -#endif - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(singVals.allFinite()); - assert(mus.allFinite()); - assert(shifts.allFinite()); -#endif - - // Compute zhat - perturbCol0(col0, diag, perm, singVals, shifts, mus, zhat); -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << " zhat: " << zhat.transpose() << "\n"; -#endif - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(zhat.allFinite()); -#endif - - computeSingVecs(zhat, diag, perm, singVals, shifts, mus, U, V); - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "U^T U: " << (U.transpose() * U - MatrixXr(MatrixXr::Identity(U.cols(),U.cols()))).norm() << "\n"; - std::cout << "V^T V: " << (V.transpose() * V - MatrixXr(MatrixXr::Identity(V.cols(),V.cols()))).norm() << "\n"; -#endif - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(m_naiveU.allFinite()); - assert(m_naiveV.allFinite()); - assert(m_computed.allFinite()); - assert(U.allFinite()); - assert(V.allFinite()); -// assert((U.transpose() * U - MatrixXr(MatrixXr::Identity(U.cols(),U.cols()))).norm() < 100*NumTraits::epsilon() * n); -// assert((V.transpose() * V - MatrixXr(MatrixXr::Identity(V.cols(),V.cols()))).norm() < 100*NumTraits::epsilon() * n); -#endif - - // Because of deflation, the singular values might not be completely sorted. - // Fortunately, reordering them is a O(n) problem - for(Index i=0; isingVals(i+1)) - { - using std::swap; - swap(singVals(i),singVals(i+1)); - U.col(i).swap(U.col(i+1)); - if(m_compV) V.col(i).swap(V.col(i+1)); - } - } - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - { - bool singular_values_sorted = (((singVals.segment(1,actual_n-1)-singVals.head(actual_n-1))).array() >= 0).all(); - if(!singular_values_sorted) - std::cout << "Singular values are not sorted: " << singVals.segment(1,actual_n).transpose() << "\n"; - assert(singular_values_sorted); - } -#endif - - // Reverse order so that singular values in increased order - // Because of deflation, the zeros singular-values are already at the end - singVals.head(actual_n).reverseInPlace(); - U.leftCols(actual_n).rowwise().reverseInPlace(); - if (m_compV) V.leftCols(actual_n).rowwise().reverseInPlace(); - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - JacobiSVD jsvd(m_computed.block(firstCol, firstCol, n, n) ); - std::cout << " * j: " << jsvd.singularValues().transpose() << "\n\n"; - std::cout << " * sing-val: " << singVals.transpose() << "\n"; -// std::cout << " * err: " << ((jsvd.singularValues()-singVals)>1e-13*singVals.norm()).transpose() << "\n"; -#endif -} - -template -typename BDCSVD::RealScalar BDCSVD::secularEq(RealScalar mu, const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, const ArrayRef& diagShifted, RealScalar shift) -{ - Index m = perm.size(); - RealScalar res = Literal(1); - for(Index i=0; i -void BDCSVD::computeSingVals(const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, - VectorType& singVals, ArrayRef shifts, ArrayRef mus) -{ - using std::abs; - using std::swap; - using std::sqrt; - - Index n = col0.size(); - Index actual_n = n; - // Note that here actual_n is computed based on col0(i)==0 instead of diag(i)==0 as above - // because 1) we have diag(i)==0 => col0(i)==0 and 2) if col0(i)==0, then diag(i) is already a singular value. - while(actual_n>1 && col0(actual_n-1)==Literal(0)) --actual_n; - - for (Index k = 0; k < n; ++k) - { - if (col0(k) == Literal(0) || actual_n==1) - { - // if col0(k) == 0, then entry is deflated, so singular value is on diagonal - // if actual_n==1, then the deflated problem is already diagonalized - singVals(k) = k==0 ? col0(0) : diag(k); - mus(k) = Literal(0); - shifts(k) = k==0 ? col0(0) : diag(k); - continue; - } - - // otherwise, use secular equation to find singular value - RealScalar left = diag(k); - RealScalar right; // was: = (k != actual_n-1) ? diag(k+1) : (diag(actual_n-1) + col0.matrix().norm()); - if(k==actual_n-1) - right = (diag(actual_n-1) + col0.matrix().norm()); - else - { - // Skip deflated singular values, - // recall that at this stage we assume that z[j]!=0 and all entries for which z[j]==0 have been put aside. - // This should be equivalent to using perm[] - Index l = k+1; - while(col0(l)==Literal(0)) { ++l; eigen_internal_assert(l Literal(0)) ? left : right; - - // measure everything relative to shift - Map diagShifted(m_workspace.data()+4*n, n); - diagShifted = diag - shift; - - // initial guess - RealScalar muPrev, muCur; - if (shift == left) - { - muPrev = (right - left) * RealScalar(0.1); - if (k == actual_n-1) muCur = right - left; - else muCur = (right - left) * RealScalar(0.5); - } - else - { - muPrev = -(right - left) * RealScalar(0.1); - muCur = -(right - left) * RealScalar(0.5); - } - - RealScalar fPrev = secularEq(muPrev, col0, diag, perm, diagShifted, shift); - RealScalar fCur = secularEq(muCur, col0, diag, perm, diagShifted, shift); - if (abs(fPrev) < abs(fCur)) - { - swap(fPrev, fCur); - swap(muPrev, muCur); - } - - // rational interpolation: fit a function of the form a / mu + b through the two previous - // iterates and use its zero to compute the next iterate - bool useBisection = fPrev*fCur>Literal(0); - while (fCur!=Literal(0) && abs(muCur - muPrev) > Literal(8) * NumTraits::epsilon() * numext::maxi(abs(muCur), abs(muPrev)) && abs(fCur - fPrev)>NumTraits::epsilon() && !useBisection) - { - ++m_numIters; - - // Find a and b such that the function f(mu) = a / mu + b matches the current and previous samples. - RealScalar a = (fCur - fPrev) / (Literal(1)/muCur - Literal(1)/muPrev); - RealScalar b = fCur - a / muCur; - // And find mu such that f(mu)==0: - RealScalar muZero = -a/b; - RealScalar fZero = secularEq(muZero, col0, diag, perm, diagShifted, shift); - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert((std::isfinite)(fZero)); -#endif - - muPrev = muCur; - fPrev = fCur; - muCur = muZero; - fCur = fZero; - - if (shift == left && (muCur < Literal(0) || muCur > right - left)) useBisection = true; - if (shift == right && (muCur < -(right - left) || muCur > Literal(0))) useBisection = true; - if (abs(fCur)>abs(fPrev)) useBisection = true; - } - - // fall back on bisection method if rational interpolation did not work - if (useBisection) - { -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "useBisection for k = " << k << ", actual_n = " << actual_n << "\n"; -#endif - RealScalar leftShifted, rightShifted; - if (shift == left) - { - // to avoid overflow, we must have mu > max(real_min, |z(k)|/sqrt(real_max)), - // the factor 2 is to be more conservative - leftShifted = numext::maxi( (std::numeric_limits::min)(), Literal(2) * abs(col0(k)) / sqrt((std::numeric_limits::max)()) ); - - // check that we did it right: - eigen_internal_assert( (numext::isfinite)( (col0(k)/leftShifted)*(col0(k)/(diag(k)+shift+leftShifted)) ) ); - // I don't understand why the case k==0 would be special there: - // if (k == 0) rightShifted = right - left; else - rightShifted = (k==actual_n-1) ? right : ((right - left) * RealScalar(0.51)); // theoretically we can take 0.5, but let's be safe - } - else - { - leftShifted = -(right - left) * RealScalar(0.51); - if(k+1( (std::numeric_limits::min)(), abs(col0(k+1)) / sqrt((std::numeric_limits::max)()) ); - else - rightShifted = -(std::numeric_limits::min)(); - } - - RealScalar fLeft = secularEq(leftShifted, col0, diag, perm, diagShifted, shift); - -#if defined EIGEN_INTERNAL_DEBUGGING || defined EIGEN_BDCSVD_SANITY_CHECKS - RealScalar fRight = secularEq(rightShifted, col0, diag, perm, diagShifted, shift); -#endif - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - if(!(std::isfinite)(fLeft)) - std::cout << "f(" << leftShifted << ") =" << fLeft << " ; " << left << " " << shift << " " << right << "\n"; - assert((std::isfinite)(fLeft)); - - if(!(std::isfinite)(fRight)) - std::cout << "f(" << rightShifted << ") =" << fRight << " ; " << left << " " << shift << " " << right << "\n"; -// assert((std::isfinite)(fRight)); -#endif - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - if(!(fLeft * fRight<0)) - { - std::cout << "f(leftShifted) using leftShifted=" << leftShifted << " ; diagShifted(1:10):" << diagShifted.head(10).transpose() << "\n ; " - << "left==shift=" << bool(left==shift) << " ; left-shift = " << (left-shift) << "\n"; - std::cout << "k=" << k << ", " << fLeft << " * " << fRight << " == " << fLeft * fRight << " ; " - << "[" << left << " .. " << right << "] -> [" << leftShifted << " " << rightShifted << "], shift=" << shift << " , f(right)=" << secularEq(0, col0, diag, perm, diagShifted, shift) << " == " << secularEq(right, col0, diag, perm, diag, 0) << "\n"; - } -#endif - eigen_internal_assert(fLeft * fRight < Literal(0)); - - while (rightShifted - leftShifted > Literal(2) * NumTraits::epsilon() * numext::maxi(abs(leftShifted), abs(rightShifted))) - { - RealScalar midShifted = (leftShifted + rightShifted) / Literal(2); - fMid = secularEq(midShifted, col0, diag, perm, diagShifted, shift); - eigen_internal_assert((numext::isfinite)(fMid)); - - if (fLeft * fMid < Literal(0)) - { - rightShifted = midShifted; - } - else - { - leftShifted = midShifted; - fLeft = fMid; - } - } - - muCur = (leftShifted + rightShifted) / Literal(2); - } - - singVals[k] = shift + muCur; - shifts[k] = shift; - mus[k] = muCur; - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - if(k+1=singVals[k-1]); - assert(singVals[k]>=diag(k)); -#endif - - // perturb singular value slightly if it equals diagonal entry to avoid division by zero later - // (deflation is supposed to avoid this from happening) - // - this does no seem to be necessary anymore - -// if (singVals[k] == left) singVals[k] *= 1 + NumTraits::epsilon(); -// if (singVals[k] == right) singVals[k] *= 1 - NumTraits::epsilon(); - } -} - - -// zhat is perturbation of col0 for which singular vectors can be computed stably (see Section 3.1) -template -void BDCSVD::perturbCol0 - (const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, const VectorType& singVals, - const ArrayRef& shifts, const ArrayRef& mus, ArrayRef zhat) -{ - using std::sqrt; - Index n = col0.size(); - Index m = perm.size(); - if(m==0) - { - zhat.setZero(); - return; - } - Index last = perm(m-1); - // The offset permits to skip deflated entries while computing zhat - for (Index k = 0; k < n; ++k) - { - if (col0(k) == Literal(0)) // deflated - zhat(k) = Literal(0); - else - { - // see equation (3.6) - RealScalar dk = diag(k); - RealScalar prod = (singVals(last) + dk) * (mus(last) + (shifts(last) - dk)); -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - if(prod<0) { - std::cout << "k = " << k << " ; z(k)=" << col0(k) << ", diag(k)=" << dk << "\n"; - std::cout << "prod = " << "(" << singVals(last) << " + " << dk << ") * (" << mus(last) << " + (" << shifts(last) << " - " << dk << "))" << "\n"; - std::cout << " = " << singVals(last) + dk << " * " << mus(last) + (shifts(last) - dk) << "\n"; - } - assert(prod>=0); -#endif - - for(Index l = 0; l=k && (l==0 || l-1>=m)) - { - std::cout << "Error in perturbCol0\n"; - std::cout << " " << k << "/" << n << " " << l << "/" << m << " " << i << "/" << n << " ; " << col0(k) << " " << diag(k) << " " << "\n"; - std::cout << " " <=0); -#endif -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - if(i!=k && std::abs(((singVals(j)+dk)*(mus(j)+(shifts(j)-dk)))/((diag(i)+dk)*(diag(i)-dk)) - 1) > 0.9 ) - std::cout << " " << ((singVals(j)+dk)*(mus(j)+(shifts(j)-dk)))/((diag(i)+dk)*(diag(i)-dk)) << " == (" << (singVals(j)+dk) << " * " << (mus(j)+(shifts(j)-dk)) - << ") / (" << (diag(i)+dk) << " * " << (diag(i)-dk) << ")\n"; -#endif - } - } -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "zhat(" << k << ") = sqrt( " << prod << ") ; " << (singVals(last) + dk) << " * " << mus(last) + shifts(last) << " - " << dk << "\n"; -#endif - RealScalar tmp = sqrt(prod); -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert((std::isfinite)(tmp)); -#endif - zhat(k) = col0(k) > Literal(0) ? tmp : -tmp; - } - } -} - -// compute singular vectors -template -void BDCSVD::computeSingVecs - (const ArrayRef& zhat, const ArrayRef& diag, const IndicesRef &perm, const VectorType& singVals, - const ArrayRef& shifts, const ArrayRef& mus, MatrixXr& U, MatrixXr& V) -{ - Index n = zhat.size(); - Index m = perm.size(); - - for (Index k = 0; k < n; ++k) - { - if (zhat(k) == Literal(0)) - { - U.col(k) = VectorType::Unit(n+1, k); - if (m_compV) V.col(k) = VectorType::Unit(n, k); - } - else - { - U.col(k).setZero(); - for(Index l=0;l= 1, di almost null and zi non null. -// We use a rotation to zero out zi applied to the left of M -template -void BDCSVD::deflation43(Eigen::Index firstCol, Eigen::Index shift, Eigen::Index i, Eigen::Index size) -{ - using std::abs; - using std::sqrt; - using std::pow; - Index start = firstCol + shift; - RealScalar c = m_computed(start, start); - RealScalar s = m_computed(start+i, start); - RealScalar r = numext::hypot(c,s); - if (r == Literal(0)) - { - m_computed(start+i, start+i) = Literal(0); - return; - } - m_computed(start,start) = r; - m_computed(start+i, start) = Literal(0); - m_computed(start+i, start+i) = Literal(0); - - JacobiRotation J(c/r,-s/r); - if (m_compU) m_naiveU.middleRows(firstCol, size+1).applyOnTheRight(firstCol, firstCol+i, J); - else m_naiveU.applyOnTheRight(firstCol, firstCol+i, J); -}// end deflation 43 - - -// page 13 -// i,j >= 1, i!=j and |di - dj| < epsilon * norm2(M) -// We apply two rotations to have zj = 0; -// TODO deflation44 is still broken and not properly tested -template -void BDCSVD::deflation44(Eigen::Index firstColu , Eigen::Index firstColm, Eigen::Index firstRowW, Eigen::Index firstColW, Eigen::Index i, Eigen::Index j, Eigen::Index size) -{ - using std::abs; - using std::sqrt; - using std::conj; - using std::pow; - RealScalar c = m_computed(firstColm+i, firstColm); - RealScalar s = m_computed(firstColm+j, firstColm); - RealScalar r = sqrt(numext::abs2(c) + numext::abs2(s)); -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "deflation 4.4: " << i << "," << j << " -> " << c << " " << s << " " << r << " ; " - << m_computed(firstColm + i-1, firstColm) << " " - << m_computed(firstColm + i, firstColm) << " " - << m_computed(firstColm + i+1, firstColm) << " " - << m_computed(firstColm + i+2, firstColm) << "\n"; - std::cout << m_computed(firstColm + i-1, firstColm + i-1) << " " - << m_computed(firstColm + i, firstColm+i) << " " - << m_computed(firstColm + i+1, firstColm+i+1) << " " - << m_computed(firstColm + i+2, firstColm+i+2) << "\n"; -#endif - if (r==Literal(0)) - { - m_computed(firstColm + i, firstColm + i) = m_computed(firstColm + j, firstColm + j); - return; - } - c/=r; - s/=r; - m_computed(firstColm + i, firstColm) = r; - m_computed(firstColm + j, firstColm + j) = m_computed(firstColm + i, firstColm + i); - m_computed(firstColm + j, firstColm) = Literal(0); - - JacobiRotation J(c,-s); - if (m_compU) m_naiveU.middleRows(firstColu, size+1).applyOnTheRight(firstColu + i, firstColu + j, J); - else m_naiveU.applyOnTheRight(firstColu+i, firstColu+j, J); - if (m_compV) m_naiveV.middleRows(firstRowW, size).applyOnTheRight(firstColW + i, firstColW + j, J); -}// end deflation 44 - - -// acts on block from (firstCol+shift, firstCol+shift) to (lastCol+shift, lastCol+shift) [inclusive] -template -void BDCSVD::deflation(Eigen::Index firstCol, Eigen::Index lastCol, Eigen::Index k, Eigen::Index firstRowW, Eigen::Index firstColW, Eigen::Index shift) -{ - using std::sqrt; - using std::abs; - const Index length = lastCol + 1 - firstCol; - - Block col0(m_computed, firstCol+shift, firstCol+shift, length, 1); - Diagonal fulldiag(m_computed); - VectorBlock,Dynamic> diag(fulldiag, firstCol+shift, length); - - const RealScalar considerZero = (std::numeric_limits::min)(); - RealScalar maxDiag = diag.tail((std::max)(Index(1),length-1)).cwiseAbs().maxCoeff(); - RealScalar epsilon_strict = numext::maxi(considerZero,NumTraits::epsilon() * maxDiag); - RealScalar epsilon_coarse = Literal(8) * NumTraits::epsilon() * numext::maxi(col0.cwiseAbs().maxCoeff(), maxDiag); - -#ifdef EIGEN_BDCSVD_SANITY_CHECKS - assert(m_naiveU.allFinite()); - assert(m_naiveV.allFinite()); - assert(m_computed.allFinite()); -#endif - -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "\ndeflate:" << diag.head(k+1).transpose() << " | " << diag.segment(k+1,length-k-1).transpose() << "\n"; -#endif - - //condition 4.1 - if (diag(0) < epsilon_coarse) - { -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "deflation 4.1, because " << diag(0) << " < " << epsilon_coarse << "\n"; -#endif - diag(0) = epsilon_coarse; - } - - //condition 4.2 - for (Index i=1;i k) permutation[p] = j++; - else if (j >= length) permutation[p] = i++; - else if (diag(i) < diag(j)) permutation[p] = j++; - else permutation[p] = i++; - } - } - - // If we have a total deflation, then we have to insert diag(0) at the right place - if(total_deflation) - { - for(Index i=1; i0 && (abs(diag(i))1;--i) - if( (diag(i) - diag(i-1)) < NumTraits::epsilon()*maxDiag ) - { -#ifdef EIGEN_BDCSVD_DEBUG_VERBOSE - std::cout << "deflation 4.4 with i = " << i << " because " << diag(i) << " - " << diag(i-1) << " == " << (diag(i) - diag(i-1)) << " < " << NumTraits::epsilon()*/*diag(i)*/maxDiag << "\n"; -#endif - eigen_internal_assert(abs(diag(i) - diag(i-1)) -BDCSVD::PlainObject> -MatrixBase::bdcSvd(unsigned int computationOptions) const -{ - return BDCSVD(*this, computationOptions); -} -#endif - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/SVD/JacobiSVD.h b/Eigen/src/SVD/JacobiSVD.h deleted file mode 100644 index 1c7c80376..000000000 --- a/Eigen/src/SVD/JacobiSVD.h +++ /dev/null @@ -1,804 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2010 Benoit Jacob -// Copyright (C) 2013-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_JACOBISVD_H -#define EIGEN_JACOBISVD_H - -namespace Eigen { - -namespace internal { -// forward declaration (needed by ICC) -// the empty body is required by MSVC -template::IsComplex> -struct svd_precondition_2x2_block_to_be_real {}; - -/*** QR preconditioners (R-SVD) - *** - *** Their role is to reduce the problem of computing the SVD to the case of a square matrix. - *** This approach, known as R-SVD, is an optimization for rectangular-enough matrices, and is a requirement for - *** JacobiSVD which by itself is only able to work on square matrices. - ***/ - -enum { PreconditionIfMoreColsThanRows, PreconditionIfMoreRowsThanCols }; - -template -struct qr_preconditioner_should_do_anything -{ - enum { a = MatrixType::RowsAtCompileTime != Dynamic && - MatrixType::ColsAtCompileTime != Dynamic && - MatrixType::ColsAtCompileTime <= MatrixType::RowsAtCompileTime, - b = MatrixType::RowsAtCompileTime != Dynamic && - MatrixType::ColsAtCompileTime != Dynamic && - MatrixType::RowsAtCompileTime <= MatrixType::ColsAtCompileTime, - ret = !( (QRPreconditioner == NoQRPreconditioner) || - (Case == PreconditionIfMoreColsThanRows && bool(a)) || - (Case == PreconditionIfMoreRowsThanCols && bool(b)) ) - }; -}; - -template::ret -> struct qr_preconditioner_impl {}; - -template -class qr_preconditioner_impl -{ -public: - void allocate(const JacobiSVD&) {} - bool run(JacobiSVD&, const MatrixType&) - { - return false; - } -}; - -/*** preconditioner using FullPivHouseholderQR ***/ - -template -class qr_preconditioner_impl -{ -public: - typedef typename MatrixType::Scalar Scalar; - enum - { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime - }; - typedef Matrix WorkspaceType; - - void allocate(const JacobiSVD& svd) - { - if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) - { - m_qr.~QRType(); - ::new (&m_qr) QRType(svd.rows(), svd.cols()); - } - if (svd.m_computeFullU) m_workspace.resize(svd.rows()); - } - - bool run(JacobiSVD& svd, const MatrixType& matrix) - { - if(matrix.rows() > matrix.cols()) - { - m_qr.compute(matrix); - svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView(); - if(svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace); - if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation(); - return true; - } - return false; - } -private: - typedef FullPivHouseholderQR QRType; - QRType m_qr; - WorkspaceType m_workspace; -}; - -template -class qr_preconditioner_impl -{ -public: - typedef typename MatrixType::Scalar Scalar; - enum - { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, - TrOptions = RowsAtCompileTime==1 ? (MatrixType::Options & ~(RowMajor)) - : ColsAtCompileTime==1 ? (MatrixType::Options | RowMajor) - : MatrixType::Options - }; - typedef Matrix - TransposeTypeWithSameStorageOrder; - - void allocate(const JacobiSVD& svd) - { - if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) - { - m_qr.~QRType(); - ::new (&m_qr) QRType(svd.cols(), svd.rows()); - } - m_adjoint.resize(svd.cols(), svd.rows()); - if (svd.m_computeFullV) m_workspace.resize(svd.cols()); - } - - bool run(JacobiSVD& svd, const MatrixType& matrix) - { - if(matrix.cols() > matrix.rows()) - { - m_adjoint = matrix.adjoint(); - m_qr.compute(m_adjoint); - svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView().adjoint(); - if(svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace); - if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); - return true; - } - else return false; - } -private: - typedef FullPivHouseholderQR QRType; - QRType m_qr; - TransposeTypeWithSameStorageOrder m_adjoint; - typename internal::plain_row_type::type m_workspace; -}; - -/*** preconditioner using ColPivHouseholderQR ***/ - -template -class qr_preconditioner_impl -{ -public: - void allocate(const JacobiSVD& svd) - { - if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) - { - m_qr.~QRType(); - ::new (&m_qr) QRType(svd.rows(), svd.cols()); - } - if (svd.m_computeFullU) m_workspace.resize(svd.rows()); - else if (svd.m_computeThinU) m_workspace.resize(svd.cols()); - } - - bool run(JacobiSVD& svd, const MatrixType& matrix) - { - if(matrix.rows() > matrix.cols()) - { - m_qr.compute(matrix); - svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView(); - if(svd.m_computeFullU) m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace); - else if(svd.m_computeThinU) - { - svd.m_matrixU.setIdentity(matrix.rows(), matrix.cols()); - m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixU, m_workspace); - } - if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation(); - return true; - } - return false; - } - -private: - typedef ColPivHouseholderQR QRType; - QRType m_qr; - typename internal::plain_col_type::type m_workspace; -}; - -template -class qr_preconditioner_impl -{ -public: - typedef typename MatrixType::Scalar Scalar; - enum - { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, - TrOptions = RowsAtCompileTime==1 ? (MatrixType::Options & ~(RowMajor)) - : ColsAtCompileTime==1 ? (MatrixType::Options | RowMajor) - : MatrixType::Options - }; - - typedef Matrix - TransposeTypeWithSameStorageOrder; - - void allocate(const JacobiSVD& svd) - { - if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) - { - m_qr.~QRType(); - ::new (&m_qr) QRType(svd.cols(), svd.rows()); - } - if (svd.m_computeFullV) m_workspace.resize(svd.cols()); - else if (svd.m_computeThinV) m_workspace.resize(svd.rows()); - m_adjoint.resize(svd.cols(), svd.rows()); - } - - bool run(JacobiSVD& svd, const MatrixType& matrix) - { - if(matrix.cols() > matrix.rows()) - { - m_adjoint = matrix.adjoint(); - m_qr.compute(m_adjoint); - - svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView().adjoint(); - if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace); - else if(svd.m_computeThinV) - { - svd.m_matrixV.setIdentity(matrix.cols(), matrix.rows()); - m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace); - } - if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); - return true; - } - else return false; - } - -private: - typedef ColPivHouseholderQR QRType; - QRType m_qr; - TransposeTypeWithSameStorageOrder m_adjoint; - typename internal::plain_row_type::type m_workspace; -}; - -/*** preconditioner using HouseholderQR ***/ - -template -class qr_preconditioner_impl -{ -public: - void allocate(const JacobiSVD& svd) - { - if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) - { - m_qr.~QRType(); - ::new (&m_qr) QRType(svd.rows(), svd.cols()); - } - if (svd.m_computeFullU) m_workspace.resize(svd.rows()); - else if (svd.m_computeThinU) m_workspace.resize(svd.cols()); - } - - bool run(JacobiSVD& svd, const MatrixType& matrix) - { - if(matrix.rows() > matrix.cols()) - { - m_qr.compute(matrix); - svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView(); - if(svd.m_computeFullU) m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace); - else if(svd.m_computeThinU) - { - svd.m_matrixU.setIdentity(matrix.rows(), matrix.cols()); - m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixU, m_workspace); - } - if(svd.computeV()) svd.m_matrixV.setIdentity(matrix.cols(), matrix.cols()); - return true; - } - return false; - } -private: - typedef HouseholderQR QRType; - QRType m_qr; - typename internal::plain_col_type::type m_workspace; -}; - -template -class qr_preconditioner_impl -{ -public: - typedef typename MatrixType::Scalar Scalar; - enum - { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, - Options = MatrixType::Options - }; - - typedef Matrix - TransposeTypeWithSameStorageOrder; - - void allocate(const JacobiSVD& svd) - { - if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) - { - m_qr.~QRType(); - ::new (&m_qr) QRType(svd.cols(), svd.rows()); - } - if (svd.m_computeFullV) m_workspace.resize(svd.cols()); - else if (svd.m_computeThinV) m_workspace.resize(svd.rows()); - m_adjoint.resize(svd.cols(), svd.rows()); - } - - bool run(JacobiSVD& svd, const MatrixType& matrix) - { - if(matrix.cols() > matrix.rows()) - { - m_adjoint = matrix.adjoint(); - m_qr.compute(m_adjoint); - - svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView().adjoint(); - if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace); - else if(svd.m_computeThinV) - { - svd.m_matrixV.setIdentity(matrix.cols(), matrix.rows()); - m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace); - } - if(svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows()); - return true; - } - else return false; - } - -private: - typedef HouseholderQR QRType; - QRType m_qr; - TransposeTypeWithSameStorageOrder m_adjoint; - typename internal::plain_row_type::type m_workspace; -}; - -/*** 2x2 SVD implementation - *** - *** JacobiSVD consists in performing a series of 2x2 SVD subproblems - ***/ - -template -struct svd_precondition_2x2_block_to_be_real -{ - typedef JacobiSVD SVD; - typedef typename MatrixType::RealScalar RealScalar; - static bool run(typename SVD::WorkMatrixType&, SVD&, Index, Index, RealScalar&) { return true; } -}; - -template -struct svd_precondition_2x2_block_to_be_real -{ - typedef JacobiSVD SVD; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - static bool run(typename SVD::WorkMatrixType& work_matrix, SVD& svd, Index p, Index q, RealScalar& maxDiagEntry) - { - using std::sqrt; - using std::abs; - Scalar z; - JacobiRotation rot; - RealScalar n = sqrt(numext::abs2(work_matrix.coeff(p,p)) + numext::abs2(work_matrix.coeff(q,p))); - - const RealScalar considerAsZero = (std::numeric_limits::min)(); - const RealScalar precision = NumTraits::epsilon(); - - if(n==0) - { - // make sure first column is zero - work_matrix.coeffRef(p,p) = work_matrix.coeffRef(q,p) = Scalar(0); - - if(abs(numext::imag(work_matrix.coeff(p,q)))>considerAsZero) - { - // work_matrix.coeff(p,q) can be zero if work_matrix.coeff(q,p) is not zero but small enough to underflow when computing n - z = abs(work_matrix.coeff(p,q)) / work_matrix.coeff(p,q); - work_matrix.row(p) *= z; - if(svd.computeU()) svd.m_matrixU.col(p) *= conj(z); - } - if(abs(numext::imag(work_matrix.coeff(q,q)))>considerAsZero) - { - z = abs(work_matrix.coeff(q,q)) / work_matrix.coeff(q,q); - work_matrix.row(q) *= z; - if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); - } - // otherwise the second row is already zero, so we have nothing to do. - } - else - { - rot.c() = conj(work_matrix.coeff(p,p)) / n; - rot.s() = work_matrix.coeff(q,p) / n; - work_matrix.applyOnTheLeft(p,q,rot); - if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint()); - if(abs(numext::imag(work_matrix.coeff(p,q)))>considerAsZero) - { - z = abs(work_matrix.coeff(p,q)) / work_matrix.coeff(p,q); - work_matrix.col(q) *= z; - if(svd.computeV()) svd.m_matrixV.col(q) *= z; - } - if(abs(numext::imag(work_matrix.coeff(q,q)))>considerAsZero) - { - z = abs(work_matrix.coeff(q,q)) / work_matrix.coeff(q,q); - work_matrix.row(q) *= z; - if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); - } - } - - // update largest diagonal entry - maxDiagEntry = numext::maxi(maxDiagEntry,numext::maxi(abs(work_matrix.coeff(p,p)), abs(work_matrix.coeff(q,q)))); - // and check whether the 2x2 block is already diagonal - RealScalar threshold = numext::maxi(considerAsZero, precision * maxDiagEntry); - return abs(work_matrix.coeff(p,q))>threshold || abs(work_matrix.coeff(q,p)) > threshold; - } -}; - -template -struct traits > -{ - typedef _MatrixType MatrixType; -}; - -} // end namespace internal - -/** \ingroup SVD_Module - * - * - * \class JacobiSVD - * - * \brief Two-sided Jacobi SVD decomposition of a rectangular matrix - * - * \tparam _MatrixType the type of the matrix of which we are computing the SVD decomposition - * \tparam QRPreconditioner this optional parameter allows to specify the type of QR decomposition that will be used internally - * for the R-SVD step for non-square matrices. See discussion of possible values below. - * - * SVD decomposition consists in decomposing any n-by-p matrix \a A as a product - * \f[ A = U S V^* \f] - * where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal; - * the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left - * and right \em singular \em vectors of \a A respectively. - * - * Singular values are always sorted in decreasing order. - * - * This JacobiSVD decomposition computes only the singular values by default. If you want \a U or \a V, you need to ask for them explicitly. - * - * You can ask for only \em thin \a U or \a V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting \a m be the - * smaller value among \a n and \a p, there are only \a m singular vectors; the remaining columns of \a U and \a V do not correspond to actual - * singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix, - * and \a V is then a p-by-m matrix. Notice that thin \a U and \a V are all you need for (least squares) solving. - * - * Here's an example demonstrating basic usage: - * \include JacobiSVD_basic.cpp - * Output: \verbinclude JacobiSVD_basic.out - * - * This JacobiSVD class is a two-sided Jacobi R-SVD decomposition, ensuring optimal reliability and accuracy. The downside is that it's slower than - * bidiagonalizing SVD algorithms for large square matrices; however its complexity is still \f$ O(n^2p) \f$ where \a n is the smaller dimension and - * \a p is the greater dimension, meaning that it is still of the same order of complexity as the faster bidiagonalizing R-SVD algorithms. - * In particular, like any R-SVD, it takes advantage of non-squareness in that its complexity is only linear in the greater dimension. - * - * If the input matrix has inf or nan coefficients, the result of the computation is undefined, but the computation is guaranteed to - * terminate in finite (and reasonable) time. - * - * The possible values for QRPreconditioner are: - * \li ColPivHouseholderQRPreconditioner is the default. In practice it's very safe. It uses column-pivoting QR. - * \li FullPivHouseholderQRPreconditioner, is the safest and slowest. It uses full-pivoting QR. - * Contrary to other QRs, it doesn't allow computing thin unitaries. - * \li HouseholderQRPreconditioner is the fastest, and less safe and accurate than the pivoting variants. It uses non-pivoting QR. - * This is very similar in safety and accuracy to the bidiagonalization process used by bidiagonalizing SVD algorithms (since bidiagonalization - * is inherently non-pivoting). However the resulting SVD is still more reliable than bidiagonalizing SVDs because the Jacobi-based iterarive - * process is more reliable than the optimized bidiagonal SVD iterations. - * \li NoQRPreconditioner allows not to use a QR preconditioner at all. This is useful if you know that you will only be computing - * JacobiSVD decompositions of square matrices. Non-square matrices require a QR preconditioner. Using this option will result in - * faster compilation and smaller executable code. It won't significantly speed up computation, since JacobiSVD is always checking - * if QR preconditioning is needed before applying it anyway. - * - * \sa MatrixBase::jacobiSvd() - */ -template class JacobiSVD - : public SVDBase > -{ - typedef SVDBase Base; - public: - - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - DiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime,ColsAtCompileTime), - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, - MaxDiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(MaxRowsAtCompileTime,MaxColsAtCompileTime), - MatrixOptions = MatrixType::Options - }; - - typedef typename Base::MatrixUType MatrixUType; - typedef typename Base::MatrixVType MatrixVType; - typedef typename Base::SingularValuesType SingularValuesType; - - typedef typename internal::plain_row_type::type RowType; - typedef typename internal::plain_col_type::type ColType; - typedef Matrix - WorkMatrixType; - - /** \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via JacobiSVD::compute(const MatrixType&). - */ - JacobiSVD() - {} - - - /** \brief Default Constructor with memory preallocation - * - * Like the default constructor but with preallocation of the internal data - * according to the specified problem size. - * \sa JacobiSVD() - */ - JacobiSVD(Index rows, Index cols, unsigned int computationOptions = 0) - { - allocate(rows, cols, computationOptions); - } - - /** \brief Constructor performing the decomposition of given matrix. - * - * \param matrix the matrix to decompose - * \param computationOptions optional parameter allowing to specify if you want full or thin U or V unitaries to be computed. - * By default, none is computed. This is a bit-field, the possible bits are #ComputeFullU, #ComputeThinU, - * #ComputeFullV, #ComputeThinV. - * - * Thin unitaries are only available if your matrix type has a Dynamic number of columns (for example MatrixXf). They also are not - * available with the (non-default) FullPivHouseholderQR preconditioner. - */ - explicit JacobiSVD(const MatrixType& matrix, unsigned int computationOptions = 0) - { - compute(matrix, computationOptions); - } - - /** \brief Method performing the decomposition of given matrix using custom options. - * - * \param matrix the matrix to decompose - * \param computationOptions optional parameter allowing to specify if you want full or thin U or V unitaries to be computed. - * By default, none is computed. This is a bit-field, the possible bits are #ComputeFullU, #ComputeThinU, - * #ComputeFullV, #ComputeThinV. - * - * Thin unitaries are only available if your matrix type has a Dynamic number of columns (for example MatrixXf). They also are not - * available with the (non-default) FullPivHouseholderQR preconditioner. - */ - JacobiSVD& compute(const MatrixType& matrix, unsigned int computationOptions); - - /** \brief Method performing the decomposition of given matrix using current options. - * - * \param matrix the matrix to decompose - * - * This method uses the current \a computationOptions, as already passed to the constructor or to compute(const MatrixType&, unsigned int). - */ - JacobiSVD& compute(const MatrixType& matrix) - { - return compute(matrix, m_computationOptions); - } - - using Base::computeU; - using Base::computeV; - using Base::rows; - using Base::cols; - using Base::rank; - - private: - void allocate(Index rows, Index cols, unsigned int computationOptions); - - protected: - using Base::m_matrixU; - using Base::m_matrixV; - using Base::m_singularValues; - using Base::m_isInitialized; - using Base::m_isAllocated; - using Base::m_usePrescribedThreshold; - using Base::m_computeFullU; - using Base::m_computeThinU; - using Base::m_computeFullV; - using Base::m_computeThinV; - using Base::m_computationOptions; - using Base::m_nonzeroSingularValues; - using Base::m_rows; - using Base::m_cols; - using Base::m_diagSize; - using Base::m_prescribedThreshold; - WorkMatrixType m_workMatrix; - - template - friend struct internal::svd_precondition_2x2_block_to_be_real; - template - friend struct internal::qr_preconditioner_impl; - - internal::qr_preconditioner_impl m_qr_precond_morecols; - internal::qr_preconditioner_impl m_qr_precond_morerows; - MatrixType m_scaledMatrix; -}; - -template -void JacobiSVD::allocate(Eigen::Index rows, Eigen::Index cols, unsigned int computationOptions) -{ - eigen_assert(rows >= 0 && cols >= 0); - - if (m_isAllocated && - rows == m_rows && - cols == m_cols && - computationOptions == m_computationOptions) - { - return; - } - - m_rows = rows; - m_cols = cols; - m_isInitialized = false; - m_isAllocated = true; - m_computationOptions = computationOptions; - m_computeFullU = (computationOptions & ComputeFullU) != 0; - m_computeThinU = (computationOptions & ComputeThinU) != 0; - m_computeFullV = (computationOptions & ComputeFullV) != 0; - m_computeThinV = (computationOptions & ComputeThinV) != 0; - eigen_assert(!(m_computeFullU && m_computeThinU) && "JacobiSVD: you can't ask for both full and thin U"); - eigen_assert(!(m_computeFullV && m_computeThinV) && "JacobiSVD: you can't ask for both full and thin V"); - eigen_assert(EIGEN_IMPLIES(m_computeThinU || m_computeThinV, MatrixType::ColsAtCompileTime==Dynamic) && - "JacobiSVD: thin U and V are only available when your matrix has a dynamic number of columns."); - if (QRPreconditioner == FullPivHouseholderQRPreconditioner) - { - eigen_assert(!(m_computeThinU || m_computeThinV) && - "JacobiSVD: can't compute thin U or thin V with the FullPivHouseholderQR preconditioner. " - "Use the ColPivHouseholderQR preconditioner instead."); - } - m_diagSize = (std::min)(m_rows, m_cols); - m_singularValues.resize(m_diagSize); - if(RowsAtCompileTime==Dynamic) - m_matrixU.resize(m_rows, m_computeFullU ? m_rows - : m_computeThinU ? m_diagSize - : 0); - if(ColsAtCompileTime==Dynamic) - m_matrixV.resize(m_cols, m_computeFullV ? m_cols - : m_computeThinV ? m_diagSize - : 0); - m_workMatrix.resize(m_diagSize, m_diagSize); - - if(m_cols>m_rows) m_qr_precond_morecols.allocate(*this); - if(m_rows>m_cols) m_qr_precond_morerows.allocate(*this); - if(m_rows!=m_cols) m_scaledMatrix.resize(rows,cols); -} - -template -JacobiSVD& -JacobiSVD::compute(const MatrixType& matrix, unsigned int computationOptions) -{ - using std::abs; - allocate(matrix.rows(), matrix.cols(), computationOptions); - - // currently we stop when we reach precision 2*epsilon as the last bit of precision can require an unreasonable number of iterations, - // only worsening the precision of U and V as we accumulate more rotations - const RealScalar precision = RealScalar(2) * NumTraits::epsilon(); - - // limit for denormal numbers to be considered zero in order to avoid infinite loops (see bug 286) - const RealScalar considerAsZero = (std::numeric_limits::min)(); - - // Scaling factor to reduce over/under-flows - RealScalar scale = matrix.cwiseAbs().maxCoeff(); - if(scale==RealScalar(0)) scale = RealScalar(1); - - /*** step 1. The R-SVD step: we use a QR decomposition to reduce to the case of a square matrix */ - - if(m_rows!=m_cols) - { - m_scaledMatrix = matrix / scale; - m_qr_precond_morecols.run(*this, m_scaledMatrix); - m_qr_precond_morerows.run(*this, m_scaledMatrix); - } - else - { - m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale; - if(m_computeFullU) m_matrixU.setIdentity(m_rows,m_rows); - if(m_computeThinU) m_matrixU.setIdentity(m_rows,m_diagSize); - if(m_computeFullV) m_matrixV.setIdentity(m_cols,m_cols); - if(m_computeThinV) m_matrixV.setIdentity(m_cols, m_diagSize); - } - - /*** step 2. The main Jacobi SVD iteration. ***/ - RealScalar maxDiagEntry = m_workMatrix.cwiseAbs().diagonal().maxCoeff(); - - bool finished = false; - while(!finished) - { - finished = true; - - // do a sweep: for all index pairs (p,q), perform SVD of the corresponding 2x2 sub-matrix - - for(Index p = 1; p < m_diagSize; ++p) - { - for(Index q = 0; q < p; ++q) - { - // if this 2x2 sub-matrix is not diagonal already... - // notice that this comparison will evaluate to false if any NaN is involved, ensuring that NaN's don't - // keep us iterating forever. Similarly, small denormal numbers are considered zero. - RealScalar threshold = numext::maxi(considerAsZero, precision * maxDiagEntry); - if(abs(m_workMatrix.coeff(p,q))>threshold || abs(m_workMatrix.coeff(q,p)) > threshold) - { - finished = false; - // perform SVD decomposition of 2x2 sub-matrix corresponding to indices p,q to make it diagonal - // the complex to real operation returns true if the updated 2x2 block is not already diagonal - if(internal::svd_precondition_2x2_block_to_be_real::run(m_workMatrix, *this, p, q, maxDiagEntry)) - { - JacobiRotation j_left, j_right; - internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right); - - // accumulate resulting Jacobi rotations - m_workMatrix.applyOnTheLeft(p,q,j_left); - if(computeU()) m_matrixU.applyOnTheRight(p,q,j_left.transpose()); - - m_workMatrix.applyOnTheRight(p,q,j_right); - if(computeV()) m_matrixV.applyOnTheRight(p,q,j_right); - - // keep track of the largest diagonal coefficient - maxDiagEntry = numext::maxi(maxDiagEntry,numext::maxi(abs(m_workMatrix.coeff(p,p)), abs(m_workMatrix.coeff(q,q)))); - } - } - } - } - } - - /*** step 3. The work matrix is now diagonal, so ensure it's positive so its diagonal entries are the singular values ***/ - - for(Index i = 0; i < m_diagSize; ++i) - { - // For a complex matrix, some diagonal coefficients might note have been - // treated by svd_precondition_2x2_block_to_be_real, and the imaginary part - // of some diagonal entry might not be null. - if(NumTraits::IsComplex && abs(numext::imag(m_workMatrix.coeff(i,i)))>considerAsZero) - { - RealScalar a = abs(m_workMatrix.coeff(i,i)); - m_singularValues.coeffRef(i) = abs(a); - if(computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i,i)/a; - } - else - { - // m_workMatrix.coeff(i,i) is already real, no difficulty: - RealScalar a = numext::real(m_workMatrix.coeff(i,i)); - m_singularValues.coeffRef(i) = abs(a); - if(computeU() && (a -JacobiSVD::PlainObject> -MatrixBase::jacobiSvd(unsigned int computationOptions) const -{ - return JacobiSVD(*this, computationOptions); -} - -} // end namespace Eigen - -#endif // EIGEN_JACOBISVD_H diff --git a/Eigen/src/SVD/JacobiSVD_LAPACKE.h b/Eigen/src/SVD/JacobiSVD_LAPACKE.h deleted file mode 100644 index ff0516f61..000000000 --- a/Eigen/src/SVD/JacobiSVD_LAPACKE.h +++ /dev/null @@ -1,91 +0,0 @@ -/* - Copyright (c) 2011, Intel Corporation. All rights reserved. - - Redistribution and use in source and binary forms, with or without modification, - are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, this - list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright notice, - this list of conditions and the following disclaimer in the documentation - and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors may - be used to endorse or promote products derived from this software without - specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND - ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE - DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR - ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES - (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; - LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON - ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT - (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - - ******************************************************************************** - * Content : Eigen bindings to LAPACKe - * Singular Value Decomposition - SVD. - ******************************************************************************** -*/ - -#ifndef EIGEN_JACOBISVD_LAPACKE_H -#define EIGEN_JACOBISVD_LAPACKE_H - -namespace Eigen { - -/** \internal Specialization for the data types supported by LAPACKe */ - -#define EIGEN_LAPACKE_SVD(EIGTYPE, LAPACKE_TYPE, LAPACKE_RTYPE, LAPACKE_PREFIX, EIGCOLROW, LAPACKE_COLROW) \ -template<> inline \ -JacobiSVD, ColPivHouseholderQRPreconditioner>& \ -JacobiSVD, ColPivHouseholderQRPreconditioner>::compute(const Matrix& matrix, unsigned int computationOptions) \ -{ \ - typedef Matrix MatrixType; \ - /*typedef MatrixType::Scalar Scalar;*/ \ - /*typedef MatrixType::RealScalar RealScalar;*/ \ - allocate(matrix.rows(), matrix.cols(), computationOptions); \ -\ - /*const RealScalar precision = RealScalar(2) * NumTraits::epsilon();*/ \ - m_nonzeroSingularValues = m_diagSize; \ -\ - lapack_int lda = internal::convert_index(matrix.outerStride()), ldu, ldvt; \ - lapack_int matrix_order = LAPACKE_COLROW; \ - char jobu, jobvt; \ - LAPACKE_TYPE *u, *vt, dummy; \ - jobu = (m_computeFullU) ? 'A' : (m_computeThinU) ? 'S' : 'N'; \ - jobvt = (m_computeFullV) ? 'A' : (m_computeThinV) ? 'S' : 'N'; \ - if (computeU()) { \ - ldu = internal::convert_index(m_matrixU.outerStride()); \ - u = (LAPACKE_TYPE*)m_matrixU.data(); \ - } else { ldu=1; u=&dummy; }\ - MatrixType localV; \ - lapack_int vt_rows = (m_computeFullV) ? internal::convert_index(m_cols) : (m_computeThinV) ? internal::convert_index(m_diagSize) : 1; \ - if (computeV()) { \ - localV.resize(vt_rows, m_cols); \ - ldvt = internal::convert_index(localV.outerStride()); \ - vt = (LAPACKE_TYPE*)localV.data(); \ - } else { ldvt=1; vt=&dummy; }\ - Matrix superb; superb.resize(m_diagSize, 1); \ - MatrixType m_temp; m_temp = matrix; \ - LAPACKE_##LAPACKE_PREFIX##gesvd( matrix_order, jobu, jobvt, internal::convert_index(m_rows), internal::convert_index(m_cols), (LAPACKE_TYPE*)m_temp.data(), lda, (LAPACKE_RTYPE*)m_singularValues.data(), u, ldu, vt, ldvt, superb.data()); \ - if (computeV()) m_matrixV = localV.adjoint(); \ - /* for(int i=0;i -// Copyright (C) 2014 Gael Guennebaud -// -// Copyright (C) 2013 Gauthier Brun -// Copyright (C) 2013 Nicolas Carre -// Copyright (C) 2013 Jean Ceccato -// Copyright (C) 2013 Pierre Zoppitelli -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SVDBASE_H -#define EIGEN_SVDBASE_H - -namespace Eigen { -/** \ingroup SVD_Module - * - * - * \class SVDBase - * - * \brief Base class of SVD algorithms - * - * \tparam Derived the type of the actual SVD decomposition - * - * SVD decomposition consists in decomposing any n-by-p matrix \a A as a product - * \f[ A = U S V^* \f] - * where \a U is a n-by-n unitary, \a V is a p-by-p unitary, and \a S is a n-by-p real positive matrix which is zero outside of its main diagonal; - * the diagonal entries of S are known as the \em singular \em values of \a A and the columns of \a U and \a V are known as the left - * and right \em singular \em vectors of \a A respectively. - * - * Singular values are always sorted in decreasing order. - * - * - * You can ask for only \em thin \a U or \a V to be computed, meaning the following. In case of a rectangular n-by-p matrix, letting \a m be the - * smaller value among \a n and \a p, there are only \a m singular vectors; the remaining columns of \a U and \a V do not correspond to actual - * singular vectors. Asking for \em thin \a U or \a V means asking for only their \a m first columns to be formed. So \a U is then a n-by-m matrix, - * and \a V is then a p-by-m matrix. Notice that thin \a U and \a V are all you need for (least squares) solving. - * - * If the input matrix has inf or nan coefficients, the result of the computation is undefined, but the computation is guaranteed to - * terminate in finite (and reasonable) time. - * \sa class BDCSVD, class JacobiSVD - */ -template -class SVDBase -{ - -public: - typedef typename internal::traits::MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - DiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_DYNAMIC(RowsAtCompileTime,ColsAtCompileTime), - MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, - MaxDiagSizeAtCompileTime = EIGEN_SIZE_MIN_PREFER_FIXED(MaxRowsAtCompileTime,MaxColsAtCompileTime), - MatrixOptions = MatrixType::Options - }; - - typedef Matrix MatrixUType; - typedef Matrix MatrixVType; - typedef typename internal::plain_diag_type::type SingularValuesType; - - Derived& derived() { return *static_cast(this); } - const Derived& derived() const { return *static_cast(this); } - - /** \returns the \a U matrix. - * - * For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p, - * the U matrix is n-by-n if you asked for \link Eigen::ComputeFullU ComputeFullU \endlink, and is n-by-m if you asked for \link Eigen::ComputeThinU ComputeThinU \endlink. - * - * The \a m first columns of \a U are the left singular vectors of the matrix being decomposed. - * - * This method asserts that you asked for \a U to be computed. - */ - const MatrixUType& matrixU() const - { - eigen_assert(m_isInitialized && "SVD is not initialized."); - eigen_assert(computeU() && "This SVD decomposition didn't compute U. Did you ask for it?"); - return m_matrixU; - } - - /** \returns the \a V matrix. - * - * For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p, - * the V matrix is p-by-p if you asked for \link Eigen::ComputeFullV ComputeFullV \endlink, and is p-by-m if you asked for \link Eigen::ComputeThinV ComputeThinV \endlink. - * - * The \a m first columns of \a V are the right singular vectors of the matrix being decomposed. - * - * This method asserts that you asked for \a V to be computed. - */ - const MatrixVType& matrixV() const - { - eigen_assert(m_isInitialized && "SVD is not initialized."); - eigen_assert(computeV() && "This SVD decomposition didn't compute V. Did you ask for it?"); - return m_matrixV; - } - - /** \returns the vector of singular values. - * - * For the SVD decomposition of a n-by-p matrix, letting \a m be the minimum of \a n and \a p, the - * returned vector has size \a m. Singular values are always sorted in decreasing order. - */ - const SingularValuesType& singularValues() const - { - eigen_assert(m_isInitialized && "SVD is not initialized."); - return m_singularValues; - } - - /** \returns the number of singular values that are not exactly 0 */ - Index nonzeroSingularValues() const - { - eigen_assert(m_isInitialized && "SVD is not initialized."); - return m_nonzeroSingularValues; - } - - /** \returns the rank of the matrix of which \c *this is the SVD. - * - * \note This method has to determine which singular values should be considered nonzero. - * For that, it uses the threshold value that you can control by calling - * setThreshold(const RealScalar&). - */ - inline Index rank() const - { - using std::abs; - eigen_assert(m_isInitialized && "JacobiSVD is not initialized."); - if(m_singularValues.size()==0) return 0; - RealScalar premultiplied_threshold = numext::maxi(m_singularValues.coeff(0) * threshold(), (std::numeric_limits::min)()); - Index i = m_nonzeroSingularValues-1; - while(i>=0 && m_singularValues.coeff(i) < premultiplied_threshold) --i; - return i+1; - } - - /** Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(), - * which need to determine when singular values are to be considered nonzero. - * This is not used for the SVD decomposition itself. - * - * When it needs to get the threshold value, Eigen calls threshold(). - * The default is \c NumTraits::epsilon() - * - * \param threshold The new value to use as the threshold. - * - * A singular value will be considered nonzero if its value is strictly greater than - * \f$ \vert singular value \vert \leqslant threshold \times \vert max singular value \vert \f$. - * - * If you want to come back to the default behavior, call setThreshold(Default_t) - */ - Derived& setThreshold(const RealScalar& threshold) - { - m_usePrescribedThreshold = true; - m_prescribedThreshold = threshold; - return derived(); - } - - /** Allows to come back to the default behavior, letting Eigen use its default formula for - * determining the threshold. - * - * You should pass the special object Eigen::Default as parameter here. - * \code svd.setThreshold(Eigen::Default); \endcode - * - * See the documentation of setThreshold(const RealScalar&). - */ - Derived& setThreshold(Default_t) - { - m_usePrescribedThreshold = false; - return derived(); - } - - /** Returns the threshold that will be used by certain methods such as rank(). - * - * See the documentation of setThreshold(const RealScalar&). - */ - RealScalar threshold() const - { - eigen_assert(m_isInitialized || m_usePrescribedThreshold); - return m_usePrescribedThreshold ? m_prescribedThreshold - : (std::max)(1,m_diagSize)*NumTraits::epsilon(); - } - - /** \returns true if \a U (full or thin) is asked for in this SVD decomposition */ - inline bool computeU() const { return m_computeFullU || m_computeThinU; } - /** \returns true if \a V (full or thin) is asked for in this SVD decomposition */ - inline bool computeV() const { return m_computeFullV || m_computeThinV; } - - inline Index rows() const { return m_rows; } - inline Index cols() const { return m_cols; } - - /** \returns a (least squares) solution of \f$ A x = b \f$ using the current SVD decomposition of A. - * - * \param b the right-hand-side of the equation to solve. - * - * \note Solving requires both U and V to be computed. Thin U and V are enough, there is no need for full U or V. - * - * \note SVD solving is implicitly least-squares. Thus, this method serves both purposes of exact solving and least-squares solving. - * In other words, the returned solution is guaranteed to minimize the Euclidean norm \f$ \Vert A x - b \Vert \f$. - */ - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "SVD is not initialized."); - eigen_assert(computeU() && computeV() && "SVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice)."); - return Solve(derived(), b.derived()); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - void _solve_impl(const RhsType &rhs, DstType &dst) const; - #endif - -protected: - - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT_NON_INTEGER(Scalar); - } - - // return true if already allocated - bool allocate(Index rows, Index cols, unsigned int computationOptions) ; - - MatrixUType m_matrixU; - MatrixVType m_matrixV; - SingularValuesType m_singularValues; - bool m_isInitialized, m_isAllocated, m_usePrescribedThreshold; - bool m_computeFullU, m_computeThinU; - bool m_computeFullV, m_computeThinV; - unsigned int m_computationOptions; - Index m_nonzeroSingularValues, m_rows, m_cols, m_diagSize; - RealScalar m_prescribedThreshold; - - /** \brief Default Constructor. - * - * Default constructor of SVDBase - */ - SVDBase() - : m_isInitialized(false), - m_isAllocated(false), - m_usePrescribedThreshold(false), - m_computationOptions(0), - m_rows(-1), m_cols(-1), m_diagSize(0) - { - check_template_parameters(); - } - - -}; - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void SVDBase::_solve_impl(const RhsType &rhs, DstType &dst) const -{ - eigen_assert(rhs.rows() == rows()); - - // A = U S V^* - // So A^{-1} = V S^{-1} U^* - - Matrix tmp; - Index l_rank = rank(); - tmp.noalias() = m_matrixU.leftCols(l_rank).adjoint() * rhs; - tmp = m_singularValues.head(l_rank).asDiagonal().inverse() * tmp; - dst = m_matrixV.leftCols(l_rank) * tmp; -} -#endif - -template -bool SVDBase::allocate(Index rows, Index cols, unsigned int computationOptions) -{ - eigen_assert(rows >= 0 && cols >= 0); - - if (m_isAllocated && - rows == m_rows && - cols == m_cols && - computationOptions == m_computationOptions) - { - return true; - } - - m_rows = rows; - m_cols = cols; - m_isInitialized = false; - m_isAllocated = true; - m_computationOptions = computationOptions; - m_computeFullU = (computationOptions & ComputeFullU) != 0; - m_computeThinU = (computationOptions & ComputeThinU) != 0; - m_computeFullV = (computationOptions & ComputeFullV) != 0; - m_computeThinV = (computationOptions & ComputeThinV) != 0; - eigen_assert(!(m_computeFullU && m_computeThinU) && "SVDBase: you can't ask for both full and thin U"); - eigen_assert(!(m_computeFullV && m_computeThinV) && "SVDBase: you can't ask for both full and thin V"); - eigen_assert(EIGEN_IMPLIES(m_computeThinU || m_computeThinV, MatrixType::ColsAtCompileTime==Dynamic) && - "SVDBase: thin U and V are only available when your matrix has a dynamic number of columns."); - - m_diagSize = (std::min)(m_rows, m_cols); - m_singularValues.resize(m_diagSize); - if(RowsAtCompileTime==Dynamic) - m_matrixU.resize(m_rows, m_computeFullU ? m_rows : m_computeThinU ? m_diagSize : 0); - if(ColsAtCompileTime==Dynamic) - m_matrixV.resize(m_cols, m_computeFullV ? m_cols : m_computeThinV ? m_diagSize : 0); - - return false; -} - -}// end namespace - -#endif // EIGEN_SVDBASE_H diff --git a/Eigen/src/SVD/UpperBidiagonalization.h b/Eigen/src/SVD/UpperBidiagonalization.h deleted file mode 100644 index 11ac847e1..000000000 --- a/Eigen/src/SVD/UpperBidiagonalization.h +++ /dev/null @@ -1,414 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2010 Benoit Jacob -// Copyright (C) 2013-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_BIDIAGONALIZATION_H -#define EIGEN_BIDIAGONALIZATION_H - -namespace Eigen { - -namespace internal { -// UpperBidiagonalization will probably be replaced by a Bidiagonalization class, don't want to make it stable API. -// At the same time, it's useful to keep for now as it's about the only thing that is testing the BandMatrix class. - -template class UpperBidiagonalization -{ - public: - - typedef _MatrixType MatrixType; - enum { - RowsAtCompileTime = MatrixType::RowsAtCompileTime, - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - ColsAtCompileTimeMinusOne = internal::decrement_size::ret - }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef Eigen::Index Index; ///< \deprecated since Eigen 3.3 - typedef Matrix RowVectorType; - typedef Matrix ColVectorType; - typedef BandMatrix BidiagonalType; - typedef Matrix DiagVectorType; - typedef Matrix SuperDiagVectorType; - typedef HouseholderSequence< - const MatrixType, - const typename internal::remove_all::ConjugateReturnType>::type - > HouseholderUSequenceType; - typedef HouseholderSequence< - const typename internal::remove_all::type, - Diagonal, - OnTheRight - > HouseholderVSequenceType; - - /** - * \brief Default Constructor. - * - * The default constructor is useful in cases in which the user intends to - * perform decompositions via Bidiagonalization::compute(const MatrixType&). - */ - UpperBidiagonalization() : m_householder(), m_bidiagonal(), m_isInitialized(false) {} - - explicit UpperBidiagonalization(const MatrixType& matrix) - : m_householder(matrix.rows(), matrix.cols()), - m_bidiagonal(matrix.cols(), matrix.cols()), - m_isInitialized(false) - { - compute(matrix); - } - - UpperBidiagonalization& compute(const MatrixType& matrix); - UpperBidiagonalization& computeUnblocked(const MatrixType& matrix); - - const MatrixType& householder() const { return m_householder; } - const BidiagonalType& bidiagonal() const { return m_bidiagonal; } - - const HouseholderUSequenceType householderU() const - { - eigen_assert(m_isInitialized && "UpperBidiagonalization is not initialized."); - return HouseholderUSequenceType(m_householder, m_householder.diagonal().conjugate()); - } - - const HouseholderVSequenceType householderV() // const here gives nasty errors and i'm lazy - { - eigen_assert(m_isInitialized && "UpperBidiagonalization is not initialized."); - return HouseholderVSequenceType(m_householder.conjugate(), m_householder.const_derived().template diagonal<1>()) - .setLength(m_householder.cols()-1) - .setShift(1); - } - - protected: - MatrixType m_householder; - BidiagonalType m_bidiagonal; - bool m_isInitialized; -}; - -// Standard upper bidiagonalization without fancy optimizations -// This version should be faster for small matrix size -template -void upperbidiagonalization_inplace_unblocked(MatrixType& mat, - typename MatrixType::RealScalar *diagonal, - typename MatrixType::RealScalar *upper_diagonal, - typename MatrixType::Scalar* tempData = 0) -{ - typedef typename MatrixType::Scalar Scalar; - - Index rows = mat.rows(); - Index cols = mat.cols(); - - typedef Matrix TempType; - TempType tempVector; - if(tempData==0) - { - tempVector.resize(rows); - tempData = tempVector.data(); - } - - for (Index k = 0; /* breaks at k==cols-1 below */ ; ++k) - { - Index remainingRows = rows - k; - Index remainingCols = cols - k - 1; - - // construct left householder transform in-place in A - mat.col(k).tail(remainingRows) - .makeHouseholderInPlace(mat.coeffRef(k,k), diagonal[k]); - // apply householder transform to remaining part of A on the left - mat.bottomRightCorner(remainingRows, remainingCols) - .applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows-1), mat.coeff(k,k), tempData); - - if(k == cols-1) break; - - // construct right householder transform in-place in mat - mat.row(k).tail(remainingCols) - .makeHouseholderInPlace(mat.coeffRef(k,k+1), upper_diagonal[k]); - // apply householder transform to remaining part of mat on the left - mat.bottomRightCorner(remainingRows-1, remainingCols) - .applyHouseholderOnTheRight(mat.row(k).tail(remainingCols-1).transpose(), mat.coeff(k,k+1), tempData); - } -} - -/** \internal - * Helper routine for the block reduction to upper bidiagonal form. - * - * Let's partition the matrix A: - * - * | A00 A01 | - * A = | | - * | A10 A11 | - * - * This function reduces to bidiagonal form the left \c rows x \a blockSize vertical panel [A00/A10] - * and the \a blockSize x \c cols horizontal panel [A00 A01] of the matrix \a A. The bottom-right block A11 - * is updated using matrix-matrix products: - * A22 -= V * Y^T - X * U^T - * where V and U contains the left and right Householder vectors. U and V are stored in A10, and A01 - * respectively, and the update matrices X and Y are computed during the reduction. - * - */ -template -void upperbidiagonalization_blocked_helper(MatrixType& A, - typename MatrixType::RealScalar *diagonal, - typename MatrixType::RealScalar *upper_diagonal, - Index bs, - Ref::Flags & RowMajorBit> > X, - Ref::Flags & RowMajorBit> > Y) -{ - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename NumTraits::Literal Literal; - enum { StorageOrder = traits::Flags & RowMajorBit }; - typedef InnerStride ColInnerStride; - typedef InnerStride RowInnerStride; - typedef Ref, 0, ColInnerStride> SubColumnType; - typedef Ref, 0, RowInnerStride> SubRowType; - typedef Ref > SubMatType; - - Index brows = A.rows(); - Index bcols = A.cols(); - - Scalar tau_u, tau_u_prev(0), tau_v; - - for(Index k = 0; k < bs; ++k) - { - Index remainingRows = brows - k; - Index remainingCols = bcols - k - 1; - - SubMatType X_k1( X.block(k,0, remainingRows,k) ); - SubMatType V_k1( A.block(k,0, remainingRows,k) ); - - // 1 - update the k-th column of A - SubColumnType v_k = A.col(k).tail(remainingRows); - v_k -= V_k1 * Y.row(k).head(k).adjoint(); - if(k) v_k -= X_k1 * A.col(k).head(k); - - // 2 - construct left Householder transform in-place - v_k.makeHouseholderInPlace(tau_v, diagonal[k]); - - if(k+10) A.coeffRef(k-1,k) = tau_u_prev; - tau_u_prev = tau_u; - } - else - A.coeffRef(k-1,k) = tau_u_prev; - - A.coeffRef(k,k) = tau_v; - } - - if(bsbs && brows>bs) - { - SubMatType A11( A.bottomRightCorner(brows-bs,bcols-bs) ); - SubMatType A10( A.block(bs,0, brows-bs,bs) ); - SubMatType A01( A.block(0,bs, bs,bcols-bs) ); - Scalar tmp = A01(bs-1,0); - A01(bs-1,0) = Literal(1); - A11.noalias() -= A10 * Y.topLeftCorner(bcols,bs).bottomRows(bcols-bs).adjoint(); - A11.noalias() -= X.topLeftCorner(brows,bs).bottomRows(brows-bs) * A01; - A01(bs-1,0) = tmp; - } -} - -/** \internal - * - * Implementation of a block-bidiagonal reduction. - * It is based on the following paper: - * The Design of a Parallel Dense Linear Algebra Software Library: Reduction to Hessenberg, Tridiagonal, and Bidiagonal Form. - * by Jaeyoung Choi, Jack J. Dongarra, David W. Walker. (1995) - * section 3.3 - */ -template -void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagonal, - Index maxBlockSize=32, - typename MatrixType::Scalar* /*tempData*/ = 0) -{ - typedef typename MatrixType::Scalar Scalar; - typedef Block BlockType; - - Index rows = A.rows(); - Index cols = A.cols(); - Index size = (std::min)(rows, cols); - - // X and Y are work space - enum { StorageOrder = traits::Flags & RowMajorBit }; - Matrix X(rows,maxBlockSize); - Matrix Y(cols,maxBlockSize); - Index blockSize = (std::min)(maxBlockSize,size); - - Index k = 0; - for(k = 0; k < size; k += blockSize) - { - Index bs = (std::min)(size-k,blockSize); // actual size of the block - Index brows = rows - k; // rows of the block - Index bcols = cols - k; // columns of the block - - // partition the matrix A: - // - // | A00 A01 A02 | - // | | - // A = | A10 A11 A12 | - // | | - // | A20 A21 A22 | - // - // where A11 is a bs x bs diagonal block, - // and let: - // | A11 A12 | - // B = | | - // | A21 A22 | - - BlockType B = A.block(k,k,brows,bcols); - - // This stage performs the bidiagonalization of A11, A21, A12, and updating of A22. - // Finally, the algorithm continue on the updated A22. - // - // However, if B is too small, or A22 empty, then let's use an unblocked strategy - if(k+bs==cols || bcols<48) // somewhat arbitrary threshold - { - upperbidiagonalization_inplace_unblocked(B, - &(bidiagonal.template diagonal<0>().coeffRef(k)), - &(bidiagonal.template diagonal<1>().coeffRef(k)), - X.data() - ); - break; // We're done - } - else - { - upperbidiagonalization_blocked_helper( B, - &(bidiagonal.template diagonal<0>().coeffRef(k)), - &(bidiagonal.template diagonal<1>().coeffRef(k)), - bs, - X.topLeftCorner(brows,bs), - Y.topLeftCorner(bcols,bs) - ); - } - } -} - -template -UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::computeUnblocked(const _MatrixType& matrix) -{ - Index rows = matrix.rows(); - Index cols = matrix.cols(); - EIGEN_ONLY_USED_FOR_DEBUG(cols); - - eigen_assert(rows >= cols && "UpperBidiagonalization is only for Arices satisfying rows>=cols."); - - m_householder = matrix; - - ColVectorType temp(rows); - - upperbidiagonalization_inplace_unblocked(m_householder, - &(m_bidiagonal.template diagonal<0>().coeffRef(0)), - &(m_bidiagonal.template diagonal<1>().coeffRef(0)), - temp.data()); - - m_isInitialized = true; - return *this; -} - -template -UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::compute(const _MatrixType& matrix) -{ - Index rows = matrix.rows(); - Index cols = matrix.cols(); - EIGEN_ONLY_USED_FOR_DEBUG(rows); - EIGEN_ONLY_USED_FOR_DEBUG(cols); - - eigen_assert(rows >= cols && "UpperBidiagonalization is only for Arices satisfying rows>=cols."); - - m_householder = matrix; - upperbidiagonalization_inplace_blocked(m_householder, m_bidiagonal); - - m_isInitialized = true; - return *this; -} - -#if 0 -/** \return the Householder QR decomposition of \c *this. - * - * \sa class Bidiagonalization - */ -template -const UpperBidiagonalization::PlainObject> -MatrixBase::bidiagonalization() const -{ - return UpperBidiagonalization(eval()); -} -#endif - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_BIDIAGONALIZATION_H diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky.h b/Eigen/src/SparseCholesky/SimplicialCholesky.h deleted file mode 100644 index 2907f6529..000000000 --- a/Eigen/src/SparseCholesky/SimplicialCholesky.h +++ /dev/null @@ -1,689 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SIMPLICIAL_CHOLESKY_H -#define EIGEN_SIMPLICIAL_CHOLESKY_H - -namespace Eigen { - -enum SimplicialCholeskyMode { - SimplicialCholeskyLLT, - SimplicialCholeskyLDLT -}; - -namespace internal { - template - struct simplicial_cholesky_grab_input { - typedef CholMatrixType const * ConstCholMatrixPtr; - static void run(const InputMatrixType& input, ConstCholMatrixPtr &pmat, CholMatrixType &tmp) - { - tmp = input; - pmat = &tmp; - } - }; - - template - struct simplicial_cholesky_grab_input { - typedef MatrixType const * ConstMatrixPtr; - static void run(const MatrixType& input, ConstMatrixPtr &pmat, MatrixType &/*tmp*/) - { - pmat = &input; - } - }; -} // end namespace internal - -/** \ingroup SparseCholesky_Module - * \brief A base class for direct sparse Cholesky factorizations - * - * This is a base class for LL^T and LDL^T Cholesky factorizations of sparse matrices that are - * selfadjoint and positive definite. These factorizations allow for solving A.X = B where - * X and B can be either dense or sparse. - * - * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization - * such that the factorized matrix is P A P^-1. - * - * \tparam Derived the type of the derived class, that is the actual factorization type. - * - */ -template -class SimplicialCholeskyBase : public SparseSolverBase -{ - typedef SparseSolverBase Base; - using Base::m_isInitialized; - - public: - typedef typename internal::traits::MatrixType MatrixType; - typedef typename internal::traits::OrderingType OrderingType; - enum { UpLo = internal::traits::UpLo }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix CholMatrixType; - typedef CholMatrixType const * ConstCholMatrixPtr; - typedef Matrix VectorType; - typedef Matrix VectorI; - - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - - using Base::derived; - - /** Default constructor */ - SimplicialCholeskyBase() - : m_info(Success), m_shiftOffset(0), m_shiftScale(1) - {} - - explicit SimplicialCholeskyBase(const MatrixType& matrix) - : m_info(Success), m_shiftOffset(0), m_shiftScale(1) - { - derived().compute(matrix); - } - - ~SimplicialCholeskyBase() - { - } - - Derived& derived() { return *static_cast(this); } - const Derived& derived() const { return *static_cast(this); } - - inline Index cols() const { return m_matrix.cols(); } - inline Index rows() const { return m_matrix.rows(); } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the matrix.appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - /** \returns the permutation P - * \sa permutationPinv() */ - const PermutationMatrix& permutationP() const - { return m_P; } - - /** \returns the inverse P^-1 of the permutation P - * \sa permutationP() */ - const PermutationMatrix& permutationPinv() const - { return m_Pinv; } - - /** Sets the shift parameters that will be used to adjust the diagonal coefficients during the numerical factorization. - * - * During the numerical factorization, the diagonal coefficients are transformed by the following linear model:\n - * \c d_ii = \a offset + \a scale * \c d_ii - * - * The default is the identity transformation with \a offset=0, and \a scale=1. - * - * \returns a reference to \c *this. - */ - Derived& setShift(const RealScalar& offset, const RealScalar& scale = 1) - { - m_shiftOffset = offset; - m_shiftScale = scale; - return derived(); - } - -#ifndef EIGEN_PARSED_BY_DOXYGEN - /** \internal */ - template - void dumpMemory(Stream& s) - { - int total = 0; - s << " L: " << ((total+=(m_matrix.cols()+1) * sizeof(int) + m_matrix.nonZeros()*(sizeof(int)+sizeof(Scalar))) >> 20) << "Mb" << "\n"; - s << " diag: " << ((total+=m_diag.size() * sizeof(Scalar)) >> 20) << "Mb" << "\n"; - s << " tree: " << ((total+=m_parent.size() * sizeof(int)) >> 20) << "Mb" << "\n"; - s << " nonzeros: " << ((total+=m_nonZerosPerCol.size() * sizeof(int)) >> 20) << "Mb" << "\n"; - s << " perm: " << ((total+=m_P.size() * sizeof(int)) >> 20) << "Mb" << "\n"; - s << " perm^-1: " << ((total+=m_Pinv.size() * sizeof(int)) >> 20) << "Mb" << "\n"; - s << " TOTAL: " << (total>> 20) << "Mb" << "\n"; - } - - /** \internal */ - template - void _solve_impl(const MatrixBase &b, MatrixBase &dest) const - { - eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); - eigen_assert(m_matrix.rows()==b.rows()); - - if(m_info!=Success) - return; - - if(m_P.size()>0) - dest = m_P * b; - else - dest = b; - - if(m_matrix.nonZeros()>0) // otherwise L==I - derived().matrixL().solveInPlace(dest); - - if(m_diag.size()>0) - dest = m_diag.asDiagonal().inverse() * dest; - - if (m_matrix.nonZeros()>0) // otherwise U==I - derived().matrixU().solveInPlace(dest); - - if(m_P.size()>0) - dest = m_Pinv * dest; - } - - template - void _solve_impl(const SparseMatrixBase &b, SparseMatrixBase &dest) const - { - internal::solve_sparse_through_dense_panels(derived(), b, dest); - } - -#endif // EIGEN_PARSED_BY_DOXYGEN - - protected: - - /** Computes the sparse Cholesky decomposition of \a matrix */ - template - void compute(const MatrixType& matrix) - { - eigen_assert(matrix.rows()==matrix.cols()); - Index size = matrix.cols(); - CholMatrixType tmp(size,size); - ConstCholMatrixPtr pmat; - ordering(matrix, pmat, tmp); - analyzePattern_preordered(*pmat, DoLDLT); - factorize_preordered(*pmat); - } - - template - void factorize(const MatrixType& a) - { - eigen_assert(a.rows()==a.cols()); - Index size = a.cols(); - CholMatrixType tmp(size,size); - ConstCholMatrixPtr pmat; - - if(m_P.size()==0 && (UpLo&Upper)==Upper) - { - // If there is no ordering, try to directly use the input matrix without any copy - internal::simplicial_cholesky_grab_input::run(a, pmat, tmp); - } - else - { - tmp.template selfadjointView() = a.template selfadjointView().twistedBy(m_P); - pmat = &tmp; - } - - factorize_preordered(*pmat); - } - - template - void factorize_preordered(const CholMatrixType& a); - - void analyzePattern(const MatrixType& a, bool doLDLT) - { - eigen_assert(a.rows()==a.cols()); - Index size = a.cols(); - CholMatrixType tmp(size,size); - ConstCholMatrixPtr pmat; - ordering(a, pmat, tmp); - analyzePattern_preordered(*pmat,doLDLT); - } - void analyzePattern_preordered(const CholMatrixType& a, bool doLDLT); - - void ordering(const MatrixType& a, ConstCholMatrixPtr &pmat, CholMatrixType& ap); - - /** keeps off-diagonal entries; drops diagonal entries */ - struct keep_diag { - inline bool operator() (const Index& row, const Index& col, const Scalar&) const - { - return row!=col; - } - }; - - mutable ComputationInfo m_info; - bool m_factorizationIsOk; - bool m_analysisIsOk; - - CholMatrixType m_matrix; - VectorType m_diag; // the diagonal coefficients (LDLT mode) - VectorI m_parent; // elimination tree - VectorI m_nonZerosPerCol; - PermutationMatrix m_P; // the permutation - PermutationMatrix m_Pinv; // the inverse permutation - - RealScalar m_shiftOffset; - RealScalar m_shiftScale; -}; - -template > class SimplicialLLT; -template > class SimplicialLDLT; -template > class SimplicialCholesky; - -namespace internal { - -template struct traits > -{ - typedef _MatrixType MatrixType; - typedef _Ordering OrderingType; - enum { UpLo = _UpLo }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix CholMatrixType; - typedef TriangularView MatrixL; - typedef TriangularView MatrixU; - static inline MatrixL getL(const MatrixType& m) { return MatrixL(m); } - static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } -}; - -template struct traits > -{ - typedef _MatrixType MatrixType; - typedef _Ordering OrderingType; - enum { UpLo = _UpLo }; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix CholMatrixType; - typedef TriangularView MatrixL; - typedef TriangularView MatrixU; - static inline MatrixL getL(const MatrixType& m) { return MatrixL(m); } - static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } -}; - -template struct traits > -{ - typedef _MatrixType MatrixType; - typedef _Ordering OrderingType; - enum { UpLo = _UpLo }; -}; - -} - -/** \ingroup SparseCholesky_Module - * \class SimplicialLLT - * \brief A direct sparse LLT Cholesky factorizations - * - * This class provides a LL^T Cholesky factorizations of sparse matrices that are - * selfadjoint and positive definite. The factorization allows for solving A.X = B where - * X and B can be either dense or sparse. - * - * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization - * such that the factorized matrix is P A P^-1. - * - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower - * or Upper. Default is Lower. - * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<> - * - * \implsparsesolverconcept - * - * \sa class SimplicialLDLT, class AMDOrdering, class NaturalOrdering - */ -template - class SimplicialLLT : public SimplicialCholeskyBase > -{ -public: - typedef _MatrixType MatrixType; - enum { UpLo = _UpLo }; - typedef SimplicialCholeskyBase Base; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix CholMatrixType; - typedef Matrix VectorType; - typedef internal::traits Traits; - typedef typename Traits::MatrixL MatrixL; - typedef typename Traits::MatrixU MatrixU; -public: - /** Default constructor */ - SimplicialLLT() : Base() {} - /** Constructs and performs the LLT factorization of \a matrix */ - explicit SimplicialLLT(const MatrixType& matrix) - : Base(matrix) {} - - /** \returns an expression of the factor L */ - inline const MatrixL matrixL() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial LLT not factorized"); - return Traits::getL(Base::m_matrix); - } - - /** \returns an expression of the factor U (= L^*) */ - inline const MatrixU matrixU() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial LLT not factorized"); - return Traits::getU(Base::m_matrix); - } - - /** Computes the sparse Cholesky decomposition of \a matrix */ - SimplicialLLT& compute(const MatrixType& matrix) - { - Base::template compute(matrix); - return *this; - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - void analyzePattern(const MatrixType& a) - { - Base::analyzePattern(a, false); - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed. - * - * \sa analyzePattern() - */ - void factorize(const MatrixType& a) - { - Base::template factorize(a); - } - - /** \returns the determinant of the underlying matrix from the current factorization */ - Scalar determinant() const - { - Scalar detL = Base::m_matrix.diagonal().prod(); - return numext::abs2(detL); - } -}; - -/** \ingroup SparseCholesky_Module - * \class SimplicialLDLT - * \brief A direct sparse LDLT Cholesky factorizations without square root. - * - * This class provides a LDL^T Cholesky factorizations without square root of sparse matrices that are - * selfadjoint and positive definite. The factorization allows for solving A.X = B where - * X and B can be either dense or sparse. - * - * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization - * such that the factorized matrix is P A P^-1. - * - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * \tparam _UpLo the triangular part that will be used for the computations. It can be Lower - * or Upper. Default is Lower. - * \tparam _Ordering The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<> - * - * \implsparsesolverconcept - * - * \sa class SimplicialLLT, class AMDOrdering, class NaturalOrdering - */ -template - class SimplicialLDLT : public SimplicialCholeskyBase > -{ -public: - typedef _MatrixType MatrixType; - enum { UpLo = _UpLo }; - typedef SimplicialCholeskyBase Base; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix CholMatrixType; - typedef Matrix VectorType; - typedef internal::traits Traits; - typedef typename Traits::MatrixL MatrixL; - typedef typename Traits::MatrixU MatrixU; -public: - /** Default constructor */ - SimplicialLDLT() : Base() {} - - /** Constructs and performs the LLT factorization of \a matrix */ - explicit SimplicialLDLT(const MatrixType& matrix) - : Base(matrix) {} - - /** \returns a vector expression of the diagonal D */ - inline const VectorType vectorD() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial LDLT not factorized"); - return Base::m_diag; - } - /** \returns an expression of the factor L */ - inline const MatrixL matrixL() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial LDLT not factorized"); - return Traits::getL(Base::m_matrix); - } - - /** \returns an expression of the factor U (= L^*) */ - inline const MatrixU matrixU() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial LDLT not factorized"); - return Traits::getU(Base::m_matrix); - } - - /** Computes the sparse Cholesky decomposition of \a matrix */ - SimplicialLDLT& compute(const MatrixType& matrix) - { - Base::template compute(matrix); - return *this; - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - void analyzePattern(const MatrixType& a) - { - Base::analyzePattern(a, true); - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed. - * - * \sa analyzePattern() - */ - void factorize(const MatrixType& a) - { - Base::template factorize(a); - } - - /** \returns the determinant of the underlying matrix from the current factorization */ - Scalar determinant() const - { - return Base::m_diag.prod(); - } -}; - -/** \deprecated use SimplicialLDLT or class SimplicialLLT - * \ingroup SparseCholesky_Module - * \class SimplicialCholesky - * - * \sa class SimplicialLDLT, class SimplicialLLT - */ -template - class SimplicialCholesky : public SimplicialCholeskyBase > -{ -public: - typedef _MatrixType MatrixType; - enum { UpLo = _UpLo }; - typedef SimplicialCholeskyBase Base; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix CholMatrixType; - typedef Matrix VectorType; - typedef internal::traits Traits; - typedef internal::traits > LDLTTraits; - typedef internal::traits > LLTTraits; - public: - SimplicialCholesky() : Base(), m_LDLT(true) {} - - explicit SimplicialCholesky(const MatrixType& matrix) - : Base(), m_LDLT(true) - { - compute(matrix); - } - - SimplicialCholesky& setMode(SimplicialCholeskyMode mode) - { - switch(mode) - { - case SimplicialCholeskyLLT: - m_LDLT = false; - break; - case SimplicialCholeskyLDLT: - m_LDLT = true; - break; - default: - break; - } - - return *this; - } - - inline const VectorType vectorD() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial Cholesky not factorized"); - return Base::m_diag; - } - inline const CholMatrixType rawMatrix() const { - eigen_assert(Base::m_factorizationIsOk && "Simplicial Cholesky not factorized"); - return Base::m_matrix; - } - - /** Computes the sparse Cholesky decomposition of \a matrix */ - SimplicialCholesky& compute(const MatrixType& matrix) - { - if(m_LDLT) - Base::template compute(matrix); - else - Base::template compute(matrix); - return *this; - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - void analyzePattern(const MatrixType& a) - { - Base::analyzePattern(a, m_LDLT); - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed. - * - * \sa analyzePattern() - */ - void factorize(const MatrixType& a) - { - if(m_LDLT) - Base::template factorize(a); - else - Base::template factorize(a); - } - - /** \internal */ - template - void _solve_impl(const MatrixBase &b, MatrixBase &dest) const - { - eigen_assert(Base::m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or symbolic()/numeric()"); - eigen_assert(Base::m_matrix.rows()==b.rows()); - - if(Base::m_info!=Success) - return; - - if(Base::m_P.size()>0) - dest = Base::m_P * b; - else - dest = b; - - if(Base::m_matrix.nonZeros()>0) // otherwise L==I - { - if(m_LDLT) - LDLTTraits::getL(Base::m_matrix).solveInPlace(dest); - else - LLTTraits::getL(Base::m_matrix).solveInPlace(dest); - } - - if(Base::m_diag.size()>0) - dest = Base::m_diag.asDiagonal().inverse() * dest; - - if (Base::m_matrix.nonZeros()>0) // otherwise I==I - { - if(m_LDLT) - LDLTTraits::getU(Base::m_matrix).solveInPlace(dest); - else - LLTTraits::getU(Base::m_matrix).solveInPlace(dest); - } - - if(Base::m_P.size()>0) - dest = Base::m_Pinv * dest; - } - - /** \internal */ - template - void _solve_impl(const SparseMatrixBase &b, SparseMatrixBase &dest) const - { - internal::solve_sparse_through_dense_panels(*this, b, dest); - } - - Scalar determinant() const - { - if(m_LDLT) - { - return Base::m_diag.prod(); - } - else - { - Scalar detL = Diagonal(Base::m_matrix).prod(); - return numext::abs2(detL); - } - } - - protected: - bool m_LDLT; -}; - -template -void SimplicialCholeskyBase::ordering(const MatrixType& a, ConstCholMatrixPtr &pmat, CholMatrixType& ap) -{ - eigen_assert(a.rows()==a.cols()); - const Index size = a.rows(); - pmat = Š- // Note that ordering methods compute the inverse permutation - if(!internal::is_same >::value) - { - { - CholMatrixType C; - C = a.template selfadjointView(); - - OrderingType ordering; - ordering(C,m_Pinv); - } - - if(m_Pinv.size()>0) m_P = m_Pinv.inverse(); - else m_P.resize(0); - - ap.resize(size,size); - ap.template selfadjointView() = a.template selfadjointView().twistedBy(m_P); - } - else - { - m_Pinv.resize(0); - m_P.resize(0); - if(int(UpLo)==int(Lower) || MatrixType::IsRowMajor) - { - // we have to transpose the lower part to to the upper one - ap.resize(size,size); - ap.template selfadjointView() = a.template selfadjointView(); - } - else - internal::simplicial_cholesky_grab_input::run(a, pmat, ap); - } -} - -} // end namespace Eigen - -#endif // EIGEN_SIMPLICIAL_CHOLESKY_H diff --git a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h b/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h deleted file mode 100644 index 84a1bf2bd..000000000 --- a/Eigen/src/SparseCholesky/SimplicialCholesky_impl.h +++ /dev/null @@ -1,199 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2012 Gael Guennebaud - -/* - -NOTE: thes functions vave been adapted from the LDL library: - -LDL Copyright (c) 2005 by Timothy A. Davis. All Rights Reserved. - -LDL License: - - Your use or distribution of LDL or any modified version of - LDL implies that you agree to this License. - - This library is free software; you can redistribute it and/or - modify it under the terms of the GNU Lesser General Public - License as published by the Free Software Foundation; either - version 2.1 of the License, or (at your option) any later version. - - This library 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 - Lesser General Public License for more details. - - You should have received a copy of the GNU Lesser General Public - License along with this library; if not, write to the Free Software - Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 - USA - - Permission is hereby granted to use or copy this program under the - terms of the GNU LGPL, provided that the Copyright, this License, - and the Availability of the original version is retained on all copies. - User documentation of any code that uses this code or any modified - version of this code must cite the Copyright, this License, the - Availability note, and "Used by permission." Permission to modify - the code and to distribute modified code is granted, provided the - Copyright, this License, and the Availability note are retained, - and a notice that the code was modified is included. - */ - -#include "../Core/util/NonMPL2.h" - -#ifndef EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H -#define EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H - -namespace Eigen { - -template -void SimplicialCholeskyBase::analyzePattern_preordered(const CholMatrixType& ap, bool doLDLT) -{ - const StorageIndex size = StorageIndex(ap.rows()); - m_matrix.resize(size, size); - m_parent.resize(size); - m_nonZerosPerCol.resize(size); - - ei_declare_aligned_stack_constructed_variable(StorageIndex, tags, size, 0); - - for(StorageIndex k = 0; k < size; ++k) - { - /* L(k,:) pattern: all nodes reachable in etree from nz in A(0:k-1,k) */ - m_parent[k] = -1; /* parent of k is not yet known */ - tags[k] = k; /* mark node k as visited */ - m_nonZerosPerCol[k] = 0; /* count of nonzeros in column k of L */ - for(typename CholMatrixType::InnerIterator it(ap,k); it; ++it) - { - StorageIndex i = it.index(); - if(i < k) - { - /* follow path from i to root of etree, stop at flagged node */ - for(; tags[i] != k; i = m_parent[i]) - { - /* find parent of i if not yet determined */ - if (m_parent[i] == -1) - m_parent[i] = k; - m_nonZerosPerCol[i]++; /* L (k,i) is nonzero */ - tags[i] = k; /* mark i as visited */ - } - } - } - } - - /* construct Lp index array from m_nonZerosPerCol column counts */ - StorageIndex* Lp = m_matrix.outerIndexPtr(); - Lp[0] = 0; - for(StorageIndex k = 0; k < size; ++k) - Lp[k+1] = Lp[k] + m_nonZerosPerCol[k] + (doLDLT ? 0 : 1); - - m_matrix.resizeNonZeros(Lp[size]); - - m_isInitialized = true; - m_info = Success; - m_analysisIsOk = true; - m_factorizationIsOk = false; -} - - -template -template -void SimplicialCholeskyBase::factorize_preordered(const CholMatrixType& ap) -{ - using std::sqrt; - - eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); - eigen_assert(ap.rows()==ap.cols()); - eigen_assert(m_parent.size()==ap.rows()); - eigen_assert(m_nonZerosPerCol.size()==ap.rows()); - - const StorageIndex size = StorageIndex(ap.rows()); - const StorageIndex* Lp = m_matrix.outerIndexPtr(); - StorageIndex* Li = m_matrix.innerIndexPtr(); - Scalar* Lx = m_matrix.valuePtr(); - - ei_declare_aligned_stack_constructed_variable(Scalar, y, size, 0); - ei_declare_aligned_stack_constructed_variable(StorageIndex, pattern, size, 0); - ei_declare_aligned_stack_constructed_variable(StorageIndex, tags, size, 0); - - bool ok = true; - m_diag.resize(DoLDLT ? size : 0); - - for(StorageIndex k = 0; k < size; ++k) - { - // compute nonzero pattern of kth row of L, in topological order - y[k] = Scalar(0); // Y(0:k) is now all zero - StorageIndex top = size; // stack for pattern is empty - tags[k] = k; // mark node k as visited - m_nonZerosPerCol[k] = 0; // count of nonzeros in column k of L - for(typename CholMatrixType::InnerIterator it(ap,k); it; ++it) - { - StorageIndex i = it.index(); - if(i <= k) - { - y[i] += numext::conj(it.value()); /* scatter A(i,k) into Y (sum duplicates) */ - Index len; - for(len = 0; tags[i] != k; i = m_parent[i]) - { - pattern[len++] = i; /* L(k,i) is nonzero */ - tags[i] = k; /* mark i as visited */ - } - while(len > 0) - pattern[--top] = pattern[--len]; - } - } - - /* compute numerical values kth row of L (a sparse triangular solve) */ - - RealScalar d = numext::real(y[k]) * m_shiftScale + m_shiftOffset; // get D(k,k), apply the shift function, and clear Y(k) - y[k] = Scalar(0); - for(; top < size; ++top) - { - Index i = pattern[top]; /* pattern[top:n-1] is pattern of L(:,k) */ - Scalar yi = y[i]; /* get and clear Y(i) */ - y[i] = Scalar(0); - - /* the nonzero entry L(k,i) */ - Scalar l_ki; - if(DoLDLT) - l_ki = yi / m_diag[i]; - else - yi = l_ki = yi / Lx[Lp[i]]; - - Index p2 = Lp[i] + m_nonZerosPerCol[i]; - Index p; - for(p = Lp[i] + (DoLDLT ? 0 : 1); p < p2; ++p) - y[Li[p]] -= numext::conj(Lx[p]) * yi; - d -= numext::real(l_ki * numext::conj(yi)); - Li[p] = k; /* store L(k,i) in column form of L */ - Lx[p] = l_ki; - ++m_nonZerosPerCol[i]; /* increment count of nonzeros in col i */ - } - if(DoLDLT) - { - m_diag[k] = d; - if(d == RealScalar(0)) - { - ok = false; /* failure, D(k,k) is zero */ - break; - } - } - else - { - Index p = Lp[k] + m_nonZerosPerCol[k]++; - Li[p] = k ; /* store L(k,k) = sqrt (d) in column k */ - if(d <= RealScalar(0)) { - ok = false; /* failure, matrix is not positive definite */ - break; - } - Lx[p] = sqrt(d) ; - } - } - - m_info = ok ? Success : NumericalIssue; - m_factorizationIsOk = true; -} - -} // end namespace Eigen - -#endif // EIGEN_SIMPLICIAL_CHOLESKY_IMPL_H diff --git a/Eigen/src/SparseCore/AmbiVector.h b/Eigen/src/SparseCore/AmbiVector.h deleted file mode 100644 index e0295f2af..000000000 --- a/Eigen/src/SparseCore/AmbiVector.h +++ /dev/null @@ -1,377 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_AMBIVECTOR_H -#define EIGEN_AMBIVECTOR_H - -namespace Eigen { - -namespace internal { - -/** \internal - * Hybrid sparse/dense vector class designed for intensive read-write operations. - * - * See BasicSparseLLT and SparseProduct for usage examples. - */ -template -class AmbiVector -{ - public: - typedef _Scalar Scalar; - typedef _StorageIndex StorageIndex; - typedef typename NumTraits::Real RealScalar; - - explicit AmbiVector(Index size) - : m_buffer(0), m_zero(0), m_size(0), m_allocatedSize(0), m_allocatedElements(0), m_mode(-1) - { - resize(size); - } - - void init(double estimatedDensity); - void init(int mode); - - Index nonZeros() const; - - /** Specifies a sub-vector to work on */ - void setBounds(Index start, Index end) { m_start = convert_index(start); m_end = convert_index(end); } - - void setZero(); - - void restart(); - Scalar& coeffRef(Index i); - Scalar& coeff(Index i); - - class Iterator; - - ~AmbiVector() { delete[] m_buffer; } - - void resize(Index size) - { - if (m_allocatedSize < size) - reallocate(size); - m_size = convert_index(size); - } - - StorageIndex size() const { return m_size; } - - protected: - StorageIndex convert_index(Index idx) - { - return internal::convert_index(idx); - } - - void reallocate(Index size) - { - // if the size of the matrix is not too large, let's allocate a bit more than needed such - // that we can handle dense vector even in sparse mode. - delete[] m_buffer; - if (size<1000) - { - Index allocSize = (size * sizeof(ListEl) + sizeof(Scalar) - 1)/sizeof(Scalar); - m_allocatedElements = convert_index((allocSize*sizeof(Scalar))/sizeof(ListEl)); - m_buffer = new Scalar[allocSize]; - } - else - { - m_allocatedElements = convert_index((size*sizeof(Scalar))/sizeof(ListEl)); - m_buffer = new Scalar[size]; - } - m_size = convert_index(size); - m_start = 0; - m_end = m_size; - } - - void reallocateSparse() - { - Index copyElements = m_allocatedElements; - m_allocatedElements = (std::min)(StorageIndex(m_allocatedElements*1.5),m_size); - Index allocSize = m_allocatedElements * sizeof(ListEl); - allocSize = (allocSize + sizeof(Scalar) - 1)/sizeof(Scalar); - Scalar* newBuffer = new Scalar[allocSize]; - std::memcpy(newBuffer, m_buffer, copyElements * sizeof(ListEl)); - delete[] m_buffer; - m_buffer = newBuffer; - } - - protected: - // element type of the linked list - struct ListEl - { - StorageIndex next; - StorageIndex index; - Scalar value; - }; - - // used to store data in both mode - Scalar* m_buffer; - Scalar m_zero; - StorageIndex m_size; - StorageIndex m_start; - StorageIndex m_end; - StorageIndex m_allocatedSize; - StorageIndex m_allocatedElements; - StorageIndex m_mode; - - // linked list mode - StorageIndex m_llStart; - StorageIndex m_llCurrent; - StorageIndex m_llSize; -}; - -/** \returns the number of non zeros in the current sub vector */ -template -Index AmbiVector<_Scalar,_StorageIndex>::nonZeros() const -{ - if (m_mode==IsSparse) - return m_llSize; - else - return m_end - m_start; -} - -template -void AmbiVector<_Scalar,_StorageIndex>::init(double estimatedDensity) -{ - if (estimatedDensity>0.1) - init(IsDense); - else - init(IsSparse); -} - -template -void AmbiVector<_Scalar,_StorageIndex>::init(int mode) -{ - m_mode = mode; - if (m_mode==IsSparse) - { - m_llSize = 0; - m_llStart = -1; - } -} - -/** Must be called whenever we might perform a write access - * with an index smaller than the previous one. - * - * Don't worry, this function is extremely cheap. - */ -template -void AmbiVector<_Scalar,_StorageIndex>::restart() -{ - m_llCurrent = m_llStart; -} - -/** Set all coefficients of current subvector to zero */ -template -void AmbiVector<_Scalar,_StorageIndex>::setZero() -{ - if (m_mode==IsDense) - { - for (Index i=m_start; i -_Scalar& AmbiVector<_Scalar,_StorageIndex>::coeffRef(Index i) -{ - if (m_mode==IsDense) - return m_buffer[i]; - else - { - ListEl* EIGEN_RESTRICT llElements = reinterpret_cast(m_buffer); - // TODO factorize the following code to reduce code generation - eigen_assert(m_mode==IsSparse); - if (m_llSize==0) - { - // this is the first element - m_llStart = 0; - m_llCurrent = 0; - ++m_llSize; - llElements[0].value = Scalar(0); - llElements[0].index = convert_index(i); - llElements[0].next = -1; - return llElements[0].value; - } - else if (i=llElements[m_llCurrent].index && "you must call restart() before inserting an element with lower or equal index"); - while (nextel >= 0 && llElements[nextel].index<=i) - { - m_llCurrent = nextel; - nextel = llElements[nextel].next; - } - - if (llElements[m_llCurrent].index==i) - { - // the coefficient already exists and we found it ! - return llElements[m_llCurrent].value; - } - else - { - if (m_llSize>=m_allocatedElements) - { - reallocateSparse(); - llElements = reinterpret_cast(m_buffer); - } - eigen_internal_assert(m_llSize -_Scalar& AmbiVector<_Scalar,_StorageIndex>::coeff(Index i) -{ - if (m_mode==IsDense) - return m_buffer[i]; - else - { - ListEl* EIGEN_RESTRICT llElements = reinterpret_cast(m_buffer); - eigen_assert(m_mode==IsSparse); - if ((m_llSize==0) || (i= 0 && llElements[elid].index -class AmbiVector<_Scalar,_StorageIndex>::Iterator -{ - public: - typedef _Scalar Scalar; - typedef typename NumTraits::Real RealScalar; - - /** Default constructor - * \param vec the vector on which we iterate - * \param epsilon the minimal value used to prune zero coefficients. - * In practice, all coefficients having a magnitude smaller than \a epsilon - * are skipped. - */ - explicit Iterator(const AmbiVector& vec, const RealScalar& epsilon = 0) - : m_vector(vec) - { - using std::abs; - m_epsilon = epsilon; - m_isDense = m_vector.m_mode==IsDense; - if (m_isDense) - { - m_currentEl = 0; // this is to avoid a compilation warning - m_cachedValue = 0; // this is to avoid a compilation warning - m_cachedIndex = m_vector.m_start-1; - ++(*this); - } - else - { - ListEl* EIGEN_RESTRICT llElements = reinterpret_cast(m_vector.m_buffer); - m_currentEl = m_vector.m_llStart; - while (m_currentEl>=0 && abs(llElements[m_currentEl].value)<=m_epsilon) - m_currentEl = llElements[m_currentEl].next; - if (m_currentEl<0) - { - m_cachedValue = 0; // this is to avoid a compilation warning - m_cachedIndex = -1; - } - else - { - m_cachedIndex = llElements[m_currentEl].index; - m_cachedValue = llElements[m_currentEl].value; - } - } - } - - StorageIndex index() const { return m_cachedIndex; } - Scalar value() const { return m_cachedValue; } - - operator bool() const { return m_cachedIndex>=0; } - - Iterator& operator++() - { - using std::abs; - if (m_isDense) - { - do { - ++m_cachedIndex; - } while (m_cachedIndex(m_vector.m_buffer); - do { - m_currentEl = llElements[m_currentEl].next; - } while (m_currentEl>=0 && abs(llElements[m_currentEl].value)<=m_epsilon); - if (m_currentEl<0) - { - m_cachedIndex = -1; - } - else - { - m_cachedIndex = llElements[m_currentEl].index; - m_cachedValue = llElements[m_currentEl].value; - } - } - return *this; - } - - protected: - const AmbiVector& m_vector; // the target vector - StorageIndex m_currentEl; // the current element in sparse/linked-list mode - RealScalar m_epsilon; // epsilon used to prune zero coefficients - StorageIndex m_cachedIndex; // current coordinate - Scalar m_cachedValue; // current value - bool m_isDense; // mode of the vector -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_AMBIVECTOR_H diff --git a/Eigen/src/SparseCore/CompressedStorage.h b/Eigen/src/SparseCore/CompressedStorage.h deleted file mode 100644 index d89fa0dae..000000000 --- a/Eigen/src/SparseCore/CompressedStorage.h +++ /dev/null @@ -1,258 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_COMPRESSED_STORAGE_H -#define EIGEN_COMPRESSED_STORAGE_H - -namespace Eigen { - -namespace internal { - -/** \internal - * Stores a sparse set of values as a list of values and a list of indices. - * - */ -template -class CompressedStorage -{ - public: - - typedef _Scalar Scalar; - typedef _StorageIndex StorageIndex; - - protected: - - typedef typename NumTraits::Real RealScalar; - - public: - - CompressedStorage() - : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0) - {} - - explicit CompressedStorage(Index size) - : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0) - { - resize(size); - } - - CompressedStorage(const CompressedStorage& other) - : m_values(0), m_indices(0), m_size(0), m_allocatedSize(0) - { - *this = other; - } - - CompressedStorage& operator=(const CompressedStorage& other) - { - resize(other.size()); - if(other.size()>0) - { - internal::smart_copy(other.m_values, other.m_values + m_size, m_values); - internal::smart_copy(other.m_indices, other.m_indices + m_size, m_indices); - } - return *this; - } - - void swap(CompressedStorage& other) - { - std::swap(m_values, other.m_values); - std::swap(m_indices, other.m_indices); - std::swap(m_size, other.m_size); - std::swap(m_allocatedSize, other.m_allocatedSize); - } - - ~CompressedStorage() - { - delete[] m_values; - delete[] m_indices; - } - - void reserve(Index size) - { - Index newAllocatedSize = m_size + size; - if (newAllocatedSize > m_allocatedSize) - reallocate(newAllocatedSize); - } - - void squeeze() - { - if (m_allocatedSize>m_size) - reallocate(m_size); - } - - void resize(Index size, double reserveSizeFactor = 0) - { - if (m_allocatedSize)(NumTraits::highest(), size + Index(reserveSizeFactor*double(size))); - if(realloc_size(i); - } - - inline Index size() const { return m_size; } - inline Index allocatedSize() const { return m_allocatedSize; } - inline void clear() { m_size = 0; } - - const Scalar* valuePtr() const { return m_values; } - Scalar* valuePtr() { return m_values; } - const StorageIndex* indexPtr() const { return m_indices; } - StorageIndex* indexPtr() { return m_indices; } - - inline Scalar& value(Index i) { eigen_internal_assert(m_values!=0); return m_values[i]; } - inline const Scalar& value(Index i) const { eigen_internal_assert(m_values!=0); return m_values[i]; } - - inline StorageIndex& index(Index i) { eigen_internal_assert(m_indices!=0); return m_indices[i]; } - inline const StorageIndex& index(Index i) const { eigen_internal_assert(m_indices!=0); return m_indices[i]; } - - /** \returns the largest \c k such that for all \c j in [0,k) index[\c j]\<\a key */ - inline Index searchLowerIndex(Index key) const - { - return searchLowerIndex(0, m_size, key); - } - - /** \returns the largest \c k in [start,end) such that for all \c j in [start,k) index[\c j]\<\a key */ - inline Index searchLowerIndex(Index start, Index end, Index key) const - { - while(end>start) - { - Index mid = (end+start)>>1; - if (m_indices[mid]=end) - return defaultValue; - else if (end>start && key==m_indices[end-1]) - return m_values[end-1]; - // ^^ optimization: let's first check if it is the last coefficient - // (very common in high level algorithms) - const Index id = searchLowerIndex(start,end-1,key); - return ((id=m_size || m_indices[id]!=key) - { - if (m_allocatedSize newValues(m_allocatedSize); - internal::scoped_array newIndices(m_allocatedSize); - - // copy first chunk - internal::smart_copy(m_values, m_values +id, newValues.ptr()); - internal::smart_copy(m_indices, m_indices+id, newIndices.ptr()); - - // copy the rest - if(m_size>id) - { - internal::smart_copy(m_values +id, m_values +m_size, newValues.ptr() +id+1); - internal::smart_copy(m_indices+id, m_indices+m_size, newIndices.ptr()+id+1); - } - std::swap(m_values,newValues.ptr()); - std::swap(m_indices,newIndices.ptr()); - } - else if(m_size>id) - { - internal::smart_memmove(m_values +id, m_values +m_size, m_values +id+1); - internal::smart_memmove(m_indices+id, m_indices+m_size, m_indices+id+1); - } - m_size++; - m_indices[id] = internal::convert_index(key); - m_values[id] = defaultValue; - } - return m_values[id]; - } - - void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits::dummy_precision()) - { - Index k = 0; - Index n = size(); - for (Index i=0; i newValues(size); - internal::scoped_array newIndices(size); - Index copySize = (std::min)(size, m_size); - if (copySize>0) { - internal::smart_copy(m_values, m_values+copySize, newValues.ptr()); - internal::smart_copy(m_indices, m_indices+copySize, newIndices.ptr()); - } - std::swap(m_values,newValues.ptr()); - std::swap(m_indices,newIndices.ptr()); - m_allocatedSize = size; - } - - protected: - Scalar* m_values; - StorageIndex* m_indices; - Index m_size; - Index m_allocatedSize; - -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_COMPRESSED_STORAGE_H diff --git a/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h b/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h deleted file mode 100644 index 9db119b67..000000000 --- a/Eigen/src/SparseCore/ConservativeSparseSparseProduct.h +++ /dev/null @@ -1,352 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_CONSERVATIVESPARSESPARSEPRODUCT_H -#define EIGEN_CONSERVATIVESPARSESPARSEPRODUCT_H - -namespace Eigen { - -namespace internal { - -template -static void conservative_sparse_sparse_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, bool sortedInsertion = false) -{ - typedef typename remove_all::type::Scalar LhsScalar; - typedef typename remove_all::type::Scalar RhsScalar; - typedef typename remove_all::type::Scalar ResScalar; - - // make sure to call innerSize/outerSize since we fake the storage order. - Index rows = lhs.innerSize(); - Index cols = rhs.outerSize(); - eigen_assert(lhs.outerSize() == rhs.innerSize()); - - ei_declare_aligned_stack_constructed_variable(bool, mask, rows, 0); - ei_declare_aligned_stack_constructed_variable(ResScalar, values, rows, 0); - ei_declare_aligned_stack_constructed_variable(Index, indices, rows, 0); - - std::memset(mask,0,sizeof(bool)*rows); - - evaluator lhsEval(lhs); - evaluator rhsEval(rhs); - - // estimate the number of non zero entries - // given a rhs column containing Y non zeros, we assume that the respective Y columns - // of the lhs differs in average of one non zeros, thus the number of non zeros for - // the product of a rhs column with the lhs is X+Y where X is the average number of non zero - // per column of the lhs. - // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs) - Index estimated_nnz_prod = lhsEval.nonZerosEstimate() + rhsEval.nonZerosEstimate(); - - res.setZero(); - res.reserve(Index(estimated_nnz_prod)); - // we compute each column of the result, one after the other - for (Index j=0; j::InnerIterator rhsIt(rhsEval, j); rhsIt; ++rhsIt) - { - RhsScalar y = rhsIt.value(); - Index k = rhsIt.index(); - for (typename evaluator::InnerIterator lhsIt(lhsEval, k); lhsIt; ++lhsIt) - { - Index i = lhsIt.index(); - LhsScalar x = lhsIt.value(); - if(!mask[i]) - { - mask[i] = true; - values[i] = x * y; - indices[nnz] = i; - ++nnz; - } - else - values[i] += x * y; - } - } - if(!sortedInsertion) - { - // unordered insertion - for(Index k=0; k use a quick sort - // otherwise => loop through the entire vector - // In order to avoid to perform an expensive log2 when the - // result is clearly very sparse we use a linear bound up to 200. - if((nnz<200 && nnz1) std::sort(indices,indices+nnz); - for(Index k=0; k::Flags&RowMajorBit) ? RowMajor : ColMajor, - int RhsStorageOrder = (traits::Flags&RowMajorBit) ? RowMajor : ColMajor, - int ResStorageOrder = (traits::Flags&RowMajorBit) ? RowMajor : ColMajor> -struct conservative_sparse_sparse_product_selector; - -template -struct conservative_sparse_sparse_product_selector -{ - typedef typename remove_all::type LhsCleaned; - typedef typename LhsCleaned::Scalar Scalar; - - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix RowMajorMatrix; - typedef SparseMatrix ColMajorMatrixAux; - typedef typename sparse_eval::type ColMajorMatrix; - - // If the result is tall and thin (in the extreme case a column vector) - // then it is faster to sort the coefficients inplace instead of transposing twice. - // FIXME, the following heuristic is probably not very good. - if(lhs.rows()>rhs.cols()) - { - ColMajorMatrix resCol(lhs.rows(),rhs.cols()); - // perform sorted insertion - internal::conservative_sparse_sparse_product_impl(lhs, rhs, resCol, true); - res = resCol.markAsRValue(); - } - else - { - ColMajorMatrixAux resCol(lhs.rows(),rhs.cols()); - // ressort to transpose to sort the entries - internal::conservative_sparse_sparse_product_impl(lhs, rhs, resCol, false); - RowMajorMatrix resRow(resCol); - res = resRow.markAsRValue(); - } - } -}; - -template -struct conservative_sparse_sparse_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix RowMajorRhs; - typedef SparseMatrix RowMajorRes; - RowMajorRhs rhsRow = rhs; - RowMajorRes resRow(lhs.rows(), rhs.cols()); - internal::conservative_sparse_sparse_product_impl(rhsRow, lhs, resRow); - res = resRow; - } -}; - -template -struct conservative_sparse_sparse_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix RowMajorLhs; - typedef SparseMatrix RowMajorRes; - RowMajorLhs lhsRow = lhs; - RowMajorRes resRow(lhs.rows(), rhs.cols()); - internal::conservative_sparse_sparse_product_impl(rhs, lhsRow, resRow); - res = resRow; - } -}; - -template -struct conservative_sparse_sparse_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix RowMajorMatrix; - RowMajorMatrix resRow(lhs.rows(), rhs.cols()); - internal::conservative_sparse_sparse_product_impl(rhs, lhs, resRow); - res = resRow; - } -}; - - -template -struct conservative_sparse_sparse_product_selector -{ - typedef typename traits::type>::Scalar Scalar; - - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix ColMajorMatrix; - ColMajorMatrix resCol(lhs.rows(), rhs.cols()); - internal::conservative_sparse_sparse_product_impl(lhs, rhs, resCol); - res = resCol; - } -}; - -template -struct conservative_sparse_sparse_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix ColMajorLhs; - typedef SparseMatrix ColMajorRes; - ColMajorLhs lhsCol = lhs; - ColMajorRes resCol(lhs.rows(), rhs.cols()); - internal::conservative_sparse_sparse_product_impl(lhsCol, rhs, resCol); - res = resCol; - } -}; - -template -struct conservative_sparse_sparse_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix ColMajorRhs; - typedef SparseMatrix ColMajorRes; - ColMajorRhs rhsCol = rhs; - ColMajorRes resCol(lhs.rows(), rhs.cols()); - internal::conservative_sparse_sparse_product_impl(lhs, rhsCol, resCol); - res = resCol; - } -}; - -template -struct conservative_sparse_sparse_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix RowMajorMatrix; - typedef SparseMatrix ColMajorMatrix; - RowMajorMatrix resRow(lhs.rows(),rhs.cols()); - internal::conservative_sparse_sparse_product_impl(rhs, lhs, resRow); - // sort the non zeros: - ColMajorMatrix resCol(resRow); - res = resCol; - } -}; - -} // end namespace internal - - -namespace internal { - -template -static void sparse_sparse_to_dense_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res) -{ - typedef typename remove_all::type::Scalar LhsScalar; - typedef typename remove_all::type::Scalar RhsScalar; - Index cols = rhs.outerSize(); - eigen_assert(lhs.outerSize() == rhs.innerSize()); - - evaluator lhsEval(lhs); - evaluator rhsEval(rhs); - - for (Index j=0; j::InnerIterator rhsIt(rhsEval, j); rhsIt; ++rhsIt) - { - RhsScalar y = rhsIt.value(); - Index k = rhsIt.index(); - for (typename evaluator::InnerIterator lhsIt(lhsEval, k); lhsIt; ++lhsIt) - { - Index i = lhsIt.index(); - LhsScalar x = lhsIt.value(); - res.coeffRef(i,j) += x * y; - } - } - } -} - - -} // end namespace internal - -namespace internal { - -template::Flags&RowMajorBit) ? RowMajor : ColMajor, - int RhsStorageOrder = (traits::Flags&RowMajorBit) ? RowMajor : ColMajor> -struct sparse_sparse_to_dense_product_selector; - -template -struct sparse_sparse_to_dense_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - internal::sparse_sparse_to_dense_product_impl(lhs, rhs, res); - } -}; - -template -struct sparse_sparse_to_dense_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix ColMajorLhs; - ColMajorLhs lhsCol(lhs); - internal::sparse_sparse_to_dense_product_impl(lhsCol, rhs, res); - } -}; - -template -struct sparse_sparse_to_dense_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - typedef SparseMatrix ColMajorRhs; - ColMajorRhs rhsCol(rhs); - internal::sparse_sparse_to_dense_product_impl(lhs, rhsCol, res); - } -}; - -template -struct sparse_sparse_to_dense_product_selector -{ - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) - { - Transpose trRes(res); - internal::sparse_sparse_to_dense_product_impl >(rhs, lhs, trRes); - } -}; - - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_CONSERVATIVESPARSESPARSEPRODUCT_H diff --git a/Eigen/src/SparseCore/MappedSparseMatrix.h b/Eigen/src/SparseCore/MappedSparseMatrix.h deleted file mode 100644 index 67718c85b..000000000 --- a/Eigen/src/SparseCore/MappedSparseMatrix.h +++ /dev/null @@ -1,67 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MAPPED_SPARSEMATRIX_H -#define EIGEN_MAPPED_SPARSEMATRIX_H - -namespace Eigen { - -/** \deprecated Use Map > - * \class MappedSparseMatrix - * - * \brief Sparse matrix - * - * \param _Scalar the scalar type, i.e. the type of the coefficients - * - * See http://www.netlib.org/linalg/html_templates/node91.html for details on the storage scheme. - * - */ -namespace internal { -template -struct traits > : traits > -{}; -} // end namespace internal - -template -class MappedSparseMatrix - : public Map > -{ - typedef Map > Base; - - public: - - typedef typename Base::StorageIndex StorageIndex; - typedef typename Base::Scalar Scalar; - - inline MappedSparseMatrix(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr, Scalar* valuePtr, StorageIndex* innerNonZeroPtr = 0) - : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZeroPtr) - {} - - /** Empty destructor */ - inline ~MappedSparseMatrix() {} -}; - -namespace internal { - -template -struct evaluator > - : evaluator > > -{ - typedef MappedSparseMatrix<_Scalar,_Options,_StorageIndex> XprType; - typedef evaluator > Base; - - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -} - -} // end namespace Eigen - -#endif // EIGEN_MAPPED_SPARSEMATRIX_H diff --git a/Eigen/src/SparseCore/SparseAssign.h b/Eigen/src/SparseCore/SparseAssign.h deleted file mode 100644 index 113463258..000000000 --- a/Eigen/src/SparseCore/SparseAssign.h +++ /dev/null @@ -1,216 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEASSIGN_H -#define EIGEN_SPARSEASSIGN_H - -namespace Eigen { - -template -template -Derived& SparseMatrixBase::operator=(const EigenBase &other) -{ - internal::call_assignment_no_alias(derived(), other.derived()); - return derived(); -} - -template -template -Derived& SparseMatrixBase::operator=(const ReturnByValue& other) -{ - // TODO use the evaluator mechanism - other.evalTo(derived()); - return derived(); -} - -template -template -inline Derived& SparseMatrixBase::operator=(const SparseMatrixBase& other) -{ - // by default sparse evaluation do not alias, so we can safely bypass the generic call_assignment routine - internal::Assignment > - ::run(derived(), other.derived(), internal::assign_op()); - return derived(); -} - -template -inline Derived& SparseMatrixBase::operator=(const Derived& other) -{ - internal::call_assignment_no_alias(derived(), other.derived()); - return derived(); -} - -namespace internal { - -template<> -struct storage_kind_to_evaluator_kind { - typedef IteratorBased Kind; -}; - -template<> -struct storage_kind_to_shape { - typedef SparseShape Shape; -}; - -struct Sparse2Sparse {}; -struct Sparse2Dense {}; - -template<> struct AssignmentKind { typedef Sparse2Sparse Kind; }; -template<> struct AssignmentKind { typedef Sparse2Sparse Kind; }; -template<> struct AssignmentKind { typedef Sparse2Dense Kind; }; -template<> struct AssignmentKind { typedef Sparse2Dense Kind; }; - - -template -void assign_sparse_to_sparse(DstXprType &dst, const SrcXprType &src) -{ - typedef typename DstXprType::Scalar Scalar; - typedef internal::evaluator DstEvaluatorType; - typedef internal::evaluator SrcEvaluatorType; - - SrcEvaluatorType srcEvaluator(src); - - const bool transpose = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit); - const Index outerEvaluationSize = (SrcEvaluatorType::Flags&RowMajorBit) ? src.rows() : src.cols(); - if ((!transpose) && src.isRValue()) - { - // eval without temporary - dst.resize(src.rows(), src.cols()); - dst.setZero(); - dst.reserve((std::min)(src.rows()*src.cols(), (std::max)(src.rows(),src.cols())*2)); - for (Index j=0; j::SupportedAccessPatterns & OuterRandomAccessPattern)==OuterRandomAccessPattern) || - (!((DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit)))) && - "the transpose operation is supposed to be handled in SparseMatrix::operator="); - - enum { Flip = (DstEvaluatorType::Flags & RowMajorBit) != (SrcEvaluatorType::Flags & RowMajorBit) }; - - - DstXprType temp(src.rows(), src.cols()); - - temp.reserve((std::min)(src.rows()*src.cols(), (std::max)(src.rows(),src.cols())*2)); - for (Index j=0; j -struct Assignment -{ - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &/*func*/) - { - assign_sparse_to_sparse(dst.derived(), src.derived()); - } -}; - -// Generic Sparse to Dense assignment -template< typename DstXprType, typename SrcXprType, typename Functor> -struct Assignment -{ - static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) - { - if(internal::is_same >::value) - dst.setZero(); - - internal::evaluator srcEval(src); - resize_if_allowed(dst, src, func); - internal::evaluator dstEval(dst); - - const Index outerEvaluationSize = (internal::evaluator::Flags&RowMajorBit) ? src.rows() : src.cols(); - for (Index j=0; j::InnerIterator i(srcEval,j); i; ++i) - func.assignCoeff(dstEval.coeffRef(i.row(),i.col()), i.value()); - } -}; - -// Specialization for "dst = dec.solve(rhs)" -// NOTE we need to specialize it for Sparse2Sparse to avoid ambiguous specialization error -template -struct Assignment, internal::assign_op, Sparse2Sparse> -{ - typedef Solve SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - src.dec()._solve_impl(src.rhs(), dst); - } -}; - -struct Diagonal2Sparse {}; - -template<> struct AssignmentKind { typedef Diagonal2Sparse Kind; }; - -template< typename DstXprType, typename SrcXprType, typename Functor> -struct Assignment -{ - typedef typename DstXprType::StorageIndex StorageIndex; - typedef typename DstXprType::Scalar Scalar; - typedef Array ArrayXI; - typedef Array ArrayXS; - template - static void run(SparseMatrix &dst, const SrcXprType &src, const internal::assign_op &/*func*/) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - Index size = src.diagonal().size(); - dst.makeCompressed(); - dst.resizeNonZeros(size); - Map(dst.innerIndexPtr(), size).setLinSpaced(0,StorageIndex(size)-1); - Map(dst.outerIndexPtr(), size+1).setLinSpaced(0,StorageIndex(size)); - Map(dst.valuePtr(), size) = src.diagonal(); - } - - template - static void run(SparseMatrixBase &dst, const SrcXprType &src, const internal::assign_op &/*func*/) - { - dst.diagonal() = src.diagonal(); - } - - static void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op &/*func*/) - { dst.diagonal() += src.diagonal(); } - - static void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op &/*func*/) - { dst.diagonal() -= src.diagonal(); } -}; -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSEASSIGN_H diff --git a/Eigen/src/SparseCore/SparseBlock.h b/Eigen/src/SparseCore/SparseBlock.h deleted file mode 100644 index 511e92b2f..000000000 --- a/Eigen/src/SparseCore/SparseBlock.h +++ /dev/null @@ -1,603 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_BLOCK_H -#define EIGEN_SPARSE_BLOCK_H - -namespace Eigen { - -// Subset of columns or rows -template -class BlockImpl - : public SparseMatrixBase > -{ - typedef typename internal::remove_all::type _MatrixTypeNested; - typedef Block BlockType; -public: - enum { IsRowMajor = internal::traits::IsRowMajor }; -protected: - enum { OuterSize = IsRowMajor ? BlockRows : BlockCols }; - typedef SparseMatrixBase Base; - using Base::convert_index; -public: - EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType) - - inline BlockImpl(XprType& xpr, Index i) - : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize) - {} - - inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) - : m_matrix(xpr), m_outerStart(convert_index(IsRowMajor ? startRow : startCol)), m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols)) - {} - - EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } - EIGEN_STRONG_INLINE Index cols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); } - - Index nonZeros() const - { - typedef internal::evaluator EvaluatorType; - EvaluatorType matEval(m_matrix); - Index nnz = 0; - Index end = m_outerStart + m_outerSize.value(); - for(Index j=m_outerStart; j::non_const_type m_matrix; - Index m_outerStart; - const internal::variable_if_dynamic m_outerSize; - - protected: - // Disable assignment with clear error message. - // Note that simply removing operator= yields compilation errors with ICC+MSVC - template - BlockImpl& operator=(const T&) - { - EIGEN_STATIC_ASSERT(sizeof(T)==0, THIS_SPARSE_BLOCK_SUBEXPRESSION_IS_READ_ONLY); - return *this; - } -}; - - -/*************************************************************************** -* specialization for SparseMatrix -***************************************************************************/ - -namespace internal { - -template -class sparse_matrix_block_impl - : public SparseCompressedBase > -{ - typedef typename internal::remove_all::type _MatrixTypeNested; - typedef Block BlockType; - typedef SparseCompressedBase > Base; - using Base::convert_index; -public: - enum { IsRowMajor = internal::traits::IsRowMajor }; - EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType) -protected: - typedef typename Base::IndexVector IndexVector; - enum { OuterSize = IsRowMajor ? BlockRows : BlockCols }; -public: - - inline sparse_matrix_block_impl(SparseMatrixType& xpr, Index i) - : m_matrix(xpr), m_outerStart(convert_index(i)), m_outerSize(OuterSize) - {} - - inline sparse_matrix_block_impl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) - : m_matrix(xpr), m_outerStart(convert_index(IsRowMajor ? startRow : startCol)), m_outerSize(convert_index(IsRowMajor ? blockRows : blockCols)) - {} - - template - inline BlockType& operator=(const SparseMatrixBase& other) - { - typedef typename internal::remove_all::type _NestedMatrixType; - _NestedMatrixType& matrix = m_matrix; - // This assignment is slow if this vector set is not empty - // and/or it is not at the end of the nonzeros of the underlying matrix. - - // 1 - eval to a temporary to avoid transposition and/or aliasing issues - Ref > tmp(other.derived()); - eigen_internal_assert(tmp.outerSize()==m_outerSize.value()); - - // 2 - let's check whether there is enough allocated memory - Index nnz = tmp.nonZeros(); - Index start = m_outerStart==0 ? 0 : m_matrix.outerIndexPtr()[m_outerStart]; // starting position of the current block - Index end = m_matrix.outerIndexPtr()[m_outerStart+m_outerSize.value()]; // ending position of the current block - Index block_size = end - start; // available room in the current block - Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end; - - Index free_size = m_matrix.isCompressed() - ? Index(matrix.data().allocatedSize()) + block_size - : block_size; - - Index tmp_start = tmp.outerIndexPtr()[0]; - - bool update_trailing_pointers = false; - if(nnz>free_size) - { - // realloc manually to reduce copies - typename SparseMatrixType::Storage newdata(m_matrix.data().allocatedSize() - block_size + nnz); - - internal::smart_copy(m_matrix.valuePtr(), m_matrix.valuePtr() + start, newdata.valuePtr()); - internal::smart_copy(m_matrix.innerIndexPtr(), m_matrix.innerIndexPtr() + start, newdata.indexPtr()); - - internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, newdata.valuePtr() + start); - internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, newdata.indexPtr() + start); - - internal::smart_copy(matrix.valuePtr()+end, matrix.valuePtr()+end + tail_size, newdata.valuePtr()+start+nnz); - internal::smart_copy(matrix.innerIndexPtr()+end, matrix.innerIndexPtr()+end + tail_size, newdata.indexPtr()+start+nnz); - - newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz); - - matrix.data().swap(newdata); - - update_trailing_pointers = true; - } - else - { - if(m_matrix.isCompressed()) - { - // no need to realloc, simply copy the tail at its respective position and insert tmp - matrix.data().resize(start + nnz + tail_size); - - internal::smart_memmove(matrix.valuePtr()+end, matrix.valuePtr() + end+tail_size, matrix.valuePtr() + start+nnz); - internal::smart_memmove(matrix.innerIndexPtr()+end, matrix.innerIndexPtr() + end+tail_size, matrix.innerIndexPtr() + start+nnz); - - update_trailing_pointers = true; - } - - internal::smart_copy(tmp.valuePtr() + tmp_start, tmp.valuePtr() + tmp_start + nnz, matrix.valuePtr() + start); - internal::smart_copy(tmp.innerIndexPtr() + tmp_start, tmp.innerIndexPtr() + tmp_start + nnz, matrix.innerIndexPtr() + start); - } - - // update outer index pointers and innerNonZeros - if(IsVectorAtCompileTime) - { - if(!m_matrix.isCompressed()) - matrix.innerNonZeroPtr()[m_outerStart] = StorageIndex(nnz); - matrix.outerIndexPtr()[m_outerStart] = StorageIndex(start); - } - else - { - StorageIndex p = StorageIndex(start); - for(Index k=0; k(tmp.innerVector(k).nonZeros()); - if(!m_matrix.isCompressed()) - matrix.innerNonZeroPtr()[m_outerStart+k] = nnz_k; - matrix.outerIndexPtr()[m_outerStart+k] = p; - p += nnz_k; - } - } - - if(update_trailing_pointers) - { - StorageIndex offset = internal::convert_index(nnz - block_size); - for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k) - { - matrix.outerIndexPtr()[k] += offset; - } - } - - return derived(); - } - - inline BlockType& operator=(const BlockType& other) - { - return operator=(other); - } - - inline const Scalar* valuePtr() const - { return m_matrix.valuePtr(); } - inline Scalar* valuePtr() - { return m_matrix.valuePtr(); } - - inline const StorageIndex* innerIndexPtr() const - { return m_matrix.innerIndexPtr(); } - inline StorageIndex* innerIndexPtr() - { return m_matrix.innerIndexPtr(); } - - inline const StorageIndex* outerIndexPtr() const - { return m_matrix.outerIndexPtr() + m_outerStart; } - inline StorageIndex* outerIndexPtr() - { return m_matrix.outerIndexPtr() + m_outerStart; } - - inline const StorageIndex* innerNonZeroPtr() const - { return isCompressed() ? 0 : (m_matrix.innerNonZeroPtr()+m_outerStart); } - inline StorageIndex* innerNonZeroPtr() - { return isCompressed() ? 0 : (m_matrix.innerNonZeroPtr()+m_outerStart); } - - bool isCompressed() const { return m_matrix.innerNonZeroPtr()==0; } - - inline Scalar& coeffRef(Index row, Index col) - { - return m_matrix.coeffRef(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart)); - } - - inline const Scalar coeff(Index row, Index col) const - { - return m_matrix.coeff(row + (IsRowMajor ? m_outerStart : 0), col + (IsRowMajor ? 0 : m_outerStart)); - } - - inline const Scalar coeff(Index index) const - { - return m_matrix.coeff(IsRowMajor ? m_outerStart : index, IsRowMajor ? index : m_outerStart); - } - - const Scalar& lastCoeff() const - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(sparse_matrix_block_impl); - eigen_assert(Base::nonZeros()>0); - if(m_matrix.isCompressed()) - return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart+1]-1]; - else - return m_matrix.valuePtr()[m_matrix.outerIndexPtr()[m_outerStart]+m_matrix.innerNonZeroPtr()[m_outerStart]-1]; - } - - EIGEN_STRONG_INLINE Index rows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } - EIGEN_STRONG_INLINE Index cols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); } - - inline const SparseMatrixType& nestedExpression() const { return m_matrix; } - inline SparseMatrixType& nestedExpression() { return m_matrix; } - Index startRow() const { return IsRowMajor ? m_outerStart : 0; } - Index startCol() const { return IsRowMajor ? 0 : m_outerStart; } - Index blockRows() const { return IsRowMajor ? m_outerSize.value() : m_matrix.rows(); } - Index blockCols() const { return IsRowMajor ? m_matrix.cols() : m_outerSize.value(); } - - protected: - - typename internal::ref_selector::non_const_type m_matrix; - Index m_outerStart; - const internal::variable_if_dynamic m_outerSize; - -}; - -} // namespace internal - -template -class BlockImpl,BlockRows,BlockCols,true,Sparse> - : public internal::sparse_matrix_block_impl,BlockRows,BlockCols> -{ -public: - typedef _StorageIndex StorageIndex; - typedef SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType; - typedef internal::sparse_matrix_block_impl Base; - inline BlockImpl(SparseMatrixType& xpr, Index i) - : Base(xpr, i) - {} - - inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) - : Base(xpr, startRow, startCol, blockRows, blockCols) - {} - - using Base::operator=; -}; - -template -class BlockImpl,BlockRows,BlockCols,true,Sparse> - : public internal::sparse_matrix_block_impl,BlockRows,BlockCols> -{ -public: - typedef _StorageIndex StorageIndex; - typedef const SparseMatrix<_Scalar, _Options, _StorageIndex> SparseMatrixType; - typedef internal::sparse_matrix_block_impl Base; - inline BlockImpl(SparseMatrixType& xpr, Index i) - : Base(xpr, i) - {} - - inline BlockImpl(SparseMatrixType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) - : Base(xpr, startRow, startCol, blockRows, blockCols) - {} - - using Base::operator=; -private: - template BlockImpl(const SparseMatrixBase& xpr, Index i); - template BlockImpl(const SparseMatrixBase& xpr); -}; - -//---------- - -/** \returns the \a outer -th column (resp. row) of the matrix \c *this if \c *this - * is col-major (resp. row-major). - */ -template -typename SparseMatrixBase::InnerVectorReturnType SparseMatrixBase::innerVector(Index outer) -{ return InnerVectorReturnType(derived(), outer); } - -/** \returns the \a outer -th column (resp. row) of the matrix \c *this if \c *this - * is col-major (resp. row-major). Read-only. - */ -template -const typename SparseMatrixBase::ConstInnerVectorReturnType SparseMatrixBase::innerVector(Index outer) const -{ return ConstInnerVectorReturnType(derived(), outer); } - -/** \returns the \a outer -th column (resp. row) of the matrix \c *this if \c *this - * is col-major (resp. row-major). - */ -template -typename SparseMatrixBase::InnerVectorsReturnType -SparseMatrixBase::innerVectors(Index outerStart, Index outerSize) -{ - return Block(derived(), - IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart, - IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize); - -} - -/** \returns the \a outer -th column (resp. row) of the matrix \c *this if \c *this - * is col-major (resp. row-major). Read-only. - */ -template -const typename SparseMatrixBase::ConstInnerVectorsReturnType -SparseMatrixBase::innerVectors(Index outerStart, Index outerSize) const -{ - return Block(derived(), - IsRowMajor ? outerStart : 0, IsRowMajor ? 0 : outerStart, - IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize); - -} - -/** Generic implementation of sparse Block expression. - * Real-only. - */ -template -class BlockImpl - : public SparseMatrixBase >, internal::no_assignment_operator -{ - typedef Block BlockType; - typedef SparseMatrixBase Base; - using Base::convert_index; -public: - enum { IsRowMajor = internal::traits::IsRowMajor }; - EIGEN_SPARSE_PUBLIC_INTERFACE(BlockType) - - typedef typename internal::remove_all::type _MatrixTypeNested; - - /** Column or Row constructor - */ - inline BlockImpl(XprType& xpr, Index i) - : m_matrix(xpr), - m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? convert_index(i) : 0), - m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? convert_index(i) : 0), - m_blockRows(BlockRows==1 ? 1 : xpr.rows()), - m_blockCols(BlockCols==1 ? 1 : xpr.cols()) - {} - - /** Dynamic-size constructor - */ - inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) - : m_matrix(xpr), m_startRow(convert_index(startRow)), m_startCol(convert_index(startCol)), m_blockRows(convert_index(blockRows)), m_blockCols(convert_index(blockCols)) - {} - - inline Index rows() const { return m_blockRows.value(); } - inline Index cols() const { return m_blockCols.value(); } - - inline Scalar& coeffRef(Index row, Index col) - { - return m_matrix.coeffRef(row + m_startRow.value(), col + m_startCol.value()); - } - - inline const Scalar coeff(Index row, Index col) const - { - return m_matrix.coeff(row + m_startRow.value(), col + m_startCol.value()); - } - - inline Scalar& coeffRef(Index index) - { - return m_matrix.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), - m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); - } - - inline const Scalar coeff(Index index) const - { - return m_matrix.coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), - m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); - } - - inline const XprType& nestedExpression() const { return m_matrix; } - inline XprType& nestedExpression() { return m_matrix; } - Index startRow() const { return m_startRow.value(); } - Index startCol() const { return m_startCol.value(); } - Index blockRows() const { return m_blockRows.value(); } - Index blockCols() const { return m_blockCols.value(); } - - protected: -// friend class internal::GenericSparseBlockInnerIteratorImpl; - friend struct internal::unary_evaluator, internal::IteratorBased, Scalar >; - - Index nonZeros() const { return Dynamic; } - - typename internal::ref_selector::non_const_type m_matrix; - const internal::variable_if_dynamic m_startRow; - const internal::variable_if_dynamic m_startCol; - const internal::variable_if_dynamic m_blockRows; - const internal::variable_if_dynamic m_blockCols; - - protected: - // Disable assignment with clear error message. - // Note that simply removing operator= yields compilation errors with ICC+MSVC - template - BlockImpl& operator=(const T&) - { - EIGEN_STATIC_ASSERT(sizeof(T)==0, THIS_SPARSE_BLOCK_SUBEXPRESSION_IS_READ_ONLY); - return *this; - } - -}; - -namespace internal { - -template -struct unary_evaluator, IteratorBased > - : public evaluator_base > -{ - class InnerVectorInnerIterator; - class OuterVectorInnerIterator; - public: - typedef Block XprType; - typedef typename XprType::StorageIndex StorageIndex; - typedef typename XprType::Scalar Scalar; - - enum { - IsRowMajor = XprType::IsRowMajor, - - OuterVector = (BlockCols==1 && ArgType::IsRowMajor) - | // FIXME | instead of || to please GCC 4.4.0 stupid warning "suggest parentheses around &&". - // revert to || as soon as not needed anymore. - (BlockRows==1 && !ArgType::IsRowMajor), - - CoeffReadCost = evaluator::CoeffReadCost, - Flags = XprType::Flags - }; - - typedef typename internal::conditional::type InnerIterator; - - explicit unary_evaluator(const XprType& op) - : m_argImpl(op.nestedExpression()), m_block(op) - {} - - inline Index nonZerosEstimate() const { - Index nnz = m_block.nonZeros(); - if(nnz<0) - return m_argImpl.nonZerosEstimate() * m_block.size() / m_block.nestedExpression().size(); - return nnz; - } - - protected: - typedef typename evaluator::InnerIterator EvalIterator; - - evaluator m_argImpl; - const XprType &m_block; -}; - -template -class unary_evaluator, IteratorBased>::InnerVectorInnerIterator - : public EvalIterator -{ - enum { IsRowMajor = unary_evaluator::IsRowMajor }; - const XprType& m_block; - Index m_end; -public: - - EIGEN_STRONG_INLINE InnerVectorInnerIterator(const unary_evaluator& aEval, Index outer) - : EvalIterator(aEval.m_argImpl, outer + (IsRowMajor ? aEval.m_block.startRow() : aEval.m_block.startCol())), - m_block(aEval.m_block), - m_end(IsRowMajor ? aEval.m_block.startCol()+aEval.m_block.blockCols() : aEval.m_block.startRow()+aEval.m_block.blockRows()) - { - while( (EvalIterator::operator bool()) && (EvalIterator::index() < (IsRowMajor ? m_block.startCol() : m_block.startRow())) ) - EvalIterator::operator++(); - } - - inline StorageIndex index() const { return EvalIterator::index() - convert_index(IsRowMajor ? m_block.startCol() : m_block.startRow()); } - inline Index outer() const { return EvalIterator::outer() - (IsRowMajor ? m_block.startRow() : m_block.startCol()); } - inline Index row() const { return EvalIterator::row() - m_block.startRow(); } - inline Index col() const { return EvalIterator::col() - m_block.startCol(); } - - inline operator bool() const { return EvalIterator::operator bool() && EvalIterator::index() < m_end; } -}; - -template -class unary_evaluator, IteratorBased>::OuterVectorInnerIterator -{ - enum { IsRowMajor = unary_evaluator::IsRowMajor }; - const unary_evaluator& m_eval; - Index m_outerPos; - const Index m_innerIndex; - Index m_end; - EvalIterator m_it; -public: - - EIGEN_STRONG_INLINE OuterVectorInnerIterator(const unary_evaluator& aEval, Index outer) - : m_eval(aEval), - m_outerPos( (IsRowMajor ? aEval.m_block.startCol() : aEval.m_block.startRow()) ), - m_innerIndex(IsRowMajor ? aEval.m_block.startRow() : aEval.m_block.startCol()), - m_end(IsRowMajor ? aEval.m_block.startCol()+aEval.m_block.blockCols() : aEval.m_block.startRow()+aEval.m_block.blockRows()), - m_it(m_eval.m_argImpl, m_outerPos) - { - EIGEN_UNUSED_VARIABLE(outer); - eigen_assert(outer==0); - - while(m_it && m_it.index() < m_innerIndex) ++m_it; - if((!m_it) || (m_it.index()!=m_innerIndex)) - ++(*this); - } - - inline StorageIndex index() const { return convert_index(m_outerPos - (IsRowMajor ? m_eval.m_block.startCol() : m_eval.m_block.startRow())); } - inline Index outer() const { return 0; } - inline Index row() const { return IsRowMajor ? 0 : index(); } - inline Index col() const { return IsRowMajor ? index() : 0; } - - inline Scalar value() const { return m_it.value(); } - inline Scalar& valueRef() { return m_it.valueRef(); } - - inline OuterVectorInnerIterator& operator++() - { - // search next non-zero entry - while(++m_outerPos -struct unary_evaluator,BlockRows,BlockCols,true>, IteratorBased> - : evaluator,BlockRows,BlockCols,true> > > -{ - typedef Block,BlockRows,BlockCols,true> XprType; - typedef evaluator > Base; - explicit unary_evaluator(const XprType &xpr) : Base(xpr) {} -}; - -template -struct unary_evaluator,BlockRows,BlockCols,true>, IteratorBased> - : evaluator,BlockRows,BlockCols,true> > > -{ - typedef Block,BlockRows,BlockCols,true> XprType; - typedef evaluator > Base; - explicit unary_evaluator(const XprType &xpr) : Base(xpr) {} -}; - -} // end namespace internal - - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_BLOCK_H diff --git a/Eigen/src/SparseCore/SparseColEtree.h b/Eigen/src/SparseCore/SparseColEtree.h deleted file mode 100644 index ebe02d1ab..000000000 --- a/Eigen/src/SparseCore/SparseColEtree.h +++ /dev/null @@ -1,206 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 D̩sir̩ Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -/* - - * NOTE: This file is the modified version of sp_coletree.c file in SuperLU - - * -- SuperLU routine (version 3.1) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * August 1, 2008 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSE_COLETREE_H -#define SPARSE_COLETREE_H - -namespace Eigen { - -namespace internal { - -/** Find the root of the tree/set containing the vertex i : Use Path halving */ -template -Index etree_find (Index i, IndexVector& pp) -{ - Index p = pp(i); // Parent - Index gp = pp(p); // Grand parent - while (gp != p) - { - pp(i) = gp; // Parent pointer on find path is changed to former grand parent - i = gp; - p = pp(i); - gp = pp(p); - } - return p; -} - -/** Compute the column elimination tree of a sparse matrix - * \param mat The matrix in column-major format. - * \param parent The elimination tree - * \param firstRowElt The column index of the first element in each row - * \param perm The permutation to apply to the column of \b mat - */ -template -int coletree(const MatrixType& mat, IndexVector& parent, IndexVector& firstRowElt, typename MatrixType::StorageIndex *perm=0) -{ - typedef typename MatrixType::StorageIndex StorageIndex; - StorageIndex nc = convert_index(mat.cols()); // Number of columns - StorageIndex m = convert_index(mat.rows()); - StorageIndex diagSize = (std::min)(nc,m); - IndexVector root(nc); // root of subtree of etree - root.setZero(); - IndexVector pp(nc); // disjoint sets - pp.setZero(); // Initialize disjoint sets - parent.resize(mat.cols()); - //Compute first nonzero column in each row - firstRowElt.resize(m); - firstRowElt.setConstant(nc); - firstRowElt.segment(0, diagSize).setLinSpaced(diagSize, 0, diagSize-1); - bool found_diag; - for (StorageIndex col = 0; col < nc; col++) - { - StorageIndex pcol = col; - if(perm) pcol = perm[col]; - for (typename MatrixType::InnerIterator it(mat, pcol); it; ++it) - { - Index row = it.row(); - firstRowElt(row) = (std::min)(firstRowElt(row), col); - } - } - /* Compute etree by Liu's algorithm for symmetric matrices, - except use (firstRowElt[r],c) in place of an edge (r,c) of A. - Thus each row clique in A'*A is replaced by a star - centered at its first vertex, which has the same fill. */ - StorageIndex rset, cset, rroot; - for (StorageIndex col = 0; col < nc; col++) - { - found_diag = col>=m; - pp(col) = col; - cset = col; - root(cset) = col; - parent(col) = nc; - /* The diagonal element is treated here even if it does not exist in the matrix - * hence the loop is executed once more */ - StorageIndex pcol = col; - if(perm) pcol = perm[col]; - for (typename MatrixType::InnerIterator it(mat, pcol); it||!found_diag; ++it) - { // A sequence of interleaved find and union is performed - Index i = col; - if(it) i = it.index(); - if (i == col) found_diag = true; - - StorageIndex row = firstRowElt(i); - if (row >= col) continue; - rset = internal::etree_find(row, pp); // Find the name of the set containing row - rroot = root(rset); - if (rroot != col) - { - parent(rroot) = col; - pp(cset) = rset; - cset = rset; - root(cset) = col; - } - } - } - return 0; -} - -/** - * Depth-first search from vertex n. No recursion. - * This routine was contributed by C̩dric Doucet, CEDRAT Group, Meylan, France. -*/ -template -void nr_etdfs (typename IndexVector::Scalar n, IndexVector& parent, IndexVector& first_kid, IndexVector& next_kid, IndexVector& post, typename IndexVector::Scalar postnum) -{ - typedef typename IndexVector::Scalar StorageIndex; - StorageIndex current = n, first, next; - while (postnum != n) - { - // No kid for the current node - first = first_kid(current); - - // no kid for the current node - if (first == -1) - { - // Numbering this node because it has no kid - post(current) = postnum++; - - // looking for the next kid - next = next_kid(current); - while (next == -1) - { - // No more kids : back to the parent node - current = parent(current); - // numbering the parent node - post(current) = postnum++; - - // Get the next kid - next = next_kid(current); - } - // stopping criterion - if (postnum == n+1) return; - - // Updating current node - current = next; - } - else - { - current = first; - } - } -} - - -/** - * \brief Post order a tree - * \param n the number of nodes - * \param parent Input tree - * \param post postordered tree - */ -template -void treePostorder(typename IndexVector::Scalar n, IndexVector& parent, IndexVector& post) -{ - typedef typename IndexVector::Scalar StorageIndex; - IndexVector first_kid, next_kid; // Linked list of children - StorageIndex postnum; - // Allocate storage for working arrays and results - first_kid.resize(n+1); - next_kid.setZero(n+1); - post.setZero(n+1); - - // Set up structure describing children - first_kid.setConstant(-1); - for (StorageIndex v = n-1; v >= 0; v--) - { - StorageIndex dad = parent(v); - next_kid(v) = first_kid(dad); - first_kid(dad) = v; - } - - // Depth-first search from dummy root vertex #n - postnum = 0; - internal::nr_etdfs(n, parent, first_kid, next_kid, post, postnum); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // SPARSE_COLETREE_H diff --git a/Eigen/src/SparseCore/SparseCompressedBase.h b/Eigen/src/SparseCore/SparseCompressedBase.h deleted file mode 100644 index e0b3c22b6..000000000 --- a/Eigen/src/SparseCore/SparseCompressedBase.h +++ /dev/null @@ -1,357 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_COMPRESSED_BASE_H -#define EIGEN_SPARSE_COMPRESSED_BASE_H - -namespace Eigen { - -template class SparseCompressedBase; - -namespace internal { - -template -struct traits > : traits -{}; - -} // end namespace internal - -/** \ingroup SparseCore_Module - * \class SparseCompressedBase - * \brief Common base class for sparse [compressed]-{row|column}-storage format. - * - * This class defines the common interface for all derived classes implementing the compressed sparse storage format, such as: - * - SparseMatrix - * - Ref - * - Map - * - */ -template -class SparseCompressedBase - : public SparseMatrixBase -{ - public: - typedef SparseMatrixBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(SparseCompressedBase) - using Base::operator=; - using Base::IsRowMajor; - - class InnerIterator; - class ReverseInnerIterator; - - protected: - typedef typename Base::IndexVector IndexVector; - Eigen::Map innerNonZeros() { return Eigen::Map(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); } - const Eigen::Map innerNonZeros() const { return Eigen::Map(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); } - - public: - - /** \returns the number of non zero coefficients */ - inline Index nonZeros() const - { - if(Derived::IsVectorAtCompileTime && outerIndexPtr()==0) - return derived().nonZeros(); - else if(isCompressed()) - return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0]; - else if(derived().outerSize()==0) - return 0; - else - return innerNonZeros().sum(); - } - - /** \returns a const pointer to the array of values. - * This function is aimed at interoperability with other libraries. - * \sa innerIndexPtr(), outerIndexPtr() */ - inline const Scalar* valuePtr() const { return derived().valuePtr(); } - /** \returns a non-const pointer to the array of values. - * This function is aimed at interoperability with other libraries. - * \sa innerIndexPtr(), outerIndexPtr() */ - inline Scalar* valuePtr() { return derived().valuePtr(); } - - /** \returns a const pointer to the array of inner indices. - * This function is aimed at interoperability with other libraries. - * \sa valuePtr(), outerIndexPtr() */ - inline const StorageIndex* innerIndexPtr() const { return derived().innerIndexPtr(); } - /** \returns a non-const pointer to the array of inner indices. - * This function is aimed at interoperability with other libraries. - * \sa valuePtr(), outerIndexPtr() */ - inline StorageIndex* innerIndexPtr() { return derived().innerIndexPtr(); } - - /** \returns a const pointer to the array of the starting positions of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \warning it returns the null pointer 0 for SparseVector - * \sa valuePtr(), innerIndexPtr() */ - inline const StorageIndex* outerIndexPtr() const { return derived().outerIndexPtr(); } - /** \returns a non-const pointer to the array of the starting positions of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \warning it returns the null pointer 0 for SparseVector - * \sa valuePtr(), innerIndexPtr() */ - inline StorageIndex* outerIndexPtr() { return derived().outerIndexPtr(); } - - /** \returns a const pointer to the array of the number of non zeros of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \warning it returns the null pointer 0 in compressed mode */ - inline const StorageIndex* innerNonZeroPtr() const { return derived().innerNonZeroPtr(); } - /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \warning it returns the null pointer 0 in compressed mode */ - inline StorageIndex* innerNonZeroPtr() { return derived().innerNonZeroPtr(); } - - /** \returns whether \c *this is in compressed form. */ - inline bool isCompressed() const { return innerNonZeroPtr()==0; } - - /** \returns a read-only view of the stored coefficients as a 1D array expression. - * - * \warning this method is for \b compressed \b storage \b only, and it will trigger an assertion otherwise. - * - * \sa valuePtr(), isCompressed() */ - const Map > coeffs() const { eigen_assert(isCompressed()); return Array::Map(valuePtr(),nonZeros()); } - - /** \returns a read-write view of the stored coefficients as a 1D array expression - * - * \warning this method is for \b compressed \b storage \b only, and it will trigger an assertion otherwise. - * - * Here is an example: - * \include SparseMatrix_coeffs.cpp - * and the output is: - * \include SparseMatrix_coeffs.out - * - * \sa valuePtr(), isCompressed() */ - Map > coeffs() { eigen_assert(isCompressed()); return Array::Map(valuePtr(),nonZeros()); } - - protected: - /** Default constructor. Do nothing. */ - SparseCompressedBase() {} - private: - template explicit SparseCompressedBase(const SparseCompressedBase&); -}; - -template -class SparseCompressedBase::InnerIterator -{ - public: - InnerIterator() - : m_values(0), m_indices(0), m_outer(0), m_id(0), m_end(0) - {} - - InnerIterator(const InnerIterator& other) - : m_values(other.m_values), m_indices(other.m_indices), m_outer(other.m_outer), m_id(other.m_id), m_end(other.m_end) - {} - - InnerIterator& operator=(const InnerIterator& other) - { - m_values = other.m_values; - m_indices = other.m_indices; - const_cast(m_outer).setValue(other.m_outer.value()); - m_id = other.m_id; - m_end = other.m_end; - return *this; - } - - InnerIterator(const SparseCompressedBase& mat, Index outer) - : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer) - { - if(Derived::IsVectorAtCompileTime && mat.outerIndexPtr()==0) - { - m_id = 0; - m_end = mat.nonZeros(); - } - else - { - m_id = mat.outerIndexPtr()[outer]; - if(mat.isCompressed()) - m_end = mat.outerIndexPtr()[outer+1]; - else - m_end = m_id + mat.innerNonZeroPtr()[outer]; - } - } - - explicit InnerIterator(const SparseCompressedBase& mat) - : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_id(0), m_end(mat.nonZeros()) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); - } - - explicit InnerIterator(const internal::CompressedStorage& data) - : m_values(data.valuePtr()), m_indices(data.indexPtr()), m_outer(0), m_id(0), m_end(data.size()) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); - } - - inline InnerIterator& operator++() { m_id++; return *this; } - inline InnerIterator& operator+=(Index i) { m_id += i ; return *this; } - - inline InnerIterator operator+(Index i) - { - InnerIterator result = *this; - result += i; - return result; - } - - inline const Scalar& value() const { return m_values[m_id]; } - inline Scalar& valueRef() { return const_cast(m_values[m_id]); } - - inline StorageIndex index() const { return m_indices[m_id]; } - inline Index outer() const { return m_outer.value(); } - inline Index row() const { return IsRowMajor ? m_outer.value() : index(); } - inline Index col() const { return IsRowMajor ? index() : m_outer.value(); } - - inline operator bool() const { return (m_id < m_end); } - - protected: - const Scalar* m_values; - const StorageIndex* m_indices; - typedef internal::variable_if_dynamic OuterType; - const OuterType m_outer; - Index m_id; - Index m_end; - private: - // If you get here, then you're not using the right InnerIterator type, e.g.: - // SparseMatrix A; - // SparseMatrix::InnerIterator it(A,0); - template InnerIterator(const SparseMatrixBase&, Index outer); -}; - -template -class SparseCompressedBase::ReverseInnerIterator -{ - public: - ReverseInnerIterator(const SparseCompressedBase& mat, Index outer) - : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(outer) - { - if(Derived::IsVectorAtCompileTime && mat.outerIndexPtr()==0) - { - m_start = 0; - m_id = mat.nonZeros(); - } - else - { - m_start = mat.outerIndexPtr()[outer]; - if(mat.isCompressed()) - m_id = mat.outerIndexPtr()[outer+1]; - else - m_id = m_start + mat.innerNonZeroPtr()[outer]; - } - } - - explicit ReverseInnerIterator(const SparseCompressedBase& mat) - : m_values(mat.valuePtr()), m_indices(mat.innerIndexPtr()), m_outer(0), m_start(0), m_id(mat.nonZeros()) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); - } - - explicit ReverseInnerIterator(const internal::CompressedStorage& data) - : m_values(data.valuePtr()), m_indices(data.indexPtr()), m_outer(0), m_start(0), m_id(data.size()) - { - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived); - } - - inline ReverseInnerIterator& operator--() { --m_id; return *this; } - inline ReverseInnerIterator& operator-=(Index i) { m_id -= i; return *this; } - - inline ReverseInnerIterator operator-(Index i) - { - ReverseInnerIterator result = *this; - result -= i; - return result; - } - - inline const Scalar& value() const { return m_values[m_id-1]; } - inline Scalar& valueRef() { return const_cast(m_values[m_id-1]); } - - inline StorageIndex index() const { return m_indices[m_id-1]; } - inline Index outer() const { return m_outer.value(); } - inline Index row() const { return IsRowMajor ? m_outer.value() : index(); } - inline Index col() const { return IsRowMajor ? index() : m_outer.value(); } - - inline operator bool() const { return (m_id > m_start); } - - protected: - const Scalar* m_values; - const StorageIndex* m_indices; - typedef internal::variable_if_dynamic OuterType; - const OuterType m_outer; - Index m_start; - Index m_id; -}; - -namespace internal { - -template -struct evaluator > - : evaluator_base -{ - typedef typename Derived::Scalar Scalar; - typedef typename Derived::InnerIterator InnerIterator; - - enum { - CoeffReadCost = NumTraits::ReadCost, - Flags = Derived::Flags - }; - - evaluator() : m_matrix(0), m_zero(0) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - explicit evaluator(const Derived &mat) : m_matrix(&mat), m_zero(0) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_matrix->nonZeros(); - } - - operator Derived&() { return m_matrix->const_cast_derived(); } - operator const Derived&() const { return *m_matrix; } - - typedef typename DenseCoeffsBase::CoeffReturnType CoeffReturnType; - const Scalar& coeff(Index row, Index col) const - { - Index p = find(row,col); - - if(p==Dynamic) - return m_zero; - else - return m_matrix->const_cast_derived().valuePtr()[p]; - } - - Scalar& coeffRef(Index row, Index col) - { - Index p = find(row,col); - eigen_assert(p!=Dynamic && "written coefficient does not exist"); - return m_matrix->const_cast_derived().valuePtr()[p]; - } - -protected: - - Index find(Index row, Index col) const - { - eigen_internal_assert(row>=0 && rowrows() && col>=0 && colcols()); - - const Index outer = Derived::IsRowMajor ? row : col; - const Index inner = Derived::IsRowMajor ? col : row; - - Index start = m_matrix->outerIndexPtr()[outer]; - Index end = m_matrix->isCompressed() ? m_matrix->outerIndexPtr()[outer+1] : m_matrix->outerIndexPtr()[outer] + m_matrix->innerNonZeroPtr()[outer]; - eigen_assert(end>=start && "you are using a non finalized sparse matrix or written coefficient does not exist"); - const Index p = std::lower_bound(m_matrix->innerIndexPtr()+start, m_matrix->innerIndexPtr()+end,inner) - m_matrix->innerIndexPtr(); - - return ((pinnerIndexPtr()[p]==inner)) ? p : Dynamic; - } - - const Derived *m_matrix; - const Scalar m_zero; -}; - -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_COMPRESSED_BASE_H diff --git a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h b/Eigen/src/SparseCore/SparseCwiseBinaryOp.h deleted file mode 100644 index c41c07af1..000000000 --- a/Eigen/src/SparseCore/SparseCwiseBinaryOp.h +++ /dev/null @@ -1,722 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_CWISE_BINARY_OP_H -#define EIGEN_SPARSE_CWISE_BINARY_OP_H - -namespace Eigen { - -// Here we have to handle 3 cases: -// 1 - sparse op dense -// 2 - dense op sparse -// 3 - sparse op sparse -// We also need to implement a 4th iterator for: -// 4 - dense op dense -// Finally, we also need to distinguish between the product and other operations : -// configuration returned mode -// 1 - sparse op dense product sparse -// generic dense -// 2 - dense op sparse product sparse -// generic dense -// 3 - sparse op sparse product sparse -// generic sparse -// 4 - dense op dense product dense -// generic dense -// -// TODO to ease compiler job, we could specialize product/quotient with a scalar -// and fallback to cwise-unary evaluator using bind1st_op and bind2nd_op. - -template -class CwiseBinaryOpImpl - : public SparseMatrixBase > -{ - public: - typedef CwiseBinaryOp Derived; - typedef SparseMatrixBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Derived) - CwiseBinaryOpImpl() - { - EIGEN_STATIC_ASSERT(( - (!internal::is_same::StorageKind, - typename internal::traits::StorageKind>::value) - || ((internal::evaluator::Flags&RowMajorBit) == (internal::evaluator::Flags&RowMajorBit))), - THE_STORAGE_ORDER_OF_BOTH_SIDES_MUST_MATCH); - } -}; - -namespace internal { - - -// Generic "sparse OP sparse" -template struct binary_sparse_evaluator; - -template -struct binary_evaluator, IteratorBased, IteratorBased> - : evaluator_base > -{ -protected: - typedef typename evaluator::InnerIterator LhsIterator; - typedef typename evaluator::InnerIterator RhsIterator; - typedef CwiseBinaryOp XprType; - typedef typename traits::Scalar Scalar; - typedef typename XprType::StorageIndex StorageIndex; -public: - - class InnerIterator - { - public: - - EIGEN_STRONG_INLINE InnerIterator(const binary_evaluator& aEval, Index outer) - : m_lhsIter(aEval.m_lhsImpl,outer), m_rhsIter(aEval.m_rhsImpl,outer), m_functor(aEval.m_functor) - { - this->operator++(); - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - if (m_lhsIter && m_rhsIter && (m_lhsIter.index() == m_rhsIter.index())) - { - m_id = m_lhsIter.index(); - m_value = m_functor(m_lhsIter.value(), m_rhsIter.value()); - ++m_lhsIter; - ++m_rhsIter; - } - else if (m_lhsIter && (!m_rhsIter || (m_lhsIter.index() < m_rhsIter.index()))) - { - m_id = m_lhsIter.index(); - m_value = m_functor(m_lhsIter.value(), Scalar(0)); - ++m_lhsIter; - } - else if (m_rhsIter && (!m_lhsIter || (m_lhsIter.index() > m_rhsIter.index()))) - { - m_id = m_rhsIter.index(); - m_value = m_functor(Scalar(0), m_rhsIter.value()); - ++m_rhsIter; - } - else - { - m_value = 0; // this is to avoid a compilation warning - m_id = -1; - } - return *this; - } - - EIGEN_STRONG_INLINE Scalar value() const { return m_value; } - - EIGEN_STRONG_INLINE StorageIndex index() const { return m_id; } - EIGEN_STRONG_INLINE Index outer() const { return m_lhsIter.outer(); } - EIGEN_STRONG_INLINE Index row() const { return Lhs::IsRowMajor ? m_lhsIter.row() : index(); } - EIGEN_STRONG_INLINE Index col() const { return Lhs::IsRowMajor ? index() : m_lhsIter.col(); } - - EIGEN_STRONG_INLINE operator bool() const { return m_id>=0; } - - protected: - LhsIterator m_lhsIter; - RhsIterator m_rhsIter; - const BinaryOp& m_functor; - Scalar m_value; - StorageIndex m_id; - }; - - - enum { - CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit binary_evaluator(const XprType& xpr) - : m_functor(xpr.functor()), - m_lhsImpl(xpr.lhs()), - m_rhsImpl(xpr.rhs()) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_lhsImpl.nonZerosEstimate() + m_rhsImpl.nonZerosEstimate(); - } - -protected: - const BinaryOp m_functor; - evaluator m_lhsImpl; - evaluator m_rhsImpl; -}; - -// dense op sparse -template -struct binary_evaluator, IndexBased, IteratorBased> - : evaluator_base > -{ -protected: - typedef typename evaluator::InnerIterator RhsIterator; - typedef CwiseBinaryOp XprType; - typedef typename traits::Scalar Scalar; - typedef typename XprType::StorageIndex StorageIndex; -public: - - class InnerIterator - { - enum { IsRowMajor = (int(Rhs::Flags)&RowMajorBit)==RowMajorBit }; - public: - - EIGEN_STRONG_INLINE InnerIterator(const binary_evaluator& aEval, Index outer) - : m_lhsEval(aEval.m_lhsImpl), m_rhsIter(aEval.m_rhsImpl,outer), m_functor(aEval.m_functor), m_value(0), m_id(-1), m_innerSize(aEval.m_expr.rhs().innerSize()) - { - this->operator++(); - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - ++m_id; - if(m_id &m_lhsEval; - RhsIterator m_rhsIter; - const BinaryOp& m_functor; - Scalar m_value; - StorageIndex m_id; - StorageIndex m_innerSize; - }; - - - enum { - CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit binary_evaluator(const XprType& xpr) - : m_functor(xpr.functor()), - m_lhsImpl(xpr.lhs()), - m_rhsImpl(xpr.rhs()), - m_expr(xpr) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_expr.size(); - } - -protected: - const BinaryOp m_functor; - evaluator m_lhsImpl; - evaluator m_rhsImpl; - const XprType &m_expr; -}; - -// sparse op dense -template -struct binary_evaluator, IteratorBased, IndexBased> - : evaluator_base > -{ -protected: - typedef typename evaluator::InnerIterator LhsIterator; - typedef CwiseBinaryOp XprType; - typedef typename traits::Scalar Scalar; - typedef typename XprType::StorageIndex StorageIndex; -public: - - class InnerIterator - { - enum { IsRowMajor = (int(Lhs::Flags)&RowMajorBit)==RowMajorBit }; - public: - - EIGEN_STRONG_INLINE InnerIterator(const binary_evaluator& aEval, Index outer) - : m_lhsIter(aEval.m_lhsImpl,outer), m_rhsEval(aEval.m_rhsImpl), m_functor(aEval.m_functor), m_value(0), m_id(-1), m_innerSize(aEval.m_expr.lhs().innerSize()) - { - this->operator++(); - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - ++m_id; - if(m_id &m_rhsEval; - const BinaryOp& m_functor; - Scalar m_value; - StorageIndex m_id; - StorageIndex m_innerSize; - }; - - - enum { - CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit binary_evaluator(const XprType& xpr) - : m_functor(xpr.functor()), - m_lhsImpl(xpr.lhs()), - m_rhsImpl(xpr.rhs()), - m_expr(xpr) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_expr.size(); - } - -protected: - const BinaryOp m_functor; - evaluator m_lhsImpl; - evaluator m_rhsImpl; - const XprType &m_expr; -}; - -template::Kind, - typename RhsKind = typename evaluator_traits::Kind, - typename LhsScalar = typename traits::Scalar, - typename RhsScalar = typename traits::Scalar> struct sparse_conjunction_evaluator; - -// "sparse .* sparse" -template -struct binary_evaluator, Lhs, Rhs>, IteratorBased, IteratorBased> - : sparse_conjunction_evaluator, Lhs, Rhs> > -{ - typedef CwiseBinaryOp, Lhs, Rhs> XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; -// "dense .* sparse" -template -struct binary_evaluator, Lhs, Rhs>, IndexBased, IteratorBased> - : sparse_conjunction_evaluator, Lhs, Rhs> > -{ - typedef CwiseBinaryOp, Lhs, Rhs> XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; -// "sparse .* dense" -template -struct binary_evaluator, Lhs, Rhs>, IteratorBased, IndexBased> - : sparse_conjunction_evaluator, Lhs, Rhs> > -{ - typedef CwiseBinaryOp, Lhs, Rhs> XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; - -// "sparse ./ dense" -template -struct binary_evaluator, Lhs, Rhs>, IteratorBased, IndexBased> - : sparse_conjunction_evaluator, Lhs, Rhs> > -{ - typedef CwiseBinaryOp, Lhs, Rhs> XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; - -// "sparse && sparse" -template -struct binary_evaluator, IteratorBased, IteratorBased> - : sparse_conjunction_evaluator > -{ - typedef CwiseBinaryOp XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; -// "dense && sparse" -template -struct binary_evaluator, IndexBased, IteratorBased> - : sparse_conjunction_evaluator > -{ - typedef CwiseBinaryOp XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; -// "sparse && dense" -template -struct binary_evaluator, IteratorBased, IndexBased> - : sparse_conjunction_evaluator > -{ - typedef CwiseBinaryOp XprType; - typedef sparse_conjunction_evaluator Base; - explicit binary_evaluator(const XprType& xpr) : Base(xpr) {} -}; - -// "sparse ^ sparse" -template -struct sparse_conjunction_evaluator - : evaluator_base -{ -protected: - typedef typename XprType::Functor BinaryOp; - typedef typename XprType::Lhs LhsArg; - typedef typename XprType::Rhs RhsArg; - typedef typename evaluator::InnerIterator LhsIterator; - typedef typename evaluator::InnerIterator RhsIterator; - typedef typename XprType::StorageIndex StorageIndex; - typedef typename traits::Scalar Scalar; -public: - - class InnerIterator - { - public: - - EIGEN_STRONG_INLINE InnerIterator(const sparse_conjunction_evaluator& aEval, Index outer) - : m_lhsIter(aEval.m_lhsImpl,outer), m_rhsIter(aEval.m_rhsImpl,outer), m_functor(aEval.m_functor) - { - while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) - { - if (m_lhsIter.index() < m_rhsIter.index()) - ++m_lhsIter; - else - ++m_rhsIter; - } - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - ++m_lhsIter; - ++m_rhsIter; - while (m_lhsIter && m_rhsIter && (m_lhsIter.index() != m_rhsIter.index())) - { - if (m_lhsIter.index() < m_rhsIter.index()) - ++m_lhsIter; - else - ++m_rhsIter; - } - return *this; - } - - EIGEN_STRONG_INLINE Scalar value() const { return m_functor(m_lhsIter.value(), m_rhsIter.value()); } - - EIGEN_STRONG_INLINE StorageIndex index() const { return m_lhsIter.index(); } - EIGEN_STRONG_INLINE Index outer() const { return m_lhsIter.outer(); } - EIGEN_STRONG_INLINE Index row() const { return m_lhsIter.row(); } - EIGEN_STRONG_INLINE Index col() const { return m_lhsIter.col(); } - - EIGEN_STRONG_INLINE operator bool() const { return (m_lhsIter && m_rhsIter); } - - protected: - LhsIterator m_lhsIter; - RhsIterator m_rhsIter; - const BinaryOp& m_functor; - }; - - - enum { - CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit sparse_conjunction_evaluator(const XprType& xpr) - : m_functor(xpr.functor()), - m_lhsImpl(xpr.lhs()), - m_rhsImpl(xpr.rhs()) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return (std::min)(m_lhsImpl.nonZerosEstimate(), m_rhsImpl.nonZerosEstimate()); - } - -protected: - const BinaryOp m_functor; - evaluator m_lhsImpl; - evaluator m_rhsImpl; -}; - -// "dense ^ sparse" -template -struct sparse_conjunction_evaluator - : evaluator_base -{ -protected: - typedef typename XprType::Functor BinaryOp; - typedef typename XprType::Lhs LhsArg; - typedef typename XprType::Rhs RhsArg; - typedef evaluator LhsEvaluator; - typedef typename evaluator::InnerIterator RhsIterator; - typedef typename XprType::StorageIndex StorageIndex; - typedef typename traits::Scalar Scalar; -public: - - class InnerIterator - { - enum { IsRowMajor = (int(RhsArg::Flags)&RowMajorBit)==RowMajorBit }; - - public: - - EIGEN_STRONG_INLINE InnerIterator(const sparse_conjunction_evaluator& aEval, Index outer) - : m_lhsEval(aEval.m_lhsImpl), m_rhsIter(aEval.m_rhsImpl,outer), m_functor(aEval.m_functor), m_outer(outer) - {} - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - ++m_rhsIter; - return *this; - } - - EIGEN_STRONG_INLINE Scalar value() const - { return m_functor(m_lhsEval.coeff(IsRowMajor?m_outer:m_rhsIter.index(),IsRowMajor?m_rhsIter.index():m_outer), m_rhsIter.value()); } - - EIGEN_STRONG_INLINE StorageIndex index() const { return m_rhsIter.index(); } - EIGEN_STRONG_INLINE Index outer() const { return m_rhsIter.outer(); } - EIGEN_STRONG_INLINE Index row() const { return m_rhsIter.row(); } - EIGEN_STRONG_INLINE Index col() const { return m_rhsIter.col(); } - - EIGEN_STRONG_INLINE operator bool() const { return m_rhsIter; } - - protected: - const LhsEvaluator &m_lhsEval; - RhsIterator m_rhsIter; - const BinaryOp& m_functor; - const Index m_outer; - }; - - - enum { - CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit sparse_conjunction_evaluator(const XprType& xpr) - : m_functor(xpr.functor()), - m_lhsImpl(xpr.lhs()), - m_rhsImpl(xpr.rhs()) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_rhsImpl.nonZerosEstimate(); - } - -protected: - const BinaryOp m_functor; - evaluator m_lhsImpl; - evaluator m_rhsImpl; -}; - -// "sparse ^ dense" -template -struct sparse_conjunction_evaluator - : evaluator_base -{ -protected: - typedef typename XprType::Functor BinaryOp; - typedef typename XprType::Lhs LhsArg; - typedef typename XprType::Rhs RhsArg; - typedef typename evaluator::InnerIterator LhsIterator; - typedef evaluator RhsEvaluator; - typedef typename XprType::StorageIndex StorageIndex; - typedef typename traits::Scalar Scalar; -public: - - class InnerIterator - { - enum { IsRowMajor = (int(LhsArg::Flags)&RowMajorBit)==RowMajorBit }; - - public: - - EIGEN_STRONG_INLINE InnerIterator(const sparse_conjunction_evaluator& aEval, Index outer) - : m_lhsIter(aEval.m_lhsImpl,outer), m_rhsEval(aEval.m_rhsImpl), m_functor(aEval.m_functor), m_outer(outer) - {} - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - ++m_lhsIter; - return *this; - } - - EIGEN_STRONG_INLINE Scalar value() const - { return m_functor(m_lhsIter.value(), - m_rhsEval.coeff(IsRowMajor?m_outer:m_lhsIter.index(),IsRowMajor?m_lhsIter.index():m_outer)); } - - EIGEN_STRONG_INLINE StorageIndex index() const { return m_lhsIter.index(); } - EIGEN_STRONG_INLINE Index outer() const { return m_lhsIter.outer(); } - EIGEN_STRONG_INLINE Index row() const { return m_lhsIter.row(); } - EIGEN_STRONG_INLINE Index col() const { return m_lhsIter.col(); } - - EIGEN_STRONG_INLINE operator bool() const { return m_lhsIter; } - - protected: - LhsIterator m_lhsIter; - const evaluator &m_rhsEval; - const BinaryOp& m_functor; - const Index m_outer; - }; - - - enum { - CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit sparse_conjunction_evaluator(const XprType& xpr) - : m_functor(xpr.functor()), - m_lhsImpl(xpr.lhs()), - m_rhsImpl(xpr.rhs()) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_lhsImpl.nonZerosEstimate(); - } - -protected: - const BinaryOp m_functor; - evaluator m_lhsImpl; - evaluator m_rhsImpl; -}; - -} - -/*************************************************************************** -* Implementation of SparseMatrixBase and SparseCwise functions/operators -***************************************************************************/ - -template -template -Derived& SparseMatrixBase::operator+=(const EigenBase &other) -{ - call_assignment(derived(), other.derived(), internal::add_assign_op()); - return derived(); -} - -template -template -Derived& SparseMatrixBase::operator-=(const EigenBase &other) -{ - call_assignment(derived(), other.derived(), internal::assign_op()); - return derived(); -} - -template -template -EIGEN_STRONG_INLINE Derived & -SparseMatrixBase::operator-=(const SparseMatrixBase &other) -{ - return derived() = derived() - other.derived(); -} - -template -template -EIGEN_STRONG_INLINE Derived & -SparseMatrixBase::operator+=(const SparseMatrixBase& other) -{ - return derived() = derived() + other.derived(); -} - -template -template -Derived& SparseMatrixBase::operator+=(const DiagonalBase& other) -{ - call_assignment_no_alias(derived(), other.derived(), internal::add_assign_op()); - return derived(); -} - -template -template -Derived& SparseMatrixBase::operator-=(const DiagonalBase& other) -{ - call_assignment_no_alias(derived(), other.derived(), internal::sub_assign_op()); - return derived(); -} - -template -template -EIGEN_STRONG_INLINE const typename SparseMatrixBase::template CwiseProductDenseReturnType::Type -SparseMatrixBase::cwiseProduct(const MatrixBase &other) const -{ - return typename CwiseProductDenseReturnType::Type(derived(), other.derived()); -} - -template -EIGEN_STRONG_INLINE const CwiseBinaryOp, const DenseDerived, const SparseDerived> -operator+(const MatrixBase &a, const SparseMatrixBase &b) -{ - return CwiseBinaryOp, const DenseDerived, const SparseDerived>(a.derived(), b.derived()); -} - -template -EIGEN_STRONG_INLINE const CwiseBinaryOp, const SparseDerived, const DenseDerived> -operator+(const SparseMatrixBase &a, const MatrixBase &b) -{ - return CwiseBinaryOp, const SparseDerived, const DenseDerived>(a.derived(), b.derived()); -} - -template -EIGEN_STRONG_INLINE const CwiseBinaryOp, const DenseDerived, const SparseDerived> -operator-(const MatrixBase &a, const SparseMatrixBase &b) -{ - return CwiseBinaryOp, const DenseDerived, const SparseDerived>(a.derived(), b.derived()); -} - -template -EIGEN_STRONG_INLINE const CwiseBinaryOp, const SparseDerived, const DenseDerived> -operator-(const SparseMatrixBase &a, const MatrixBase &b) -{ - return CwiseBinaryOp, const SparseDerived, const DenseDerived>(a.derived(), b.derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_CWISE_BINARY_OP_H diff --git a/Eigen/src/SparseCore/SparseCwiseUnaryOp.h b/Eigen/src/SparseCore/SparseCwiseUnaryOp.h deleted file mode 100644 index ea7973790..000000000 --- a/Eigen/src/SparseCore/SparseCwiseUnaryOp.h +++ /dev/null @@ -1,148 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_CWISE_UNARY_OP_H -#define EIGEN_SPARSE_CWISE_UNARY_OP_H - -namespace Eigen { - -namespace internal { - -template -struct unary_evaluator, IteratorBased> - : public evaluator_base > -{ - public: - typedef CwiseUnaryOp XprType; - - class InnerIterator; - - enum { - CoeffReadCost = evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit unary_evaluator(const XprType& op) : m_functor(op.functor()), m_argImpl(op.nestedExpression()) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_argImpl.nonZerosEstimate(); - } - - protected: - typedef typename evaluator::InnerIterator EvalIterator; - - const UnaryOp m_functor; - evaluator m_argImpl; -}; - -template -class unary_evaluator, IteratorBased>::InnerIterator - : public unary_evaluator, IteratorBased>::EvalIterator -{ - typedef typename XprType::Scalar Scalar; - typedef typename unary_evaluator, IteratorBased>::EvalIterator Base; - public: - - EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& unaryOp, Index outer) - : Base(unaryOp.m_argImpl,outer), m_functor(unaryOp.m_functor) - {} - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { Base::operator++(); return *this; } - - EIGEN_STRONG_INLINE Scalar value() const { return m_functor(Base::value()); } - - protected: - const UnaryOp m_functor; - private: - Scalar& valueRef(); -}; - -template -struct unary_evaluator, IteratorBased> - : public evaluator_base > -{ - public: - typedef CwiseUnaryView XprType; - - class InnerIterator; - - enum { - CoeffReadCost = evaluator::CoeffReadCost + functor_traits::Cost, - Flags = XprType::Flags - }; - - explicit unary_evaluator(const XprType& op) : m_functor(op.functor()), m_argImpl(op.nestedExpression()) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(functor_traits::Cost); - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - protected: - typedef typename evaluator::InnerIterator EvalIterator; - - const ViewOp m_functor; - evaluator m_argImpl; -}; - -template -class unary_evaluator, IteratorBased>::InnerIterator - : public unary_evaluator, IteratorBased>::EvalIterator -{ - typedef typename XprType::Scalar Scalar; - typedef typename unary_evaluator, IteratorBased>::EvalIterator Base; - public: - - EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& unaryOp, Index outer) - : Base(unaryOp.m_argImpl,outer), m_functor(unaryOp.m_functor) - {} - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { Base::operator++(); return *this; } - - EIGEN_STRONG_INLINE Scalar value() const { return m_functor(Base::value()); } - EIGEN_STRONG_INLINE Scalar& valueRef() { return m_functor(Base::valueRef()); } - - protected: - const ViewOp m_functor; -}; - -} // end namespace internal - -template -EIGEN_STRONG_INLINE Derived& -SparseMatrixBase::operator*=(const Scalar& other) -{ - typedef typename internal::evaluator::InnerIterator EvalIterator; - internal::evaluator thisEval(derived()); - for (Index j=0; j -EIGEN_STRONG_INLINE Derived& -SparseMatrixBase::operator/=(const Scalar& other) -{ - typedef typename internal::evaluator::InnerIterator EvalIterator; - internal::evaluator thisEval(derived()); - for (Index j=0; j -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEDENSEPRODUCT_H -#define EIGEN_SPARSEDENSEPRODUCT_H - -namespace Eigen { - -namespace internal { - -template <> struct product_promote_storage_type { typedef Sparse ret; }; -template <> struct product_promote_storage_type { typedef Sparse ret; }; - -template -struct sparse_time_dense_product_impl; - -template -struct sparse_time_dense_product_impl -{ - typedef typename internal::remove_all::type Lhs; - typedef typename internal::remove_all::type Rhs; - typedef typename internal::remove_all::type Res; - typedef typename evaluator::InnerIterator LhsInnerIterator; - typedef evaluator LhsEval; - static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha) - { - LhsEval lhsEval(lhs); - - Index n = lhs.outerSize(); -#ifdef EIGEN_HAS_OPENMP - Eigen::initParallel(); - Index threads = Eigen::nbThreads(); -#endif - - for(Index c=0; c1 && lhsEval.nonZerosEstimate() > 20000) - { - #pragma omp parallel for schedule(dynamic,(n+threads*4-1)/(threads*4)) num_threads(threads) - for(Index i=0; i let's disable it for now as it is conflicting with generic scalar*matrix and matrix*scalar operators -// template -// struct ScalarBinaryOpTraits > -// { -// enum { -// Defined = 1 -// }; -// typedef typename CwiseUnaryOp, T2>::PlainObject ReturnType; -// }; - -template -struct sparse_time_dense_product_impl -{ - typedef typename internal::remove_all::type Lhs; - typedef typename internal::remove_all::type Rhs; - typedef typename internal::remove_all::type Res; - typedef typename evaluator::InnerIterator LhsInnerIterator; - static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const AlphaType& alpha) - { - evaluator lhsEval(lhs); - for(Index c=0; c::ReturnType rhs_j(alpha * rhs.coeff(j,c)); - for(LhsInnerIterator it(lhsEval,j); it ;++it) - res.coeffRef(it.index(),c) += it.value() * rhs_j; - } - } - } -}; - -template -struct sparse_time_dense_product_impl -{ - typedef typename internal::remove_all::type Lhs; - typedef typename internal::remove_all::type Rhs; - typedef typename internal::remove_all::type Res; - typedef typename evaluator::InnerIterator LhsInnerIterator; - static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha) - { - evaluator lhsEval(lhs); - for(Index j=0; j -struct sparse_time_dense_product_impl -{ - typedef typename internal::remove_all::type Lhs; - typedef typename internal::remove_all::type Rhs; - typedef typename internal::remove_all::type Res; - typedef typename evaluator::InnerIterator LhsInnerIterator; - static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha) - { - evaluator lhsEval(lhs); - for(Index j=0; j -inline void sparse_time_dense_product(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const AlphaType& alpha) -{ - sparse_time_dense_product_impl::run(lhs, rhs, res, alpha); -} - -} // end namespace internal - -namespace internal { - -template -struct generic_product_impl - : generic_product_impl_base > -{ - typedef typename Product::Scalar Scalar; - - template - static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) - { - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(lhs); - RhsNested rhsNested(rhs); - internal::sparse_time_dense_product(lhsNested, rhsNested, dst, alpha); - } -}; - -template -struct generic_product_impl - : generic_product_impl -{}; - -template -struct generic_product_impl - : generic_product_impl_base > -{ - typedef typename Product::Scalar Scalar; - - template - static void scaleAndAddTo(Dst& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) - { - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(lhs); - RhsNested rhsNested(rhs); - - // transpose everything - Transpose dstT(dst); - internal::sparse_time_dense_product(rhsNested.transpose(), lhsNested.transpose(), dstT, alpha); - } -}; - -template -struct generic_product_impl - : generic_product_impl -{}; - -template -struct sparse_dense_outer_product_evaluator -{ -protected: - typedef typename conditional::type Lhs1; - typedef typename conditional::type ActualRhs; - typedef Product ProdXprType; - - // if the actual left-hand side is a dense vector, - // then build a sparse-view so that we can seamlessly iterate over it. - typedef typename conditional::StorageKind,Sparse>::value, - Lhs1, SparseView >::type ActualLhs; - typedef typename conditional::StorageKind,Sparse>::value, - Lhs1 const&, SparseView >::type LhsArg; - - typedef evaluator LhsEval; - typedef evaluator RhsEval; - typedef typename evaluator::InnerIterator LhsIterator; - typedef typename ProdXprType::Scalar Scalar; - -public: - enum { - Flags = NeedToTranspose ? RowMajorBit : 0, - CoeffReadCost = HugeCost - }; - - class InnerIterator : public LhsIterator - { - public: - InnerIterator(const sparse_dense_outer_product_evaluator &xprEval, Index outer) - : LhsIterator(xprEval.m_lhsXprImpl, 0), - m_outer(outer), - m_empty(false), - m_factor(get(xprEval.m_rhsXprImpl, outer, typename internal::traits::StorageKind() )) - {} - - EIGEN_STRONG_INLINE Index outer() const { return m_outer; } - EIGEN_STRONG_INLINE Index row() const { return NeedToTranspose ? m_outer : LhsIterator::index(); } - EIGEN_STRONG_INLINE Index col() const { return NeedToTranspose ? LhsIterator::index() : m_outer; } - - EIGEN_STRONG_INLINE Scalar value() const { return LhsIterator::value() * m_factor; } - EIGEN_STRONG_INLINE operator bool() const { return LhsIterator::operator bool() && (!m_empty); } - - protected: - Scalar get(const RhsEval &rhs, Index outer, Dense = Dense()) const - { - return rhs.coeff(outer); - } - - Scalar get(const RhsEval &rhs, Index outer, Sparse = Sparse()) - { - typename RhsEval::InnerIterator it(rhs, outer); - if (it && it.index()==0 && it.value()!=Scalar(0)) - return it.value(); - m_empty = true; - return Scalar(0); - } - - Index m_outer; - bool m_empty; - Scalar m_factor; - }; - - sparse_dense_outer_product_evaluator(const Lhs1 &lhs, const ActualRhs &rhs) - : m_lhs(lhs), m_lhsXprImpl(m_lhs), m_rhsXprImpl(rhs) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - // transpose case - sparse_dense_outer_product_evaluator(const ActualRhs &rhs, const Lhs1 &lhs) - : m_lhs(lhs), m_lhsXprImpl(m_lhs), m_rhsXprImpl(rhs) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - -protected: - const LhsArg m_lhs; - evaluator m_lhsXprImpl; - evaluator m_rhsXprImpl; -}; - -// sparse * dense outer product -template -struct product_evaluator, OuterProduct, SparseShape, DenseShape> - : sparse_dense_outer_product_evaluator -{ - typedef sparse_dense_outer_product_evaluator Base; - - typedef Product XprType; - typedef typename XprType::PlainObject PlainObject; - - explicit product_evaluator(const XprType& xpr) - : Base(xpr.lhs(), xpr.rhs()) - {} - -}; - -template -struct product_evaluator, OuterProduct, DenseShape, SparseShape> - : sparse_dense_outer_product_evaluator -{ - typedef sparse_dense_outer_product_evaluator Base; - - typedef Product XprType; - typedef typename XprType::PlainObject PlainObject; - - explicit product_evaluator(const XprType& xpr) - : Base(xpr.lhs(), xpr.rhs()) - {} - -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSEDENSEPRODUCT_H diff --git a/Eigen/src/SparseCore/SparseDiagonalProduct.h b/Eigen/src/SparseCore/SparseDiagonalProduct.h deleted file mode 100644 index 941c03be3..000000000 --- a/Eigen/src/SparseCore/SparseDiagonalProduct.h +++ /dev/null @@ -1,138 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_DIAGONAL_PRODUCT_H -#define EIGEN_SPARSE_DIAGONAL_PRODUCT_H - -namespace Eigen { - -// The product of a diagonal matrix with a sparse matrix can be easily -// implemented using expression template. -// We have two consider very different cases: -// 1 - diag * row-major sparse -// => each inner vector <=> scalar * sparse vector product -// => so we can reuse CwiseUnaryOp::InnerIterator -// 2 - diag * col-major sparse -// => each inner vector <=> densevector * sparse vector cwise product -// => again, we can reuse specialization of CwiseBinaryOp::InnerIterator -// for that particular case -// The two other cases are symmetric. - -namespace internal { - -enum { - SDP_AsScalarProduct, - SDP_AsCwiseProduct -}; - -template -struct sparse_diagonal_product_evaluator; - -template -struct product_evaluator, ProductTag, DiagonalShape, SparseShape> - : public sparse_diagonal_product_evaluator -{ - typedef Product XprType; - enum { CoeffReadCost = HugeCost, Flags = Rhs::Flags&RowMajorBit, Alignment = 0 }; // FIXME CoeffReadCost & Flags - - typedef sparse_diagonal_product_evaluator Base; - explicit product_evaluator(const XprType& xpr) : Base(xpr.rhs(), xpr.lhs().diagonal()) {} -}; - -template -struct product_evaluator, ProductTag, SparseShape, DiagonalShape> - : public sparse_diagonal_product_evaluator, Lhs::Flags&RowMajorBit?SDP_AsCwiseProduct:SDP_AsScalarProduct> -{ - typedef Product XprType; - enum { CoeffReadCost = HugeCost, Flags = Lhs::Flags&RowMajorBit, Alignment = 0 }; // FIXME CoeffReadCost & Flags - - typedef sparse_diagonal_product_evaluator, Lhs::Flags&RowMajorBit?SDP_AsCwiseProduct:SDP_AsScalarProduct> Base; - explicit product_evaluator(const XprType& xpr) : Base(xpr.lhs(), xpr.rhs().diagonal().transpose()) {} -}; - -template -struct sparse_diagonal_product_evaluator -{ -protected: - typedef typename evaluator::InnerIterator SparseXprInnerIterator; - typedef typename SparseXprType::Scalar Scalar; - -public: - class InnerIterator : public SparseXprInnerIterator - { - public: - InnerIterator(const sparse_diagonal_product_evaluator &xprEval, Index outer) - : SparseXprInnerIterator(xprEval.m_sparseXprImpl, outer), - m_coeff(xprEval.m_diagCoeffImpl.coeff(outer)) - {} - - EIGEN_STRONG_INLINE Scalar value() const { return m_coeff * SparseXprInnerIterator::value(); } - protected: - typename DiagonalCoeffType::Scalar m_coeff; - }; - - sparse_diagonal_product_evaluator(const SparseXprType &sparseXpr, const DiagonalCoeffType &diagCoeff) - : m_sparseXprImpl(sparseXpr), m_diagCoeffImpl(diagCoeff) - {} - - Index nonZerosEstimate() const { return m_sparseXprImpl.nonZerosEstimate(); } - -protected: - evaluator m_sparseXprImpl; - evaluator m_diagCoeffImpl; -}; - - -template -struct sparse_diagonal_product_evaluator -{ - typedef typename SparseXprType::Scalar Scalar; - typedef typename SparseXprType::StorageIndex StorageIndex; - - typedef typename nested_eval::type DiagCoeffNested; - - class InnerIterator - { - typedef typename evaluator::InnerIterator SparseXprIter; - public: - InnerIterator(const sparse_diagonal_product_evaluator &xprEval, Index outer) - : m_sparseIter(xprEval.m_sparseXprEval, outer), m_diagCoeffNested(xprEval.m_diagCoeffNested) - {} - - inline Scalar value() const { return m_sparseIter.value() * m_diagCoeffNested.coeff(index()); } - inline StorageIndex index() const { return m_sparseIter.index(); } - inline Index outer() const { return m_sparseIter.outer(); } - inline Index col() const { return SparseXprType::IsRowMajor ? m_sparseIter.index() : m_sparseIter.outer(); } - inline Index row() const { return SparseXprType::IsRowMajor ? m_sparseIter.outer() : m_sparseIter.index(); } - - EIGEN_STRONG_INLINE InnerIterator& operator++() { ++m_sparseIter; return *this; } - inline operator bool() const { return m_sparseIter; } - - protected: - SparseXprIter m_sparseIter; - DiagCoeffNested m_diagCoeffNested; - }; - - sparse_diagonal_product_evaluator(const SparseXprType &sparseXpr, const DiagCoeffType &diagCoeff) - : m_sparseXprEval(sparseXpr), m_diagCoeffNested(diagCoeff) - {} - - Index nonZerosEstimate() const { return m_sparseXprEval.nonZerosEstimate(); } - -protected: - evaluator m_sparseXprEval; - DiagCoeffNested m_diagCoeffNested; -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_DIAGONAL_PRODUCT_H diff --git a/Eigen/src/SparseCore/SparseDot.h b/Eigen/src/SparseCore/SparseDot.h deleted file mode 100644 index 38bc4aa9e..000000000 --- a/Eigen/src/SparseCore/SparseDot.h +++ /dev/null @@ -1,98 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_DOT_H -#define EIGEN_SPARSE_DOT_H - -namespace Eigen { - -template -template -typename internal::traits::Scalar -SparseMatrixBase::dot(const MatrixBase& other) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(Derived,OtherDerived) - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - - eigen_assert(size() == other.size()); - eigen_assert(other.size()>0 && "you are using a non initialized vector"); - - internal::evaluator thisEval(derived()); - typename internal::evaluator::InnerIterator i(thisEval, 0); - Scalar res(0); - while (i) - { - res += numext::conj(i.value()) * other.coeff(i.index()); - ++i; - } - return res; -} - -template -template -typename internal::traits::Scalar -SparseMatrixBase::dot(const SparseMatrixBase& other) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - EIGEN_STATIC_ASSERT_VECTOR_ONLY(OtherDerived) - EIGEN_STATIC_ASSERT_SAME_VECTOR_SIZE(Derived,OtherDerived) - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - - eigen_assert(size() == other.size()); - - internal::evaluator thisEval(derived()); - typename internal::evaluator::InnerIterator i(thisEval, 0); - - internal::evaluator otherEval(other.derived()); - typename internal::evaluator::InnerIterator j(otherEval, 0); - - Scalar res(0); - while (i && j) - { - if (i.index()==j.index()) - { - res += numext::conj(i.value()) * j.value(); - ++i; ++j; - } - else if (i.index() -inline typename NumTraits::Scalar>::Real -SparseMatrixBase::squaredNorm() const -{ - return numext::real((*this).cwiseAbs2().sum()); -} - -template -inline typename NumTraits::Scalar>::Real -SparseMatrixBase::norm() const -{ - using std::sqrt; - return sqrt(squaredNorm()); -} - -template -inline typename NumTraits::Scalar>::Real -SparseMatrixBase::blueNorm() const -{ - return internal::blueNorm_impl(*this); -} -} // end namespace Eigen - -#endif // EIGEN_SPARSE_DOT_H diff --git a/Eigen/src/SparseCore/SparseFuzzy.h b/Eigen/src/SparseCore/SparseFuzzy.h deleted file mode 100644 index 7d47eb94d..000000000 --- a/Eigen/src/SparseCore/SparseFuzzy.h +++ /dev/null @@ -1,29 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_FUZZY_H -#define EIGEN_SPARSE_FUZZY_H - -namespace Eigen { - -template -template -bool SparseMatrixBase::isApprox(const SparseMatrixBase& other, const RealScalar &prec) const -{ - const typename internal::nested_eval::type actualA(derived()); - typename internal::conditional::type, - const PlainObject>::type actualB(other.derived()); - - return (actualA - actualB).squaredNorm() <= prec * prec * numext::mini(actualA.squaredNorm(), actualB.squaredNorm()); -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_FUZZY_H diff --git a/Eigen/src/SparseCore/SparseMap.h b/Eigen/src/SparseCore/SparseMap.h deleted file mode 100644 index f99be3379..000000000 --- a/Eigen/src/SparseCore/SparseMap.h +++ /dev/null @@ -1,305 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_MAP_H -#define EIGEN_SPARSE_MAP_H - -namespace Eigen { - -namespace internal { - -template -struct traits, Options, StrideType> > - : public traits > -{ - typedef SparseMatrix PlainObjectType; - typedef traits TraitsBase; - enum { - Flags = TraitsBase::Flags & (~NestByRefBit) - }; -}; - -template -struct traits, Options, StrideType> > - : public traits > -{ - typedef SparseMatrix PlainObjectType; - typedef traits TraitsBase; - enum { - Flags = TraitsBase::Flags & (~ (NestByRefBit | LvalueBit)) - }; -}; - -} // end namespace internal - -template::has_write_access ? WriteAccessors : ReadOnlyAccessors -> class SparseMapBase; - -/** \ingroup SparseCore_Module - * class SparseMapBase - * \brief Common base class for Map and Ref instance of sparse matrix and vector. - */ -template -class SparseMapBase - : public SparseCompressedBase -{ - public: - typedef SparseCompressedBase Base; - typedef typename Base::Scalar Scalar; - typedef typename Base::StorageIndex StorageIndex; - enum { IsRowMajor = Base::IsRowMajor }; - using Base::operator=; - protected: - - typedef typename internal::conditional< - bool(internal::is_lvalue::value), - Scalar *, const Scalar *>::type ScalarPointer; - typedef typename internal::conditional< - bool(internal::is_lvalue::value), - StorageIndex *, const StorageIndex *>::type IndexPointer; - - Index m_outerSize; - Index m_innerSize; - Array m_zero_nnz; - IndexPointer m_outerIndex; - IndexPointer m_innerIndices; - ScalarPointer m_values; - IndexPointer m_innerNonZeros; - - public: - - /** \copydoc SparseMatrixBase::rows() */ - inline Index rows() const { return IsRowMajor ? m_outerSize : m_innerSize; } - /** \copydoc SparseMatrixBase::cols() */ - inline Index cols() const { return IsRowMajor ? m_innerSize : m_outerSize; } - /** \copydoc SparseMatrixBase::innerSize() */ - inline Index innerSize() const { return m_innerSize; } - /** \copydoc SparseMatrixBase::outerSize() */ - inline Index outerSize() const { return m_outerSize; } - /** \copydoc SparseCompressedBase::nonZeros */ - inline Index nonZeros() const { return m_zero_nnz[1]; } - - /** \copydoc SparseCompressedBase::isCompressed */ - bool isCompressed() const { return m_innerNonZeros==0; } - - //---------------------------------------- - // direct access interface - /** \copydoc SparseMatrix::valuePtr */ - inline const Scalar* valuePtr() const { return m_values; } - /** \copydoc SparseMatrix::innerIndexPtr */ - inline const StorageIndex* innerIndexPtr() const { return m_innerIndices; } - /** \copydoc SparseMatrix::outerIndexPtr */ - inline const StorageIndex* outerIndexPtr() const { return m_outerIndex; } - /** \copydoc SparseMatrix::innerNonZeroPtr */ - inline const StorageIndex* innerNonZeroPtr() const { return m_innerNonZeros; } - //---------------------------------------- - - /** \copydoc SparseMatrix::coeff */ - inline Scalar coeff(Index row, Index col) const - { - const Index outer = IsRowMajor ? row : col; - const Index inner = IsRowMajor ? col : row; - - Index start = m_outerIndex[outer]; - Index end = isCompressed() ? m_outerIndex[outer+1] : start + m_innerNonZeros[outer]; - if (start==end) - return Scalar(0); - else if (end>0 && inner==m_innerIndices[end-1]) - return m_values[end-1]; - // ^^ optimization: let's first check if it is the last coefficient - // (very common in high level algorithms) - - const StorageIndex* r = std::lower_bound(&m_innerIndices[start],&m_innerIndices[end-1],inner); - const Index id = r-&m_innerIndices[0]; - return ((*r==inner) && (id(nnz)), m_outerIndex(outerIndexPtr), - m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(innerNonZerosPtr) - {} - - // for vectors - inline SparseMapBase(Index size, Index nnz, IndexPointer innerIndexPtr, ScalarPointer valuePtr) - : m_outerSize(1), m_innerSize(size), m_zero_nnz(0,internal::convert_index(nnz)), m_outerIndex(m_zero_nnz.data()), - m_innerIndices(innerIndexPtr), m_values(valuePtr), m_innerNonZeros(0) - {} - - /** Empty destructor */ - inline ~SparseMapBase() {} - - protected: - inline SparseMapBase() {} -}; - -/** \ingroup SparseCore_Module - * class SparseMapBase - * \brief Common base class for writable Map and Ref instance of sparse matrix and vector. - */ -template -class SparseMapBase - : public SparseMapBase -{ - typedef MapBase ReadOnlyMapBase; - - public: - typedef SparseMapBase Base; - typedef typename Base::Scalar Scalar; - typedef typename Base::StorageIndex StorageIndex; - enum { IsRowMajor = Base::IsRowMajor }; - - using Base::operator=; - - public: - - //---------------------------------------- - // direct access interface - using Base::valuePtr; - using Base::innerIndexPtr; - using Base::outerIndexPtr; - using Base::innerNonZeroPtr; - /** \copydoc SparseMatrix::valuePtr */ - inline Scalar* valuePtr() { return Base::m_values; } - /** \copydoc SparseMatrix::innerIndexPtr */ - inline StorageIndex* innerIndexPtr() { return Base::m_innerIndices; } - /** \copydoc SparseMatrix::outerIndexPtr */ - inline StorageIndex* outerIndexPtr() { return Base::m_outerIndex; } - /** \copydoc SparseMatrix::innerNonZeroPtr */ - inline StorageIndex* innerNonZeroPtr() { return Base::m_innerNonZeros; } - //---------------------------------------- - - /** \copydoc SparseMatrix::coeffRef */ - inline Scalar& coeffRef(Index row, Index col) - { - const Index outer = IsRowMajor ? row : col; - const Index inner = IsRowMajor ? col : row; - - Index start = Base::m_outerIndex[outer]; - Index end = Base::isCompressed() ? Base::m_outerIndex[outer+1] : start + Base::m_innerNonZeros[outer]; - eigen_assert(end>=start && "you probably called coeffRef on a non finalized matrix"); - eigen_assert(end>start && "coeffRef cannot be called on a zero coefficient"); - StorageIndex* r = std::lower_bound(&Base::m_innerIndices[start],&Base::m_innerIndices[end],inner); - const Index id = r - &Base::m_innerIndices[0]; - eigen_assert((*r==inner) && (id(Base::m_values)[id]; - } - - inline SparseMapBase(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr, - Scalar* valuePtr, StorageIndex* innerNonZerosPtr = 0) - : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) - {} - - // for vectors - inline SparseMapBase(Index size, Index nnz, StorageIndex* innerIndexPtr, Scalar* valuePtr) - : Base(size, nnz, innerIndexPtr, valuePtr) - {} - - /** Empty destructor */ - inline ~SparseMapBase() {} - - protected: - inline SparseMapBase() {} -}; - -/** \ingroup SparseCore_Module - * - * \brief Specialization of class Map for SparseMatrix-like storage. - * - * \tparam SparseMatrixType the equivalent sparse matrix type of the referenced data, it must be a template instance of class SparseMatrix. - * - * \sa class Map, class SparseMatrix, class Ref - */ -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -class Map, Options, StrideType> - : public SparseMapBase, Options, StrideType> > -#else -template -class Map - : public SparseMapBase -#endif -{ - public: - typedef SparseMapBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Map) - enum { IsRowMajor = Base::IsRowMajor }; - - public: - - /** Constructs a read-write Map to a sparse matrix of size \a rows x \a cols, containing \a nnz non-zero coefficients, - * stored as a sparse format as defined by the pointers \a outerIndexPtr, \a innerIndexPtr, and \a valuePtr. - * If the optional parameter \a innerNonZerosPtr is the null pointer, then a standard compressed format is assumed. - * - * This constructor is available only if \c SparseMatrixType is non-const. - * - * More details on the expected storage schemes are given in the \ref TutorialSparse "manual pages". - */ - inline Map(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, - StorageIndex* innerIndexPtr, Scalar* valuePtr, StorageIndex* innerNonZerosPtr = 0) - : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) - {} -#ifndef EIGEN_PARSED_BY_DOXYGEN - /** Empty destructor */ - inline ~Map() {} -}; - -template -class Map, Options, StrideType> - : public SparseMapBase, Options, StrideType> > -{ - public: - typedef SparseMapBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Map) - enum { IsRowMajor = Base::IsRowMajor }; - - public: -#endif - /** This is the const version of the above constructor. - * - * This constructor is available only if \c SparseMatrixType is const, e.g.: - * \code Map > \endcode - */ - inline Map(Index rows, Index cols, Index nnz, const StorageIndex* outerIndexPtr, - const StorageIndex* innerIndexPtr, const Scalar* valuePtr, const StorageIndex* innerNonZerosPtr = 0) - : Base(rows, cols, nnz, outerIndexPtr, innerIndexPtr, valuePtr, innerNonZerosPtr) - {} - - /** Empty destructor */ - inline ~Map() {} -}; - -namespace internal { - -template -struct evaluator, Options, StrideType> > - : evaluator, Options, StrideType> > > -{ - typedef evaluator, Options, StrideType> > > Base; - typedef Map, Options, StrideType> XprType; - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -template -struct evaluator, Options, StrideType> > - : evaluator, Options, StrideType> > > -{ - typedef evaluator, Options, StrideType> > > Base; - typedef Map, Options, StrideType> XprType; - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_MAP_H diff --git a/Eigen/src/SparseCore/SparseMatrix.h b/Eigen/src/SparseCore/SparseMatrix.h deleted file mode 100644 index 323c2323b..000000000 --- a/Eigen/src/SparseCore/SparseMatrix.h +++ /dev/null @@ -1,1403 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEMATRIX_H -#define EIGEN_SPARSEMATRIX_H - -namespace Eigen { - -/** \ingroup SparseCore_Module - * - * \class SparseMatrix - * - * \brief A versatible sparse matrix representation - * - * This class implements a more versatile variants of the common \em compressed row/column storage format. - * Each colmun's (resp. row) non zeros are stored as a pair of value with associated row (resp. colmiun) index. - * All the non zeros are stored in a single large buffer. Unlike the \em compressed format, there might be extra - * space inbetween the nonzeros of two successive colmuns (resp. rows) such that insertion of new non-zero - * can be done with limited memory reallocation and copies. - * - * A call to the function makeCompressed() turns the matrix into the standard \em compressed format - * compatible with many library. - * - * More details on this storage sceheme are given in the \ref TutorialSparse "manual pages". - * - * \tparam _Scalar the scalar type, i.e. the type of the coefficients - * \tparam _Options Union of bit flags controlling the storage scheme. Currently the only possibility - * is ColMajor or RowMajor. The default is 0 which means column-major. - * \tparam _StorageIndex the type of the indices. It has to be a \b signed type (e.g., short, int, std::ptrdiff_t). Default is \c int. - * - * \warning In %Eigen 3.2, the undocumented type \c SparseMatrix::Index was improperly defined as the storage index type (e.g., int), - * whereas it is now (starting from %Eigen 3.3) deprecated and always defined as Eigen::Index. - * Codes making use of \c SparseMatrix::Index, might thus likely have to be changed to use \c SparseMatrix::StorageIndex instead. - * - * This class can be extended with the help of the plugin mechanism described on the page - * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_SPARSEMATRIX_PLUGIN. - */ - -namespace internal { -template -struct traits > -{ - typedef _Scalar Scalar; - typedef _StorageIndex StorageIndex; - typedef Sparse StorageKind; - typedef MatrixXpr XprKind; - enum { - RowsAtCompileTime = Dynamic, - ColsAtCompileTime = Dynamic, - MaxRowsAtCompileTime = Dynamic, - MaxColsAtCompileTime = Dynamic, - Flags = _Options | NestByRefBit | LvalueBit | CompressedAccessBit, - SupportedAccessPatterns = InnerRandomAccessPattern - }; -}; - -template -struct traits, DiagIndex> > -{ - typedef SparseMatrix<_Scalar, _Options, _StorageIndex> MatrixType; - typedef typename ref_selector::type MatrixTypeNested; - typedef typename remove_reference::type _MatrixTypeNested; - - typedef _Scalar Scalar; - typedef Dense StorageKind; - typedef _StorageIndex StorageIndex; - typedef MatrixXpr XprKind; - - enum { - RowsAtCompileTime = Dynamic, - ColsAtCompileTime = 1, - MaxRowsAtCompileTime = Dynamic, - MaxColsAtCompileTime = 1, - Flags = LvalueBit - }; -}; - -template -struct traits, DiagIndex> > - : public traits, DiagIndex> > -{ - enum { - Flags = 0 - }; -}; - -} // end namespace internal - -template -class SparseMatrix - : public SparseCompressedBase > -{ - typedef SparseCompressedBase Base; - using Base::convert_index; - friend class SparseVector<_Scalar,0,_StorageIndex>; - public: - using Base::isCompressed; - using Base::nonZeros; - EIGEN_SPARSE_PUBLIC_INTERFACE(SparseMatrix) - using Base::operator+=; - using Base::operator-=; - - typedef MappedSparseMatrix Map; - typedef Diagonal DiagonalReturnType; - typedef Diagonal ConstDiagonalReturnType; - typedef typename Base::InnerIterator InnerIterator; - typedef typename Base::ReverseInnerIterator ReverseInnerIterator; - - - using Base::IsRowMajor; - typedef internal::CompressedStorage Storage; - enum { - Options = _Options - }; - - typedef typename Base::IndexVector IndexVector; - typedef typename Base::ScalarVector ScalarVector; - protected: - typedef SparseMatrix TransposedSparseMatrix; - - Index m_outerSize; - Index m_innerSize; - StorageIndex* m_outerIndex; - StorageIndex* m_innerNonZeros; // optional, if null then the data is compressed - Storage m_data; - - public: - - /** \returns the number of rows of the matrix */ - inline Index rows() const { return IsRowMajor ? m_outerSize : m_innerSize; } - /** \returns the number of columns of the matrix */ - inline Index cols() const { return IsRowMajor ? m_innerSize : m_outerSize; } - - /** \returns the number of rows (resp. columns) of the matrix if the storage order column major (resp. row major) */ - inline Index innerSize() const { return m_innerSize; } - /** \returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */ - inline Index outerSize() const { return m_outerSize; } - - /** \returns a const pointer to the array of values. - * This function is aimed at interoperability with other libraries. - * \sa innerIndexPtr(), outerIndexPtr() */ - inline const Scalar* valuePtr() const { return m_data.valuePtr(); } - /** \returns a non-const pointer to the array of values. - * This function is aimed at interoperability with other libraries. - * \sa innerIndexPtr(), outerIndexPtr() */ - inline Scalar* valuePtr() { return m_data.valuePtr(); } - - /** \returns a const pointer to the array of inner indices. - * This function is aimed at interoperability with other libraries. - * \sa valuePtr(), outerIndexPtr() */ - inline const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); } - /** \returns a non-const pointer to the array of inner indices. - * This function is aimed at interoperability with other libraries. - * \sa valuePtr(), outerIndexPtr() */ - inline StorageIndex* innerIndexPtr() { return m_data.indexPtr(); } - - /** \returns a const pointer to the array of the starting positions of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \sa valuePtr(), innerIndexPtr() */ - inline const StorageIndex* outerIndexPtr() const { return m_outerIndex; } - /** \returns a non-const pointer to the array of the starting positions of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \sa valuePtr(), innerIndexPtr() */ - inline StorageIndex* outerIndexPtr() { return m_outerIndex; } - - /** \returns a const pointer to the array of the number of non zeros of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \warning it returns the null pointer 0 in compressed mode */ - inline const StorageIndex* innerNonZeroPtr() const { return m_innerNonZeros; } - /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors. - * This function is aimed at interoperability with other libraries. - * \warning it returns the null pointer 0 in compressed mode */ - inline StorageIndex* innerNonZeroPtr() { return m_innerNonZeros; } - - /** \internal */ - inline Storage& data() { return m_data; } - /** \internal */ - inline const Storage& data() const { return m_data; } - - /** \returns the value of the matrix at position \a i, \a j - * This function returns Scalar(0) if the element is an explicit \em zero */ - inline Scalar coeff(Index row, Index col) const - { - eigen_assert(row>=0 && row=0 && col=0 && row=0 && col=start && "you probably called coeffRef on a non finalized matrix"); - if(end<=start) - return insert(row,col); - const Index p = m_data.searchLowerIndex(start,end-1,StorageIndex(inner)); - if((pinnerSize() non zeros if reserve(Index) has not been called earlier. - * In this case, the insertion procedure is optimized for a \e sequential insertion mode where elements are assumed to be - * inserted by increasing outer-indices. - * - * If that's not the case, then it is strongly recommended to either use a triplet-list to assemble the matrix, or to first - * call reserve(const SizesType &) to reserve the appropriate number of non-zero elements per inner vector. - * - * Assuming memory has been appropriately reserved, this function performs a sorted insertion in O(1) - * if the elements of each inner vector are inserted in increasing inner index order, and in O(nnz_j) for a random insertion. - * - */ - Scalar& insert(Index row, Index col); - - public: - - /** Removes all non zeros but keep allocated memory - * - * This function does not free the currently allocated memory. To release as much as memory as possible, - * call \code mat.data().squeeze(); \endcode after resizing it. - * - * \sa resize(Index,Index), data() - */ - inline void setZero() - { - m_data.clear(); - memset(m_outerIndex, 0, (m_outerSize+1)*sizeof(StorageIndex)); - if(m_innerNonZeros) - memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex)); - } - - /** Preallocates \a reserveSize non zeros. - * - * Precondition: the matrix must be in compressed mode. */ - inline void reserve(Index reserveSize) - { - eigen_assert(isCompressed() && "This function does not make sense in non compressed mode."); - m_data.reserve(reserveSize); - } - - #ifdef EIGEN_PARSED_BY_DOXYGEN - /** Preallocates \a reserveSize[\c j] non zeros for each column (resp. row) \c j. - * - * This function turns the matrix in non-compressed mode. - * - * The type \c SizesType must expose the following interface: - \code - typedef value_type; - const value_type& operator[](i) const; - \endcode - * for \c i in the [0,this->outerSize()[ range. - * Typical choices include std::vector, Eigen::VectorXi, Eigen::VectorXi::Constant, etc. - */ - template - inline void reserve(const SizesType& reserveSizes); - #else - template - inline void reserve(const SizesType& reserveSizes, const typename SizesType::value_type& enableif = - #if (!EIGEN_COMP_MSVC) || (EIGEN_COMP_MSVC>=1500) // MSVC 2005 fails to compile with this typename - typename - #endif - SizesType::value_type()) - { - EIGEN_UNUSED_VARIABLE(enableif); - reserveInnerVectors(reserveSizes); - } - #endif // EIGEN_PARSED_BY_DOXYGEN - protected: - template - inline void reserveInnerVectors(const SizesType& reserveSizes) - { - if(isCompressed()) - { - Index totalReserveSize = 0; - // turn the matrix into non-compressed mode - m_innerNonZeros = static_cast(std::malloc(m_outerSize * sizeof(StorageIndex))); - if (!m_innerNonZeros) internal::throw_std_bad_alloc(); - - // temporarily use m_innerSizes to hold the new starting points. - StorageIndex* newOuterIndex = m_innerNonZeros; - - StorageIndex count = 0; - for(Index j=0; j=0; --j) - { - StorageIndex innerNNZ = previousOuterIndex - m_outerIndex[j]; - for(Index i=innerNNZ-1; i>=0; --i) - { - m_data.index(newOuterIndex[j]+i) = m_data.index(m_outerIndex[j]+i); - m_data.value(newOuterIndex[j]+i) = m_data.value(m_outerIndex[j]+i); - } - previousOuterIndex = m_outerIndex[j]; - m_outerIndex[j] = newOuterIndex[j]; - m_innerNonZeros[j] = innerNNZ; - } - m_outerIndex[m_outerSize] = m_outerIndex[m_outerSize-1] + m_innerNonZeros[m_outerSize-1] + reserveSizes[m_outerSize-1]; - - m_data.resize(m_outerIndex[m_outerSize]); - } - else - { - StorageIndex* newOuterIndex = static_cast(std::malloc((m_outerSize+1)*sizeof(StorageIndex))); - if (!newOuterIndex) internal::throw_std_bad_alloc(); - - StorageIndex count = 0; - for(Index j=0; j(reserveSizes[j], alreadyReserved); - count += toReserve + m_innerNonZeros[j]; - } - newOuterIndex[m_outerSize] = count; - - m_data.resize(count); - for(Index j=m_outerSize-1; j>=0; --j) - { - Index offset = newOuterIndex[j] - m_outerIndex[j]; - if(offset>0) - { - StorageIndex innerNNZ = m_innerNonZeros[j]; - for(Index i=innerNNZ-1; i>=0; --i) - { - m_data.index(newOuterIndex[j]+i) = m_data.index(m_outerIndex[j]+i); - m_data.value(newOuterIndex[j]+i) = m_data.value(m_outerIndex[j]+i); - } - } - } - - std::swap(m_outerIndex, newOuterIndex); - std::free(newOuterIndex); - } - - } - public: - - //--- low level purely coherent filling --- - - /** \internal - * \returns a reference to the non zero coefficient at position \a row, \a col assuming that: - * - the nonzero does not already exist - * - the new coefficient is the last one according to the storage order - * - * Before filling a given inner vector you must call the statVec(Index) function. - * - * After an insertion session, you should call the finalize() function. - * - * \sa insert, insertBackByOuterInner, startVec */ - inline Scalar& insertBack(Index row, Index col) - { - return insertBackByOuterInner(IsRowMajor?row:col, IsRowMajor?col:row); - } - - /** \internal - * \sa insertBack, startVec */ - inline Scalar& insertBackByOuterInner(Index outer, Index inner) - { - eigen_assert(Index(m_outerIndex[outer+1]) == m_data.size() && "Invalid ordered insertion (invalid outer index)"); - eigen_assert( (m_outerIndex[outer+1]-m_outerIndex[outer]==0 || m_data.index(m_data.size()-1)(m_data.size()); - Index i = m_outerSize; - // find the last filled column - while (i>=0 && m_outerIndex[i]==0) - --i; - ++i; - while (i<=m_outerSize) - { - m_outerIndex[i] = size; - ++i; - } - } - } - - //--- - - template - void setFromTriplets(const InputIterators& begin, const InputIterators& end); - - template - void setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func); - - void sumupDuplicates() { collapseDuplicates(internal::scalar_sum_op()); } - - template - void collapseDuplicates(DupFunctor dup_func = DupFunctor()); - - //--- - - /** \internal - * same as insert(Index,Index) except that the indices are given relative to the storage order */ - Scalar& insertByOuterInner(Index j, Index i) - { - return insert(IsRowMajor ? j : i, IsRowMajor ? i : j); - } - - /** Turns the matrix into the \em compressed format. - */ - void makeCompressed() - { - if(isCompressed()) - return; - - eigen_internal_assert(m_outerIndex!=0 && m_outerSize>0); - - Index oldStart = m_outerIndex[1]; - m_outerIndex[1] = m_innerNonZeros[0]; - for(Index j=1; j0) - { - for(Index k=0; k(std::malloc(m_outerSize * sizeof(StorageIndex))); - for (Index i = 0; i < m_outerSize; i++) - { - m_innerNonZeros[i] = m_outerIndex[i+1] - m_outerIndex[i]; - } - } - - /** Suppresses all nonzeros which are \b much \b smaller \b than \a reference under the tolerence \a epsilon */ - void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits::dummy_precision()) - { - prune(default_prunning_func(reference,epsilon)); - } - - /** Turns the matrix into compressed format, and suppresses all nonzeros which do not satisfy the predicate \a keep. - * The functor type \a KeepFunc must implement the following function: - * \code - * bool operator() (const Index& row, const Index& col, const Scalar& value) const; - * \endcode - * \sa prune(Scalar,RealScalar) - */ - template - void prune(const KeepFunc& keep = KeepFunc()) - { - // TODO optimize the uncompressed mode to avoid moving and allocating the data twice - makeCompressed(); - - StorageIndex k = 0; - for(Index j=0; jrows() == rows && this->cols() == cols) return; - - // If one dimension is null, then there is nothing to be preserved - if(rows==0 || cols==0) return resize(rows,cols); - - Index innerChange = IsRowMajor ? cols - this->cols() : rows - this->rows(); - Index outerChange = IsRowMajor ? rows - this->rows() : cols - this->cols(); - StorageIndex newInnerSize = convert_index(IsRowMajor ? cols : rows); - - // Deals with inner non zeros - if (m_innerNonZeros) - { - // Resize m_innerNonZeros - StorageIndex *newInnerNonZeros = static_cast(std::realloc(m_innerNonZeros, (m_outerSize + outerChange) * sizeof(StorageIndex))); - if (!newInnerNonZeros) internal::throw_std_bad_alloc(); - m_innerNonZeros = newInnerNonZeros; - - for(Index i=m_outerSize; i(std::malloc((m_outerSize+outerChange+1) * sizeof(StorageIndex))); - if (!m_innerNonZeros) internal::throw_std_bad_alloc(); - for(Index i = 0; i < m_outerSize; i++) - m_innerNonZeros[i] = m_outerIndex[i+1] - m_outerIndex[i]; - } - - // Change the m_innerNonZeros in case of a decrease of inner size - if (m_innerNonZeros && innerChange < 0) - { - for(Index i = 0; i < m_outerSize + (std::min)(outerChange, Index(0)); i++) - { - StorageIndex &n = m_innerNonZeros[i]; - StorageIndex start = m_outerIndex[i]; - while (n > 0 && m_data.index(start+n-1) >= newInnerSize) --n; - } - } - - m_innerSize = newInnerSize; - - // Re-allocate outer index structure if necessary - if (outerChange == 0) - return; - - StorageIndex *newOuterIndex = static_cast(std::realloc(m_outerIndex, (m_outerSize + outerChange + 1) * sizeof(StorageIndex))); - if (!newOuterIndex) internal::throw_std_bad_alloc(); - m_outerIndex = newOuterIndex; - if (outerChange > 0) - { - StorageIndex last = m_outerSize == 0 ? 0 : m_outerIndex[m_outerSize]; - for(Index i=m_outerSize; i(std::malloc((outerSize + 1) * sizeof(StorageIndex))); - if (!m_outerIndex) internal::throw_std_bad_alloc(); - - m_outerSize = outerSize; - } - if(m_innerNonZeros) - { - std::free(m_innerNonZeros); - m_innerNonZeros = 0; - } - memset(m_outerIndex, 0, (m_outerSize+1)*sizeof(StorageIndex)); - } - - /** \internal - * Resize the nonzero vector to \a size */ - void resizeNonZeros(Index size) - { - m_data.resize(size); - } - - /** \returns a const expression of the diagonal coefficients. */ - const ConstDiagonalReturnType diagonal() const { return ConstDiagonalReturnType(*this); } - - /** \returns a read-write expression of the diagonal coefficients. - * \warning If the diagonal entries are written, then all diagonal - * entries \b must already exist, otherwise an assertion will be raised. - */ - DiagonalReturnType diagonal() { return DiagonalReturnType(*this); } - - /** Default constructor yielding an empty \c 0 \c x \c 0 matrix */ - inline SparseMatrix() - : m_outerSize(-1), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - check_template_parameters(); - resize(0, 0); - } - - /** Constructs a \a rows \c x \a cols empty matrix */ - inline SparseMatrix(Index rows, Index cols) - : m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - check_template_parameters(); - resize(rows, cols); - } - - /** Constructs a sparse matrix from the sparse expression \a other */ - template - inline SparseMatrix(const SparseMatrixBase& other) - : m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - check_template_parameters(); - const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator::Flags & RowMajorBit); - if (needToTranspose) - *this = other.derived(); - else - { - #ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - #endif - internal::call_assignment_no_alias(*this, other.derived()); - } - } - - /** Constructs a sparse matrix from the sparse selfadjoint view \a other */ - template - inline SparseMatrix(const SparseSelfAdjointView& other) - : m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - check_template_parameters(); - Base::operator=(other); - } - - /** Copy constructor (it performs a deep copy) */ - inline SparseMatrix(const SparseMatrix& other) - : Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - check_template_parameters(); - *this = other.derived(); - } - - /** \brief Copy constructor with in-place evaluation */ - template - SparseMatrix(const ReturnByValue& other) - : Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - check_template_parameters(); - initAssignment(other); - other.evalTo(*this); - } - - /** \brief Copy constructor with in-place evaluation */ - template - explicit SparseMatrix(const DiagonalBase& other) - : Base(), m_outerSize(0), m_innerSize(0), m_outerIndex(0), m_innerNonZeros(0) - { - check_template_parameters(); - *this = other.derived(); - } - - /** Swaps the content of two sparse matrices of the same type. - * This is a fast operation that simply swaps the underlying pointers and parameters. */ - inline void swap(SparseMatrix& other) - { - //EIGEN_DBG_SPARSE(std::cout << "SparseMatrix:: swap\n"); - std::swap(m_outerIndex, other.m_outerIndex); - std::swap(m_innerSize, other.m_innerSize); - std::swap(m_outerSize, other.m_outerSize); - std::swap(m_innerNonZeros, other.m_innerNonZeros); - m_data.swap(other.m_data); - } - - /** Sets *this to the identity matrix. - * This function also turns the matrix into compressed mode, and drop any reserved memory. */ - inline void setIdentity() - { - eigen_assert(rows() == cols() && "ONLY FOR SQUARED MATRICES"); - this->m_data.resize(rows()); - Eigen::Map(this->m_data.indexPtr(), rows()).setLinSpaced(0, StorageIndex(rows()-1)); - Eigen::Map(this->m_data.valuePtr(), rows()).setOnes(); - Eigen::Map(this->m_outerIndex, rows()+1).setLinSpaced(0, StorageIndex(rows())); - std::free(m_innerNonZeros); - m_innerNonZeros = 0; - } - inline SparseMatrix& operator=(const SparseMatrix& other) - { - if (other.isRValue()) - { - swap(other.const_cast_derived()); - } - else if(this!=&other) - { - #ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - #endif - initAssignment(other); - if(other.isCompressed()) - { - internal::smart_copy(other.m_outerIndex, other.m_outerIndex + m_outerSize + 1, m_outerIndex); - m_data = other.m_data; - } - else - { - Base::operator=(other); - } - } - return *this; - } - -#ifndef EIGEN_PARSED_BY_DOXYGEN - template - inline SparseMatrix& operator=(const EigenBase& other) - { return Base::operator=(other.derived()); } -#endif // EIGEN_PARSED_BY_DOXYGEN - - template - EIGEN_DONT_INLINE SparseMatrix& operator=(const SparseMatrixBase& other); - - friend std::ostream & operator << (std::ostream & s, const SparseMatrix& m) - { - EIGEN_DBG_SPARSE( - s << "Nonzero entries:\n"; - if(m.isCompressed()) - { - for (Index i=0; i&>(m); - return s; - } - - /** Destructor */ - inline ~SparseMatrix() - { - std::free(m_outerIndex); - std::free(m_innerNonZeros); - } - - /** Overloaded for performance */ - Scalar sum() const; - -# ifdef EIGEN_SPARSEMATRIX_PLUGIN -# include EIGEN_SPARSEMATRIX_PLUGIN -# endif - -protected: - - template - void initAssignment(const Other& other) - { - resize(other.rows(), other.cols()); - if(m_innerNonZeros) - { - std::free(m_innerNonZeros); - m_innerNonZeros = 0; - } - } - - /** \internal - * \sa insert(Index,Index) */ - EIGEN_DONT_INLINE Scalar& insertCompressed(Index row, Index col); - - /** \internal - * A vector object that is equal to 0 everywhere but v at the position i */ - class SingletonVector - { - StorageIndex m_index; - StorageIndex m_value; - public: - typedef StorageIndex value_type; - SingletonVector(Index i, Index v) - : m_index(convert_index(i)), m_value(convert_index(v)) - {} - - StorageIndex operator[](Index i) const { return i==m_index ? m_value : 0; } - }; - - /** \internal - * \sa insert(Index,Index) */ - EIGEN_DONT_INLINE Scalar& insertUncompressed(Index row, Index col); - -public: - /** \internal - * \sa insert(Index,Index) */ - EIGEN_STRONG_INLINE Scalar& insertBackUncompressed(Index row, Index col) - { - const Index outer = IsRowMajor ? row : col; - const Index inner = IsRowMajor ? col : row; - - eigen_assert(!isCompressed()); - eigen_assert(m_innerNonZeros[outer]<=(m_outerIndex[outer+1] - m_outerIndex[outer])); - - Index p = m_outerIndex[outer] + m_innerNonZeros[outer]++; - m_data.index(p) = convert_index(inner); - return (m_data.value(p) = 0); - } - -private: - static void check_template_parameters() - { - EIGEN_STATIC_ASSERT(NumTraits::IsSigned,THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE); - EIGEN_STATIC_ASSERT((Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS); - } - - struct default_prunning_func { - default_prunning_func(const Scalar& ref, const RealScalar& eps) : reference(ref), epsilon(eps) {} - inline bool operator() (const Index&, const Index&, const Scalar& value) const - { - return !internal::isMuchSmallerThan(value, reference, epsilon); - } - Scalar reference; - RealScalar epsilon; - }; -}; - -namespace internal { - -template -void set_from_triplets(const InputIterator& begin, const InputIterator& end, SparseMatrixType& mat, DupFunctor dup_func) -{ - enum { IsRowMajor = SparseMatrixType::IsRowMajor }; - typedef typename SparseMatrixType::Scalar Scalar; - typedef typename SparseMatrixType::StorageIndex StorageIndex; - SparseMatrix trMat(mat.rows(),mat.cols()); - - if(begin!=end) - { - // pass 1: count the nnz per inner-vector - typename SparseMatrixType::IndexVector wi(trMat.outerSize()); - wi.setZero(); - for(InputIterator it(begin); it!=end; ++it) - { - eigen_assert(it->row()>=0 && it->row()col()>=0 && it->col()col() : it->row())++; - } - - // pass 2: insert all the elements into trMat - trMat.reserve(wi); - for(InputIterator it(begin); it!=end; ++it) - trMat.insertBackUncompressed(it->row(),it->col()) = it->value(); - - // pass 3: - trMat.collapseDuplicates(dup_func); - } - - // pass 4: transposed copy -> implicit sorting - mat = trMat; -} - -} - - -/** Fill the matrix \c *this with the list of \em triplets defined by the iterator range \a begin - \a end. - * - * A \em triplet is a tuple (i,j,value) defining a non-zero element. - * The input list of triplets does not have to be sorted, and can contains duplicated elements. - * In any case, the result is a \b sorted and \b compressed sparse matrix where the duplicates have been summed up. - * This is a \em O(n) operation, with \em n the number of triplet elements. - * The initial contents of \c *this is destroyed. - * The matrix \c *this must be properly resized beforehand using the SparseMatrix(Index,Index) constructor, - * or the resize(Index,Index) method. The sizes are not extracted from the triplet list. - * - * The \a InputIterators value_type must provide the following interface: - * \code - * Scalar value() const; // the value - * Scalar row() const; // the row index i - * Scalar col() const; // the column index j - * \endcode - * See for instance the Eigen::Triplet template class. - * - * Here is a typical usage example: - * \code - typedef Triplet T; - std::vector tripletList; - triplets.reserve(estimation_of_entries); - for(...) - { - // ... - tripletList.push_back(T(i,j,v_ij)); - } - SparseMatrixType m(rows,cols); - m.setFromTriplets(tripletList.begin(), tripletList.end()); - // m is ready to go! - * \endcode - * - * \warning The list of triplets is read multiple times (at least twice). Therefore, it is not recommended to define - * an abstract iterator over a complex data-structure that would be expensive to evaluate. The triplets should rather - * be explicitely stored into a std::vector for instance. - */ -template -template -void SparseMatrix::setFromTriplets(const InputIterators& begin, const InputIterators& end) -{ - internal::set_from_triplets >(begin, end, *this, internal::scalar_sum_op()); -} - -/** The same as setFromTriplets but when duplicates are met the functor \a dup_func is applied: - * \code - * value = dup_func(OldValue, NewValue) - * \endcode - * Here is a C++11 example keeping the latest entry only: - * \code - * mat.setFromTriplets(triplets.begin(), triplets.end(), [] (const Scalar&,const Scalar &b) { return b; }); - * \endcode - */ -template -template -void SparseMatrix::setFromTriplets(const InputIterators& begin, const InputIterators& end, DupFunctor dup_func) -{ - internal::set_from_triplets, DupFunctor>(begin, end, *this, dup_func); -} - -/** \internal */ -template -template -void SparseMatrix::collapseDuplicates(DupFunctor dup_func) -{ - eigen_assert(!isCompressed()); - // TODO, in practice we should be able to use m_innerNonZeros for that task - IndexVector wi(innerSize()); - wi.fill(-1); - StorageIndex count = 0; - // for each inner-vector, wi[inner_index] will hold the position of first element into the index/value buffers - for(Index j=0; j=start) - { - // we already meet this entry => accumulate it - m_data.value(wi(i)) = dup_func(m_data.value(wi(i)), m_data.value(k)); - } - else - { - m_data.value(count) = m_data.value(k); - m_data.index(count) = m_data.index(k); - wi(i) = count; - ++count; - } - } - m_outerIndex[j] = start; - } - m_outerIndex[m_outerSize] = count; - - // turn the matrix into compressed form - std::free(m_innerNonZeros); - m_innerNonZeros = 0; - m_data.resize(m_outerIndex[m_outerSize]); -} - -template -template -EIGEN_DONT_INLINE SparseMatrix& SparseMatrix::operator=(const SparseMatrixBase& other) -{ - EIGEN_STATIC_ASSERT((internal::is_same::value), - YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) - - #ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - #endif - - const bool needToTranspose = (Flags & RowMajorBit) != (internal::evaluator::Flags & RowMajorBit); - if (needToTranspose) - { - #ifdef EIGEN_SPARSE_TRANSPOSED_COPY_PLUGIN - EIGEN_SPARSE_TRANSPOSED_COPY_PLUGIN - #endif - // two passes algorithm: - // 1 - compute the number of coeffs per dest inner vector - // 2 - do the actual copy/eval - // Since each coeff of the rhs has to be evaluated twice, let's evaluate it if needed - typedef typename internal::nested_eval::type >::type OtherCopy; - typedef typename internal::remove_all::type _OtherCopy; - typedef internal::evaluator<_OtherCopy> OtherCopyEval; - OtherCopy otherCopy(other.derived()); - OtherCopyEval otherCopyEval(otherCopy); - - SparseMatrix dest(other.rows(),other.cols()); - Eigen::Map (dest.m_outerIndex,dest.outerSize()).setZero(); - - // pass 1 - // FIXME the above copy could be merged with that pass - for (Index j=0; jswap(dest); - return *this; - } - else - { - if(other.isRValue()) - { - initAssignment(other.derived()); - } - // there is no special optimization - return Base::operator=(other.derived()); - } -} - -template -typename SparseMatrix<_Scalar,_Options,_StorageIndex>::Scalar& SparseMatrix<_Scalar,_Options,_StorageIndex>::insert(Index row, Index col) -{ - eigen_assert(row>=0 && row=0 && col(std::malloc(m_outerSize * sizeof(StorageIndex))); - if(!m_innerNonZeros) internal::throw_std_bad_alloc(); - - memset(m_innerNonZeros, 0, (m_outerSize)*sizeof(StorageIndex)); - - // pack all inner-vectors to the end of the pre-allocated space - // and allocate the entire free-space to the first inner-vector - StorageIndex end = convert_index(m_data.allocatedSize()); - for(Index j=1; j<=m_outerSize; ++j) - m_outerIndex[j] = end; - } - else - { - // turn the matrix into non-compressed mode - m_innerNonZeros = static_cast(std::malloc(m_outerSize * sizeof(StorageIndex))); - if(!m_innerNonZeros) internal::throw_std_bad_alloc(); - for(Index j=0; j=0 && m_innerNonZeros[j]==0) - m_outerIndex[j--] = p; - - // push back the new element - ++m_innerNonZeros[outer]; - m_data.append(Scalar(0), inner); - - // check for reallocation - if(data_end != m_data.allocatedSize()) - { - // m_data has been reallocated - // -> move remaining inner-vectors back to the end of the free-space - // so that the entire free-space is allocated to the current inner-vector. - eigen_internal_assert(data_end < m_data.allocatedSize()); - StorageIndex new_end = convert_index(m_data.allocatedSize()); - for(Index k=outer+1; k<=m_outerSize; ++k) - if(m_outerIndex[k]==data_end) - m_outerIndex[k] = new_end; - } - return m_data.value(p); - } - - // Second case: the next inner-vector is packed to the end - // and the current inner-vector end match the used-space. - if(m_outerIndex[outer+1]==data_end && m_outerIndex[outer]+m_innerNonZeros[outer]==m_data.size()) - { - eigen_internal_assert(outer+1==m_outerSize || m_innerNonZeros[outer+1]==0); - - // add space for the new element - ++m_innerNonZeros[outer]; - m_data.resize(m_data.size()+1); - - // check for reallocation - if(data_end != m_data.allocatedSize()) - { - // m_data has been reallocated - // -> move remaining inner-vectors back to the end of the free-space - // so that the entire free-space is allocated to the current inner-vector. - eigen_internal_assert(data_end < m_data.allocatedSize()); - StorageIndex new_end = convert_index(m_data.allocatedSize()); - for(Index k=outer+1; k<=m_outerSize; ++k) - if(m_outerIndex[k]==data_end) - m_outerIndex[k] = new_end; - } - - // and insert it at the right position (sorted insertion) - Index startId = m_outerIndex[outer]; - Index p = m_outerIndex[outer]+m_innerNonZeros[outer]-1; - while ( (p > startId) && (m_data.index(p-1) > inner) ) - { - m_data.index(p) = m_data.index(p-1); - m_data.value(p) = m_data.value(p-1); - --p; - } - - m_data.index(p) = convert_index(inner); - return (m_data.value(p) = 0); - } - - if(m_data.size() != m_data.allocatedSize()) - { - // make sure the matrix is compatible to random un-compressed insertion: - m_data.resize(m_data.allocatedSize()); - this->reserveInnerVectors(Array::Constant(m_outerSize, 2)); - } - - return insertUncompressed(row,col); -} - -template -EIGEN_DONT_INLINE typename SparseMatrix<_Scalar,_Options,_StorageIndex>::Scalar& SparseMatrix<_Scalar,_Options,_StorageIndex>::insertUncompressed(Index row, Index col) -{ - eigen_assert(!isCompressed()); - - const Index outer = IsRowMajor ? row : col; - const StorageIndex inner = convert_index(IsRowMajor ? col : row); - - Index room = m_outerIndex[outer+1] - m_outerIndex[outer]; - StorageIndex innerNNZ = m_innerNonZeros[outer]; - if(innerNNZ>=room) - { - // this inner vector is full, we need to reallocate the whole buffer :( - reserve(SingletonVector(outer,std::max(2,innerNNZ))); - } - - Index startId = m_outerIndex[outer]; - Index p = startId + m_innerNonZeros[outer]; - while ( (p > startId) && (m_data.index(p-1) > inner) ) - { - m_data.index(p) = m_data.index(p-1); - m_data.value(p) = m_data.value(p-1); - --p; - } - eigen_assert((p<=startId || m_data.index(p-1)!=inner) && "you cannot insert an element that already exists, you must call coeffRef to this end"); - - m_innerNonZeros[outer]++; - - m_data.index(p) = inner; - return (m_data.value(p) = 0); -} - -template -EIGEN_DONT_INLINE typename SparseMatrix<_Scalar,_Options,_StorageIndex>::Scalar& SparseMatrix<_Scalar,_Options,_StorageIndex>::insertCompressed(Index row, Index col) -{ - eigen_assert(isCompressed()); - - const Index outer = IsRowMajor ? row : col; - const Index inner = IsRowMajor ? col : row; - - Index previousOuter = outer; - if (m_outerIndex[outer+1]==0) - { - // we start a new inner vector - while (previousOuter>=0 && m_outerIndex[previousOuter]==0) - { - m_outerIndex[previousOuter] = convert_index(m_data.size()); - --previousOuter; - } - m_outerIndex[outer+1] = m_outerIndex[outer]; - } - - // here we have to handle the tricky case where the outerIndex array - // starts with: [ 0 0 0 0 0 1 ...] and we are inserted in, e.g., - // the 2nd inner vector... - bool isLastVec = (!(previousOuter==-1 && m_data.size()!=0)) - && (std::size_t(m_outerIndex[outer+1]) == m_data.size()); - - std::size_t startId = m_outerIndex[outer]; - // FIXME let's make sure sizeof(long int) == sizeof(std::size_t) - std::size_t p = m_outerIndex[outer+1]; - ++m_outerIndex[outer+1]; - - double reallocRatio = 1; - if (m_data.allocatedSize()<=m_data.size()) - { - // if there is no preallocated memory, let's reserve a minimum of 32 elements - if (m_data.size()==0) - { - m_data.reserve(32); - } - else - { - // we need to reallocate the data, to reduce multiple reallocations - // we use a smart resize algorithm based on the current filling ratio - // in addition, we use double to avoid integers overflows - double nnzEstimate = double(m_outerIndex[outer])*double(m_outerSize)/double(outer+1); - reallocRatio = (nnzEstimate-double(m_data.size()))/double(m_data.size()); - // furthermore we bound the realloc ratio to: - // 1) reduce multiple minor realloc when the matrix is almost filled - // 2) avoid to allocate too much memory when the matrix is almost empty - reallocRatio = (std::min)((std::max)(reallocRatio,1.5),8.); - } - } - m_data.resize(m_data.size()+1,reallocRatio); - - if (!isLastVec) - { - if (previousOuter==-1) - { - // oops wrong guess. - // let's correct the outer offsets - for (Index k=0; k<=(outer+1); ++k) - m_outerIndex[k] = 0; - Index k=outer+1; - while(m_outerIndex[k]==0) - m_outerIndex[k++] = 1; - while (k<=m_outerSize && m_outerIndex[k]!=0) - m_outerIndex[k++]++; - p = 0; - --k; - k = m_outerIndex[k]-1; - while (k>0) - { - m_data.index(k) = m_data.index(k-1); - m_data.value(k) = m_data.value(k-1); - k--; - } - } - else - { - // we are not inserting into the last inner vec - // update outer indices: - Index j = outer+2; - while (j<=m_outerSize && m_outerIndex[j]!=0) - m_outerIndex[j++]++; - --j; - // shift data of last vecs: - Index k = m_outerIndex[j]-1; - while (k>=Index(p)) - { - m_data.index(k) = m_data.index(k-1); - m_data.value(k) = m_data.value(k-1); - k--; - } - } - } - - while ( (p > startId) && (m_data.index(p-1) > inner) ) - { - m_data.index(p) = m_data.index(p-1); - m_data.value(p) = m_data.value(p-1); - --p; - } - - m_data.index(p) = inner; - return (m_data.value(p) = 0); -} - -namespace internal { - -template -struct evaluator > - : evaluator > > -{ - typedef evaluator > > Base; - typedef SparseMatrix<_Scalar,_Options,_StorageIndex> SparseMatrixType; - evaluator() : Base() {} - explicit evaluator(const SparseMatrixType &mat) : Base(mat) {} -}; - -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSEMATRIX_H diff --git a/Eigen/src/SparseCore/SparseMatrixBase.h b/Eigen/src/SparseCore/SparseMatrixBase.h deleted file mode 100644 index c6b548f11..000000000 --- a/Eigen/src/SparseCore/SparseMatrixBase.h +++ /dev/null @@ -1,405 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEMATRIXBASE_H -#define EIGEN_SPARSEMATRIXBASE_H - -namespace Eigen { - -/** \ingroup SparseCore_Module - * - * \class SparseMatrixBase - * - * \brief Base class of any sparse matrices or sparse expressions - * - * \tparam Derived is the derived type, e.g. a sparse matrix type, or an expression, etc. - * - * This class can be extended with the help of the plugin mechanism described on the page - * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_SPARSEMATRIXBASE_PLUGIN. - */ -template class SparseMatrixBase - : public EigenBase -{ - public: - - typedef typename internal::traits::Scalar Scalar; - - /** The numeric type of the expression' coefficients, e.g. float, double, int or std::complex, etc. - * - * It is an alias for the Scalar type */ - typedef Scalar value_type; - - typedef typename internal::packet_traits::type PacketScalar; - typedef typename internal::traits::StorageKind StorageKind; - - /** The integer type used to \b store indices within a SparseMatrix. - * For a \c SparseMatrix it an alias of the third template parameter \c IndexType. */ - typedef typename internal::traits::StorageIndex StorageIndex; - - typedef typename internal::add_const_on_value_type_if_arithmetic< - typename internal::packet_traits::type - >::type PacketReturnType; - - typedef SparseMatrixBase StorageBaseType; - - typedef Matrix IndexVector; - typedef Matrix ScalarVector; - - template - Derived& operator=(const EigenBase &other); - - enum { - - RowsAtCompileTime = internal::traits::RowsAtCompileTime, - /**< The number of rows at compile-time. This is just a copy of the value provided - * by the \a Derived type. If a value is not known at compile-time, - * it is set to the \a Dynamic constant. - * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */ - - ColsAtCompileTime = internal::traits::ColsAtCompileTime, - /**< The number of columns at compile-time. This is just a copy of the value provided - * by the \a Derived type. If a value is not known at compile-time, - * it is set to the \a Dynamic constant. - * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */ - - - SizeAtCompileTime = (internal::size_at_compile_time::RowsAtCompileTime, - internal::traits::ColsAtCompileTime>::ret), - /**< This is equal to the number of coefficients, i.e. the number of - * rows times the number of columns, or to \a Dynamic if this is not - * known at compile-time. \sa RowsAtCompileTime, ColsAtCompileTime */ - - MaxRowsAtCompileTime = RowsAtCompileTime, - MaxColsAtCompileTime = ColsAtCompileTime, - - MaxSizeAtCompileTime = (internal::size_at_compile_time::ret), - - IsVectorAtCompileTime = RowsAtCompileTime == 1 || ColsAtCompileTime == 1, - /**< This is set to true if either the number of rows or the number of - * columns is known at compile-time to be equal to 1. Indeed, in that case, - * we are dealing with a column-vector (if there is only one column) or with - * a row-vector (if there is only one row). */ - - Flags = internal::traits::Flags, - /**< This stores expression \ref flags flags which may or may not be inherited by new expressions - * constructed from this one. See the \ref flags "list of flags". - */ - - IsRowMajor = Flags&RowMajorBit ? 1 : 0, - - InnerSizeAtCompileTime = int(IsVectorAtCompileTime) ? int(SizeAtCompileTime) - : int(IsRowMajor) ? int(ColsAtCompileTime) : int(RowsAtCompileTime), - - #ifndef EIGEN_PARSED_BY_DOXYGEN - _HasDirectAccess = (int(Flags)&DirectAccessBit) ? 1 : 0 // workaround sunCC - #endif - }; - - /** \internal the return type of MatrixBase::adjoint() */ - typedef typename internal::conditional::IsComplex, - CwiseUnaryOp, Eigen::Transpose >, - Transpose - >::type AdjointReturnType; - typedef Transpose TransposeReturnType; - typedef typename internal::add_const >::type ConstTransposeReturnType; - - // FIXME storage order do not match evaluator storage order - typedef SparseMatrix PlainObject; - -#ifndef EIGEN_PARSED_BY_DOXYGEN - /** This is the "real scalar" type; if the \a Scalar type is already real numbers - * (e.g. int, float or double) then \a RealScalar is just the same as \a Scalar. If - * \a Scalar is \a std::complex then RealScalar is \a T. - * - * \sa class NumTraits - */ - typedef typename NumTraits::Real RealScalar; - - /** \internal the return type of coeff() - */ - typedef typename internal::conditional<_HasDirectAccess, const Scalar&, Scalar>::type CoeffReturnType; - - /** \internal Represents a matrix with all coefficients equal to one another*/ - typedef CwiseNullaryOp,Matrix > ConstantReturnType; - - /** type of the equivalent dense matrix */ - typedef Matrix DenseMatrixType; - /** type of the equivalent square matrix */ - typedef Matrix SquareMatrixType; - - inline const Derived& derived() const { return *static_cast(this); } - inline Derived& derived() { return *static_cast(this); } - inline Derived& const_cast_derived() const - { return *static_cast(const_cast(this)); } - - typedef EigenBase Base; - -#endif // not EIGEN_PARSED_BY_DOXYGEN - -#define EIGEN_CURRENT_STORAGE_BASE_CLASS Eigen::SparseMatrixBase -#ifdef EIGEN_PARSED_BY_DOXYGEN -#define EIGEN_DOC_UNARY_ADDONS(METHOD,OP) /**

This method does not change the sparsity of \c *this: the OP is applied to explicitly stored coefficients only. \sa SparseCompressedBase::coeffs()

*/ -#define EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL /**

\warning This method returns a read-only expression for any sparse matrices. \sa \ref TutorialSparse_SubMatrices "Sparse block operations"

*/ -#define EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(COND) /**

\warning This method returns a read-write expression for COND sparse matrices only. Otherwise, the returned expression is read-only. \sa \ref TutorialSparse_SubMatrices "Sparse block operations"

*/ -#else -#define EIGEN_DOC_UNARY_ADDONS(X,Y) -#define EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -#define EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(COND) -#endif -# include "../plugins/CommonCwiseUnaryOps.h" -# include "../plugins/CommonCwiseBinaryOps.h" -# include "../plugins/MatrixCwiseUnaryOps.h" -# include "../plugins/MatrixCwiseBinaryOps.h" -# include "../plugins/BlockMethods.h" -# ifdef EIGEN_SPARSEMATRIXBASE_PLUGIN -# include EIGEN_SPARSEMATRIXBASE_PLUGIN -# endif -#undef EIGEN_CURRENT_STORAGE_BASE_CLASS -#undef EIGEN_DOC_UNARY_ADDONS -#undef EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -#undef EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF - - /** \returns the number of rows. \sa cols() */ - inline Index rows() const { return derived().rows(); } - /** \returns the number of columns. \sa rows() */ - inline Index cols() const { return derived().cols(); } - /** \returns the number of coefficients, which is \a rows()*cols(). - * \sa rows(), cols(). */ - inline Index size() const { return rows() * cols(); } - /** \returns true if either the number of rows or the number of columns is equal to 1. - * In other words, this function returns - * \code rows()==1 || cols()==1 \endcode - * \sa rows(), cols(), IsVectorAtCompileTime. */ - inline bool isVector() const { return rows()==1 || cols()==1; } - /** \returns the size of the storage major dimension, - * i.e., the number of columns for a columns major matrix, and the number of rows otherwise */ - Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); } - /** \returns the size of the inner dimension according to the storage order, - * i.e., the number of rows for a columns major matrix, and the number of cols otherwise */ - Index innerSize() const { return (int(Flags)&RowMajorBit) ? this->cols() : this->rows(); } - - bool isRValue() const { return m_isRValue; } - Derived& markAsRValue() { m_isRValue = true; return derived(); } - - SparseMatrixBase() : m_isRValue(false) { /* TODO check flags */ } - - - template - Derived& operator=(const ReturnByValue& other); - - template - inline Derived& operator=(const SparseMatrixBase& other); - - inline Derived& operator=(const Derived& other); - - protected: - - template - inline Derived& assign(const OtherDerived& other); - - template - inline void assignGeneric(const OtherDerived& other); - - public: - - friend std::ostream & operator << (std::ostream & s, const SparseMatrixBase& m) - { - typedef typename Derived::Nested Nested; - typedef typename internal::remove_all::type NestedCleaned; - - if (Flags&RowMajorBit) - { - Nested nm(m.derived()); - internal::evaluator thisEval(nm); - for (Index row=0; row::InnerIterator it(thisEval, row); it; ++it) - { - for ( ; col thisEval(nm); - if (m.cols() == 1) { - Index row = 0; - for (typename internal::evaluator::InnerIterator it(thisEval, 0); it; ++it) - { - for ( ; row trans = m; - s << static_cast >&>(trans); - } - } - return s; - } - - template - Derived& operator+=(const SparseMatrixBase& other); - template - Derived& operator-=(const SparseMatrixBase& other); - - template - Derived& operator+=(const DiagonalBase& other); - template - Derived& operator-=(const DiagonalBase& other); - - template - Derived& operator+=(const EigenBase &other); - template - Derived& operator-=(const EigenBase &other); - - Derived& operator*=(const Scalar& other); - Derived& operator/=(const Scalar& other); - - template struct CwiseProductDenseReturnType { - typedef CwiseBinaryOp::Scalar, - typename internal::traits::Scalar - >::ReturnType>, - const Derived, - const OtherDerived - > Type; - }; - - template - EIGEN_STRONG_INLINE const typename CwiseProductDenseReturnType::Type - cwiseProduct(const MatrixBase &other) const; - - // sparse * diagonal - template - const Product - operator*(const DiagonalBase &other) const - { return Product(derived(), other.derived()); } - - // diagonal * sparse - template friend - const Product - operator*(const DiagonalBase &lhs, const SparseMatrixBase& rhs) - { return Product(lhs.derived(), rhs.derived()); } - - // sparse * sparse - template - const Product - operator*(const SparseMatrixBase &other) const; - - // sparse * dense - template - const Product - operator*(const MatrixBase &other) const - { return Product(derived(), other.derived()); } - - // dense * sparse - template friend - const Product - operator*(const MatrixBase &lhs, const SparseMatrixBase& rhs) - { return Product(lhs.derived(), rhs.derived()); } - - /** \returns an expression of P H P^-1 where H is the matrix represented by \c *this */ - SparseSymmetricPermutationProduct twistedBy(const PermutationMatrix& perm) const - { - return SparseSymmetricPermutationProduct(derived(), perm); - } - - template - Derived& operator*=(const SparseMatrixBase& other); - - template - inline const TriangularView triangularView() const; - - template struct SelfAdjointViewReturnType { typedef SparseSelfAdjointView Type; }; - template struct ConstSelfAdjointViewReturnType { typedef const SparseSelfAdjointView Type; }; - - template inline - typename ConstSelfAdjointViewReturnType::Type selfadjointView() const; - template inline - typename SelfAdjointViewReturnType::Type selfadjointView(); - - template Scalar dot(const MatrixBase& other) const; - template Scalar dot(const SparseMatrixBase& other) const; - RealScalar squaredNorm() const; - RealScalar norm() const; - RealScalar blueNorm() const; - - TransposeReturnType transpose() { return TransposeReturnType(derived()); } - const ConstTransposeReturnType transpose() const { return ConstTransposeReturnType(derived()); } - const AdjointReturnType adjoint() const { return AdjointReturnType(transpose()); } - - // inner-vector - typedef Block InnerVectorReturnType; - typedef Block ConstInnerVectorReturnType; - InnerVectorReturnType innerVector(Index outer); - const ConstInnerVectorReturnType innerVector(Index outer) const; - - // set of inner-vectors - typedef Block InnerVectorsReturnType; - typedef Block ConstInnerVectorsReturnType; - InnerVectorsReturnType innerVectors(Index outerStart, Index outerSize); - const ConstInnerVectorsReturnType innerVectors(Index outerStart, Index outerSize) const; - - DenseMatrixType toDense() const - { - return DenseMatrixType(derived()); - } - - template - bool isApprox(const SparseMatrixBase& other, - const RealScalar& prec = NumTraits::dummy_precision()) const; - - template - bool isApprox(const MatrixBase& other, - const RealScalar& prec = NumTraits::dummy_precision()) const - { return toDense().isApprox(other,prec); } - - /** \returns the matrix or vector obtained by evaluating this expression. - * - * Notice that in the case of a plain matrix or vector (not an expression) this function just returns - * a const reference, in order to avoid a useless copy. - */ - inline const typename internal::eval::type eval() const - { return typename internal::eval::type(derived()); } - - Scalar sum() const; - - inline const SparseView - pruned(const Scalar& reference = Scalar(0), const RealScalar& epsilon = NumTraits::dummy_precision()) const; - - protected: - - bool m_isRValue; - - static inline StorageIndex convert_index(const Index idx) { - return internal::convert_index(idx); - } - private: - template void evalTo(Dest &) const; -}; - -} // end namespace Eigen - -#endif // EIGEN_SPARSEMATRIXBASE_H diff --git a/Eigen/src/SparseCore/SparsePermutation.h b/Eigen/src/SparseCore/SparsePermutation.h deleted file mode 100644 index ef38357ae..000000000 --- a/Eigen/src/SparseCore/SparsePermutation.h +++ /dev/null @@ -1,178 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_PERMUTATION_H -#define EIGEN_SPARSE_PERMUTATION_H - -// This file implements sparse * permutation products - -namespace Eigen { - -namespace internal { - -template -struct permutation_matrix_product -{ - typedef typename nested_eval::type MatrixType; - typedef typename remove_all::type MatrixTypeCleaned; - - typedef typename MatrixTypeCleaned::Scalar Scalar; - typedef typename MatrixTypeCleaned::StorageIndex StorageIndex; - - enum { - SrcStorageOrder = MatrixTypeCleaned::Flags&RowMajorBit ? RowMajor : ColMajor, - MoveOuter = SrcStorageOrder==RowMajor ? Side==OnTheLeft : Side==OnTheRight - }; - - typedef typename internal::conditional, - SparseMatrix >::type ReturnType; - - template - static inline void run(Dest& dst, const PermutationType& perm, const ExpressionType& xpr) - { - MatrixType mat(xpr); - if(MoveOuter) - { - SparseMatrix tmp(mat.rows(), mat.cols()); - Matrix sizes(mat.outerSize()); - for(Index j=0; j tmp(mat.rows(), mat.cols()); - Matrix sizes(tmp.outerSize()); - sizes.setZero(); - PermutationMatrix perm_cpy; - if((Side==OnTheLeft) ^ Transposed) - perm_cpy = perm; - else - perm_cpy = perm.transpose(); - - for(Index j=0; j struct product_promote_storage_type { typedef Sparse ret; }; -template struct product_promote_storage_type { typedef Sparse ret; }; - -// TODO, the following two overloads are only needed to define the right temporary type through -// typename traits >::ReturnType -// whereas it should be correctly handled by traits >::PlainObject - -template -struct product_evaluator, ProductTag, PermutationShape, SparseShape> - : public evaluator::ReturnType> -{ - typedef Product XprType; - typedef typename permutation_matrix_product::ReturnType PlainObject; - typedef evaluator Base; - - enum { - Flags = Base::Flags | EvalBeforeNestingBit - }; - - explicit product_evaluator(const XprType& xpr) - : m_result(xpr.rows(), xpr.cols()) - { - ::new (static_cast(this)) Base(m_result); - generic_product_impl::evalTo(m_result, xpr.lhs(), xpr.rhs()); - } - -protected: - PlainObject m_result; -}; - -template -struct product_evaluator, ProductTag, SparseShape, PermutationShape > - : public evaluator::ReturnType> -{ - typedef Product XprType; - typedef typename permutation_matrix_product::ReturnType PlainObject; - typedef evaluator Base; - - enum { - Flags = Base::Flags | EvalBeforeNestingBit - }; - - explicit product_evaluator(const XprType& xpr) - : m_result(xpr.rows(), xpr.cols()) - { - ::new (static_cast(this)) Base(m_result); - generic_product_impl::evalTo(m_result, xpr.lhs(), xpr.rhs()); - } - -protected: - PlainObject m_result; -}; - -} // end namespace internal - -/** \returns the matrix with the permutation applied to the columns - */ -template -inline const Product -operator*(const SparseMatrixBase& matrix, const PermutationBase& perm) -{ return Product(matrix.derived(), perm.derived()); } - -/** \returns the matrix with the permutation applied to the rows - */ -template -inline const Product -operator*( const PermutationBase& perm, const SparseMatrixBase& matrix) -{ return Product(perm.derived(), matrix.derived()); } - - -/** \returns the matrix with the inverse permutation applied to the columns. - */ -template -inline const Product, AliasFreeProduct> -operator*(const SparseMatrixBase& matrix, const InverseImpl& tperm) -{ - return Product, AliasFreeProduct>(matrix.derived(), tperm.derived()); -} - -/** \returns the matrix with the inverse permutation applied to the rows. - */ -template -inline const Product, SparseDerived, AliasFreeProduct> -operator*(const InverseImpl& tperm, const SparseMatrixBase& matrix) -{ - return Product, SparseDerived, AliasFreeProduct>(tperm.derived(), matrix.derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_SELFADJOINTVIEW_H diff --git a/Eigen/src/SparseCore/SparseProduct.h b/Eigen/src/SparseCore/SparseProduct.h deleted file mode 100644 index 4cbf68781..000000000 --- a/Eigen/src/SparseCore/SparseProduct.h +++ /dev/null @@ -1,169 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEPRODUCT_H -#define EIGEN_SPARSEPRODUCT_H - -namespace Eigen { - -/** \returns an expression of the product of two sparse matrices. - * By default a conservative product preserving the symbolic non zeros is performed. - * The automatic pruning of the small values can be achieved by calling the pruned() function - * in which case a totally different product algorithm is employed: - * \code - * C = (A*B).pruned(); // supress numerical zeros (exact) - * C = (A*B).pruned(ref); - * C = (A*B).pruned(ref,epsilon); - * \endcode - * where \c ref is a meaningful non zero reference value. - * */ -template -template -inline const Product -SparseMatrixBase::operator*(const SparseMatrixBase &other) const -{ - return Product(derived(), other.derived()); -} - -namespace internal { - -// sparse * sparse -template -struct generic_product_impl -{ - template - static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) - { - evalTo(dst, lhs, rhs, typename evaluator_traits::Shape()); - } - - // dense += sparse * sparse - template - static void addTo(Dest& dst, const ActualLhs& lhs, const Rhs& rhs, typename enable_if::Shape,DenseShape>::value,int*>::type* = 0) - { - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(lhs); - RhsNested rhsNested(rhs); - internal::sparse_sparse_to_dense_product_selector::type, - typename remove_all::type, Dest>::run(lhsNested,rhsNested,dst); - } - - // dense -= sparse * sparse - template - static void subTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, typename enable_if::Shape,DenseShape>::value,int*>::type* = 0) - { - addTo(dst, -lhs, rhs); - } - -protected: - - // sparse = sparse * sparse - template - static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, SparseShape) - { - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(lhs); - RhsNested rhsNested(rhs); - internal::conservative_sparse_sparse_product_selector::type, - typename remove_all::type, Dest>::run(lhsNested,rhsNested,dst); - } - - // dense = sparse * sparse - template - static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, DenseShape) - { - dst.setZero(); - addTo(dst, lhs, rhs); - } -}; - -// sparse * sparse-triangular -template -struct generic_product_impl - : public generic_product_impl -{}; - -// sparse-triangular * sparse -template -struct generic_product_impl - : public generic_product_impl -{}; - -// dense = sparse-product (can be sparse*sparse, sparse*perm, etc.) -template< typename DstXprType, typename Lhs, typename Rhs> -struct Assignment, internal::assign_op::Scalar>, Sparse2Dense> -{ - typedef Product SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &) - { - Index dstRows = src.rows(); - Index dstCols = src.cols(); - if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) - dst.resize(dstRows, dstCols); - - generic_product_impl::evalTo(dst,src.lhs(),src.rhs()); - } -}; - -// dense += sparse-product (can be sparse*sparse, sparse*perm, etc.) -template< typename DstXprType, typename Lhs, typename Rhs> -struct Assignment, internal::add_assign_op::Scalar>, Sparse2Dense> -{ - typedef Product SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op &) - { - generic_product_impl::addTo(dst,src.lhs(),src.rhs()); - } -}; - -// dense -= sparse-product (can be sparse*sparse, sparse*perm, etc.) -template< typename DstXprType, typename Lhs, typename Rhs> -struct Assignment, internal::sub_assign_op::Scalar>, Sparse2Dense> -{ - typedef Product SrcXprType; - static void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op &) - { - generic_product_impl::subTo(dst,src.lhs(),src.rhs()); - } -}; - -template -struct unary_evaluator >, IteratorBased> - : public evaluator::PlainObject> -{ - typedef SparseView > XprType; - typedef typename XprType::PlainObject PlainObject; - typedef evaluator Base; - - explicit unary_evaluator(const XprType& xpr) - : m_result(xpr.rows(), xpr.cols()) - { - using std::abs; - ::new (static_cast(this)) Base(m_result); - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(xpr.nestedExpression().lhs()); - RhsNested rhsNested(xpr.nestedExpression().rhs()); - - internal::sparse_sparse_product_with_pruning_selector::type, - typename remove_all::type, PlainObject>::run(lhsNested,rhsNested,m_result, - abs(xpr.reference())*xpr.epsilon()); - } - -protected: - PlainObject m_result; -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSEPRODUCT_H diff --git a/Eigen/src/SparseCore/SparseRedux.h b/Eigen/src/SparseCore/SparseRedux.h deleted file mode 100644 index 458774962..000000000 --- a/Eigen/src/SparseCore/SparseRedux.h +++ /dev/null @@ -1,49 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEREDUX_H -#define EIGEN_SPARSEREDUX_H - -namespace Eigen { - -template -typename internal::traits::Scalar -SparseMatrixBase::sum() const -{ - eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix"); - Scalar res(0); - internal::evaluator thisEval(derived()); - for (Index j=0; j::InnerIterator iter(thisEval,j); iter; ++iter) - res += iter.value(); - return res; -} - -template -typename internal::traits >::Scalar -SparseMatrix<_Scalar,_Options,_Index>::sum() const -{ - eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix"); - if(this->isCompressed()) - return Matrix::Map(m_data.valuePtr(), m_data.size()).sum(); - else - return Base::sum(); -} - -template -typename internal::traits >::Scalar -SparseVector<_Scalar,_Options,_Index>::sum() const -{ - eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix"); - return Matrix::Map(m_data.valuePtr(), m_data.size()).sum(); -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSEREDUX_H diff --git a/Eigen/src/SparseCore/SparseRef.h b/Eigen/src/SparseCore/SparseRef.h deleted file mode 100644 index d91f38f97..000000000 --- a/Eigen/src/SparseCore/SparseRef.h +++ /dev/null @@ -1,397 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_REF_H -#define EIGEN_SPARSE_REF_H - -namespace Eigen { - -enum { - StandardCompressedFormat = 2 /**< used by Ref to specify whether the input storage must be in standard compressed form */ -}; - -namespace internal { - -template class SparseRefBase; - -template -struct traits, _Options, _StrideType> > - : public traits > -{ - typedef SparseMatrix PlainObjectType; - enum { - Options = _Options, - Flags = traits::Flags | CompressedAccessBit | NestByRefBit - }; - - template struct match { - enum { - StorageOrderMatch = PlainObjectType::IsVectorAtCompileTime || Derived::IsVectorAtCompileTime || ((PlainObjectType::Flags&RowMajorBit)==(Derived::Flags&RowMajorBit)), - MatchAtCompileTime = (Derived::Flags&CompressedAccessBit) && StorageOrderMatch - }; - typedef typename internal::conditional::type type; - }; - -}; - -template -struct traits, _Options, _StrideType> > - : public traits, _Options, _StrideType> > -{ - enum { - Flags = (traits >::Flags | CompressedAccessBit | NestByRefBit) & ~LvalueBit - }; -}; - -template -struct traits, _Options, _StrideType> > - : public traits > -{ - typedef SparseVector PlainObjectType; - enum { - Options = _Options, - Flags = traits::Flags | CompressedAccessBit | NestByRefBit - }; - - template struct match { - enum { - MatchAtCompileTime = (Derived::Flags&CompressedAccessBit) && Derived::IsVectorAtCompileTime - }; - typedef typename internal::conditional::type type; - }; - -}; - -template -struct traits, _Options, _StrideType> > - : public traits, _Options, _StrideType> > -{ - enum { - Flags = (traits >::Flags | CompressedAccessBit | NestByRefBit) & ~LvalueBit - }; -}; - -template -struct traits > : public traits {}; - -template class SparseRefBase - : public SparseMapBase -{ -public: - - typedef SparseMapBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(SparseRefBase) - - SparseRefBase() - : Base(RowsAtCompileTime==Dynamic?0:RowsAtCompileTime,ColsAtCompileTime==Dynamic?0:ColsAtCompileTime, 0, 0, 0, 0, 0) - {} - -protected: - - template - void construct(Expression& expr) - { - if(expr.outerIndexPtr()==0) - ::new (static_cast(this)) Base(expr.size(), expr.nonZeros(), expr.innerIndexPtr(), expr.valuePtr()); - else - ::new (static_cast(this)) Base(expr.rows(), expr.cols(), expr.nonZeros(), expr.outerIndexPtr(), expr.innerIndexPtr(), expr.valuePtr(), expr.innerNonZeroPtr()); - } -}; - -} // namespace internal - - -/** - * \ingroup SparseCore_Module - * - * \brief A sparse matrix expression referencing an existing sparse expression - * - * \tparam SparseMatrixType the equivalent sparse matrix type of the referenced data, it must be a template instance of class SparseMatrix. - * \tparam Options specifies whether the a standard compressed format is required \c Options is \c #StandardCompressedFormat, or \c 0. - * The default is \c 0. - * - * \sa class Ref - */ -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -class Ref, Options, StrideType > - : public internal::SparseRefBase, Options, StrideType > > -#else -template -class Ref - : public SparseMapBase // yes, that's weird to use Derived here, but that works! -#endif -{ - typedef SparseMatrix PlainObjectType; - typedef internal::traits Traits; - template - inline Ref(const SparseMatrix& expr); - template - inline Ref(const MappedSparseMatrix& expr); - public: - - typedef internal::SparseRefBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Ref) - - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - inline Ref(SparseMatrix& expr) - { - EIGEN_STATIC_ASSERT(bool(Traits::template match >::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); - eigen_assert( ((Options & int(StandardCompressedFormat))==0) || (expr.isCompressed()) ); - Base::construct(expr.derived()); - } - - template - inline Ref(MappedSparseMatrix& expr) - { - EIGEN_STATIC_ASSERT(bool(Traits::template match >::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); - eigen_assert( ((Options & int(StandardCompressedFormat))==0) || (expr.isCompressed()) ); - Base::construct(expr.derived()); - } - - template - inline Ref(const SparseCompressedBase& expr) - #else - /** Implicit constructor from any sparse expression (2D matrix or 1D vector) */ - template - inline Ref(SparseCompressedBase& expr) - #endif - { - EIGEN_STATIC_ASSERT(bool(internal::is_lvalue::value), THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY); - EIGEN_STATIC_ASSERT(bool(Traits::template match::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); - eigen_assert( ((Options & int(StandardCompressedFormat))==0) || (expr.isCompressed()) ); - Base::construct(expr.const_cast_derived()); - } -}; - -// this is the const ref version -template -class Ref, Options, StrideType> - : public internal::SparseRefBase, Options, StrideType> > -{ - typedef SparseMatrix TPlainObjectType; - typedef internal::traits Traits; - public: - - typedef internal::SparseRefBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Ref) - - template - inline Ref(const SparseMatrixBase& expr) : m_hasCopy(false) - { - construct(expr.derived(), typename Traits::template match::type()); - } - - inline Ref(const Ref& other) : Base(other), m_hasCopy(false) { - // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy - } - - template - inline Ref(const RefBase& other) : m_hasCopy(false) { - construct(other.derived(), typename Traits::template match::type()); - } - - ~Ref() { - if(m_hasCopy) { - TPlainObjectType* obj = reinterpret_cast(m_object_bytes); - obj->~TPlainObjectType(); - } - } - - protected: - - template - void construct(const Expression& expr,internal::true_type) - { - if((Options & int(StandardCompressedFormat)) && (!expr.isCompressed())) - { - TPlainObjectType* obj = reinterpret_cast(m_object_bytes); - ::new (obj) TPlainObjectType(expr); - m_hasCopy = true; - Base::construct(*obj); - } - else - { - Base::construct(expr); - } - } - - template - void construct(const Expression& expr, internal::false_type) - { - TPlainObjectType* obj = reinterpret_cast(m_object_bytes); - ::new (obj) TPlainObjectType(expr); - m_hasCopy = true; - Base::construct(*obj); - } - - protected: - char m_object_bytes[sizeof(TPlainObjectType)]; - bool m_hasCopy; -}; - - - -/** - * \ingroup SparseCore_Module - * - * \brief A sparse vector expression referencing an existing sparse vector expression - * - * \tparam SparseVectorType the equivalent sparse vector type of the referenced data, it must be a template instance of class SparseVector. - * - * \sa class Ref - */ -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -class Ref, Options, StrideType > - : public internal::SparseRefBase, Options, StrideType > > -#else -template -class Ref - : public SparseMapBase -#endif -{ - typedef SparseVector PlainObjectType; - typedef internal::traits Traits; - template - inline Ref(const SparseVector& expr); - public: - - typedef internal::SparseRefBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Ref) - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - inline Ref(SparseVector& expr) - { - EIGEN_STATIC_ASSERT(bool(Traits::template match >::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); - Base::construct(expr.derived()); - } - - template - inline Ref(const SparseCompressedBase& expr) - #else - /** Implicit constructor from any 1D sparse vector expression */ - template - inline Ref(SparseCompressedBase& expr) - #endif - { - EIGEN_STATIC_ASSERT(bool(internal::is_lvalue::value), THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY); - EIGEN_STATIC_ASSERT(bool(Traits::template match::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH); - Base::construct(expr.const_cast_derived()); - } -}; - -// this is the const ref version -template -class Ref, Options, StrideType> - : public internal::SparseRefBase, Options, StrideType> > -{ - typedef SparseVector TPlainObjectType; - typedef internal::traits Traits; - public: - - typedef internal::SparseRefBase Base; - EIGEN_SPARSE_PUBLIC_INTERFACE(Ref) - - template - inline Ref(const SparseMatrixBase& expr) : m_hasCopy(false) - { - construct(expr.derived(), typename Traits::template match::type()); - } - - inline Ref(const Ref& other) : Base(other), m_hasCopy(false) { - // copy constructor shall not copy the m_object, to avoid unnecessary malloc and copy - } - - template - inline Ref(const RefBase& other) : m_hasCopy(false) { - construct(other.derived(), typename Traits::template match::type()); - } - - ~Ref() { - if(m_hasCopy) { - TPlainObjectType* obj = reinterpret_cast(m_object_bytes); - obj->~TPlainObjectType(); - } - } - - protected: - - template - void construct(const Expression& expr,internal::true_type) - { - Base::construct(expr); - } - - template - void construct(const Expression& expr, internal::false_type) - { - TPlainObjectType* obj = reinterpret_cast(m_object_bytes); - ::new (obj) TPlainObjectType(expr); - m_hasCopy = true; - Base::construct(*obj); - } - - protected: - char m_object_bytes[sizeof(TPlainObjectType)]; - bool m_hasCopy; -}; - -namespace internal { - -// FIXME shall we introduce a general evaluatior_ref that we can specialize for any sparse object once, and thus remove this copy-pasta thing... - -template -struct evaluator, Options, StrideType> > - : evaluator, Options, StrideType> > > -{ - typedef evaluator, Options, StrideType> > > Base; - typedef Ref, Options, StrideType> XprType; - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -template -struct evaluator, Options, StrideType> > - : evaluator, Options, StrideType> > > -{ - typedef evaluator, Options, StrideType> > > Base; - typedef Ref, Options, StrideType> XprType; - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -template -struct evaluator, Options, StrideType> > - : evaluator, Options, StrideType> > > -{ - typedef evaluator, Options, StrideType> > > Base; - typedef Ref, Options, StrideType> XprType; - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -template -struct evaluator, Options, StrideType> > - : evaluator, Options, StrideType> > > -{ - typedef evaluator, Options, StrideType> > > Base; - typedef Ref, Options, StrideType> XprType; - evaluator() : Base() {} - explicit evaluator(const XprType &mat) : Base(mat) {} -}; - -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_REF_H diff --git a/Eigen/src/SparseCore/SparseSelfAdjointView.h b/Eigen/src/SparseCore/SparseSelfAdjointView.h deleted file mode 100644 index 5ab64f1a8..000000000 --- a/Eigen/src/SparseCore/SparseSelfAdjointView.h +++ /dev/null @@ -1,656 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_SELFADJOINTVIEW_H -#define EIGEN_SPARSE_SELFADJOINTVIEW_H - -namespace Eigen { - -/** \ingroup SparseCore_Module - * \class SparseSelfAdjointView - * - * \brief Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix. - * - * \param MatrixType the type of the dense matrix storing the coefficients - * \param Mode can be either \c #Lower or \c #Upper - * - * This class is an expression of a sefladjoint matrix from a triangular part of a matrix - * with given dense storage of the coefficients. It is the return type of MatrixBase::selfadjointView() - * and most of the time this is the only way that it is used. - * - * \sa SparseMatrixBase::selfadjointView() - */ -namespace internal { - -template -struct traits > : traits { -}; - -template -void permute_symm_to_symm(const MatrixType& mat, SparseMatrix& _dest, const typename MatrixType::StorageIndex* perm = 0); - -template -void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix& _dest, const typename MatrixType::StorageIndex* perm = 0); - -} - -template class SparseSelfAdjointView - : public EigenBase > -{ - public: - - enum { - Mode = _Mode, - TransposeMode = ((Mode & Upper) ? Lower : 0) | ((Mode & Lower) ? Upper : 0), - RowsAtCompileTime = internal::traits::RowsAtCompileTime, - ColsAtCompileTime = internal::traits::ColsAtCompileTime - }; - - typedef EigenBase Base; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Matrix VectorI; - typedef typename internal::ref_selector::non_const_type MatrixTypeNested; - typedef typename internal::remove_all::type _MatrixTypeNested; - - explicit inline SparseSelfAdjointView(MatrixType& matrix) : m_matrix(matrix) - { - eigen_assert(rows()==cols() && "SelfAdjointView is only for squared matrices"); - } - - inline Index rows() const { return m_matrix.rows(); } - inline Index cols() const { return m_matrix.cols(); } - - /** \internal \returns a reference to the nested matrix */ - const _MatrixTypeNested& matrix() const { return m_matrix; } - typename internal::remove_reference::type& matrix() { return m_matrix; } - - /** \returns an expression of the matrix product between a sparse self-adjoint matrix \c *this and a sparse matrix \a rhs. - * - * Note that there is no algorithmic advantage of performing such a product compared to a general sparse-sparse matrix product. - * Indeed, the SparseSelfadjointView operand is first copied into a temporary SparseMatrix before computing the product. - */ - template - Product - operator*(const SparseMatrixBase& rhs) const - { - return Product(*this, rhs.derived()); - } - - /** \returns an expression of the matrix product between a sparse matrix \a lhs and a sparse self-adjoint matrix \a rhs. - * - * Note that there is no algorithmic advantage of performing such a product compared to a general sparse-sparse matrix product. - * Indeed, the SparseSelfadjointView operand is first copied into a temporary SparseMatrix before computing the product. - */ - template friend - Product - operator*(const SparseMatrixBase& lhs, const SparseSelfAdjointView& rhs) - { - return Product(lhs.derived(), rhs); - } - - /** Efficient sparse self-adjoint matrix times dense vector/matrix product */ - template - Product - operator*(const MatrixBase& rhs) const - { - return Product(*this, rhs.derived()); - } - - /** Efficient dense vector/matrix times sparse self-adjoint matrix product */ - template friend - Product - operator*(const MatrixBase& lhs, const SparseSelfAdjointView& rhs) - { - return Product(lhs.derived(), rhs); - } - - /** Perform a symmetric rank K update of the selfadjoint matrix \c *this: - * \f$ this = this + \alpha ( u u^* ) \f$ where \a u is a vector or matrix. - * - * \returns a reference to \c *this - * - * To perform \f$ this = this + \alpha ( u^* u ) \f$ you can simply - * call this function with u.adjoint(). - */ - template - SparseSelfAdjointView& rankUpdate(const SparseMatrixBase& u, const Scalar& alpha = Scalar(1)); - - /** \returns an expression of P H P^-1 */ - // TODO implement twists in a more evaluator friendly fashion - SparseSymmetricPermutationProduct<_MatrixTypeNested,Mode> twistedBy(const PermutationMatrix& perm) const - { - return SparseSymmetricPermutationProduct<_MatrixTypeNested,Mode>(m_matrix, perm); - } - - template - SparseSelfAdjointView& operator=(const SparseSymmetricPermutationProduct& permutedMatrix) - { - internal::call_assignment_no_alias_no_transpose(*this, permutedMatrix); - return *this; - } - - SparseSelfAdjointView& operator=(const SparseSelfAdjointView& src) - { - PermutationMatrix pnull; - return *this = src.twistedBy(pnull); - } - - template - SparseSelfAdjointView& operator=(const SparseSelfAdjointView& src) - { - PermutationMatrix pnull; - return *this = src.twistedBy(pnull); - } - - void resize(Index rows, Index cols) - { - EIGEN_ONLY_USED_FOR_DEBUG(rows); - EIGEN_ONLY_USED_FOR_DEBUG(cols); - eigen_assert(rows == this->rows() && cols == this->cols() - && "SparseSelfadjointView::resize() does not actually allow to resize."); - } - - protected: - - MatrixTypeNested m_matrix; - //mutable VectorI m_countPerRow; - //mutable VectorI m_countPerCol; - private: - template void evalTo(Dest &) const; -}; - -/*************************************************************************** -* Implementation of SparseMatrixBase methods -***************************************************************************/ - -template -template -typename SparseMatrixBase::template ConstSelfAdjointViewReturnType::Type SparseMatrixBase::selfadjointView() const -{ - return SparseSelfAdjointView(derived()); -} - -template -template -typename SparseMatrixBase::template SelfAdjointViewReturnType::Type SparseMatrixBase::selfadjointView() -{ - return SparseSelfAdjointView(derived()); -} - -/*************************************************************************** -* Implementation of SparseSelfAdjointView methods -***************************************************************************/ - -template -template -SparseSelfAdjointView& -SparseSelfAdjointView::rankUpdate(const SparseMatrixBase& u, const Scalar& alpha) -{ - SparseMatrix tmp = u * u.adjoint(); - if(alpha==Scalar(0)) - m_matrix = tmp.template triangularView(); - else - m_matrix += alpha * tmp.template triangularView(); - - return *this; -} - -namespace internal { - -// TODO currently a selfadjoint expression has the form SelfAdjointView<.,.> -// in the future selfadjoint-ness should be defined by the expression traits -// such that Transpose > is valid. (currently TriangularBase::transpose() is overloaded to make it work) -template -struct evaluator_traits > -{ - typedef typename storage_kind_to_evaluator_kind::Kind Kind; - typedef SparseSelfAdjointShape Shape; -}; - -struct SparseSelfAdjoint2Sparse {}; - -template<> struct AssignmentKind { typedef SparseSelfAdjoint2Sparse Kind; }; -template<> struct AssignmentKind { typedef Sparse2Sparse Kind; }; - -template< typename DstXprType, typename SrcXprType, typename Functor> -struct Assignment -{ - typedef typename DstXprType::StorageIndex StorageIndex; - typedef internal::assign_op AssignOpType; - - template - static void run(SparseMatrix &dst, const SrcXprType &src, const AssignOpType&/*func*/) - { - internal::permute_symm_to_fullsymm(src.matrix(), dst); - } - - // FIXME: the handling of += and -= in sparse matrices should be cleanup so that next two overloads could be reduced to: - template - static void run(SparseMatrix &dst, const SrcXprType &src, const AssignFunc& func) - { - SparseMatrix tmp(src.rows(),src.cols()); - run(tmp, src, AssignOpType()); - call_assignment_no_alias_no_transpose(dst, tmp, func); - } - - template - static void run(SparseMatrix &dst, const SrcXprType &src, - const internal::add_assign_op& /* func */) - { - SparseMatrix tmp(src.rows(),src.cols()); - run(tmp, src, AssignOpType()); - dst += tmp; - } - - template - static void run(SparseMatrix &dst, const SrcXprType &src, - const internal::sub_assign_op& /* func */) - { - SparseMatrix tmp(src.rows(),src.cols()); - run(tmp, src, AssignOpType()); - dst -= tmp; - } - - template - static void run(DynamicSparseMatrix& dst, const SrcXprType &src, const AssignOpType&/*func*/) - { - // TODO directly evaluate into dst; - SparseMatrix tmp(dst.rows(),dst.cols()); - internal::permute_symm_to_fullsymm(src.matrix(), tmp); - dst = tmp; - } -}; - -} // end namespace internal - -/*************************************************************************** -* Implementation of sparse self-adjoint time dense matrix -***************************************************************************/ - -namespace internal { - -template -inline void sparse_selfadjoint_time_dense_product(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const AlphaType& alpha) -{ - EIGEN_ONLY_USED_FOR_DEBUG(alpha); - - typedef typename internal::nested_eval::type SparseLhsTypeNested; - typedef typename internal::remove_all::type SparseLhsTypeNestedCleaned; - typedef evaluator LhsEval; - typedef typename LhsEval::InnerIterator LhsIterator; - typedef typename SparseLhsType::Scalar LhsScalar; - - enum { - LhsIsRowMajor = (LhsEval::Flags&RowMajorBit)==RowMajorBit, - ProcessFirstHalf = - ((Mode&(Upper|Lower))==(Upper|Lower)) - || ( (Mode&Upper) && !LhsIsRowMajor) - || ( (Mode&Lower) && LhsIsRowMajor), - ProcessSecondHalf = !ProcessFirstHalf - }; - - SparseLhsTypeNested lhs_nested(lhs); - LhsEval lhsEval(lhs_nested); - - // work on one column at once - for (Index k=0; k::ReturnType rhs_j(alpha*rhs(j,k)); - // accumulator for partial scalar product - typename DenseResType::Scalar res_j(0); - for(; (ProcessFirstHalf ? i && i.index() < j : i) ; ++i) - { - LhsScalar lhs_ij = i.value(); - if(!LhsIsRowMajor) lhs_ij = numext::conj(lhs_ij); - res_j += lhs_ij * rhs(i.index(),k); - res(i.index(),k) += numext::conj(lhs_ij) * rhs_j; - } - res(j,k) += alpha * res_j; - - // handle diagonal coeff - if (ProcessFirstHalf && i && (i.index()==j)) - res(j,k) += alpha * i.value() * rhs(j,k); - } - } -} - - -template -struct generic_product_impl -: generic_product_impl_base > -{ - template - static void scaleAndAddTo(Dest& dst, const LhsView& lhsView, const Rhs& rhs, const typename Dest::Scalar& alpha) - { - typedef typename LhsView::_MatrixTypeNested Lhs; - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(lhsView.matrix()); - RhsNested rhsNested(rhs); - - internal::sparse_selfadjoint_time_dense_product(lhsNested, rhsNested, dst, alpha); - } -}; - -template -struct generic_product_impl -: generic_product_impl_base > -{ - template - static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const RhsView& rhsView, const typename Dest::Scalar& alpha) - { - typedef typename RhsView::_MatrixTypeNested Rhs; - typedef typename nested_eval::type LhsNested; - typedef typename nested_eval::type RhsNested; - LhsNested lhsNested(lhs); - RhsNested rhsNested(rhsView.matrix()); - - // transpose everything - Transpose dstT(dst); - internal::sparse_selfadjoint_time_dense_product(rhsNested.transpose(), lhsNested.transpose(), dstT, alpha); - } -}; - -// NOTE: these two overloads are needed to evaluate the sparse selfadjoint view into a full sparse matrix -// TODO: maybe the copy could be handled by generic_product_impl so that these overloads would not be needed anymore - -template -struct product_evaluator, ProductTag, SparseSelfAdjointShape, SparseShape> - : public evaluator::PlainObject> -{ - typedef Product XprType; - typedef typename XprType::PlainObject PlainObject; - typedef evaluator Base; - - product_evaluator(const XprType& xpr) - : m_lhs(xpr.lhs()), m_result(xpr.rows(), xpr.cols()) - { - ::new (static_cast(this)) Base(m_result); - generic_product_impl::evalTo(m_result, m_lhs, xpr.rhs()); - } - -protected: - typename Rhs::PlainObject m_lhs; - PlainObject m_result; -}; - -template -struct product_evaluator, ProductTag, SparseShape, SparseSelfAdjointShape> - : public evaluator::PlainObject> -{ - typedef Product XprType; - typedef typename XprType::PlainObject PlainObject; - typedef evaluator Base; - - product_evaluator(const XprType& xpr) - : m_rhs(xpr.rhs()), m_result(xpr.rows(), xpr.cols()) - { - ::new (static_cast(this)) Base(m_result); - generic_product_impl::evalTo(m_result, xpr.lhs(), m_rhs); - } - -protected: - typename Lhs::PlainObject m_rhs; - PlainObject m_result; -}; - -} // namespace internal - -/*************************************************************************** -* Implementation of symmetric copies and permutations -***************************************************************************/ -namespace internal { - -template -void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix& _dest, const typename MatrixType::StorageIndex* perm) -{ - typedef typename MatrixType::StorageIndex StorageIndex; - typedef typename MatrixType::Scalar Scalar; - typedef SparseMatrix Dest; - typedef Matrix VectorI; - typedef evaluator MatEval; - typedef typename evaluator::InnerIterator MatIterator; - - MatEval matEval(mat); - Dest& dest(_dest.derived()); - enum { - StorageOrderMatch = int(Dest::IsRowMajor) == int(MatrixType::IsRowMajor) - }; - - Index size = mat.rows(); - VectorI count; - count.resize(size); - count.setZero(); - dest.resize(size,size); - for(Index j = 0; jc) || ( Mode==Upper && r(it.index()); - Index r = it.row(); - Index c = it.col(); - - StorageIndex jp = perm ? perm[j] : j; - StorageIndex ip = perm ? perm[i] : i; - - if(Mode==(Upper|Lower)) - { - Index k = count[StorageOrderMatch ? jp : ip]++; - dest.innerIndexPtr()[k] = StorageOrderMatch ? ip : jp; - dest.valuePtr()[k] = it.value(); - } - else if(r==c) - { - Index k = count[ip]++; - dest.innerIndexPtr()[k] = ip; - dest.valuePtr()[k] = it.value(); - } - else if(( (Mode&Lower)==Lower && r>c) || ( (Mode&Upper)==Upper && r -void permute_symm_to_symm(const MatrixType& mat, SparseMatrix& _dest, const typename MatrixType::StorageIndex* perm) -{ - typedef typename MatrixType::StorageIndex StorageIndex; - typedef typename MatrixType::Scalar Scalar; - SparseMatrix& dest(_dest.derived()); - typedef Matrix VectorI; - typedef evaluator MatEval; - typedef typename evaluator::InnerIterator MatIterator; - - enum { - SrcOrder = MatrixType::IsRowMajor ? RowMajor : ColMajor, - StorageOrderMatch = int(SrcOrder) == int(DstOrder), - DstMode = DstOrder==RowMajor ? (_DstMode==Upper ? Lower : Upper) : _DstMode, - SrcMode = SrcOrder==RowMajor ? (_SrcMode==Upper ? Lower : Upper) : _SrcMode - }; - - MatEval matEval(mat); - - Index size = mat.rows(); - VectorI count(size); - count.setZero(); - dest.resize(size,size); - for(StorageIndex j = 0; jj)) - continue; - - StorageIndex ip = perm ? perm[i] : i; - count[int(DstMode)==int(Lower) ? (std::min)(ip,jp) : (std::max)(ip,jp)]++; - } - } - dest.outerIndexPtr()[0] = 0; - for(Index j=0; jj)) - continue; - - StorageIndex jp = perm ? perm[j] : j; - StorageIndex ip = perm? perm[i] : i; - - Index k = count[int(DstMode)==int(Lower) ? (std::min)(ip,jp) : (std::max)(ip,jp)]++; - dest.innerIndexPtr()[k] = int(DstMode)==int(Lower) ? (std::max)(ip,jp) : (std::min)(ip,jp); - - if(!StorageOrderMatch) std::swap(ip,jp); - if( ((int(DstMode)==int(Lower) && ipjp))) - dest.valuePtr()[k] = numext::conj(it.value()); - else - dest.valuePtr()[k] = it.value(); - } - } -} - -} - -// TODO implement twists in a more evaluator friendly fashion - -namespace internal { - -template -struct traits > : traits { -}; - -} - -template -class SparseSymmetricPermutationProduct - : public EigenBase > -{ - public: - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::StorageIndex StorageIndex; - enum { - RowsAtCompileTime = internal::traits::RowsAtCompileTime, - ColsAtCompileTime = internal::traits::ColsAtCompileTime - }; - protected: - typedef PermutationMatrix Perm; - public: - typedef Matrix VectorI; - typedef typename MatrixType::Nested MatrixTypeNested; - typedef typename internal::remove_all::type NestedExpression; - - SparseSymmetricPermutationProduct(const MatrixType& mat, const Perm& perm) - : m_matrix(mat), m_perm(perm) - {} - - inline Index rows() const { return m_matrix.rows(); } - inline Index cols() const { return m_matrix.cols(); } - - const NestedExpression& matrix() const { return m_matrix; } - const Perm& perm() const { return m_perm; } - - protected: - MatrixTypeNested m_matrix; - const Perm& m_perm; - -}; - -namespace internal { - -template -struct Assignment, internal::assign_op, Sparse2Sparse> -{ - typedef SparseSymmetricPermutationProduct SrcXprType; - typedef typename DstXprType::StorageIndex DstIndex; - template - static void run(SparseMatrix &dst, const SrcXprType &src, const internal::assign_op &) - { - // internal::permute_symm_to_fullsymm(m_matrix,_dest,m_perm.indices().data()); - SparseMatrix tmp; - internal::permute_symm_to_fullsymm(src.matrix(),tmp,src.perm().indices().data()); - dst = tmp; - } - - template - static void run(SparseSelfAdjointView& dst, const SrcXprType &src, const internal::assign_op &) - { - internal::permute_symm_to_symm(src.matrix(),dst.matrix(),src.perm().indices().data()); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_SELFADJOINTVIEW_H diff --git a/Eigen/src/SparseCore/SparseSolverBase.h b/Eigen/src/SparseCore/SparseSolverBase.h deleted file mode 100644 index b4c9a422f..000000000 --- a/Eigen/src/SparseCore/SparseSolverBase.h +++ /dev/null @@ -1,124 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSESOLVERBASE_H -#define EIGEN_SPARSESOLVERBASE_H - -namespace Eigen { - -namespace internal { - - /** \internal - * Helper functions to solve with a sparse right-hand-side and result. - * The rhs is decomposed into small vertical panels which are solved through dense temporaries. - */ -template -typename enable_if::type -solve_sparse_through_dense_panels(const Decomposition &dec, const Rhs& rhs, Dest &dest) -{ - EIGEN_STATIC_ASSERT((Dest::Flags&RowMajorBit)==0,THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); - typedef typename Dest::Scalar DestScalar; - // we process the sparse rhs per block of NbColsAtOnce columns temporarily stored into a dense matrix. - static const Index NbColsAtOnce = 4; - Index rhsCols = rhs.cols(); - Index size = rhs.rows(); - // the temporary matrices do not need more columns than NbColsAtOnce: - Index tmpCols = (std::min)(rhsCols, NbColsAtOnce); - Eigen::Matrix tmp(size,tmpCols); - Eigen::Matrix tmpX(size,tmpCols); - for(Index k=0; k(rhsCols-k, NbColsAtOnce); - tmp.leftCols(actualCols) = rhs.middleCols(k,actualCols); - tmpX.leftCols(actualCols) = dec.solve(tmp.leftCols(actualCols)); - dest.middleCols(k,actualCols) = tmpX.leftCols(actualCols).sparseView(); - } -} - -// Overload for vector as rhs -template -typename enable_if::type -solve_sparse_through_dense_panels(const Decomposition &dec, const Rhs& rhs, Dest &dest) -{ - typedef typename Dest::Scalar DestScalar; - Index size = rhs.rows(); - Eigen::Matrix rhs_dense(rhs); - Eigen::Matrix dest_dense(size); - dest_dense = dec.solve(rhs_dense); - dest = dest_dense.sparseView(); -} - -} // end namespace internal - -/** \class SparseSolverBase - * \ingroup SparseCore_Module - * \brief A base class for sparse solvers - * - * \tparam Derived the actual type of the solver. - * - */ -template -class SparseSolverBase : internal::noncopyable -{ - public: - - /** Default constructor */ - SparseSolverBase() - : m_isInitialized(false) - {} - - ~SparseSolverBase() - {} - - Derived& derived() { return *static_cast(this); } - const Derived& derived() const { return *static_cast(this); } - - /** \returns an expression of the solution x of \f$ A x = b \f$ using the current decomposition of A. - * - * \sa compute() - */ - template - inline const Solve - solve(const MatrixBase& b) const - { - eigen_assert(m_isInitialized && "Solver is not initialized."); - eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b"); - return Solve(derived(), b.derived()); - } - - /** \returns an expression of the solution x of \f$ A x = b \f$ using the current decomposition of A. - * - * \sa compute() - */ - template - inline const Solve - solve(const SparseMatrixBase& b) const - { - eigen_assert(m_isInitialized && "Solver is not initialized."); - eigen_assert(derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b"); - return Solve(derived(), b.derived()); - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** \internal default implementation of solving with a sparse rhs */ - template - void _solve_impl(const SparseMatrixBase &b, SparseMatrixBase &dest) const - { - internal::solve_sparse_through_dense_panels(derived(), b.derived(), dest.derived()); - } - #endif // EIGEN_PARSED_BY_DOXYGEN - - protected: - - mutable bool m_isInitialized; -}; - -} // end namespace Eigen - -#endif // EIGEN_SPARSESOLVERBASE_H diff --git a/Eigen/src/SparseCore/SparseSparseProductWithPruning.h b/Eigen/src/SparseCore/SparseSparseProductWithPruning.h deleted file mode 100644 index 88820a48f..000000000 --- a/Eigen/src/SparseCore/SparseSparseProductWithPruning.h +++ /dev/null @@ -1,198 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSESPARSEPRODUCTWITHPRUNING_H -#define EIGEN_SPARSESPARSEPRODUCTWITHPRUNING_H - -namespace Eigen { - -namespace internal { - - -// perform a pseudo in-place sparse * sparse product assuming all matrices are col major -template -static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, const typename ResultType::RealScalar& tolerance) -{ - // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res); - - typedef typename remove_all::type::Scalar RhsScalar; - typedef typename remove_all::type::Scalar ResScalar; - typedef typename remove_all::type::StorageIndex StorageIndex; - - // make sure to call innerSize/outerSize since we fake the storage order. - Index rows = lhs.innerSize(); - Index cols = rhs.outerSize(); - //Index size = lhs.outerSize(); - eigen_assert(lhs.outerSize() == rhs.innerSize()); - - // allocate a temporary buffer - AmbiVector tempVector(rows); - - // mimics a resizeByInnerOuter: - if(ResultType::IsRowMajor) - res.resize(cols, rows); - else - res.resize(rows, cols); - - evaluator lhsEval(lhs); - evaluator rhsEval(rhs); - - // estimate the number of non zero entries - // given a rhs column containing Y non zeros, we assume that the respective Y columns - // of the lhs differs in average of one non zeros, thus the number of non zeros for - // the product of a rhs column with the lhs is X+Y where X is the average number of non zero - // per column of the lhs. - // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs) - Index estimated_nnz_prod = lhsEval.nonZerosEstimate() + rhsEval.nonZerosEstimate(); - - res.reserve(estimated_nnz_prod); - double ratioColRes = double(estimated_nnz_prod)/(double(lhs.rows())*double(rhs.cols())); - for (Index j=0; j::InnerIterator rhsIt(rhsEval, j); rhsIt; ++rhsIt) - { - // FIXME should be written like this: tmp += rhsIt.value() * lhs.col(rhsIt.index()) - tempVector.restart(); - RhsScalar x = rhsIt.value(); - for (typename evaluator::InnerIterator lhsIt(lhsEval, rhsIt.index()); lhsIt; ++lhsIt) - { - tempVector.coeffRef(lhsIt.index()) += lhsIt.value() * x; - } - } - res.startVec(j); - for (typename AmbiVector::Iterator it(tempVector,tolerance); it; ++it) - res.insertBackByOuterInner(j,it.index()) = it.value(); - } - res.finalize(); -} - -template::Flags&RowMajorBit, - int RhsStorageOrder = traits::Flags&RowMajorBit, - int ResStorageOrder = traits::Flags&RowMajorBit> -struct sparse_sparse_product_with_pruning_selector; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - typename remove_all::type _res(res.rows(), res.cols()); - internal::sparse_sparse_product_with_pruning_impl(lhs, rhs, _res, tolerance); - res.swap(_res); - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - // we need a col-major matrix to hold the result - typedef SparseMatrix SparseTemporaryType; - SparseTemporaryType _res(res.rows(), res.cols()); - internal::sparse_sparse_product_with_pruning_impl(lhs, rhs, _res, tolerance); - res = _res; - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - // let's transpose the product to get a column x column product - typename remove_all::type _res(res.rows(), res.cols()); - internal::sparse_sparse_product_with_pruning_impl(rhs, lhs, _res, tolerance); - res.swap(_res); - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - typedef SparseMatrix ColMajorMatrixLhs; - typedef SparseMatrix ColMajorMatrixRhs; - ColMajorMatrixLhs colLhs(lhs); - ColMajorMatrixRhs colRhs(rhs); - internal::sparse_sparse_product_with_pruning_impl(colLhs, colRhs, res, tolerance); - - // let's transpose the product to get a column x column product -// typedef SparseMatrix SparseTemporaryType; -// SparseTemporaryType _res(res.cols(), res.rows()); -// sparse_sparse_product_with_pruning_impl(rhs, lhs, _res); -// res = _res.transpose(); - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - typedef SparseMatrix RowMajorMatrixLhs; - RowMajorMatrixLhs rowLhs(lhs); - sparse_sparse_product_with_pruning_selector(rowLhs,rhs,res,tolerance); - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - typedef SparseMatrix RowMajorMatrixRhs; - RowMajorMatrixRhs rowRhs(rhs); - sparse_sparse_product_with_pruning_selector(lhs,rowRhs,res,tolerance); - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - typedef SparseMatrix ColMajorMatrixRhs; - ColMajorMatrixRhs colRhs(rhs); - internal::sparse_sparse_product_with_pruning_impl(lhs, colRhs, res, tolerance); - } -}; - -template -struct sparse_sparse_product_with_pruning_selector -{ - typedef typename ResultType::RealScalar RealScalar; - static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) - { - typedef SparseMatrix ColMajorMatrixLhs; - ColMajorMatrixLhs colLhs(lhs); - internal::sparse_sparse_product_with_pruning_impl(colLhs, rhs, res, tolerance); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSESPARSEPRODUCTWITHPRUNING_H diff --git a/Eigen/src/SparseCore/SparseTranspose.h b/Eigen/src/SparseCore/SparseTranspose.h deleted file mode 100644 index 3757d4c6b..000000000 --- a/Eigen/src/SparseCore/SparseTranspose.h +++ /dev/null @@ -1,92 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSETRANSPOSE_H -#define EIGEN_SPARSETRANSPOSE_H - -namespace Eigen { - -namespace internal { - template - class SparseTransposeImpl - : public SparseMatrixBase > - {}; - - template - class SparseTransposeImpl - : public SparseCompressedBase > - { - typedef SparseCompressedBase > Base; - public: - using Base::derived; - typedef typename Base::Scalar Scalar; - typedef typename Base::StorageIndex StorageIndex; - - inline Index nonZeros() const { return derived().nestedExpression().nonZeros(); } - - inline const Scalar* valuePtr() const { return derived().nestedExpression().valuePtr(); } - inline const StorageIndex* innerIndexPtr() const { return derived().nestedExpression().innerIndexPtr(); } - inline const StorageIndex* outerIndexPtr() const { return derived().nestedExpression().outerIndexPtr(); } - inline const StorageIndex* innerNonZeroPtr() const { return derived().nestedExpression().innerNonZeroPtr(); } - - inline Scalar* valuePtr() { return derived().nestedExpression().valuePtr(); } - inline StorageIndex* innerIndexPtr() { return derived().nestedExpression().innerIndexPtr(); } - inline StorageIndex* outerIndexPtr() { return derived().nestedExpression().outerIndexPtr(); } - inline StorageIndex* innerNonZeroPtr() { return derived().nestedExpression().innerNonZeroPtr(); } - }; -} - -template class TransposeImpl - : public internal::SparseTransposeImpl -{ - protected: - typedef internal::SparseTransposeImpl Base; -}; - -namespace internal { - -template -struct unary_evaluator, IteratorBased> - : public evaluator_base > -{ - typedef typename evaluator::InnerIterator EvalIterator; - public: - typedef Transpose XprType; - - inline Index nonZerosEstimate() const { - return m_argImpl.nonZerosEstimate(); - } - - class InnerIterator : public EvalIterator - { - public: - EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& unaryOp, Index outer) - : EvalIterator(unaryOp.m_argImpl,outer) - {} - - Index row() const { return EvalIterator::col(); } - Index col() const { return EvalIterator::row(); } - }; - - enum { - CoeffReadCost = evaluator::CoeffReadCost, - Flags = XprType::Flags - }; - - explicit unary_evaluator(const XprType& op) :m_argImpl(op.nestedExpression()) {} - - protected: - evaluator m_argImpl; -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSETRANSPOSE_H diff --git a/Eigen/src/SparseCore/SparseTriangularView.h b/Eigen/src/SparseCore/SparseTriangularView.h deleted file mode 100644 index 9ac120266..000000000 --- a/Eigen/src/SparseCore/SparseTriangularView.h +++ /dev/null @@ -1,189 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2015 Gael Guennebaud -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_TRIANGULARVIEW_H -#define EIGEN_SPARSE_TRIANGULARVIEW_H - -namespace Eigen { - -/** \ingroup SparseCore_Module - * - * \brief Base class for a triangular part in a \b sparse matrix - * - * This class is an abstract base class of class TriangularView, and objects of type TriangularViewImpl cannot be instantiated. - * It extends class TriangularView with additional methods which are available for sparse expressions only. - * - * \sa class TriangularView, SparseMatrixBase::triangularView() - */ -template class TriangularViewImpl - : public SparseMatrixBase > -{ - enum { SkipFirst = ((Mode&Lower) && !(MatrixType::Flags&RowMajorBit)) - || ((Mode&Upper) && (MatrixType::Flags&RowMajorBit)), - SkipLast = !SkipFirst, - SkipDiag = (Mode&ZeroDiag) ? 1 : 0, - HasUnitDiag = (Mode&UnitDiag) ? 1 : 0 - }; - - typedef TriangularView TriangularViewType; - - protected: - // dummy solve function to make TriangularView happy. - void solve() const; - - typedef SparseMatrixBase Base; - public: - - EIGEN_SPARSE_PUBLIC_INTERFACE(TriangularViewType) - - typedef typename MatrixType::Nested MatrixTypeNested; - typedef typename internal::remove_reference::type MatrixTypeNestedNonRef; - typedef typename internal::remove_all::type MatrixTypeNestedCleaned; - - template - EIGEN_DEVICE_FUNC - EIGEN_STRONG_INLINE void _solve_impl(const RhsType &rhs, DstType &dst) const { - if(!(internal::is_same::value && internal::extract_data(dst) == internal::extract_data(rhs))) - dst = rhs; - this->solveInPlace(dst); - } - - /** Applies the inverse of \c *this to the dense vector or matrix \a other, "in-place" */ - template void solveInPlace(MatrixBase& other) const; - - /** Applies the inverse of \c *this to the sparse vector or matrix \a other, "in-place" */ - template void solveInPlace(SparseMatrixBase& other) const; - -}; - -namespace internal { - -template -struct unary_evaluator, IteratorBased> - : evaluator_base > -{ - typedef TriangularView XprType; - -protected: - - typedef typename XprType::Scalar Scalar; - typedef typename XprType::StorageIndex StorageIndex; - typedef typename evaluator::InnerIterator EvalIterator; - - enum { SkipFirst = ((Mode&Lower) && !(ArgType::Flags&RowMajorBit)) - || ((Mode&Upper) && (ArgType::Flags&RowMajorBit)), - SkipLast = !SkipFirst, - SkipDiag = (Mode&ZeroDiag) ? 1 : 0, - HasUnitDiag = (Mode&UnitDiag) ? 1 : 0 - }; - -public: - - enum { - CoeffReadCost = evaluator::CoeffReadCost, - Flags = XprType::Flags - }; - - explicit unary_evaluator(const XprType &xpr) : m_argImpl(xpr.nestedExpression()), m_arg(xpr.nestedExpression()) {} - - inline Index nonZerosEstimate() const { - return m_argImpl.nonZerosEstimate(); - } - - class InnerIterator : public EvalIterator - { - typedef EvalIterator Base; - public: - - EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& xprEval, Index outer) - : Base(xprEval.m_argImpl,outer), m_returnOne(false), m_containsDiag(Base::outer()index()<=outer : this->index()=Base::outer())) - { - if((!SkipFirst) && Base::operator bool()) - Base::operator++(); - m_returnOne = m_containsDiag; - } - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - if(HasUnitDiag && m_returnOne) - m_returnOne = false; - else - { - Base::operator++(); - if(HasUnitDiag && (!SkipFirst) && ((!Base::operator bool()) || Base::index()>=Base::outer())) - { - if((!SkipFirst) && Base::operator bool()) - Base::operator++(); - m_returnOne = m_containsDiag; - } - } - return *this; - } - - EIGEN_STRONG_INLINE operator bool() const - { - if(HasUnitDiag && m_returnOne) - return true; - if(SkipFirst) return Base::operator bool(); - else - { - if (SkipDiag) return (Base::operator bool() && this->index() < this->outer()); - else return (Base::operator bool() && this->index() <= this->outer()); - } - } - -// inline Index row() const { return (ArgType::Flags&RowMajorBit ? Base::outer() : this->index()); } -// inline Index col() const { return (ArgType::Flags&RowMajorBit ? this->index() : Base::outer()); } - inline StorageIndex index() const - { - if(HasUnitDiag && m_returnOne) return internal::convert_index(Base::outer()); - else return Base::index(); - } - inline Scalar value() const - { - if(HasUnitDiag && m_returnOne) return Scalar(1); - else return Base::value(); - } - - protected: - bool m_returnOne; - bool m_containsDiag; - private: - Scalar& valueRef(); - }; - -protected: - evaluator m_argImpl; - const ArgType& m_arg; -}; - -} // end namespace internal - -template -template -inline const TriangularView -SparseMatrixBase::triangularView() const -{ - return TriangularView(derived()); -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSE_TRIANGULARVIEW_H diff --git a/Eigen/src/SparseCore/SparseUtil.h b/Eigen/src/SparseCore/SparseUtil.h deleted file mode 100644 index 74df0d496..000000000 --- a/Eigen/src/SparseCore/SparseUtil.h +++ /dev/null @@ -1,178 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEUTIL_H -#define EIGEN_SPARSEUTIL_H - -namespace Eigen { - -#ifdef NDEBUG -#define EIGEN_DBG_SPARSE(X) -#else -#define EIGEN_DBG_SPARSE(X) X -#endif - -#define EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(Derived, Op) \ -template \ -EIGEN_STRONG_INLINE Derived& operator Op(const Eigen::SparseMatrixBase& other) \ -{ \ - return Base::operator Op(other.derived()); \ -} \ -EIGEN_STRONG_INLINE Derived& operator Op(const Derived& other) \ -{ \ - return Base::operator Op(other); \ -} - -#define EIGEN_SPARSE_INHERIT_SCALAR_ASSIGNMENT_OPERATOR(Derived, Op) \ -template \ -EIGEN_STRONG_INLINE Derived& operator Op(const Other& scalar) \ -{ \ - return Base::operator Op(scalar); \ -} - -#define EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATORS(Derived) \ -EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(Derived, =) - - -#define EIGEN_SPARSE_PUBLIC_INTERFACE(Derived) \ - EIGEN_GENERIC_PUBLIC_INTERFACE(Derived) - - -const int CoherentAccessPattern = 0x1; -const int InnerRandomAccessPattern = 0x2 | CoherentAccessPattern; -const int OuterRandomAccessPattern = 0x4 | CoherentAccessPattern; -const int RandomAccessPattern = 0x8 | OuterRandomAccessPattern | InnerRandomAccessPattern; - -template class SparseMatrix; -template class DynamicSparseMatrix; -template class SparseVector; -template class MappedSparseMatrix; - -template class SparseSelfAdjointView; -template class SparseDiagonalProduct; -template class SparseView; - -template class SparseSparseProduct; -template class SparseTimeDenseProduct; -template class DenseTimeSparseProduct; -template class SparseDenseOuterProduct; - -template struct SparseSparseProductReturnType; -template::ColsAtCompileTime,internal::traits::RowsAtCompileTime)> struct DenseSparseProductReturnType; - -template::ColsAtCompileTime,internal::traits::RowsAtCompileTime)> struct SparseDenseProductReturnType; -template class SparseSymmetricPermutationProduct; - -namespace internal { - -template struct sparse_eval; - -template struct eval - : sparse_eval::RowsAtCompileTime,traits::ColsAtCompileTime,traits::Flags> -{}; - -template struct sparse_eval { - typedef typename traits::Scalar _Scalar; - typedef typename traits::StorageIndex _StorageIndex; - public: - typedef SparseVector<_Scalar, RowMajor, _StorageIndex> type; -}; - -template struct sparse_eval { - typedef typename traits::Scalar _Scalar; - typedef typename traits::StorageIndex _StorageIndex; - public: - typedef SparseVector<_Scalar, ColMajor, _StorageIndex> type; -}; - -// TODO this seems almost identical to plain_matrix_type -template struct sparse_eval { - typedef typename traits::Scalar _Scalar; - typedef typename traits::StorageIndex _StorageIndex; - enum { _Options = ((Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor }; - public: - typedef SparseMatrix<_Scalar, _Options, _StorageIndex> type; -}; - -template struct sparse_eval { - typedef typename traits::Scalar _Scalar; - public: - typedef Matrix<_Scalar, 1, 1> type; -}; - -template struct plain_matrix_type -{ - typedef typename traits::Scalar _Scalar; - typedef typename traits::StorageIndex _StorageIndex; - enum { _Options = ((evaluator::Flags&RowMajorBit)==RowMajorBit) ? RowMajor : ColMajor }; - public: - typedef SparseMatrix<_Scalar, _Options, _StorageIndex> type; -}; - -template -struct plain_object_eval - : sparse_eval::RowsAtCompileTime,traits::ColsAtCompileTime, evaluator::Flags> -{}; - -template -struct solve_traits -{ - typedef typename sparse_eval::Flags>::type PlainObject; -}; - -template -struct generic_xpr_base -{ - typedef SparseMatrixBase type; -}; - -struct SparseTriangularShape { static std::string debugName() { return "SparseTriangularShape"; } }; -struct SparseSelfAdjointShape { static std::string debugName() { return "SparseSelfAdjointShape"; } }; - -template<> struct glue_shapes { typedef SparseSelfAdjointShape type; }; -template<> struct glue_shapes { typedef SparseTriangularShape type; }; - -} // end namespace internal - -/** \ingroup SparseCore_Module - * - * \class Triplet - * - * \brief A small structure to hold a non zero as a triplet (i,j,value). - * - * \sa SparseMatrix::setFromTriplets() - */ -template::StorageIndex > -class Triplet -{ -public: - Triplet() : m_row(0), m_col(0), m_value(0) {} - - Triplet(const StorageIndex& i, const StorageIndex& j, const Scalar& v = Scalar(0)) - : m_row(i), m_col(j), m_value(v) - {} - - /** \returns the row index of the element */ - const StorageIndex& row() const { return m_row; } - - /** \returns the column index of the element */ - const StorageIndex& col() const { return m_col; } - - /** \returns the value of the element */ - const Scalar& value() const { return m_value; } -protected: - StorageIndex m_row, m_col; - Scalar m_value; -}; - -} // end namespace Eigen - -#endif // EIGEN_SPARSEUTIL_H diff --git a/Eigen/src/SparseCore/SparseVector.h b/Eigen/src/SparseCore/SparseVector.h deleted file mode 100644 index 19b0fbc9d..000000000 --- a/Eigen/src/SparseCore/SparseVector.h +++ /dev/null @@ -1,478 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEVECTOR_H -#define EIGEN_SPARSEVECTOR_H - -namespace Eigen { - -/** \ingroup SparseCore_Module - * \class SparseVector - * - * \brief a sparse vector class - * - * \tparam _Scalar the scalar type, i.e. the type of the coefficients - * - * See http://www.netlib.org/linalg/html_templates/node91.html for details on the storage scheme. - * - * This class can be extended with the help of the plugin mechanism described on the page - * \ref TopicCustomizing_Plugins by defining the preprocessor symbol \c EIGEN_SPARSEVECTOR_PLUGIN. - */ - -namespace internal { -template -struct traits > -{ - typedef _Scalar Scalar; - typedef _StorageIndex StorageIndex; - typedef Sparse StorageKind; - typedef MatrixXpr XprKind; - enum { - IsColVector = (_Options & RowMajorBit) ? 0 : 1, - - RowsAtCompileTime = IsColVector ? Dynamic : 1, - ColsAtCompileTime = IsColVector ? 1 : Dynamic, - MaxRowsAtCompileTime = RowsAtCompileTime, - MaxColsAtCompileTime = ColsAtCompileTime, - Flags = _Options | NestByRefBit | LvalueBit | (IsColVector ? 0 : RowMajorBit) | CompressedAccessBit, - SupportedAccessPatterns = InnerRandomAccessPattern - }; -}; - -// Sparse-Vector-Assignment kinds: -enum { - SVA_RuntimeSwitch, - SVA_Inner, - SVA_Outer -}; - -template< typename Dest, typename Src, - int AssignmentKind = !bool(Src::IsVectorAtCompileTime) ? SVA_RuntimeSwitch - : Src::InnerSizeAtCompileTime==1 ? SVA_Outer - : SVA_Inner> -struct sparse_vector_assign_selector; - -} - -template -class SparseVector - : public SparseCompressedBase > -{ - typedef SparseCompressedBase Base; - using Base::convert_index; - public: - EIGEN_SPARSE_PUBLIC_INTERFACE(SparseVector) - EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(SparseVector, +=) - EIGEN_SPARSE_INHERIT_ASSIGNMENT_OPERATOR(SparseVector, -=) - - typedef internal::CompressedStorage Storage; - enum { IsColVector = internal::traits::IsColVector }; - - enum { - Options = _Options - }; - - EIGEN_STRONG_INLINE Index rows() const { return IsColVector ? m_size : 1; } - EIGEN_STRONG_INLINE Index cols() const { return IsColVector ? 1 : m_size; } - EIGEN_STRONG_INLINE Index innerSize() const { return m_size; } - EIGEN_STRONG_INLINE Index outerSize() const { return 1; } - - EIGEN_STRONG_INLINE const Scalar* valuePtr() const { return m_data.valuePtr(); } - EIGEN_STRONG_INLINE Scalar* valuePtr() { return m_data.valuePtr(); } - - EIGEN_STRONG_INLINE const StorageIndex* innerIndexPtr() const { return m_data.indexPtr(); } - EIGEN_STRONG_INLINE StorageIndex* innerIndexPtr() { return m_data.indexPtr(); } - - inline const StorageIndex* outerIndexPtr() const { return 0; } - inline StorageIndex* outerIndexPtr() { return 0; } - inline const StorageIndex* innerNonZeroPtr() const { return 0; } - inline StorageIndex* innerNonZeroPtr() { return 0; } - - /** \internal */ - inline Storage& data() { return m_data; } - /** \internal */ - inline const Storage& data() const { return m_data; } - - inline Scalar coeff(Index row, Index col) const - { - eigen_assert(IsColVector ? (col==0 && row>=0 && row=0 && col=0 && i=0 && row=0 && col=0 && i=0 && row=0 && col=0 && i= startId) && (m_data.index(p) > i) ) - { - m_data.index(p+1) = m_data.index(p); - m_data.value(p+1) = m_data.value(p); - --p; - } - m_data.index(p+1) = convert_index(i); - m_data.value(p+1) = 0; - return m_data.value(p+1); - } - - /** - */ - inline void reserve(Index reserveSize) { m_data.reserve(reserveSize); } - - - inline void finalize() {} - - /** \copydoc SparseMatrix::prune(const Scalar&,const RealScalar&) */ - void prune(const Scalar& reference, const RealScalar& epsilon = NumTraits::dummy_precision()) - { - m_data.prune(reference,epsilon); - } - - /** Resizes the sparse vector to \a rows x \a cols - * - * This method is provided for compatibility with matrices. - * For a column vector, \a cols must be equal to 1. - * For a row vector, \a rows must be equal to 1. - * - * \sa resize(Index) - */ - void resize(Index rows, Index cols) - { - eigen_assert((IsColVector ? cols : rows)==1 && "Outer dimension must equal 1"); - resize(IsColVector ? rows : cols); - } - - /** Resizes the sparse vector to \a newSize - * This method deletes all entries, thus leaving an empty sparse vector - * - * \sa conservativeResize(), setZero() */ - void resize(Index newSize) - { - m_size = newSize; - m_data.clear(); - } - - /** Resizes the sparse vector to \a newSize, while leaving old values untouched. - * - * If the size of the vector is decreased, then the storage of the out-of bounds coefficients is kept and reserved. - * Call .data().squeeze() to free extra memory. - * - * \sa reserve(), setZero() - */ - void conservativeResize(Index newSize) - { - if (newSize < m_size) - { - Index i = 0; - while (i - inline SparseVector(const SparseMatrixBase& other) - : m_size(0) - { - #ifdef EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - EIGEN_SPARSE_CREATE_TEMPORARY_PLUGIN - #endif - check_template_parameters(); - *this = other.derived(); - } - - inline SparseVector(const SparseVector& other) - : Base(other), m_size(0) - { - check_template_parameters(); - *this = other.derived(); - } - - /** Swaps the values of \c *this and \a other. - * Overloaded for performance: this version performs a \em shallow swap by swaping pointers and attributes only. - * \sa SparseMatrixBase::swap() - */ - inline void swap(SparseVector& other) - { - std::swap(m_size, other.m_size); - m_data.swap(other.m_data); - } - - template - inline void swap(SparseMatrix& other) - { - eigen_assert(other.outerSize()==1); - std::swap(m_size, other.m_innerSize); - m_data.swap(other.m_data); - } - - inline SparseVector& operator=(const SparseVector& other) - { - if (other.isRValue()) - { - swap(other.const_cast_derived()); - } - else - { - resize(other.size()); - m_data = other.m_data; - } - return *this; - } - - template - inline SparseVector& operator=(const SparseMatrixBase& other) - { - SparseVector tmp(other.size()); - internal::sparse_vector_assign_selector::run(tmp,other.derived()); - this->swap(tmp); - return *this; - } - - #ifndef EIGEN_PARSED_BY_DOXYGEN - template - inline SparseVector& operator=(const SparseSparseProduct& product) - { - return Base::operator=(product); - } - #endif - - friend std::ostream & operator << (std::ostream & s, const SparseVector& m) - { - for (Index i=0; i::IsSigned,THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE); - EIGEN_STATIC_ASSERT((_Options&(ColMajor|RowMajor))==Options,INVALID_MATRIX_TEMPLATE_PARAMETERS); - } - - Storage m_data; - Index m_size; -}; - -namespace internal { - -template -struct evaluator > - : evaluator_base > -{ - typedef SparseVector<_Scalar,_Options,_Index> SparseVectorType; - typedef evaluator_base Base; - typedef typename SparseVectorType::InnerIterator InnerIterator; - typedef typename SparseVectorType::ReverseInnerIterator ReverseInnerIterator; - - enum { - CoeffReadCost = NumTraits<_Scalar>::ReadCost, - Flags = SparseVectorType::Flags - }; - - evaluator() : Base() {} - - explicit evaluator(const SparseVectorType &mat) : m_matrix(&mat) - { - EIGEN_INTERNAL_CHECK_COST_VALUE(CoeffReadCost); - } - - inline Index nonZerosEstimate() const { - return m_matrix->nonZeros(); - } - - operator SparseVectorType&() { return m_matrix->const_cast_derived(); } - operator const SparseVectorType&() const { return *m_matrix; } - - const SparseVectorType *m_matrix; -}; - -template< typename Dest, typename Src> -struct sparse_vector_assign_selector { - static void run(Dest& dst, const Src& src) { - eigen_internal_assert(src.innerSize()==src.size()); - typedef internal::evaluator SrcEvaluatorType; - SrcEvaluatorType srcEval(src); - for(typename SrcEvaluatorType::InnerIterator it(srcEval, 0); it; ++it) - dst.insert(it.index()) = it.value(); - } -}; - -template< typename Dest, typename Src> -struct sparse_vector_assign_selector { - static void run(Dest& dst, const Src& src) { - eigen_internal_assert(src.outerSize()==src.size()); - typedef internal::evaluator SrcEvaluatorType; - SrcEvaluatorType srcEval(src); - for(Index i=0; i -struct sparse_vector_assign_selector { - static void run(Dest& dst, const Src& src) { - if(src.outerSize()==1) sparse_vector_assign_selector::run(dst, src); - else sparse_vector_assign_selector::run(dst, src); - } -}; - -} - -} // end namespace Eigen - -#endif // EIGEN_SPARSEVECTOR_H diff --git a/Eigen/src/SparseCore/SparseView.h b/Eigen/src/SparseCore/SparseView.h deleted file mode 100644 index 7c4aea743..000000000 --- a/Eigen/src/SparseCore/SparseView.h +++ /dev/null @@ -1,253 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2011-2014 Gael Guennebaud -// Copyright (C) 2010 Daniel Lowengrub -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSEVIEW_H -#define EIGEN_SPARSEVIEW_H - -namespace Eigen { - -namespace internal { - -template -struct traits > : traits -{ - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Sparse StorageKind; - enum { - Flags = int(traits::Flags) & (RowMajorBit) - }; -}; - -} // end namespace internal - -/** \ingroup SparseCore_Module - * \class SparseView - * - * \brief Expression of a dense or sparse matrix with zero or too small values removed - * - * \tparam MatrixType the type of the object of which we are removing the small entries - * - * This class represents an expression of a given dense or sparse matrix with - * entries smaller than \c reference * \c epsilon are removed. - * It is the return type of MatrixBase::sparseView() and SparseMatrixBase::pruned() - * and most of the time this is the only way it is used. - * - * \sa MatrixBase::sparseView(), SparseMatrixBase::pruned() - */ -template -class SparseView : public SparseMatrixBase > -{ - typedef typename MatrixType::Nested MatrixTypeNested; - typedef typename internal::remove_all::type _MatrixTypeNested; - typedef SparseMatrixBase Base; -public: - EIGEN_SPARSE_PUBLIC_INTERFACE(SparseView) - typedef typename internal::remove_all::type NestedExpression; - - explicit SparseView(const MatrixType& mat, const Scalar& reference = Scalar(0), - const RealScalar &epsilon = NumTraits::dummy_precision()) - : m_matrix(mat), m_reference(reference), m_epsilon(epsilon) {} - - inline Index rows() const { return m_matrix.rows(); } - inline Index cols() const { return m_matrix.cols(); } - - inline Index innerSize() const { return m_matrix.innerSize(); } - inline Index outerSize() const { return m_matrix.outerSize(); } - - /** \returns the nested expression */ - const typename internal::remove_all::type& - nestedExpression() const { return m_matrix; } - - Scalar reference() const { return m_reference; } - RealScalar epsilon() const { return m_epsilon; } - -protected: - MatrixTypeNested m_matrix; - Scalar m_reference; - RealScalar m_epsilon; -}; - -namespace internal { - -// TODO find a way to unify the two following variants -// This is tricky because implementing an inner iterator on top of an IndexBased evaluator is -// not easy because the evaluators do not expose the sizes of the underlying expression. - -template -struct unary_evaluator, IteratorBased> - : public evaluator_base > -{ - typedef typename evaluator::InnerIterator EvalIterator; - public: - typedef SparseView XprType; - - class InnerIterator : public EvalIterator - { - typedef typename XprType::Scalar Scalar; - public: - - EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& sve, Index outer) - : EvalIterator(sve.m_argImpl,outer), m_view(sve.m_view) - { - incrementToNonZero(); - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - EvalIterator::operator++(); - incrementToNonZero(); - return *this; - } - - using EvalIterator::value; - - protected: - const XprType &m_view; - - private: - void incrementToNonZero() - { - while((bool(*this)) && internal::isMuchSmallerThan(value(), m_view.reference(), m_view.epsilon())) - { - EvalIterator::operator++(); - } - } - }; - - enum { - CoeffReadCost = evaluator::CoeffReadCost, - Flags = XprType::Flags - }; - - explicit unary_evaluator(const XprType& xpr) : m_argImpl(xpr.nestedExpression()), m_view(xpr) {} - - protected: - evaluator m_argImpl; - const XprType &m_view; -}; - -template -struct unary_evaluator, IndexBased> - : public evaluator_base > -{ - public: - typedef SparseView XprType; - protected: - enum { IsRowMajor = (XprType::Flags&RowMajorBit)==RowMajorBit }; - typedef typename XprType::Scalar Scalar; - typedef typename XprType::StorageIndex StorageIndex; - public: - - class InnerIterator - { - public: - - EIGEN_STRONG_INLINE InnerIterator(const unary_evaluator& sve, Index outer) - : m_sve(sve), m_inner(0), m_outer(outer), m_end(sve.m_view.innerSize()) - { - incrementToNonZero(); - } - - EIGEN_STRONG_INLINE InnerIterator& operator++() - { - m_inner++; - incrementToNonZero(); - return *this; - } - - EIGEN_STRONG_INLINE Scalar value() const - { - return (IsRowMajor) ? m_sve.m_argImpl.coeff(m_outer, m_inner) - : m_sve.m_argImpl.coeff(m_inner, m_outer); - } - - EIGEN_STRONG_INLINE StorageIndex index() const { return m_inner; } - inline Index row() const { return IsRowMajor ? m_outer : index(); } - inline Index col() const { return IsRowMajor ? index() : m_outer; } - - EIGEN_STRONG_INLINE operator bool() const { return m_inner < m_end && m_inner>=0; } - - protected: - const unary_evaluator &m_sve; - Index m_inner; - const Index m_outer; - const Index m_end; - - private: - void incrementToNonZero() - { - while((bool(*this)) && internal::isMuchSmallerThan(value(), m_sve.m_view.reference(), m_sve.m_view.epsilon())) - { - m_inner++; - } - } - }; - - enum { - CoeffReadCost = evaluator::CoeffReadCost, - Flags = XprType::Flags - }; - - explicit unary_evaluator(const XprType& xpr) : m_argImpl(xpr.nestedExpression()), m_view(xpr) {} - - protected: - evaluator m_argImpl; - const XprType &m_view; -}; - -} // end namespace internal - -/** \ingroup SparseCore_Module - * - * \returns a sparse expression of the dense expression \c *this with values smaller than - * \a reference * \a epsilon removed. - * - * This method is typically used when prototyping to convert a quickly assembled dense Matrix \c D to a SparseMatrix \c S: - * \code - * MatrixXd D(n,m); - * SparseMatrix S; - * S = D.sparseView(); // suppress numerical zeros (exact) - * S = D.sparseView(reference); - * S = D.sparseView(reference,epsilon); - * \endcode - * where \a reference is a meaningful non zero reference value, - * and \a epsilon is a tolerance factor defaulting to NumTraits::dummy_precision(). - * - * \sa SparseMatrixBase::pruned(), class SparseView */ -template -const SparseView MatrixBase::sparseView(const Scalar& reference, - const typename NumTraits::Real& epsilon) const -{ - return SparseView(derived(), reference, epsilon); -} - -/** \returns an expression of \c *this with values smaller than - * \a reference * \a epsilon removed. - * - * This method is typically used in conjunction with the product of two sparse matrices - * to automatically prune the smallest values as follows: - * \code - * C = (A*B).pruned(); // suppress numerical zeros (exact) - * C = (A*B).pruned(ref); - * C = (A*B).pruned(ref,epsilon); - * \endcode - * where \c ref is a meaningful non zero reference value. - * */ -template -const SparseView -SparseMatrixBase::pruned(const Scalar& reference, - const RealScalar& epsilon) const -{ - return SparseView(derived(), reference, epsilon); -} - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/SparseCore/TriangularSolver.h b/Eigen/src/SparseCore/TriangularSolver.h deleted file mode 100644 index f9c56ba79..000000000 --- a/Eigen/src/SparseCore/TriangularSolver.h +++ /dev/null @@ -1,315 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSETRIANGULARSOLVER_H -#define EIGEN_SPARSETRIANGULARSOLVER_H - -namespace Eigen { - -namespace internal { - -template::Flags) & RowMajorBit> -struct sparse_solve_triangular_selector; - -// forward substitution, row-major -template -struct sparse_solve_triangular_selector -{ - typedef typename Rhs::Scalar Scalar; - typedef evaluator LhsEval; - typedef typename evaluator::InnerIterator LhsIterator; - static void run(const Lhs& lhs, Rhs& other) - { - LhsEval lhsEval(lhs); - for(Index col=0 ; col -struct sparse_solve_triangular_selector -{ - typedef typename Rhs::Scalar Scalar; - typedef evaluator LhsEval; - typedef typename evaluator::InnerIterator LhsIterator; - static void run(const Lhs& lhs, Rhs& other) - { - LhsEval lhsEval(lhs); - for(Index col=0 ; col=0 ; --i) - { - Scalar tmp = other.coeff(i,col); - Scalar l_ii(0); - LhsIterator it(lhsEval, i); - while(it && it.index() -struct sparse_solve_triangular_selector -{ - typedef typename Rhs::Scalar Scalar; - typedef evaluator LhsEval; - typedef typename evaluator::InnerIterator LhsIterator; - static void run(const Lhs& lhs, Rhs& other) - { - LhsEval lhsEval(lhs); - for(Index col=0 ; col -struct sparse_solve_triangular_selector -{ - typedef typename Rhs::Scalar Scalar; - typedef evaluator LhsEval; - typedef typename evaluator::InnerIterator LhsIterator; - static void run(const Lhs& lhs, Rhs& other) - { - LhsEval lhsEval(lhs); - for(Index col=0 ; col=0; --i) - { - Scalar& tmp = other.coeffRef(i,col); - if (tmp!=Scalar(0)) // optimization when other is actually sparse - { - if(!(Mode & UnitDiag)) - { - // TODO replace this by a binary search. make sure the binary search is safe for partially sorted elements - LhsIterator it(lhsEval, i); - while(it && it.index()!=i) - ++it; - eigen_assert(it && it.index()==i); - other.coeffRef(i,col) /= it.value(); - } - LhsIterator it(lhsEval, i); - for(; it && it.index() -template -void TriangularViewImpl::solveInPlace(MatrixBase& other) const -{ - eigen_assert(derived().cols() == derived().rows() && derived().cols() == other.rows()); - eigen_assert((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower))); - - enum { copy = internal::traits::Flags & RowMajorBit }; - - typedef typename internal::conditional::type, OtherDerived&>::type OtherCopy; - OtherCopy otherCopy(other.derived()); - - internal::sparse_solve_triangular_selector::type, Mode>::run(derived().nestedExpression(), otherCopy); - - if (copy) - other = otherCopy; -} -#endif - -// pure sparse path - -namespace internal { - -template -struct sparse_solve_triangular_sparse_selector; - -// forward substitution, col-major -template -struct sparse_solve_triangular_sparse_selector -{ - typedef typename Rhs::Scalar Scalar; - typedef typename promote_index_type::StorageIndex, - typename traits::StorageIndex>::type StorageIndex; - static void run(const Lhs& lhs, Rhs& other) - { - const bool IsLower = (UpLo==Lower); - AmbiVector tempVector(other.rows()*2); - tempVector.setBounds(0,other.rows()); - - Rhs res(other.rows(), other.cols()); - res.reserve(other.nonZeros()); - - for(Index col=0 ; col=0; - i+=IsLower?1:-1) - { - tempVector.restart(); - Scalar& ci = tempVector.coeffRef(i); - if (ci!=Scalar(0)) - { - // find - typename Lhs::InnerIterator it(lhs, i); - if(!(Mode & UnitDiag)) - { - if (IsLower) - { - eigen_assert(it.index()==i); - ci /= it.value(); - } - else - ci /= lhs.coeff(i,i); - } - tempVector.restart(); - if (IsLower) - { - if (it.index()==i) - ++it; - for(; it; ++it) - tempVector.coeffRef(it.index()) -= ci * it.value(); - } - else - { - for(; it && it.index()::Iterator it(tempVector/*,1e-12*/); it; ++it) - { - ++ count; -// std::cerr << "fill " << it.index() << ", " << col << "\n"; -// std::cout << it.value() << " "; - // FIXME use insertBack - res.insert(it.index(), col) = it.value(); - } -// std::cout << "tempVector.nonZeros() == " << int(count) << " / " << (other.rows()) << "\n"; - } - res.finalize(); - other = res.markAsRValue(); - } -}; - -} // end namespace internal - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void TriangularViewImpl::solveInPlace(SparseMatrixBase& other) const -{ - eigen_assert(derived().cols() == derived().rows() && derived().cols() == other.rows()); - eigen_assert( (!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower))); - -// enum { copy = internal::traits::Flags & RowMajorBit }; - -// typedef typename internal::conditional::type, OtherDerived&>::type OtherCopy; -// OtherCopy otherCopy(other.derived()); - - internal::sparse_solve_triangular_sparse_selector::run(derived().nestedExpression(), other.derived()); - -// if (copy) -// other = otherCopy; -} -#endif - -} // end namespace Eigen - -#endif // EIGEN_SPARSETRIANGULARSOLVER_H diff --git a/Eigen/src/SparseLU/SparseLU.h b/Eigen/src/SparseLU/SparseLU.h deleted file mode 100644 index f883ab383..000000000 --- a/Eigen/src/SparseLU/SparseLU.h +++ /dev/null @@ -1,775 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// Copyright (C) 2012-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -#ifndef EIGEN_SPARSE_LU_H -#define EIGEN_SPARSE_LU_H - -namespace Eigen { - -template > class SparseLU; -template struct SparseLUMatrixLReturnType; -template struct SparseLUMatrixUReturnType; - -/** \ingroup SparseLU_Module - * \class SparseLU - * - * \brief Sparse supernodal LU factorization for general matrices - * - * This class implements the supernodal LU factorization for general matrices. - * It uses the main techniques from the sequential SuperLU package - * (http://crd-legacy.lbl.gov/~xiaoye/SuperLU/). It handles transparently real - * and complex arithmetics with single and double precision, depending on the - * scalar type of your input matrix. - * The code has been optimized to provide BLAS-3 operations during supernode-panel updates. - * It benefits directly from the built-in high-performant Eigen BLAS routines. - * Moreover, when the size of a supernode is very small, the BLAS calls are avoided to - * enable a better optimization from the compiler. For best performance, - * you should compile it with NDEBUG flag to avoid the numerous bounds checking on vectors. - * - * An important parameter of this class is the ordering method. It is used to reorder the columns - * (and eventually the rows) of the matrix to reduce the number of new elements that are created during - * numerical factorization. The cheapest method available is COLAMD. - * See \link OrderingMethods_Module the OrderingMethods module \endlink for the list of - * built-in and external ordering methods. - * - * Simple example with key steps - * \code - * VectorXd x(n), b(n); - * SparseMatrix A; - * SparseLU, COLAMDOrdering > solver; - * // fill A and b; - * // Compute the ordering permutation vector from the structural pattern of A - * solver.analyzePattern(A); - * // Compute the numerical factorization - * solver.factorize(A); - * //Use the factors to solve the linear system - * x = solver.solve(b); - * \endcode - * - * \warning The input matrix A should be in a \b compressed and \b column-major form. - * Otherwise an expensive copy will be made. You can call the inexpensive makeCompressed() to get a compressed matrix. - * - * \note Unlike the initial SuperLU implementation, there is no step to equilibrate the matrix. - * For badly scaled matrices, this step can be useful to reduce the pivoting during factorization. - * If this is the case for your matrices, you can try the basic scaling method at - * "unsupported/Eigen/src/IterativeSolvers/Scaling.h" - * - * \tparam _MatrixType The type of the sparse matrix. It must be a column-major SparseMatrix<> - * \tparam _OrderingType The ordering method to use, either AMD, COLAMD or METIS. Default is COLMAD - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept - * \sa \ref OrderingMethods_Module - */ -template -class SparseLU : public SparseSolverBase >, public internal::SparseLUImpl -{ - protected: - typedef SparseSolverBase > APIBase; - using APIBase::m_isInitialized; - public: - using APIBase::_solve_impl; - - typedef _MatrixType MatrixType; - typedef _OrderingType OrderingType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix NCMatrix; - typedef internal::MappedSuperNodalMatrix SCMatrix; - typedef Matrix ScalarVector; - typedef Matrix IndexVector; - typedef PermutationMatrix PermutationType; - typedef internal::SparseLUImpl Base; - - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - SparseLU():m_lastError(""),m_Ustore(0,0,0,0,0,0),m_symmetricmode(false),m_diagpivotthresh(1.0),m_detPermR(1) - { - initperfvalues(); - } - explicit SparseLU(const MatrixType& matrix) - : m_lastError(""),m_Ustore(0,0,0,0,0,0),m_symmetricmode(false),m_diagpivotthresh(1.0),m_detPermR(1) - { - initperfvalues(); - compute(matrix); - } - - ~SparseLU() - { - // Free all explicit dynamic pointers - } - - void analyzePattern (const MatrixType& matrix); - void factorize (const MatrixType& matrix); - void simplicialfactorize(const MatrixType& matrix); - - /** - * Compute the symbolic and numeric factorization of the input sparse matrix. - * The input matrix should be in column-major storage. - */ - void compute (const MatrixType& matrix) - { - // Analyze - analyzePattern(matrix); - //Factorize - factorize(matrix); - } - - inline Index rows() const { return m_mat.rows(); } - inline Index cols() const { return m_mat.cols(); } - /** Indicate that the pattern of the input matrix is symmetric */ - void isSymmetric(bool sym) - { - m_symmetricmode = sym; - } - - /** \returns an expression of the matrix L, internally stored as supernodes - * The only operation available with this expression is the triangular solve - * \code - * y = b; matrixL().solveInPlace(y); - * \endcode - */ - SparseLUMatrixLReturnType matrixL() const - { - return SparseLUMatrixLReturnType(m_Lstore); - } - /** \returns an expression of the matrix U, - * The only operation available with this expression is the triangular solve - * \code - * y = b; matrixU().solveInPlace(y); - * \endcode - */ - SparseLUMatrixUReturnType > matrixU() const - { - return SparseLUMatrixUReturnType >(m_Lstore, m_Ustore); - } - - /** - * \returns a reference to the row matrix permutation \f$ P_r \f$ such that \f$P_r A P_c^T = L U\f$ - * \sa colsPermutation() - */ - inline const PermutationType& rowsPermutation() const - { - return m_perm_r; - } - /** - * \returns a reference to the column matrix permutation\f$ P_c^T \f$ such that \f$P_r A P_c^T = L U\f$ - * \sa rowsPermutation() - */ - inline const PermutationType& colsPermutation() const - { - return m_perm_c; - } - /** Set the threshold used for a diagonal entry to be an acceptable pivot. */ - void setPivotThreshold(const RealScalar& thresh) - { - m_diagpivotthresh = thresh; - } - -#ifdef EIGEN_PARSED_BY_DOXYGEN - /** \returns the solution X of \f$ A X = B \f$ using the current decomposition of A. - * - * \warning the destination matrix X in X = this->solve(B) must be colmun-major. - * - * \sa compute() - */ - template - inline const Solve solve(const MatrixBase& B) const; -#endif // EIGEN_PARSED_BY_DOXYGEN - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the LU factorization reports a problem, zero diagonal for instance - * \c InvalidInput if the input matrix is invalid - * - * \sa iparm() - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - /** - * \returns A string describing the type of error - */ - std::string lastErrorMessage() const - { - return m_lastError; - } - - template - bool _solve_impl(const MatrixBase &B, MatrixBase &X_base) const - { - Dest& X(X_base.derived()); - eigen_assert(m_factorizationIsOk && "The matrix should be factorized first"); - EIGEN_STATIC_ASSERT((Dest::Flags&RowMajorBit)==0, - THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES); - - // Permute the right hand side to form X = Pr*B - // on return, X is overwritten by the computed solution - X.resize(B.rows(),B.cols()); - - // this ugly const_cast_derived() helps to detect aliasing when applying the permutations - for(Index j = 0; j < B.cols(); ++j) - X.col(j) = rowsPermutation() * B.const_cast_derived().col(j); - - //Forward substitution with L - this->matrixL().solveInPlace(X); - this->matrixU().solveInPlace(X); - - // Permute back the solution - for (Index j = 0; j < B.cols(); ++j) - X.col(j) = colsPermutation().inverse() * X.col(j); - - return true; - } - - /** - * \returns the absolute value of the determinant of the matrix of which - * *this is the QR decomposition. - * - * \warning a determinant can be very big or small, so for matrices - * of large enough dimension, there is a risk of overflow/underflow. - * One way to work around that is to use logAbsDeterminant() instead. - * - * \sa logAbsDeterminant(), signDeterminant() - */ - Scalar absDeterminant() - { - using std::abs; - eigen_assert(m_factorizationIsOk && "The matrix should be factorized first."); - // Initialize with the determinant of the row matrix - Scalar det = Scalar(1.); - // Note that the diagonal blocks of U are stored in supernodes, - // which are available in the L part :) - for (Index j = 0; j < this->cols(); ++j) - { - for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) - { - if(it.index() == j) - { - det *= abs(it.value()); - break; - } - } - } - return det; - } - - /** \returns the natural log of the absolute value of the determinant of the matrix - * of which **this is the QR decomposition - * - * \note This method is useful to work around the risk of overflow/underflow that's - * inherent to the determinant computation. - * - * \sa absDeterminant(), signDeterminant() - */ - Scalar logAbsDeterminant() const - { - using std::log; - using std::abs; - - eigen_assert(m_factorizationIsOk && "The matrix should be factorized first."); - Scalar det = Scalar(0.); - for (Index j = 0; j < this->cols(); ++j) - { - for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) - { - if(it.row() < j) continue; - if(it.row() == j) - { - det += log(abs(it.value())); - break; - } - } - } - return det; - } - - /** \returns A number representing the sign of the determinant - * - * \sa absDeterminant(), logAbsDeterminant() - */ - Scalar signDeterminant() - { - eigen_assert(m_factorizationIsOk && "The matrix should be factorized first."); - // Initialize with the determinant of the row matrix - Index det = 1; - // Note that the diagonal blocks of U are stored in supernodes, - // which are available in the L part :) - for (Index j = 0; j < this->cols(); ++j) - { - for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) - { - if(it.index() == j) - { - if(it.value()<0) - det = -det; - else if(it.value()==0) - return 0; - break; - } - } - } - return det * m_detPermR * m_detPermC; - } - - /** \returns The determinant of the matrix. - * - * \sa absDeterminant(), logAbsDeterminant() - */ - Scalar determinant() - { - eigen_assert(m_factorizationIsOk && "The matrix should be factorized first."); - // Initialize with the determinant of the row matrix - Scalar det = Scalar(1.); - // Note that the diagonal blocks of U are stored in supernodes, - // which are available in the L part :) - for (Index j = 0; j < this->cols(); ++j) - { - for (typename SCMatrix::InnerIterator it(m_Lstore, j); it; ++it) - { - if(it.index() == j) - { - det *= it.value(); - break; - } - } - } - return (m_detPermR * m_detPermC) > 0 ? det : -det; - } - - protected: - // Functions - void initperfvalues() - { - m_perfv.panel_size = 16; - m_perfv.relax = 1; - m_perfv.maxsuper = 128; - m_perfv.rowblk = 16; - m_perfv.colblk = 8; - m_perfv.fillfactor = 20; - } - - // Variables - mutable ComputationInfo m_info; - bool m_factorizationIsOk; - bool m_analysisIsOk; - std::string m_lastError; - NCMatrix m_mat; // The input (permuted ) matrix - SCMatrix m_Lstore; // The lower triangular matrix (supernodal) - MappedSparseMatrix m_Ustore; // The upper triangular matrix - PermutationType m_perm_c; // Column permutation - PermutationType m_perm_r ; // Row permutation - IndexVector m_etree; // Column elimination tree - - typename Base::GlobalLU_t m_glu; - - // SparseLU options - bool m_symmetricmode; - // values for performance - internal::perfvalues m_perfv; - RealScalar m_diagpivotthresh; // Specifies the threshold used for a diagonal entry to be an acceptable pivot - Index m_nnzL, m_nnzU; // Nonzeros in L and U factors - Index m_detPermR, m_detPermC; // Determinants of the permutation matrices - private: - // Disable copy constructor - SparseLU (const SparseLU& ); - -}; // End class SparseLU - - - -// Functions needed by the anaysis phase -/** - * Compute the column permutation to minimize the fill-in - * - * - Apply this permutation to the input matrix - - * - * - Compute the column elimination tree on the permuted matrix - * - * - Postorder the elimination tree and the column permutation - * - */ -template -void SparseLU::analyzePattern(const MatrixType& mat) -{ - - //TODO It is possible as in SuperLU to compute row and columns scaling vectors to equilibrate the matrix mat. - - // Firstly, copy the whole input matrix. - m_mat = mat; - - // Compute fill-in ordering - OrderingType ord; - ord(m_mat,m_perm_c); - - // Apply the permutation to the column of the input matrix - if (m_perm_c.size()) - { - m_mat.uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. FIXME : This vector is filled but not subsequently used. - // Then, permute only the column pointers - ei_declare_aligned_stack_constructed_variable(StorageIndex,outerIndexPtr,mat.cols()+1,mat.isCompressed()?const_cast(mat.outerIndexPtr()):0); - - // If the input matrix 'mat' is uncompressed, then the outer-indices do not match the ones of m_mat, and a copy is thus needed. - if(!mat.isCompressed()) - IndexVector::Map(outerIndexPtr, mat.cols()+1) = IndexVector::Map(m_mat.outerIndexPtr(),mat.cols()+1); - - // Apply the permutation and compute the nnz per column. - for (Index i = 0; i < mat.cols(); i++) - { - m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i]; - m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i]; - } - } - - // Compute the column elimination tree of the permuted matrix - IndexVector firstRowElt; - internal::coletree(m_mat, m_etree,firstRowElt); - - // In symmetric mode, do not do postorder here - if (!m_symmetricmode) { - IndexVector post, iwork; - // Post order etree - internal::treePostorder(StorageIndex(m_mat.cols()), m_etree, post); - - - // Renumber etree in postorder - Index m = m_mat.cols(); - iwork.resize(m+1); - for (Index i = 0; i < m; ++i) iwork(post(i)) = post(m_etree(i)); - m_etree = iwork; - - // Postmultiply A*Pc by post, i.e reorder the matrix according to the postorder of the etree - PermutationType post_perm(m); - for (Index i = 0; i < m; i++) - post_perm.indices()(i) = post(i); - - // Combine the two permutations : postorder the permutation for future use - if(m_perm_c.size()) { - m_perm_c = post_perm * m_perm_c; - } - - } // end postordering - - m_analysisIsOk = true; -} - -// Functions needed by the numerical factorization phase - - -/** - * - Numerical factorization - * - Interleaved with the symbolic factorization - * On exit, info is - * - * = 0: successful factorization - * - * > 0: if info = i, and i is - * - * <= A->ncol: U(i,i) is exactly zero. The factorization has - * been completed, but the factor U is exactly singular, - * and division by zero will occur if it is used to solve a - * system of equations. - * - * > A->ncol: number of bytes allocated when memory allocation - * failure occurred, plus A->ncol. If lwork = -1, it is - * the estimated amount of space needed, plus A->ncol. - */ -template -void SparseLU::factorize(const MatrixType& matrix) -{ - using internal::emptyIdxLU; - eigen_assert(m_analysisIsOk && "analyzePattern() should be called first"); - eigen_assert((matrix.rows() == matrix.cols()) && "Only for squared matrices"); - - typedef typename IndexVector::Scalar StorageIndex; - - m_isInitialized = true; - - - // Apply the column permutation computed in analyzepattern() - // m_mat = matrix * m_perm_c.inverse(); - m_mat = matrix; - if (m_perm_c.size()) - { - m_mat.uncompress(); //NOTE: The effect of this command is only to create the InnerNonzeros pointers. - //Then, permute only the column pointers - const StorageIndex * outerIndexPtr; - if (matrix.isCompressed()) outerIndexPtr = matrix.outerIndexPtr(); - else - { - StorageIndex* outerIndexPtr_t = new StorageIndex[matrix.cols()+1]; - for(Index i = 0; i <= matrix.cols(); i++) outerIndexPtr_t[i] = m_mat.outerIndexPtr()[i]; - outerIndexPtr = outerIndexPtr_t; - } - for (Index i = 0; i < matrix.cols(); i++) - { - m_mat.outerIndexPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i]; - m_mat.innerNonZeroPtr()[m_perm_c.indices()(i)] = outerIndexPtr[i+1] - outerIndexPtr[i]; - } - if(!matrix.isCompressed()) delete[] outerIndexPtr; - } - else - { //FIXME This should not be needed if the empty permutation is handled transparently - m_perm_c.resize(matrix.cols()); - for(StorageIndex i = 0; i < matrix.cols(); ++i) m_perm_c.indices()(i) = i; - } - - Index m = m_mat.rows(); - Index n = m_mat.cols(); - Index nnz = m_mat.nonZeros(); - Index maxpanel = m_perfv.panel_size * m; - // Allocate working storage common to the factor routines - Index lwork = 0; - Index info = Base::memInit(m, n, nnz, lwork, m_perfv.fillfactor, m_perfv.panel_size, m_glu); - if (info) - { - m_lastError = "UNABLE TO ALLOCATE WORKING MEMORY\n\n" ; - m_factorizationIsOk = false; - return ; - } - - // Set up pointers for integer working arrays - IndexVector segrep(m); segrep.setZero(); - IndexVector parent(m); parent.setZero(); - IndexVector xplore(m); xplore.setZero(); - IndexVector repfnz(maxpanel); - IndexVector panel_lsub(maxpanel); - IndexVector xprune(n); xprune.setZero(); - IndexVector marker(m*internal::LUNoMarker); marker.setZero(); - - repfnz.setConstant(-1); - panel_lsub.setConstant(-1); - - // Set up pointers for scalar working arrays - ScalarVector dense; - dense.setZero(maxpanel); - ScalarVector tempv; - tempv.setZero(internal::LUnumTempV(m, m_perfv.panel_size, m_perfv.maxsuper, /*m_perfv.rowblk*/m) ); - - // Compute the inverse of perm_c - PermutationType iperm_c(m_perm_c.inverse()); - - // Identify initial relaxed snodes - IndexVector relax_end(n); - if ( m_symmetricmode == true ) - Base::heap_relax_snode(n, m_etree, m_perfv.relax, marker, relax_end); - else - Base::relax_snode(n, m_etree, m_perfv.relax, marker, relax_end); - - - m_perm_r.resize(m); - m_perm_r.indices().setConstant(-1); - marker.setConstant(-1); - m_detPermR = 1; // Record the determinant of the row permutation - - m_glu.supno(0) = emptyIdxLU; m_glu.xsup.setConstant(0); - m_glu.xsup(0) = m_glu.xlsub(0) = m_glu.xusub(0) = m_glu.xlusup(0) = Index(0); - - // Work on one 'panel' at a time. A panel is one of the following : - // (a) a relaxed supernode at the bottom of the etree, or - // (b) panel_size contiguous columns, defined by the user - Index jcol; - IndexVector panel_histo(n); - Index pivrow; // Pivotal row number in the original row matrix - Index nseg1; // Number of segments in U-column above panel row jcol - Index nseg; // Number of segments in each U-column - Index irep; - Index i, k, jj; - for (jcol = 0; jcol < n; ) - { - // Adjust panel size so that a panel won't overlap with the next relaxed snode. - Index panel_size = m_perfv.panel_size; // upper bound on panel width - for (k = jcol + 1; k < (std::min)(jcol+panel_size, n); k++) - { - if (relax_end(k) != emptyIdxLU) - { - panel_size = k - jcol; - break; - } - } - if (k == n) - panel_size = n - jcol; - - // Symbolic outer factorization on a panel of columns - Base::panel_dfs(m, panel_size, jcol, m_mat, m_perm_r.indices(), nseg1, dense, panel_lsub, segrep, repfnz, xprune, marker, parent, xplore, m_glu); - - // Numeric sup-panel updates in topological order - Base::panel_bmod(m, panel_size, jcol, nseg1, dense, tempv, segrep, repfnz, m_glu); - - // Sparse LU within the panel, and below the panel diagonal - for ( jj = jcol; jj< jcol + panel_size; jj++) - { - k = (jj - jcol) * m; // Column index for w-wide arrays - - nseg = nseg1; // begin after all the panel segments - //Depth-first-search for the current column - VectorBlock panel_lsubk(panel_lsub, k, m); - VectorBlock repfnz_k(repfnz, k, m); - info = Base::column_dfs(m, jj, m_perm_r.indices(), m_perfv.maxsuper, nseg, panel_lsubk, segrep, repfnz_k, xprune, marker, parent, xplore, m_glu); - if ( info ) - { - m_lastError = "UNABLE TO EXPAND MEMORY IN COLUMN_DFS() "; - m_info = NumericalIssue; - m_factorizationIsOk = false; - return; - } - // Numeric updates to this column - VectorBlock dense_k(dense, k, m); - VectorBlock segrep_k(segrep, nseg1, m-nseg1); - info = Base::column_bmod(jj, (nseg - nseg1), dense_k, tempv, segrep_k, repfnz_k, jcol, m_glu); - if ( info ) - { - m_lastError = "UNABLE TO EXPAND MEMORY IN COLUMN_BMOD() "; - m_info = NumericalIssue; - m_factorizationIsOk = false; - return; - } - - // Copy the U-segments to ucol(*) - info = Base::copy_to_ucol(jj, nseg, segrep, repfnz_k ,m_perm_r.indices(), dense_k, m_glu); - if ( info ) - { - m_lastError = "UNABLE TO EXPAND MEMORY IN COPY_TO_UCOL() "; - m_info = NumericalIssue; - m_factorizationIsOk = false; - return; - } - - // Form the L-segment - info = Base::pivotL(jj, m_diagpivotthresh, m_perm_r.indices(), iperm_c.indices(), pivrow, m_glu); - if ( info ) - { - m_lastError = "THE MATRIX IS STRUCTURALLY SINGULAR ... ZERO COLUMN AT "; - std::ostringstream returnInfo; - returnInfo << info; - m_lastError += returnInfo.str(); - m_info = NumericalIssue; - m_factorizationIsOk = false; - return; - } - - // Update the determinant of the row permutation matrix - // FIXME: the following test is not correct, we should probably take iperm_c into account and pivrow is not directly the row pivot. - if (pivrow != jj) m_detPermR = -m_detPermR; - - // Prune columns (0:jj-1) using column jj - Base::pruneL(jj, m_perm_r.indices(), pivrow, nseg, segrep, repfnz_k, xprune, m_glu); - - // Reset repfnz for this column - for (i = 0; i < nseg; i++) - { - irep = segrep(i); - repfnz_k(irep) = emptyIdxLU; - } - } // end SparseLU within the panel - jcol += panel_size; // Move to the next panel - } // end for -- end elimination - - m_detPermR = m_perm_r.determinant(); - m_detPermC = m_perm_c.determinant(); - - // Count the number of nonzeros in factors - Base::countnz(n, m_nnzL, m_nnzU, m_glu); - // Apply permutation to the L subscripts - Base::fixupL(n, m_perm_r.indices(), m_glu); - - // Create supernode matrix L - m_Lstore.setInfos(m, n, m_glu.lusup, m_glu.xlusup, m_glu.lsub, m_glu.xlsub, m_glu.supno, m_glu.xsup); - // Create the column major upper sparse matrix U; - new (&m_Ustore) MappedSparseMatrix ( m, n, m_nnzU, m_glu.xusub.data(), m_glu.usub.data(), m_glu.ucol.data() ); - - m_info = Success; - m_factorizationIsOk = true; -} - -template -struct SparseLUMatrixLReturnType : internal::no_assignment_operator -{ - typedef typename MappedSupernodalType::Scalar Scalar; - explicit SparseLUMatrixLReturnType(const MappedSupernodalType& mapL) : m_mapL(mapL) - { } - Index rows() { return m_mapL.rows(); } - Index cols() { return m_mapL.cols(); } - template - void solveInPlace( MatrixBase &X) const - { - m_mapL.solveInPlace(X); - } - const MappedSupernodalType& m_mapL; -}; - -template -struct SparseLUMatrixUReturnType : internal::no_assignment_operator -{ - typedef typename MatrixLType::Scalar Scalar; - SparseLUMatrixUReturnType(const MatrixLType& mapL, const MatrixUType& mapU) - : m_mapL(mapL),m_mapU(mapU) - { } - Index rows() { return m_mapL.rows(); } - Index cols() { return m_mapL.cols(); } - - template void solveInPlace(MatrixBase &X) const - { - Index nrhs = X.cols(); - Index n = X.rows(); - // Backward solve with U - for (Index k = m_mapL.nsuper(); k >= 0; k--) - { - Index fsupc = m_mapL.supToCol()[k]; - Index lda = m_mapL.colIndexPtr()[fsupc+1] - m_mapL.colIndexPtr()[fsupc]; // leading dimension - Index nsupc = m_mapL.supToCol()[k+1] - fsupc; - Index luptr = m_mapL.colIndexPtr()[fsupc]; - - if (nsupc == 1) - { - for (Index j = 0; j < nrhs; j++) - { - X(fsupc, j) /= m_mapL.valuePtr()[luptr]; - } - } - else - { - Map, 0, OuterStride<> > A( &(m_mapL.valuePtr()[luptr]), nsupc, nsupc, OuterStride<>(lda) ); - Map< Matrix, 0, OuterStride<> > U (&(X(fsupc,0)), nsupc, nrhs, OuterStride<>(n) ); - U = A.template triangularView().solve(U); - } - - for (Index j = 0; j < nrhs; ++j) - { - for (Index jcol = fsupc; jcol < fsupc + nsupc; jcol++) - { - typename MatrixUType::InnerIterator it(m_mapU, jcol); - for ( ; it; ++it) - { - Index irow = it.index(); - X(irow, j) -= X(jcol, j) * it.value(); - } - } - } - } // End For U-solve - } - const MatrixLType& m_mapL; - const MatrixUType& m_mapU; -}; - -} // End namespace Eigen - -#endif diff --git a/Eigen/src/SparseLU/SparseLUImpl.h b/Eigen/src/SparseLU/SparseLUImpl.h deleted file mode 100644 index fc0cfc4de..000000000 --- a/Eigen/src/SparseLU/SparseLUImpl.h +++ /dev/null @@ -1,66 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. -#ifndef SPARSELU_IMPL_H -#define SPARSELU_IMPL_H - -namespace Eigen { -namespace internal { - -/** \ingroup SparseLU_Module - * \class SparseLUImpl - * Base class for sparseLU - */ -template -class SparseLUImpl -{ - public: - typedef Matrix ScalarVector; - typedef Matrix IndexVector; - typedef Matrix ScalarMatrix; - typedef Map > MappedMatrixBlock; - typedef typename ScalarVector::RealScalar RealScalar; - typedef Ref > BlockScalarVector; - typedef Ref > BlockIndexVector; - typedef LU_GlobalLU_t GlobalLU_t; - typedef SparseMatrix MatrixType; - - protected: - template - Index expand(VectorType& vec, Index& length, Index nbElts, Index keep_prev, Index& num_expansions); - Index memInit(Index m, Index n, Index annz, Index lwork, Index fillratio, Index panel_size, GlobalLU_t& glu); - template - Index memXpand(VectorType& vec, Index& maxlen, Index nbElts, MemType memtype, Index& num_expansions); - void heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); - void relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end); - Index snode_dfs(const Index jcol, const Index kcol,const MatrixType& mat, IndexVector& xprune, IndexVector& marker, GlobalLU_t& glu); - Index snode_bmod (const Index jcol, const Index fsupc, ScalarVector& dense, GlobalLU_t& glu); - Index pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iperm_c, Index& pivrow, GlobalLU_t& glu); - template - void dfs_kernel(const StorageIndex jj, IndexVector& perm_r, - Index& nseg, IndexVector& panel_lsub, IndexVector& segrep, - Ref repfnz_col, IndexVector& xprune, Ref marker, IndexVector& parent, - IndexVector& xplore, GlobalLU_t& glu, Index& nextl_col, Index krow, Traits& traits); - void panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A, IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu); - - void panel_bmod(const Index m, const Index w, const Index jcol, const Index nseg, ScalarVector& dense, ScalarVector& tempv, IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu); - Index column_dfs(const Index m, const Index jcol, IndexVector& perm_r, Index maxsuper, Index& nseg, BlockIndexVector lsub_col, IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu); - Index column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv, BlockIndexVector segrep, BlockIndexVector repfnz, Index fpanelc, GlobalLU_t& glu); - Index copy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu); - void pruneL(const Index jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, const IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, GlobalLU_t& glu); - void countnz(const Index n, Index& nnzL, Index& nnzU, GlobalLU_t& glu); - void fixupL(const Index n, const IndexVector& perm_r, GlobalLU_t& glu); - - template - friend struct column_dfs_traits; -}; - -} // end namespace internal -} // namespace Eigen - -#endif diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h deleted file mode 100644 index 4dc42e87b..000000000 --- a/Eigen/src/SparseLU/SparseLU_Memory.h +++ /dev/null @@ -1,226 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of [s,d,c,z]memory.c files in SuperLU - - * -- SuperLU routine (version 3.1) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * August 1, 2008 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ - -#ifndef EIGEN_SPARSELU_MEMORY -#define EIGEN_SPARSELU_MEMORY - -namespace Eigen { -namespace internal { - -enum { LUNoMarker = 3 }; -enum {emptyIdxLU = -1}; -inline Index LUnumTempV(Index& m, Index& w, Index& t, Index& b) -{ - return (std::max)(m, (t+b)*w); -} - -template< typename Scalar> -inline Index LUTempSpace(Index&m, Index& w) -{ - return (2*w + 4 + LUNoMarker) * m * sizeof(Index) + (w + 1) * m * sizeof(Scalar); -} - - - - -/** - * Expand the existing storage to accomodate more fill-ins - * \param vec Valid pointer to the vector to allocate or expand - * \param[in,out] length At input, contain the current length of the vector that is to be increased. At output, length of the newly allocated vector - * \param[in] nbElts Current number of elements in the factors - * \param keep_prev 1: use length and do not expand the vector; 0: compute new_len and expand - * \param[in,out] num_expansions Number of times the memory has been expanded - */ -template -template -Index SparseLUImpl::expand(VectorType& vec, Index& length, Index nbElts, Index keep_prev, Index& num_expansions) -{ - - float alpha = 1.5; // Ratio of the memory increase - Index new_len; // New size of the allocated memory - - if(num_expansions == 0 || keep_prev) - new_len = length ; // First time allocate requested - else - new_len = (std::max)(length+1,Index(alpha * length)); - - VectorType old_vec; // Temporary vector to hold the previous values - if (nbElts > 0 ) - old_vec = vec.segment(0,nbElts); - - //Allocate or expand the current vector -#ifdef EIGEN_EXCEPTIONS - try -#endif - { - vec.resize(new_len); - } -#ifdef EIGEN_EXCEPTIONS - catch(std::bad_alloc& ) -#else - if(!vec.size()) -#endif - { - if (!num_expansions) - { - // First time to allocate from LUMemInit() - // Let LUMemInit() deals with it. - return -1; - } - if (keep_prev) - { - // In this case, the memory length should not not be reduced - return new_len; - } - else - { - // Reduce the size and increase again - Index tries = 0; // Number of attempts - do - { - alpha = (alpha + 1)/2; - new_len = (std::max)(length+1,Index(alpha * length)); -#ifdef EIGEN_EXCEPTIONS - try -#endif - { - vec.resize(new_len); - } -#ifdef EIGEN_EXCEPTIONS - catch(std::bad_alloc& ) -#else - if (!vec.size()) -#endif - { - tries += 1; - if ( tries > 10) return new_len; - } - } while (!vec.size()); - } - } - //Copy the previous values to the newly allocated space - if (nbElts > 0) - vec.segment(0, nbElts) = old_vec; - - - length = new_len; - if(num_expansions) ++num_expansions; - return 0; -} - -/** - * \brief Allocate various working space for the numerical factorization phase. - * \param m number of rows of the input matrix - * \param n number of columns - * \param annz number of initial nonzeros in the matrix - * \param lwork if lwork=-1, this routine returns an estimated size of the required memory - * \param glu persistent data to facilitate multiple factors : will be deleted later ?? - * \param fillratio estimated ratio of fill in the factors - * \param panel_size Size of a panel - * \return an estimated size of the required memory if lwork = -1; otherwise, return the size of actually allocated memory when allocation failed, and 0 on success - * \note Unlike SuperLU, this routine does not support successive factorization with the same pattern and the same row permutation - */ -template -Index SparseLUImpl::memInit(Index m, Index n, Index annz, Index lwork, Index fillratio, Index panel_size, GlobalLU_t& glu) -{ - Index& num_expansions = glu.num_expansions; //No memory expansions so far - num_expansions = 0; - glu.nzumax = glu.nzlumax = (std::min)(fillratio * (annz+1) / n, m) * n; // estimated number of nonzeros in U - glu.nzlmax = (std::max)(Index(4), fillratio) * (annz+1) / 4; // estimated nnz in L factor - // Return the estimated size to the user if necessary - Index tempSpace; - tempSpace = (2*panel_size + 4 + LUNoMarker) * m * sizeof(Index) + (panel_size + 1) * m * sizeof(Scalar); - if (lwork == emptyIdxLU) - { - Index estimated_size; - estimated_size = (5 * n + 5) * sizeof(Index) + tempSpace - + (glu.nzlmax + glu.nzumax) * sizeof(Index) + (glu.nzlumax+glu.nzumax) * sizeof(Scalar) + n; - return estimated_size; - } - - // Setup the required space - - // First allocate Integer pointers for L\U factors - glu.xsup.resize(n+1); - glu.supno.resize(n+1); - glu.xlsub.resize(n+1); - glu.xlusup.resize(n+1); - glu.xusub.resize(n+1); - - // Reserve memory for L/U factors - do - { - if( (expand(glu.lusup, glu.nzlumax, 0, 0, num_expansions)<0) - || (expand(glu.ucol, glu.nzumax, 0, 0, num_expansions)<0) - || (expand (glu.lsub, glu.nzlmax, 0, 0, num_expansions)<0) - || (expand (glu.usub, glu.nzumax, 0, 1, num_expansions)<0) ) - { - //Reduce the estimated size and retry - glu.nzlumax /= 2; - glu.nzumax /= 2; - glu.nzlmax /= 2; - if (glu.nzlumax < annz ) return glu.nzlumax; - } - } while (!glu.lusup.size() || !glu.ucol.size() || !glu.lsub.size() || !glu.usub.size()); - - ++num_expansions; - return 0; - -} // end LuMemInit - -/** - * \brief Expand the existing storage - * \param vec vector to expand - * \param[in,out] maxlen On input, previous size of vec (Number of elements to copy ). on output, new size - * \param nbElts current number of elements in the vector. - * \param memtype Type of the element to expand - * \param num_expansions Number of expansions - * \return 0 on success, > 0 size of the memory allocated so far - */ -template -template -Index SparseLUImpl::memXpand(VectorType& vec, Index& maxlen, Index nbElts, MemType memtype, Index& num_expansions) -{ - Index failed_size; - if (memtype == USUB) - failed_size = this->expand(vec, maxlen, nbElts, 1, num_expansions); - else - failed_size = this->expand(vec, maxlen, nbElts, 0, num_expansions); - - if (failed_size) - return failed_size; - - return 0 ; -} - -} // end namespace internal - -} // end namespace Eigen -#endif // EIGEN_SPARSELU_MEMORY diff --git a/Eigen/src/SparseLU/SparseLU_Structs.h b/Eigen/src/SparseLU/SparseLU_Structs.h deleted file mode 100644 index cf5ec449b..000000000 --- a/Eigen/src/SparseLU/SparseLU_Structs.h +++ /dev/null @@ -1,110 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - * NOTE: This file comes from a partly modified version of files slu_[s,d,c,z]defs.h - * -- SuperLU routine (version 4.1) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * November, 2010 - * - * Global data structures used in LU factorization - - * - * nsuper: #supernodes = nsuper + 1, numbered [0, nsuper]. - * (xsup,supno): supno[i] is the supernode no to which i belongs; - * xsup(s) points to the beginning of the s-th supernode. - * e.g. supno 0 1 2 2 3 3 3 4 4 4 4 4 (n=12) - * xsup 0 1 2 4 7 12 - * Note: dfs will be performed on supernode rep. relative to the new - * row pivoting ordering - * - * (xlsub,lsub): lsub[*] contains the compressed subscript of - * rectangular supernodes; xlsub[j] points to the starting - * location of the j-th column in lsub[*]. Note that xlsub - * is indexed by column. - * Storage: original row subscripts - * - * During the course of sparse LU factorization, we also use - * (xlsub,lsub) for the purpose of symmetric pruning. For each - * supernode {s,s+1,...,t=s+r} with first column s and last - * column t, the subscript set - * lsub[j], j=xlsub[s], .., xlsub[s+1]-1 - * is the structure of column s (i.e. structure of this supernode). - * It is used for the storage of numerical values. - * Furthermore, - * lsub[j], j=xlsub[t], .., xlsub[t+1]-1 - * is the structure of the last column t of this supernode. - * It is for the purpose of symmetric pruning. Therefore, the - * structural subscripts can be rearranged without making physical - * interchanges among the numerical values. - * - * However, if the supernode has only one column, then we - * only keep one set of subscripts. For any subscript interchange - * performed, similar interchange must be done on the numerical - * values. - * - * The last column structures (for pruning) will be removed - * after the numercial LU factorization phase. - * - * (xlusup,lusup): lusup[*] contains the numerical values of the - * rectangular supernodes; xlusup[j] points to the starting - * location of the j-th column in storage vector lusup[*] - * Note: xlusup is indexed by column. - * Each rectangular supernode is stored by column-major - * scheme, consistent with Fortran 2-dim array storage. - * - * (xusub,ucol,usub): ucol[*] stores the numerical values of - * U-columns outside the rectangular supernodes. The row - * subscript of nonzero ucol[k] is stored in usub[k]. - * xusub[i] points to the starting location of column i in ucol. - * Storage: new row subscripts; that is subscripts of PA. - */ - -#ifndef EIGEN_LU_STRUCTS -#define EIGEN_LU_STRUCTS -namespace Eigen { -namespace internal { - -typedef enum {LUSUP, UCOL, LSUB, USUB, LLVL, ULVL} MemType; - -template -struct LU_GlobalLU_t { - typedef typename IndexVector::Scalar StorageIndex; - IndexVector xsup; //First supernode column ... xsup(s) points to the beginning of the s-th supernode - IndexVector supno; // Supernode number corresponding to this column (column to supernode mapping) - ScalarVector lusup; // nonzero values of L ordered by columns - IndexVector lsub; // Compressed row indices of L rectangular supernodes. - IndexVector xlusup; // pointers to the beginning of each column in lusup - IndexVector xlsub; // pointers to the beginning of each column in lsub - Index nzlmax; // Current max size of lsub - Index nzlumax; // Current max size of lusup - ScalarVector ucol; // nonzero values of U ordered by columns - IndexVector usub; // row indices of U columns in ucol - IndexVector xusub; // Pointers to the beginning of each column of U in ucol - Index nzumax; // Current max size of ucol - Index n; // Number of columns in the matrix - Index num_expansions; -}; - -// Values to set for performance -struct perfvalues { - Index panel_size; // a panel consists of at most consecutive columns - Index relax; // To control degree of relaxing supernodes. If the number of nodes (columns) - // in a subtree of the elimination tree is less than relax, this subtree is considered - // as one supernode regardless of the row structures of those columns - Index maxsuper; // The maximum size for a supernode in complete LU - Index rowblk; // The minimum row dimension for 2-D blocking to be used; - Index colblk; // The minimum column dimension for 2-D blocking to be used; - Index fillfactor; // The estimated fills factors for L and U, compared with A -}; - -} // end namespace internal - -} // end namespace Eigen -#endif // EIGEN_LU_STRUCTS diff --git a/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h b/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h deleted file mode 100644 index 721e1883b..000000000 --- a/Eigen/src/SparseLU/SparseLU_SupernodalMatrix.h +++ /dev/null @@ -1,301 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// Copyright (C) 2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSELU_SUPERNODAL_MATRIX_H -#define EIGEN_SPARSELU_SUPERNODAL_MATRIX_H - -namespace Eigen { -namespace internal { - -/** \ingroup SparseLU_Module - * \brief a class to manipulate the L supernodal factor from the SparseLU factorization - * - * This class contain the data to easily store - * and manipulate the supernodes during the factorization and solution phase of Sparse LU. - * Only the lower triangular matrix has supernodes. - * - * NOTE : This class corresponds to the SCformat structure in SuperLU - * - */ -/* TODO - * InnerIterator as for sparsematrix - * SuperInnerIterator to iterate through all supernodes - * Function for triangular solve - */ -template -class MappedSuperNodalMatrix -{ - public: - typedef _Scalar Scalar; - typedef _StorageIndex StorageIndex; - typedef Matrix IndexVector; - typedef Matrix ScalarVector; - public: - MappedSuperNodalMatrix() - { - - } - MappedSuperNodalMatrix(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& rowind, - IndexVector& rowind_colptr, IndexVector& col_to_sup, IndexVector& sup_to_col ) - { - setInfos(m, n, nzval, nzval_colptr, rowind, rowind_colptr, col_to_sup, sup_to_col); - } - - ~MappedSuperNodalMatrix() - { - - } - /** - * Set appropriate pointers for the lower triangular supernodal matrix - * These infos are available at the end of the numerical factorization - * FIXME This class will be modified such that it can be use in the course - * of the factorization. - */ - void setInfos(Index m, Index n, ScalarVector& nzval, IndexVector& nzval_colptr, IndexVector& rowind, - IndexVector& rowind_colptr, IndexVector& col_to_sup, IndexVector& sup_to_col ) - { - m_row = m; - m_col = n; - m_nzval = nzval.data(); - m_nzval_colptr = nzval_colptr.data(); - m_rowind = rowind.data(); - m_rowind_colptr = rowind_colptr.data(); - m_nsuper = col_to_sup(n); - m_col_to_sup = col_to_sup.data(); - m_sup_to_col = sup_to_col.data(); - } - - /** - * Number of rows - */ - Index rows() { return m_row; } - - /** - * Number of columns - */ - Index cols() { return m_col; } - - /** - * Return the array of nonzero values packed by column - * - * The size is nnz - */ - Scalar* valuePtr() { return m_nzval; } - - const Scalar* valuePtr() const - { - return m_nzval; - } - /** - * Return the pointers to the beginning of each column in \ref valuePtr() - */ - StorageIndex* colIndexPtr() - { - return m_nzval_colptr; - } - - const StorageIndex* colIndexPtr() const - { - return m_nzval_colptr; - } - - /** - * Return the array of compressed row indices of all supernodes - */ - StorageIndex* rowIndex() { return m_rowind; } - - const StorageIndex* rowIndex() const - { - return m_rowind; - } - - /** - * Return the location in \em rowvaluePtr() which starts each column - */ - StorageIndex* rowIndexPtr() { return m_rowind_colptr; } - - const StorageIndex* rowIndexPtr() const - { - return m_rowind_colptr; - } - - /** - * Return the array of column-to-supernode mapping - */ - StorageIndex* colToSup() { return m_col_to_sup; } - - const StorageIndex* colToSup() const - { - return m_col_to_sup; - } - /** - * Return the array of supernode-to-column mapping - */ - StorageIndex* supToCol() { return m_sup_to_col; } - - const StorageIndex* supToCol() const - { - return m_sup_to_col; - } - - /** - * Return the number of supernodes - */ - Index nsuper() const - { - return m_nsuper; - } - - class InnerIterator; - template - void solveInPlace( MatrixBase&X) const; - - - - - protected: - Index m_row; // Number of rows - Index m_col; // Number of columns - Index m_nsuper; // Number of supernodes - Scalar* m_nzval; //array of nonzero values packed by column - StorageIndex* m_nzval_colptr; //nzval_colptr[j] Stores the location in nzval[] which starts column j - StorageIndex* m_rowind; // Array of compressed row indices of rectangular supernodes - StorageIndex* m_rowind_colptr; //rowind_colptr[j] stores the location in rowind[] which starts column j - StorageIndex* m_col_to_sup; // col_to_sup[j] is the supernode number to which column j belongs - StorageIndex* m_sup_to_col; //sup_to_col[s] points to the starting column of the s-th supernode - - private : -}; - -/** - * \brief InnerIterator class to iterate over nonzero values of the current column in the supernodal matrix L - * - */ -template -class MappedSuperNodalMatrix::InnerIterator -{ - public: - InnerIterator(const MappedSuperNodalMatrix& mat, Index outer) - : m_matrix(mat), - m_outer(outer), - m_supno(mat.colToSup()[outer]), - m_idval(mat.colIndexPtr()[outer]), - m_startidval(m_idval), - m_endidval(mat.colIndexPtr()[outer+1]), - m_idrow(mat.rowIndexPtr()[mat.supToCol()[mat.colToSup()[outer]]]), - m_endidrow(mat.rowIndexPtr()[mat.supToCol()[mat.colToSup()[outer]]+1]) - {} - inline InnerIterator& operator++() - { - m_idval++; - m_idrow++; - return *this; - } - inline Scalar value() const { return m_matrix.valuePtr()[m_idval]; } - - inline Scalar& valueRef() { return const_cast(m_matrix.valuePtr()[m_idval]); } - - inline Index index() const { return m_matrix.rowIndex()[m_idrow]; } - inline Index row() const { return index(); } - inline Index col() const { return m_outer; } - - inline Index supIndex() const { return m_supno; } - - inline operator bool() const - { - return ( (m_idval < m_endidval) && (m_idval >= m_startidval) - && (m_idrow < m_endidrow) ); - } - - protected: - const MappedSuperNodalMatrix& m_matrix; // Supernodal lower triangular matrix - const Index m_outer; // Current column - const Index m_supno; // Current SuperNode number - Index m_idval; // Index to browse the values in the current column - const Index m_startidval; // Start of the column value - const Index m_endidval; // End of the column value - Index m_idrow; // Index to browse the row indices - Index m_endidrow; // End index of row indices of the current column -}; - -/** - * \brief Solve with the supernode triangular matrix - * - */ -template -template -void MappedSuperNodalMatrix::solveInPlace( MatrixBase&X) const -{ - /* Explicit type conversion as the Index type of MatrixBase may be wider than Index */ -// eigen_assert(X.rows() <= NumTraits::highest()); -// eigen_assert(X.cols() <= NumTraits::highest()); - Index n = int(X.rows()); - Index nrhs = Index(X.cols()); - const Scalar * Lval = valuePtr(); // Nonzero values - Matrix work(n, nrhs); // working vector - work.setZero(); - for (Index k = 0; k <= nsuper(); k ++) - { - Index fsupc = supToCol()[k]; // First column of the current supernode - Index istart = rowIndexPtr()[fsupc]; // Pointer index to the subscript of the current column - Index nsupr = rowIndexPtr()[fsupc+1] - istart; // Number of rows in the current supernode - Index nsupc = supToCol()[k+1] - fsupc; // Number of columns in the current supernode - Index nrow = nsupr - nsupc; // Number of rows in the non-diagonal part of the supernode - Index irow; //Current index row - - if (nsupc == 1 ) - { - for (Index j = 0; j < nrhs; j++) - { - InnerIterator it(*this, fsupc); - ++it; // Skip the diagonal element - for (; it; ++it) - { - irow = it.row(); - X(irow, j) -= X(fsupc, j) * it.value(); - } - } - } - else - { - // The supernode has more than one column - Index luptr = colIndexPtr()[fsupc]; - Index lda = colIndexPtr()[fsupc+1] - luptr; - - // Triangular solve - Map, 0, OuterStride<> > A( &(Lval[luptr]), nsupc, nsupc, OuterStride<>(lda) ); - Map< Matrix, 0, OuterStride<> > U (&(X(fsupc,0)), nsupc, nrhs, OuterStride<>(n) ); - U = A.template triangularView().solve(U); - - // Matrix-vector product - new (&A) Map, 0, OuterStride<> > ( &(Lval[luptr+nsupc]), nrow, nsupc, OuterStride<>(lda) ); - work.topRows(nrow).noalias() = A * U; - - //Begin Scatter - for (Index j = 0; j < nrhs; j++) - { - Index iptr = istart + nsupc; - for (Index i = 0; i < nrow; i++) - { - irow = rowIndex()[iptr]; - X(irow, j) -= work(i, j); // Scatter operation - work(i, j) = Scalar(0); - iptr++; - } - } - } - } -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_SPARSELU_MATRIX_H diff --git a/Eigen/src/SparseLU/SparseLU_Utils.h b/Eigen/src/SparseLU/SparseLU_Utils.h deleted file mode 100644 index 9e3dab44d..000000000 --- a/Eigen/src/SparseLU/SparseLU_Utils.h +++ /dev/null @@ -1,80 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - - -#ifndef EIGEN_SPARSELU_UTILS_H -#define EIGEN_SPARSELU_UTILS_H - -namespace Eigen { -namespace internal { - -/** - * \brief Count Nonzero elements in the factors - */ -template -void SparseLUImpl::countnz(const Index n, Index& nnzL, Index& nnzU, GlobalLU_t& glu) -{ - nnzL = 0; - nnzU = (glu.xusub)(n); - Index nsuper = (glu.supno)(n); - Index jlen; - Index i, j, fsupc; - if (n <= 0 ) return; - // For each supernode - for (i = 0; i <= nsuper; i++) - { - fsupc = glu.xsup(i); - jlen = glu.xlsub(fsupc+1) - glu.xlsub(fsupc); - - for (j = fsupc; j < glu.xsup(i+1); j++) - { - nnzL += jlen; - nnzU += j - fsupc + 1; - jlen--; - } - } -} - -/** - * \brief Fix up the data storage lsub for L-subscripts. - * - * It removes the subscripts sets for structural pruning, - * and applies permutation to the remaining subscripts - * - */ -template -void SparseLUImpl::fixupL(const Index n, const IndexVector& perm_r, GlobalLU_t& glu) -{ - Index fsupc, i, j, k, jstart; - - StorageIndex nextl = 0; - Index nsuper = (glu.supno)(n); - - // For each supernode - for (i = 0; i <= nsuper; i++) - { - fsupc = glu.xsup(i); - jstart = glu.xlsub(fsupc); - glu.xlsub(fsupc) = nextl; - for (j = jstart; j < glu.xlsub(fsupc + 1); j++) - { - glu.lsub(nextl) = perm_r(glu.lsub(j)); // Now indexed into P*A - nextl++; - } - for (k = fsupc+1; k < glu.xsup(i+1); k++) - glu.xlsub(k) = nextl; // other columns in supernode i - } - - glu.xlsub(n) = nextl; -} - -} // end namespace internal - -} // end namespace Eigen -#endif // EIGEN_SPARSELU_UTILS_H diff --git a/Eigen/src/SparseLU/SparseLU_column_bmod.h b/Eigen/src/SparseLU/SparseLU_column_bmod.h deleted file mode 100644 index b57f06802..000000000 --- a/Eigen/src/SparseLU/SparseLU_column_bmod.h +++ /dev/null @@ -1,181 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// Copyright (C) 2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of xcolumn_bmod.c file in SuperLU - - * -- SuperLU routine (version 3.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * October 15, 2003 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_COLUMN_BMOD_H -#define SPARSELU_COLUMN_BMOD_H - -namespace Eigen { - -namespace internal { -/** - * \brief Performs numeric block updates (sup-col) in topological order - * - * \param jcol current column to update - * \param nseg Number of segments in the U part - * \param dense Store the full representation of the column - * \param tempv working array - * \param segrep segment representative ... - * \param repfnz ??? First nonzero column in each row ??? ... - * \param fpanelc First column in the current panel - * \param glu Global LU data. - * \return 0 - successful return - * > 0 - number of bytes allocated when run out of space - * - */ -template -Index SparseLUImpl::column_bmod(const Index jcol, const Index nseg, BlockScalarVector dense, ScalarVector& tempv, - BlockIndexVector segrep, BlockIndexVector repfnz, Index fpanelc, GlobalLU_t& glu) -{ - Index jsupno, k, ksub, krep, ksupno; - Index lptr, nrow, isub, irow, nextlu, new_next, ufirst; - Index fsupc, nsupc, nsupr, luptr, kfnz, no_zeros; - /* krep = representative of current k-th supernode - * fsupc = first supernodal column - * nsupc = number of columns in a supernode - * nsupr = number of rows in a supernode - * luptr = location of supernodal LU-block in storage - * kfnz = first nonz in the k-th supernodal segment - * no_zeros = no lf leading zeros in a supernodal U-segment - */ - - jsupno = glu.supno(jcol); - // For each nonzero supernode segment of U[*,j] in topological order - k = nseg - 1; - Index d_fsupc; // distance between the first column of the current panel and the - // first column of the current snode - Index fst_col; // First column within small LU update - Index segsize; - for (ksub = 0; ksub < nseg; ksub++) - { - krep = segrep(k); k--; - ksupno = glu.supno(krep); - if (jsupno != ksupno ) - { - // outside the rectangular supernode - fsupc = glu.xsup(ksupno); - fst_col = (std::max)(fsupc, fpanelc); - - // Distance from the current supernode to the current panel; - // d_fsupc = 0 if fsupc > fpanelc - d_fsupc = fst_col - fsupc; - - luptr = glu.xlusup(fst_col) + d_fsupc; - lptr = glu.xlsub(fsupc) + d_fsupc; - - kfnz = repfnz(krep); - kfnz = (std::max)(kfnz, fpanelc); - - segsize = krep - kfnz + 1; - nsupc = krep - fst_col + 1; - nsupr = glu.xlsub(fsupc+1) - glu.xlsub(fsupc); - nrow = nsupr - d_fsupc - nsupc; - Index lda = glu.xlusup(fst_col+1) - glu.xlusup(fst_col); - - - // Perform a triangular solver and block update, - // then scatter the result of sup-col update to dense - no_zeros = kfnz - fst_col; - if(segsize==1) - LU_kernel_bmod<1>::run(segsize, dense, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); - else - LU_kernel_bmod::run(segsize, dense, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); - } // end if jsupno - } // end for each segment - - // Process the supernodal portion of L\U[*,j] - nextlu = glu.xlusup(jcol); - fsupc = glu.xsup(jsupno); - - // copy the SPA dense into L\U[*,j] - Index mem; - new_next = nextlu + glu.xlsub(fsupc + 1) - glu.xlsub(fsupc); - Index offset = internal::first_multiple(new_next, internal::packet_traits::size) - new_next; - if(offset) - new_next += offset; - while (new_next > glu.nzlumax ) - { - mem = memXpand(glu.lusup, glu.nzlumax, nextlu, LUSUP, glu.num_expansions); - if (mem) return mem; - } - - for (isub = glu.xlsub(fsupc); isub < glu.xlsub(fsupc+1); isub++) - { - irow = glu.lsub(isub); - glu.lusup(nextlu) = dense(irow); - dense(irow) = Scalar(0.0); - ++nextlu; - } - - if(offset) - { - glu.lusup.segment(nextlu,offset).setZero(); - nextlu += offset; - } - glu.xlusup(jcol + 1) = StorageIndex(nextlu); // close L\U(*,jcol); - - /* For more updates within the panel (also within the current supernode), - * should start from the first column of the panel, or the first column - * of the supernode, whichever is bigger. There are two cases: - * 1) fsupc < fpanelc, then fst_col <-- fpanelc - * 2) fsupc >= fpanelc, then fst_col <-- fsupc - */ - fst_col = (std::max)(fsupc, fpanelc); - - if (fst_col < jcol) - { - // Distance between the current supernode and the current panel - // d_fsupc = 0 if fsupc >= fpanelc - d_fsupc = fst_col - fsupc; - - lptr = glu.xlsub(fsupc) + d_fsupc; - luptr = glu.xlusup(fst_col) + d_fsupc; - nsupr = glu.xlsub(fsupc+1) - glu.xlsub(fsupc); // leading dimension - nsupc = jcol - fst_col; // excluding jcol - nrow = nsupr - d_fsupc - nsupc; - - // points to the beginning of jcol in snode L\U(jsupno) - ufirst = glu.xlusup(jcol) + d_fsupc; - Index lda = glu.xlusup(jcol+1) - glu.xlusup(jcol); - MappedMatrixBlock A( &(glu.lusup.data()[luptr]), nsupc, nsupc, OuterStride<>(lda) ); - VectorBlock u(glu.lusup, ufirst, nsupc); - u = A.template triangularView().solve(u); - - new (&A) MappedMatrixBlock ( &(glu.lusup.data()[luptr+nsupc]), nrow, nsupc, OuterStride<>(lda) ); - VectorBlock l(glu.lusup, ufirst+nsupc, nrow); - l.noalias() -= A * u; - - } // End if fst_col - return 0; -} - -} // end namespace internal -} // end namespace Eigen - -#endif // SPARSELU_COLUMN_BMOD_H diff --git a/Eigen/src/SparseLU/SparseLU_column_dfs.h b/Eigen/src/SparseLU/SparseLU_column_dfs.h deleted file mode 100644 index c98b30e32..000000000 --- a/Eigen/src/SparseLU/SparseLU_column_dfs.h +++ /dev/null @@ -1,179 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of [s,d,c,z]column_dfs.c file in SuperLU - - * -- SuperLU routine (version 2.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * November 15, 1997 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_COLUMN_DFS_H -#define SPARSELU_COLUMN_DFS_H - -template class SparseLUImpl; -namespace Eigen { - -namespace internal { - -template -struct column_dfs_traits : no_assignment_operator -{ - typedef typename ScalarVector::Scalar Scalar; - typedef typename IndexVector::Scalar StorageIndex; - column_dfs_traits(Index jcol, Index& jsuper, typename SparseLUImpl::GlobalLU_t& glu, SparseLUImpl& luImpl) - : m_jcol(jcol), m_jsuper_ref(jsuper), m_glu(glu), m_luImpl(luImpl) - {} - bool update_segrep(Index /*krep*/, Index /*jj*/) - { - return true; - } - void mem_expand(IndexVector& lsub, Index& nextl, Index chmark) - { - if (nextl >= m_glu.nzlmax) - m_luImpl.memXpand(lsub, m_glu.nzlmax, nextl, LSUB, m_glu.num_expansions); - if (chmark != (m_jcol-1)) m_jsuper_ref = emptyIdxLU; - } - enum { ExpandMem = true }; - - Index m_jcol; - Index& m_jsuper_ref; - typename SparseLUImpl::GlobalLU_t& m_glu; - SparseLUImpl& m_luImpl; -}; - - -/** - * \brief Performs a symbolic factorization on column jcol and decide the supernode boundary - * - * A supernode representative is the last column of a supernode. - * The nonzeros in U[*,j] are segments that end at supernodes representatives. - * The routine returns a list of the supernodal representatives - * in topological order of the dfs that generates them. - * The location of the first nonzero in each supernodal segment - * (supernodal entry location) is also returned. - * - * \param m number of rows in the matrix - * \param jcol Current column - * \param perm_r Row permutation - * \param maxsuper Maximum number of column allowed in a supernode - * \param [in,out] nseg Number of segments in current U[*,j] - new segments appended - * \param lsub_col defines the rhs vector to start the dfs - * \param [in,out] segrep Segment representatives - new segments appended - * \param repfnz First nonzero location in each row - * \param xprune - * \param marker marker[i] == jj, if i was visited during dfs of current column jj; - * \param parent - * \param xplore working array - * \param glu global LU data - * \return 0 success - * > 0 number of bytes allocated when run out of space - * - */ -template -Index SparseLUImpl::column_dfs(const Index m, const Index jcol, IndexVector& perm_r, Index maxsuper, Index& nseg, - BlockIndexVector lsub_col, IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, - IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu) -{ - - Index jsuper = glu.supno(jcol); - Index nextl = glu.xlsub(jcol); - VectorBlock marker2(marker, 2*m, m); - - - column_dfs_traits traits(jcol, jsuper, glu, *this); - - // For each nonzero in A(*,jcol) do dfs - for (Index k = 0; ((k < m) ? lsub_col[k] != emptyIdxLU : false) ; k++) - { - Index krow = lsub_col(k); - lsub_col(k) = emptyIdxLU; - Index kmark = marker2(krow); - - // krow was visited before, go to the next nonz; - if (kmark == jcol) continue; - - dfs_kernel(StorageIndex(jcol), perm_r, nseg, glu.lsub, segrep, repfnz, xprune, marker2, parent, - xplore, glu, nextl, krow, traits); - } // for each nonzero ... - - Index fsupc; - StorageIndex nsuper = glu.supno(jcol); - StorageIndex jcolp1 = StorageIndex(jcol) + 1; - Index jcolm1 = jcol - 1; - - // check to see if j belongs in the same supernode as j-1 - if ( jcol == 0 ) - { // Do nothing for column 0 - nsuper = glu.supno(0) = 0 ; - } - else - { - fsupc = glu.xsup(nsuper); - StorageIndex jptr = glu.xlsub(jcol); // Not yet compressed - StorageIndex jm1ptr = glu.xlsub(jcolm1); - - // Use supernodes of type T2 : see SuperLU paper - if ( (nextl-jptr != jptr-jm1ptr-1) ) jsuper = emptyIdxLU; - - // Make sure the number of columns in a supernode doesn't - // exceed threshold - if ( (jcol - fsupc) >= maxsuper) jsuper = emptyIdxLU; - - /* If jcol starts a new supernode, reclaim storage space in - * glu.lsub from previous supernode. Note we only store - * the subscript set of the first and last columns of - * a supernode. (first for num values, last for pruning) - */ - if (jsuper == emptyIdxLU) - { // starts a new supernode - if ( (fsupc < jcolm1-1) ) - { // >= 3 columns in nsuper - StorageIndex ito = glu.xlsub(fsupc+1); - glu.xlsub(jcolm1) = ito; - StorageIndex istop = ito + jptr - jm1ptr; - xprune(jcolm1) = istop; // intialize xprune(jcol-1) - glu.xlsub(jcol) = istop; - - for (StorageIndex ifrom = jm1ptr; ifrom < nextl; ++ifrom, ++ito) - glu.lsub(ito) = glu.lsub(ifrom); - nextl = ito; // = istop + length(jcol) - } - nsuper++; - glu.supno(jcol) = nsuper; - } // if a new supernode - } // end else: jcol > 0 - - // Tidy up the pointers before exit - glu.xsup(nsuper+1) = jcolp1; - glu.supno(jcolp1) = nsuper; - xprune(jcol) = StorageIndex(nextl); // Intialize upper bound for pruning - glu.xlsub(jcolp1) = StorageIndex(nextl); - - return 0; -} - -} // end namespace internal - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h b/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h deleted file mode 100644 index c32d8d8b1..000000000 --- a/Eigen/src/SparseLU/SparseLU_copy_to_ucol.h +++ /dev/null @@ -1,107 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. -/* - - * NOTE: This file is the modified version of [s,d,c,z]copy_to_ucol.c file in SuperLU - - * -- SuperLU routine (version 2.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * November 15, 1997 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_COPY_TO_UCOL_H -#define SPARSELU_COPY_TO_UCOL_H - -namespace Eigen { -namespace internal { - -/** - * \brief Performs numeric block updates (sup-col) in topological order - * - * \param jcol current column to update - * \param nseg Number of segments in the U part - * \param segrep segment representative ... - * \param repfnz First nonzero column in each row ... - * \param perm_r Row permutation - * \param dense Store the full representation of the column - * \param glu Global LU data. - * \return 0 - successful return - * > 0 - number of bytes allocated when run out of space - * - */ -template -Index SparseLUImpl::copy_to_ucol(const Index jcol, const Index nseg, IndexVector& segrep, - BlockIndexVector repfnz ,IndexVector& perm_r, BlockScalarVector dense, GlobalLU_t& glu) -{ - Index ksub, krep, ksupno; - - Index jsupno = glu.supno(jcol); - - // For each nonzero supernode segment of U[*,j] in topological order - Index k = nseg - 1, i; - StorageIndex nextu = glu.xusub(jcol); - Index kfnz, isub, segsize; - Index new_next,irow; - Index fsupc, mem; - for (ksub = 0; ksub < nseg; ksub++) - { - krep = segrep(k); k--; - ksupno = glu.supno(krep); - if (jsupno != ksupno ) // should go into ucol(); - { - kfnz = repfnz(krep); - if (kfnz != emptyIdxLU) - { // Nonzero U-segment - fsupc = glu.xsup(ksupno); - isub = glu.xlsub(fsupc) + kfnz - fsupc; - segsize = krep - kfnz + 1; - new_next = nextu + segsize; - while (new_next > glu.nzumax) - { - mem = memXpand(glu.ucol, glu.nzumax, nextu, UCOL, glu.num_expansions); - if (mem) return mem; - mem = memXpand(glu.usub, glu.nzumax, nextu, USUB, glu.num_expansions); - if (mem) return mem; - - } - - for (i = 0; i < segsize; i++) - { - irow = glu.lsub(isub); - glu.usub(nextu) = perm_r(irow); // Unlike the L part, the U part is stored in its final order - glu.ucol(nextu) = dense(irow); - dense(irow) = Scalar(0.0); - nextu++; - isub++; - } - - } // end nonzero U-segment - - } // end if jsupno - - } // end for each segment - glu.xusub(jcol + 1) = nextu; // close U(*,jcol) - return 0; -} - -} // namespace internal -} // end namespace Eigen - -#endif // SPARSELU_COPY_TO_UCOL_H diff --git a/Eigen/src/SparseLU/SparseLU_gemm_kernel.h b/Eigen/src/SparseLU/SparseLU_gemm_kernel.h deleted file mode 100644 index 95ba7413f..000000000 --- a/Eigen/src/SparseLU/SparseLU_gemm_kernel.h +++ /dev/null @@ -1,280 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSELU_GEMM_KERNEL_H -#define EIGEN_SPARSELU_GEMM_KERNEL_H - -namespace Eigen { - -namespace internal { - - -/** \internal - * A general matrix-matrix product kernel optimized for the SparseLU factorization. - * - A, B, and C must be column major - * - lda and ldc must be multiples of the respective packet size - * - C must have the same alignment as A - */ -template -EIGEN_DONT_INLINE -void sparselu_gemm(Index m, Index n, Index d, const Scalar* A, Index lda, const Scalar* B, Index ldb, Scalar* C, Index ldc) -{ - using namespace Eigen::internal; - - typedef typename packet_traits::type Packet; - enum { - NumberOfRegisters = EIGEN_ARCH_DEFAULT_NUMBER_OF_REGISTERS, - PacketSize = packet_traits::size, - PM = 8, // peeling in M - RN = 2, // register blocking - RK = NumberOfRegisters>=16 ? 4 : 2, // register blocking - BM = 4096/sizeof(Scalar), // number of rows of A-C per chunk - SM = PM*PacketSize // step along M - }; - Index d_end = (d/RK)*RK; // number of columns of A (rows of B) suitable for full register blocking - Index n_end = (n/RN)*RN; // number of columns of B-C suitable for processing RN columns at once - Index i0 = internal::first_default_aligned(A,m); - - eigen_internal_assert(((lda%PacketSize)==0) && ((ldc%PacketSize)==0) && (i0==internal::first_default_aligned(C,m))); - - // handle the non aligned rows of A and C without any optimization: - for(Index i=0; i(BM, m-ib); // actual number of rows - Index actual_b_end1 = (actual_b/SM)*SM; // actual number of rows suitable for peeling - Index actual_b_end2 = (actual_b/PacketSize)*PacketSize; // actual number of rows suitable for vectorization - - // Let's process two columns of B-C at once - for(Index j=0; j(Bc0[0]); } - { b10 = pset1(Bc0[1]); } - if(RK==4) { b20 = pset1(Bc0[2]); } - if(RK==4) { b30 = pset1(Bc0[3]); } - { b01 = pset1(Bc1[0]); } - { b11 = pset1(Bc1[1]); } - if(RK==4) { b21 = pset1(Bc1[2]); } - if(RK==4) { b31 = pset1(Bc1[3]); } - - Packet a0, a1, a2, a3, c0, c1, t0, t1; - - const Scalar* A0 = A+ib+(k+0)*lda; - const Scalar* A1 = A+ib+(k+1)*lda; - const Scalar* A2 = A+ib+(k+2)*lda; - const Scalar* A3 = A+ib+(k+3)*lda; - - Scalar* C0 = C+ib+(j+0)*ldc; - Scalar* C1 = C+ib+(j+1)*ldc; - - a0 = pload(A0); - a1 = pload(A1); - if(RK==4) - { - a2 = pload(A2); - a3 = pload(A3); - } - else - { - // workaround "may be used uninitialized in this function" warning - a2 = a3 = a0; - } - -#define KMADD(c, a, b, tmp) {tmp = b; tmp = pmul(a,tmp); c = padd(c,tmp);} -#define WORK(I) \ - c0 = pload(C0+i+(I)*PacketSize); \ - c1 = pload(C1+i+(I)*PacketSize); \ - KMADD(c0, a0, b00, t0) \ - KMADD(c1, a0, b01, t1) \ - a0 = pload(A0+i+(I+1)*PacketSize); \ - KMADD(c0, a1, b10, t0) \ - KMADD(c1, a1, b11, t1) \ - a1 = pload(A1+i+(I+1)*PacketSize); \ - if(RK==4){ KMADD(c0, a2, b20, t0) }\ - if(RK==4){ KMADD(c1, a2, b21, t1) }\ - if(RK==4){ a2 = pload(A2+i+(I+1)*PacketSize); }\ - if(RK==4){ KMADD(c0, a3, b30, t0) }\ - if(RK==4){ KMADD(c1, a3, b31, t1) }\ - if(RK==4){ a3 = pload(A3+i+(I+1)*PacketSize); }\ - pstore(C0+i+(I)*PacketSize, c0); \ - pstore(C1+i+(I)*PacketSize, c1) - - // process rows of A' - C' with aggressive vectorization and peeling - for(Index i=0; i0) - { - const Scalar* Bc0 = B+(n-1)*ldb; - - for(Index k=0; k(Bc0[0]); - b10 = pset1(Bc0[1]); - if(RK==4) b20 = pset1(Bc0[2]); - if(RK==4) b30 = pset1(Bc0[3]); - - Packet a0, a1, a2, a3, c0, t0/*, t1*/; - - const Scalar* A0 = A+ib+(k+0)*lda; - const Scalar* A1 = A+ib+(k+1)*lda; - const Scalar* A2 = A+ib+(k+2)*lda; - const Scalar* A3 = A+ib+(k+3)*lda; - - Scalar* C0 = C+ib+(n_end)*ldc; - - a0 = pload(A0); - a1 = pload(A1); - if(RK==4) - { - a2 = pload(A2); - a3 = pload(A3); - } - else - { - // workaround "may be used uninitialized in this function" warning - a2 = a3 = a0; - } - -#define WORK(I) \ - c0 = pload(C0+i+(I)*PacketSize); \ - KMADD(c0, a0, b00, t0) \ - a0 = pload(A0+i+(I+1)*PacketSize); \ - KMADD(c0, a1, b10, t0) \ - a1 = pload(A1+i+(I+1)*PacketSize); \ - if(RK==4){ KMADD(c0, a2, b20, t0) }\ - if(RK==4){ a2 = pload(A2+i+(I+1)*PacketSize); }\ - if(RK==4){ KMADD(c0, a3, b30, t0) }\ - if(RK==4){ a3 = pload(A3+i+(I+1)*PacketSize); }\ - pstore(C0+i+(I)*PacketSize, c0); - - // agressive vectorization and peeling - for(Index i=0; i0) - { - for(Index j=0; j1 ? Aligned : 0 - }; - typedef Map, Alignment > MapVector; - typedef Map, Alignment > ConstMapVector; - if(rd==1) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b); - - else if(rd==2) MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b) - + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b); - - else MapVector(C+j*ldc+ib,actual_b) += B[0+d_end+j*ldb] * ConstMapVector(A+(d_end+0)*lda+ib, actual_b) - + B[1+d_end+j*ldb] * ConstMapVector(A+(d_end+1)*lda+ib, actual_b) - + B[2+d_end+j*ldb] * ConstMapVector(A+(d_end+2)*lda+ib, actual_b); - } - } - - } // blocking on the rows of A and C -} -#undef KMADD - -} // namespace internal - -} // namespace Eigen - -#endif // EIGEN_SPARSELU_GEMM_KERNEL_H diff --git a/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h b/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h deleted file mode 100644 index 6f75d500e..000000000 --- a/Eigen/src/SparseLU/SparseLU_heap_relax_snode.h +++ /dev/null @@ -1,126 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* This file is a modified version of heap_relax_snode.c file in SuperLU - * -- SuperLU routine (version 3.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * October 15, 2003 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ - -#ifndef SPARSELU_HEAP_RELAX_SNODE_H -#define SPARSELU_HEAP_RELAX_SNODE_H - -namespace Eigen { -namespace internal { - -/** - * \brief Identify the initial relaxed supernodes - * - * This routine applied to a symmetric elimination tree. - * It assumes that the matrix has been reordered according to the postorder of the etree - * \param n The number of columns - * \param et elimination tree - * \param relax_columns Maximum number of columns allowed in a relaxed snode - * \param descendants Number of descendants of each node in the etree - * \param relax_end last column in a supernode - */ -template -void SparseLUImpl::heap_relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end) -{ - - // The etree may not be postordered, but its heap ordered - IndexVector post; - internal::treePostorder(StorageIndex(n), et, post); // Post order etree - IndexVector inv_post(n+1); - for (StorageIndex i = 0; i < n+1; ++i) inv_post(post(i)) = i; // inv_post = post.inverse()??? - - // Renumber etree in postorder - IndexVector iwork(n); - IndexVector et_save(n+1); - for (Index i = 0; i < n; ++i) - { - iwork(post(i)) = post(et(i)); - } - et_save = et; // Save the original etree - et = iwork; - - // compute the number of descendants of each node in the etree - relax_end.setConstant(emptyIdxLU); - Index j, parent; - descendants.setZero(); - for (j = 0; j < n; j++) - { - parent = et(j); - if (parent != n) // not the dummy root - descendants(parent) += descendants(j) + 1; - } - // Identify the relaxed supernodes by postorder traversal of the etree - Index snode_start; // beginning of a snode - StorageIndex k; - Index nsuper_et_post = 0; // Number of relaxed snodes in postordered etree - Index nsuper_et = 0; // Number of relaxed snodes in the original etree - StorageIndex l; - for (j = 0; j < n; ) - { - parent = et(j); - snode_start = j; - while ( parent != n && descendants(parent) < relax_columns ) - { - j = parent; - parent = et(j); - } - // Found a supernode in postordered etree, j is the last column - ++nsuper_et_post; - k = StorageIndex(n); - for (Index i = snode_start; i <= j; ++i) - k = (std::min)(k, inv_post(i)); - l = inv_post(j); - if ( (l - k) == (j - snode_start) ) // Same number of columns in the snode - { - // This is also a supernode in the original etree - relax_end(k) = l; // Record last column - ++nsuper_et; - } - else - { - for (Index i = snode_start; i <= j; ++i) - { - l = inv_post(i); - if (descendants(i) == 0) - { - relax_end(l) = l; - ++nsuper_et; - } - } - } - j++; - // Search for a new leaf - while (descendants(j) != 0 && j < n) j++; - } // End postorder traversal of the etree - - // Recover the original etree - et = et_save; -} - -} // end namespace internal - -} // end namespace Eigen -#endif // SPARSELU_HEAP_RELAX_SNODE_H diff --git a/Eigen/src/SparseLU/SparseLU_kernel_bmod.h b/Eigen/src/SparseLU/SparseLU_kernel_bmod.h deleted file mode 100644 index 8c1b3e8bc..000000000 --- a/Eigen/src/SparseLU/SparseLU_kernel_bmod.h +++ /dev/null @@ -1,130 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// Copyright (C) 2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef SPARSELU_KERNEL_BMOD_H -#define SPARSELU_KERNEL_BMOD_H - -namespace Eigen { -namespace internal { - -template struct LU_kernel_bmod -{ - /** \internal - * \brief Performs numeric block updates from a given supernode to a single column - * - * \param segsize Size of the segment (and blocks ) to use for updates - * \param[in,out] dense Packed values of the original matrix - * \param tempv temporary vector to use for updates - * \param lusup array containing the supernodes - * \param lda Leading dimension in the supernode - * \param nrow Number of rows in the rectangular part of the supernode - * \param lsub compressed row subscripts of supernodes - * \param lptr pointer to the first column of the current supernode in lsub - * \param no_zeros Number of nonzeros elements before the diagonal part of the supernode - */ - template - static EIGEN_DONT_INLINE void run(const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda, - const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros); -}; - -template -template -EIGEN_DONT_INLINE void LU_kernel_bmod::run(const Index segsize, BlockScalarVector& dense, ScalarVector& tempv, ScalarVector& lusup, Index& luptr, const Index lda, - const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) -{ - typedef typename ScalarVector::Scalar Scalar; - // First, copy U[*,j] segment from dense(*) to tempv(*) - // The result of triangular solve is in tempv[*]; - // The result of matric-vector update is in dense[*] - Index isub = lptr + no_zeros; - Index i; - Index irow; - for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++) - { - irow = lsub(isub); - tempv(i) = dense(irow); - ++isub; - } - // Dense triangular solve -- start effective triangle - luptr += lda * no_zeros + no_zeros; - // Form Eigen matrix and vector - Map, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) ); - Map > u(tempv.data(), segsize); - - u = A.template triangularView().solve(u); - - // Dense matrix-vector product y <-- B*x - luptr += segsize; - const Index PacketSize = internal::packet_traits::size; - Index ldl = internal::first_multiple(nrow, PacketSize); - Map, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) ); - Index aligned_offset = internal::first_default_aligned(tempv.data()+segsize, PacketSize); - Index aligned_with_B_offset = (PacketSize-internal::first_default_aligned(B.data(), PacketSize))%PacketSize; - Map, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) ); - - l.setZero(); - internal::sparselu_gemm(l.rows(), l.cols(), B.cols(), B.data(), B.outerStride(), u.data(), u.outerStride(), l.data(), l.outerStride()); - - // Scatter tempv[] into SPA dense[] as a temporary storage - isub = lptr + no_zeros; - for (i = 0; i < ((SegSizeAtCompileTime==Dynamic)?segsize:SegSizeAtCompileTime); i++) - { - irow = lsub(isub++); - dense(irow) = tempv(i); - } - - // Scatter l into SPA dense[] - for (i = 0; i < nrow; i++) - { - irow = lsub(isub++); - dense(irow) -= l(i); - } -} - -template <> struct LU_kernel_bmod<1> -{ - template - static EIGEN_DONT_INLINE void run(const Index /*segsize*/, BlockScalarVector& dense, ScalarVector& /*tempv*/, ScalarVector& lusup, Index& luptr, - const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros); -}; - - -template -EIGEN_DONT_INLINE void LU_kernel_bmod<1>::run(const Index /*segsize*/, BlockScalarVector& dense, ScalarVector& /*tempv*/, ScalarVector& lusup, Index& luptr, - const Index lda, const Index nrow, IndexVector& lsub, const Index lptr, const Index no_zeros) -{ - typedef typename ScalarVector::Scalar Scalar; - typedef typename IndexVector::Scalar StorageIndex; - Scalar f = dense(lsub(lptr + no_zeros)); - luptr += lda * no_zeros + no_zeros + 1; - const Scalar* a(lusup.data() + luptr); - const StorageIndex* irow(lsub.data()+lptr + no_zeros + 1); - Index i = 0; - for (; i+1 < nrow; i+=2) - { - Index i0 = *(irow++); - Index i1 = *(irow++); - Scalar a0 = *(a++); - Scalar a1 = *(a++); - Scalar d0 = dense.coeff(i0); - Scalar d1 = dense.coeff(i1); - d0 -= f*a0; - d1 -= f*a1; - dense.coeffRef(i0) = d0; - dense.coeffRef(i1) = d1; - } - if(i -// Copyright (C) 2012 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of [s,d,c,z]panel_bmod.c file in SuperLU - - * -- SuperLU routine (version 3.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * October 15, 2003 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_PANEL_BMOD_H -#define SPARSELU_PANEL_BMOD_H - -namespace Eigen { -namespace internal { - -/** - * \brief Performs numeric block updates (sup-panel) in topological order. - * - * Before entering this routine, the original nonzeros in the panel - * were already copied i nto the spa[m,w] - * - * \param m number of rows in the matrix - * \param w Panel size - * \param jcol Starting column of the panel - * \param nseg Number of segments in the U part - * \param dense Store the full representation of the panel - * \param tempv working array - * \param segrep segment representative... first row in the segment - * \param repfnz First nonzero rows - * \param glu Global LU data. - * - * - */ -template -void SparseLUImpl::panel_bmod(const Index m, const Index w, const Index jcol, - const Index nseg, ScalarVector& dense, ScalarVector& tempv, - IndexVector& segrep, IndexVector& repfnz, GlobalLU_t& glu) -{ - - Index ksub,jj,nextl_col; - Index fsupc, nsupc, nsupr, nrow; - Index krep, kfnz; - Index lptr; // points to the row subscripts of a supernode - Index luptr; // ... - Index segsize,no_zeros ; - // For each nonz supernode segment of U[*,j] in topological order - Index k = nseg - 1; - const Index PacketSize = internal::packet_traits::size; - - for (ksub = 0; ksub < nseg; ksub++) - { // For each updating supernode - /* krep = representative of current k-th supernode - * fsupc = first supernodal column - * nsupc = number of columns in a supernode - * nsupr = number of rows in a supernode - */ - krep = segrep(k); k--; - fsupc = glu.xsup(glu.supno(krep)); - nsupc = krep - fsupc + 1; - nsupr = glu.xlsub(fsupc+1) - glu.xlsub(fsupc); - nrow = nsupr - nsupc; - lptr = glu.xlsub(fsupc); - - // loop over the panel columns to detect the actual number of columns and rows - Index u_rows = 0; - Index u_cols = 0; - for (jj = jcol; jj < jcol + w; jj++) - { - nextl_col = (jj-jcol) * m; - VectorBlock repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row - - kfnz = repfnz_col(krep); - if ( kfnz == emptyIdxLU ) - continue; // skip any zero segment - - segsize = krep - kfnz + 1; - u_cols++; - u_rows = (std::max)(segsize,u_rows); - } - - if(nsupc >= 2) - { - Index ldu = internal::first_multiple(u_rows, PacketSize); - Map > U(tempv.data(), u_rows, u_cols, OuterStride<>(ldu)); - - // gather U - Index u_col = 0; - for (jj = jcol; jj < jcol + w; jj++) - { - nextl_col = (jj-jcol) * m; - VectorBlock repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row - VectorBlock dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here - - kfnz = repfnz_col(krep); - if ( kfnz == emptyIdxLU ) - continue; // skip any zero segment - - segsize = krep - kfnz + 1; - luptr = glu.xlusup(fsupc); - no_zeros = kfnz - fsupc; - - Index isub = lptr + no_zeros; - Index off = u_rows-segsize; - for (Index i = 0; i < off; i++) U(i,u_col) = 0; - for (Index i = 0; i < segsize; i++) - { - Index irow = glu.lsub(isub); - U(i+off,u_col) = dense_col(irow); - ++isub; - } - u_col++; - } - // solve U = A^-1 U - luptr = glu.xlusup(fsupc); - Index lda = glu.xlusup(fsupc+1) - glu.xlusup(fsupc); - no_zeros = (krep - u_rows + 1) - fsupc; - luptr += lda * no_zeros + no_zeros; - MappedMatrixBlock A(glu.lusup.data()+luptr, u_rows, u_rows, OuterStride<>(lda) ); - U = A.template triangularView().solve(U); - - // update - luptr += u_rows; - MappedMatrixBlock B(glu.lusup.data()+luptr, nrow, u_rows, OuterStride<>(lda) ); - eigen_assert(tempv.size()>w*ldu + nrow*w + 1); - - Index ldl = internal::first_multiple(nrow, PacketSize); - Index offset = (PacketSize-internal::first_default_aligned(B.data(), PacketSize)) % PacketSize; - MappedMatrixBlock L(tempv.data()+w*ldu+offset, nrow, u_cols, OuterStride<>(ldl)); - - L.setZero(); - internal::sparselu_gemm(L.rows(), L.cols(), B.cols(), B.data(), B.outerStride(), U.data(), U.outerStride(), L.data(), L.outerStride()); - - // scatter U and L - u_col = 0; - for (jj = jcol; jj < jcol + w; jj++) - { - nextl_col = (jj-jcol) * m; - VectorBlock repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row - VectorBlock dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here - - kfnz = repfnz_col(krep); - if ( kfnz == emptyIdxLU ) - continue; // skip any zero segment - - segsize = krep - kfnz + 1; - no_zeros = kfnz - fsupc; - Index isub = lptr + no_zeros; - - Index off = u_rows-segsize; - for (Index i = 0; i < segsize; i++) - { - Index irow = glu.lsub(isub++); - dense_col(irow) = U.coeff(i+off,u_col); - U.coeffRef(i+off,u_col) = 0; - } - - // Scatter l into SPA dense[] - for (Index i = 0; i < nrow; i++) - { - Index irow = glu.lsub(isub++); - dense_col(irow) -= L.coeff(i,u_col); - L.coeffRef(i,u_col) = 0; - } - u_col++; - } - } - else // level 2 only - { - // Sequence through each column in the panel - for (jj = jcol; jj < jcol + w; jj++) - { - nextl_col = (jj-jcol) * m; - VectorBlock repfnz_col(repfnz, nextl_col, m); // First nonzero column index for each row - VectorBlock dense_col(dense, nextl_col, m); // Scatter/gather entire matrix column from/to here - - kfnz = repfnz_col(krep); - if ( kfnz == emptyIdxLU ) - continue; // skip any zero segment - - segsize = krep - kfnz + 1; - luptr = glu.xlusup(fsupc); - - Index lda = glu.xlusup(fsupc+1)-glu.xlusup(fsupc);// nsupr - - // Perform a trianglar solve and block update, - // then scatter the result of sup-col update to dense[] - no_zeros = kfnz - fsupc; - if(segsize==1) LU_kernel_bmod<1>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); - else if(segsize==2) LU_kernel_bmod<2>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); - else if(segsize==3) LU_kernel_bmod<3>::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); - else LU_kernel_bmod::run(segsize, dense_col, tempv, glu.lusup, luptr, lda, nrow, glu.lsub, lptr, no_zeros); - } // End for each column in the panel - } - - } // End for each updating supernode -} // end panel bmod - -} // end namespace internal - -} // end namespace Eigen - -#endif // SPARSELU_PANEL_BMOD_H diff --git a/Eigen/src/SparseLU/SparseLU_panel_dfs.h b/Eigen/src/SparseLU/SparseLU_panel_dfs.h deleted file mode 100644 index 155df7336..000000000 --- a/Eigen/src/SparseLU/SparseLU_panel_dfs.h +++ /dev/null @@ -1,258 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of [s,d,c,z]panel_dfs.c file in SuperLU - - * -- SuperLU routine (version 2.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * November 15, 1997 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_PANEL_DFS_H -#define SPARSELU_PANEL_DFS_H - -namespace Eigen { - -namespace internal { - -template -struct panel_dfs_traits -{ - typedef typename IndexVector::Scalar StorageIndex; - panel_dfs_traits(Index jcol, StorageIndex* marker) - : m_jcol(jcol), m_marker(marker) - {} - bool update_segrep(Index krep, StorageIndex jj) - { - if(m_marker[krep] -template -void SparseLUImpl::dfs_kernel(const StorageIndex jj, IndexVector& perm_r, - Index& nseg, IndexVector& panel_lsub, IndexVector& segrep, - Ref repfnz_col, IndexVector& xprune, Ref marker, IndexVector& parent, - IndexVector& xplore, GlobalLU_t& glu, - Index& nextl_col, Index krow, Traits& traits - ) -{ - - StorageIndex kmark = marker(krow); - - // For each unmarked krow of jj - marker(krow) = jj; - StorageIndex kperm = perm_r(krow); - if (kperm == emptyIdxLU ) { - // krow is in L : place it in structure of L(*, jj) - panel_lsub(nextl_col++) = StorageIndex(krow); // krow is indexed into A - - traits.mem_expand(panel_lsub, nextl_col, kmark); - } - else - { - // krow is in U : if its supernode-representative krep - // has been explored, update repfnz(*) - // krep = supernode representative of the current row - StorageIndex krep = glu.xsup(glu.supno(kperm)+1) - 1; - // First nonzero element in the current column: - StorageIndex myfnz = repfnz_col(krep); - - if (myfnz != emptyIdxLU ) - { - // Representative visited before - if (myfnz > kperm ) repfnz_col(krep) = kperm; - - } - else - { - // Otherwise, perform dfs starting at krep - StorageIndex oldrep = emptyIdxLU; - parent(krep) = oldrep; - repfnz_col(krep) = kperm; - StorageIndex xdfs = glu.xlsub(krep); - Index maxdfs = xprune(krep); - - StorageIndex kpar; - do - { - // For each unmarked kchild of krep - while (xdfs < maxdfs) - { - StorageIndex kchild = glu.lsub(xdfs); - xdfs++; - StorageIndex chmark = marker(kchild); - - if (chmark != jj ) - { - marker(kchild) = jj; - StorageIndex chperm = perm_r(kchild); - - if (chperm == emptyIdxLU) - { - // case kchild is in L: place it in L(*, j) - panel_lsub(nextl_col++) = kchild; - traits.mem_expand(panel_lsub, nextl_col, chmark); - } - else - { - // case kchild is in U : - // chrep = its supernode-rep. If its rep has been explored, - // update its repfnz(*) - StorageIndex chrep = glu.xsup(glu.supno(chperm)+1) - 1; - myfnz = repfnz_col(chrep); - - if (myfnz != emptyIdxLU) - { // Visited before - if (myfnz > chperm) - repfnz_col(chrep) = chperm; - } - else - { // Cont. dfs at snode-rep of kchild - xplore(krep) = xdfs; - oldrep = krep; - krep = chrep; // Go deeper down G(L) - parent(krep) = oldrep; - repfnz_col(krep) = chperm; - xdfs = glu.xlsub(krep); - maxdfs = xprune(krep); - - } // end if myfnz != -1 - } // end if chperm == -1 - - } // end if chmark !=jj - } // end while xdfs < maxdfs - - // krow has no more unexplored nbrs : - // Place snode-rep krep in postorder DFS, if this - // segment is seen for the first time. (Note that - // "repfnz(krep)" may change later.) - // Baktrack dfs to its parent - if(traits.update_segrep(krep,jj)) - //if (marker1(krep) < jcol ) - { - segrep(nseg) = krep; - ++nseg; - //marker1(krep) = jj; - } - - kpar = parent(krep); // Pop recursion, mimic recursion - if (kpar == emptyIdxLU) - break; // dfs done - krep = kpar; - xdfs = xplore(krep); - maxdfs = xprune(krep); - - } while (kpar != emptyIdxLU); // Do until empty stack - - } // end if (myfnz = -1) - - } // end if (kperm == -1) -} - -/** - * \brief Performs a symbolic factorization on a panel of columns [jcol, jcol+w) - * - * A supernode representative is the last column of a supernode. - * The nonzeros in U[*,j] are segments that end at supernodes representatives - * - * The routine returns a list of the supernodal representatives - * in topological order of the dfs that generates them. This list is - * a superset of the topological order of each individual column within - * the panel. - * The location of the first nonzero in each supernodal segment - * (supernodal entry location) is also returned. Each column has - * a separate list for this purpose. - * - * Two markers arrays are used for dfs : - * marker[i] == jj, if i was visited during dfs of current column jj; - * marker1[i] >= jcol, if i was visited by earlier columns in this panel; - * - * \param[in] m number of rows in the matrix - * \param[in] w Panel size - * \param[in] jcol Starting column of the panel - * \param[in] A Input matrix in column-major storage - * \param[in] perm_r Row permutation - * \param[out] nseg Number of U segments - * \param[out] dense Accumulate the column vectors of the panel - * \param[out] panel_lsub Subscripts of the row in the panel - * \param[out] segrep Segment representative i.e first nonzero row of each segment - * \param[out] repfnz First nonzero location in each row - * \param[out] xprune The pruned elimination tree - * \param[out] marker work vector - * \param parent The elimination tree - * \param xplore work vector - * \param glu The global data structure - * - */ - -template -void SparseLUImpl::panel_dfs(const Index m, const Index w, const Index jcol, MatrixType& A, IndexVector& perm_r, Index& nseg, ScalarVector& dense, IndexVector& panel_lsub, IndexVector& segrep, IndexVector& repfnz, IndexVector& xprune, IndexVector& marker, IndexVector& parent, IndexVector& xplore, GlobalLU_t& glu) -{ - Index nextl_col; // Next available position in panel_lsub[*,jj] - - // Initialize pointers - VectorBlock marker1(marker, m, m); - nseg = 0; - - panel_dfs_traits traits(jcol, marker1.data()); - - // For each column in the panel - for (StorageIndex jj = StorageIndex(jcol); jj < jcol + w; jj++) - { - nextl_col = (jj - jcol) * m; - - VectorBlock repfnz_col(repfnz, nextl_col, m); // First nonzero location in each row - VectorBlock dense_col(dense,nextl_col, m); // Accumulate a column vector here - - - // For each nnz in A[*, jj] do depth first search - for (typename MatrixType::InnerIterator it(A, jj); it; ++it) - { - Index krow = it.row(); - dense_col(krow) = it.value(); - - StorageIndex kmark = marker(krow); - if (kmark == jj) - continue; // krow visited before, go to the next nonzero - - dfs_kernel(jj, perm_r, nseg, panel_lsub, segrep, repfnz_col, xprune, marker, parent, - xplore, glu, nextl_col, krow, traits); - }// end for nonzeros in column jj - - } // end for column jj -} - -} // end namespace internal -} // end namespace Eigen - -#endif // SPARSELU_PANEL_DFS_H diff --git a/Eigen/src/SparseLU/SparseLU_pivotL.h b/Eigen/src/SparseLU/SparseLU_pivotL.h deleted file mode 100644 index a86dac93f..000000000 --- a/Eigen/src/SparseLU/SparseLU_pivotL.h +++ /dev/null @@ -1,137 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of xpivotL.c file in SuperLU - - * -- SuperLU routine (version 3.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * October 15, 2003 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_PIVOTL_H -#define SPARSELU_PIVOTL_H - -namespace Eigen { -namespace internal { - -/** - * \brief Performs the numerical pivotin on the current column of L, and the CDIV operation. - * - * Pivot policy : - * (1) Compute thresh = u * max_(i>=j) abs(A_ij); - * (2) IF user specifies pivot row k and abs(A_kj) >= thresh THEN - * pivot row = k; - * ELSE IF abs(A_jj) >= thresh THEN - * pivot row = j; - * ELSE - * pivot row = m; - * - * Note: If you absolutely want to use a given pivot order, then set u=0.0. - * - * \param jcol The current column of L - * \param diagpivotthresh diagonal pivoting threshold - * \param[in,out] perm_r Row permutation (threshold pivoting) - * \param[in] iperm_c column permutation - used to finf diagonal of Pc*A*Pc' - * \param[out] pivrow The pivot row - * \param glu Global LU data - * \return 0 if success, i > 0 if U(i,i) is exactly zero - * - */ -template -Index SparseLUImpl::pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iperm_c, Index& pivrow, GlobalLU_t& glu) -{ - - Index fsupc = (glu.xsup)((glu.supno)(jcol)); // First column in the supernode containing the column jcol - Index nsupc = jcol - fsupc; // Number of columns in the supernode portion, excluding jcol; nsupc >=0 - Index lptr = glu.xlsub(fsupc); // pointer to the starting location of the row subscripts for this supernode portion - Index nsupr = glu.xlsub(fsupc+1) - lptr; // Number of rows in the supernode - Index lda = glu.xlusup(fsupc+1) - glu.xlusup(fsupc); // leading dimension - Scalar* lu_sup_ptr = &(glu.lusup.data()[glu.xlusup(fsupc)]); // Start of the current supernode - Scalar* lu_col_ptr = &(glu.lusup.data()[glu.xlusup(jcol)]); // Start of jcol in the supernode - StorageIndex* lsub_ptr = &(glu.lsub.data()[lptr]); // Start of row indices of the supernode - - // Determine the largest abs numerical value for partial pivoting - Index diagind = iperm_c(jcol); // diagonal index - RealScalar pivmax(-1.0); - Index pivptr = nsupc; - Index diag = emptyIdxLU; - RealScalar rtemp; - Index isub, icol, itemp, k; - for (isub = nsupc; isub < nsupr; ++isub) { - using std::abs; - rtemp = abs(lu_col_ptr[isub]); - if (rtemp > pivmax) { - pivmax = rtemp; - pivptr = isub; - } - if (lsub_ptr[isub] == diagind) diag = isub; - } - - // Test for singularity - if ( pivmax <= RealScalar(0.0) ) { - // if pivmax == -1, the column is structurally empty, otherwise it is only numerically zero - pivrow = pivmax < RealScalar(0.0) ? diagind : lsub_ptr[pivptr]; - perm_r(pivrow) = StorageIndex(jcol); - return (jcol+1); - } - - RealScalar thresh = diagpivotthresh * pivmax; - - // Choose appropriate pivotal element - - { - // Test if the diagonal element can be used as a pivot (given the threshold value) - if (diag >= 0 ) - { - // Diagonal element exists - using std::abs; - rtemp = abs(lu_col_ptr[diag]); - if (rtemp != RealScalar(0.0) && rtemp >= thresh) pivptr = diag; - } - pivrow = lsub_ptr[pivptr]; - } - - // Record pivot row - perm_r(pivrow) = StorageIndex(jcol); - // Interchange row subscripts - if (pivptr != nsupc ) - { - std::swap( lsub_ptr[pivptr], lsub_ptr[nsupc] ); - // Interchange numerical values as well, for the two rows in the whole snode - // such that L is indexed the same way as A - for (icol = 0; icol <= nsupc; icol++) - { - itemp = pivptr + icol * lda; - std::swap(lu_sup_ptr[itemp], lu_sup_ptr[nsupc + icol * lda]); - } - } - // cdiv operations - Scalar temp = Scalar(1.0) / lu_col_ptr[nsupc]; - for (k = nsupc+1; k < nsupr; k++) - lu_col_ptr[k] *= temp; - return 0; -} - -} // end namespace internal -} // end namespace Eigen - -#endif // SPARSELU_PIVOTL_H diff --git a/Eigen/src/SparseLU/SparseLU_pruneL.h b/Eigen/src/SparseLU/SparseLU_pruneL.h deleted file mode 100644 index ad32fed5e..000000000 --- a/Eigen/src/SparseLU/SparseLU_pruneL.h +++ /dev/null @@ -1,136 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* - - * NOTE: This file is the modified version of [s,d,c,z]pruneL.c file in SuperLU - - * -- SuperLU routine (version 2.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * November 15, 1997 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ -#ifndef SPARSELU_PRUNEL_H -#define SPARSELU_PRUNEL_H - -namespace Eigen { -namespace internal { - -/** - * \brief Prunes the L-structure. - * - * It prunes the L-structure of supernodes whose L-structure contains the current pivot row "pivrow" - * - * - * \param jcol The current column of L - * \param[in] perm_r Row permutation - * \param[out] pivrow The pivot row - * \param nseg Number of segments - * \param segrep - * \param repfnz - * \param[out] xprune - * \param glu Global LU data - * - */ -template -void SparseLUImpl::pruneL(const Index jcol, const IndexVector& perm_r, const Index pivrow, const Index nseg, - const IndexVector& segrep, BlockIndexVector repfnz, IndexVector& xprune, GlobalLU_t& glu) -{ - // For each supernode-rep irep in U(*,j] - Index jsupno = glu.supno(jcol); - Index i,irep,irep1; - bool movnum, do_prune = false; - Index kmin = 0, kmax = 0, minloc, maxloc,krow; - for (i = 0; i < nseg; i++) - { - irep = segrep(i); - irep1 = irep + 1; - do_prune = false; - - // Don't prune with a zero U-segment - if (repfnz(irep) == emptyIdxLU) continue; - - // If a snode overlaps with the next panel, then the U-segment - // is fragmented into two parts -- irep and irep1. We should let - // pruning occur at the rep-column in irep1s snode. - if (glu.supno(irep) == glu.supno(irep1) ) continue; // don't prune - - // If it has not been pruned & it has a nonz in row L(pivrow,i) - if (glu.supno(irep) != jsupno ) - { - if ( xprune (irep) >= glu.xlsub(irep1) ) - { - kmin = glu.xlsub(irep); - kmax = glu.xlsub(irep1) - 1; - for (krow = kmin; krow <= kmax; krow++) - { - if (glu.lsub(krow) == pivrow) - { - do_prune = true; - break; - } - } - } - - if (do_prune) - { - // do a quicksort-type partition - // movnum=true means that the num values have to be exchanged - movnum = false; - if (irep == glu.xsup(glu.supno(irep)) ) // Snode of size 1 - movnum = true; - - while (kmin <= kmax) - { - if (perm_r(glu.lsub(kmax)) == emptyIdxLU) - kmax--; - else if ( perm_r(glu.lsub(kmin)) != emptyIdxLU) - kmin++; - else - { - // kmin below pivrow (not yet pivoted), and kmax - // above pivrow: interchange the two suscripts - std::swap(glu.lsub(kmin), glu.lsub(kmax)); - - // If the supernode has only one column, then we - // only keep one set of subscripts. For any subscript - // intercnahge performed, similar interchange must be - // done on the numerical values. - if (movnum) - { - minloc = glu.xlusup(irep) + ( kmin - glu.xlsub(irep) ); - maxloc = glu.xlusup(irep) + ( kmax - glu.xlsub(irep) ); - std::swap(glu.lusup(minloc), glu.lusup(maxloc)); - } - kmin++; - kmax--; - } - } // end while - - xprune(irep) = StorageIndex(kmin); //Pruning - } // end if do_prune - } // end pruning - } // End for each U-segment -} - -} // end namespace internal -} // end namespace Eigen - -#endif // SPARSELU_PRUNEL_H diff --git a/Eigen/src/SparseLU/SparseLU_relax_snode.h b/Eigen/src/SparseLU/SparseLU_relax_snode.h deleted file mode 100644 index c408d01b4..000000000 --- a/Eigen/src/SparseLU/SparseLU_relax_snode.h +++ /dev/null @@ -1,83 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012 Désiré Nuentsa-Wakam -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -/* This file is a modified version of heap_relax_snode.c file in SuperLU - * -- SuperLU routine (version 3.0) -- - * Univ. of California Berkeley, Xerox Palo Alto Research Center, - * and Lawrence Berkeley National Lab. - * October 15, 2003 - * - * Copyright (c) 1994 by Xerox Corporation. All rights reserved. - * - * THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY - * EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. - * - * Permission is hereby granted to use or copy this program for any - * purpose, provided the above notices are retained on all copies. - * Permission to modify the code and to distribute modified code is - * granted, provided the above notices are retained, and a notice that - * the code was modified is included with the above copyright notice. - */ - -#ifndef SPARSELU_RELAX_SNODE_H -#define SPARSELU_RELAX_SNODE_H - -namespace Eigen { - -namespace internal { - -/** - * \brief Identify the initial relaxed supernodes - * - * This routine is applied to a column elimination tree. - * It assumes that the matrix has been reordered according to the postorder of the etree - * \param n the number of columns - * \param et elimination tree - * \param relax_columns Maximum number of columns allowed in a relaxed snode - * \param descendants Number of descendants of each node in the etree - * \param relax_end last column in a supernode - */ -template -void SparseLUImpl::relax_snode (const Index n, IndexVector& et, const Index relax_columns, IndexVector& descendants, IndexVector& relax_end) -{ - - // compute the number of descendants of each node in the etree - Index parent; - relax_end.setConstant(emptyIdxLU); - descendants.setZero(); - for (Index j = 0; j < n; j++) - { - parent = et(j); - if (parent != n) // not the dummy root - descendants(parent) += descendants(j) + 1; - } - // Identify the relaxed supernodes by postorder traversal of the etree - Index snode_start; // beginning of a snode - for (Index j = 0; j < n; ) - { - parent = et(j); - snode_start = j; - while ( parent != n && descendants(parent) < relax_columns ) - { - j = parent; - parent = et(j); - } - // Found a supernode in postordered etree, j is the last column - relax_end(snode_start) = StorageIndex(j); // Record last column - j++; - // Search for a new leaf - while (descendants(j) != 0 && j < n) j++; - } // End postorder traversal of the etree - -} - -} // end namespace internal - -} // end namespace Eigen -#endif diff --git a/Eigen/src/SparseQR/SparseQR.h b/Eigen/src/SparseQR/SparseQR.h deleted file mode 100644 index f7111fe2e..000000000 --- a/Eigen/src/SparseQR/SparseQR.h +++ /dev/null @@ -1,739 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2012-2013 Desire Nuentsa -// Copyright (C) 2012-2014 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SPARSE_QR_H -#define EIGEN_SPARSE_QR_H - -namespace Eigen { - -template class SparseQR; -template struct SparseQRMatrixQReturnType; -template struct SparseQRMatrixQTransposeReturnType; -template struct SparseQR_QProduct; -namespace internal { - template struct traits > - { - typedef typename SparseQRType::MatrixType ReturnType; - typedef typename ReturnType::StorageIndex StorageIndex; - typedef typename ReturnType::StorageKind StorageKind; - enum { - RowsAtCompileTime = Dynamic, - ColsAtCompileTime = Dynamic - }; - }; - template struct traits > - { - typedef typename SparseQRType::MatrixType ReturnType; - }; - template struct traits > - { - typedef typename Derived::PlainObject ReturnType; - }; -} // End namespace internal - -/** - * \ingroup SparseQR_Module - * \class SparseQR - * \brief Sparse left-looking rank-revealing QR factorization - * - * This class implements a left-looking rank-revealing QR decomposition - * of sparse matrices. When a column has a norm less than a given tolerance - * it is implicitly permuted to the end. The QR factorization thus obtained is - * given by A*P = Q*R where R is upper triangular or trapezoidal. - * - * P is the column permutation which is the product of the fill-reducing and the - * rank-revealing permutations. Use colsPermutation() to get it. - * - * Q is the orthogonal matrix represented as products of Householder reflectors. - * Use matrixQ() to get an expression and matrixQ().transpose() to get the transpose. - * You can then apply it to a vector. - * - * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient. - * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank. - * - * \tparam _MatrixType The type of the sparse matrix A, must be a column-major SparseMatrix<> - * \tparam _OrderingType The fill-reducing ordering method. See the \link OrderingMethods_Module - * OrderingMethods \endlink module for the list of built-in and external ordering methods. - * - * \implsparsesolverconcept - * - * \warning The input sparse matrix A must be in compressed mode (see SparseMatrix::makeCompressed()). - * - */ -template -class SparseQR : public SparseSolverBase > -{ - protected: - typedef SparseSolverBase > Base; - using Base::m_isInitialized; - public: - using Base::_solve_impl; - typedef _MatrixType MatrixType; - typedef _OrderingType OrderingType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef SparseMatrix QRMatrixType; - typedef Matrix IndexVector; - typedef Matrix ScalarVector; - typedef PermutationMatrix PermutationType; - - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - SparseQR () : m_analysisIsok(false), m_lastError(""), m_useDefaultThreshold(true),m_isQSorted(false),m_isEtreeOk(false) - { } - - /** Construct a QR factorization of the matrix \a mat. - * - * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()). - * - * \sa compute() - */ - explicit SparseQR(const MatrixType& mat) : m_analysisIsok(false), m_lastError(""), m_useDefaultThreshold(true),m_isQSorted(false),m_isEtreeOk(false) - { - compute(mat); - } - - /** Computes the QR factorization of the sparse matrix \a mat. - * - * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()). - * - * \sa analyzePattern(), factorize() - */ - void compute(const MatrixType& mat) - { - analyzePattern(mat); - factorize(mat); - } - void analyzePattern(const MatrixType& mat); - void factorize(const MatrixType& mat); - - /** \returns the number of rows of the represented matrix. - */ - inline Index rows() const { return m_pmat.rows(); } - - /** \returns the number of columns of the represented matrix. - */ - inline Index cols() const { return m_pmat.cols();} - - /** \returns a const reference to the \b sparse upper triangular matrix R of the QR factorization. - * \warning The entries of the returned matrix are not sorted. This means that using it in algorithms - * expecting sorted entries will fail. This include random coefficient accesses (SpaseMatrix::coeff()), - * and coefficient-wise operations. Matrix products and triangular solves are fine though. - * - * To sort the entries, you can assign it to a row-major matrix, and if a column-major matrix - * is required, you can copy it again: - * \code - * SparseMatrix R = qr.matrixR(); // column-major, not sorted! - * SparseMatrix Rr = qr.matrixR(); // row-major, sorted - * SparseMatrix Rc = Rr; // column-major, sorted - * \endcode - */ - const QRMatrixType& matrixR() const { return m_R; } - - /** \returns the number of non linearly dependent columns as determined by the pivoting threshold. - * - * \sa setPivotThreshold() - */ - Index rank() const - { - eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); - return m_nonzeropivots; - } - - /** \returns an expression of the matrix Q as products of sparse Householder reflectors. - * The common usage of this function is to apply it to a dense matrix or vector - * \code - * VectorXd B1, B2; - * // Initialize B1 - * B2 = matrixQ() * B1; - * \endcode - * - * To get a plain SparseMatrix representation of Q: - * \code - * SparseMatrix Q; - * Q = SparseQR >(A).matrixQ(); - * \endcode - * Internally, this call simply performs a sparse product between the matrix Q - * and a sparse identity matrix. However, due to the fact that the sparse - * reflectors are stored unsorted, two transpositions are needed to sort - * them before performing the product. - */ - SparseQRMatrixQReturnType matrixQ() const - { return SparseQRMatrixQReturnType(*this); } - - /** \returns a const reference to the column permutation P that was applied to A such that A*P = Q*R - * It is the combination of the fill-in reducing permutation and numerical column pivoting. - */ - const PermutationType& colsPermutation() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_outputPerm_c; - } - - /** \returns A string describing the type of error. - * This method is provided to ease debugging, not to handle errors. - */ - std::string lastErrorMessage() const { return m_lastError; } - - /** \internal */ - template - bool _solve_impl(const MatrixBase &B, MatrixBase &dest) const - { - eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); - eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix"); - - Index rank = this->rank(); - - // Compute Q^T * b; - typename Dest::PlainObject y, b; - y = this->matrixQ().transpose() * B; - b = y; - - // Solve with the triangular matrix R - y.resize((std::max)(cols(),y.rows()),y.cols()); - y.topRows(rank) = this->matrixR().topLeftCorner(rank, rank).template triangularView().solve(b.topRows(rank)); - y.bottomRows(y.rows()-rank).setZero(); - - // Apply the column permutation - if (m_perm_c.size()) dest = colsPermutation() * y.topRows(cols()); - else dest = y.topRows(cols()); - - m_info = Success; - return true; - } - - /** Sets the threshold that is used to determine linearly dependent columns during the factorization. - * - * In practice, if during the factorization the norm of the column that has to be eliminated is below - * this threshold, then the entire column is treated as zero, and it is moved at the end. - */ - void setPivotThreshold(const RealScalar& threshold) - { - m_useDefaultThreshold = false; - m_threshold = threshold; - } - - /** \returns the solution X of \f$ A X = B \f$ using the current decomposition of A. - * - * \sa compute() - */ - template - inline const Solve solve(const MatrixBase& B) const - { - eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); - eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix"); - return Solve(*this, B.derived()); - } - template - inline const Solve solve(const SparseMatrixBase& B) const - { - eigen_assert(m_isInitialized && "The factorization should be called first, use compute()"); - eigen_assert(this->rows() == B.rows() && "SparseQR::solve() : invalid number of rows in the right hand side matrix"); - return Solve(*this, B.derived()); - } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was successful, - * \c NumericalIssue if the QR factorization reports a numerical problem - * \c InvalidInput if the input matrix is invalid - * - * \sa iparm() - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - - /** \internal */ - inline void _sort_matrix_Q() - { - if(this->m_isQSorted) return; - // The matrix Q is sorted during the transposition - SparseMatrix mQrm(this->m_Q); - this->m_Q = mQrm; - this->m_isQSorted = true; - } - - - protected: - bool m_analysisIsok; - bool m_factorizationIsok; - mutable ComputationInfo m_info; - std::string m_lastError; - QRMatrixType m_pmat; // Temporary matrix - QRMatrixType m_R; // The triangular factor matrix - QRMatrixType m_Q; // The orthogonal reflectors - ScalarVector m_hcoeffs; // The Householder coefficients - PermutationType m_perm_c; // Fill-reducing Column permutation - PermutationType m_pivotperm; // The permutation for rank revealing - PermutationType m_outputPerm_c; // The final column permutation - RealScalar m_threshold; // Threshold to determine null Householder reflections - bool m_useDefaultThreshold; // Use default threshold - Index m_nonzeropivots; // Number of non zero pivots found - IndexVector m_etree; // Column elimination tree - IndexVector m_firstRowElt; // First element in each row - bool m_isQSorted; // whether Q is sorted or not - bool m_isEtreeOk; // whether the elimination tree match the initial input matrix - - template friend struct SparseQR_QProduct; - -}; - -/** \brief Preprocessing step of a QR factorization - * - * \warning The matrix \a mat must be in compressed mode (see SparseMatrix::makeCompressed()). - * - * In this step, the fill-reducing permutation is computed and applied to the columns of A - * and the column elimination tree is computed as well. Only the sparsity pattern of \a mat is exploited. - * - * \note In this step it is assumed that there is no empty row in the matrix \a mat. - */ -template -void SparseQR::analyzePattern(const MatrixType& mat) -{ - eigen_assert(mat.isCompressed() && "SparseQR requires a sparse matrix in compressed mode. Call .makeCompressed() before passing it to SparseQR"); - // Copy to a column major matrix if the input is rowmajor - typename internal::conditional::type matCpy(mat); - // Compute the column fill reducing ordering - OrderingType ord; - ord(matCpy, m_perm_c); - Index n = mat.cols(); - Index m = mat.rows(); - Index diagSize = (std::min)(m,n); - - if (!m_perm_c.size()) - { - m_perm_c.resize(n); - m_perm_c.indices().setLinSpaced(n, 0,StorageIndex(n-1)); - } - - // Compute the column elimination tree of the permuted matrix - m_outputPerm_c = m_perm_c.inverse(); - internal::coletree(matCpy, m_etree, m_firstRowElt, m_outputPerm_c.indices().data()); - m_isEtreeOk = true; - - m_R.resize(diagSize, n); - m_Q.resize(m, diagSize); - - // Allocate space for nonzero elements : rough estimation - m_R.reserve(2*mat.nonZeros()); //FIXME Get a more accurate estimation through symbolic factorization with the etree - m_Q.reserve(2*mat.nonZeros()); - m_hcoeffs.resize(diagSize); - m_analysisIsok = true; -} - -/** \brief Performs the numerical QR factorization of the input matrix - * - * The function SparseQR::analyzePattern(const MatrixType&) must have been called beforehand with - * a matrix having the same sparsity pattern than \a mat. - * - * \param mat The sparse column-major matrix - */ -template -void SparseQR::factorize(const MatrixType& mat) -{ - using std::abs; - - eigen_assert(m_analysisIsok && "analyzePattern() should be called before this step"); - StorageIndex m = StorageIndex(mat.rows()); - StorageIndex n = StorageIndex(mat.cols()); - StorageIndex diagSize = (std::min)(m,n); - IndexVector mark((std::max)(m,n)); mark.setConstant(-1); // Record the visited nodes - IndexVector Ridx(n), Qidx(m); // Store temporarily the row indexes for the current column of R and Q - Index nzcolR, nzcolQ; // Number of nonzero for the current column of R and Q - ScalarVector tval(m); // The dense vector used to compute the current column - RealScalar pivotThreshold = m_threshold; - - m_R.setZero(); - m_Q.setZero(); - m_pmat = mat; - if(!m_isEtreeOk) - { - m_outputPerm_c = m_perm_c.inverse(); - internal::coletree(m_pmat, m_etree, m_firstRowElt, m_outputPerm_c.indices().data()); - m_isEtreeOk = true; - } - - m_pmat.uncompress(); // To have the innerNonZeroPtr allocated - - // Apply the fill-in reducing permutation lazily: - { - // If the input is row major, copy the original column indices, - // otherwise directly use the input matrix - // - IndexVector originalOuterIndicesCpy; - const StorageIndex *originalOuterIndices = mat.outerIndexPtr(); - if(MatrixType::IsRowMajor) - { - originalOuterIndicesCpy = IndexVector::Map(m_pmat.outerIndexPtr(),n+1); - originalOuterIndices = originalOuterIndicesCpy.data(); - } - - for (int i = 0; i < n; i++) - { - Index p = m_perm_c.size() ? m_perm_c.indices()(i) : i; - m_pmat.outerIndexPtr()[p] = originalOuterIndices[i]; - m_pmat.innerNonZeroPtr()[p] = originalOuterIndices[i+1] - originalOuterIndices[i]; - } - } - - /* Compute the default threshold as in MatLab, see: - * Tim Davis, "Algorithm 915, SuiteSparseQR: Multifrontal Multithreaded Rank-Revealing - * Sparse QR Factorization, ACM Trans. on Math. Soft. 38(1), 2011, Page 8:3 - */ - if(m_useDefaultThreshold) - { - RealScalar max2Norm = 0.0; - for (int j = 0; j < n; j++) max2Norm = numext::maxi(max2Norm, m_pmat.col(j).norm()); - if(max2Norm==RealScalar(0)) - max2Norm = RealScalar(1); - pivotThreshold = 20 * (m + n) * max2Norm * NumTraits::epsilon(); - } - - // Initialize the numerical permutation - m_pivotperm.setIdentity(n); - - StorageIndex nonzeroCol = 0; // Record the number of valid pivots - m_Q.startVec(0); - - // Left looking rank-revealing QR factorization: compute a column of R and Q at a time - for (StorageIndex col = 0; col < n; ++col) - { - mark.setConstant(-1); - m_R.startVec(col); - mark(nonzeroCol) = col; - Qidx(0) = nonzeroCol; - nzcolR = 0; nzcolQ = 1; - bool found_diag = nonzeroCol>=m; - tval.setZero(); - - // Symbolic factorization: find the nonzero locations of the column k of the factors R and Q, i.e., - // all the nodes (with indexes lower than rank) reachable through the column elimination tree (etree) rooted at node k. - // Note: if the diagonal entry does not exist, then its contribution must be explicitly added, - // thus the trick with found_diag that permits to do one more iteration on the diagonal element if this one has not been found. - for (typename QRMatrixType::InnerIterator itp(m_pmat, col); itp || !found_diag; ++itp) - { - StorageIndex curIdx = nonzeroCol; - if(itp) curIdx = StorageIndex(itp.row()); - if(curIdx == nonzeroCol) found_diag = true; - - // Get the nonzeros indexes of the current column of R - StorageIndex st = m_firstRowElt(curIdx); // The traversal of the etree starts here - if (st < 0 ) - { - m_lastError = "Empty row found during numerical factorization"; - m_info = InvalidInput; - return; - } - - // Traverse the etree - Index bi = nzcolR; - for (; mark(st) != col; st = m_etree(st)) - { - Ridx(nzcolR) = st; // Add this row to the list, - mark(st) = col; // and mark this row as visited - nzcolR++; - } - - // Reverse the list to get the topological ordering - Index nt = nzcolR-bi; - for(Index i = 0; i < nt/2; i++) std::swap(Ridx(bi+i), Ridx(nzcolR-i-1)); - - // Copy the current (curIdx,pcol) value of the input matrix - if(itp) tval(curIdx) = itp.value(); - else tval(curIdx) = Scalar(0); - - // Compute the pattern of Q(:,k) - if(curIdx > nonzeroCol && mark(curIdx) != col ) - { - Qidx(nzcolQ) = curIdx; // Add this row to the pattern of Q, - mark(curIdx) = col; // and mark it as visited - nzcolQ++; - } - } - - // Browse all the indexes of R(:,col) in reverse order - for (Index i = nzcolR-1; i >= 0; i--) - { - Index curIdx = Ridx(i); - - // Apply the curIdx-th householder vector to the current column (temporarily stored into tval) - Scalar tdot(0); - - // First compute q' * tval - tdot = m_Q.col(curIdx).dot(tval); - - tdot *= m_hcoeffs(curIdx); - - // Then update tval = tval - q * tau - // FIXME: tval -= tdot * m_Q.col(curIdx) should amount to the same (need to check/add support for efficient "dense ?= sparse") - for (typename QRMatrixType::InnerIterator itq(m_Q, curIdx); itq; ++itq) - tval(itq.row()) -= itq.value() * tdot; - - // Detect fill-in for the current column of Q - if(m_etree(Ridx(i)) == nonzeroCol) - { - for (typename QRMatrixType::InnerIterator itq(m_Q, curIdx); itq; ++itq) - { - StorageIndex iQ = StorageIndex(itq.row()); - if (mark(iQ) != col) - { - Qidx(nzcolQ++) = iQ; // Add this row to the pattern of Q, - mark(iQ) = col; // and mark it as visited - } - } - } - } // End update current column - - Scalar tau = RealScalar(0); - RealScalar beta = 0; - - if(nonzeroCol < diagSize) - { - // Compute the Householder reflection that eliminate the current column - // FIXME this step should call the Householder module. - Scalar c0 = nzcolQ ? tval(Qidx(0)) : Scalar(0); - - // First, the squared norm of Q((col+1):m, col) - RealScalar sqrNorm = 0.; - for (Index itq = 1; itq < nzcolQ; ++itq) sqrNorm += numext::abs2(tval(Qidx(itq))); - if(sqrNorm == RealScalar(0) && numext::imag(c0) == RealScalar(0)) - { - beta = numext::real(c0); - tval(Qidx(0)) = 1; - } - else - { - using std::sqrt; - beta = sqrt(numext::abs2(c0) + sqrNorm); - if(numext::real(c0) >= RealScalar(0)) - beta = -beta; - tval(Qidx(0)) = 1; - for (Index itq = 1; itq < nzcolQ; ++itq) - tval(Qidx(itq)) /= (c0 - beta); - tau = numext::conj((beta-c0) / beta); - - } - } - - // Insert values in R - for (Index i = nzcolR-1; i >= 0; i--) - { - Index curIdx = Ridx(i); - if(curIdx < nonzeroCol) - { - m_R.insertBackByOuterInnerUnordered(col, curIdx) = tval(curIdx); - tval(curIdx) = Scalar(0.); - } - } - - if(nonzeroCol < diagSize && abs(beta) >= pivotThreshold) - { - m_R.insertBackByOuterInner(col, nonzeroCol) = beta; - // The householder coefficient - m_hcoeffs(nonzeroCol) = tau; - // Record the householder reflections - for (Index itq = 0; itq < nzcolQ; ++itq) - { - Index iQ = Qidx(itq); - m_Q.insertBackByOuterInnerUnordered(nonzeroCol,iQ) = tval(iQ); - tval(iQ) = Scalar(0.); - } - nonzeroCol++; - if(nonzeroCol -struct SparseQR_QProduct : ReturnByValue > -{ - typedef typename SparseQRType::QRMatrixType MatrixType; - typedef typename SparseQRType::Scalar Scalar; - // Get the references - SparseQR_QProduct(const SparseQRType& qr, const Derived& other, bool transpose) : - m_qr(qr),m_other(other),m_transpose(transpose) {} - inline Index rows() const { return m_transpose ? m_qr.rows() : m_qr.cols(); } - inline Index cols() const { return m_other.cols(); } - - // Assign to a vector - template - void evalTo(DesType& res) const - { - Index m = m_qr.rows(); - Index n = m_qr.cols(); - Index diagSize = (std::min)(m,n); - res = m_other; - if (m_transpose) - { - eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non conforming object sizes"); - //Compute res = Q' * other column by column - for(Index j = 0; j < res.cols(); j++){ - for (Index k = 0; k < diagSize; k++) - { - Scalar tau = Scalar(0); - tau = m_qr.m_Q.col(k).dot(res.col(j)); - if(tau==Scalar(0)) continue; - tau = tau * m_qr.m_hcoeffs(k); - res.col(j) -= tau * m_qr.m_Q.col(k); - } - } - } - else - { - eigen_assert(m_qr.m_Q.rows() == m_other.rows() && "Non conforming object sizes"); - // Compute res = Q * other column by column - for(Index j = 0; j < res.cols(); j++) - { - for (Index k = diagSize-1; k >=0; k--) - { - Scalar tau = Scalar(0); - tau = m_qr.m_Q.col(k).dot(res.col(j)); - if(tau==Scalar(0)) continue; - tau = tau * m_qr.m_hcoeffs(k); - res.col(j) -= tau * m_qr.m_Q.col(k); - } - } - } - } - - const SparseQRType& m_qr; - const Derived& m_other; - bool m_transpose; -}; - -template -struct SparseQRMatrixQReturnType : public EigenBase > -{ - typedef typename SparseQRType::Scalar Scalar; - typedef Matrix DenseMatrix; - enum { - RowsAtCompileTime = Dynamic, - ColsAtCompileTime = Dynamic - }; - explicit SparseQRMatrixQReturnType(const SparseQRType& qr) : m_qr(qr) {} - template - SparseQR_QProduct operator*(const MatrixBase& other) - { - return SparseQR_QProduct(m_qr,other.derived(),false); - } - SparseQRMatrixQTransposeReturnType adjoint() const - { - return SparseQRMatrixQTransposeReturnType(m_qr); - } - inline Index rows() const { return m_qr.rows(); } - inline Index cols() const { return (std::min)(m_qr.rows(),m_qr.cols()); } - // To use for operations with the transpose of Q - SparseQRMatrixQTransposeReturnType transpose() const - { - return SparseQRMatrixQTransposeReturnType(m_qr); - } - const SparseQRType& m_qr; -}; - -template -struct SparseQRMatrixQTransposeReturnType -{ - explicit SparseQRMatrixQTransposeReturnType(const SparseQRType& qr) : m_qr(qr) {} - template - SparseQR_QProduct operator*(const MatrixBase& other) - { - return SparseQR_QProduct(m_qr,other.derived(), true); - } - const SparseQRType& m_qr; -}; - -namespace internal { - -template -struct evaluator_traits > -{ - typedef typename SparseQRType::MatrixType MatrixType; - typedef typename storage_kind_to_evaluator_kind::Kind Kind; - typedef SparseShape Shape; -}; - -template< typename DstXprType, typename SparseQRType> -struct Assignment, internal::assign_op, Sparse2Sparse> -{ - typedef SparseQRMatrixQReturnType SrcXprType; - typedef typename DstXprType::Scalar Scalar; - typedef typename DstXprType::StorageIndex StorageIndex; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &/*func*/) - { - typename DstXprType::PlainObject idMat(src.m_qr.rows(), src.m_qr.rows()); - idMat.setIdentity(); - // Sort the sparse householder reflectors if needed - const_cast(&src.m_qr)->_sort_matrix_Q(); - dst = SparseQR_QProduct(src.m_qr, idMat, false); - } -}; - -template< typename DstXprType, typename SparseQRType> -struct Assignment, internal::assign_op, Sparse2Dense> -{ - typedef SparseQRMatrixQReturnType SrcXprType; - typedef typename DstXprType::Scalar Scalar; - typedef typename DstXprType::StorageIndex StorageIndex; - static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op &/*func*/) - { - dst = src.m_qr.matrixQ() * DstXprType::Identity(src.m_qr.rows(), src.m_qr.rows()); - } -}; - -} // end namespace internal - -} // end namespace Eigen - -#endif diff --git a/Eigen/src/StlSupport/StdDeque.h b/Eigen/src/StlSupport/StdDeque.h deleted file mode 100644 index cf1fedf92..000000000 --- a/Eigen/src/StlSupport/StdDeque.h +++ /dev/null @@ -1,126 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2009 Hauke Heibel -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STDDEQUE_H -#define EIGEN_STDDEQUE_H - -#include "details.h" - -/** - * This section contains a convenience MACRO which allows an easy specialization of - * std::deque such that for data types with alignment issues the correct allocator - * is used automatically. - */ -#define EIGEN_DEFINE_STL_DEQUE_SPECIALIZATION(...) \ -namespace std \ -{ \ - template<> \ - class deque<__VA_ARGS__, std::allocator<__VA_ARGS__> > \ - : public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \ - { \ - typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \ - public: \ - typedef __VA_ARGS__ value_type; \ - typedef deque_base::allocator_type allocator_type; \ - typedef deque_base::size_type size_type; \ - typedef deque_base::iterator iterator; \ - explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \ - template \ - deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \ - deque(const deque& c) : deque_base(c) {} \ - explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \ - deque(iterator start, iterator end) : deque_base(start, end) {} \ - deque& operator=(const deque& x) { \ - deque_base::operator=(x); \ - return *this; \ - } \ - }; \ -} - -// check whether we really need the std::deque specialization -#if !EIGEN_HAS_CXX11_CONTAINERS && !(defined(_GLIBCXX_DEQUE) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::deque::resize(size_type,const T&). */ - -namespace std { - -#define EIGEN_STD_DEQUE_SPECIALIZATION_BODY \ - public: \ - typedef T value_type; \ - typedef typename deque_base::allocator_type allocator_type; \ - typedef typename deque_base::size_type size_type; \ - typedef typename deque_base::iterator iterator; \ - typedef typename deque_base::const_iterator const_iterator; \ - explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \ - template \ - deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \ - : deque_base(first, last, a) {} \ - deque(const deque& c) : deque_base(c) {} \ - explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \ - deque(iterator start, iterator end) : deque_base(start, end) {} \ - deque& operator=(const deque& x) { \ - deque_base::operator=(x); \ - return *this; \ - } - - template - class deque > - : public deque > -{ - typedef deque > deque_base; - EIGEN_STD_DEQUE_SPECIALIZATION_BODY - - void resize(size_type new_size) - { resize(new_size, T()); } - -#if defined(_DEQUE_) - // workaround MSVC std::deque implementation - void resize(size_type new_size, const value_type& x) - { - if (deque_base::size() < new_size) - deque_base::_Insert_n(deque_base::end(), new_size - deque_base::size(), x); - else if (new_size < deque_base::size()) - deque_base::erase(deque_base::begin() + new_size, deque_base::end()); - } - void push_back(const value_type& x) - { deque_base::push_back(x); } - void push_front(const value_type& x) - { deque_base::push_front(x); } - using deque_base::insert; - iterator insert(const_iterator position, const value_type& x) - { return deque_base::insert(position,x); } - void insert(const_iterator position, size_type new_size, const value_type& x) - { deque_base::insert(position, new_size, x); } -#elif defined(_GLIBCXX_DEQUE) && EIGEN_GNUC_AT_LEAST(4,2) - // workaround GCC std::deque implementation - void resize(size_type new_size, const value_type& x) - { - if (new_size < deque_base::size()) - deque_base::_M_erase_at_end(this->_M_impl._M_start + new_size); - else - deque_base::insert(deque_base::end(), new_size - deque_base::size(), x); - } -#else - // either GCC 4.1 or non-GCC - // default implementation which should always work. - void resize(size_type new_size, const value_type& x) - { - if (new_size < deque_base::size()) - deque_base::erase(deque_base::begin() + new_size, deque_base::end()); - else if (new_size > deque_base::size()) - deque_base::insert(deque_base::end(), new_size - deque_base::size(), x); - } -#endif - }; -} - -#endif // check whether specialization is actually required - -#endif // EIGEN_STDDEQUE_H diff --git a/Eigen/src/StlSupport/StdList.h b/Eigen/src/StlSupport/StdList.h deleted file mode 100644 index e1eba4985..000000000 --- a/Eigen/src/StlSupport/StdList.h +++ /dev/null @@ -1,106 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Hauke Heibel -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STDLIST_H -#define EIGEN_STDLIST_H - -#include "details.h" - -/** - * This section contains a convenience MACRO which allows an easy specialization of - * std::list such that for data types with alignment issues the correct allocator - * is used automatically. - */ -#define EIGEN_DEFINE_STL_LIST_SPECIALIZATION(...) \ -namespace std \ -{ \ - template<> \ - class list<__VA_ARGS__, std::allocator<__VA_ARGS__> > \ - : public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \ - { \ - typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \ - public: \ - typedef __VA_ARGS__ value_type; \ - typedef list_base::allocator_type allocator_type; \ - typedef list_base::size_type size_type; \ - typedef list_base::iterator iterator; \ - explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \ - template \ - list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \ - list(const list& c) : list_base(c) {} \ - explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {} \ - list(iterator start, iterator end) : list_base(start, end) {} \ - list& operator=(const list& x) { \ - list_base::operator=(x); \ - return *this; \ - } \ - }; \ -} - -// check whether we really need the std::list specialization -#if !EIGEN_HAS_CXX11_CONTAINERS && !(defined(_GLIBCXX_LIST) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::list::resize(size_type,const T&). */ - -namespace std -{ - -#define EIGEN_STD_LIST_SPECIALIZATION_BODY \ - public: \ - typedef T value_type; \ - typedef typename list_base::allocator_type allocator_type; \ - typedef typename list_base::size_type size_type; \ - typedef typename list_base::iterator iterator; \ - typedef typename list_base::const_iterator const_iterator; \ - explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \ - template \ - list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \ - : list_base(first, last, a) {} \ - list(const list& c) : list_base(c) {} \ - explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {} \ - list(iterator start, iterator end) : list_base(start, end) {} \ - list& operator=(const list& x) { \ - list_base::operator=(x); \ - return *this; \ - } - - template - class list > - : public list > - { - typedef list > list_base; - EIGEN_STD_LIST_SPECIALIZATION_BODY - - void resize(size_type new_size) - { resize(new_size, T()); } - - void resize(size_type new_size, const value_type& x) - { - if (list_base::size() < new_size) - list_base::insert(list_base::end(), new_size - list_base::size(), x); - else - while (new_size < list_base::size()) list_base::pop_back(); - } - -#if defined(_LIST_) - // workaround MSVC std::list implementation - void push_back(const value_type& x) - { list_base::push_back(x); } - using list_base::insert; - iterator insert(const_iterator position, const value_type& x) - { return list_base::insert(position,x); } - void insert(const_iterator position, size_type new_size, const value_type& x) - { list_base::insert(position, new_size, x); } -#endif - }; -} - -#endif // check whether specialization is actually required - -#endif // EIGEN_STDLIST_H diff --git a/Eigen/src/StlSupport/StdVector.h b/Eigen/src/StlSupport/StdVector.h deleted file mode 100644 index ec22821d2..000000000 --- a/Eigen/src/StlSupport/StdVector.h +++ /dev/null @@ -1,131 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2009 Hauke Heibel -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STDVECTOR_H -#define EIGEN_STDVECTOR_H - -#include "details.h" - -/** - * This section contains a convenience MACRO which allows an easy specialization of - * std::vector such that for data types with alignment issues the correct allocator - * is used automatically. - */ -#define EIGEN_DEFINE_STL_VECTOR_SPECIALIZATION(...) \ -namespace std \ -{ \ - template<> \ - class vector<__VA_ARGS__, std::allocator<__VA_ARGS__> > \ - : public vector<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \ - { \ - typedef vector<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > vector_base; \ - public: \ - typedef __VA_ARGS__ value_type; \ - typedef vector_base::allocator_type allocator_type; \ - typedef vector_base::size_type size_type; \ - typedef vector_base::iterator iterator; \ - explicit vector(const allocator_type& a = allocator_type()) : vector_base(a) {} \ - template \ - vector(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : vector_base(first, last, a) {} \ - vector(const vector& c) : vector_base(c) {} \ - explicit vector(size_type num, const value_type& val = value_type()) : vector_base(num, val) {} \ - vector(iterator start, iterator end) : vector_base(start, end) {} \ - vector& operator=(const vector& x) { \ - vector_base::operator=(x); \ - return *this; \ - } \ - }; \ -} - -// Don't specialize if containers are implemented according to C++11 -#if !EIGEN_HAS_CXX11_CONTAINERS - -namespace std { - -#define EIGEN_STD_VECTOR_SPECIALIZATION_BODY \ - public: \ - typedef T value_type; \ - typedef typename vector_base::allocator_type allocator_type; \ - typedef typename vector_base::size_type size_type; \ - typedef typename vector_base::iterator iterator; \ - typedef typename vector_base::const_iterator const_iterator; \ - explicit vector(const allocator_type& a = allocator_type()) : vector_base(a) {} \ - template \ - vector(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \ - : vector_base(first, last, a) {} \ - vector(const vector& c) : vector_base(c) {} \ - explicit vector(size_type num, const value_type& val = value_type()) : vector_base(num, val) {} \ - vector(iterator start, iterator end) : vector_base(start, end) {} \ - vector& operator=(const vector& x) { \ - vector_base::operator=(x); \ - return *this; \ - } - - template - class vector > - : public vector > -{ - typedef vector > vector_base; - EIGEN_STD_VECTOR_SPECIALIZATION_BODY - - void resize(size_type new_size) - { resize(new_size, T()); } - -#if defined(_VECTOR_) - // workaround MSVC std::vector implementation - void resize(size_type new_size, const value_type& x) - { - if (vector_base::size() < new_size) - vector_base::_Insert_n(vector_base::end(), new_size - vector_base::size(), x); - else if (new_size < vector_base::size()) - vector_base::erase(vector_base::begin() + new_size, vector_base::end()); - } - void push_back(const value_type& x) - { vector_base::push_back(x); } - using vector_base::insert; - iterator insert(const_iterator position, const value_type& x) - { return vector_base::insert(position,x); } - void insert(const_iterator position, size_type new_size, const value_type& x) - { vector_base::insert(position, new_size, x); } -#elif defined(_GLIBCXX_VECTOR) && (!(EIGEN_GNUC_AT_LEAST(4,1))) - /* Note that before gcc-4.1 we already have: std::vector::resize(size_type,const T&). - * However, this specialization is still needed to make the above EIGEN_DEFINE_STL_VECTOR_SPECIALIZATION trick to work. */ - void resize(size_type new_size, const value_type& x) - { - vector_base::resize(new_size,x); - } -#elif defined(_GLIBCXX_VECTOR) && EIGEN_GNUC_AT_LEAST(4,2) - // workaround GCC std::vector implementation - void resize(size_type new_size, const value_type& x) - { - if (new_size < vector_base::size()) - vector_base::_M_erase_at_end(this->_M_impl._M_start + new_size); - else - vector_base::insert(vector_base::end(), new_size - vector_base::size(), x); - } -#else - // either GCC 4.1 or non-GCC - // default implementation which should always work. - void resize(size_type new_size, const value_type& x) - { - if (new_size < vector_base::size()) - vector_base::erase(vector_base::begin() + new_size, vector_base::end()); - else if (new_size > vector_base::size()) - vector_base::insert(vector_base::end(), new_size - vector_base::size(), x); - } -#endif - }; -} -#endif // !EIGEN_HAS_CXX11_CONTAINERS - - -#endif // EIGEN_STDVECTOR_H diff --git a/Eigen/src/StlSupport/details.h b/Eigen/src/StlSupport/details.h deleted file mode 100644 index 2cfd13e03..000000000 --- a/Eigen/src/StlSupport/details.h +++ /dev/null @@ -1,84 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Gael Guennebaud -// Copyright (C) 2009 Hauke Heibel -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_STL_DETAILS_H -#define EIGEN_STL_DETAILS_H - -#ifndef EIGEN_ALIGNED_ALLOCATOR - #define EIGEN_ALIGNED_ALLOCATOR Eigen::aligned_allocator -#endif - -namespace Eigen { - - // This one is needed to prevent reimplementing the whole std::vector. - template - class aligned_allocator_indirection : public EIGEN_ALIGNED_ALLOCATOR - { - public: - typedef std::size_t size_type; - typedef std::ptrdiff_t difference_type; - typedef T* pointer; - typedef const T* const_pointer; - typedef T& reference; - typedef const T& const_reference; - typedef T value_type; - - template - struct rebind - { - typedef aligned_allocator_indirection other; - }; - - aligned_allocator_indirection() {} - aligned_allocator_indirection(const aligned_allocator_indirection& ) : EIGEN_ALIGNED_ALLOCATOR() {} - aligned_allocator_indirection(const EIGEN_ALIGNED_ALLOCATOR& ) {} - template - aligned_allocator_indirection(const aligned_allocator_indirection& ) {} - template - aligned_allocator_indirection(const EIGEN_ALIGNED_ALLOCATOR& ) {} - ~aligned_allocator_indirection() {} - }; - -#if EIGEN_COMP_MSVC - - // sometimes, MSVC detects, at compile time, that the argument x - // in std::vector::resize(size_t s,T x) won't be aligned and generate an error - // even if this function is never called. Whence this little wrapper. -#define EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T) \ - typename Eigen::internal::conditional< \ - Eigen::internal::is_arithmetic::value, \ - T, \ - Eigen::internal::workaround_msvc_stl_support \ - >::type - - namespace internal { - template struct workaround_msvc_stl_support : public T - { - inline workaround_msvc_stl_support() : T() {} - inline workaround_msvc_stl_support(const T& other) : T(other) {} - inline operator T& () { return *static_cast(this); } - inline operator const T& () const { return *static_cast(this); } - template - inline T& operator=(const OtherT& other) - { T::operator=(other); return *this; } - inline workaround_msvc_stl_support& operator=(const workaround_msvc_stl_support& other) - { T::operator=(other); return *this; } - }; - } - -#else - -#define EIGEN_WORKAROUND_MSVC_STL_SUPPORT(T) T - -#endif - -} - -#endif // EIGEN_STL_DETAILS_H diff --git a/Eigen/src/SuperLUSupport/SuperLUSupport.h b/Eigen/src/SuperLUSupport/SuperLUSupport.h deleted file mode 100644 index 50a69f306..000000000 --- a/Eigen/src/SuperLUSupport/SuperLUSupport.h +++ /dev/null @@ -1,1027 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2015 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_SUPERLUSUPPORT_H -#define EIGEN_SUPERLUSUPPORT_H - -namespace Eigen { - -#if defined(SUPERLU_MAJOR_VERSION) && (SUPERLU_MAJOR_VERSION >= 5) -#define DECL_GSSVX(PREFIX,FLOATTYPE,KEYTYPE) \ - extern "C" { \ - extern void PREFIX##gssvx(superlu_options_t *, SuperMatrix *, int *, int *, int *, \ - char *, FLOATTYPE *, FLOATTYPE *, SuperMatrix *, SuperMatrix *, \ - void *, int, SuperMatrix *, SuperMatrix *, \ - FLOATTYPE *, FLOATTYPE *, FLOATTYPE *, FLOATTYPE *, \ - GlobalLU_t *, mem_usage_t *, SuperLUStat_t *, int *); \ - } \ - inline float SuperLU_gssvx(superlu_options_t *options, SuperMatrix *A, \ - int *perm_c, int *perm_r, int *etree, char *equed, \ - FLOATTYPE *R, FLOATTYPE *C, SuperMatrix *L, \ - SuperMatrix *U, void *work, int lwork, \ - SuperMatrix *B, SuperMatrix *X, \ - FLOATTYPE *recip_pivot_growth, \ - FLOATTYPE *rcond, FLOATTYPE *ferr, FLOATTYPE *berr, \ - SuperLUStat_t *stats, int *info, KEYTYPE) { \ - mem_usage_t mem_usage; \ - GlobalLU_t gLU; \ - PREFIX##gssvx(options, A, perm_c, perm_r, etree, equed, R, C, L, \ - U, work, lwork, B, X, recip_pivot_growth, rcond, \ - ferr, berr, &gLU, &mem_usage, stats, info); \ - return mem_usage.for_lu; /* bytes used by the factor storage */ \ - } -#else // version < 5.0 -#define DECL_GSSVX(PREFIX,FLOATTYPE,KEYTYPE) \ - extern "C" { \ - extern void PREFIX##gssvx(superlu_options_t *, SuperMatrix *, int *, int *, int *, \ - char *, FLOATTYPE *, FLOATTYPE *, SuperMatrix *, SuperMatrix *, \ - void *, int, SuperMatrix *, SuperMatrix *, \ - FLOATTYPE *, FLOATTYPE *, FLOATTYPE *, FLOATTYPE *, \ - mem_usage_t *, SuperLUStat_t *, int *); \ - } \ - inline float SuperLU_gssvx(superlu_options_t *options, SuperMatrix *A, \ - int *perm_c, int *perm_r, int *etree, char *equed, \ - FLOATTYPE *R, FLOATTYPE *C, SuperMatrix *L, \ - SuperMatrix *U, void *work, int lwork, \ - SuperMatrix *B, SuperMatrix *X, \ - FLOATTYPE *recip_pivot_growth, \ - FLOATTYPE *rcond, FLOATTYPE *ferr, FLOATTYPE *berr, \ - SuperLUStat_t *stats, int *info, KEYTYPE) { \ - mem_usage_t mem_usage; \ - PREFIX##gssvx(options, A, perm_c, perm_r, etree, equed, R, C, L, \ - U, work, lwork, B, X, recip_pivot_growth, rcond, \ - ferr, berr, &mem_usage, stats, info); \ - return mem_usage.for_lu; /* bytes used by the factor storage */ \ - } -#endif - -DECL_GSSVX(s,float,float) -DECL_GSSVX(c,float,std::complex) -DECL_GSSVX(d,double,double) -DECL_GSSVX(z,double,std::complex) - -#ifdef MILU_ALPHA -#define EIGEN_SUPERLU_HAS_ILU -#endif - -#ifdef EIGEN_SUPERLU_HAS_ILU - -// similarly for the incomplete factorization using gsisx -#define DECL_GSISX(PREFIX,FLOATTYPE,KEYTYPE) \ - extern "C" { \ - extern void PREFIX##gsisx(superlu_options_t *, SuperMatrix *, int *, int *, int *, \ - char *, FLOATTYPE *, FLOATTYPE *, SuperMatrix *, SuperMatrix *, \ - void *, int, SuperMatrix *, SuperMatrix *, FLOATTYPE *, FLOATTYPE *, \ - mem_usage_t *, SuperLUStat_t *, int *); \ - } \ - inline float SuperLU_gsisx(superlu_options_t *options, SuperMatrix *A, \ - int *perm_c, int *perm_r, int *etree, char *equed, \ - FLOATTYPE *R, FLOATTYPE *C, SuperMatrix *L, \ - SuperMatrix *U, void *work, int lwork, \ - SuperMatrix *B, SuperMatrix *X, \ - FLOATTYPE *recip_pivot_growth, \ - FLOATTYPE *rcond, \ - SuperLUStat_t *stats, int *info, KEYTYPE) { \ - mem_usage_t mem_usage; \ - PREFIX##gsisx(options, A, perm_c, perm_r, etree, equed, R, C, L, \ - U, work, lwork, B, X, recip_pivot_growth, rcond, \ - &mem_usage, stats, info); \ - return mem_usage.for_lu; /* bytes used by the factor storage */ \ - } - -DECL_GSISX(s,float,float) -DECL_GSISX(c,float,std::complex) -DECL_GSISX(d,double,double) -DECL_GSISX(z,double,std::complex) - -#endif - -template -struct SluMatrixMapHelper; - -/** \internal - * - * A wrapper class for SuperLU matrices. It supports only compressed sparse matrices - * and dense matrices. Supernodal and other fancy format are not supported by this wrapper. - * - * This wrapper class mainly aims to avoids the need of dynamic allocation of the storage structure. - */ -struct SluMatrix : SuperMatrix -{ - SluMatrix() - { - Store = &storage; - } - - SluMatrix(const SluMatrix& other) - : SuperMatrix(other) - { - Store = &storage; - storage = other.storage; - } - - SluMatrix& operator=(const SluMatrix& other) - { - SuperMatrix::operator=(static_cast(other)); - Store = &storage; - storage = other.storage; - return *this; - } - - struct - { - union {int nnz;int lda;}; - void *values; - int *innerInd; - int *outerInd; - } storage; - - void setStorageType(Stype_t t) - { - Stype = t; - if (t==SLU_NC || t==SLU_NR || t==SLU_DN) - Store = &storage; - else - { - eigen_assert(false && "storage type not supported"); - Store = 0; - } - } - - template - void setScalarType() - { - if (internal::is_same::value) - Dtype = SLU_S; - else if (internal::is_same::value) - Dtype = SLU_D; - else if (internal::is_same >::value) - Dtype = SLU_C; - else if (internal::is_same >::value) - Dtype = SLU_Z; - else - { - eigen_assert(false && "Scalar type not supported by SuperLU"); - } - } - - template - static SluMatrix Map(MatrixBase& _mat) - { - MatrixType& mat(_mat.derived()); - eigen_assert( ((MatrixType::Flags&RowMajorBit)!=RowMajorBit) && "row-major dense matrices are not supported by SuperLU"); - SluMatrix res; - res.setStorageType(SLU_DN); - res.setScalarType(); - res.Mtype = SLU_GE; - - res.nrow = internal::convert_index(mat.rows()); - res.ncol = internal::convert_index(mat.cols()); - - res.storage.lda = internal::convert_index(MatrixType::IsVectorAtCompileTime ? mat.size() : mat.outerStride()); - res.storage.values = (void*)(mat.data()); - return res; - } - - template - static SluMatrix Map(SparseMatrixBase& a_mat) - { - MatrixType &mat(a_mat.derived()); - SluMatrix res; - if ((MatrixType::Flags&RowMajorBit)==RowMajorBit) - { - res.setStorageType(SLU_NR); - res.nrow = internal::convert_index(mat.cols()); - res.ncol = internal::convert_index(mat.rows()); - } - else - { - res.setStorageType(SLU_NC); - res.nrow = internal::convert_index(mat.rows()); - res.ncol = internal::convert_index(mat.cols()); - } - - res.Mtype = SLU_GE; - - res.storage.nnz = internal::convert_index(mat.nonZeros()); - res.storage.values = mat.valuePtr(); - res.storage.innerInd = mat.innerIndexPtr(); - res.storage.outerInd = mat.outerIndexPtr(); - - res.setScalarType(); - - // FIXME the following is not very accurate - if (MatrixType::Flags & Upper) - res.Mtype = SLU_TRU; - if (MatrixType::Flags & Lower) - res.Mtype = SLU_TRL; - - eigen_assert(((MatrixType::Flags & SelfAdjoint)==0) && "SelfAdjoint matrix shape not supported by SuperLU"); - - return res; - } -}; - -template -struct SluMatrixMapHelper > -{ - typedef Matrix MatrixType; - static void run(MatrixType& mat, SluMatrix& res) - { - eigen_assert( ((Options&RowMajor)!=RowMajor) && "row-major dense matrices is not supported by SuperLU"); - res.setStorageType(SLU_DN); - res.setScalarType(); - res.Mtype = SLU_GE; - - res.nrow = mat.rows(); - res.ncol = mat.cols(); - - res.storage.lda = mat.outerStride(); - res.storage.values = mat.data(); - } -}; - -template -struct SluMatrixMapHelper > -{ - typedef Derived MatrixType; - static void run(MatrixType& mat, SluMatrix& res) - { - if ((MatrixType::Flags&RowMajorBit)==RowMajorBit) - { - res.setStorageType(SLU_NR); - res.nrow = mat.cols(); - res.ncol = mat.rows(); - } - else - { - res.setStorageType(SLU_NC); - res.nrow = mat.rows(); - res.ncol = mat.cols(); - } - - res.Mtype = SLU_GE; - - res.storage.nnz = mat.nonZeros(); - res.storage.values = mat.valuePtr(); - res.storage.innerInd = mat.innerIndexPtr(); - res.storage.outerInd = mat.outerIndexPtr(); - - res.setScalarType(); - - // FIXME the following is not very accurate - if (MatrixType::Flags & Upper) - res.Mtype = SLU_TRU; - if (MatrixType::Flags & Lower) - res.Mtype = SLU_TRL; - - eigen_assert(((MatrixType::Flags & SelfAdjoint)==0) && "SelfAdjoint matrix shape not supported by SuperLU"); - } -}; - -namespace internal { - -template -SluMatrix asSluMatrix(MatrixType& mat) -{ - return SluMatrix::Map(mat); -} - -/** View a Super LU matrix as an Eigen expression */ -template -MappedSparseMatrix map_superlu(SluMatrix& sluMat) -{ - eigen_assert((Flags&RowMajor)==RowMajor && sluMat.Stype == SLU_NR - || (Flags&ColMajor)==ColMajor && sluMat.Stype == SLU_NC); - - Index outerSize = (Flags&RowMajor)==RowMajor ? sluMat.ncol : sluMat.nrow; - - return MappedSparseMatrix( - sluMat.nrow, sluMat.ncol, sluMat.storage.outerInd[outerSize], - sluMat.storage.outerInd, sluMat.storage.innerInd, reinterpret_cast(sluMat.storage.values) ); -} - -} // end namespace internal - -/** \ingroup SuperLUSupport_Module - * \class SuperLUBase - * \brief The base class for the direct and incomplete LU factorization of SuperLU - */ -template -class SuperLUBase : public SparseSolverBase -{ - protected: - typedef SparseSolverBase Base; - using Base::derived; - using Base::m_isInitialized; - public: - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Matrix Vector; - typedef Matrix IntRowVectorType; - typedef Matrix IntColVectorType; - typedef Map > PermutationMap; - typedef SparseMatrix LUMatrixType; - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - - SuperLUBase() {} - - ~SuperLUBase() - { - clearFactors(); - } - - inline Index rows() const { return m_matrix.rows(); } - inline Index cols() const { return m_matrix.cols(); } - - /** \returns a reference to the Super LU option object to configure the Super LU algorithms. */ - inline superlu_options_t& options() { return m_sluOptions; } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the matrix.appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - /** Computes the sparse Cholesky decomposition of \a matrix */ - void compute(const MatrixType& matrix) - { - derived().analyzePattern(matrix); - derived().factorize(matrix); - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - void analyzePattern(const MatrixType& /*matrix*/) - { - m_isInitialized = true; - m_info = Success; - m_analysisIsOk = true; - m_factorizationIsOk = false; - } - - template - void dumpMemory(Stream& /*s*/) - {} - - protected: - - void initFactorization(const MatrixType& a) - { - set_default_options(&this->m_sluOptions); - - const Index size = a.rows(); - m_matrix = a; - - m_sluA = internal::asSluMatrix(m_matrix); - clearFactors(); - - m_p.resize(size); - m_q.resize(size); - m_sluRscale.resize(size); - m_sluCscale.resize(size); - m_sluEtree.resize(size); - - // set empty B and X - m_sluB.setStorageType(SLU_DN); - m_sluB.setScalarType(); - m_sluB.Mtype = SLU_GE; - m_sluB.storage.values = 0; - m_sluB.nrow = 0; - m_sluB.ncol = 0; - m_sluB.storage.lda = internal::convert_index(size); - m_sluX = m_sluB; - - m_extractedDataAreDirty = true; - } - - void init() - { - m_info = InvalidInput; - m_isInitialized = false; - m_sluL.Store = 0; - m_sluU.Store = 0; - } - - void extractData() const; - - void clearFactors() - { - if(m_sluL.Store) - Destroy_SuperNode_Matrix(&m_sluL); - if(m_sluU.Store) - Destroy_CompCol_Matrix(&m_sluU); - - m_sluL.Store = 0; - m_sluU.Store = 0; - - memset(&m_sluL,0,sizeof m_sluL); - memset(&m_sluU,0,sizeof m_sluU); - } - - // cached data to reduce reallocation, etc. - mutable LUMatrixType m_l; - mutable LUMatrixType m_u; - mutable IntColVectorType m_p; - mutable IntRowVectorType m_q; - - mutable LUMatrixType m_matrix; // copy of the factorized matrix - mutable SluMatrix m_sluA; - mutable SuperMatrix m_sluL, m_sluU; - mutable SluMatrix m_sluB, m_sluX; - mutable SuperLUStat_t m_sluStat; - mutable superlu_options_t m_sluOptions; - mutable std::vector m_sluEtree; - mutable Matrix m_sluRscale, m_sluCscale; - mutable Matrix m_sluFerr, m_sluBerr; - mutable char m_sluEqued; - - mutable ComputationInfo m_info; - int m_factorizationIsOk; - int m_analysisIsOk; - mutable bool m_extractedDataAreDirty; - - private: - SuperLUBase(SuperLUBase& ) { } -}; - - -/** \ingroup SuperLUSupport_Module - * \class SuperLU - * \brief A sparse direct LU factorization and solver based on the SuperLU library - * - * This class allows to solve for A.X = B sparse linear problems via a direct LU factorization - * using the SuperLU library. The sparse matrix A must be squared and invertible. The vectors or matrices - * X and B can be either dense or sparse. - * - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * - * \warning This class is only for the 4.x versions of SuperLU. The 3.x and 5.x versions are not supported. - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SparseLU - */ -template -class SuperLU : public SuperLUBase<_MatrixType,SuperLU<_MatrixType> > -{ - public: - typedef SuperLUBase<_MatrixType,SuperLU> Base; - typedef _MatrixType MatrixType; - typedef typename Base::Scalar Scalar; - typedef typename Base::RealScalar RealScalar; - typedef typename Base::StorageIndex StorageIndex; - typedef typename Base::IntRowVectorType IntRowVectorType; - typedef typename Base::IntColVectorType IntColVectorType; - typedef typename Base::PermutationMap PermutationMap; - typedef typename Base::LUMatrixType LUMatrixType; - typedef TriangularView LMatrixType; - typedef TriangularView UMatrixType; - - public: - using Base::_solve_impl; - - SuperLU() : Base() { init(); } - - explicit SuperLU(const MatrixType& matrix) : Base() - { - init(); - Base::compute(matrix); - } - - ~SuperLU() - { - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - void analyzePattern(const MatrixType& matrix) - { - m_info = InvalidInput; - m_isInitialized = false; - Base::analyzePattern(matrix); - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed. - * - * \sa analyzePattern() - */ - void factorize(const MatrixType& matrix); - - /** \internal */ - template - void _solve_impl(const MatrixBase &b, MatrixBase &dest) const; - - inline const LMatrixType& matrixL() const - { - if (m_extractedDataAreDirty) this->extractData(); - return m_l; - } - - inline const UMatrixType& matrixU() const - { - if (m_extractedDataAreDirty) this->extractData(); - return m_u; - } - - inline const IntColVectorType& permutationP() const - { - if (m_extractedDataAreDirty) this->extractData(); - return m_p; - } - - inline const IntRowVectorType& permutationQ() const - { - if (m_extractedDataAreDirty) this->extractData(); - return m_q; - } - - Scalar determinant() const; - - protected: - - using Base::m_matrix; - using Base::m_sluOptions; - using Base::m_sluA; - using Base::m_sluB; - using Base::m_sluX; - using Base::m_p; - using Base::m_q; - using Base::m_sluEtree; - using Base::m_sluEqued; - using Base::m_sluRscale; - using Base::m_sluCscale; - using Base::m_sluL; - using Base::m_sluU; - using Base::m_sluStat; - using Base::m_sluFerr; - using Base::m_sluBerr; - using Base::m_l; - using Base::m_u; - - using Base::m_analysisIsOk; - using Base::m_factorizationIsOk; - using Base::m_extractedDataAreDirty; - using Base::m_isInitialized; - using Base::m_info; - - void init() - { - Base::init(); - - set_default_options(&this->m_sluOptions); - m_sluOptions.PrintStat = NO; - m_sluOptions.ConditionNumber = NO; - m_sluOptions.Trans = NOTRANS; - m_sluOptions.ColPerm = COLAMD; - } - - - private: - SuperLU(SuperLU& ) { } -}; - -template -void SuperLU::factorize(const MatrixType& a) -{ - eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); - if(!m_analysisIsOk) - { - m_info = InvalidInput; - return; - } - - this->initFactorization(a); - - m_sluOptions.ColPerm = COLAMD; - int info = 0; - RealScalar recip_pivot_growth, rcond; - RealScalar ferr, berr; - - StatInit(&m_sluStat); - SuperLU_gssvx(&m_sluOptions, &m_sluA, m_q.data(), m_p.data(), &m_sluEtree[0], - &m_sluEqued, &m_sluRscale[0], &m_sluCscale[0], - &m_sluL, &m_sluU, - NULL, 0, - &m_sluB, &m_sluX, - &recip_pivot_growth, &rcond, - &ferr, &berr, - &m_sluStat, &info, Scalar()); - StatFree(&m_sluStat); - - m_extractedDataAreDirty = true; - - // FIXME how to better check for errors ??? - m_info = info == 0 ? Success : NumericalIssue; - m_factorizationIsOk = true; -} - -template -template -void SuperLU::_solve_impl(const MatrixBase &b, MatrixBase& x) const -{ - eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()"); - - const Index size = m_matrix.rows(); - const Index rhsCols = b.cols(); - eigen_assert(size==b.rows()); - - m_sluOptions.Trans = NOTRANS; - m_sluOptions.Fact = FACTORED; - m_sluOptions.IterRefine = NOREFINE; - - - m_sluFerr.resize(rhsCols); - m_sluBerr.resize(rhsCols); - - Ref > b_ref(b); - Ref > x_ref(x); - - m_sluB = SluMatrix::Map(b_ref.const_cast_derived()); - m_sluX = SluMatrix::Map(x_ref.const_cast_derived()); - - typename Rhs::PlainObject b_cpy; - if(m_sluEqued!='N') - { - b_cpy = b; - m_sluB = SluMatrix::Map(b_cpy.const_cast_derived()); - } - - StatInit(&m_sluStat); - int info = 0; - RealScalar recip_pivot_growth, rcond; - SuperLU_gssvx(&m_sluOptions, &m_sluA, - m_q.data(), m_p.data(), - &m_sluEtree[0], &m_sluEqued, - &m_sluRscale[0], &m_sluCscale[0], - &m_sluL, &m_sluU, - NULL, 0, - &m_sluB, &m_sluX, - &recip_pivot_growth, &rcond, - &m_sluFerr[0], &m_sluBerr[0], - &m_sluStat, &info, Scalar()); - StatFree(&m_sluStat); - - if(x.derived().data() != x_ref.data()) - x = x_ref; - - m_info = info==0 ? Success : NumericalIssue; -} - -// the code of this extractData() function has been adapted from the SuperLU's Matlab support code, -// -// Copyright (c) 1994 by Xerox Corporation. All rights reserved. -// -// THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY -// EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK. -// -template -void SuperLUBase::extractData() const -{ - eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for extracting factors, you must first call either compute() or analyzePattern()/factorize()"); - if (m_extractedDataAreDirty) - { - int upper; - int fsupc, istart, nsupr; - int lastl = 0, lastu = 0; - SCformat *Lstore = static_cast(m_sluL.Store); - NCformat *Ustore = static_cast(m_sluU.Store); - Scalar *SNptr; - - const Index size = m_matrix.rows(); - m_l.resize(size,size); - m_l.resizeNonZeros(Lstore->nnz); - m_u.resize(size,size); - m_u.resizeNonZeros(Ustore->nnz); - - int* Lcol = m_l.outerIndexPtr(); - int* Lrow = m_l.innerIndexPtr(); - Scalar* Lval = m_l.valuePtr(); - - int* Ucol = m_u.outerIndexPtr(); - int* Urow = m_u.innerIndexPtr(); - Scalar* Uval = m_u.valuePtr(); - - Ucol[0] = 0; - Ucol[0] = 0; - - /* for each supernode */ - for (int k = 0; k <= Lstore->nsuper; ++k) - { - fsupc = L_FST_SUPC(k); - istart = L_SUB_START(fsupc); - nsupr = L_SUB_START(fsupc+1) - istart; - upper = 1; - - /* for each column in the supernode */ - for (int j = fsupc; j < L_FST_SUPC(k+1); ++j) - { - SNptr = &((Scalar*)Lstore->nzval)[L_NZ_START(j)]; - - /* Extract U */ - for (int i = U_NZ_START(j); i < U_NZ_START(j+1); ++i) - { - Uval[lastu] = ((Scalar*)Ustore->nzval)[i]; - /* Matlab doesn't like explicit zero. */ - if (Uval[lastu] != 0.0) - Urow[lastu++] = U_SUB(i); - } - for (int i = 0; i < upper; ++i) - { - /* upper triangle in the supernode */ - Uval[lastu] = SNptr[i]; - /* Matlab doesn't like explicit zero. */ - if (Uval[lastu] != 0.0) - Urow[lastu++] = L_SUB(istart+i); - } - Ucol[j+1] = lastu; - - /* Extract L */ - Lval[lastl] = 1.0; /* unit diagonal */ - Lrow[lastl++] = L_SUB(istart + upper - 1); - for (int i = upper; i < nsupr; ++i) - { - Lval[lastl] = SNptr[i]; - /* Matlab doesn't like explicit zero. */ - if (Lval[lastl] != 0.0) - Lrow[lastl++] = L_SUB(istart+i); - } - Lcol[j+1] = lastl; - - ++upper; - } /* for j ... */ - - } /* for k ... */ - - // squeeze the matrices : - m_l.resizeNonZeros(lastl); - m_u.resizeNonZeros(lastu); - - m_extractedDataAreDirty = false; - } -} - -template -typename SuperLU::Scalar SuperLU::determinant() const -{ - eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for computing the determinant, you must first call either compute() or analyzePattern()/factorize()"); - - if (m_extractedDataAreDirty) - this->extractData(); - - Scalar det = Scalar(1); - for (int j=0; j 0) - { - int lastId = m_u.outerIndexPtr()[j+1]-1; - eigen_assert(m_u.innerIndexPtr()[lastId]<=j); - if (m_u.innerIndexPtr()[lastId]==j) - det *= m_u.valuePtr()[lastId]; - } - } - if(PermutationMap(m_p.data(),m_p.size()).determinant()*PermutationMap(m_q.data(),m_q.size()).determinant()<0) - det = -det; - if(m_sluEqued!='N') - return det/m_sluRscale.prod()/m_sluCscale.prod(); - else - return det; -} - -#ifdef EIGEN_PARSED_BY_DOXYGEN -#define EIGEN_SUPERLU_HAS_ILU -#endif - -#ifdef EIGEN_SUPERLU_HAS_ILU - -/** \ingroup SuperLUSupport_Module - * \class SuperILU - * \brief A sparse direct \b incomplete LU factorization and solver based on the SuperLU library - * - * This class allows to solve for an approximate solution of A.X = B sparse linear problems via an incomplete LU factorization - * using the SuperLU library. This class is aimed to be used as a preconditioner of the iterative linear solvers. - * - * \warning This class is only for the 4.x versions of SuperLU. The 3.x and 5.x versions are not supported. - * - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class IncompleteLUT, class ConjugateGradient, class BiCGSTAB - */ - -template -class SuperILU : public SuperLUBase<_MatrixType,SuperILU<_MatrixType> > -{ - public: - typedef SuperLUBase<_MatrixType,SuperILU> Base; - typedef _MatrixType MatrixType; - typedef typename Base::Scalar Scalar; - typedef typename Base::RealScalar RealScalar; - - public: - using Base::_solve_impl; - - SuperILU() : Base() { init(); } - - SuperILU(const MatrixType& matrix) : Base() - { - init(); - Base::compute(matrix); - } - - ~SuperILU() - { - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize() - */ - void analyzePattern(const MatrixType& matrix) - { - Base::analyzePattern(matrix); - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed. - * - * \sa analyzePattern() - */ - void factorize(const MatrixType& matrix); - - #ifndef EIGEN_PARSED_BY_DOXYGEN - /** \internal */ - template - void _solve_impl(const MatrixBase &b, MatrixBase &dest) const; - #endif // EIGEN_PARSED_BY_DOXYGEN - - protected: - - using Base::m_matrix; - using Base::m_sluOptions; - using Base::m_sluA; - using Base::m_sluB; - using Base::m_sluX; - using Base::m_p; - using Base::m_q; - using Base::m_sluEtree; - using Base::m_sluEqued; - using Base::m_sluRscale; - using Base::m_sluCscale; - using Base::m_sluL; - using Base::m_sluU; - using Base::m_sluStat; - using Base::m_sluFerr; - using Base::m_sluBerr; - using Base::m_l; - using Base::m_u; - - using Base::m_analysisIsOk; - using Base::m_factorizationIsOk; - using Base::m_extractedDataAreDirty; - using Base::m_isInitialized; - using Base::m_info; - - void init() - { - Base::init(); - - ilu_set_default_options(&m_sluOptions); - m_sluOptions.PrintStat = NO; - m_sluOptions.ConditionNumber = NO; - m_sluOptions.Trans = NOTRANS; - m_sluOptions.ColPerm = MMD_AT_PLUS_A; - - // no attempt to preserve column sum - m_sluOptions.ILU_MILU = SILU; - // only basic ILU(k) support -- no direct control over memory consumption - // better to use ILU_DropRule = DROP_BASIC | DROP_AREA - // and set ILU_FillFactor to max memory growth - m_sluOptions.ILU_DropRule = DROP_BASIC; - m_sluOptions.ILU_DropTol = NumTraits::dummy_precision()*10; - } - - private: - SuperILU(SuperILU& ) { } -}; - -template -void SuperILU::factorize(const MatrixType& a) -{ - eigen_assert(m_analysisIsOk && "You must first call analyzePattern()"); - if(!m_analysisIsOk) - { - m_info = InvalidInput; - return; - } - - this->initFactorization(a); - - int info = 0; - RealScalar recip_pivot_growth, rcond; - - StatInit(&m_sluStat); - SuperLU_gsisx(&m_sluOptions, &m_sluA, m_q.data(), m_p.data(), &m_sluEtree[0], - &m_sluEqued, &m_sluRscale[0], &m_sluCscale[0], - &m_sluL, &m_sluU, - NULL, 0, - &m_sluB, &m_sluX, - &recip_pivot_growth, &rcond, - &m_sluStat, &info, Scalar()); - StatFree(&m_sluStat); - - // FIXME how to better check for errors ??? - m_info = info == 0 ? Success : NumericalIssue; - m_factorizationIsOk = true; -} - -#ifndef EIGEN_PARSED_BY_DOXYGEN -template -template -void SuperILU::_solve_impl(const MatrixBase &b, MatrixBase& x) const -{ - eigen_assert(m_factorizationIsOk && "The decomposition is not in a valid state for solving, you must first call either compute() or analyzePattern()/factorize()"); - - const int size = m_matrix.rows(); - const int rhsCols = b.cols(); - eigen_assert(size==b.rows()); - - m_sluOptions.Trans = NOTRANS; - m_sluOptions.Fact = FACTORED; - m_sluOptions.IterRefine = NOREFINE; - - m_sluFerr.resize(rhsCols); - m_sluBerr.resize(rhsCols); - - Ref > b_ref(b); - Ref > x_ref(x); - - m_sluB = SluMatrix::Map(b_ref.const_cast_derived()); - m_sluX = SluMatrix::Map(x_ref.const_cast_derived()); - - typename Rhs::PlainObject b_cpy; - if(m_sluEqued!='N') - { - b_cpy = b; - m_sluB = SluMatrix::Map(b_cpy.const_cast_derived()); - } - - int info = 0; - RealScalar recip_pivot_growth, rcond; - - StatInit(&m_sluStat); - SuperLU_gsisx(&m_sluOptions, &m_sluA, - m_q.data(), m_p.data(), - &m_sluEtree[0], &m_sluEqued, - &m_sluRscale[0], &m_sluCscale[0], - &m_sluL, &m_sluU, - NULL, 0, - &m_sluB, &m_sluX, - &recip_pivot_growth, &rcond, - &m_sluStat, &info, Scalar()); - StatFree(&m_sluStat); - - if(x.derived().data() != x_ref.data()) - x = x_ref; - - m_info = info==0 ? Success : NumericalIssue; -} -#endif - -#endif - -} // end namespace Eigen - -#endif // EIGEN_SUPERLUSUPPORT_H diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h deleted file mode 100644 index 9568cc1d5..000000000 --- a/Eigen/src/UmfPackSupport/UmfPackSupport.h +++ /dev/null @@ -1,506 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2011 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_UMFPACKSUPPORT_H -#define EIGEN_UMFPACKSUPPORT_H - -namespace Eigen { - -/* TODO extract L, extract U, compute det, etc... */ - -// generic double/complex wrapper functions: - - -inline void umfpack_defaults(double control[UMFPACK_CONTROL], double) -{ umfpack_di_defaults(control); } - -inline void umfpack_defaults(double control[UMFPACK_CONTROL], std::complex) -{ umfpack_zi_defaults(control); } - -inline void umfpack_report_info(double control[UMFPACK_CONTROL], double info[UMFPACK_INFO], double) -{ umfpack_di_report_info(control, info);} - -inline void umfpack_report_info(double control[UMFPACK_CONTROL], double info[UMFPACK_INFO], std::complex) -{ umfpack_zi_report_info(control, info);} - -inline void umfpack_report_status(double control[UMFPACK_CONTROL], int status, double) -{ umfpack_di_report_status(control, status);} - -inline void umfpack_report_status(double control[UMFPACK_CONTROL], int status, std::complex) -{ umfpack_zi_report_status(control, status);} - -inline void umfpack_report_control(double control[UMFPACK_CONTROL], double) -{ umfpack_di_report_control(control);} - -inline void umfpack_report_control(double control[UMFPACK_CONTROL], std::complex) -{ umfpack_zi_report_control(control);} - -inline void umfpack_free_numeric(void **Numeric, double) -{ umfpack_di_free_numeric(Numeric); *Numeric = 0; } - -inline void umfpack_free_numeric(void **Numeric, std::complex) -{ umfpack_zi_free_numeric(Numeric); *Numeric = 0; } - -inline void umfpack_free_symbolic(void **Symbolic, double) -{ umfpack_di_free_symbolic(Symbolic); *Symbolic = 0; } - -inline void umfpack_free_symbolic(void **Symbolic, std::complex) -{ umfpack_zi_free_symbolic(Symbolic); *Symbolic = 0; } - -inline int umfpack_symbolic(int n_row,int n_col, - const int Ap[], const int Ai[], const double Ax[], void **Symbolic, - const double Control [UMFPACK_CONTROL], double Info [UMFPACK_INFO]) -{ - return umfpack_di_symbolic(n_row,n_col,Ap,Ai,Ax,Symbolic,Control,Info); -} - -inline int umfpack_symbolic(int n_row,int n_col, - const int Ap[], const int Ai[], const std::complex Ax[], void **Symbolic, - const double Control [UMFPACK_CONTROL], double Info [UMFPACK_INFO]) -{ - return umfpack_zi_symbolic(n_row,n_col,Ap,Ai,&numext::real_ref(Ax[0]),0,Symbolic,Control,Info); -} - -inline int umfpack_numeric( const int Ap[], const int Ai[], const double Ax[], - void *Symbolic, void **Numeric, - const double Control[UMFPACK_CONTROL],double Info [UMFPACK_INFO]) -{ - return umfpack_di_numeric(Ap,Ai,Ax,Symbolic,Numeric,Control,Info); -} - -inline int umfpack_numeric( const int Ap[], const int Ai[], const std::complex Ax[], - void *Symbolic, void **Numeric, - const double Control[UMFPACK_CONTROL],double Info [UMFPACK_INFO]) -{ - return umfpack_zi_numeric(Ap,Ai,&numext::real_ref(Ax[0]),0,Symbolic,Numeric,Control,Info); -} - -inline int umfpack_solve( int sys, const int Ap[], const int Ai[], const double Ax[], - double X[], const double B[], void *Numeric, - const double Control[UMFPACK_CONTROL], double Info[UMFPACK_INFO]) -{ - return umfpack_di_solve(sys,Ap,Ai,Ax,X,B,Numeric,Control,Info); -} - -inline int umfpack_solve( int sys, const int Ap[], const int Ai[], const std::complex Ax[], - std::complex X[], const std::complex B[], void *Numeric, - const double Control[UMFPACK_CONTROL], double Info[UMFPACK_INFO]) -{ - return umfpack_zi_solve(sys,Ap,Ai,&numext::real_ref(Ax[0]),0,&numext::real_ref(X[0]),0,&numext::real_ref(B[0]),0,Numeric,Control,Info); -} - -inline int umfpack_get_lunz(int *lnz, int *unz, int *n_row, int *n_col, int *nz_udiag, void *Numeric, double) -{ - return umfpack_di_get_lunz(lnz,unz,n_row,n_col,nz_udiag,Numeric); -} - -inline int umfpack_get_lunz(int *lnz, int *unz, int *n_row, int *n_col, int *nz_udiag, void *Numeric, std::complex) -{ - return umfpack_zi_get_lunz(lnz,unz,n_row,n_col,nz_udiag,Numeric); -} - -inline int umfpack_get_numeric(int Lp[], int Lj[], double Lx[], int Up[], int Ui[], double Ux[], - int P[], int Q[], double Dx[], int *do_recip, double Rs[], void *Numeric) -{ - return umfpack_di_get_numeric(Lp,Lj,Lx,Up,Ui,Ux,P,Q,Dx,do_recip,Rs,Numeric); -} - -inline int umfpack_get_numeric(int Lp[], int Lj[], std::complex Lx[], int Up[], int Ui[], std::complex Ux[], - int P[], int Q[], std::complex Dx[], int *do_recip, double Rs[], void *Numeric) -{ - double& lx0_real = numext::real_ref(Lx[0]); - double& ux0_real = numext::real_ref(Ux[0]); - double& dx0_real = numext::real_ref(Dx[0]); - return umfpack_zi_get_numeric(Lp,Lj,Lx?&lx0_real:0,0,Up,Ui,Ux?&ux0_real:0,0,P,Q, - Dx?&dx0_real:0,0,do_recip,Rs,Numeric); -} - -inline int umfpack_get_determinant(double *Mx, double *Ex, void *NumericHandle, double User_Info [UMFPACK_INFO]) -{ - return umfpack_di_get_determinant(Mx,Ex,NumericHandle,User_Info); -} - -inline int umfpack_get_determinant(std::complex *Mx, double *Ex, void *NumericHandle, double User_Info [UMFPACK_INFO]) -{ - double& mx_real = numext::real_ref(*Mx); - return umfpack_zi_get_determinant(&mx_real,0,Ex,NumericHandle,User_Info); -} - - -/** \ingroup UmfPackSupport_Module - * \brief A sparse LU factorization and solver based on UmfPack - * - * This class allows to solve for A.X = B sparse linear problems via a LU factorization - * using the UmfPack library. The sparse matrix A must be squared and full rank. - * The vectors or matrices X and B can be either dense or sparse. - * - * \warning The input matrix A should be in a \b compressed and \b column-major form. - * Otherwise an expensive copy will be made. You can call the inexpensive makeCompressed() to get a compressed matrix. - * \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<> - * - * \implsparsesolverconcept - * - * \sa \ref TutorialSparseSolverConcept, class SparseLU - */ -template -class UmfPackLU : public SparseSolverBase > -{ - protected: - typedef SparseSolverBase > Base; - using Base::m_isInitialized; - public: - using Base::_solve_impl; - typedef _MatrixType MatrixType; - typedef typename MatrixType::Scalar Scalar; - typedef typename MatrixType::RealScalar RealScalar; - typedef typename MatrixType::StorageIndex StorageIndex; - typedef Matrix Vector; - typedef Matrix IntRowVectorType; - typedef Matrix IntColVectorType; - typedef SparseMatrix LUMatrixType; - typedef SparseMatrix UmfpackMatrixType; - typedef Ref UmfpackMatrixRef; - enum { - ColsAtCompileTime = MatrixType::ColsAtCompileTime, - MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime - }; - - public: - - typedef Array UmfpackControl; - typedef Array UmfpackInfo; - - UmfPackLU() - : m_dummy(0,0), mp_matrix(m_dummy) - { - init(); - } - - template - explicit UmfPackLU(const InputMatrixType& matrix) - : mp_matrix(matrix) - { - init(); - compute(matrix); - } - - ~UmfPackLU() - { - if(m_symbolic) umfpack_free_symbolic(&m_symbolic,Scalar()); - if(m_numeric) umfpack_free_numeric(&m_numeric,Scalar()); - } - - inline Index rows() const { return mp_matrix.rows(); } - inline Index cols() const { return mp_matrix.cols(); } - - /** \brief Reports whether previous computation was successful. - * - * \returns \c Success if computation was succesful, - * \c NumericalIssue if the matrix.appears to be negative. - */ - ComputationInfo info() const - { - eigen_assert(m_isInitialized && "Decomposition is not initialized."); - return m_info; - } - - inline const LUMatrixType& matrixL() const - { - if (m_extractedDataAreDirty) extractData(); - return m_l; - } - - inline const LUMatrixType& matrixU() const - { - if (m_extractedDataAreDirty) extractData(); - return m_u; - } - - inline const IntColVectorType& permutationP() const - { - if (m_extractedDataAreDirty) extractData(); - return m_p; - } - - inline const IntRowVectorType& permutationQ() const - { - if (m_extractedDataAreDirty) extractData(); - return m_q; - } - - /** Computes the sparse Cholesky decomposition of \a matrix - * Note that the matrix should be column-major, and in compressed format for best performance. - * \sa SparseMatrix::makeCompressed(). - */ - template - void compute(const InputMatrixType& matrix) - { - if(m_symbolic) umfpack_free_symbolic(&m_symbolic,Scalar()); - if(m_numeric) umfpack_free_numeric(&m_numeric,Scalar()); - grab(matrix.derived()); - analyzePattern_impl(); - factorize_impl(); - } - - /** Performs a symbolic decomposition on the sparcity of \a matrix. - * - * This function is particularly useful when solving for several problems having the same structure. - * - * \sa factorize(), compute() - */ - template - void analyzePattern(const InputMatrixType& matrix) - { - if(m_symbolic) umfpack_free_symbolic(&m_symbolic,Scalar()); - if(m_numeric) umfpack_free_numeric(&m_numeric,Scalar()); - - grab(matrix.derived()); - - analyzePattern_impl(); - } - - /** Provides the return status code returned by UmfPack during the numeric - * factorization. - * - * \sa factorize(), compute() - */ - inline int umfpackFactorizeReturncode() const - { - eigen_assert(m_numeric && "UmfPackLU: you must first call factorize()"); - return m_fact_errorCode; - } - - /** Provides access to the control settings array used by UmfPack. - * - * If this array contains NaN's, the default values are used. - * - * See UMFPACK documentation for details. - */ - inline const UmfpackControl& umfpackControl() const - { - return m_control; - } - - /** Provides access to the control settings array used by UmfPack. - * - * If this array contains NaN's, the default values are used. - * - * See UMFPACK documentation for details. - */ - inline UmfpackControl& umfpackControl() - { - return m_control; - } - - /** Performs a numeric decomposition of \a matrix - * - * The given matrix must has the same sparcity than the matrix on which the pattern anylysis has been performed. - * - * \sa analyzePattern(), compute() - */ - template - void factorize(const InputMatrixType& matrix) - { - eigen_assert(m_analysisIsOk && "UmfPackLU: you must first call analyzePattern()"); - if(m_numeric) - umfpack_free_numeric(&m_numeric,Scalar()); - - grab(matrix.derived()); - - factorize_impl(); - } - - /** Prints the current UmfPack control settings. - * - * \sa umfpackControl() - */ - void printUmfpackControl() - { - umfpack_report_control(m_control.data(), Scalar()); - } - - /** Prints statistics collected by UmfPack. - * - * \sa analyzePattern(), compute() - */ - void printUmfpackInfo() - { - eigen_assert(m_analysisIsOk && "UmfPackLU: you must first call analyzePattern()"); - umfpack_report_info(m_control.data(), m_umfpackInfo.data(), Scalar()); - } - - /** Prints the status of the previous factorization operation performed by UmfPack (symbolic or numerical factorization). - * - * \sa analyzePattern(), compute() - */ - void printUmfpackStatus() { - eigen_assert(m_analysisIsOk && "UmfPackLU: you must first call analyzePattern()"); - umfpack_report_status(m_control.data(), m_fact_errorCode, Scalar()); - } - - /** \internal */ - template - bool _solve_impl(const MatrixBase &b, MatrixBase &x) const; - - Scalar determinant() const; - - void extractData() const; - - protected: - - void init() - { - m_info = InvalidInput; - m_isInitialized = false; - m_numeric = 0; - m_symbolic = 0; - m_extractedDataAreDirty = true; - - umfpack_defaults(m_control.data(), Scalar()); - } - - void analyzePattern_impl() - { - m_fact_errorCode = umfpack_symbolic(internal::convert_index(mp_matrix.rows()), - internal::convert_index(mp_matrix.cols()), - mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), - &m_symbolic, m_control.data(), m_umfpackInfo.data()); - - m_isInitialized = true; - m_info = m_fact_errorCode ? InvalidInput : Success; - m_analysisIsOk = true; - m_factorizationIsOk = false; - m_extractedDataAreDirty = true; - } - - void factorize_impl() - { - - m_fact_errorCode = umfpack_numeric(mp_matrix.outerIndexPtr(), mp_matrix.innerIndexPtr(), mp_matrix.valuePtr(), - m_symbolic, &m_numeric, m_control.data(), m_umfpackInfo.data()); - - m_info = m_fact_errorCode == UMFPACK_OK ? Success : NumericalIssue; - m_factorizationIsOk = true; - m_extractedDataAreDirty = true; - } - - template - void grab(const EigenBase &A) - { - mp_matrix.~UmfpackMatrixRef(); - ::new (&mp_matrix) UmfpackMatrixRef(A.derived()); - } - - void grab(const UmfpackMatrixRef &A) - { - if(&(A.derived()) != &mp_matrix) - { - mp_matrix.~UmfpackMatrixRef(); - ::new (&mp_matrix) UmfpackMatrixRef(A); - } - } - - // cached data to reduce reallocation, etc. - mutable LUMatrixType m_l; - int m_fact_errorCode; - UmfpackControl m_control; - mutable UmfpackInfo m_umfpackInfo; - - mutable LUMatrixType m_u; - mutable IntColVectorType m_p; - mutable IntRowVectorType m_q; - - UmfpackMatrixType m_dummy; - UmfpackMatrixRef mp_matrix; - - void* m_numeric; - void* m_symbolic; - - mutable ComputationInfo m_info; - int m_factorizationIsOk; - int m_analysisIsOk; - mutable bool m_extractedDataAreDirty; - - private: - UmfPackLU(const UmfPackLU& ) { } -}; - - -template -void UmfPackLU::extractData() const -{ - if (m_extractedDataAreDirty) - { - // get size of the data - int lnz, unz, rows, cols, nz_udiag; - umfpack_get_lunz(&lnz, &unz, &rows, &cols, &nz_udiag, m_numeric, Scalar()); - - // allocate data - m_l.resize(rows,(std::min)(rows,cols)); - m_l.resizeNonZeros(lnz); - - m_u.resize((std::min)(rows,cols),cols); - m_u.resizeNonZeros(unz); - - m_p.resize(rows); - m_q.resize(cols); - - // extract - umfpack_get_numeric(m_l.outerIndexPtr(), m_l.innerIndexPtr(), m_l.valuePtr(), - m_u.outerIndexPtr(), m_u.innerIndexPtr(), m_u.valuePtr(), - m_p.data(), m_q.data(), 0, 0, 0, m_numeric); - - m_extractedDataAreDirty = false; - } -} - -template -typename UmfPackLU::Scalar UmfPackLU::determinant() const -{ - Scalar det; - umfpack_get_determinant(&det, 0, m_numeric, 0); - return det; -} - -template -template -bool UmfPackLU::_solve_impl(const MatrixBase &b, MatrixBase &x) const -{ - Index rhsCols = b.cols(); - eigen_assert((BDerived::Flags&RowMajorBit)==0 && "UmfPackLU backend does not support non col-major rhs yet"); - eigen_assert((XDerived::Flags&RowMajorBit)==0 && "UmfPackLU backend does not support non col-major result yet"); - eigen_assert(b.derived().data() != x.derived().data() && " Umfpack does not support inplace solve"); - - int errorCode; - Scalar* x_ptr = 0; - Matrix x_tmp; - if(x.innerStride()!=1) - { - x_tmp.resize(x.rows()); - x_ptr = x_tmp.data(); - } - for (int j=0; j -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MISC_IMAGE_H -#define EIGEN_MISC_IMAGE_H - -namespace Eigen { - -namespace internal { - -/** \class image_retval_base - * - */ -template -struct traits > -{ - typedef typename DecompositionType::MatrixType MatrixType; - typedef Matrix< - typename MatrixType::Scalar, - MatrixType::RowsAtCompileTime, // the image is a subspace of the destination space, whose - // dimension is the number of rows of the original matrix - Dynamic, // we don't know at compile time the dimension of the image (the rank) - MatrixType::Options, - MatrixType::MaxRowsAtCompileTime, // the image matrix will consist of columns from the original matrix, - MatrixType::MaxColsAtCompileTime // so it has the same number of rows and at most as many columns. - > ReturnType; -}; - -template struct image_retval_base - : public ReturnByValue > -{ - typedef _DecompositionType DecompositionType; - typedef typename DecompositionType::MatrixType MatrixType; - typedef ReturnByValue Base; - - image_retval_base(const DecompositionType& dec, const MatrixType& originalMatrix) - : m_dec(dec), m_rank(dec.rank()), - m_cols(m_rank == 0 ? 1 : m_rank), - m_originalMatrix(originalMatrix) - {} - - inline Index rows() const { return m_dec.rows(); } - inline Index cols() const { return m_cols; } - inline Index rank() const { return m_rank; } - inline const DecompositionType& dec() const { return m_dec; } - inline const MatrixType& originalMatrix() const { return m_originalMatrix; } - - template inline void evalTo(Dest& dst) const - { - static_cast*>(this)->evalTo(dst); - } - - protected: - const DecompositionType& m_dec; - Index m_rank, m_cols; - const MatrixType& m_originalMatrix; -}; - -} // end namespace internal - -#define EIGEN_MAKE_IMAGE_HELPERS(DecompositionType) \ - typedef typename DecompositionType::MatrixType MatrixType; \ - typedef typename MatrixType::Scalar Scalar; \ - typedef typename MatrixType::RealScalar RealScalar; \ - typedef Eigen::internal::image_retval_base Base; \ - using Base::dec; \ - using Base::originalMatrix; \ - using Base::rank; \ - using Base::rows; \ - using Base::cols; \ - image_retval(const DecompositionType& dec, const MatrixType& originalMatrix) \ - : Base(dec, originalMatrix) {} - -} // end namespace Eigen - -#endif // EIGEN_MISC_IMAGE_H diff --git a/Eigen/src/misc/Kernel.h b/Eigen/src/misc/Kernel.h deleted file mode 100644 index bef5d6ff5..000000000 --- a/Eigen/src/misc/Kernel.h +++ /dev/null @@ -1,79 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_MISC_KERNEL_H -#define EIGEN_MISC_KERNEL_H - -namespace Eigen { - -namespace internal { - -/** \class kernel_retval_base - * - */ -template -struct traits > -{ - typedef typename DecompositionType::MatrixType MatrixType; - typedef Matrix< - typename MatrixType::Scalar, - MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix" - // is the number of cols of the original matrix - // so that the product "matrix * kernel = zero" makes sense - Dynamic, // we don't know at compile-time the dimension of the kernel - MatrixType::Options, - MatrixType::MaxColsAtCompileTime, // see explanation for 2nd template parameter - MatrixType::MaxColsAtCompileTime // the kernel is a subspace of the domain space, - // whose dimension is the number of columns of the original matrix - > ReturnType; -}; - -template struct kernel_retval_base - : public ReturnByValue > -{ - typedef _DecompositionType DecompositionType; - typedef ReturnByValue Base; - - explicit kernel_retval_base(const DecompositionType& dec) - : m_dec(dec), - m_rank(dec.rank()), - m_cols(m_rank==dec.cols() ? 1 : dec.cols() - m_rank) - {} - - inline Index rows() const { return m_dec.cols(); } - inline Index cols() const { return m_cols; } - inline Index rank() const { return m_rank; } - inline const DecompositionType& dec() const { return m_dec; } - - template inline void evalTo(Dest& dst) const - { - static_cast*>(this)->evalTo(dst); - } - - protected: - const DecompositionType& m_dec; - Index m_rank, m_cols; -}; - -} // end namespace internal - -#define EIGEN_MAKE_KERNEL_HELPERS(DecompositionType) \ - typedef typename DecompositionType::MatrixType MatrixType; \ - typedef typename MatrixType::Scalar Scalar; \ - typedef typename MatrixType::RealScalar RealScalar; \ - typedef Eigen::internal::kernel_retval_base Base; \ - using Base::dec; \ - using Base::rank; \ - using Base::rows; \ - using Base::cols; \ - kernel_retval(const DecompositionType& dec) : Base(dec) {} - -} // end namespace Eigen - -#endif // EIGEN_MISC_KERNEL_H diff --git a/Eigen/src/misc/RealSvd2x2.h b/Eigen/src/misc/RealSvd2x2.h deleted file mode 100644 index abb4d3c2f..000000000 --- a/Eigen/src/misc/RealSvd2x2.h +++ /dev/null @@ -1,55 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2009-2010 Benoit Jacob -// Copyright (C) 2013-2016 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_REALSVD2X2_H -#define EIGEN_REALSVD2X2_H - -namespace Eigen { - -namespace internal { - -template -void real_2x2_jacobi_svd(const MatrixType& matrix, Index p, Index q, - JacobiRotation *j_left, - JacobiRotation *j_right) -{ - using std::sqrt; - using std::abs; - Matrix m; - m << numext::real(matrix.coeff(p,p)), numext::real(matrix.coeff(p,q)), - numext::real(matrix.coeff(q,p)), numext::real(matrix.coeff(q,q)); - JacobiRotation rot1; - RealScalar t = m.coeff(0,0) + m.coeff(1,1); - RealScalar d = m.coeff(1,0) - m.coeff(0,1); - - if(abs(d) < (std::numeric_limits::min)()) - { - rot1.s() = RealScalar(0); - rot1.c() = RealScalar(1); - } - else - { - // If d!=0, then t/d cannot overflow because the magnitude of the - // entries forming d are not too small compared to the ones forming t. - RealScalar u = t / d; - RealScalar tmp = sqrt(RealScalar(1) + numext::abs2(u)); - rot1.s() = RealScalar(1) / tmp; - rot1.c() = u / tmp; - } - m.applyOnTheLeft(0,1,rot1); - j_right->makeJacobi(m,0,1); - *j_left = rot1 * j_right->transpose(); -} - -} // end namespace internal - -} // end namespace Eigen - -#endif // EIGEN_REALSVD2X2_H diff --git a/Eigen/src/misc/blas.h b/Eigen/src/misc/blas.h deleted file mode 100644 index 25215b15e..000000000 --- a/Eigen/src/misc/blas.h +++ /dev/null @@ -1,440 +0,0 @@ -#ifndef BLAS_H -#define BLAS_H - -#ifdef __cplusplus -extern "C" -{ -#endif - -#define BLASFUNC(FUNC) FUNC##_ - -#ifdef __WIN64__ -typedef long long BLASLONG; -typedef unsigned long long BLASULONG; -#else -typedef long BLASLONG; -typedef unsigned long BLASULONG; -#endif - -int BLASFUNC(xerbla)(const char *, int *info, int); - -float BLASFUNC(sdot) (int *, float *, int *, float *, int *); -float BLASFUNC(sdsdot)(int *, float *, float *, int *, float *, int *); - -double BLASFUNC(dsdot) (int *, float *, int *, float *, int *); -double BLASFUNC(ddot) (int *, double *, int *, double *, int *); -double BLASFUNC(qdot) (int *, double *, int *, double *, int *); - -int BLASFUNC(cdotuw) (int *, float *, int *, float *, int *, float*); -int BLASFUNC(cdotcw) (int *, float *, int *, float *, int *, float*); -int BLASFUNC(zdotuw) (int *, double *, int *, double *, int *, double*); -int BLASFUNC(zdotcw) (int *, double *, int *, double *, int *, double*); - -int BLASFUNC(saxpy) (const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(daxpy) (const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(qaxpy) (const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(caxpy) (const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(zaxpy) (const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(xaxpy) (const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(caxpyc)(const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(zaxpyc)(const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(xaxpyc)(const int *, const double *, const double *, const int *, double *, const int *); - -int BLASFUNC(scopy) (int *, float *, int *, float *, int *); -int BLASFUNC(dcopy) (int *, double *, int *, double *, int *); -int BLASFUNC(qcopy) (int *, double *, int *, double *, int *); -int BLASFUNC(ccopy) (int *, float *, int *, float *, int *); -int BLASFUNC(zcopy) (int *, double *, int *, double *, int *); -int BLASFUNC(xcopy) (int *, double *, int *, double *, int *); - -int BLASFUNC(sswap) (int *, float *, int *, float *, int *); -int BLASFUNC(dswap) (int *, double *, int *, double *, int *); -int BLASFUNC(qswap) (int *, double *, int *, double *, int *); -int BLASFUNC(cswap) (int *, float *, int *, float *, int *); -int BLASFUNC(zswap) (int *, double *, int *, double *, int *); -int BLASFUNC(xswap) (int *, double *, int *, double *, int *); - -float BLASFUNC(sasum) (int *, float *, int *); -float BLASFUNC(scasum)(int *, float *, int *); -double BLASFUNC(dasum) (int *, double *, int *); -double BLASFUNC(qasum) (int *, double *, int *); -double BLASFUNC(dzasum)(int *, double *, int *); -double BLASFUNC(qxasum)(int *, double *, int *); - -int BLASFUNC(isamax)(int *, float *, int *); -int BLASFUNC(idamax)(int *, double *, int *); -int BLASFUNC(iqamax)(int *, double *, int *); -int BLASFUNC(icamax)(int *, float *, int *); -int BLASFUNC(izamax)(int *, double *, int *); -int BLASFUNC(ixamax)(int *, double *, int *); - -int BLASFUNC(ismax) (int *, float *, int *); -int BLASFUNC(idmax) (int *, double *, int *); -int BLASFUNC(iqmax) (int *, double *, int *); -int BLASFUNC(icmax) (int *, float *, int *); -int BLASFUNC(izmax) (int *, double *, int *); -int BLASFUNC(ixmax) (int *, double *, int *); - -int BLASFUNC(isamin)(int *, float *, int *); -int BLASFUNC(idamin)(int *, double *, int *); -int BLASFUNC(iqamin)(int *, double *, int *); -int BLASFUNC(icamin)(int *, float *, int *); -int BLASFUNC(izamin)(int *, double *, int *); -int BLASFUNC(ixamin)(int *, double *, int *); - -int BLASFUNC(ismin)(int *, float *, int *); -int BLASFUNC(idmin)(int *, double *, int *); -int BLASFUNC(iqmin)(int *, double *, int *); -int BLASFUNC(icmin)(int *, float *, int *); -int BLASFUNC(izmin)(int *, double *, int *); -int BLASFUNC(ixmin)(int *, double *, int *); - -float BLASFUNC(samax) (int *, float *, int *); -double BLASFUNC(damax) (int *, double *, int *); -double BLASFUNC(qamax) (int *, double *, int *); -float BLASFUNC(scamax)(int *, float *, int *); -double BLASFUNC(dzamax)(int *, double *, int *); -double BLASFUNC(qxamax)(int *, double *, int *); - -float BLASFUNC(samin) (int *, float *, int *); -double BLASFUNC(damin) (int *, double *, int *); -double BLASFUNC(qamin) (int *, double *, int *); -float BLASFUNC(scamin)(int *, float *, int *); -double BLASFUNC(dzamin)(int *, double *, int *); -double BLASFUNC(qxamin)(int *, double *, int *); - -float BLASFUNC(smax) (int *, float *, int *); -double BLASFUNC(dmax) (int *, double *, int *); -double BLASFUNC(qmax) (int *, double *, int *); -float BLASFUNC(scmax) (int *, float *, int *); -double BLASFUNC(dzmax) (int *, double *, int *); -double BLASFUNC(qxmax) (int *, double *, int *); - -float BLASFUNC(smin) (int *, float *, int *); -double BLASFUNC(dmin) (int *, double *, int *); -double BLASFUNC(qmin) (int *, double *, int *); -float BLASFUNC(scmin) (int *, float *, int *); -double BLASFUNC(dzmin) (int *, double *, int *); -double BLASFUNC(qxmin) (int *, double *, int *); - -int BLASFUNC(sscal) (int *, float *, float *, int *); -int BLASFUNC(dscal) (int *, double *, double *, int *); -int BLASFUNC(qscal) (int *, double *, double *, int *); -int BLASFUNC(cscal) (int *, float *, float *, int *); -int BLASFUNC(zscal) (int *, double *, double *, int *); -int BLASFUNC(xscal) (int *, double *, double *, int *); -int BLASFUNC(csscal)(int *, float *, float *, int *); -int BLASFUNC(zdscal)(int *, double *, double *, int *); -int BLASFUNC(xqscal)(int *, double *, double *, int *); - -float BLASFUNC(snrm2) (int *, float *, int *); -float BLASFUNC(scnrm2)(int *, float *, int *); - -double BLASFUNC(dnrm2) (int *, double *, int *); -double BLASFUNC(qnrm2) (int *, double *, int *); -double BLASFUNC(dznrm2)(int *, double *, int *); -double BLASFUNC(qxnrm2)(int *, double *, int *); - -int BLASFUNC(srot) (int *, float *, int *, float *, int *, float *, float *); -int BLASFUNC(drot) (int *, double *, int *, double *, int *, double *, double *); -int BLASFUNC(qrot) (int *, double *, int *, double *, int *, double *, double *); -int BLASFUNC(csrot) (int *, float *, int *, float *, int *, float *, float *); -int BLASFUNC(zdrot) (int *, double *, int *, double *, int *, double *, double *); -int BLASFUNC(xqrot) (int *, double *, int *, double *, int *, double *, double *); - -int BLASFUNC(srotg) (float *, float *, float *, float *); -int BLASFUNC(drotg) (double *, double *, double *, double *); -int BLASFUNC(qrotg) (double *, double *, double *, double *); -int BLASFUNC(crotg) (float *, float *, float *, float *); -int BLASFUNC(zrotg) (double *, double *, double *, double *); -int BLASFUNC(xrotg) (double *, double *, double *, double *); - -int BLASFUNC(srotmg)(float *, float *, float *, float *, float *); -int BLASFUNC(drotmg)(double *, double *, double *, double *, double *); - -int BLASFUNC(srotm) (int *, float *, int *, float *, int *, float *); -int BLASFUNC(drotm) (int *, double *, int *, double *, int *, double *); -int BLASFUNC(qrotm) (int *, double *, int *, double *, int *, double *); - -/* Level 2 routines */ - -int BLASFUNC(sger)(int *, int *, float *, float *, int *, - float *, int *, float *, int *); -int BLASFUNC(dger)(int *, int *, double *, double *, int *, - double *, int *, double *, int *); -int BLASFUNC(qger)(int *, int *, double *, double *, int *, - double *, int *, double *, int *); -int BLASFUNC(cgeru)(int *, int *, float *, float *, int *, - float *, int *, float *, int *); -int BLASFUNC(cgerc)(int *, int *, float *, float *, int *, - float *, int *, float *, int *); -int BLASFUNC(zgeru)(int *, int *, double *, double *, int *, - double *, int *, double *, int *); -int BLASFUNC(zgerc)(int *, int *, double *, double *, int *, - double *, int *, double *, int *); -int BLASFUNC(xgeru)(int *, int *, double *, double *, int *, - double *, int *, double *, int *); -int BLASFUNC(xgerc)(int *, int *, double *, double *, int *, - double *, int *, double *, int *); - -int BLASFUNC(sgemv)(const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(dgemv)(const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(qgemv)(const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(cgemv)(const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zgemv)(const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xgemv)(const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(strsv) (const char *, const char *, const char *, const int *, const float *, const int *, float *, const int *); -int BLASFUNC(dtrsv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(qtrsv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(ctrsv) (const char *, const char *, const char *, const int *, const float *, const int *, float *, const int *); -int BLASFUNC(ztrsv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(xtrsv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); - -int BLASFUNC(stpsv) (char *, char *, char *, int *, float *, float *, int *); -int BLASFUNC(dtpsv) (char *, char *, char *, int *, double *, double *, int *); -int BLASFUNC(qtpsv) (char *, char *, char *, int *, double *, double *, int *); -int BLASFUNC(ctpsv) (char *, char *, char *, int *, float *, float *, int *); -int BLASFUNC(ztpsv) (char *, char *, char *, int *, double *, double *, int *); -int BLASFUNC(xtpsv) (char *, char *, char *, int *, double *, double *, int *); - -int BLASFUNC(strmv) (const char *, const char *, const char *, const int *, const float *, const int *, float *, const int *); -int BLASFUNC(dtrmv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(qtrmv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(ctrmv) (const char *, const char *, const char *, const int *, const float *, const int *, float *, const int *); -int BLASFUNC(ztrmv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(xtrmv) (const char *, const char *, const char *, const int *, const double *, const int *, double *, const int *); - -int BLASFUNC(stpmv) (char *, char *, char *, int *, float *, float *, int *); -int BLASFUNC(dtpmv) (char *, char *, char *, int *, double *, double *, int *); -int BLASFUNC(qtpmv) (char *, char *, char *, int *, double *, double *, int *); -int BLASFUNC(ctpmv) (char *, char *, char *, int *, float *, float *, int *); -int BLASFUNC(ztpmv) (char *, char *, char *, int *, double *, double *, int *); -int BLASFUNC(xtpmv) (char *, char *, char *, int *, double *, double *, int *); - -int BLASFUNC(stbmv) (char *, char *, char *, int *, int *, float *, int *, float *, int *); -int BLASFUNC(dtbmv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); -int BLASFUNC(qtbmv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); -int BLASFUNC(ctbmv) (char *, char *, char *, int *, int *, float *, int *, float *, int *); -int BLASFUNC(ztbmv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); -int BLASFUNC(xtbmv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); - -int BLASFUNC(stbsv) (char *, char *, char *, int *, int *, float *, int *, float *, int *); -int BLASFUNC(dtbsv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); -int BLASFUNC(qtbsv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); -int BLASFUNC(ctbsv) (char *, char *, char *, int *, int *, float *, int *, float *, int *); -int BLASFUNC(ztbsv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); -int BLASFUNC(xtbsv) (char *, char *, char *, int *, int *, double *, int *, double *, int *); - -int BLASFUNC(ssymv) (const char *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(dsymv) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(qsymv) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(sspmv) (char *, int *, float *, float *, - float *, int *, float *, float *, int *); -int BLASFUNC(dspmv) (char *, int *, double *, double *, - double *, int *, double *, double *, int *); -int BLASFUNC(qspmv) (char *, int *, double *, double *, - double *, int *, double *, double *, int *); - -int BLASFUNC(ssyr) (const char *, const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(dsyr) (const char *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(qsyr) (const char *, const int *, const double *, const double *, const int *, double *, const int *); - -int BLASFUNC(ssyr2) (const char *, const int *, const float *, const float *, const int *, const float *, const int *, float *, const int *); -int BLASFUNC(dsyr2) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(qsyr2) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(csyr2) (const char *, const int *, const float *, const float *, const int *, const float *, const int *, float *, const int *); -int BLASFUNC(zsyr2) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, double *, const int *); -int BLASFUNC(xsyr2) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, double *, const int *); - -int BLASFUNC(sspr) (char *, int *, float *, float *, int *, - float *); -int BLASFUNC(dspr) (char *, int *, double *, double *, int *, - double *); -int BLASFUNC(qspr) (char *, int *, double *, double *, int *, - double *); - -int BLASFUNC(sspr2) (char *, int *, float *, - float *, int *, float *, int *, float *); -int BLASFUNC(dspr2) (char *, int *, double *, - double *, int *, double *, int *, double *); -int BLASFUNC(qspr2) (char *, int *, double *, - double *, int *, double *, int *, double *); -int BLASFUNC(cspr2) (char *, int *, float *, - float *, int *, float *, int *, float *); -int BLASFUNC(zspr2) (char *, int *, double *, - double *, int *, double *, int *, double *); -int BLASFUNC(xspr2) (char *, int *, double *, - double *, int *, double *, int *, double *); - -int BLASFUNC(cher) (char *, int *, float *, float *, int *, - float *, int *); -int BLASFUNC(zher) (char *, int *, double *, double *, int *, - double *, int *); -int BLASFUNC(xher) (char *, int *, double *, double *, int *, - double *, int *); - -int BLASFUNC(chpr) (char *, int *, float *, float *, int *, float *); -int BLASFUNC(zhpr) (char *, int *, double *, double *, int *, double *); -int BLASFUNC(xhpr) (char *, int *, double *, double *, int *, double *); - -int BLASFUNC(cher2) (char *, int *, float *, - float *, int *, float *, int *, float *, int *); -int BLASFUNC(zher2) (char *, int *, double *, - double *, int *, double *, int *, double *, int *); -int BLASFUNC(xher2) (char *, int *, double *, - double *, int *, double *, int *, double *, int *); - -int BLASFUNC(chpr2) (char *, int *, float *, - float *, int *, float *, int *, float *); -int BLASFUNC(zhpr2) (char *, int *, double *, - double *, int *, double *, int *, double *); -int BLASFUNC(xhpr2) (char *, int *, double *, - double *, int *, double *, int *, double *); - -int BLASFUNC(chemv) (const char *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zhemv) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xhemv) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(chpmv) (char *, int *, float *, float *, - float *, int *, float *, float *, int *); -int BLASFUNC(zhpmv) (char *, int *, double *, double *, - double *, int *, double *, double *, int *); -int BLASFUNC(xhpmv) (char *, int *, double *, double *, - double *, int *, double *, double *, int *); - -int BLASFUNC(snorm)(char *, int *, int *, float *, int *); -int BLASFUNC(dnorm)(char *, int *, int *, double *, int *); -int BLASFUNC(cnorm)(char *, int *, int *, float *, int *); -int BLASFUNC(znorm)(char *, int *, int *, double *, int *); - -int BLASFUNC(sgbmv)(char *, int *, int *, int *, int *, float *, float *, int *, - float *, int *, float *, float *, int *); -int BLASFUNC(dgbmv)(char *, int *, int *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(qgbmv)(char *, int *, int *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(cgbmv)(char *, int *, int *, int *, int *, float *, float *, int *, - float *, int *, float *, float *, int *); -int BLASFUNC(zgbmv)(char *, int *, int *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(xgbmv)(char *, int *, int *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); - -int BLASFUNC(ssbmv)(char *, int *, int *, float *, float *, int *, - float *, int *, float *, float *, int *); -int BLASFUNC(dsbmv)(char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(qsbmv)(char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(csbmv)(char *, int *, int *, float *, float *, int *, - float *, int *, float *, float *, int *); -int BLASFUNC(zsbmv)(char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(xsbmv)(char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); - -int BLASFUNC(chbmv)(char *, int *, int *, float *, float *, int *, - float *, int *, float *, float *, int *); -int BLASFUNC(zhbmv)(char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(xhbmv)(char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); - -/* Level 3 routines */ - -int BLASFUNC(sgemm)(const char *, const char *, const int *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(dgemm)(const char *, const char *, const int *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(qgemm)(const char *, const char *, const int *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(cgemm)(const char *, const char *, const int *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zgemm)(const char *, const char *, const int *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xgemm)(const char *, const char *, const int *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(cgemm3m)(char *, char *, int *, int *, int *, float *, - float *, int *, float *, int *, float *, float *, int *); -int BLASFUNC(zgemm3m)(char *, char *, int *, int *, int *, double *, - double *, int *, double *, int *, double *, double *, int *); -int BLASFUNC(xgemm3m)(char *, char *, int *, int *, int *, double *, - double *, int *, double *, int *, double *, double *, int *); - -int BLASFUNC(sge2mm)(char *, char *, char *, int *, int *, - float *, float *, int *, float *, int *, - float *, float *, int *); -int BLASFUNC(dge2mm)(char *, char *, char *, int *, int *, - double *, double *, int *, double *, int *, - double *, double *, int *); -int BLASFUNC(cge2mm)(char *, char *, char *, int *, int *, - float *, float *, int *, float *, int *, - float *, float *, int *); -int BLASFUNC(zge2mm)(char *, char *, char *, int *, int *, - double *, double *, int *, double *, int *, - double *, double *, int *); - -int BLASFUNC(strsm)(const char *, const char *, const char *, const char *, const int *, const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(dtrsm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(qtrsm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(ctrsm)(const char *, const char *, const char *, const char *, const int *, const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(ztrsm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(xtrsm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); - -int BLASFUNC(strmm)(const char *, const char *, const char *, const char *, const int *, const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(dtrmm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(qtrmm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(ctrmm)(const char *, const char *, const char *, const char *, const int *, const int *, const float *, const float *, const int *, float *, const int *); -int BLASFUNC(ztrmm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); -int BLASFUNC(xtrmm)(const char *, const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, double *, const int *); - -int BLASFUNC(ssymm)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(dsymm)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(qsymm)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(csymm)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zsymm)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xsymm)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(csymm3m)(char *, char *, int *, int *, float *, float *, int *, float *, int *, float *, float *, int *); -int BLASFUNC(zsymm3m)(char *, char *, int *, int *, double *, double *, int *, double *, int *, double *, double *, int *); -int BLASFUNC(xsymm3m)(char *, char *, int *, int *, double *, double *, int *, double *, int *, double *, double *, int *); - -int BLASFUNC(ssyrk)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(dsyrk)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(qsyrk)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(csyrk)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zsyrk)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xsyrk)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(ssyr2k)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(dsyr2k)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double*, const int *, const double *, double *, const int *); -int BLASFUNC(qsyr2k)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double*, const int *, const double *, double *, const int *); -int BLASFUNC(csyr2k)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zsyr2k)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double*, const int *, const double *, double *, const int *); -int BLASFUNC(xsyr2k)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double*, const int *, const double *, double *, const int *); - -int BLASFUNC(chemm)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zhemm)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xhemm)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(chemm3m)(char *, char *, int *, int *, float *, float *, int *, - float *, int *, float *, float *, int *); -int BLASFUNC(zhemm3m)(char *, char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); -int BLASFUNC(xhemm3m)(char *, char *, int *, int *, double *, double *, int *, - double *, int *, double *, double *, int *); - -int BLASFUNC(cherk)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zherk)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xherk)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, double *, const int *); - -int BLASFUNC(cher2k)(const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zher2k)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xher2k)(const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(cher2m)(const char *, const char *, const char *, const int *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zher2m)(const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double*, const int *, const double *, double *, const int *); -int BLASFUNC(xher2m)(const char *, const char *, const char *, const int *, const int *, const double *, const double *, const int *, const double*, const int *, const double *, double *, const int *); - - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/Eigen/src/misc/lapack.h b/Eigen/src/misc/lapack.h deleted file mode 100644 index 249f3575c..000000000 --- a/Eigen/src/misc/lapack.h +++ /dev/null @@ -1,152 +0,0 @@ -#ifndef LAPACK_H -#define LAPACK_H - -#include "blas.h" - -#ifdef __cplusplus -extern "C" -{ -#endif - -int BLASFUNC(csymv) (const char *, const int *, const float *, const float *, const int *, const float *, const int *, const float *, float *, const int *); -int BLASFUNC(zsymv) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); -int BLASFUNC(xsymv) (const char *, const int *, const double *, const double *, const int *, const double *, const int *, const double *, double *, const int *); - - -int BLASFUNC(cspmv) (char *, int *, float *, float *, - float *, int *, float *, float *, int *); -int BLASFUNC(zspmv) (char *, int *, double *, double *, - double *, int *, double *, double *, int *); -int BLASFUNC(xspmv) (char *, int *, double *, double *, - double *, int *, double *, double *, int *); - -int BLASFUNC(csyr) (char *, int *, float *, float *, int *, - float *, int *); -int BLASFUNC(zsyr) (char *, int *, double *, double *, int *, - double *, int *); -int BLASFUNC(xsyr) (char *, int *, double *, double *, int *, - double *, int *); - -int BLASFUNC(cspr) (char *, int *, float *, float *, int *, - float *); -int BLASFUNC(zspr) (char *, int *, double *, double *, int *, - double *); -int BLASFUNC(xspr) (char *, int *, double *, double *, int *, - double *); - -int BLASFUNC(sgemt)(char *, int *, int *, float *, float *, int *, - float *, int *); -int BLASFUNC(dgemt)(char *, int *, int *, double *, double *, int *, - double *, int *); -int BLASFUNC(cgemt)(char *, int *, int *, float *, float *, int *, - float *, int *); -int BLASFUNC(zgemt)(char *, int *, int *, double *, double *, int *, - double *, int *); - -int BLASFUNC(sgema)(char *, char *, int *, int *, float *, - float *, int *, float *, float *, int *, float *, int *); -int BLASFUNC(dgema)(char *, char *, int *, int *, double *, - double *, int *, double*, double *, int *, double*, int *); -int BLASFUNC(cgema)(char *, char *, int *, int *, float *, - float *, int *, float *, float *, int *, float *, int *); -int BLASFUNC(zgema)(char *, char *, int *, int *, double *, - double *, int *, double*, double *, int *, double*, int *); - -int BLASFUNC(sgems)(char *, char *, int *, int *, float *, - float *, int *, float *, float *, int *, float *, int *); -int BLASFUNC(dgems)(char *, char *, int *, int *, double *, - double *, int *, double*, double *, int *, double*, int *); -int BLASFUNC(cgems)(char *, char *, int *, int *, float *, - float *, int *, float *, float *, int *, float *, int *); -int BLASFUNC(zgems)(char *, char *, int *, int *, double *, - double *, int *, double*, double *, int *, double*, int *); - -int BLASFUNC(sgetf2)(int *, int *, float *, int *, int *, int *); -int BLASFUNC(dgetf2)(int *, int *, double *, int *, int *, int *); -int BLASFUNC(qgetf2)(int *, int *, double *, int *, int *, int *); -int BLASFUNC(cgetf2)(int *, int *, float *, int *, int *, int *); -int BLASFUNC(zgetf2)(int *, int *, double *, int *, int *, int *); -int BLASFUNC(xgetf2)(int *, int *, double *, int *, int *, int *); - -int BLASFUNC(sgetrf)(int *, int *, float *, int *, int *, int *); -int BLASFUNC(dgetrf)(int *, int *, double *, int *, int *, int *); -int BLASFUNC(qgetrf)(int *, int *, double *, int *, int *, int *); -int BLASFUNC(cgetrf)(int *, int *, float *, int *, int *, int *); -int BLASFUNC(zgetrf)(int *, int *, double *, int *, int *, int *); -int BLASFUNC(xgetrf)(int *, int *, double *, int *, int *, int *); - -int BLASFUNC(slaswp)(int *, float *, int *, int *, int *, int *, int *); -int BLASFUNC(dlaswp)(int *, double *, int *, int *, int *, int *, int *); -int BLASFUNC(qlaswp)(int *, double *, int *, int *, int *, int *, int *); -int BLASFUNC(claswp)(int *, float *, int *, int *, int *, int *, int *); -int BLASFUNC(zlaswp)(int *, double *, int *, int *, int *, int *, int *); -int BLASFUNC(xlaswp)(int *, double *, int *, int *, int *, int *, int *); - -int BLASFUNC(sgetrs)(char *, int *, int *, float *, int *, int *, float *, int *, int *); -int BLASFUNC(dgetrs)(char *, int *, int *, double *, int *, int *, double *, int *, int *); -int BLASFUNC(qgetrs)(char *, int *, int *, double *, int *, int *, double *, int *, int *); -int BLASFUNC(cgetrs)(char *, int *, int *, float *, int *, int *, float *, int *, int *); -int BLASFUNC(zgetrs)(char *, int *, int *, double *, int *, int *, double *, int *, int *); -int BLASFUNC(xgetrs)(char *, int *, int *, double *, int *, int *, double *, int *, int *); - -int BLASFUNC(sgesv)(int *, int *, float *, int *, int *, float *, int *, int *); -int BLASFUNC(dgesv)(int *, int *, double *, int *, int *, double*, int *, int *); -int BLASFUNC(qgesv)(int *, int *, double *, int *, int *, double*, int *, int *); -int BLASFUNC(cgesv)(int *, int *, float *, int *, int *, float *, int *, int *); -int BLASFUNC(zgesv)(int *, int *, double *, int *, int *, double*, int *, int *); -int BLASFUNC(xgesv)(int *, int *, double *, int *, int *, double*, int *, int *); - -int BLASFUNC(spotf2)(char *, int *, float *, int *, int *); -int BLASFUNC(dpotf2)(char *, int *, double *, int *, int *); -int BLASFUNC(qpotf2)(char *, int *, double *, int *, int *); -int BLASFUNC(cpotf2)(char *, int *, float *, int *, int *); -int BLASFUNC(zpotf2)(char *, int *, double *, int *, int *); -int BLASFUNC(xpotf2)(char *, int *, double *, int *, int *); - -int BLASFUNC(spotrf)(char *, int *, float *, int *, int *); -int BLASFUNC(dpotrf)(char *, int *, double *, int *, int *); -int BLASFUNC(qpotrf)(char *, int *, double *, int *, int *); -int BLASFUNC(cpotrf)(char *, int *, float *, int *, int *); -int BLASFUNC(zpotrf)(char *, int *, double *, int *, int *); -int BLASFUNC(xpotrf)(char *, int *, double *, int *, int *); - -int BLASFUNC(slauu2)(char *, int *, float *, int *, int *); -int BLASFUNC(dlauu2)(char *, int *, double *, int *, int *); -int BLASFUNC(qlauu2)(char *, int *, double *, int *, int *); -int BLASFUNC(clauu2)(char *, int *, float *, int *, int *); -int BLASFUNC(zlauu2)(char *, int *, double *, int *, int *); -int BLASFUNC(xlauu2)(char *, int *, double *, int *, int *); - -int BLASFUNC(slauum)(char *, int *, float *, int *, int *); -int BLASFUNC(dlauum)(char *, int *, double *, int *, int *); -int BLASFUNC(qlauum)(char *, int *, double *, int *, int *); -int BLASFUNC(clauum)(char *, int *, float *, int *, int *); -int BLASFUNC(zlauum)(char *, int *, double *, int *, int *); -int BLASFUNC(xlauum)(char *, int *, double *, int *, int *); - -int BLASFUNC(strti2)(char *, char *, int *, float *, int *, int *); -int BLASFUNC(dtrti2)(char *, char *, int *, double *, int *, int *); -int BLASFUNC(qtrti2)(char *, char *, int *, double *, int *, int *); -int BLASFUNC(ctrti2)(char *, char *, int *, float *, int *, int *); -int BLASFUNC(ztrti2)(char *, char *, int *, double *, int *, int *); -int BLASFUNC(xtrti2)(char *, char *, int *, double *, int *, int *); - -int BLASFUNC(strtri)(char *, char *, int *, float *, int *, int *); -int BLASFUNC(dtrtri)(char *, char *, int *, double *, int *, int *); -int BLASFUNC(qtrtri)(char *, char *, int *, double *, int *, int *); -int BLASFUNC(ctrtri)(char *, char *, int *, float *, int *, int *); -int BLASFUNC(ztrtri)(char *, char *, int *, double *, int *, int *); -int BLASFUNC(xtrtri)(char *, char *, int *, double *, int *, int *); - -int BLASFUNC(spotri)(char *, int *, float *, int *, int *); -int BLASFUNC(dpotri)(char *, int *, double *, int *, int *); -int BLASFUNC(qpotri)(char *, int *, double *, int *, int *); -int BLASFUNC(cpotri)(char *, int *, float *, int *, int *); -int BLASFUNC(zpotri)(char *, int *, double *, int *, int *); -int BLASFUNC(xpotri)(char *, int *, double *, int *, int *); - -#ifdef __cplusplus -} -#endif - -#endif diff --git a/Eigen/src/misc/lapacke.h b/Eigen/src/misc/lapacke.h deleted file mode 100755 index 3d8e24f5a..000000000 --- a/Eigen/src/misc/lapacke.h +++ /dev/null @@ -1,16292 +0,0 @@ -/***************************************************************************** - Copyright (c) 2010, Intel Corp. - All rights reserved. - - Redistribution and use in source and binary forms, with or without - modification, are permitted provided that the following conditions are met: - - * Redistributions of source code must retain the above copyright notice, - this list of conditions and the following disclaimer. - * Redistributions in binary form must reproduce the above copyright - notice, this list of conditions and the following disclaimer in the - documentation and/or other materials provided with the distribution. - * Neither the name of Intel Corporation nor the names of its contributors - may be used to endorse or promote products derived from this software - without specific prior written permission. - - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" - AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE - IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE - ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE - LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR - CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF - SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS - INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN - CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) - ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF - THE POSSIBILITY OF SUCH DAMAGE. -****************************************************************************** -* Contents: Native C interface to LAPACK -* Author: Intel Corporation -* Generated November, 2011 -*****************************************************************************/ - -#ifndef _MKL_LAPACKE_H_ - -#ifndef _LAPACKE_H_ -#define _LAPACKE_H_ - -/* -* Turn on HAVE_LAPACK_CONFIG_H to redefine C-LAPACK datatypes -*/ -#ifdef HAVE_LAPACK_CONFIG_H -#include "lapacke_config.h" -#endif - -#include - -#ifndef lapack_int -#define lapack_int int -#endif - -#ifndef lapack_logical -#define lapack_logical lapack_int -#endif - -/* Complex types are structures equivalent to the -* Fortran complex types COMPLEX(4) and COMPLEX(8). -* -* One can also redefine the types with his own types -* for example by including in the code definitions like -* -* #define lapack_complex_float std::complex -* #define lapack_complex_double std::complex -* -* or define these types in the command line: -* -* -Dlapack_complex_float="std::complex" -* -Dlapack_complex_double="std::complex" -*/ - -#ifndef LAPACK_COMPLEX_CUSTOM - -/* Complex type (single precision) */ -#ifndef lapack_complex_float -#include -#define lapack_complex_float float _Complex -#endif - -#ifndef lapack_complex_float_real -#define lapack_complex_float_real(z) (creal(z)) -#endif - -#ifndef lapack_complex_float_imag -#define lapack_complex_float_imag(z) (cimag(z)) -#endif - -lapack_complex_float lapack_make_complex_float( float re, float im ); - -/* Complex type (double precision) */ -#ifndef lapack_complex_double -#include -#define lapack_complex_double double _Complex -#endif - -#ifndef lapack_complex_double_real -#define lapack_complex_double_real(z) (creal(z)) -#endif - -#ifndef lapack_complex_double_imag -#define lapack_complex_double_imag(z) (cimag(z)) -#endif - -lapack_complex_double lapack_make_complex_double( double re, double im ); - -#endif - - -#ifdef __cplusplus -extern "C" { -#endif /* __cplusplus */ - -#ifndef LAPACKE_malloc -#define LAPACKE_malloc( size ) malloc( size ) -#endif -#ifndef LAPACKE_free -#define LAPACKE_free( p ) free( p ) -#endif - -#define LAPACK_C2INT( x ) (lapack_int)(*((float*)&x )) -#define LAPACK_Z2INT( x ) (lapack_int)(*((double*)&x )) - -#define LAPACK_ROW_MAJOR 101 -#define LAPACK_COL_MAJOR 102 - -#define LAPACK_WORK_MEMORY_ERROR -1010 -#define LAPACK_TRANSPOSE_MEMORY_ERROR -1011 - -/* Callback logical functions of one, two, or three arguments are used -* to select eigenvalues to sort to the top left of the Schur form. -* The value is selected if function returns TRUE (non-zero). */ - -typedef lapack_logical (*LAPACK_S_SELECT2) ( const float*, const float* ); -typedef lapack_logical (*LAPACK_S_SELECT3) - ( const float*, const float*, const float* ); -typedef lapack_logical (*LAPACK_D_SELECT2) ( const double*, const double* ); -typedef lapack_logical (*LAPACK_D_SELECT3) - ( const double*, const double*, const double* ); - -typedef lapack_logical (*LAPACK_C_SELECT1) ( const lapack_complex_float* ); -typedef lapack_logical (*LAPACK_C_SELECT2) - ( const lapack_complex_float*, const lapack_complex_float* ); -typedef lapack_logical (*LAPACK_Z_SELECT1) ( const lapack_complex_double* ); -typedef lapack_logical (*LAPACK_Z_SELECT2) - ( const lapack_complex_double*, const lapack_complex_double* ); - -#include "lapacke_mangling.h" - -#define LAPACK_lsame LAPACK_GLOBAL(lsame,LSAME) -lapack_logical LAPACK_lsame( char* ca, char* cb, - lapack_int lca, lapack_int lcb ); - -/* C-LAPACK function prototypes */ - -lapack_int LAPACKE_sbdsdc( int matrix_order, char uplo, char compq, - lapack_int n, float* d, float* e, float* u, - lapack_int ldu, float* vt, lapack_int ldvt, float* q, - lapack_int* iq ); -lapack_int LAPACKE_dbdsdc( int matrix_order, char uplo, char compq, - lapack_int n, double* d, double* e, double* u, - lapack_int ldu, double* vt, lapack_int ldvt, - double* q, lapack_int* iq ); - -lapack_int LAPACKE_sbdsqr( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - float* d, float* e, float* vt, lapack_int ldvt, - float* u, lapack_int ldu, float* c, lapack_int ldc ); -lapack_int LAPACKE_dbdsqr( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - double* d, double* e, double* vt, lapack_int ldvt, - double* u, lapack_int ldu, double* c, - lapack_int ldc ); -lapack_int LAPACKE_cbdsqr( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - float* d, float* e, lapack_complex_float* vt, - lapack_int ldvt, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* c, - lapack_int ldc ); -lapack_int LAPACKE_zbdsqr( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - double* d, double* e, lapack_complex_double* vt, - lapack_int ldvt, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* c, - lapack_int ldc ); - -lapack_int LAPACKE_sdisna( char job, lapack_int m, lapack_int n, const float* d, - float* sep ); -lapack_int LAPACKE_ddisna( char job, lapack_int m, lapack_int n, - const double* d, double* sep ); - -lapack_int LAPACKE_sgbbrd( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, float* ab, lapack_int ldab, float* d, - float* e, float* q, lapack_int ldq, float* pt, - lapack_int ldpt, float* c, lapack_int ldc ); -lapack_int LAPACKE_dgbbrd( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, double* ab, lapack_int ldab, - double* d, double* e, double* q, lapack_int ldq, - double* pt, lapack_int ldpt, double* c, - lapack_int ldc ); -lapack_int LAPACKE_cgbbrd( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, lapack_complex_float* ab, - lapack_int ldab, float* d, float* e, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* pt, lapack_int ldpt, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zgbbrd( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, lapack_complex_double* ab, - lapack_int ldab, double* d, double* e, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* pt, lapack_int ldpt, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_sgbcon( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, const float* ab, - lapack_int ldab, const lapack_int* ipiv, float anorm, - float* rcond ); -lapack_int LAPACKE_dgbcon( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, const double* ab, - lapack_int ldab, const lapack_int* ipiv, - double anorm, double* rcond ); -lapack_int LAPACKE_cgbcon( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_zgbcon( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_double* ab, lapack_int ldab, - const lapack_int* ipiv, double anorm, - double* rcond ); - -lapack_int LAPACKE_sgbequ( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* ab, - lapack_int ldab, float* r, float* c, float* rowcnd, - float* colcnd, float* amax ); -lapack_int LAPACKE_dgbequ( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* ab, - lapack_int ldab, double* r, double* c, - double* rowcnd, double* colcnd, double* amax ); -lapack_int LAPACKE_cgbequ( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_float* ab, lapack_int ldab, - float* r, float* c, float* rowcnd, float* colcnd, - float* amax ); -lapack_int LAPACKE_zgbequ( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_double* ab, lapack_int ldab, - double* r, double* c, double* rowcnd, double* colcnd, - double* amax ); - -lapack_int LAPACKE_sgbequb( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* ab, - lapack_int ldab, float* r, float* c, float* rowcnd, - float* colcnd, float* amax ); -lapack_int LAPACKE_dgbequb( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* ab, - lapack_int ldab, double* r, double* c, - double* rowcnd, double* colcnd, double* amax ); -lapack_int LAPACKE_cgbequb( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_float* ab, lapack_int ldab, - float* r, float* c, float* rowcnd, float* colcnd, - float* amax ); -lapack_int LAPACKE_zgbequb( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_double* ab, lapack_int ldab, - double* r, double* c, double* rowcnd, - double* colcnd, double* amax ); - -lapack_int LAPACKE_sgbrfs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const float* ab, lapack_int ldab, const float* afb, - lapack_int ldafb, const lapack_int* ipiv, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* ferr, float* berr ); -lapack_int LAPACKE_dgbrfs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const double* ab, lapack_int ldab, const double* afb, - lapack_int ldafb, const lapack_int* ipiv, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr ); -lapack_int LAPACKE_cgbrfs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* afb, lapack_int ldafb, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zgbrfs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_double* ab, lapack_int ldab, - const lapack_complex_double* afb, lapack_int ldafb, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_sgbrfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, const float* ab, lapack_int ldab, - const float* afb, lapack_int ldafb, - const lapack_int* ipiv, const float* r, - const float* c, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dgbrfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, const double* ab, lapack_int ldab, - const double* afb, lapack_int ldafb, - const lapack_int* ipiv, const double* r, - const double* c, const double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); -lapack_int LAPACKE_cgbrfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, const lapack_complex_float* ab, - lapack_int ldab, const lapack_complex_float* afb, - lapack_int ldafb, const lapack_int* ipiv, - const float* r, const float* c, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params ); -lapack_int LAPACKE_zgbrfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, const lapack_complex_double* ab, - lapack_int ldab, const lapack_complex_double* afb, - lapack_int ldafb, const lapack_int* ipiv, - const double* r, const double* c, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); - -lapack_int LAPACKE_sgbsv( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, float* ab, - lapack_int ldab, lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgbsv( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, double* ab, - lapack_int ldab, lapack_int* ipiv, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cgbsv( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, - lapack_complex_float* ab, lapack_int ldab, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgbsv( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, - lapack_complex_double* ab, lapack_int ldab, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sgbsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, float* ab, lapack_int ldab, - float* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, float* r, float* c, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* rpivot ); -lapack_int LAPACKE_dgbsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, double* ab, lapack_int ldab, - double* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, double* r, double* c, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* rpivot ); -lapack_int LAPACKE_cgbsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_float* ab, - lapack_int ldab, lapack_complex_float* afb, - lapack_int ldafb, lapack_int* ipiv, char* equed, - float* r, float* c, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, float* rpivot ); -lapack_int LAPACKE_zgbsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* afb, - lapack_int ldafb, lapack_int* ipiv, char* equed, - double* r, double* c, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, double* rpivot ); - -lapack_int LAPACKE_sgbsvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, float* ab, lapack_int ldab, - float* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, float* r, float* c, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dgbsvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, double* ab, lapack_int ldab, - double* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, double* r, double* c, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); -lapack_int LAPACKE_cgbsvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_float* ab, - lapack_int ldab, lapack_complex_float* afb, - lapack_int ldafb, lapack_int* ipiv, char* equed, - float* r, float* c, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* rpvgrw, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params ); -lapack_int LAPACKE_zgbsvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* afb, - lapack_int ldafb, lapack_int* ipiv, char* equed, - double* r, double* c, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* rpvgrw, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); - -lapack_int LAPACKE_sgbtrf( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, float* ab, - lapack_int ldab, lapack_int* ipiv ); -lapack_int LAPACKE_dgbtrf( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, double* ab, - lapack_int ldab, lapack_int* ipiv ); -lapack_int LAPACKE_cgbtrf( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - lapack_complex_float* ab, lapack_int ldab, - lapack_int* ipiv ); -lapack_int LAPACKE_zgbtrf( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - lapack_complex_double* ab, lapack_int ldab, - lapack_int* ipiv ); - -lapack_int LAPACKE_sgbtrs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const float* ab, lapack_int ldab, - const lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_dgbtrs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const double* ab, lapack_int ldab, - const lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_cgbtrs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgbtrs( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_double* ab, lapack_int ldab, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sgebak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const float* scale, - lapack_int m, float* v, lapack_int ldv ); -lapack_int LAPACKE_dgebak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const double* scale, - lapack_int m, double* v, lapack_int ldv ); -lapack_int LAPACKE_cgebak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const float* scale, - lapack_int m, lapack_complex_float* v, - lapack_int ldv ); -lapack_int LAPACKE_zgebak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const double* scale, - lapack_int m, lapack_complex_double* v, - lapack_int ldv ); - -lapack_int LAPACKE_sgebal( int matrix_order, char job, lapack_int n, float* a, - lapack_int lda, lapack_int* ilo, lapack_int* ihi, - float* scale ); -lapack_int LAPACKE_dgebal( int matrix_order, char job, lapack_int n, double* a, - lapack_int lda, lapack_int* ilo, lapack_int* ihi, - double* scale ); -lapack_int LAPACKE_cgebal( int matrix_order, char job, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ilo, lapack_int* ihi, float* scale ); -lapack_int LAPACKE_zgebal( int matrix_order, char job, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ilo, lapack_int* ihi, double* scale ); - -lapack_int LAPACKE_sgebrd( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* d, float* e, - float* tauq, float* taup ); -lapack_int LAPACKE_dgebrd( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* d, double* e, - double* tauq, double* taup ); -lapack_int LAPACKE_cgebrd( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, float* d, - float* e, lapack_complex_float* tauq, - lapack_complex_float* taup ); -lapack_int LAPACKE_zgebrd( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, double* d, - double* e, lapack_complex_double* tauq, - lapack_complex_double* taup ); - -lapack_int LAPACKE_sgecon( int matrix_order, char norm, lapack_int n, - const float* a, lapack_int lda, float anorm, - float* rcond ); -lapack_int LAPACKE_dgecon( int matrix_order, char norm, lapack_int n, - const double* a, lapack_int lda, double anorm, - double* rcond ); -lapack_int LAPACKE_cgecon( int matrix_order, char norm, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float anorm, float* rcond ); -lapack_int LAPACKE_zgecon( int matrix_order, char norm, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double anorm, double* rcond ); - -lapack_int LAPACKE_sgeequ( int matrix_order, lapack_int m, lapack_int n, - const float* a, lapack_int lda, float* r, float* c, - float* rowcnd, float* colcnd, float* amax ); -lapack_int LAPACKE_dgeequ( int matrix_order, lapack_int m, lapack_int n, - const double* a, lapack_int lda, double* r, - double* c, double* rowcnd, double* colcnd, - double* amax ); -lapack_int LAPACKE_cgeequ( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* r, float* c, float* rowcnd, float* colcnd, - float* amax ); -lapack_int LAPACKE_zgeequ( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* r, double* c, double* rowcnd, double* colcnd, - double* amax ); - -lapack_int LAPACKE_sgeequb( int matrix_order, lapack_int m, lapack_int n, - const float* a, lapack_int lda, float* r, float* c, - float* rowcnd, float* colcnd, float* amax ); -lapack_int LAPACKE_dgeequb( int matrix_order, lapack_int m, lapack_int n, - const double* a, lapack_int lda, double* r, - double* c, double* rowcnd, double* colcnd, - double* amax ); -lapack_int LAPACKE_cgeequb( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* r, float* c, float* rowcnd, float* colcnd, - float* amax ); -lapack_int LAPACKE_zgeequb( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* r, double* c, double* rowcnd, - double* colcnd, double* amax ); - -lapack_int LAPACKE_sgees( int matrix_order, char jobvs, char sort, - LAPACK_S_SELECT2 select, lapack_int n, float* a, - lapack_int lda, lapack_int* sdim, float* wr, - float* wi, float* vs, lapack_int ldvs ); -lapack_int LAPACKE_dgees( int matrix_order, char jobvs, char sort, - LAPACK_D_SELECT2 select, lapack_int n, double* a, - lapack_int lda, lapack_int* sdim, double* wr, - double* wi, double* vs, lapack_int ldvs ); -lapack_int LAPACKE_cgees( int matrix_order, char jobvs, char sort, - LAPACK_C_SELECT1 select, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* sdim, lapack_complex_float* w, - lapack_complex_float* vs, lapack_int ldvs ); -lapack_int LAPACKE_zgees( int matrix_order, char jobvs, char sort, - LAPACK_Z_SELECT1 select, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* sdim, lapack_complex_double* w, - lapack_complex_double* vs, lapack_int ldvs ); - -lapack_int LAPACKE_sgeesx( int matrix_order, char jobvs, char sort, - LAPACK_S_SELECT2 select, char sense, lapack_int n, - float* a, lapack_int lda, lapack_int* sdim, - float* wr, float* wi, float* vs, lapack_int ldvs, - float* rconde, float* rcondv ); -lapack_int LAPACKE_dgeesx( int matrix_order, char jobvs, char sort, - LAPACK_D_SELECT2 select, char sense, lapack_int n, - double* a, lapack_int lda, lapack_int* sdim, - double* wr, double* wi, double* vs, lapack_int ldvs, - double* rconde, double* rcondv ); -lapack_int LAPACKE_cgeesx( int matrix_order, char jobvs, char sort, - LAPACK_C_SELECT1 select, char sense, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* sdim, lapack_complex_float* w, - lapack_complex_float* vs, lapack_int ldvs, - float* rconde, float* rcondv ); -lapack_int LAPACKE_zgeesx( int matrix_order, char jobvs, char sort, - LAPACK_Z_SELECT1 select, char sense, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* sdim, lapack_complex_double* w, - lapack_complex_double* vs, lapack_int ldvs, - double* rconde, double* rcondv ); - -lapack_int LAPACKE_sgeev( int matrix_order, char jobvl, char jobvr, - lapack_int n, float* a, lapack_int lda, float* wr, - float* wi, float* vl, lapack_int ldvl, float* vr, - lapack_int ldvr ); -lapack_int LAPACKE_dgeev( int matrix_order, char jobvl, char jobvr, - lapack_int n, double* a, lapack_int lda, double* wr, - double* wi, double* vl, lapack_int ldvl, double* vr, - lapack_int ldvr ); -lapack_int LAPACKE_cgeev( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_float* a, lapack_int lda, - lapack_complex_float* w, lapack_complex_float* vl, - lapack_int ldvl, lapack_complex_float* vr, - lapack_int ldvr ); -lapack_int LAPACKE_zgeev( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* w, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr ); - -lapack_int LAPACKE_sgeevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, float* a, - lapack_int lda, float* wr, float* wi, float* vl, - lapack_int ldvl, float* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, float* scale, - float* abnrm, float* rconde, float* rcondv ); -lapack_int LAPACKE_dgeevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, double* a, - lapack_int lda, double* wr, double* wi, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, double* scale, - double* abnrm, double* rconde, double* rcondv ); -lapack_int LAPACKE_cgeevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* w, lapack_complex_float* vl, - lapack_int ldvl, lapack_complex_float* vr, - lapack_int ldvr, lapack_int* ilo, lapack_int* ihi, - float* scale, float* abnrm, float* rconde, - float* rcondv ); -lapack_int LAPACKE_zgeevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* w, lapack_complex_double* vl, - lapack_int ldvl, lapack_complex_double* vr, - lapack_int ldvr, lapack_int* ilo, lapack_int* ihi, - double* scale, double* abnrm, double* rconde, - double* rcondv ); - -lapack_int LAPACKE_sgehrd( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, float* a, lapack_int lda, - float* tau ); -lapack_int LAPACKE_dgehrd( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, double* a, lapack_int lda, - double* tau ); -lapack_int LAPACKE_cgehrd( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* tau ); -lapack_int LAPACKE_zgehrd( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* tau ); - -lapack_int LAPACKE_sgejsv( int matrix_order, char joba, char jobu, char jobv, - char jobr, char jobt, char jobp, lapack_int m, - lapack_int n, float* a, lapack_int lda, float* sva, - float* u, lapack_int ldu, float* v, lapack_int ldv, - float* stat, lapack_int* istat ); -lapack_int LAPACKE_dgejsv( int matrix_order, char joba, char jobu, char jobv, - char jobr, char jobt, char jobp, lapack_int m, - lapack_int n, double* a, lapack_int lda, double* sva, - double* u, lapack_int ldu, double* v, lapack_int ldv, - double* stat, lapack_int* istat ); - -lapack_int LAPACKE_sgelq2( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgelq2( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgelq2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgelq2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgelqf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgelqf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgelqf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgelqf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgels( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* b, lapack_int ldb ); -lapack_int LAPACKE_dgels( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* b, lapack_int ldb ); -lapack_int LAPACKE_cgels( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zgels( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sgelsd( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, float* b, - lapack_int ldb, float* s, float rcond, - lapack_int* rank ); -lapack_int LAPACKE_dgelsd( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, double* s, double rcond, - lapack_int* rank ); -lapack_int LAPACKE_cgelsd( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* s, float rcond, - lapack_int* rank ); -lapack_int LAPACKE_zgelsd( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double* s, double rcond, - lapack_int* rank ); - -lapack_int LAPACKE_sgelss( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, float* b, - lapack_int ldb, float* s, float rcond, - lapack_int* rank ); -lapack_int LAPACKE_dgelss( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, double* s, double rcond, - lapack_int* rank ); -lapack_int LAPACKE_cgelss( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* s, float rcond, - lapack_int* rank ); -lapack_int LAPACKE_zgelss( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double* s, double rcond, - lapack_int* rank ); - -lapack_int LAPACKE_sgelsy( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, float* b, - lapack_int ldb, lapack_int* jpvt, float rcond, - lapack_int* rank ); -lapack_int LAPACKE_dgelsy( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, lapack_int* jpvt, - double rcond, lapack_int* rank ); -lapack_int LAPACKE_cgelsy( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_int* jpvt, float rcond, - lapack_int* rank ); -lapack_int LAPACKE_zgelsy( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_int* jpvt, double rcond, - lapack_int* rank ); - -lapack_int LAPACKE_sgeqlf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgeqlf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgeqlf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgeqlf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgeqp3( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* jpvt, - float* tau ); -lapack_int LAPACKE_dgeqp3( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* jpvt, - double* tau ); -lapack_int LAPACKE_cgeqp3( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_float* tau ); -lapack_int LAPACKE_zgeqp3( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_double* tau ); - -lapack_int LAPACKE_sgeqpf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* jpvt, - float* tau ); -lapack_int LAPACKE_dgeqpf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* jpvt, - double* tau ); -lapack_int LAPACKE_cgeqpf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_float* tau ); -lapack_int LAPACKE_zgeqpf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_double* tau ); - -lapack_int LAPACKE_sgeqr2( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgeqr2( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgeqr2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgeqr2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgeqrf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgeqrf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgeqrf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgeqrf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgeqrfp( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgeqrfp( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgeqrfp( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgeqrfp( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgerfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_dgerfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - const double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr ); -lapack_int LAPACKE_cgerfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zgerfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_sgerfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* r, - const float* c, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dgerfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* r, - const double* c, const double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); -lapack_int LAPACKE_cgerfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* r, - const float* c, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_zgerfsx( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* r, - const double* c, const lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); - -lapack_int LAPACKE_sgerqf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dgerqf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_cgerqf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_zgerqf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_sgesdd( int matrix_order, char jobz, lapack_int m, - lapack_int n, float* a, lapack_int lda, float* s, - float* u, lapack_int ldu, float* vt, - lapack_int ldvt ); -lapack_int LAPACKE_dgesdd( int matrix_order, char jobz, lapack_int m, - lapack_int n, double* a, lapack_int lda, double* s, - double* u, lapack_int ldu, double* vt, - lapack_int ldvt ); -lapack_int LAPACKE_cgesdd( int matrix_order, char jobz, lapack_int m, - lapack_int n, lapack_complex_float* a, - lapack_int lda, float* s, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* vt, - lapack_int ldvt ); -lapack_int LAPACKE_zgesdd( int matrix_order, char jobz, lapack_int m, - lapack_int n, lapack_complex_double* a, - lapack_int lda, double* s, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* vt, - lapack_int ldvt ); - -lapack_int LAPACKE_sgesv( int matrix_order, lapack_int n, lapack_int nrhs, - float* a, lapack_int lda, lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgesv( int matrix_order, lapack_int n, lapack_int nrhs, - double* a, lapack_int lda, lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cgesv( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgesv( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); -lapack_int LAPACKE_dsgesv( int matrix_order, lapack_int n, lapack_int nrhs, - double* a, lapack_int lda, lapack_int* ipiv, - double* b, lapack_int ldb, double* x, lapack_int ldx, - lapack_int* iter ); -lapack_int LAPACKE_zcgesv( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, lapack_int* iter ); - -lapack_int LAPACKE_sgesvd( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, float* a, lapack_int lda, - float* s, float* u, lapack_int ldu, float* vt, - lapack_int ldvt, float* superb ); -lapack_int LAPACKE_dgesvd( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, double* a, - lapack_int lda, double* s, double* u, lapack_int ldu, - double* vt, lapack_int ldvt, double* superb ); -lapack_int LAPACKE_cgesvd( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, lapack_complex_float* a, - lapack_int lda, float* s, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* vt, - lapack_int ldvt, float* superb ); -lapack_int LAPACKE_zgesvd( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, lapack_complex_double* a, - lapack_int lda, double* s, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* vt, - lapack_int ldvt, double* superb ); - -lapack_int LAPACKE_sgesvj( int matrix_order, char joba, char jobu, char jobv, - lapack_int m, lapack_int n, float* a, lapack_int lda, - float* sva, lapack_int mv, float* v, lapack_int ldv, - float* stat ); -lapack_int LAPACKE_dgesvj( int matrix_order, char joba, char jobu, char jobv, - lapack_int m, lapack_int n, double* a, - lapack_int lda, double* sva, lapack_int mv, - double* v, lapack_int ldv, double* stat ); - -lapack_int LAPACKE_sgesvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - float* b, lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* rpivot ); -lapack_int LAPACKE_dgesvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - double* b, lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* rpivot ); -lapack_int LAPACKE_cgesvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* rpivot ); -lapack_int LAPACKE_zgesvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* rpivot ); - -lapack_int LAPACKE_sgesvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - float* b, lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dgesvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* rpvgrw, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); -lapack_int LAPACKE_cgesvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_zgesvxx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); - -lapack_int LAPACKE_sgetf2( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_dgetf2( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_cgetf2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv ); -lapack_int LAPACKE_zgetf2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv ); - -lapack_int LAPACKE_sgetrf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_dgetrf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_cgetrf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv ); -lapack_int LAPACKE_zgetrf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv ); - -lapack_int LAPACKE_sgetri( int matrix_order, lapack_int n, float* a, - lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_dgetri( int matrix_order, lapack_int n, double* a, - lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_cgetri( int matrix_order, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_zgetri( int matrix_order, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv ); - -lapack_int LAPACKE_sgetrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_dgetrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - const lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_cgetrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zgetrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sggbak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const float* lscale, - const float* rscale, lapack_int m, float* v, - lapack_int ldv ); -lapack_int LAPACKE_dggbak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const double* lscale, - const double* rscale, lapack_int m, double* v, - lapack_int ldv ); -lapack_int LAPACKE_cggbak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const float* lscale, - const float* rscale, lapack_int m, - lapack_complex_float* v, lapack_int ldv ); -lapack_int LAPACKE_zggbak( int matrix_order, char job, char side, lapack_int n, - lapack_int ilo, lapack_int ihi, const double* lscale, - const double* rscale, lapack_int m, - lapack_complex_double* v, lapack_int ldv ); - -lapack_int LAPACKE_sggbal( int matrix_order, char job, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale ); -lapack_int LAPACKE_dggbal( int matrix_order, char job, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - lapack_int* ilo, lapack_int* ihi, double* lscale, - double* rscale ); -lapack_int LAPACKE_cggbal( int matrix_order, char job, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale ); -lapack_int LAPACKE_zggbal( int matrix_order, char job, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_int* ilo, lapack_int* ihi, double* lscale, - double* rscale ); - -lapack_int LAPACKE_sgges( int matrix_order, char jobvsl, char jobvsr, char sort, - LAPACK_S_SELECT3 selctg, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - lapack_int* sdim, float* alphar, float* alphai, - float* beta, float* vsl, lapack_int ldvsl, float* vsr, - lapack_int ldvsr ); -lapack_int LAPACKE_dgges( int matrix_order, char jobvsl, char jobvsr, char sort, - LAPACK_D_SELECT3 selctg, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - lapack_int* sdim, double* alphar, double* alphai, - double* beta, double* vsl, lapack_int ldvsl, - double* vsr, lapack_int ldvsr ); -lapack_int LAPACKE_cgges( int matrix_order, char jobvsl, char jobvsr, char sort, - LAPACK_C_SELECT2 selctg, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_int* sdim, lapack_complex_float* alpha, - lapack_complex_float* beta, lapack_complex_float* vsl, - lapack_int ldvsl, lapack_complex_float* vsr, - lapack_int ldvsr ); -lapack_int LAPACKE_zgges( int matrix_order, char jobvsl, char jobvsr, char sort, - LAPACK_Z_SELECT2 selctg, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_int* sdim, lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vsl, lapack_int ldvsl, - lapack_complex_double* vsr, lapack_int ldvsr ); - -lapack_int LAPACKE_sggesx( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_S_SELECT3 selctg, char sense, - lapack_int n, float* a, lapack_int lda, float* b, - lapack_int ldb, lapack_int* sdim, float* alphar, - float* alphai, float* beta, float* vsl, - lapack_int ldvsl, float* vsr, lapack_int ldvsr, - float* rconde, float* rcondv ); -lapack_int LAPACKE_dggesx( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_D_SELECT3 selctg, char sense, - lapack_int n, double* a, lapack_int lda, double* b, - lapack_int ldb, lapack_int* sdim, double* alphar, - double* alphai, double* beta, double* vsl, - lapack_int ldvsl, double* vsr, lapack_int ldvsr, - double* rconde, double* rcondv ); -lapack_int LAPACKE_cggesx( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_C_SELECT2 selctg, char sense, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_int* sdim, - lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* vsl, lapack_int ldvsl, - lapack_complex_float* vsr, lapack_int ldvsr, - float* rconde, float* rcondv ); -lapack_int LAPACKE_zggesx( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_Z_SELECT2 selctg, char sense, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_int* sdim, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vsl, lapack_int ldvsl, - lapack_complex_double* vsr, lapack_int ldvsr, - double* rconde, double* rcondv ); - -lapack_int LAPACKE_sggev( int matrix_order, char jobvl, char jobvr, - lapack_int n, float* a, lapack_int lda, float* b, - lapack_int ldb, float* alphar, float* alphai, - float* beta, float* vl, lapack_int ldvl, float* vr, - lapack_int ldvr ); -lapack_int LAPACKE_dggev( int matrix_order, char jobvl, char jobvr, - lapack_int n, double* a, lapack_int lda, double* b, - lapack_int ldb, double* alphar, double* alphai, - double* beta, double* vl, lapack_int ldvl, double* vr, - lapack_int ldvr ); -lapack_int LAPACKE_cggev( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* alpha, - lapack_complex_float* beta, lapack_complex_float* vl, - lapack_int ldvl, lapack_complex_float* vr, - lapack_int ldvr ); -lapack_int LAPACKE_zggev( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr ); - -lapack_int LAPACKE_sggevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* alphar, float* alphai, float* beta, float* vl, - lapack_int ldvl, float* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale, float* abnrm, float* bbnrm, - float* rconde, float* rcondv ); -lapack_int LAPACKE_dggevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* alphar, double* alphai, double* beta, - double* vl, lapack_int ldvl, double* vr, - lapack_int ldvr, lapack_int* ilo, lapack_int* ihi, - double* lscale, double* rscale, double* abnrm, - double* bbnrm, double* rconde, double* rcondv ); -lapack_int LAPACKE_cggevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* alpha, - lapack_complex_float* beta, lapack_complex_float* vl, - lapack_int ldvl, lapack_complex_float* vr, - lapack_int ldvr, lapack_int* ilo, lapack_int* ihi, - float* lscale, float* rscale, float* abnrm, - float* bbnrm, float* rconde, float* rcondv ); -lapack_int LAPACKE_zggevx( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, double* lscale, - double* rscale, double* abnrm, double* bbnrm, - double* rconde, double* rcondv ); - -lapack_int LAPACKE_sggglm( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, float* a, lapack_int lda, float* b, - lapack_int ldb, float* d, float* x, float* y ); -lapack_int LAPACKE_dggglm( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, double* a, lapack_int lda, double* b, - lapack_int ldb, double* d, double* x, double* y ); -lapack_int LAPACKE_cggglm( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* d, - lapack_complex_float* x, lapack_complex_float* y ); -lapack_int LAPACKE_zggglm( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* d, - lapack_complex_double* x, lapack_complex_double* y ); - -lapack_int LAPACKE_sgghrd( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - float* a, lapack_int lda, float* b, lapack_int ldb, - float* q, lapack_int ldq, float* z, lapack_int ldz ); -lapack_int LAPACKE_dgghrd( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - double* a, lapack_int lda, double* b, lapack_int ldb, - double* q, lapack_int ldq, double* z, - lapack_int ldz ); -lapack_int LAPACKE_cgghrd( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zgghrd( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_sgglse( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, float* a, lapack_int lda, float* b, - lapack_int ldb, float* c, float* d, float* x ); -lapack_int LAPACKE_dgglse( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, double* a, lapack_int lda, double* b, - lapack_int ldb, double* c, double* d, double* x ); -lapack_int LAPACKE_cgglse( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* c, - lapack_complex_float* d, lapack_complex_float* x ); -lapack_int LAPACKE_zgglse( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* c, - lapack_complex_double* d, lapack_complex_double* x ); - -lapack_int LAPACKE_sggqrf( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, float* a, lapack_int lda, float* taua, - float* b, lapack_int ldb, float* taub ); -lapack_int LAPACKE_dggqrf( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, double* a, lapack_int lda, - double* taua, double* b, lapack_int ldb, - double* taub ); -lapack_int LAPACKE_cggqrf( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* taua, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* taub ); -lapack_int LAPACKE_zggqrf( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* taua, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* taub ); - -lapack_int LAPACKE_sggrqf( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, float* a, lapack_int lda, float* taua, - float* b, lapack_int ldb, float* taub ); -lapack_int LAPACKE_dggrqf( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, double* a, lapack_int lda, - double* taua, double* b, lapack_int ldb, - double* taub ); -lapack_int LAPACKE_cggrqf( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* taua, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* taub ); -lapack_int LAPACKE_zggrqf( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* taua, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* taub ); - -lapack_int LAPACKE_sggsvd( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int n, lapack_int p, - lapack_int* k, lapack_int* l, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* alpha, float* beta, float* u, lapack_int ldu, - float* v, lapack_int ldv, float* q, lapack_int ldq, - lapack_int* iwork ); -lapack_int LAPACKE_dggsvd( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int n, lapack_int p, - lapack_int* k, lapack_int* l, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* alpha, double* beta, double* u, - lapack_int ldu, double* v, lapack_int ldv, double* q, - lapack_int ldq, lapack_int* iwork ); -lapack_int LAPACKE_cggsvd( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int n, lapack_int p, - lapack_int* k, lapack_int* l, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - float* alpha, float* beta, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* v, - lapack_int ldv, lapack_complex_float* q, - lapack_int ldq, lapack_int* iwork ); -lapack_int LAPACKE_zggsvd( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int n, lapack_int p, - lapack_int* k, lapack_int* l, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double* alpha, double* beta, - lapack_complex_double* u, lapack_int ldu, - lapack_complex_double* v, lapack_int ldv, - lapack_complex_double* q, lapack_int ldq, - lapack_int* iwork ); - -lapack_int LAPACKE_sggsvp( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, float tola, - float tolb, lapack_int* k, lapack_int* l, float* u, - lapack_int ldu, float* v, lapack_int ldv, float* q, - lapack_int ldq ); -lapack_int LAPACKE_dggsvp( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double tola, double tolb, lapack_int* k, - lapack_int* l, double* u, lapack_int ldu, double* v, - lapack_int ldv, double* q, lapack_int ldq ); -lapack_int LAPACKE_cggsvp( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, float tola, - float tolb, lapack_int* k, lapack_int* l, - lapack_complex_float* u, lapack_int ldu, - lapack_complex_float* v, lapack_int ldv, - lapack_complex_float* q, lapack_int ldq ); -lapack_int LAPACKE_zggsvp( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double tola, double tolb, lapack_int* k, - lapack_int* l, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* v, - lapack_int ldv, lapack_complex_double* q, - lapack_int ldq ); - -lapack_int LAPACKE_sgtcon( char norm, lapack_int n, const float* dl, - const float* d, const float* du, const float* du2, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_dgtcon( char norm, lapack_int n, const double* dl, - const double* d, const double* du, const double* du2, - const lapack_int* ipiv, double anorm, - double* rcond ); -lapack_int LAPACKE_cgtcon( char norm, lapack_int n, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* du2, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_zgtcon( char norm, lapack_int n, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* du2, - const lapack_int* ipiv, double anorm, - double* rcond ); - -lapack_int LAPACKE_sgtrfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* dl, const float* d, - const float* du, const float* dlf, const float* df, - const float* duf, const float* du2, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_dgtrfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* dl, const double* d, - const double* du, const double* dlf, - const double* df, const double* duf, - const double* du2, const lapack_int* ipiv, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr ); -lapack_int LAPACKE_cgtrfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* dlf, - const lapack_complex_float* df, - const lapack_complex_float* duf, - const lapack_complex_float* du2, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zgtrfs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* dlf, - const lapack_complex_double* df, - const lapack_complex_double* duf, - const lapack_complex_double* du2, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_sgtsv( int matrix_order, lapack_int n, lapack_int nrhs, - float* dl, float* d, float* du, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgtsv( int matrix_order, lapack_int n, lapack_int nrhs, - double* dl, double* d, double* du, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cgtsv( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_float* dl, lapack_complex_float* d, - lapack_complex_float* du, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgtsv( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_double* dl, lapack_complex_double* d, - lapack_complex_double* du, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sgtsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, const float* dl, - const float* d, const float* du, float* dlf, - float* df, float* duf, float* du2, lapack_int* ipiv, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_dgtsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, const double* dl, - const double* d, const double* du, double* dlf, - double* df, double* duf, double* du2, - lapack_int* ipiv, const double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* ferr, double* berr ); -lapack_int LAPACKE_cgtsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - lapack_complex_float* dlf, lapack_complex_float* df, - lapack_complex_float* duf, lapack_complex_float* du2, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_zgtsvx( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - lapack_complex_double* dlf, - lapack_complex_double* df, - lapack_complex_double* duf, - lapack_complex_double* du2, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_sgttrf( lapack_int n, float* dl, float* d, float* du, - float* du2, lapack_int* ipiv ); -lapack_int LAPACKE_dgttrf( lapack_int n, double* dl, double* d, double* du, - double* du2, lapack_int* ipiv ); -lapack_int LAPACKE_cgttrf( lapack_int n, lapack_complex_float* dl, - lapack_complex_float* d, lapack_complex_float* du, - lapack_complex_float* du2, lapack_int* ipiv ); -lapack_int LAPACKE_zgttrf( lapack_int n, lapack_complex_double* dl, - lapack_complex_double* d, lapack_complex_double* du, - lapack_complex_double* du2, lapack_int* ipiv ); - -lapack_int LAPACKE_sgttrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* dl, const float* d, - const float* du, const float* du2, - const lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_dgttrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* dl, const double* d, - const double* du, const double* du2, - const lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_cgttrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* du2, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgttrs( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* du2, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_chbev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, lapack_complex_float* ab, - lapack_int ldab, float* w, lapack_complex_float* z, - lapack_int ldz ); -lapack_int LAPACKE_zhbev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, lapack_complex_double* ab, - lapack_int ldab, double* w, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_chbevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, lapack_complex_float* ab, - lapack_int ldab, float* w, lapack_complex_float* z, - lapack_int ldz ); -lapack_int LAPACKE_zhbevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, lapack_complex_double* ab, - lapack_int ldab, double* w, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_chbevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* q, lapack_int ldq, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int ldz, lapack_int* ifail ); -lapack_int LAPACKE_zhbevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* q, lapack_int ldq, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_chbgst( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* bb, lapack_int ldbb, - lapack_complex_float* x, lapack_int ldx ); -lapack_int LAPACKE_zhbgst( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - const lapack_complex_double* bb, lapack_int ldbb, - lapack_complex_double* x, lapack_int ldx ); - -lapack_int LAPACKE_chbgv( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* bb, lapack_int ldbb, float* w, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zhbgv( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* bb, lapack_int ldbb, double* w, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_chbgvd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* bb, lapack_int ldbb, float* w, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zhbgvd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* bb, lapack_int ldbb, - double* w, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_chbgvx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* bb, lapack_int ldbb, - lapack_complex_float* q, lapack_int ldq, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int ldz, lapack_int* ifail ); -lapack_int LAPACKE_zhbgvx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* bb, lapack_int ldbb, - lapack_complex_double* q, lapack_int ldq, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_chbtrd( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int kd, lapack_complex_float* ab, - lapack_int ldab, float* d, float* e, - lapack_complex_float* q, lapack_int ldq ); -lapack_int LAPACKE_zhbtrd( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int kd, lapack_complex_double* ab, - lapack_int ldab, double* d, double* e, - lapack_complex_double* q, lapack_int ldq ); - -lapack_int LAPACKE_checon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_zhecon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, double anorm, - double* rcond ); - -lapack_int LAPACKE_cheequb( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_zheequb( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax ); - -lapack_int LAPACKE_cheev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, float* w ); -lapack_int LAPACKE_zheev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, double* w ); - -lapack_int LAPACKE_cheevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, float* w ); -lapack_int LAPACKE_zheevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - double* w ); - -lapack_int LAPACKE_cheevr( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_complex_float* a, - lapack_int lda, float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_int* isuppz ); -lapack_int LAPACKE_zheevr( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_complex_double* a, - lapack_int lda, double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, lapack_complex_double* z, lapack_int ldz, - lapack_int* isuppz ); - -lapack_int LAPACKE_cheevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_complex_float* a, - lapack_int lda, float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_zheevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_complex_double* a, - lapack_int lda, double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, lapack_complex_double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_chegst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zhegst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_chegv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* w ); -lapack_int LAPACKE_zhegv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double* w ); - -lapack_int LAPACKE_chegvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* w ); -lapack_int LAPACKE_zhegvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double* w ); - -lapack_int LAPACKE_chegvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int ldz, lapack_int* ifail ); -lapack_int LAPACKE_zhegvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_cherfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zherfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_cherfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* s, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params ); -lapack_int LAPACKE_zherfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* s, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); - -lapack_int LAPACKE_chesv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zhesv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_chesvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* af, - lapack_int ldaf, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zhesvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* af, - lapack_int ldaf, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_chesvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* s, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_zhesvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); - -lapack_int LAPACKE_chetrd( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, float* d, - float* e, lapack_complex_float* tau ); -lapack_int LAPACKE_zhetrd( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, double* d, - double* e, lapack_complex_double* tau ); - -lapack_int LAPACKE_chetrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv ); -lapack_int LAPACKE_zhetrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv ); - -lapack_int LAPACKE_chetri( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_zhetri( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv ); - -lapack_int LAPACKE_chetrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zhetrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_chfrk( int matrix_order, char transr, char uplo, char trans, - lapack_int n, lapack_int k, float alpha, - const lapack_complex_float* a, lapack_int lda, - float beta, lapack_complex_float* c ); -lapack_int LAPACKE_zhfrk( int matrix_order, char transr, char uplo, char trans, - lapack_int n, lapack_int k, double alpha, - const lapack_complex_double* a, lapack_int lda, - double beta, lapack_complex_double* c ); - -lapack_int LAPACKE_shgeqz( int matrix_order, char job, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - float* h, lapack_int ldh, float* t, lapack_int ldt, - float* alphar, float* alphai, float* beta, float* q, - lapack_int ldq, float* z, lapack_int ldz ); -lapack_int LAPACKE_dhgeqz( int matrix_order, char job, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - double* h, lapack_int ldh, double* t, lapack_int ldt, - double* alphar, double* alphai, double* beta, - double* q, lapack_int ldq, double* z, - lapack_int ldz ); -lapack_int LAPACKE_chgeqz( int matrix_order, char job, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_float* h, lapack_int ldh, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* alpha, - lapack_complex_float* beta, lapack_complex_float* q, - lapack_int ldq, lapack_complex_float* z, - lapack_int ldz ); -lapack_int LAPACKE_zhgeqz( int matrix_order, char job, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_double* h, lapack_int ldh, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_chpcon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_zhpcon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - const lapack_int* ipiv, double anorm, - double* rcond ); - -lapack_int LAPACKE_chpev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_float* ap, float* w, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zhpev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_double* ap, double* w, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_chpevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_float* ap, float* w, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zhpevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_complex_double* ap, double* w, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_chpevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_complex_float* ap, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int ldz, lapack_int* ifail ); -lapack_int LAPACKE_zhpevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_complex_double* ap, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_chpgst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_float* ap, - const lapack_complex_float* bp ); -lapack_int LAPACKE_zhpgst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_double* ap, - const lapack_complex_double* bp ); - -lapack_int LAPACKE_chpgv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_float* ap, - lapack_complex_float* bp, float* w, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zhpgv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_double* ap, - lapack_complex_double* bp, double* w, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_chpgvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_float* ap, - lapack_complex_float* bp, float* w, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zhpgvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_double* ap, - lapack_complex_double* bp, double* w, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_chpgvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_float* ap, lapack_complex_float* bp, - float vl, float vu, lapack_int il, lapack_int iu, - float abstol, lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_zhpgvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_double* ap, lapack_complex_double* bp, - double vl, double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_chprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zhprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_chpsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zhpsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_chpsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - lapack_complex_float* afp, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zhpsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - lapack_complex_double* afp, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_chptrd( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, float* d, float* e, - lapack_complex_float* tau ); -lapack_int LAPACKE_zhptrd( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, double* d, double* e, - lapack_complex_double* tau ); - -lapack_int LAPACKE_chptrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, lapack_int* ipiv ); -lapack_int LAPACKE_zhptrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, lapack_int* ipiv ); - -lapack_int LAPACKE_chptri( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, const lapack_int* ipiv ); -lapack_int LAPACKE_zhptri( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, const lapack_int* ipiv ); - -lapack_int LAPACKE_chptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zhptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_shsein( int matrix_order, char job, char eigsrc, char initv, - lapack_logical* select, lapack_int n, const float* h, - lapack_int ldh, float* wr, const float* wi, - float* vl, lapack_int ldvl, float* vr, - lapack_int ldvr, lapack_int mm, lapack_int* m, - lapack_int* ifaill, lapack_int* ifailr ); -lapack_int LAPACKE_dhsein( int matrix_order, char job, char eigsrc, char initv, - lapack_logical* select, lapack_int n, - const double* h, lapack_int ldh, double* wr, - const double* wi, double* vl, lapack_int ldvl, - double* vr, lapack_int ldvr, lapack_int mm, - lapack_int* m, lapack_int* ifaill, - lapack_int* ifailr ); -lapack_int LAPACKE_chsein( int matrix_order, char job, char eigsrc, char initv, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* h, lapack_int ldh, - lapack_complex_float* w, lapack_complex_float* vl, - lapack_int ldvl, lapack_complex_float* vr, - lapack_int ldvr, lapack_int mm, lapack_int* m, - lapack_int* ifaill, lapack_int* ifailr ); -lapack_int LAPACKE_zhsein( int matrix_order, char job, char eigsrc, char initv, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* h, lapack_int ldh, - lapack_complex_double* w, lapack_complex_double* vl, - lapack_int ldvl, lapack_complex_double* vr, - lapack_int ldvr, lapack_int mm, lapack_int* m, - lapack_int* ifaill, lapack_int* ifailr ); - -lapack_int LAPACKE_shseqr( int matrix_order, char job, char compz, lapack_int n, - lapack_int ilo, lapack_int ihi, float* h, - lapack_int ldh, float* wr, float* wi, float* z, - lapack_int ldz ); -lapack_int LAPACKE_dhseqr( int matrix_order, char job, char compz, lapack_int n, - lapack_int ilo, lapack_int ihi, double* h, - lapack_int ldh, double* wr, double* wi, double* z, - lapack_int ldz ); -lapack_int LAPACKE_chseqr( int matrix_order, char job, char compz, lapack_int n, - lapack_int ilo, lapack_int ihi, - lapack_complex_float* h, lapack_int ldh, - lapack_complex_float* w, lapack_complex_float* z, - lapack_int ldz ); -lapack_int LAPACKE_zhseqr( int matrix_order, char job, char compz, lapack_int n, - lapack_int ilo, lapack_int ihi, - lapack_complex_double* h, lapack_int ldh, - lapack_complex_double* w, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_clacgv( lapack_int n, lapack_complex_float* x, - lapack_int incx ); -lapack_int LAPACKE_zlacgv( lapack_int n, lapack_complex_double* x, - lapack_int incx ); - -lapack_int LAPACKE_slacpy( int matrix_order, char uplo, lapack_int m, - lapack_int n, const float* a, lapack_int lda, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dlacpy( int matrix_order, char uplo, lapack_int m, - lapack_int n, const double* a, lapack_int lda, double* b, - lapack_int ldb ); -lapack_int LAPACKE_clacpy( int matrix_order, char uplo, lapack_int m, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zlacpy( int matrix_order, char uplo, lapack_int m, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_zlag2c( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_float* sa, lapack_int ldsa ); - -lapack_int LAPACKE_slag2d( int matrix_order, lapack_int m, lapack_int n, - const float* sa, lapack_int ldsa, double* a, - lapack_int lda ); - -lapack_int LAPACKE_dlag2s( int matrix_order, lapack_int m, lapack_int n, - const double* a, lapack_int lda, float* sa, - lapack_int ldsa ); - -lapack_int LAPACKE_clag2z( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_float* sa, lapack_int ldsa, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_slagge( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* d, - float* a, lapack_int lda, lapack_int* iseed ); -lapack_int LAPACKE_dlagge( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* d, - double* a, lapack_int lda, lapack_int* iseed ); -lapack_int LAPACKE_clagge( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* d, - lapack_complex_float* a, lapack_int lda, - lapack_int* iseed ); -lapack_int LAPACKE_zlagge( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* d, - lapack_complex_double* a, lapack_int lda, - lapack_int* iseed ); - -float LAPACKE_slamch( char cmach ); -double LAPACKE_dlamch( char cmach ); - -float LAPACKE_slange( int matrix_order, char norm, lapack_int m, - lapack_int n, const float* a, lapack_int lda ); -double LAPACKE_dlange( int matrix_order, char norm, lapack_int m, - lapack_int n, const double* a, lapack_int lda ); -float LAPACKE_clange( int matrix_order, char norm, lapack_int m, - lapack_int n, const lapack_complex_float* a, - lapack_int lda ); -double LAPACKE_zlange( int matrix_order, char norm, lapack_int m, - lapack_int n, const lapack_complex_double* a, - lapack_int lda ); - -float LAPACKE_clanhe( int matrix_order, char norm, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda ); -double LAPACKE_zlanhe( int matrix_order, char norm, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda ); - -float LAPACKE_slansy( int matrix_order, char norm, char uplo, lapack_int n, - const float* a, lapack_int lda ); -double LAPACKE_dlansy( int matrix_order, char norm, char uplo, lapack_int n, - const double* a, lapack_int lda ); -float LAPACKE_clansy( int matrix_order, char norm, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda ); -double LAPACKE_zlansy( int matrix_order, char norm, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda ); - -float LAPACKE_slantr( int matrix_order, char norm, char uplo, char diag, - lapack_int m, lapack_int n, const float* a, - lapack_int lda ); -double LAPACKE_dlantr( int matrix_order, char norm, char uplo, char diag, - lapack_int m, lapack_int n, const double* a, - lapack_int lda ); -float LAPACKE_clantr( int matrix_order, char norm, char uplo, char diag, - lapack_int m, lapack_int n, const lapack_complex_float* a, - lapack_int lda ); -double LAPACKE_zlantr( int matrix_order, char norm, char uplo, char diag, - lapack_int m, lapack_int n, const lapack_complex_double* a, - lapack_int lda ); - - -lapack_int LAPACKE_slarfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, const float* v, lapack_int ldv, - const float* t, lapack_int ldt, float* c, - lapack_int ldc ); -lapack_int LAPACKE_dlarfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, const double* v, lapack_int ldv, - const double* t, lapack_int ldt, double* c, - lapack_int ldc ); -lapack_int LAPACKE_clarfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, const lapack_complex_float* v, - lapack_int ldv, const lapack_complex_float* t, - lapack_int ldt, lapack_complex_float* c, - lapack_int ldc ); -lapack_int LAPACKE_zlarfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, const lapack_complex_double* v, - lapack_int ldv, const lapack_complex_double* t, - lapack_int ldt, lapack_complex_double* c, - lapack_int ldc ); - -lapack_int LAPACKE_slarfg( lapack_int n, float* alpha, float* x, - lapack_int incx, float* tau ); -lapack_int LAPACKE_dlarfg( lapack_int n, double* alpha, double* x, - lapack_int incx, double* tau ); -lapack_int LAPACKE_clarfg( lapack_int n, lapack_complex_float* alpha, - lapack_complex_float* x, lapack_int incx, - lapack_complex_float* tau ); -lapack_int LAPACKE_zlarfg( lapack_int n, lapack_complex_double* alpha, - lapack_complex_double* x, lapack_int incx, - lapack_complex_double* tau ); - -lapack_int LAPACKE_slarft( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, const float* v, - lapack_int ldv, const float* tau, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dlarft( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, const double* v, - lapack_int ldv, const double* tau, double* t, - lapack_int ldt ); -lapack_int LAPACKE_clarft( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* tau, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_zlarft( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* tau, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_slarfx( int matrix_order, char side, lapack_int m, - lapack_int n, const float* v, float tau, float* c, - lapack_int ldc, float* work ); -lapack_int LAPACKE_dlarfx( int matrix_order, char side, lapack_int m, - lapack_int n, const double* v, double tau, double* c, - lapack_int ldc, double* work ); -lapack_int LAPACKE_clarfx( int matrix_order, char side, lapack_int m, - lapack_int n, const lapack_complex_float* v, - lapack_complex_float tau, lapack_complex_float* c, - lapack_int ldc, lapack_complex_float* work ); -lapack_int LAPACKE_zlarfx( int matrix_order, char side, lapack_int m, - lapack_int n, const lapack_complex_double* v, - lapack_complex_double tau, lapack_complex_double* c, - lapack_int ldc, lapack_complex_double* work ); - -lapack_int LAPACKE_slarnv( lapack_int idist, lapack_int* iseed, lapack_int n, - float* x ); -lapack_int LAPACKE_dlarnv( lapack_int idist, lapack_int* iseed, lapack_int n, - double* x ); -lapack_int LAPACKE_clarnv( lapack_int idist, lapack_int* iseed, lapack_int n, - lapack_complex_float* x ); -lapack_int LAPACKE_zlarnv( lapack_int idist, lapack_int* iseed, lapack_int n, - lapack_complex_double* x ); - -lapack_int LAPACKE_slaset( int matrix_order, char uplo, lapack_int m, - lapack_int n, float alpha, float beta, float* a, - lapack_int lda ); -lapack_int LAPACKE_dlaset( int matrix_order, char uplo, lapack_int m, - lapack_int n, double alpha, double beta, double* a, - lapack_int lda ); -lapack_int LAPACKE_claset( int matrix_order, char uplo, lapack_int m, - lapack_int n, lapack_complex_float alpha, - lapack_complex_float beta, lapack_complex_float* a, - lapack_int lda ); -lapack_int LAPACKE_zlaset( int matrix_order, char uplo, lapack_int m, - lapack_int n, lapack_complex_double alpha, - lapack_complex_double beta, lapack_complex_double* a, - lapack_int lda ); - -lapack_int LAPACKE_slasrt( char id, lapack_int n, float* d ); -lapack_int LAPACKE_dlasrt( char id, lapack_int n, double* d ); - -lapack_int LAPACKE_slaswp( int matrix_order, lapack_int n, float* a, - lapack_int lda, lapack_int k1, lapack_int k2, - const lapack_int* ipiv, lapack_int incx ); -lapack_int LAPACKE_dlaswp( int matrix_order, lapack_int n, double* a, - lapack_int lda, lapack_int k1, lapack_int k2, - const lapack_int* ipiv, lapack_int incx ); -lapack_int LAPACKE_claswp( int matrix_order, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int k1, lapack_int k2, const lapack_int* ipiv, - lapack_int incx ); -lapack_int LAPACKE_zlaswp( int matrix_order, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int k1, lapack_int k2, const lapack_int* ipiv, - lapack_int incx ); - -lapack_int LAPACKE_slatms( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, float* d, - lapack_int mode, float cond, float dmax, - lapack_int kl, lapack_int ku, char pack, float* a, - lapack_int lda ); -lapack_int LAPACKE_dlatms( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, double* d, - lapack_int mode, double cond, double dmax, - lapack_int kl, lapack_int ku, char pack, double* a, - lapack_int lda ); -lapack_int LAPACKE_clatms( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, float* d, - lapack_int mode, float cond, float dmax, - lapack_int kl, lapack_int ku, char pack, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zlatms( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, double* d, - lapack_int mode, double cond, double dmax, - lapack_int kl, lapack_int ku, char pack, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_slauum( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda ); -lapack_int LAPACKE_dlauum( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda ); -lapack_int LAPACKE_clauum( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zlauum( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_sopgtr( int matrix_order, char uplo, lapack_int n, - const float* ap, const float* tau, float* q, - lapack_int ldq ); -lapack_int LAPACKE_dopgtr( int matrix_order, char uplo, lapack_int n, - const double* ap, const double* tau, double* q, - lapack_int ldq ); - -lapack_int LAPACKE_sopmtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, const float* ap, - const float* tau, float* c, lapack_int ldc ); -lapack_int LAPACKE_dopmtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, const double* ap, - const double* tau, double* c, lapack_int ldc ); - -lapack_int LAPACKE_sorgbr( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, float* a, lapack_int lda, - const float* tau ); -lapack_int LAPACKE_dorgbr( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, double* a, - lapack_int lda, const double* tau ); - -lapack_int LAPACKE_sorghr( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, float* a, lapack_int lda, - const float* tau ); -lapack_int LAPACKE_dorghr( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, double* a, lapack_int lda, - const double* tau ); - -lapack_int LAPACKE_sorglq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau ); -lapack_int LAPACKE_dorglq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau ); - -lapack_int LAPACKE_sorgql( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau ); -lapack_int LAPACKE_dorgql( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau ); - -lapack_int LAPACKE_sorgqr( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau ); -lapack_int LAPACKE_dorgqr( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau ); - -lapack_int LAPACKE_sorgrq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau ); -lapack_int LAPACKE_dorgrq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau ); - -lapack_int LAPACKE_sorgtr( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda, const float* tau ); -lapack_int LAPACKE_dorgtr( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda, const double* tau ); - -lapack_int LAPACKE_sormbr( int matrix_order, char vect, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, const float* tau, - float* c, lapack_int ldc ); -lapack_int LAPACKE_dormbr( int matrix_order, char vect, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, const double* tau, - double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormhr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc ); -lapack_int LAPACKE_dormhr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormlq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, const float* tau, - float* c, lapack_int ldc ); -lapack_int LAPACKE_dormlq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, const double* tau, - double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormql( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, const float* tau, - float* c, lapack_int ldc ); -lapack_int LAPACKE_dormql( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, const double* tau, - double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormqr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, const float* tau, - float* c, lapack_int ldc ); -lapack_int LAPACKE_dormqr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, const double* tau, - double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormrq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, const float* tau, - float* c, lapack_int ldc ); -lapack_int LAPACKE_dormrq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, const double* tau, - double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormrz( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc ); -lapack_int LAPACKE_dormrz( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc ); - -lapack_int LAPACKE_sormtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, const float* a, - lapack_int lda, const float* tau, float* c, - lapack_int ldc ); -lapack_int LAPACKE_dormtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, const double* a, - lapack_int lda, const double* tau, double* c, - lapack_int ldc ); - -lapack_int LAPACKE_spbcon( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const float* ab, lapack_int ldab, - float anorm, float* rcond ); -lapack_int LAPACKE_dpbcon( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const double* ab, lapack_int ldab, - double anorm, double* rcond ); -lapack_int LAPACKE_cpbcon( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_float* ab, - lapack_int ldab, float anorm, float* rcond ); -lapack_int LAPACKE_zpbcon( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_double* ab, - lapack_int ldab, double anorm, double* rcond ); - -lapack_int LAPACKE_spbequ( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const float* ab, lapack_int ldab, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_dpbequ( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const double* ab, lapack_int ldab, - double* s, double* scond, double* amax ); -lapack_int LAPACKE_cpbequ( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_float* ab, - lapack_int ldab, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_zpbequ( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_double* ab, - lapack_int ldab, double* s, double* scond, - double* amax ); - -lapack_int LAPACKE_spbrfs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, const float* ab, - lapack_int ldab, const float* afb, lapack_int ldafb, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* ferr, float* berr ); -lapack_int LAPACKE_dpbrfs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, const double* ab, - lapack_int ldab, const double* afb, lapack_int ldafb, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr ); -lapack_int LAPACKE_cpbrfs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* afb, lapack_int ldafb, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zpbrfs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_double* ab, lapack_int ldab, - const lapack_complex_double* afb, lapack_int ldafb, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_spbstf( int matrix_order, char uplo, lapack_int n, - lapack_int kb, float* bb, lapack_int ldbb ); -lapack_int LAPACKE_dpbstf( int matrix_order, char uplo, lapack_int n, - lapack_int kb, double* bb, lapack_int ldbb ); -lapack_int LAPACKE_cpbstf( int matrix_order, char uplo, lapack_int n, - lapack_int kb, lapack_complex_float* bb, - lapack_int ldbb ); -lapack_int LAPACKE_zpbstf( int matrix_order, char uplo, lapack_int n, - lapack_int kb, lapack_complex_double* bb, - lapack_int ldbb ); - -lapack_int LAPACKE_spbsv( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, float* ab, - lapack_int ldab, float* b, lapack_int ldb ); -lapack_int LAPACKE_dpbsv( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, double* ab, - lapack_int ldab, double* b, lapack_int ldb ); -lapack_int LAPACKE_cpbsv( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpbsv( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spbsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, float* ab, - lapack_int ldab, float* afb, lapack_int ldafb, - char* equed, float* s, float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_dpbsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, double* ab, - lapack_int ldab, double* afb, lapack_int ldafb, - char* equed, double* s, double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* ferr, double* berr ); -lapack_int LAPACKE_cpbsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* afb, lapack_int ldafb, - char* equed, float* s, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_zpbsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* afb, lapack_int ldafb, - char* equed, double* s, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr ); - -lapack_int LAPACKE_spbtrf( int matrix_order, char uplo, lapack_int n, - lapack_int kd, float* ab, lapack_int ldab ); -lapack_int LAPACKE_dpbtrf( int matrix_order, char uplo, lapack_int n, - lapack_int kd, double* ab, lapack_int ldab ); -lapack_int LAPACKE_cpbtrf( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_complex_float* ab, - lapack_int ldab ); -lapack_int LAPACKE_zpbtrf( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_complex_double* ab, - lapack_int ldab ); - -lapack_int LAPACKE_spbtrs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, const float* ab, - lapack_int ldab, float* b, lapack_int ldb ); -lapack_int LAPACKE_dpbtrs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, const double* ab, - lapack_int ldab, double* b, lapack_int ldb ); -lapack_int LAPACKE_cpbtrs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpbtrs( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spftrf( int matrix_order, char transr, char uplo, - lapack_int n, float* a ); -lapack_int LAPACKE_dpftrf( int matrix_order, char transr, char uplo, - lapack_int n, double* a ); -lapack_int LAPACKE_cpftrf( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_float* a ); -lapack_int LAPACKE_zpftrf( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_double* a ); - -lapack_int LAPACKE_spftri( int matrix_order, char transr, char uplo, - lapack_int n, float* a ); -lapack_int LAPACKE_dpftri( int matrix_order, char transr, char uplo, - lapack_int n, double* a ); -lapack_int LAPACKE_cpftri( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_float* a ); -lapack_int LAPACKE_zpftri( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_double* a ); - -lapack_int LAPACKE_spftrs( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, const float* a, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dpftrs( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, const double* a, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cpftrs( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpftrs( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spocon( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, float anorm, - float* rcond ); -lapack_int LAPACKE_dpocon( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, double anorm, - double* rcond ); -lapack_int LAPACKE_cpocon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float anorm, float* rcond ); -lapack_int LAPACKE_zpocon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double anorm, double* rcond ); - -lapack_int LAPACKE_spoequ( int matrix_order, lapack_int n, const float* a, - lapack_int lda, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_dpoequ( int matrix_order, lapack_int n, const double* a, - lapack_int lda, double* s, double* scond, - double* amax ); -lapack_int LAPACKE_cpoequ( int matrix_order, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_zpoequ( int matrix_order, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax ); - -lapack_int LAPACKE_spoequb( int matrix_order, lapack_int n, const float* a, - lapack_int lda, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_dpoequb( int matrix_order, lapack_int n, const double* a, - lapack_int lda, double* s, double* scond, - double* amax ); -lapack_int LAPACKE_cpoequb( int matrix_order, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_zpoequb( int matrix_order, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax ); - -lapack_int LAPACKE_sporfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const float* af, lapack_int ldaf, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_dporfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - const double* af, lapack_int ldaf, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr ); -lapack_int LAPACKE_cporfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* ferr, float* berr ); -lapack_int LAPACKE_zporfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* ferr, double* berr ); - -lapack_int LAPACKE_sporfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* af, lapack_int ldaf, - const float* s, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dporfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* af, lapack_int ldaf, - const double* s, const double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); -lapack_int LAPACKE_cporfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, lapack_int ldaf, - const float* s, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_zporfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, lapack_int ldaf, - const double* s, const lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); - -lapack_int LAPACKE_sposv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dposv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cposv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zposv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb ); -lapack_int LAPACKE_dsposv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, double* x, lapack_int ldx, - lapack_int* iter ); -lapack_int LAPACKE_zcposv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, lapack_int* iter ); - -lapack_int LAPACKE_sposvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, float* af, - lapack_int ldaf, char* equed, float* s, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_dposvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* af, lapack_int ldaf, char* equed, double* s, - double* b, lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); -lapack_int LAPACKE_cposvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* af, - lapack_int ldaf, char* equed, float* s, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zposvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* af, - lapack_int ldaf, char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_sposvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - char* equed, float* s, float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params ); -lapack_int LAPACKE_dposvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - char* equed, double* s, double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); -lapack_int LAPACKE_cposvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - char* equed, float* s, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* rpvgrw, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params ); -lapack_int LAPACKE_zposvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - char* equed, double* s, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* rpvgrw, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); - -lapack_int LAPACKE_spotrf( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda ); -lapack_int LAPACKE_dpotrf( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda ); -lapack_int LAPACKE_cpotrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zpotrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_spotri( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda ); -lapack_int LAPACKE_dpotri( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda ); -lapack_int LAPACKE_cpotri( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zpotri( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_spotrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dpotrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cpotrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zpotrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sppcon( int matrix_order, char uplo, lapack_int n, - const float* ap, float anorm, float* rcond ); -lapack_int LAPACKE_dppcon( int matrix_order, char uplo, lapack_int n, - const double* ap, double anorm, double* rcond ); -lapack_int LAPACKE_cppcon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, float anorm, - float* rcond ); -lapack_int LAPACKE_zppcon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, double anorm, - double* rcond ); - -lapack_int LAPACKE_sppequ( int matrix_order, char uplo, lapack_int n, - const float* ap, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_dppequ( int matrix_order, char uplo, lapack_int n, - const double* ap, double* s, double* scond, - double* amax ); -lapack_int LAPACKE_cppequ( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, float* s, - float* scond, float* amax ); -lapack_int LAPACKE_zppequ( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, double* s, - double* scond, double* amax ); - -lapack_int LAPACKE_spprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, const float* afp, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* ferr, float* berr ); -lapack_int LAPACKE_dpprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, const double* afp, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr ); -lapack_int LAPACKE_cpprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zpprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_sppsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* ap, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dppsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* ap, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cppsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zppsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sppsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, float* ap, float* afp, char* equed, - float* s, float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_dppsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, double* ap, double* afp, - char* equed, double* s, double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* ferr, double* berr ); -lapack_int LAPACKE_cppsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_complex_float* afp, char* equed, float* s, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zppsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_complex_double* afp, char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_spptrf( int matrix_order, char uplo, lapack_int n, - float* ap ); -lapack_int LAPACKE_dpptrf( int matrix_order, char uplo, lapack_int n, - double* ap ); -lapack_int LAPACKE_cpptrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap ); -lapack_int LAPACKE_zpptrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap ); - -lapack_int LAPACKE_spptri( int matrix_order, char uplo, lapack_int n, - float* ap ); -lapack_int LAPACKE_dpptri( int matrix_order, char uplo, lapack_int n, - double* ap ); -lapack_int LAPACKE_cpptri( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap ); -lapack_int LAPACKE_zpptri( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap ); - -lapack_int LAPACKE_spptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dpptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cpptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spstrf( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda, lapack_int* piv, lapack_int* rank, - float tol ); -lapack_int LAPACKE_dpstrf( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda, lapack_int* piv, lapack_int* rank, - double tol ); -lapack_int LAPACKE_cpstrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* piv, lapack_int* rank, float tol ); -lapack_int LAPACKE_zpstrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* piv, lapack_int* rank, double tol ); - -lapack_int LAPACKE_sptcon( lapack_int n, const float* d, const float* e, - float anorm, float* rcond ); -lapack_int LAPACKE_dptcon( lapack_int n, const double* d, const double* e, - double anorm, double* rcond ); -lapack_int LAPACKE_cptcon( lapack_int n, const float* d, - const lapack_complex_float* e, float anorm, - float* rcond ); -lapack_int LAPACKE_zptcon( lapack_int n, const double* d, - const lapack_complex_double* e, double anorm, - double* rcond ); - -lapack_int LAPACKE_spteqr( int matrix_order, char compz, lapack_int n, float* d, - float* e, float* z, lapack_int ldz ); -lapack_int LAPACKE_dpteqr( int matrix_order, char compz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz ); -lapack_int LAPACKE_cpteqr( int matrix_order, char compz, lapack_int n, float* d, - float* e, lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zpteqr( int matrix_order, char compz, lapack_int n, - double* d, double* e, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_sptrfs( int matrix_order, lapack_int n, lapack_int nrhs, - const float* d, const float* e, const float* df, - const float* ef, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* ferr, float* berr ); -lapack_int LAPACKE_dptrfs( int matrix_order, lapack_int n, lapack_int nrhs, - const double* d, const double* e, const double* df, - const double* ef, const double* b, lapack_int ldb, - double* x, lapack_int ldx, double* ferr, - double* berr ); -lapack_int LAPACKE_cptrfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* d, - const lapack_complex_float* e, const float* df, - const lapack_complex_float* ef, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zptrfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* d, - const lapack_complex_double* e, const double* df, - const lapack_complex_double* ef, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_sptsv( int matrix_order, lapack_int n, lapack_int nrhs, - float* d, float* e, float* b, lapack_int ldb ); -lapack_int LAPACKE_dptsv( int matrix_order, lapack_int n, lapack_int nrhs, - double* d, double* e, double* b, lapack_int ldb ); -lapack_int LAPACKE_cptsv( int matrix_order, lapack_int n, lapack_int nrhs, - float* d, lapack_complex_float* e, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zptsv( int matrix_order, lapack_int n, lapack_int nrhs, - double* d, lapack_complex_double* e, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sptsvx( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const float* d, const float* e, - float* df, float* ef, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_dptsvx( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const double* d, const double* e, - double* df, double* ef, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); -lapack_int LAPACKE_cptsvx( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const float* d, - const lapack_complex_float* e, float* df, - lapack_complex_float* ef, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zptsvx( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const double* d, - const lapack_complex_double* e, double* df, - lapack_complex_double* ef, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_spttrf( lapack_int n, float* d, float* e ); -lapack_int LAPACKE_dpttrf( lapack_int n, double* d, double* e ); -lapack_int LAPACKE_cpttrf( lapack_int n, float* d, lapack_complex_float* e ); -lapack_int LAPACKE_zpttrf( lapack_int n, double* d, lapack_complex_double* e ); - -lapack_int LAPACKE_spttrs( int matrix_order, lapack_int n, lapack_int nrhs, - const float* d, const float* e, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dpttrs( int matrix_order, lapack_int n, lapack_int nrhs, - const double* d, const double* e, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cpttrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* d, - const lapack_complex_float* e, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpttrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* d, - const lapack_complex_double* e, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_ssbev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, float* ab, lapack_int ldab, float* w, - float* z, lapack_int ldz ); -lapack_int LAPACKE_dsbev( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, double* ab, lapack_int ldab, double* w, - double* z, lapack_int ldz ); - -lapack_int LAPACKE_ssbevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, float* ab, lapack_int ldab, float* w, - float* z, lapack_int ldz ); -lapack_int LAPACKE_dsbevd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int kd, double* ab, lapack_int ldab, - double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_ssbevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int kd, float* ab, - lapack_int ldab, float* q, lapack_int ldq, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_dsbevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int kd, double* ab, - lapack_int ldab, double* q, lapack_int ldq, - double vl, double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* ifail ); - -lapack_int LAPACKE_ssbgst( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, float* ab, - lapack_int ldab, const float* bb, lapack_int ldbb, - float* x, lapack_int ldx ); -lapack_int LAPACKE_dsbgst( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, double* ab, - lapack_int ldab, const double* bb, lapack_int ldbb, - double* x, lapack_int ldx ); - -lapack_int LAPACKE_ssbgv( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, float* ab, - lapack_int ldab, float* bb, lapack_int ldbb, float* w, - float* z, lapack_int ldz ); -lapack_int LAPACKE_dsbgv( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, double* ab, - lapack_int ldab, double* bb, lapack_int ldbb, - double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_ssbgvd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, float* ab, - lapack_int ldab, float* bb, lapack_int ldbb, - float* w, float* z, lapack_int ldz ); -lapack_int LAPACKE_dsbgvd( int matrix_order, char jobz, char uplo, lapack_int n, - lapack_int ka, lapack_int kb, double* ab, - lapack_int ldab, double* bb, lapack_int ldbb, - double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_ssbgvx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - float* ab, lapack_int ldab, float* bb, - lapack_int ldbb, float* q, lapack_int ldq, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_dsbgvx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - double* ab, lapack_int ldab, double* bb, - lapack_int ldbb, double* q, lapack_int ldq, - double vl, double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* ifail ); - -lapack_int LAPACKE_ssbtrd( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int kd, float* ab, lapack_int ldab, float* d, - float* e, float* q, lapack_int ldq ); -lapack_int LAPACKE_dsbtrd( int matrix_order, char vect, char uplo, lapack_int n, - lapack_int kd, double* ab, lapack_int ldab, - double* d, double* e, double* q, lapack_int ldq ); - -lapack_int LAPACKE_ssfrk( int matrix_order, char transr, char uplo, char trans, - lapack_int n, lapack_int k, float alpha, - const float* a, lapack_int lda, float beta, - float* c ); -lapack_int LAPACKE_dsfrk( int matrix_order, char transr, char uplo, char trans, - lapack_int n, lapack_int k, double alpha, - const double* a, lapack_int lda, double beta, - double* c ); - -lapack_int LAPACKE_sspcon( int matrix_order, char uplo, lapack_int n, - const float* ap, const lapack_int* ipiv, float anorm, - float* rcond ); -lapack_int LAPACKE_dspcon( int matrix_order, char uplo, lapack_int n, - const double* ap, const lapack_int* ipiv, - double anorm, double* rcond ); -lapack_int LAPACKE_cspcon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_zspcon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - const lapack_int* ipiv, double anorm, - double* rcond ); - -lapack_int LAPACKE_sspev( int matrix_order, char jobz, char uplo, lapack_int n, - float* ap, float* w, float* z, lapack_int ldz ); -lapack_int LAPACKE_dspev( int matrix_order, char jobz, char uplo, lapack_int n, - double* ap, double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_sspevd( int matrix_order, char jobz, char uplo, lapack_int n, - float* ap, float* w, float* z, lapack_int ldz ); -lapack_int LAPACKE_dspevd( int matrix_order, char jobz, char uplo, lapack_int n, - double* ap, double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_sspevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, float* ap, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_dspevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, double* ap, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_sspgst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, float* ap, const float* bp ); -lapack_int LAPACKE_dspgst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, double* ap, const double* bp ); - -lapack_int LAPACKE_sspgv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* ap, float* bp, - float* w, float* z, lapack_int ldz ); -lapack_int LAPACKE_dspgv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* ap, double* bp, - double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_sspgvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* ap, float* bp, - float* w, float* z, lapack_int ldz ); -lapack_int LAPACKE_dspgvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* ap, double* bp, - double* w, double* z, lapack_int ldz ); - -lapack_int LAPACKE_sspgvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, float* ap, - float* bp, float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, float* w, - float* z, lapack_int ldz, lapack_int* ifail ); -lapack_int LAPACKE_dspgvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, double* ap, - double* bp, double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, double* z, lapack_int ldz, - lapack_int* ifail ); - -lapack_int LAPACKE_ssprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, const float* afp, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_dsprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, const double* afp, - const lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr ); -lapack_int LAPACKE_csprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zsprfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_sspsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* ap, lapack_int* ipiv, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dspsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* ap, lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cspsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zspsv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sspsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, float* afp, - lapack_int* ipiv, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_dspsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, double* afp, - lapack_int* ipiv, const double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* ferr, double* berr ); -lapack_int LAPACKE_cspsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - lapack_complex_float* afp, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zspsvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - lapack_complex_double* afp, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_ssptrd( int matrix_order, char uplo, lapack_int n, float* ap, - float* d, float* e, float* tau ); -lapack_int LAPACKE_dsptrd( int matrix_order, char uplo, lapack_int n, - double* ap, double* d, double* e, double* tau ); - -lapack_int LAPACKE_ssptrf( int matrix_order, char uplo, lapack_int n, float* ap, - lapack_int* ipiv ); -lapack_int LAPACKE_dsptrf( int matrix_order, char uplo, lapack_int n, - double* ap, lapack_int* ipiv ); -lapack_int LAPACKE_csptrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, lapack_int* ipiv ); -lapack_int LAPACKE_zsptrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, lapack_int* ipiv ); - -lapack_int LAPACKE_ssptri( int matrix_order, char uplo, lapack_int n, float* ap, - const lapack_int* ipiv ); -lapack_int LAPACKE_dsptri( int matrix_order, char uplo, lapack_int n, - double* ap, const lapack_int* ipiv ); -lapack_int LAPACKE_csptri( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, const lapack_int* ipiv ); -lapack_int LAPACKE_zsptri( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, const lapack_int* ipiv ); - -lapack_int LAPACKE_ssptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, - const lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_dsptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, - const lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_csptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zsptrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* ap, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sstebz( char range, char order, lapack_int n, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - const float* d, const float* e, lapack_int* m, - lapack_int* nsplit, float* w, lapack_int* iblock, - lapack_int* isplit ); -lapack_int LAPACKE_dstebz( char range, char order, lapack_int n, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, const double* d, const double* e, - lapack_int* m, lapack_int* nsplit, double* w, - lapack_int* iblock, lapack_int* isplit ); - -lapack_int LAPACKE_sstedc( int matrix_order, char compz, lapack_int n, float* d, - float* e, float* z, lapack_int ldz ); -lapack_int LAPACKE_dstedc( int matrix_order, char compz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz ); -lapack_int LAPACKE_cstedc( int matrix_order, char compz, lapack_int n, float* d, - float* e, lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zstedc( int matrix_order, char compz, lapack_int n, - double* d, double* e, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_sstegr( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* isuppz ); -lapack_int LAPACKE_dstegr( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* isuppz ); -lapack_int LAPACKE_cstegr( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int ldz, lapack_int* isuppz ); -lapack_int LAPACKE_zstegr( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* isuppz ); - -lapack_int LAPACKE_sstein( int matrix_order, lapack_int n, const float* d, - const float* e, lapack_int m, const float* w, - const lapack_int* iblock, const lapack_int* isplit, - float* z, lapack_int ldz, lapack_int* ifailv ); -lapack_int LAPACKE_dstein( int matrix_order, lapack_int n, const double* d, - const double* e, lapack_int m, const double* w, - const lapack_int* iblock, const lapack_int* isplit, - double* z, lapack_int ldz, lapack_int* ifailv ); -lapack_int LAPACKE_cstein( int matrix_order, lapack_int n, const float* d, - const float* e, lapack_int m, const float* w, - const lapack_int* iblock, const lapack_int* isplit, - lapack_complex_float* z, lapack_int ldz, - lapack_int* ifailv ); -lapack_int LAPACKE_zstein( int matrix_order, lapack_int n, const double* d, - const double* e, lapack_int m, const double* w, - const lapack_int* iblock, const lapack_int* isplit, - lapack_complex_double* z, lapack_int ldz, - lapack_int* ifailv ); - -lapack_int LAPACKE_sstemr( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, float vu, - lapack_int il, lapack_int iu, lapack_int* m, - float* w, float* z, lapack_int ldz, lapack_int nzc, - lapack_int* isuppz, lapack_logical* tryrac ); -lapack_int LAPACKE_dstemr( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - lapack_int* m, double* w, double* z, lapack_int ldz, - lapack_int nzc, lapack_int* isuppz, - lapack_logical* tryrac ); -lapack_int LAPACKE_cstemr( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, float vu, - lapack_int il, lapack_int iu, lapack_int* m, - float* w, lapack_complex_float* z, lapack_int ldz, - lapack_int nzc, lapack_int* isuppz, - lapack_logical* tryrac ); -lapack_int LAPACKE_zstemr( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int ldz, lapack_int nzc, lapack_int* isuppz, - lapack_logical* tryrac ); - -lapack_int LAPACKE_ssteqr( int matrix_order, char compz, lapack_int n, float* d, - float* e, float* z, lapack_int ldz ); -lapack_int LAPACKE_dsteqr( int matrix_order, char compz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz ); -lapack_int LAPACKE_csteqr( int matrix_order, char compz, lapack_int n, float* d, - float* e, lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zsteqr( int matrix_order, char compz, lapack_int n, - double* d, double* e, lapack_complex_double* z, - lapack_int ldz ); - -lapack_int LAPACKE_ssterf( lapack_int n, float* d, float* e ); -lapack_int LAPACKE_dsterf( lapack_int n, double* d, double* e ); - -lapack_int LAPACKE_sstev( int matrix_order, char jobz, lapack_int n, float* d, - float* e, float* z, lapack_int ldz ); -lapack_int LAPACKE_dstev( int matrix_order, char jobz, lapack_int n, double* d, - double* e, double* z, lapack_int ldz ); - -lapack_int LAPACKE_sstevd( int matrix_order, char jobz, lapack_int n, float* d, - float* e, float* z, lapack_int ldz ); -lapack_int LAPACKE_dstevd( int matrix_order, char jobz, lapack_int n, double* d, - double* e, double* z, lapack_int ldz ); - -lapack_int LAPACKE_sstevr( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* isuppz ); -lapack_int LAPACKE_dstevr( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* isuppz ); - -lapack_int LAPACKE_sstevx( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_dstevx( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* ifail ); - -lapack_int LAPACKE_ssycon( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_dsycon( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, - const lapack_int* ipiv, double anorm, - double* rcond ); -lapack_int LAPACKE_csycon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, float anorm, float* rcond ); -lapack_int LAPACKE_zsycon( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, double anorm, - double* rcond ); - -lapack_int LAPACKE_ssyequb( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, float* s, - float* scond, float* amax ); -lapack_int LAPACKE_dsyequb( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, double* s, - double* scond, double* amax ); -lapack_int LAPACKE_csyequb( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_zsyequb( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax ); - -lapack_int LAPACKE_ssyev( int matrix_order, char jobz, char uplo, lapack_int n, - float* a, lapack_int lda, float* w ); -lapack_int LAPACKE_dsyev( int matrix_order, char jobz, char uplo, lapack_int n, - double* a, lapack_int lda, double* w ); - -lapack_int LAPACKE_ssyevd( int matrix_order, char jobz, char uplo, lapack_int n, - float* a, lapack_int lda, float* w ); -lapack_int LAPACKE_dsyevd( int matrix_order, char jobz, char uplo, lapack_int n, - double* a, lapack_int lda, double* w ); - -lapack_int LAPACKE_ssyevr( int matrix_order, char jobz, char range, char uplo, - lapack_int n, float* a, lapack_int lda, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* isuppz ); -lapack_int LAPACKE_dsyevr( int matrix_order, char jobz, char range, char uplo, - lapack_int n, double* a, lapack_int lda, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* isuppz ); - -lapack_int LAPACKE_ssyevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, float* a, lapack_int lda, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_dsyevx( int matrix_order, char jobz, char range, char uplo, - lapack_int n, double* a, lapack_int lda, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* ifail ); - -lapack_int LAPACKE_ssygst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, float* a, lapack_int lda, - const float* b, lapack_int ldb ); -lapack_int LAPACKE_dsygst( int matrix_order, lapack_int itype, char uplo, - lapack_int n, double* a, lapack_int lda, - const double* b, lapack_int ldb ); - -lapack_int LAPACKE_ssygv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* a, lapack_int lda, - float* b, lapack_int ldb, float* w ); -lapack_int LAPACKE_dsygv( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* a, lapack_int lda, - double* b, lapack_int ldb, double* w ); - -lapack_int LAPACKE_ssygvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* a, lapack_int lda, - float* b, lapack_int ldb, float* w ); -lapack_int LAPACKE_dsygvd( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* a, lapack_int lda, - double* b, lapack_int ldb, double* w ); - -lapack_int LAPACKE_ssygvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, float vl, - float vu, lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, lapack_int ldz, - lapack_int* ifail ); -lapack_int LAPACKE_dsygvx( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* ifail ); - -lapack_int LAPACKE_ssyrfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_dsyrfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - const double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr ); -lapack_int LAPACKE_csyrfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_zsyrfs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_ssyrfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* s, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dsyrfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* s, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); -lapack_int LAPACKE_csyrfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* s, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params ); -lapack_int LAPACKE_zsyrfsx( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, lapack_int ldaf, - const lapack_int* ipiv, const double* s, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params ); - -lapack_int LAPACKE_ssysv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, - lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_dsysv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_csysv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zsysv( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_ssysvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - float* af, lapack_int ldaf, lapack_int* ipiv, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr ); -lapack_int LAPACKE_dsysvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - double* af, lapack_int ldaf, lapack_int* ipiv, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr ); -lapack_int LAPACKE_csysvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* af, - lapack_int ldaf, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr ); -lapack_int LAPACKE_zsysvx( int matrix_order, char fact, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* af, - lapack_int ldaf, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr ); - -lapack_int LAPACKE_ssysvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* s, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_dsysvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* s, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); -lapack_int LAPACKE_csysvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* s, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params ); -lapack_int LAPACKE_zsysvxx( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params ); - -lapack_int LAPACKE_ssytrd( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda, float* d, float* e, float* tau ); -lapack_int LAPACKE_dsytrd( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda, double* d, double* e, double* tau ); - -lapack_int LAPACKE_ssytrf( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_dsytrf( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_csytrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv ); -lapack_int LAPACKE_zsytrf( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv ); - -lapack_int LAPACKE_ssytri( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_dsytri( int matrix_order, char uplo, lapack_int n, double* a, - lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_csytri( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_zsytri( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv ); - -lapack_int LAPACKE_ssytrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_dsytrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - const lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_csytrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zsytrs( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stbcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, lapack_int kd, const float* ab, - lapack_int ldab, float* rcond ); -lapack_int LAPACKE_dtbcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, lapack_int kd, const double* ab, - lapack_int ldab, double* rcond ); -lapack_int LAPACKE_ctbcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, lapack_int kd, - const lapack_complex_float* ab, lapack_int ldab, - float* rcond ); -lapack_int LAPACKE_ztbcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, lapack_int kd, - const lapack_complex_double* ab, lapack_int ldab, - double* rcond ); - -lapack_int LAPACKE_stbrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const float* ab, lapack_int ldab, const float* b, - lapack_int ldb, const float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_dtbrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const double* ab, lapack_int ldab, const double* b, - lapack_int ldb, const double* x, lapack_int ldx, - double* ferr, double* berr ); -lapack_int LAPACKE_ctbrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_ztbrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const lapack_complex_double* ab, lapack_int ldab, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_stbtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const float* ab, lapack_int ldab, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dtbtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const double* ab, lapack_int ldab, double* b, - lapack_int ldb ); -lapack_int LAPACKE_ctbtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztbtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int kd, lapack_int nrhs, - const lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stfsm( int matrix_order, char transr, char side, char uplo, - char trans, char diag, lapack_int m, lapack_int n, - float alpha, const float* a, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dtfsm( int matrix_order, char transr, char side, char uplo, - char trans, char diag, lapack_int m, lapack_int n, - double alpha, const double* a, double* b, - lapack_int ldb ); -lapack_int LAPACKE_ctfsm( int matrix_order, char transr, char side, char uplo, - char trans, char diag, lapack_int m, lapack_int n, - lapack_complex_float alpha, - const lapack_complex_float* a, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztfsm( int matrix_order, char transr, char side, char uplo, - char trans, char diag, lapack_int m, lapack_int n, - lapack_complex_double alpha, - const lapack_complex_double* a, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stftri( int matrix_order, char transr, char uplo, char diag, - lapack_int n, float* a ); -lapack_int LAPACKE_dtftri( int matrix_order, char transr, char uplo, char diag, - lapack_int n, double* a ); -lapack_int LAPACKE_ctftri( int matrix_order, char transr, char uplo, char diag, - lapack_int n, lapack_complex_float* a ); -lapack_int LAPACKE_ztftri( int matrix_order, char transr, char uplo, char diag, - lapack_int n, lapack_complex_double* a ); - -lapack_int LAPACKE_stfttp( int matrix_order, char transr, char uplo, - lapack_int n, const float* arf, float* ap ); -lapack_int LAPACKE_dtfttp( int matrix_order, char transr, char uplo, - lapack_int n, const double* arf, double* ap ); -lapack_int LAPACKE_ctfttp( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* arf, - lapack_complex_float* ap ); -lapack_int LAPACKE_ztfttp( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* arf, - lapack_complex_double* ap ); - -lapack_int LAPACKE_stfttr( int matrix_order, char transr, char uplo, - lapack_int n, const float* arf, float* a, - lapack_int lda ); -lapack_int LAPACKE_dtfttr( int matrix_order, char transr, char uplo, - lapack_int n, const double* arf, double* a, - lapack_int lda ); -lapack_int LAPACKE_ctfttr( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* arf, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_ztfttr( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* arf, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_stgevc( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const float* s, lapack_int lds, const float* p, - lapack_int ldp, float* vl, lapack_int ldvl, - float* vr, lapack_int ldvr, lapack_int mm, - lapack_int* m ); -lapack_int LAPACKE_dtgevc( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const double* s, lapack_int lds, const double* p, - lapack_int ldp, double* vl, lapack_int ldvl, - double* vr, lapack_int ldvr, lapack_int mm, - lapack_int* m ); -lapack_int LAPACKE_ctgevc( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* s, lapack_int lds, - const lapack_complex_float* p, lapack_int ldp, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_ztgevc( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* s, lapack_int lds, - const lapack_complex_double* p, lapack_int ldp, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m ); - -lapack_int LAPACKE_stgexc( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, float* q, - lapack_int ldq, float* z, lapack_int ldz, - lapack_int* ifst, lapack_int* ilst ); -lapack_int LAPACKE_dtgexc( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, double* q, - lapack_int ldq, double* z, lapack_int ldz, - lapack_int* ifst, lapack_int* ilst ); -lapack_int LAPACKE_ctgexc( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* z, lapack_int ldz, - lapack_int ifst, lapack_int ilst ); -lapack_int LAPACKE_ztgexc( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz, - lapack_int ifst, lapack_int ilst ); - -lapack_int LAPACKE_stgsen( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* alphar, float* alphai, float* beta, float* q, - lapack_int ldq, float* z, lapack_int ldz, - lapack_int* m, float* pl, float* pr, float* dif ); -lapack_int LAPACKE_dtgsen( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - double* a, lapack_int lda, double* b, lapack_int ldb, - double* alphar, double* alphai, double* beta, - double* q, lapack_int ldq, double* z, lapack_int ldz, - lapack_int* m, double* pl, double* pr, double* dif ); -lapack_int LAPACKE_ctgsen( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* alpha, - lapack_complex_float* beta, lapack_complex_float* q, - lapack_int ldq, lapack_complex_float* z, - lapack_int ldz, lapack_int* m, float* pl, float* pr, - float* dif ); -lapack_int LAPACKE_ztgsen( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz, - lapack_int* m, double* pl, double* pr, double* dif ); - -lapack_int LAPACKE_stgsja( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, - lapack_int k, lapack_int l, float* a, lapack_int lda, - float* b, lapack_int ldb, float tola, float tolb, - float* alpha, float* beta, float* u, lapack_int ldu, - float* v, lapack_int ldv, float* q, lapack_int ldq, - lapack_int* ncycle ); -lapack_int LAPACKE_dtgsja( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, - lapack_int k, lapack_int l, double* a, - lapack_int lda, double* b, lapack_int ldb, - double tola, double tolb, double* alpha, - double* beta, double* u, lapack_int ldu, double* v, - lapack_int ldv, double* q, lapack_int ldq, - lapack_int* ncycle ); -lapack_int LAPACKE_ctgsja( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, - lapack_int k, lapack_int l, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float tola, float tolb, float* alpha, - float* beta, lapack_complex_float* u, lapack_int ldu, - lapack_complex_float* v, lapack_int ldv, - lapack_complex_float* q, lapack_int ldq, - lapack_int* ncycle ); -lapack_int LAPACKE_ztgsja( int matrix_order, char jobu, char jobv, char jobq, - lapack_int m, lapack_int p, lapack_int n, - lapack_int k, lapack_int l, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double tola, double tolb, - double* alpha, double* beta, - lapack_complex_double* u, lapack_int ldu, - lapack_complex_double* v, lapack_int ldv, - lapack_complex_double* q, lapack_int ldq, - lapack_int* ncycle ); - -lapack_int LAPACKE_stgsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const float* a, lapack_int lda, const float* b, - lapack_int ldb, const float* vl, lapack_int ldvl, - const float* vr, lapack_int ldvr, float* s, - float* dif, lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_dtgsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const double* a, lapack_int lda, const double* b, - lapack_int ldb, const double* vl, lapack_int ldvl, - const double* vr, lapack_int ldvr, double* s, - double* dif, lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_ctgsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* vl, lapack_int ldvl, - const lapack_complex_float* vr, lapack_int ldvr, - float* s, float* dif, lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_ztgsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* vl, lapack_int ldvl, - const lapack_complex_double* vr, lapack_int ldvr, - double* s, double* dif, lapack_int mm, - lapack_int* m ); - -lapack_int LAPACKE_stgsyl( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, const float* a, - lapack_int lda, const float* b, lapack_int ldb, - float* c, lapack_int ldc, const float* d, - lapack_int ldd, const float* e, lapack_int lde, - float* f, lapack_int ldf, float* scale, float* dif ); -lapack_int LAPACKE_dtgsyl( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, const double* a, - lapack_int lda, const double* b, lapack_int ldb, - double* c, lapack_int ldc, const double* d, - lapack_int ldd, const double* e, lapack_int lde, - double* f, lapack_int ldf, double* scale, - double* dif ); -lapack_int LAPACKE_ctgsyl( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* c, lapack_int ldc, - const lapack_complex_float* d, lapack_int ldd, - const lapack_complex_float* e, lapack_int lde, - lapack_complex_float* f, lapack_int ldf, - float* scale, float* dif ); -lapack_int LAPACKE_ztgsyl( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* c, lapack_int ldc, - const lapack_complex_double* d, lapack_int ldd, - const lapack_complex_double* e, lapack_int lde, - lapack_complex_double* f, lapack_int ldf, - double* scale, double* dif ); - -lapack_int LAPACKE_stpcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const float* ap, float* rcond ); -lapack_int LAPACKE_dtpcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const double* ap, double* rcond ); -lapack_int LAPACKE_ctpcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const lapack_complex_float* ap, - float* rcond ); -lapack_int LAPACKE_ztpcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const lapack_complex_double* ap, - double* rcond ); - -lapack_int LAPACKE_stprfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const float* ap, - const float* b, lapack_int ldb, const float* x, - lapack_int ldx, float* ferr, float* berr ); -lapack_int LAPACKE_dtprfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const double* ap, - const double* b, lapack_int ldb, const double* x, - lapack_int ldx, double* ferr, double* berr ); -lapack_int LAPACKE_ctprfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* ap, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_ztprfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_stptri( int matrix_order, char uplo, char diag, lapack_int n, - float* ap ); -lapack_int LAPACKE_dtptri( int matrix_order, char uplo, char diag, lapack_int n, - double* ap ); -lapack_int LAPACKE_ctptri( int matrix_order, char uplo, char diag, lapack_int n, - lapack_complex_float* ap ); -lapack_int LAPACKE_ztptri( int matrix_order, char uplo, char diag, lapack_int n, - lapack_complex_double* ap ); - -lapack_int LAPACKE_stptrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const float* ap, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dtptrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const double* ap, - double* b, lapack_int ldb ); -lapack_int LAPACKE_ctptrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* ap, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztptrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* ap, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stpttf( int matrix_order, char transr, char uplo, - lapack_int n, const float* ap, float* arf ); -lapack_int LAPACKE_dtpttf( int matrix_order, char transr, char uplo, - lapack_int n, const double* ap, double* arf ); -lapack_int LAPACKE_ctpttf( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* ap, - lapack_complex_float* arf ); -lapack_int LAPACKE_ztpttf( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* ap, - lapack_complex_double* arf ); - -lapack_int LAPACKE_stpttr( int matrix_order, char uplo, lapack_int n, - const float* ap, float* a, lapack_int lda ); -lapack_int LAPACKE_dtpttr( int matrix_order, char uplo, lapack_int n, - const double* ap, double* a, lapack_int lda ); -lapack_int LAPACKE_ctpttr( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_ztpttr( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_strcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const float* a, lapack_int lda, - float* rcond ); -lapack_int LAPACKE_dtrcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const double* a, lapack_int lda, - double* rcond ); -lapack_int LAPACKE_ctrcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, float* rcond ); -lapack_int LAPACKE_ztrcon( int matrix_order, char norm, char uplo, char diag, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, double* rcond ); - -lapack_int LAPACKE_strevc( int matrix_order, char side, char howmny, - lapack_logical* select, lapack_int n, const float* t, - lapack_int ldt, float* vl, lapack_int ldvl, - float* vr, lapack_int ldvr, lapack_int mm, - lapack_int* m ); -lapack_int LAPACKE_dtrevc( int matrix_order, char side, char howmny, - lapack_logical* select, lapack_int n, - const double* t, lapack_int ldt, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_ctrevc( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_ztrevc( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m ); - -lapack_int LAPACKE_strexc( int matrix_order, char compq, lapack_int n, float* t, - lapack_int ldt, float* q, lapack_int ldq, - lapack_int* ifst, lapack_int* ilst ); -lapack_int LAPACKE_dtrexc( int matrix_order, char compq, lapack_int n, - double* t, lapack_int ldt, double* q, lapack_int ldq, - lapack_int* ifst, lapack_int* ilst ); -lapack_int LAPACKE_ctrexc( int matrix_order, char compq, lapack_int n, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* q, lapack_int ldq, - lapack_int ifst, lapack_int ilst ); -lapack_int LAPACKE_ztrexc( int matrix_order, char compq, lapack_int n, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* q, lapack_int ldq, - lapack_int ifst, lapack_int ilst ); - -lapack_int LAPACKE_strrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* b, lapack_int ldb, - const float* x, lapack_int ldx, float* ferr, - float* berr ); -lapack_int LAPACKE_dtrrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* b, lapack_int ldb, - const double* x, lapack_int ldx, double* ferr, - double* berr ); -lapack_int LAPACKE_ctrrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr ); -lapack_int LAPACKE_ztrrfs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr ); - -lapack_int LAPACKE_strsen( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, float* t, - lapack_int ldt, float* q, lapack_int ldq, float* wr, - float* wi, lapack_int* m, float* s, float* sep ); -lapack_int LAPACKE_dtrsen( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - double* t, lapack_int ldt, double* q, lapack_int ldq, - double* wr, double* wi, lapack_int* m, double* s, - double* sep ); -lapack_int LAPACKE_ctrsen( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* w, lapack_int* m, float* s, - float* sep ); -lapack_int LAPACKE_ztrsen( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* w, lapack_int* m, double* s, - double* sep ); - -lapack_int LAPACKE_strsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const float* t, lapack_int ldt, const float* vl, - lapack_int ldvl, const float* vr, lapack_int ldvr, - float* s, float* sep, lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_dtrsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const double* t, lapack_int ldt, const double* vl, - lapack_int ldvl, const double* vr, lapack_int ldvr, - double* s, double* sep, lapack_int mm, - lapack_int* m ); -lapack_int LAPACKE_ctrsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* t, lapack_int ldt, - const lapack_complex_float* vl, lapack_int ldvl, - const lapack_complex_float* vr, lapack_int ldvr, - float* s, float* sep, lapack_int mm, lapack_int* m ); -lapack_int LAPACKE_ztrsna( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* t, lapack_int ldt, - const lapack_complex_double* vl, lapack_int ldvl, - const lapack_complex_double* vr, lapack_int ldvr, - double* s, double* sep, lapack_int mm, - lapack_int* m ); - -lapack_int LAPACKE_strsyl( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const float* a, lapack_int lda, const float* b, - lapack_int ldb, float* c, lapack_int ldc, - float* scale ); -lapack_int LAPACKE_dtrsyl( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const double* a, lapack_int lda, const double* b, - lapack_int ldb, double* c, lapack_int ldc, - double* scale ); -lapack_int LAPACKE_ctrsyl( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* c, lapack_int ldc, - float* scale ); -lapack_int LAPACKE_ztrsyl( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* c, lapack_int ldc, - double* scale ); - -lapack_int LAPACKE_strtri( int matrix_order, char uplo, char diag, lapack_int n, - float* a, lapack_int lda ); -lapack_int LAPACKE_dtrtri( int matrix_order, char uplo, char diag, lapack_int n, - double* a, lapack_int lda ); -lapack_int LAPACKE_ctrtri( int matrix_order, char uplo, char diag, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_ztrtri( int matrix_order, char uplo, char diag, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_strtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, float* b, lapack_int ldb ); -lapack_int LAPACKE_dtrtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, double* b, lapack_int ldb ); -lapack_int LAPACKE_ctrtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztrtrs( int matrix_order, char uplo, char trans, char diag, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_strttf( int matrix_order, char transr, char uplo, - lapack_int n, const float* a, lapack_int lda, - float* arf ); -lapack_int LAPACKE_dtrttf( int matrix_order, char transr, char uplo, - lapack_int n, const double* a, lapack_int lda, - double* arf ); -lapack_int LAPACKE_ctrttf( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* arf ); -lapack_int LAPACKE_ztrttf( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* arf ); - -lapack_int LAPACKE_strttp( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, float* ap ); -lapack_int LAPACKE_dtrttp( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, double* ap ); -lapack_int LAPACKE_ctrttp( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - lapack_complex_float* ap ); -lapack_int LAPACKE_ztrttp( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_double* ap ); - -lapack_int LAPACKE_stzrzf( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau ); -lapack_int LAPACKE_dtzrzf( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau ); -lapack_int LAPACKE_ctzrzf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau ); -lapack_int LAPACKE_ztzrzf( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau ); - -lapack_int LAPACKE_cungbr( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau ); -lapack_int LAPACKE_zungbr( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau ); - -lapack_int LAPACKE_cunghr( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau ); -lapack_int LAPACKE_zunghr( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau ); - -lapack_int LAPACKE_cunglq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau ); -lapack_int LAPACKE_zunglq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau ); - -lapack_int LAPACKE_cungql( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau ); -lapack_int LAPACKE_zungql( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau ); - -lapack_int LAPACKE_cungqr( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau ); -lapack_int LAPACKE_zungqr( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau ); - -lapack_int LAPACKE_cungrq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau ); -lapack_int LAPACKE_zungrq( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau ); - -lapack_int LAPACKE_cungtr( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau ); -lapack_int LAPACKE_zungtr( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau ); - -lapack_int LAPACKE_cunmbr( int matrix_order, char vect, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmbr( int matrix_order, char vect, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmhr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmhr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmlq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmlq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmql( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmql( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmqr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmqr( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmrq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmrq( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmrz( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmrz( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cunmtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zunmtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_cupgtr( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - const lapack_complex_float* tau, - lapack_complex_float* q, lapack_int ldq ); -lapack_int LAPACKE_zupgtr( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - const lapack_complex_double* tau, - lapack_complex_double* q, lapack_int ldq ); - -lapack_int LAPACKE_cupmtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, - const lapack_complex_float* ap, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc ); -lapack_int LAPACKE_zupmtr( int matrix_order, char side, char uplo, char trans, - lapack_int m, lapack_int n, - const lapack_complex_double* ap, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc ); - -lapack_int LAPACKE_sbdsdc_work( int matrix_order, char uplo, char compq, - lapack_int n, float* d, float* e, float* u, - lapack_int ldu, float* vt, lapack_int ldvt, - float* q, lapack_int* iq, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dbdsdc_work( int matrix_order, char uplo, char compq, - lapack_int n, double* d, double* e, double* u, - lapack_int ldu, double* vt, lapack_int ldvt, - double* q, lapack_int* iq, double* work, - lapack_int* iwork ); - -lapack_int LAPACKE_sbdsqr_work( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - float* d, float* e, float* vt, lapack_int ldvt, - float* u, lapack_int ldu, float* c, - lapack_int ldc, float* work ); -lapack_int LAPACKE_dbdsqr_work( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - double* d, double* e, double* vt, - lapack_int ldvt, double* u, lapack_int ldu, - double* c, lapack_int ldc, double* work ); -lapack_int LAPACKE_cbdsqr_work( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - float* d, float* e, lapack_complex_float* vt, - lapack_int ldvt, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* c, - lapack_int ldc, float* work ); -lapack_int LAPACKE_zbdsqr_work( int matrix_order, char uplo, lapack_int n, - lapack_int ncvt, lapack_int nru, lapack_int ncc, - double* d, double* e, lapack_complex_double* vt, - lapack_int ldvt, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* c, - lapack_int ldc, double* work ); - -lapack_int LAPACKE_sdisna_work( char job, lapack_int m, lapack_int n, - const float* d, float* sep ); -lapack_int LAPACKE_ddisna_work( char job, lapack_int m, lapack_int n, - const double* d, double* sep ); - -lapack_int LAPACKE_sgbbrd_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, float* ab, lapack_int ldab, - float* d, float* e, float* q, lapack_int ldq, - float* pt, lapack_int ldpt, float* c, - lapack_int ldc, float* work ); -lapack_int LAPACKE_dgbbrd_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, double* ab, lapack_int ldab, - double* d, double* e, double* q, lapack_int ldq, - double* pt, lapack_int ldpt, double* c, - lapack_int ldc, double* work ); -lapack_int LAPACKE_cgbbrd_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, lapack_complex_float* ab, - lapack_int ldab, float* d, float* e, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* pt, lapack_int ldpt, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgbbrd_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int ncc, lapack_int kl, - lapack_int ku, lapack_complex_double* ab, - lapack_int ldab, double* d, double* e, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* pt, lapack_int ldpt, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgbcon_work( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, const float* ab, - lapack_int ldab, const lapack_int* ipiv, - float anorm, float* rcond, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgbcon_work( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, const double* ab, - lapack_int ldab, const lapack_int* ipiv, - double anorm, double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgbcon_work( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_int* ipiv, float anorm, - float* rcond, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zgbcon_work( int matrix_order, char norm, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_double* ab, - lapack_int ldab, const lapack_int* ipiv, - double anorm, double* rcond, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgbequ_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* ab, - lapack_int ldab, float* r, float* c, - float* rowcnd, float* colcnd, float* amax ); -lapack_int LAPACKE_dgbequ_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* ab, - lapack_int ldab, double* r, double* c, - double* rowcnd, double* colcnd, double* amax ); -lapack_int LAPACKE_cgbequ_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_float* ab, lapack_int ldab, - float* r, float* c, float* rowcnd, - float* colcnd, float* amax ); -lapack_int LAPACKE_zgbequ_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_double* ab, - lapack_int ldab, double* r, double* c, - double* rowcnd, double* colcnd, double* amax ); - -lapack_int LAPACKE_sgbequb_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* ab, - lapack_int ldab, float* r, float* c, - float* rowcnd, float* colcnd, float* amax ); -lapack_int LAPACKE_dgbequb_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* ab, - lapack_int ldab, double* r, double* c, - double* rowcnd, double* colcnd, double* amax ); -lapack_int LAPACKE_cgbequb_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_float* ab, - lapack_int ldab, float* r, float* c, - float* rowcnd, float* colcnd, float* amax ); -lapack_int LAPACKE_zgbequb_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - const lapack_complex_double* ab, - lapack_int ldab, double* r, double* c, - double* rowcnd, double* colcnd, double* amax ); - -lapack_int LAPACKE_sgbrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const float* ab, lapack_int ldab, - const float* afb, lapack_int ldafb, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgbrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const double* ab, lapack_int ldab, - const double* afb, lapack_int ldafb, - const lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgbrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* afb, - lapack_int ldafb, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgbrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, - const lapack_complex_double* afb, - lapack_int ldafb, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgbrfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, const float* ab, - lapack_int ldab, const float* afb, - lapack_int ldafb, const lapack_int* ipiv, - const float* r, const float* c, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgbrfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, const double* ab, - lapack_int ldab, const double* afb, - lapack_int ldafb, const lapack_int* ipiv, - const double* r, const double* c, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgbrfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, - const lapack_complex_float* ab, - lapack_int ldab, - const lapack_complex_float* afb, - lapack_int ldafb, const lapack_int* ipiv, - const float* r, const float* c, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zgbrfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, - const lapack_complex_double* afb, - lapack_int ldafb, const lapack_int* ipiv, - const double* r, const double* c, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sgbsv_work( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, float* ab, - lapack_int ldab, lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgbsv_work( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, double* ab, - lapack_int ldab, lapack_int* ipiv, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cgbsv_work( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, - lapack_complex_float* ab, lapack_int ldab, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgbsv_work( int matrix_order, lapack_int n, lapack_int kl, - lapack_int ku, lapack_int nrhs, - lapack_complex_double* ab, lapack_int ldab, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sgbsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, float* ab, lapack_int ldab, - float* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, float* r, float* c, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dgbsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, double* ab, lapack_int ldab, - double* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, double* r, double* c, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cgbsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_float* ab, - lapack_int ldab, lapack_complex_float* afb, - lapack_int ldafb, lapack_int* ipiv, char* equed, - float* r, float* c, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zgbsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* afb, - lapack_int ldafb, lapack_int* ipiv, char* equed, - double* r, double* c, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sgbsvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, float* ab, lapack_int ldab, - float* afb, lapack_int ldafb, lapack_int* ipiv, - char* equed, float* r, float* c, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgbsvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, double* ab, lapack_int ldab, - double* afb, lapack_int ldafb, - lapack_int* ipiv, char* equed, double* r, - double* c, double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgbsvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_float* ab, - lapack_int ldab, lapack_complex_float* afb, - lapack_int ldafb, lapack_int* ipiv, - char* equed, float* r, float* c, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zgbsvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int kl, lapack_int ku, - lapack_int nrhs, lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* afb, - lapack_int ldafb, lapack_int* ipiv, - char* equed, double* r, double* c, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sgbtrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, float* ab, - lapack_int ldab, lapack_int* ipiv ); -lapack_int LAPACKE_dgbtrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, double* ab, - lapack_int ldab, lapack_int* ipiv ); -lapack_int LAPACKE_cgbtrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - lapack_complex_float* ab, lapack_int ldab, - lapack_int* ipiv ); -lapack_int LAPACKE_zgbtrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, - lapack_complex_double* ab, lapack_int ldab, - lapack_int* ipiv ); - -lapack_int LAPACKE_sgbtrs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const float* ab, lapack_int ldab, - const lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgbtrs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const double* ab, lapack_int ldab, - const lapack_int* ipiv, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cgbtrs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgbtrs_work( int matrix_order, char trans, lapack_int n, - lapack_int kl, lapack_int ku, lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sgebak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const float* scale, lapack_int m, float* v, - lapack_int ldv ); -lapack_int LAPACKE_dgebak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const double* scale, lapack_int m, double* v, - lapack_int ldv ); -lapack_int LAPACKE_cgebak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const float* scale, lapack_int m, - lapack_complex_float* v, lapack_int ldv ); -lapack_int LAPACKE_zgebak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const double* scale, lapack_int m, - lapack_complex_double* v, lapack_int ldv ); - -lapack_int LAPACKE_sgebal_work( int matrix_order, char job, lapack_int n, - float* a, lapack_int lda, lapack_int* ilo, - lapack_int* ihi, float* scale ); -lapack_int LAPACKE_dgebal_work( int matrix_order, char job, lapack_int n, - double* a, lapack_int lda, lapack_int* ilo, - lapack_int* ihi, double* scale ); -lapack_int LAPACKE_cgebal_work( int matrix_order, char job, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ilo, lapack_int* ihi, - float* scale ); -lapack_int LAPACKE_zgebal_work( int matrix_order, char job, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ilo, lapack_int* ihi, - double* scale ); - -lapack_int LAPACKE_sgebrd_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* d, float* e, - float* tauq, float* taup, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dgebrd_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* d, double* e, - double* tauq, double* taup, double* work, - lapack_int lwork ); -lapack_int LAPACKE_cgebrd_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - float* d, float* e, lapack_complex_float* tauq, - lapack_complex_float* taup, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgebrd_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - double* d, double* e, - lapack_complex_double* tauq, - lapack_complex_double* taup, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgecon_work( int matrix_order, char norm, lapack_int n, - const float* a, lapack_int lda, float anorm, - float* rcond, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dgecon_work( int matrix_order, char norm, lapack_int n, - const double* a, lapack_int lda, double anorm, - double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgecon_work( int matrix_order, char norm, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float anorm, float* rcond, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgecon_work( int matrix_order, char norm, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double anorm, double* rcond, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgeequ_work( int matrix_order, lapack_int m, lapack_int n, - const float* a, lapack_int lda, float* r, - float* c, float* rowcnd, float* colcnd, - float* amax ); -lapack_int LAPACKE_dgeequ_work( int matrix_order, lapack_int m, lapack_int n, - const double* a, lapack_int lda, double* r, - double* c, double* rowcnd, double* colcnd, - double* amax ); -lapack_int LAPACKE_cgeequ_work( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* r, float* c, float* rowcnd, - float* colcnd, float* amax ); -lapack_int LAPACKE_zgeequ_work( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* r, double* c, double* rowcnd, - double* colcnd, double* amax ); - -lapack_int LAPACKE_sgeequb_work( int matrix_order, lapack_int m, lapack_int n, - const float* a, lapack_int lda, float* r, - float* c, float* rowcnd, float* colcnd, - float* amax ); -lapack_int LAPACKE_dgeequb_work( int matrix_order, lapack_int m, lapack_int n, - const double* a, lapack_int lda, double* r, - double* c, double* rowcnd, double* colcnd, - double* amax ); -lapack_int LAPACKE_cgeequb_work( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* r, float* c, float* rowcnd, - float* colcnd, float* amax ); -lapack_int LAPACKE_zgeequb_work( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* r, double* c, double* rowcnd, - double* colcnd, double* amax ); - -lapack_int LAPACKE_sgees_work( int matrix_order, char jobvs, char sort, - LAPACK_S_SELECT2 select, lapack_int n, float* a, - lapack_int lda, lapack_int* sdim, float* wr, - float* wi, float* vs, lapack_int ldvs, - float* work, lapack_int lwork, - lapack_logical* bwork ); -lapack_int LAPACKE_dgees_work( int matrix_order, char jobvs, char sort, - LAPACK_D_SELECT2 select, lapack_int n, double* a, - lapack_int lda, lapack_int* sdim, double* wr, - double* wi, double* vs, lapack_int ldvs, - double* work, lapack_int lwork, - lapack_logical* bwork ); -lapack_int LAPACKE_cgees_work( int matrix_order, char jobvs, char sort, - LAPACK_C_SELECT1 select, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* sdim, lapack_complex_float* w, - lapack_complex_float* vs, lapack_int ldvs, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_logical* bwork ); -lapack_int LAPACKE_zgees_work( int matrix_order, char jobvs, char sort, - LAPACK_Z_SELECT1 select, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* sdim, lapack_complex_double* w, - lapack_complex_double* vs, lapack_int ldvs, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_logical* bwork ); - -lapack_int LAPACKE_sgeesx_work( int matrix_order, char jobvs, char sort, - LAPACK_S_SELECT2 select, char sense, - lapack_int n, float* a, lapack_int lda, - lapack_int* sdim, float* wr, float* wi, - float* vs, lapack_int ldvs, float* rconde, - float* rcondv, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork, - lapack_logical* bwork ); -lapack_int LAPACKE_dgeesx_work( int matrix_order, char jobvs, char sort, - LAPACK_D_SELECT2 select, char sense, - lapack_int n, double* a, lapack_int lda, - lapack_int* sdim, double* wr, double* wi, - double* vs, lapack_int ldvs, double* rconde, - double* rcondv, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork, - lapack_logical* bwork ); -lapack_int LAPACKE_cgeesx_work( int matrix_order, char jobvs, char sort, - LAPACK_C_SELECT1 select, char sense, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_int* sdim, - lapack_complex_float* w, - lapack_complex_float* vs, lapack_int ldvs, - float* rconde, float* rcondv, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_logical* bwork ); -lapack_int LAPACKE_zgeesx_work( int matrix_order, char jobvs, char sort, - LAPACK_Z_SELECT1 select, char sense, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_int* sdim, - lapack_complex_double* w, - lapack_complex_double* vs, lapack_int ldvs, - double* rconde, double* rcondv, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_logical* bwork ); - -lapack_int LAPACKE_sgeev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, float* a, lapack_int lda, - float* wr, float* wi, float* vl, lapack_int ldvl, - float* vr, lapack_int ldvr, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dgeev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, double* a, lapack_int lda, - double* wr, double* wi, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgeev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* w, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zgeev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* w, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_sgeevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, float* a, - lapack_int lda, float* wr, float* wi, float* vl, - lapack_int ldvl, float* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, float* scale, - float* abnrm, float* rconde, float* rcondv, - float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dgeevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, double* a, - lapack_int lda, double* wr, double* wi, - double* vl, lapack_int ldvl, double* vr, - lapack_int ldvr, lapack_int* ilo, - lapack_int* ihi, double* scale, double* abnrm, - double* rconde, double* rcondv, double* work, - lapack_int lwork, lapack_int* iwork ); -lapack_int LAPACKE_cgeevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* w, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, float* scale, - float* abnrm, float* rconde, float* rcondv, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zgeevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* w, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, double* scale, - double* abnrm, double* rconde, double* rcondv, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_sgehrd_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, float* a, lapack_int lda, - float* tau, float* work, lapack_int lwork ); -lapack_int LAPACKE_dgehrd_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, double* a, lapack_int lda, - double* tau, double* work, lapack_int lwork ); -lapack_int LAPACKE_cgehrd_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgehrd_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgejsv_work( int matrix_order, char joba, char jobu, - char jobv, char jobr, char jobt, char jobp, - lapack_int m, lapack_int n, float* a, - lapack_int lda, float* sva, float* u, - lapack_int ldu, float* v, lapack_int ldv, - float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dgejsv_work( int matrix_order, char joba, char jobu, - char jobv, char jobr, char jobt, char jobp, - lapack_int m, lapack_int n, double* a, - lapack_int lda, double* sva, double* u, - lapack_int ldu, double* v, lapack_int ldv, - double* work, lapack_int lwork, - lapack_int* iwork ); - -lapack_int LAPACKE_sgelq2_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work ); -lapack_int LAPACKE_dgelq2_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work ); -lapack_int LAPACKE_cgelq2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work ); -lapack_int LAPACKE_zgelq2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work ); - -lapack_int LAPACKE_sgelqf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgelqf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgelqf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgelqf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgels_work( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgels_work( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgels_work( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgels_work( int matrix_order, char trans, lapack_int m, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgelsd_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, - float* b, lapack_int ldb, float* s, float rcond, - lapack_int* rank, float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dgelsd_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, double* s, - double rcond, lapack_int* rank, double* work, - lapack_int lwork, lapack_int* iwork ); -lapack_int LAPACKE_cgelsd_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* s, float rcond, - lapack_int* rank, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int* iwork ); -lapack_int LAPACKE_zgelsd_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double* s, double rcond, - lapack_int* rank, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int* iwork ); - -lapack_int LAPACKE_sgelss_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, - float* b, lapack_int ldb, float* s, float rcond, - lapack_int* rank, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dgelss_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, double* s, - double rcond, lapack_int* rank, double* work, - lapack_int lwork ); -lapack_int LAPACKE_cgelss_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* s, float rcond, - lapack_int* rank, lapack_complex_float* work, - lapack_int lwork, float* rwork ); -lapack_int LAPACKE_zgelss_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double* s, double rcond, - lapack_int* rank, lapack_complex_double* work, - lapack_int lwork, double* rwork ); - -lapack_int LAPACKE_sgelsy_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, - float* b, lapack_int ldb, lapack_int* jpvt, - float rcond, lapack_int* rank, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dgelsy_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, lapack_int* jpvt, - double rcond, lapack_int* rank, double* work, - lapack_int lwork ); -lapack_int LAPACKE_cgelsy_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_int* jpvt, float rcond, - lapack_int* rank, lapack_complex_float* work, - lapack_int lwork, float* rwork ); -lapack_int LAPACKE_zgelsy_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_int* jpvt, double rcond, - lapack_int* rank, lapack_complex_double* work, - lapack_int lwork, double* rwork ); - -lapack_int LAPACKE_sgeqlf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgeqlf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgeqlf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgeqlf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgeqp3_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* jpvt, - float* tau, float* work, lapack_int lwork ); -lapack_int LAPACKE_dgeqp3_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* jpvt, - double* tau, double* work, lapack_int lwork ); -lapack_int LAPACKE_cgeqp3_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zgeqp3_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_sgeqpf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* jpvt, - float* tau, float* work ); -lapack_int LAPACKE_dgeqpf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* jpvt, - double* tau, double* work ); -lapack_int LAPACKE_cgeqpf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_float* tau, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgeqpf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* jpvt, lapack_complex_double* tau, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgeqr2_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work ); -lapack_int LAPACKE_dgeqr2_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work ); -lapack_int LAPACKE_cgeqr2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work ); -lapack_int LAPACKE_zgeqr2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work ); - -lapack_int LAPACKE_sgeqrf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgeqrf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgeqrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgeqrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgeqrfp_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgeqrfp_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgeqrfp_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgeqrfp_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sgerfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgerfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, const double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cgerfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgerfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgerfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* af, - lapack_int ldaf, const lapack_int* ipiv, - const float* r, const float* c, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgerfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* r, const double* c, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgerfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const float* r, const float* c, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zgerfsx_work( int matrix_order, char trans, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* r, const double* c, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sgerqf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgerqf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgerqf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgerqf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgesdd_work( int matrix_order, char jobz, lapack_int m, - lapack_int n, float* a, lapack_int lda, - float* s, float* u, lapack_int ldu, float* vt, - lapack_int ldvt, float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dgesdd_work( int matrix_order, char jobz, lapack_int m, - lapack_int n, double* a, lapack_int lda, - double* s, double* u, lapack_int ldu, - double* vt, lapack_int ldvt, double* work, - lapack_int lwork, lapack_int* iwork ); -lapack_int LAPACKE_cgesdd_work( int matrix_order, char jobz, lapack_int m, - lapack_int n, lapack_complex_float* a, - lapack_int lda, float* s, - lapack_complex_float* u, lapack_int ldu, - lapack_complex_float* vt, lapack_int ldvt, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int* iwork ); -lapack_int LAPACKE_zgesdd_work( int matrix_order, char jobz, lapack_int m, - lapack_int n, lapack_complex_double* a, - lapack_int lda, double* s, - lapack_complex_double* u, lapack_int ldu, - lapack_complex_double* vt, lapack_int ldvt, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int* iwork ); - -lapack_int LAPACKE_sgesv_work( int matrix_order, lapack_int n, lapack_int nrhs, - float* a, lapack_int lda, lapack_int* ipiv, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dgesv_work( int matrix_order, lapack_int n, lapack_int nrhs, - double* a, lapack_int lda, lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cgesv_work( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgesv_work( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); -lapack_int LAPACKE_dsgesv_work( int matrix_order, lapack_int n, lapack_int nrhs, - double* a, lapack_int lda, lapack_int* ipiv, - double* b, lapack_int ldb, double* x, - lapack_int ldx, double* work, float* swork, - lapack_int* iter ); -lapack_int LAPACKE_zcgesv_work( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, lapack_complex_double* work, - lapack_complex_float* swork, double* rwork, - lapack_int* iter ); - -lapack_int LAPACKE_sgesvd_work( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, float* a, - lapack_int lda, float* s, float* u, - lapack_int ldu, float* vt, lapack_int ldvt, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgesvd_work( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, double* a, - lapack_int lda, double* s, double* u, - lapack_int ldu, double* vt, lapack_int ldvt, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgesvd_work( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - float* s, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* vt, - lapack_int ldvt, lapack_complex_float* work, - lapack_int lwork, float* rwork ); -lapack_int LAPACKE_zgesvd_work( int matrix_order, char jobu, char jobvt, - lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - double* s, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* vt, - lapack_int ldvt, lapack_complex_double* work, - lapack_int lwork, double* rwork ); - -lapack_int LAPACKE_sgesvj_work( int matrix_order, char joba, char jobu, - char jobv, lapack_int m, lapack_int n, float* a, - lapack_int lda, float* sva, lapack_int mv, - float* v, lapack_int ldv, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dgesvj_work( int matrix_order, char joba, char jobu, - char jobv, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* sva, - lapack_int mv, double* v, lapack_int ldv, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgesvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, - float* c, float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dgesvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, - double* c, double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, double* work, lapack_int* iwork ); -lapack_int LAPACKE_cgesvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, - float* c, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zgesvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, - double* c, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sgesvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, - float* c, float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* rpvgrw, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgesvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, - double* c, double* b, lapack_int ldb, - double* x, lapack_int ldx, double* rcond, - double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgesvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* r, - float* c, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* rpvgrw, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgesvxx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* r, - double* c, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* rpvgrw, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgetf2_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_dgetf2_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_cgetf2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv ); -lapack_int LAPACKE_zgetf2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv ); - -lapack_int LAPACKE_sgetrf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_dgetrf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, lapack_int* ipiv ); -lapack_int LAPACKE_cgetrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv ); -lapack_int LAPACKE_zgetrf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv ); - -lapack_int LAPACKE_sgetri_work( int matrix_order, lapack_int n, float* a, - lapack_int lda, const lapack_int* ipiv, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dgetri_work( int matrix_order, lapack_int n, double* a, - lapack_int lda, const lapack_int* ipiv, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cgetri_work( int matrix_order, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgetri_work( int matrix_order, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgetrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgetrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, const lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cgetrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zgetrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sggbak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const float* lscale, const float* rscale, - lapack_int m, float* v, lapack_int ldv ); -lapack_int LAPACKE_dggbak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const double* lscale, const double* rscale, - lapack_int m, double* v, lapack_int ldv ); -lapack_int LAPACKE_cggbak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const float* lscale, const float* rscale, - lapack_int m, lapack_complex_float* v, - lapack_int ldv ); -lapack_int LAPACKE_zggbak_work( int matrix_order, char job, char side, - lapack_int n, lapack_int ilo, lapack_int ihi, - const double* lscale, const double* rscale, - lapack_int m, lapack_complex_double* v, - lapack_int ldv ); - -lapack_int LAPACKE_sggbal_work( int matrix_order, char job, lapack_int n, - float* a, lapack_int lda, float* b, - lapack_int ldb, lapack_int* ilo, - lapack_int* ihi, float* lscale, float* rscale, - float* work ); -lapack_int LAPACKE_dggbal_work( int matrix_order, char job, lapack_int n, - double* a, lapack_int lda, double* b, - lapack_int ldb, lapack_int* ilo, - lapack_int* ihi, double* lscale, double* rscale, - double* work ); -lapack_int LAPACKE_cggbal_work( int matrix_order, char job, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale, float* work ); -lapack_int LAPACKE_zggbal_work( int matrix_order, char job, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_int* ilo, lapack_int* ihi, - double* lscale, double* rscale, double* work ); - -lapack_int LAPACKE_sgges_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_S_SELECT3 selctg, lapack_int n, - float* a, lapack_int lda, float* b, - lapack_int ldb, lapack_int* sdim, float* alphar, - float* alphai, float* beta, float* vsl, - lapack_int ldvsl, float* vsr, lapack_int ldvsr, - float* work, lapack_int lwork, - lapack_logical* bwork ); -lapack_int LAPACKE_dgges_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_D_SELECT3 selctg, lapack_int n, - double* a, lapack_int lda, double* b, - lapack_int ldb, lapack_int* sdim, double* alphar, - double* alphai, double* beta, double* vsl, - lapack_int ldvsl, double* vsr, lapack_int ldvsr, - double* work, lapack_int lwork, - lapack_logical* bwork ); -lapack_int LAPACKE_cgges_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_C_SELECT2 selctg, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_int* sdim, lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* vsl, lapack_int ldvsl, - lapack_complex_float* vsr, lapack_int ldvsr, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_logical* bwork ); -lapack_int LAPACKE_zgges_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_Z_SELECT2 selctg, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_int* sdim, lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vsl, lapack_int ldvsl, - lapack_complex_double* vsr, lapack_int ldvsr, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_logical* bwork ); - -lapack_int LAPACKE_sggesx_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_S_SELECT3 selctg, char sense, - lapack_int n, float* a, lapack_int lda, - float* b, lapack_int ldb, lapack_int* sdim, - float* alphar, float* alphai, float* beta, - float* vsl, lapack_int ldvsl, float* vsr, - lapack_int ldvsr, float* rconde, float* rcondv, - float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork, - lapack_logical* bwork ); -lapack_int LAPACKE_dggesx_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_D_SELECT3 selctg, char sense, - lapack_int n, double* a, lapack_int lda, - double* b, lapack_int ldb, lapack_int* sdim, - double* alphar, double* alphai, double* beta, - double* vsl, lapack_int ldvsl, double* vsr, - lapack_int ldvsr, double* rconde, - double* rcondv, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork, - lapack_logical* bwork ); -lapack_int LAPACKE_cggesx_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_C_SELECT2 selctg, char sense, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_int* sdim, - lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* vsl, lapack_int ldvsl, - lapack_complex_float* vsr, lapack_int ldvsr, - float* rconde, float* rcondv, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int* iwork, - lapack_int liwork, lapack_logical* bwork ); -lapack_int LAPACKE_zggesx_work( int matrix_order, char jobvsl, char jobvsr, - char sort, LAPACK_Z_SELECT2 selctg, char sense, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_int* sdim, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vsl, lapack_int ldvsl, - lapack_complex_double* vsr, lapack_int ldvsr, - double* rconde, double* rcondv, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int* iwork, - lapack_int liwork, lapack_logical* bwork ); - -lapack_int LAPACKE_sggev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, float* a, lapack_int lda, float* b, - lapack_int ldb, float* alphar, float* alphai, - float* beta, float* vl, lapack_int ldvl, - float* vr, lapack_int ldvr, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dggev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, double* a, lapack_int lda, - double* b, lapack_int ldb, double* alphar, - double* alphai, double* beta, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - double* work, lapack_int lwork ); -lapack_int LAPACKE_cggev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zggev_work( int matrix_order, char jobvl, char jobvr, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_sggevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* alphar, float* alphai, float* beta, - float* vl, lapack_int ldvl, float* vr, - lapack_int ldvr, lapack_int* ilo, - lapack_int* ihi, float* lscale, float* rscale, - float* abnrm, float* bbnrm, float* rconde, - float* rcondv, float* work, lapack_int lwork, - lapack_int* iwork, lapack_logical* bwork ); -lapack_int LAPACKE_dggevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* alphar, double* alphai, double* beta, - double* vl, lapack_int ldvl, double* vr, - lapack_int ldvr, lapack_int* ilo, - lapack_int* ihi, double* lscale, double* rscale, - double* abnrm, double* bbnrm, double* rconde, - double* rcondv, double* work, lapack_int lwork, - lapack_int* iwork, lapack_logical* bwork ); -lapack_int LAPACKE_cggevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale, float* abnrm, float* bbnrm, - float* rconde, float* rcondv, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int* iwork, - lapack_logical* bwork ); -lapack_int LAPACKE_zggevx_work( int matrix_order, char balanc, char jobvl, - char jobvr, char sense, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int* ilo, lapack_int* ihi, - double* lscale, double* rscale, double* abnrm, - double* bbnrm, double* rconde, double* rcondv, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int* iwork, - lapack_logical* bwork ); - -lapack_int LAPACKE_sggglm_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, float* a, lapack_int lda, - float* b, lapack_int ldb, float* d, float* x, - float* y, float* work, lapack_int lwork ); -lapack_int LAPACKE_dggglm_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, double* a, lapack_int lda, - double* b, lapack_int ldb, double* d, double* x, - double* y, double* work, lapack_int lwork ); -lapack_int LAPACKE_cggglm_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* d, - lapack_complex_float* x, - lapack_complex_float* y, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zggglm_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* d, - lapack_complex_double* x, - lapack_complex_double* y, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sgghrd_work( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - float* a, lapack_int lda, float* b, - lapack_int ldb, float* q, lapack_int ldq, - float* z, lapack_int ldz ); -lapack_int LAPACKE_dgghrd_work( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - double* a, lapack_int lda, double* b, - lapack_int ldb, double* q, lapack_int ldq, - double* z, lapack_int ldz ); -lapack_int LAPACKE_cgghrd_work( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* z, lapack_int ldz ); -lapack_int LAPACKE_zgghrd_work( int matrix_order, char compq, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz ); - -lapack_int LAPACKE_sgglse_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, float* a, lapack_int lda, - float* b, lapack_int ldb, float* c, float* d, - float* x, float* work, lapack_int lwork ); -lapack_int LAPACKE_dgglse_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, double* a, lapack_int lda, - double* b, lapack_int ldb, double* c, double* d, - double* x, double* work, lapack_int lwork ); -lapack_int LAPACKE_cgglse_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* c, - lapack_complex_float* d, - lapack_complex_float* x, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zgglse_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int p, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* c, - lapack_complex_double* d, - lapack_complex_double* x, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sggqrf_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, float* a, lapack_int lda, - float* taua, float* b, lapack_int ldb, - float* taub, float* work, lapack_int lwork ); -lapack_int LAPACKE_dggqrf_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, double* a, lapack_int lda, - double* taua, double* b, lapack_int ldb, - double* taub, double* work, lapack_int lwork ); -lapack_int LAPACKE_cggqrf_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* taua, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* taub, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zggqrf_work( int matrix_order, lapack_int n, lapack_int m, - lapack_int p, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* taua, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* taub, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sggrqf_work( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, float* a, lapack_int lda, - float* taua, float* b, lapack_int ldb, - float* taub, float* work, lapack_int lwork ); -lapack_int LAPACKE_dggrqf_work( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, double* a, lapack_int lda, - double* taua, double* b, lapack_int ldb, - double* taub, double* work, lapack_int lwork ); -lapack_int LAPACKE_cggrqf_work( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* taua, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* taub, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zggrqf_work( int matrix_order, lapack_int m, lapack_int p, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* taua, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* taub, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_sggsvd_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int n, - lapack_int p, lapack_int* k, lapack_int* l, - float* a, lapack_int lda, float* b, - lapack_int ldb, float* alpha, float* beta, - float* u, lapack_int ldu, float* v, - lapack_int ldv, float* q, lapack_int ldq, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dggsvd_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int n, - lapack_int p, lapack_int* k, lapack_int* l, - double* a, lapack_int lda, double* b, - lapack_int ldb, double* alpha, double* beta, - double* u, lapack_int ldu, double* v, - lapack_int ldv, double* q, lapack_int ldq, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cggsvd_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int n, - lapack_int p, lapack_int* k, lapack_int* l, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - float* alpha, float* beta, - lapack_complex_float* u, lapack_int ldu, - lapack_complex_float* v, lapack_int ldv, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* work, float* rwork, - lapack_int* iwork ); -lapack_int LAPACKE_zggsvd_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int n, - lapack_int p, lapack_int* k, lapack_int* l, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double* alpha, double* beta, - lapack_complex_double* u, lapack_int ldu, - lapack_complex_double* v, lapack_int ldv, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* work, double* rwork, - lapack_int* iwork ); - -lapack_int LAPACKE_sggsvp_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, float* a, lapack_int lda, - float* b, lapack_int ldb, float tola, - float tolb, lapack_int* k, lapack_int* l, - float* u, lapack_int ldu, float* v, - lapack_int ldv, float* q, lapack_int ldq, - lapack_int* iwork, float* tau, float* work ); -lapack_int LAPACKE_dggsvp_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, double* a, lapack_int lda, - double* b, lapack_int ldb, double tola, - double tolb, lapack_int* k, lapack_int* l, - double* u, lapack_int ldu, double* v, - lapack_int ldv, double* q, lapack_int ldq, - lapack_int* iwork, double* tau, double* work ); -lapack_int LAPACKE_cggsvp_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float tola, float tolb, - lapack_int* k, lapack_int* l, - lapack_complex_float* u, lapack_int ldu, - lapack_complex_float* v, lapack_int ldv, - lapack_complex_float* q, lapack_int ldq, - lapack_int* iwork, float* rwork, - lapack_complex_float* tau, - lapack_complex_float* work ); -lapack_int LAPACKE_zggsvp_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, double tola, double tolb, - lapack_int* k, lapack_int* l, - lapack_complex_double* u, lapack_int ldu, - lapack_complex_double* v, lapack_int ldv, - lapack_complex_double* q, lapack_int ldq, - lapack_int* iwork, double* rwork, - lapack_complex_double* tau, - lapack_complex_double* work ); - -lapack_int LAPACKE_sgtcon_work( char norm, lapack_int n, const float* dl, - const float* d, const float* du, - const float* du2, const lapack_int* ipiv, - float anorm, float* rcond, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgtcon_work( char norm, lapack_int n, const double* dl, - const double* d, const double* du, - const double* du2, const lapack_int* ipiv, - double anorm, double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgtcon_work( char norm, lapack_int n, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* du2, - const lapack_int* ipiv, float anorm, - float* rcond, lapack_complex_float* work ); -lapack_int LAPACKE_zgtcon_work( char norm, lapack_int n, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* du2, - const lapack_int* ipiv, double anorm, - double* rcond, lapack_complex_double* work ); - -lapack_int LAPACKE_sgtrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* dl, - const float* d, const float* du, - const float* dlf, const float* df, - const float* duf, const float* du2, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dgtrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* dl, - const double* d, const double* du, - const double* dlf, const double* df, - const double* duf, const double* du2, - const lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cgtrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* dlf, - const lapack_complex_float* df, - const lapack_complex_float* duf, - const lapack_complex_float* du2, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgtrfs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* dlf, - const lapack_complex_double* df, - const lapack_complex_double* duf, - const lapack_complex_double* du2, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgtsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - float* dl, float* d, float* du, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dgtsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - double* dl, double* d, double* du, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cgtsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_float* dl, - lapack_complex_float* d, - lapack_complex_float* du, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zgtsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - lapack_complex_double* dl, - lapack_complex_double* d, - lapack_complex_double* du, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sgtsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, const float* dl, - const float* d, const float* du, float* dlf, - float* df, float* duf, float* du2, - lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dgtsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, const double* dl, - const double* d, const double* du, double* dlf, - double* df, double* duf, double* du2, - lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cgtsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - lapack_complex_float* dlf, - lapack_complex_float* df, - lapack_complex_float* duf, - lapack_complex_float* du2, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zgtsvx_work( int matrix_order, char fact, char trans, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - lapack_complex_double* dlf, - lapack_complex_double* df, - lapack_complex_double* duf, - lapack_complex_double* du2, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sgttrf_work( lapack_int n, float* dl, float* d, float* du, - float* du2, lapack_int* ipiv ); -lapack_int LAPACKE_dgttrf_work( lapack_int n, double* dl, double* d, double* du, - double* du2, lapack_int* ipiv ); -lapack_int LAPACKE_cgttrf_work( lapack_int n, lapack_complex_float* dl, - lapack_complex_float* d, - lapack_complex_float* du, - lapack_complex_float* du2, lapack_int* ipiv ); -lapack_int LAPACKE_zgttrf_work( lapack_int n, lapack_complex_double* dl, - lapack_complex_double* d, - lapack_complex_double* du, - lapack_complex_double* du2, lapack_int* ipiv ); - -lapack_int LAPACKE_sgttrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const float* dl, - const float* d, const float* du, - const float* du2, const lapack_int* ipiv, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dgttrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const double* dl, - const double* d, const double* du, - const double* du2, const lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cgttrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* du2, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zgttrs_work( int matrix_order, char trans, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* du2, - const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_chbev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_float* ab, lapack_int ldab, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zhbev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_double* ab, lapack_int ldab, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_chbevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_float* ab, lapack_int ldab, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zhbevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_double* ab, lapack_int ldab, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_chbevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int kd, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* q, lapack_int ldq, - float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - float* rwork, lapack_int* iwork, - lapack_int* ifail ); -lapack_int LAPACKE_zhbevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int kd, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* q, lapack_int ldq, - double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - double* rwork, lapack_int* iwork, - lapack_int* ifail ); - -lapack_int LAPACKE_chbgst_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* bb, lapack_int ldbb, - lapack_complex_float* x, lapack_int ldx, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zhbgst_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - const lapack_complex_double* bb, - lapack_int ldbb, lapack_complex_double* x, - lapack_int ldx, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_chbgv_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* bb, lapack_int ldbb, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zhbgv_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* bb, lapack_int ldbb, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_chbgvd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* bb, lapack_int ldbb, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zhbgvd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* bb, lapack_int ldbb, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_chbgvx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int ka, - lapack_int kb, lapack_complex_float* ab, - lapack_int ldab, lapack_complex_float* bb, - lapack_int ldbb, lapack_complex_float* q, - lapack_int ldq, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, float* rwork, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_zhbgvx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int ka, - lapack_int kb, lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* bb, - lapack_int ldbb, lapack_complex_double* q, - lapack_int ldq, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_chbtrd_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_float* ab, lapack_int ldab, - float* d, float* e, lapack_complex_float* q, - lapack_int ldq, lapack_complex_float* work ); -lapack_int LAPACKE_zhbtrd_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int kd, - lapack_complex_double* ab, lapack_int ldab, - double* d, double* e, lapack_complex_double* q, - lapack_int ldq, lapack_complex_double* work ); - -lapack_int LAPACKE_checon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, float anorm, - float* rcond, lapack_complex_float* work ); -lapack_int LAPACKE_zhecon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, double anorm, - double* rcond, lapack_complex_double* work ); - -lapack_int LAPACKE_cheequb_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax, - lapack_complex_float* work ); -lapack_int LAPACKE_zheequb_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax, - lapack_complex_double* work ); - -lapack_int LAPACKE_cheev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_float* a, - lapack_int lda, float* w, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zheev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_double* a, - lapack_int lda, double* w, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_cheevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_float* a, - lapack_int lda, float* w, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int lrwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_zheevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_double* a, - lapack_int lda, double* w, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int lrwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_cheevr_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_int* isuppz, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int lrwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_zheevr_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_int* isuppz, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int lrwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_cheevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_zheevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_chegst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zhegst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_chegv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb, float* w, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zhegv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double* w, lapack_complex_double* work, - lapack_int lwork, double* rwork ); - -lapack_int LAPACKE_chegvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - float* w, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zhegvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double* w, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_chegvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_zhegvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_cherfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zherfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_cherfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const float* s, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zherfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* s, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_chesv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zhesv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_chesvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - lapack_int lwork, float* rwork ); -lapack_int LAPACKE_zhesvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_chesvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* s, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zhesvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_chetrd_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - float* d, float* e, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zhetrd_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - double* d, double* e, - lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_chetrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_float* work, - lapack_int lwork ); -lapack_int LAPACKE_zhetrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_double* work, - lapack_int lwork ); - -lapack_int LAPACKE_chetri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work ); -lapack_int LAPACKE_zhetri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work ); - -lapack_int LAPACKE_chetrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zhetrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_chfrk_work( int matrix_order, char transr, char uplo, - char trans, lapack_int n, lapack_int k, - float alpha, const lapack_complex_float* a, - lapack_int lda, float beta, - lapack_complex_float* c ); -lapack_int LAPACKE_zhfrk_work( int matrix_order, char transr, char uplo, - char trans, lapack_int n, lapack_int k, - double alpha, const lapack_complex_double* a, - lapack_int lda, double beta, - lapack_complex_double* c ); - -lapack_int LAPACKE_shgeqz_work( int matrix_order, char job, char compq, - char compz, lapack_int n, lapack_int ilo, - lapack_int ihi, float* h, lapack_int ldh, - float* t, lapack_int ldt, float* alphar, - float* alphai, float* beta, float* q, - lapack_int ldq, float* z, lapack_int ldz, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dhgeqz_work( int matrix_order, char job, char compq, - char compz, lapack_int n, lapack_int ilo, - lapack_int ihi, double* h, lapack_int ldh, - double* t, lapack_int ldt, double* alphar, - double* alphai, double* beta, double* q, - lapack_int ldq, double* z, lapack_int ldz, - double* work, lapack_int lwork ); -lapack_int LAPACKE_chgeqz_work( int matrix_order, char job, char compq, - char compz, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_float* h, - lapack_int ldh, lapack_complex_float* t, - lapack_int ldt, lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, lapack_int lwork, - float* rwork ); -lapack_int LAPACKE_zhgeqz_work( int matrix_order, char job, char compq, - char compz, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_double* h, - lapack_int ldh, lapack_complex_double* t, - lapack_int ldt, lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_chpcon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - const lapack_int* ipiv, float anorm, - float* rcond, lapack_complex_float* work ); -lapack_int LAPACKE_zhpcon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - const lapack_int* ipiv, double anorm, - double* rcond, lapack_complex_double* work ); - -lapack_int LAPACKE_chpev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_float* ap, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zhpev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_double* ap, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_chpevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_float* ap, - float* w, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zhpevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_complex_double* ap, - double* w, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_chpevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, - lapack_complex_float* ap, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, float* rwork, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_zhpevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, - lapack_complex_double* ap, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_chpgst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_float* ap, - const lapack_complex_float* bp ); -lapack_int LAPACKE_zhpgst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, lapack_complex_double* ap, - const lapack_complex_double* bp ); - -lapack_int LAPACKE_chpgv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_float* ap, - lapack_complex_float* bp, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zhpgv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_double* ap, - lapack_complex_double* bp, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_chpgvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_float* ap, - lapack_complex_float* bp, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int lrwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_zhpgvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, - lapack_complex_double* ap, - lapack_complex_double* bp, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int lrwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_chpgvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_float* ap, - lapack_complex_float* bp, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, float* rwork, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_zhpgvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, - lapack_complex_double* ap, - lapack_complex_double* bp, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_chprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zhprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_chpsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zhpsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_chpsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* ap, - lapack_complex_float* afp, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zhpsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* ap, - lapack_complex_double* afp, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_chptrd_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, float* d, float* e, - lapack_complex_float* tau ); -lapack_int LAPACKE_zhptrd_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, double* d, double* e, - lapack_complex_double* tau ); - -lapack_int LAPACKE_chptrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, lapack_int* ipiv ); -lapack_int LAPACKE_zhptrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, lapack_int* ipiv ); - -lapack_int LAPACKE_chptri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, - const lapack_int* ipiv, - lapack_complex_float* work ); -lapack_int LAPACKE_zhptri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, - const lapack_int* ipiv, - lapack_complex_double* work ); - -lapack_int LAPACKE_chptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zhptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_shsein_work( int matrix_order, char job, char eigsrc, - char initv, lapack_logical* select, - lapack_int n, const float* h, lapack_int ldh, - float* wr, const float* wi, float* vl, - lapack_int ldvl, float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, float* work, - lapack_int* ifaill, lapack_int* ifailr ); -lapack_int LAPACKE_dhsein_work( int matrix_order, char job, char eigsrc, - char initv, lapack_logical* select, - lapack_int n, const double* h, lapack_int ldh, - double* wr, const double* wi, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, double* work, - lapack_int* ifaill, lapack_int* ifailr ); -lapack_int LAPACKE_chsein_work( int matrix_order, char job, char eigsrc, - char initv, const lapack_logical* select, - lapack_int n, const lapack_complex_float* h, - lapack_int ldh, lapack_complex_float* w, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, - lapack_complex_float* work, float* rwork, - lapack_int* ifaill, lapack_int* ifailr ); -lapack_int LAPACKE_zhsein_work( int matrix_order, char job, char eigsrc, - char initv, const lapack_logical* select, - lapack_int n, const lapack_complex_double* h, - lapack_int ldh, lapack_complex_double* w, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, - lapack_complex_double* work, double* rwork, - lapack_int* ifaill, lapack_int* ifailr ); - -lapack_int LAPACKE_shseqr_work( int matrix_order, char job, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - float* h, lapack_int ldh, float* wr, float* wi, - float* z, lapack_int ldz, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dhseqr_work( int matrix_order, char job, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - double* h, lapack_int ldh, double* wr, - double* wi, double* z, lapack_int ldz, - double* work, lapack_int lwork ); -lapack_int LAPACKE_chseqr_work( int matrix_order, char job, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_float* h, lapack_int ldh, - lapack_complex_float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zhseqr_work( int matrix_order, char job, char compz, - lapack_int n, lapack_int ilo, lapack_int ihi, - lapack_complex_double* h, lapack_int ldh, - lapack_complex_double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_clacgv_work( lapack_int n, lapack_complex_float* x, - lapack_int incx ); -lapack_int LAPACKE_zlacgv_work( lapack_int n, lapack_complex_double* x, - lapack_int incx ); - -lapack_int LAPACKE_slacpy_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, const float* a, lapack_int lda, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dlacpy_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, const double* a, lapack_int lda, - double* b, lapack_int ldb ); -lapack_int LAPACKE_clacpy_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zlacpy_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_zlag2c_work( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_float* sa, lapack_int ldsa ); - -lapack_int LAPACKE_slag2d_work( int matrix_order, lapack_int m, lapack_int n, - const float* sa, lapack_int ldsa, double* a, - lapack_int lda ); - -lapack_int LAPACKE_dlag2s_work( int matrix_order, lapack_int m, lapack_int n, - const double* a, lapack_int lda, float* sa, - lapack_int ldsa ); - -lapack_int LAPACKE_clag2z_work( int matrix_order, lapack_int m, lapack_int n, - const lapack_complex_float* sa, lapack_int ldsa, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_slagge_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* d, - float* a, lapack_int lda, lapack_int* iseed, - float* work ); -lapack_int LAPACKE_dlagge_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* d, - double* a, lapack_int lda, lapack_int* iseed, - double* work ); -lapack_int LAPACKE_clagge_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const float* d, - lapack_complex_float* a, lapack_int lda, - lapack_int* iseed, lapack_complex_float* work ); -lapack_int LAPACKE_zlagge_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int kl, lapack_int ku, const double* d, - lapack_complex_double* a, lapack_int lda, - lapack_int* iseed, - lapack_complex_double* work ); - -lapack_int LAPACKE_claghe_work( int matrix_order, lapack_int n, lapack_int k, - const float* d, lapack_complex_float* a, - lapack_int lda, lapack_int* iseed, - lapack_complex_float* work ); -lapack_int LAPACKE_zlaghe_work( int matrix_order, lapack_int n, lapack_int k, - const double* d, lapack_complex_double* a, - lapack_int lda, lapack_int* iseed, - lapack_complex_double* work ); - -lapack_int LAPACKE_slagsy_work( int matrix_order, lapack_int n, lapack_int k, - const float* d, float* a, lapack_int lda, - lapack_int* iseed, float* work ); -lapack_int LAPACKE_dlagsy_work( int matrix_order, lapack_int n, lapack_int k, - const double* d, double* a, lapack_int lda, - lapack_int* iseed, double* work ); -lapack_int LAPACKE_clagsy_work( int matrix_order, lapack_int n, lapack_int k, - const float* d, lapack_complex_float* a, - lapack_int lda, lapack_int* iseed, - lapack_complex_float* work ); -lapack_int LAPACKE_zlagsy_work( int matrix_order, lapack_int n, lapack_int k, - const double* d, lapack_complex_double* a, - lapack_int lda, lapack_int* iseed, - lapack_complex_double* work ); - -lapack_int LAPACKE_slapmr_work( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, float* x, - lapack_int ldx, lapack_int* k ); -lapack_int LAPACKE_dlapmr_work( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, double* x, - lapack_int ldx, lapack_int* k ); -lapack_int LAPACKE_clapmr_work( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, - lapack_complex_float* x, lapack_int ldx, - lapack_int* k ); -lapack_int LAPACKE_zlapmr_work( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, - lapack_complex_double* x, lapack_int ldx, - lapack_int* k ); - -lapack_int LAPACKE_slartgp_work( float f, float g, float* cs, float* sn, - float* r ); -lapack_int LAPACKE_dlartgp_work( double f, double g, double* cs, double* sn, - double* r ); - -lapack_int LAPACKE_slartgs_work( float x, float y, float sigma, float* cs, - float* sn ); -lapack_int LAPACKE_dlartgs_work( double x, double y, double sigma, double* cs, - double* sn ); - -float LAPACKE_slapy2_work( float x, float y ); -double LAPACKE_dlapy2_work( double x, double y ); - -float LAPACKE_slapy3_work( float x, float y, float z ); -double LAPACKE_dlapy3_work( double x, double y, double z ); - -float LAPACKE_slamch_work( char cmach ); -double LAPACKE_dlamch_work( char cmach ); - -float LAPACKE_slange_work( int matrix_order, char norm, lapack_int m, - lapack_int n, const float* a, lapack_int lda, - float* work ); -double LAPACKE_dlange_work( int matrix_order, char norm, lapack_int m, - lapack_int n, const double* a, lapack_int lda, - double* work ); -float LAPACKE_clange_work( int matrix_order, char norm, lapack_int m, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, float* work ); -double LAPACKE_zlange_work( int matrix_order, char norm, lapack_int m, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, double* work ); - -float LAPACKE_clanhe_work( int matrix_order, char norm, char uplo, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, float* work ); -double LAPACKE_zlanhe_work( int matrix_order, char norm, char uplo, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, double* work ); - -float LAPACKE_slansy_work( int matrix_order, char norm, char uplo, - lapack_int n, const float* a, lapack_int lda, - float* work ); -double LAPACKE_dlansy_work( int matrix_order, char norm, char uplo, - lapack_int n, const double* a, lapack_int lda, - double* work ); -float LAPACKE_clansy_work( int matrix_order, char norm, char uplo, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, float* work ); -double LAPACKE_zlansy_work( int matrix_order, char norm, char uplo, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, double* work ); - -float LAPACKE_slantr_work( int matrix_order, char norm, char uplo, - char diag, lapack_int m, lapack_int n, const float* a, - lapack_int lda, float* work ); -double LAPACKE_dlantr_work( int matrix_order, char norm, char uplo, - char diag, lapack_int m, lapack_int n, - const double* a, lapack_int lda, double* work ); -float LAPACKE_clantr_work( int matrix_order, char norm, char uplo, - char diag, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* work ); -double LAPACKE_zlantr_work( int matrix_order, char norm, char uplo, - char diag, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* work ); - -lapack_int LAPACKE_slarfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, const float* v, - lapack_int ldv, const float* t, lapack_int ldt, - float* c, lapack_int ldc, float* work, - lapack_int ldwork ); -lapack_int LAPACKE_dlarfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, const double* v, - lapack_int ldv, const double* t, lapack_int ldt, - double* c, lapack_int ldc, double* work, - lapack_int ldwork ); -lapack_int LAPACKE_clarfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int ldwork ); -lapack_int LAPACKE_zlarfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, - lapack_int ldwork ); - -lapack_int LAPACKE_slarfg_work( lapack_int n, float* alpha, float* x, - lapack_int incx, float* tau ); -lapack_int LAPACKE_dlarfg_work( lapack_int n, double* alpha, double* x, - lapack_int incx, double* tau ); -lapack_int LAPACKE_clarfg_work( lapack_int n, lapack_complex_float* alpha, - lapack_complex_float* x, lapack_int incx, - lapack_complex_float* tau ); -lapack_int LAPACKE_zlarfg_work( lapack_int n, lapack_complex_double* alpha, - lapack_complex_double* x, lapack_int incx, - lapack_complex_double* tau ); - -lapack_int LAPACKE_slarft_work( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, const float* v, - lapack_int ldv, const float* tau, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dlarft_work( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, const double* v, - lapack_int ldv, const double* tau, double* t, - lapack_int ldt ); -lapack_int LAPACKE_clarft_work( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* tau, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_zlarft_work( int matrix_order, char direct, char storev, - lapack_int n, lapack_int k, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* tau, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_slarfx_work( int matrix_order, char side, lapack_int m, - lapack_int n, const float* v, float tau, - float* c, lapack_int ldc, float* work ); -lapack_int LAPACKE_dlarfx_work( int matrix_order, char side, lapack_int m, - lapack_int n, const double* v, double tau, - double* c, lapack_int ldc, double* work ); -lapack_int LAPACKE_clarfx_work( int matrix_order, char side, lapack_int m, - lapack_int n, const lapack_complex_float* v, - lapack_complex_float tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work ); -lapack_int LAPACKE_zlarfx_work( int matrix_order, char side, lapack_int m, - lapack_int n, const lapack_complex_double* v, - lapack_complex_double tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work ); - -lapack_int LAPACKE_slarnv_work( lapack_int idist, lapack_int* iseed, - lapack_int n, float* x ); -lapack_int LAPACKE_dlarnv_work( lapack_int idist, lapack_int* iseed, - lapack_int n, double* x ); -lapack_int LAPACKE_clarnv_work( lapack_int idist, lapack_int* iseed, - lapack_int n, lapack_complex_float* x ); -lapack_int LAPACKE_zlarnv_work( lapack_int idist, lapack_int* iseed, - lapack_int n, lapack_complex_double* x ); - -lapack_int LAPACKE_slaset_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, float alpha, float beta, float* a, - lapack_int lda ); -lapack_int LAPACKE_dlaset_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, double alpha, double beta, - double* a, lapack_int lda ); -lapack_int LAPACKE_claset_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, lapack_complex_float alpha, - lapack_complex_float beta, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zlaset_work( int matrix_order, char uplo, lapack_int m, - lapack_int n, lapack_complex_double alpha, - lapack_complex_double beta, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_slasrt_work( char id, lapack_int n, float* d ); -lapack_int LAPACKE_dlasrt_work( char id, lapack_int n, double* d ); - -lapack_int LAPACKE_slaswp_work( int matrix_order, lapack_int n, float* a, - lapack_int lda, lapack_int k1, lapack_int k2, - const lapack_int* ipiv, lapack_int incx ); -lapack_int LAPACKE_dlaswp_work( int matrix_order, lapack_int n, double* a, - lapack_int lda, lapack_int k1, lapack_int k2, - const lapack_int* ipiv, lapack_int incx ); -lapack_int LAPACKE_claswp_work( int matrix_order, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int k1, lapack_int k2, - const lapack_int* ipiv, lapack_int incx ); -lapack_int LAPACKE_zlaswp_work( int matrix_order, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int k1, lapack_int k2, - const lapack_int* ipiv, lapack_int incx ); - -lapack_int LAPACKE_slatms_work( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, - float* d, lapack_int mode, float cond, - float dmax, lapack_int kl, lapack_int ku, - char pack, float* a, lapack_int lda, - float* work ); -lapack_int LAPACKE_dlatms_work( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, - double* d, lapack_int mode, double cond, - double dmax, lapack_int kl, lapack_int ku, - char pack, double* a, lapack_int lda, - double* work ); -lapack_int LAPACKE_clatms_work( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, - float* d, lapack_int mode, float cond, - float dmax, lapack_int kl, lapack_int ku, - char pack, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* work ); -lapack_int LAPACKE_zlatms_work( int matrix_order, lapack_int m, lapack_int n, - char dist, lapack_int* iseed, char sym, - double* d, lapack_int mode, double cond, - double dmax, lapack_int kl, lapack_int ku, - char pack, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* work ); - -lapack_int LAPACKE_slauum_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda ); -lapack_int LAPACKE_dlauum_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda ); -lapack_int LAPACKE_clauum_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zlauum_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_sopgtr_work( int matrix_order, char uplo, lapack_int n, - const float* ap, const float* tau, float* q, - lapack_int ldq, float* work ); -lapack_int LAPACKE_dopgtr_work( int matrix_order, char uplo, lapack_int n, - const double* ap, const double* tau, double* q, - lapack_int ldq, double* work ); - -lapack_int LAPACKE_sopmtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const float* ap, const float* tau, float* c, - lapack_int ldc, float* work ); -lapack_int LAPACKE_dopmtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const double* ap, const double* tau, double* c, - lapack_int ldc, double* work ); - -lapack_int LAPACKE_sorgbr_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, float* a, - lapack_int lda, const float* tau, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dorgbr_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, double* a, - lapack_int lda, const double* tau, double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sorghr_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, float* a, lapack_int lda, - const float* tau, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dorghr_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, double* a, lapack_int lda, - const double* tau, double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sorglq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dorglq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau, double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sorgql_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dorgql_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau, double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sorgqr_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dorgqr_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau, double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sorgrq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, float* a, lapack_int lda, - const float* tau, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dorgrq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, double* a, lapack_int lda, - const double* tau, double* work, - lapack_int lwork ); - -lapack_int LAPACKE_sorgtr_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, const float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dorgtr_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, const double* tau, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormbr_work( int matrix_order, char vect, char side, - char trans, lapack_int m, lapack_int n, - lapack_int k, const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormbr_work( int matrix_order, char vect, char side, - char trans, lapack_int m, lapack_int n, - lapack_int k, const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormhr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormhr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormlq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormlq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormql_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormql_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormqr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormqr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormrq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormrq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormrz_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormrz_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_sormtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const float* a, lapack_int lda, - const float* tau, float* c, lapack_int ldc, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dormtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const double* a, lapack_int lda, - const double* tau, double* c, lapack_int ldc, - double* work, lapack_int lwork ); - -lapack_int LAPACKE_spbcon_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const float* ab, lapack_int ldab, - float anorm, float* rcond, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dpbcon_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const double* ab, - lapack_int ldab, double anorm, double* rcond, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cpbcon_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_float* ab, - lapack_int ldab, float anorm, float* rcond, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zpbcon_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_double* ab, - lapack_int ldab, double anorm, double* rcond, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_spbequ_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const float* ab, lapack_int ldab, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_dpbequ_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const double* ab, - lapack_int ldab, double* s, double* scond, - double* amax ); -lapack_int LAPACKE_cpbequ_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_float* ab, - lapack_int ldab, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_zpbequ_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, const lapack_complex_double* ab, - lapack_int ldab, double* s, double* scond, - double* amax ); - -lapack_int LAPACKE_spbrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, const float* ab, - lapack_int ldab, const float* afb, - lapack_int ldafb, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dpbrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const double* ab, lapack_int ldab, - const double* afb, lapack_int ldafb, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cpbrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - const lapack_complex_float* afb, - lapack_int ldafb, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zpbrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, - const lapack_complex_double* afb, - lapack_int ldafb, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_spbstf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kb, float* bb, lapack_int ldbb ); -lapack_int LAPACKE_dpbstf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kb, double* bb, lapack_int ldbb ); -lapack_int LAPACKE_cpbstf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kb, lapack_complex_float* bb, - lapack_int ldbb ); -lapack_int LAPACKE_zpbstf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kb, lapack_complex_double* bb, - lapack_int ldbb ); - -lapack_int LAPACKE_spbsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, float* ab, - lapack_int ldab, float* b, lapack_int ldb ); -lapack_int LAPACKE_dpbsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, double* ab, - lapack_int ldab, double* b, lapack_int ldb ); -lapack_int LAPACKE_cpbsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpbsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spbsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int kd, lapack_int nrhs, - float* ab, lapack_int ldab, float* afb, - lapack_int ldafb, char* equed, float* s, - float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dpbsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int kd, lapack_int nrhs, - double* ab, lapack_int ldab, double* afb, - lapack_int ldafb, char* equed, double* s, - double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, double* work, lapack_int* iwork ); -lapack_int LAPACKE_cpbsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int kd, lapack_int nrhs, - lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* afb, lapack_int ldafb, - char* equed, float* s, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zpbsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int kd, lapack_int nrhs, - lapack_complex_double* ab, lapack_int ldab, - lapack_complex_double* afb, lapack_int ldafb, - char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_spbtrf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, float* ab, lapack_int ldab ); -lapack_int LAPACKE_dpbtrf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, double* ab, lapack_int ldab ); -lapack_int LAPACKE_cpbtrf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_complex_float* ab, - lapack_int ldab ); -lapack_int LAPACKE_zpbtrf_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_complex_double* ab, - lapack_int ldab ); - -lapack_int LAPACKE_spbtrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, const float* ab, - lapack_int ldab, float* b, lapack_int ldb ); -lapack_int LAPACKE_dpbtrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const double* ab, lapack_int ldab, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cpbtrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_float* ab, lapack_int ldab, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpbtrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int kd, lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_spftrf_work( int matrix_order, char transr, char uplo, - lapack_int n, float* a ); -lapack_int LAPACKE_dpftrf_work( int matrix_order, char transr, char uplo, - lapack_int n, double* a ); -lapack_int LAPACKE_cpftrf_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_float* a ); -lapack_int LAPACKE_zpftrf_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_double* a ); - -lapack_int LAPACKE_spftri_work( int matrix_order, char transr, char uplo, - lapack_int n, float* a ); -lapack_int LAPACKE_dpftri_work( int matrix_order, char transr, char uplo, - lapack_int n, double* a ); -lapack_int LAPACKE_cpftri_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_float* a ); -lapack_int LAPACKE_zpftri_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_complex_double* a ); - -lapack_int LAPACKE_spftrs_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, const float* a, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dpftrs_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, const double* a, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cpftrs_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpftrs_work( int matrix_order, char transr, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spocon_work( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, float anorm, - float* rcond, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dpocon_work( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, double anorm, - double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cpocon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float anorm, float* rcond, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zpocon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double anorm, double* rcond, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_spoequ_work( int matrix_order, lapack_int n, const float* a, - lapack_int lda, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_dpoequ_work( int matrix_order, lapack_int n, const double* a, - lapack_int lda, double* s, double* scond, - double* amax ); -lapack_int LAPACKE_cpoequ_work( int matrix_order, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_zpoequ_work( int matrix_order, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax ); - -lapack_int LAPACKE_spoequb_work( int matrix_order, lapack_int n, const float* a, - lapack_int lda, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_dpoequb_work( int matrix_order, lapack_int n, - const double* a, lapack_int lda, double* s, - double* scond, double* amax ); -lapack_int LAPACKE_cpoequb_work( int matrix_order, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax ); -lapack_int LAPACKE_zpoequb_work( int matrix_order, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax ); - -lapack_int LAPACKE_sporfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const float* af, lapack_int ldaf, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* ferr, float* berr, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dporfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, const double* af, - lapack_int ldaf, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cporfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zporfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sporfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* af, - lapack_int ldaf, const float* s, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dporfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* af, - lapack_int ldaf, const double* s, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cporfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, - lapack_int ldaf, const float* s, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zporfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, - lapack_int ldaf, const double* s, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sposv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dposv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cposv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zposv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb ); -lapack_int LAPACKE_dsposv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - double* b, lapack_int ldb, double* x, - lapack_int ldx, double* work, float* swork, - lapack_int* iter ); -lapack_int LAPACKE_zcposv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, lapack_complex_double* work, - lapack_complex_float* swork, double* rwork, - lapack_int* iter ); - -lapack_int LAPACKE_sposvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - char* equed, float* s, float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dposvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - char* equed, double* s, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cposvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - char* equed, float* s, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zposvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sposvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - char* equed, float* s, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dposvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - char* equed, double* s, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cposvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - char* equed, float* s, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* rpvgrw, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zposvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_spotrf_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda ); -lapack_int LAPACKE_dpotrf_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda ); -lapack_int LAPACKE_cpotrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zpotrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_spotri_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda ); -lapack_int LAPACKE_dpotri_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda ); -lapack_int LAPACKE_cpotri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zpotri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_spotrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dpotrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, double* b, lapack_int ldb ); -lapack_int LAPACKE_cpotrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zpotrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sppcon_work( int matrix_order, char uplo, lapack_int n, - const float* ap, float anorm, float* rcond, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dppcon_work( int matrix_order, char uplo, lapack_int n, - const double* ap, double anorm, double* rcond, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cppcon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, float anorm, - float* rcond, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zppcon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, double anorm, - double* rcond, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_sppequ_work( int matrix_order, char uplo, lapack_int n, - const float* ap, float* s, float* scond, - float* amax ); -lapack_int LAPACKE_dppequ_work( int matrix_order, char uplo, lapack_int n, - const double* ap, double* s, double* scond, - double* amax ); -lapack_int LAPACKE_cppequ_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, float* s, - float* scond, float* amax ); -lapack_int LAPACKE_zppequ_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, double* s, - double* scond, double* amax ); - -lapack_int LAPACKE_spprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, - const float* afp, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dpprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, - const double* afp, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* ferr, double* berr, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cpprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zpprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sppsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* ap, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dppsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* ap, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cppsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zppsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sppsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, float* ap, - float* afp, char* equed, float* s, float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dppsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, double* ap, - double* afp, char* equed, double* s, double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cppsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* ap, - lapack_complex_float* afp, char* equed, - float* s, lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zppsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* ap, - lapack_complex_double* afp, char* equed, - double* s, lapack_complex_double* b, - lapack_int ldb, lapack_complex_double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_spptrf_work( int matrix_order, char uplo, lapack_int n, - float* ap ); -lapack_int LAPACKE_dpptrf_work( int matrix_order, char uplo, lapack_int n, - double* ap ); -lapack_int LAPACKE_cpptrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap ); -lapack_int LAPACKE_zpptrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap ); - -lapack_int LAPACKE_spptri_work( int matrix_order, char uplo, lapack_int n, - float* ap ); -lapack_int LAPACKE_dpptri_work( int matrix_order, char uplo, lapack_int n, - double* ap ); -lapack_int LAPACKE_cpptri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap ); -lapack_int LAPACKE_zpptri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap ); - -lapack_int LAPACKE_spptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dpptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cpptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* ap, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_spstrf_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, lapack_int* piv, - lapack_int* rank, float tol, float* work ); -lapack_int LAPACKE_dpstrf_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, lapack_int* piv, - lapack_int* rank, double tol, double* work ); -lapack_int LAPACKE_cpstrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* piv, lapack_int* rank, float tol, - float* work ); -lapack_int LAPACKE_zpstrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* piv, lapack_int* rank, double tol, - double* work ); - -lapack_int LAPACKE_sptcon_work( lapack_int n, const float* d, const float* e, - float anorm, float* rcond, float* work ); -lapack_int LAPACKE_dptcon_work( lapack_int n, const double* d, const double* e, - double anorm, double* rcond, double* work ); -lapack_int LAPACKE_cptcon_work( lapack_int n, const float* d, - const lapack_complex_float* e, float anorm, - float* rcond, float* work ); -lapack_int LAPACKE_zptcon_work( lapack_int n, const double* d, - const lapack_complex_double* e, double anorm, - double* rcond, double* work ); - -lapack_int LAPACKE_spteqr_work( int matrix_order, char compz, lapack_int n, - float* d, float* e, float* z, lapack_int ldz, - float* work ); -lapack_int LAPACKE_dpteqr_work( int matrix_order, char compz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz, - double* work ); -lapack_int LAPACKE_cpteqr_work( int matrix_order, char compz, lapack_int n, - float* d, float* e, lapack_complex_float* z, - lapack_int ldz, float* work ); -lapack_int LAPACKE_zpteqr_work( int matrix_order, char compz, lapack_int n, - double* d, double* e, lapack_complex_double* z, - lapack_int ldz, double* work ); - -lapack_int LAPACKE_sptrfs_work( int matrix_order, lapack_int n, lapack_int nrhs, - const float* d, const float* e, const float* df, - const float* ef, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* ferr, - float* berr, float* work ); -lapack_int LAPACKE_dptrfs_work( int matrix_order, lapack_int n, lapack_int nrhs, - const double* d, const double* e, - const double* df, const double* ef, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr, - double* work ); -lapack_int LAPACKE_cptrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* d, - const lapack_complex_float* e, const float* df, - const lapack_complex_float* ef, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zptrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* d, - const lapack_complex_double* e, - const double* df, - const lapack_complex_double* ef, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sptsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - float* d, float* e, float* b, lapack_int ldb ); -lapack_int LAPACKE_dptsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - double* d, double* e, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cptsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - float* d, lapack_complex_float* e, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zptsv_work( int matrix_order, lapack_int n, lapack_int nrhs, - double* d, lapack_complex_double* e, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sptsvx_work( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const float* d, const float* e, - float* df, float* ef, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* work ); -lapack_int LAPACKE_dptsvx_work( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const double* d, - const double* e, double* df, double* ef, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* ferr, - double* berr, double* work ); -lapack_int LAPACKE_cptsvx_work( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const float* d, - const lapack_complex_float* e, float* df, - lapack_complex_float* ef, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zptsvx_work( int matrix_order, char fact, lapack_int n, - lapack_int nrhs, const double* d, - const lapack_complex_double* e, double* df, - lapack_complex_double* ef, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_spttrf_work( lapack_int n, float* d, float* e ); -lapack_int LAPACKE_dpttrf_work( lapack_int n, double* d, double* e ); -lapack_int LAPACKE_cpttrf_work( lapack_int n, float* d, - lapack_complex_float* e ); -lapack_int LAPACKE_zpttrf_work( lapack_int n, double* d, - lapack_complex_double* e ); - -lapack_int LAPACKE_spttrs_work( int matrix_order, lapack_int n, lapack_int nrhs, - const float* d, const float* e, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dpttrs_work( int matrix_order, lapack_int n, lapack_int nrhs, - const double* d, const double* e, double* b, - lapack_int ldb ); -lapack_int LAPACKE_cpttrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* d, - const lapack_complex_float* e, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zpttrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* d, - const lapack_complex_double* e, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_ssbev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, float* ab, - lapack_int ldab, float* w, float* z, - lapack_int ldz, float* work ); -lapack_int LAPACKE_dsbev_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, double* ab, - lapack_int ldab, double* w, double* z, - lapack_int ldz, double* work ); - -lapack_int LAPACKE_ssbevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, float* ab, - lapack_int ldab, float* w, float* z, - lapack_int ldz, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dsbevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int kd, double* ab, - lapack_int ldab, double* w, double* z, - lapack_int ldz, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_ssbevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int kd, - float* ab, lapack_int ldab, float* q, - lapack_int ldq, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, - lapack_int ldz, float* work, lapack_int* iwork, - lapack_int* ifail ); -lapack_int LAPACKE_dsbevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int kd, - double* ab, lapack_int ldab, double* q, - lapack_int ldq, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, double* z, - lapack_int ldz, double* work, lapack_int* iwork, - lapack_int* ifail ); - -lapack_int LAPACKE_ssbgst_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - float* ab, lapack_int ldab, const float* bb, - lapack_int ldbb, float* x, lapack_int ldx, - float* work ); -lapack_int LAPACKE_dsbgst_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - double* ab, lapack_int ldab, const double* bb, - lapack_int ldbb, double* x, lapack_int ldx, - double* work ); - -lapack_int LAPACKE_ssbgv_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - float* ab, lapack_int ldab, float* bb, - lapack_int ldbb, float* w, float* z, - lapack_int ldz, float* work ); -lapack_int LAPACKE_dsbgv_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - double* ab, lapack_int ldab, double* bb, - lapack_int ldbb, double* w, double* z, - lapack_int ldz, double* work ); - -lapack_int LAPACKE_ssbgvd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - float* ab, lapack_int ldab, float* bb, - lapack_int ldbb, float* w, float* z, - lapack_int ldz, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dsbgvd_work( int matrix_order, char jobz, char uplo, - lapack_int n, lapack_int ka, lapack_int kb, - double* ab, lapack_int ldab, double* bb, - lapack_int ldbb, double* w, double* z, - lapack_int ldz, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_ssbgvx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int ka, - lapack_int kb, float* ab, lapack_int ldab, - float* bb, lapack_int ldbb, float* q, - lapack_int ldq, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, - lapack_int ldz, float* work, lapack_int* iwork, - lapack_int* ifail ); -lapack_int LAPACKE_dsbgvx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, lapack_int ka, - lapack_int kb, double* ab, lapack_int ldab, - double* bb, lapack_int ldbb, double* q, - lapack_int ldq, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, double* z, - lapack_int ldz, double* work, lapack_int* iwork, - lapack_int* ifail ); - -lapack_int LAPACKE_ssbtrd_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int kd, float* ab, - lapack_int ldab, float* d, float* e, float* q, - lapack_int ldq, float* work ); -lapack_int LAPACKE_dsbtrd_work( int matrix_order, char vect, char uplo, - lapack_int n, lapack_int kd, double* ab, - lapack_int ldab, double* d, double* e, - double* q, lapack_int ldq, double* work ); - -lapack_int LAPACKE_ssfrk_work( int matrix_order, char transr, char uplo, - char trans, lapack_int n, lapack_int k, - float alpha, const float* a, lapack_int lda, - float beta, float* c ); -lapack_int LAPACKE_dsfrk_work( int matrix_order, char transr, char uplo, - char trans, lapack_int n, lapack_int k, - double alpha, const double* a, lapack_int lda, - double beta, double* c ); - -lapack_int LAPACKE_sspcon_work( int matrix_order, char uplo, lapack_int n, - const float* ap, const lapack_int* ipiv, - float anorm, float* rcond, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dspcon_work( int matrix_order, char uplo, lapack_int n, - const double* ap, const lapack_int* ipiv, - double anorm, double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_cspcon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - const lapack_int* ipiv, float anorm, - float* rcond, lapack_complex_float* work ); -lapack_int LAPACKE_zspcon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - const lapack_int* ipiv, double anorm, - double* rcond, lapack_complex_double* work ); - -lapack_int LAPACKE_sspev_work( int matrix_order, char jobz, char uplo, - lapack_int n, float* ap, float* w, float* z, - lapack_int ldz, float* work ); -lapack_int LAPACKE_dspev_work( int matrix_order, char jobz, char uplo, - lapack_int n, double* ap, double* w, double* z, - lapack_int ldz, double* work ); - -lapack_int LAPACKE_sspevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, float* ap, float* w, float* z, - lapack_int ldz, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dspevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, double* ap, double* w, double* z, - lapack_int ldz, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_sspevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, float* ap, float vl, - float vu, lapack_int il, lapack_int iu, - float abstol, lapack_int* m, float* w, float* z, - lapack_int ldz, float* work, lapack_int* iwork, - lapack_int* ifail ); -lapack_int LAPACKE_dspevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, double* ap, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - double* z, lapack_int ldz, double* work, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_sspgst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, float* ap, const float* bp ); -lapack_int LAPACKE_dspgst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, double* ap, const double* bp ); - -lapack_int LAPACKE_sspgv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* ap, float* bp, - float* w, float* z, lapack_int ldz, - float* work ); -lapack_int LAPACKE_dspgv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* ap, double* bp, - double* w, double* z, lapack_int ldz, - double* work ); - -lapack_int LAPACKE_sspgvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* ap, float* bp, - float* w, float* z, lapack_int ldz, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_dspgvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* ap, double* bp, - double* w, double* z, lapack_int ldz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_sspgvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, float* ap, - float* bp, float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, - float* w, float* z, lapack_int ldz, float* work, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_dspgvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, double* ap, - double* bp, double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, double* z, lapack_int ldz, - double* work, lapack_int* iwork, - lapack_int* ifail ); - -lapack_int LAPACKE_ssprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, - const float* afp, const lapack_int* ipiv, - const float* b, lapack_int ldb, float* x, - lapack_int ldx, float* ferr, float* berr, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dsprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, - const double* afp, const lapack_int* ipiv, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_csprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zsprfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_sspsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* ap, lapack_int* ipiv, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dspsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* ap, lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_cspsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* ap, - lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zspsv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* ap, - lapack_int* ipiv, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_sspsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, const float* ap, - float* afp, lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dspsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, const double* ap, - double* afp, lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_cspsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* ap, - lapack_complex_float* afp, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zspsvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* ap, - lapack_complex_double* afp, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_ssptrd_work( int matrix_order, char uplo, lapack_int n, - float* ap, float* d, float* e, float* tau ); -lapack_int LAPACKE_dsptrd_work( int matrix_order, char uplo, lapack_int n, - double* ap, double* d, double* e, double* tau ); - -lapack_int LAPACKE_ssptrf_work( int matrix_order, char uplo, lapack_int n, - float* ap, lapack_int* ipiv ); -lapack_int LAPACKE_dsptrf_work( int matrix_order, char uplo, lapack_int n, - double* ap, lapack_int* ipiv ); -lapack_int LAPACKE_csptrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, lapack_int* ipiv ); -lapack_int LAPACKE_zsptrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, lapack_int* ipiv ); - -lapack_int LAPACKE_ssptri_work( int matrix_order, char uplo, lapack_int n, - float* ap, const lapack_int* ipiv, - float* work ); -lapack_int LAPACKE_dsptri_work( int matrix_order, char uplo, lapack_int n, - double* ap, const lapack_int* ipiv, - double* work ); -lapack_int LAPACKE_csptri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* ap, - const lapack_int* ipiv, - lapack_complex_float* work ); -lapack_int LAPACKE_zsptri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* ap, - const lapack_int* ipiv, - lapack_complex_double* work ); - -lapack_int LAPACKE_ssptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* ap, - const lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dsptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* ap, - const lapack_int* ipiv, double* b, - lapack_int ldb ); -lapack_int LAPACKE_csptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* ap, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_zsptrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_sstebz_work( char range, char order, lapack_int n, float vl, - float vu, lapack_int il, lapack_int iu, - float abstol, const float* d, const float* e, - lapack_int* m, lapack_int* nsplit, float* w, - lapack_int* iblock, lapack_int* isplit, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dstebz_work( char range, char order, lapack_int n, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, const double* d, const double* e, - lapack_int* m, lapack_int* nsplit, double* w, - lapack_int* iblock, lapack_int* isplit, - double* work, lapack_int* iwork ); - -lapack_int LAPACKE_sstedc_work( int matrix_order, char compz, lapack_int n, - float* d, float* e, float* z, lapack_int ldz, - float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dstedc_work( int matrix_order, char compz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_cstedc_work( int matrix_order, char compz, lapack_int n, - float* d, float* e, lapack_complex_float* z, - lapack_int ldz, lapack_complex_float* work, - lapack_int lwork, float* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zstedc_work( int matrix_order, char compz, lapack_int n, - double* d, double* e, lapack_complex_double* z, - lapack_int ldz, lapack_complex_double* work, - lapack_int lwork, double* rwork, - lapack_int lrwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_sstegr_work( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, - float vu, lapack_int il, lapack_int iu, - float abstol, lapack_int* m, float* w, float* z, - lapack_int ldz, lapack_int* isuppz, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_dstegr_work( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - double* z, lapack_int ldz, lapack_int* isuppz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_cstegr_work( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, - float vu, lapack_int il, lapack_int iu, - float abstol, lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_int* isuppz, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zstegr_work( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int* isuppz, double* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_sstein_work( int matrix_order, lapack_int n, const float* d, - const float* e, lapack_int m, const float* w, - const lapack_int* iblock, - const lapack_int* isplit, float* z, - lapack_int ldz, float* work, lapack_int* iwork, - lapack_int* ifailv ); -lapack_int LAPACKE_dstein_work( int matrix_order, lapack_int n, const double* d, - const double* e, lapack_int m, const double* w, - const lapack_int* iblock, - const lapack_int* isplit, double* z, - lapack_int ldz, double* work, lapack_int* iwork, - lapack_int* ifailv ); -lapack_int LAPACKE_cstein_work( int matrix_order, lapack_int n, const float* d, - const float* e, lapack_int m, const float* w, - const lapack_int* iblock, - const lapack_int* isplit, - lapack_complex_float* z, lapack_int ldz, - float* work, lapack_int* iwork, - lapack_int* ifailv ); -lapack_int LAPACKE_zstein_work( int matrix_order, lapack_int n, const double* d, - const double* e, lapack_int m, const double* w, - const lapack_int* iblock, - const lapack_int* isplit, - lapack_complex_double* z, lapack_int ldz, - double* work, lapack_int* iwork, - lapack_int* ifailv ); - -lapack_int LAPACKE_sstemr_work( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, - float vu, lapack_int il, lapack_int iu, - lapack_int* m, float* w, float* z, - lapack_int ldz, lapack_int nzc, - lapack_int* isuppz, lapack_logical* tryrac, - float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dstemr_work( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int nzc, - lapack_int* isuppz, lapack_logical* tryrac, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_cstemr_work( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, - float vu, lapack_int il, lapack_int iu, - lapack_int* m, float* w, - lapack_complex_float* z, lapack_int ldz, - lapack_int nzc, lapack_int* isuppz, - lapack_logical* tryrac, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_zstemr_work( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - lapack_int* m, double* w, - lapack_complex_double* z, lapack_int ldz, - lapack_int nzc, lapack_int* isuppz, - lapack_logical* tryrac, double* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_ssteqr_work( int matrix_order, char compz, lapack_int n, - float* d, float* e, float* z, lapack_int ldz, - float* work ); -lapack_int LAPACKE_dsteqr_work( int matrix_order, char compz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz, - double* work ); -lapack_int LAPACKE_csteqr_work( int matrix_order, char compz, lapack_int n, - float* d, float* e, lapack_complex_float* z, - lapack_int ldz, float* work ); -lapack_int LAPACKE_zsteqr_work( int matrix_order, char compz, lapack_int n, - double* d, double* e, lapack_complex_double* z, - lapack_int ldz, double* work ); - -lapack_int LAPACKE_ssterf_work( lapack_int n, float* d, float* e ); -lapack_int LAPACKE_dsterf_work( lapack_int n, double* d, double* e ); - -lapack_int LAPACKE_sstev_work( int matrix_order, char jobz, lapack_int n, - float* d, float* e, float* z, lapack_int ldz, - float* work ); -lapack_int LAPACKE_dstev_work( int matrix_order, char jobz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz, - double* work ); - -lapack_int LAPACKE_sstevd_work( int matrix_order, char jobz, lapack_int n, - float* d, float* e, float* z, lapack_int ldz, - float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dstevd_work( int matrix_order, char jobz, lapack_int n, - double* d, double* e, double* z, lapack_int ldz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_sstevr_work( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, - float vu, lapack_int il, lapack_int iu, - float abstol, lapack_int* m, float* w, float* z, - lapack_int ldz, lapack_int* isuppz, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_dstevr_work( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - double* z, lapack_int ldz, lapack_int* isuppz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_sstevx_work( int matrix_order, char jobz, char range, - lapack_int n, float* d, float* e, float vl, - float vu, lapack_int il, lapack_int iu, - float abstol, lapack_int* m, float* w, float* z, - lapack_int ldz, float* work, lapack_int* iwork, - lapack_int* ifail ); -lapack_int LAPACKE_dstevx_work( int matrix_order, char jobz, char range, - lapack_int n, double* d, double* e, double vl, - double vu, lapack_int il, lapack_int iu, - double abstol, lapack_int* m, double* w, - double* z, lapack_int ldz, double* work, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_ssycon_work( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, - const lapack_int* ipiv, float anorm, - float* rcond, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dsycon_work( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, - const lapack_int* ipiv, double anorm, - double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_csycon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, float anorm, - float* rcond, lapack_complex_float* work ); -lapack_int LAPACKE_zsycon_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, double anorm, - double* rcond, lapack_complex_double* work ); - -lapack_int LAPACKE_ssyequb_work( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, float* s, - float* scond, float* amax, float* work ); -lapack_int LAPACKE_dsyequb_work( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, double* s, - double* scond, double* amax, double* work ); -lapack_int LAPACKE_csyequb_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* s, float* scond, float* amax, - lapack_complex_float* work ); -lapack_int LAPACKE_zsyequb_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* s, double* scond, double* amax, - lapack_complex_double* work ); - -lapack_int LAPACKE_ssyev_work( int matrix_order, char jobz, char uplo, - lapack_int n, float* a, lapack_int lda, float* w, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dsyev_work( int matrix_order, char jobz, char uplo, - lapack_int n, double* a, lapack_int lda, - double* w, double* work, lapack_int lwork ); - -lapack_int LAPACKE_ssyevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, float* a, lapack_int lda, - float* w, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dsyevd_work( int matrix_order, char jobz, char uplo, - lapack_int n, double* a, lapack_int lda, - double* w, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_ssyevr_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, float* a, - lapack_int lda, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, - lapack_int ldz, lapack_int* isuppz, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_dsyevr_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, double* a, - lapack_int lda, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, double* z, - lapack_int ldz, lapack_int* isuppz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_ssyevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, float* a, - lapack_int lda, float vl, float vu, - lapack_int il, lapack_int iu, float abstol, - lapack_int* m, float* w, float* z, - lapack_int ldz, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int* ifail ); -lapack_int LAPACKE_dsyevx_work( int matrix_order, char jobz, char range, - char uplo, lapack_int n, double* a, - lapack_int lda, double vl, double vu, - lapack_int il, lapack_int iu, double abstol, - lapack_int* m, double* w, double* z, - lapack_int ldz, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_ssygst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, float* a, lapack_int lda, - const float* b, lapack_int ldb ); -lapack_int LAPACKE_dsygst_work( int matrix_order, lapack_int itype, char uplo, - lapack_int n, double* a, lapack_int lda, - const double* b, lapack_int ldb ); - -lapack_int LAPACKE_ssygv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* w, float* work, lapack_int lwork ); -lapack_int LAPACKE_dsygv_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* w, double* work, lapack_int lwork ); - -lapack_int LAPACKE_ssygvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* w, float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dsygvd_work( int matrix_order, lapack_int itype, char jobz, - char uplo, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* w, double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); - -lapack_int LAPACKE_ssygvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float vl, float vu, lapack_int il, - lapack_int iu, float abstol, lapack_int* m, - float* w, float* z, lapack_int ldz, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int* ifail ); -lapack_int LAPACKE_dsygvx_work( int matrix_order, lapack_int itype, char jobz, - char range, char uplo, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double vl, double vu, lapack_int il, - lapack_int iu, double abstol, lapack_int* m, - double* w, double* z, lapack_int ldz, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int* ifail ); - -lapack_int LAPACKE_ssyrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const float* af, lapack_int ldaf, - const lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dsyrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, const double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* b, lapack_int ldb, double* x, - lapack_int ldx, double* ferr, double* berr, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_csyrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_zsyrfs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_ssyrfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, const float* af, - lapack_int ldaf, const lapack_int* ipiv, - const float* s, const float* b, lapack_int ldb, - float* x, lapack_int ldx, float* rcond, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dsyrfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, const double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* s, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_csyrfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* af, - lapack_int ldaf, const lapack_int* ipiv, - const float* s, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zsyrfsx_work( int matrix_order, char uplo, char equed, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* af, - lapack_int ldaf, const lapack_int* ipiv, - const double* s, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_ssysv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, float* a, lapack_int lda, - lapack_int* ipiv, float* b, lapack_int ldb, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dsysv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, double* a, lapack_int lda, - lapack_int* ipiv, double* b, lapack_int ldb, - double* work, lapack_int lwork ); -lapack_int LAPACKE_csysv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_float* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zsysv_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, lapack_complex_double* a, - lapack_int lda, lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_ssysvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, const float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, const float* b, - lapack_int ldb, float* x, lapack_int ldx, - float* rcond, float* ferr, float* berr, - float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dsysvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, const double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, const double* b, - lapack_int ldb, double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - double* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_csysvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int ldb, lapack_complex_float* x, - lapack_int ldx, float* rcond, float* ferr, - float* berr, lapack_complex_float* work, - lapack_int lwork, float* rwork ); -lapack_int LAPACKE_zsysvx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, lapack_int lwork, - double* rwork ); - -lapack_int LAPACKE_ssysvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, float* a, - lapack_int lda, float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* s, - float* b, lapack_int ldb, float* x, - lapack_int ldx, float* rcond, float* rpvgrw, - float* berr, lapack_int n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int nparams, float* params, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dsysvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, double* a, - lapack_int lda, double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* s, - double* b, lapack_int ldb, double* x, - lapack_int ldx, double* rcond, double* rpvgrw, - double* berr, lapack_int n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int nparams, double* params, - double* work, lapack_int* iwork ); -lapack_int LAPACKE_csysvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, float* s, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* x, lapack_int ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int nparams, - float* params, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_zsysvxx_work( int matrix_order, char fact, char uplo, - lapack_int n, lapack_int nrhs, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* af, lapack_int ldaf, - lapack_int* ipiv, char* equed, double* s, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* x, lapack_int ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int nparams, - double* params, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_ssytrd_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, float* d, float* e, - float* tau, float* work, lapack_int lwork ); -lapack_int LAPACKE_dsytrd_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, double* d, double* e, - double* tau, double* work, lapack_int lwork ); - -lapack_int LAPACKE_ssytrf_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, lapack_int* ipiv, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dsytrf_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, lapack_int* ipiv, - double* work, lapack_int lwork ); -lapack_int LAPACKE_csytrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_float* work, - lapack_int lwork ); -lapack_int LAPACKE_zsytrf_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_int* ipiv, lapack_complex_double* work, - lapack_int lwork ); - -lapack_int LAPACKE_ssytri_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, - const lapack_int* ipiv, float* work ); -lapack_int LAPACKE_dsytri_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, - const lapack_int* ipiv, double* work ); -lapack_int LAPACKE_csytri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work ); -lapack_int LAPACKE_zsytri_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work ); - -lapack_int LAPACKE_ssytrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const lapack_int* ipiv, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dsytrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, const lapack_int* ipiv, - double* b, lapack_int ldb ); -lapack_int LAPACKE_csytrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_zsytrs_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stbcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, lapack_int kd, - const float* ab, lapack_int ldab, float* rcond, - float* work, lapack_int* iwork ); -lapack_int LAPACKE_dtbcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, lapack_int kd, - const double* ab, lapack_int ldab, - double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_ctbcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, lapack_int kd, - const lapack_complex_float* ab, lapack_int ldab, - float* rcond, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_ztbcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, lapack_int kd, - const lapack_complex_double* ab, - lapack_int ldab, double* rcond, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_stbrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, const float* ab, - lapack_int ldab, const float* b, lapack_int ldb, - const float* x, lapack_int ldx, float* ferr, - float* berr, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dtbrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, const double* ab, - lapack_int ldab, const double* b, - lapack_int ldb, const double* x, lapack_int ldx, - double* ferr, double* berr, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_ctbrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, const lapack_complex_float* ab, - lapack_int ldab, const lapack_complex_float* b, - lapack_int ldb, const lapack_complex_float* x, - lapack_int ldx, float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_ztbrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, const lapack_complex_double* b, - lapack_int ldb, const lapack_complex_double* x, - lapack_int ldx, double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_stbtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, const float* ab, - lapack_int ldab, float* b, lapack_int ldb ); -lapack_int LAPACKE_dtbtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, const double* ab, - lapack_int ldab, double* b, lapack_int ldb ); -lapack_int LAPACKE_ctbtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, const lapack_complex_float* ab, - lapack_int ldab, lapack_complex_float* b, - lapack_int ldb ); -lapack_int LAPACKE_ztbtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int kd, - lapack_int nrhs, - const lapack_complex_double* ab, - lapack_int ldab, lapack_complex_double* b, - lapack_int ldb ); - -lapack_int LAPACKE_stfsm_work( int matrix_order, char transr, char side, - char uplo, char trans, char diag, lapack_int m, - lapack_int n, float alpha, const float* a, - float* b, lapack_int ldb ); -lapack_int LAPACKE_dtfsm_work( int matrix_order, char transr, char side, - char uplo, char trans, char diag, lapack_int m, - lapack_int n, double alpha, const double* a, - double* b, lapack_int ldb ); -lapack_int LAPACKE_ctfsm_work( int matrix_order, char transr, char side, - char uplo, char trans, char diag, lapack_int m, - lapack_int n, lapack_complex_float alpha, - const lapack_complex_float* a, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztfsm_work( int matrix_order, char transr, char side, - char uplo, char trans, char diag, lapack_int m, - lapack_int n, lapack_complex_double alpha, - const lapack_complex_double* a, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stftri_work( int matrix_order, char transr, char uplo, - char diag, lapack_int n, float* a ); -lapack_int LAPACKE_dtftri_work( int matrix_order, char transr, char uplo, - char diag, lapack_int n, double* a ); -lapack_int LAPACKE_ctftri_work( int matrix_order, char transr, char uplo, - char diag, lapack_int n, - lapack_complex_float* a ); -lapack_int LAPACKE_ztftri_work( int matrix_order, char transr, char uplo, - char diag, lapack_int n, - lapack_complex_double* a ); - -lapack_int LAPACKE_stfttp_work( int matrix_order, char transr, char uplo, - lapack_int n, const float* arf, float* ap ); -lapack_int LAPACKE_dtfttp_work( int matrix_order, char transr, char uplo, - lapack_int n, const double* arf, double* ap ); -lapack_int LAPACKE_ctfttp_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* arf, - lapack_complex_float* ap ); -lapack_int LAPACKE_ztfttp_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* arf, - lapack_complex_double* ap ); - -lapack_int LAPACKE_stfttr_work( int matrix_order, char transr, char uplo, - lapack_int n, const float* arf, float* a, - lapack_int lda ); -lapack_int LAPACKE_dtfttr_work( int matrix_order, char transr, char uplo, - lapack_int n, const double* arf, double* a, - lapack_int lda ); -lapack_int LAPACKE_ctfttr_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* arf, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_ztfttr_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* arf, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_stgevc_work( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const float* s, lapack_int lds, const float* p, - lapack_int ldp, float* vl, lapack_int ldvl, - float* vr, lapack_int ldvr, lapack_int mm, - lapack_int* m, float* work ); -lapack_int LAPACKE_dtgevc_work( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const double* s, lapack_int lds, - const double* p, lapack_int ldp, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, double* work ); -lapack_int LAPACKE_ctgevc_work( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* s, lapack_int lds, - const lapack_complex_float* p, lapack_int ldp, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_ztgevc_work( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* s, lapack_int lds, - const lapack_complex_double* p, lapack_int ldp, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_stgexc_work( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, float* a, - lapack_int lda, float* b, lapack_int ldb, - float* q, lapack_int ldq, float* z, - lapack_int ldz, lapack_int* ifst, - lapack_int* ilst, float* work, - lapack_int lwork ); -lapack_int LAPACKE_dtgexc_work( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* q, lapack_int ldq, double* z, - lapack_int ldz, lapack_int* ifst, - lapack_int* ilst, double* work, - lapack_int lwork ); -lapack_int LAPACKE_ctgexc_work( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* z, lapack_int ldz, - lapack_int ifst, lapack_int ilst ); -lapack_int LAPACKE_ztgexc_work( int matrix_order, lapack_logical wantq, - lapack_logical wantz, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz, - lapack_int ifst, lapack_int ilst ); - -lapack_int LAPACKE_stgsen_work( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - float* a, lapack_int lda, float* b, - lapack_int ldb, float* alphar, float* alphai, - float* beta, float* q, lapack_int ldq, float* z, - lapack_int ldz, lapack_int* m, float* pl, - float* pr, float* dif, float* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); -lapack_int LAPACKE_dtgsen_work( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - double* a, lapack_int lda, double* b, - lapack_int ldb, double* alphar, double* alphai, - double* beta, double* q, lapack_int ldq, - double* z, lapack_int ldz, lapack_int* m, - double* pl, double* pr, double* dif, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_ctgsen_work( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* alpha, - lapack_complex_float* beta, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* z, lapack_int ldz, - lapack_int* m, float* pl, float* pr, float* dif, - lapack_complex_float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_ztgsen_work( int matrix_order, lapack_int ijob, - lapack_logical wantq, lapack_logical wantz, - const lapack_logical* select, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* alpha, - lapack_complex_double* beta, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* z, lapack_int ldz, - lapack_int* m, double* pl, double* pr, - double* dif, lapack_complex_double* work, - lapack_int lwork, lapack_int* iwork, - lapack_int liwork ); - -lapack_int LAPACKE_stgsja_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, lapack_int k, lapack_int l, - float* a, lapack_int lda, float* b, - lapack_int ldb, float tola, float tolb, - float* alpha, float* beta, float* u, - lapack_int ldu, float* v, lapack_int ldv, - float* q, lapack_int ldq, float* work, - lapack_int* ncycle ); -lapack_int LAPACKE_dtgsja_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, lapack_int k, lapack_int l, - double* a, lapack_int lda, double* b, - lapack_int ldb, double tola, double tolb, - double* alpha, double* beta, double* u, - lapack_int ldu, double* v, lapack_int ldv, - double* q, lapack_int ldq, double* work, - lapack_int* ncycle ); -lapack_int LAPACKE_ctgsja_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, lapack_int k, lapack_int l, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - float tola, float tolb, float* alpha, - float* beta, lapack_complex_float* u, - lapack_int ldu, lapack_complex_float* v, - lapack_int ldv, lapack_complex_float* q, - lapack_int ldq, lapack_complex_float* work, - lapack_int* ncycle ); -lapack_int LAPACKE_ztgsja_work( int matrix_order, char jobu, char jobv, - char jobq, lapack_int m, lapack_int p, - lapack_int n, lapack_int k, lapack_int l, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - double tola, double tolb, double* alpha, - double* beta, lapack_complex_double* u, - lapack_int ldu, lapack_complex_double* v, - lapack_int ldv, lapack_complex_double* q, - lapack_int ldq, lapack_complex_double* work, - lapack_int* ncycle ); - -lapack_int LAPACKE_stgsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const float* a, lapack_int lda, const float* b, - lapack_int ldb, const float* vl, - lapack_int ldvl, const float* vr, - lapack_int ldvr, float* s, float* dif, - lapack_int mm, lapack_int* m, float* work, - lapack_int lwork, lapack_int* iwork ); -lapack_int LAPACKE_dtgsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const double* a, lapack_int lda, - const double* b, lapack_int ldb, - const double* vl, lapack_int ldvl, - const double* vr, lapack_int ldvr, double* s, - double* dif, lapack_int mm, lapack_int* m, - double* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_ctgsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* vl, lapack_int ldvl, - const lapack_complex_float* vr, lapack_int ldvr, - float* s, float* dif, lapack_int mm, - lapack_int* m, lapack_complex_float* work, - lapack_int lwork, lapack_int* iwork ); -lapack_int LAPACKE_ztgsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* vl, - lapack_int ldvl, - const lapack_complex_double* vr, - lapack_int ldvr, double* s, double* dif, - lapack_int mm, lapack_int* m, - lapack_complex_double* work, lapack_int lwork, - lapack_int* iwork ); - -lapack_int LAPACKE_stgsyl_work( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, const float* a, - lapack_int lda, const float* b, lapack_int ldb, - float* c, lapack_int ldc, const float* d, - lapack_int ldd, const float* e, lapack_int lde, - float* f, lapack_int ldf, float* scale, - float* dif, float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dtgsyl_work( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, const double* a, - lapack_int lda, const double* b, lapack_int ldb, - double* c, lapack_int ldc, const double* d, - lapack_int ldd, const double* e, lapack_int lde, - double* f, lapack_int ldf, double* scale, - double* dif, double* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_ctgsyl_work( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* c, lapack_int ldc, - const lapack_complex_float* d, lapack_int ldd, - const lapack_complex_float* e, lapack_int lde, - lapack_complex_float* f, lapack_int ldf, - float* scale, float* dif, - lapack_complex_float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_ztgsyl_work( int matrix_order, char trans, lapack_int ijob, - lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* c, lapack_int ldc, - const lapack_complex_double* d, lapack_int ldd, - const lapack_complex_double* e, lapack_int lde, - lapack_complex_double* f, lapack_int ldf, - double* scale, double* dif, - lapack_complex_double* work, lapack_int lwork, - lapack_int* iwork ); - -lapack_int LAPACKE_stpcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, const float* ap, - float* rcond, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dtpcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, const double* ap, - double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_ctpcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, - const lapack_complex_float* ap, float* rcond, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_ztpcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, - const lapack_complex_double* ap, double* rcond, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_stprfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const float* ap, const float* b, lapack_int ldb, - const float* x, lapack_int ldx, float* ferr, - float* berr, float* work, lapack_int* iwork ); -lapack_int LAPACKE_dtprfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const double* ap, const double* b, - lapack_int ldb, const double* x, lapack_int ldx, - double* ferr, double* berr, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_ctprfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_float* ap, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_ztprfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_stptri_work( int matrix_order, char uplo, char diag, - lapack_int n, float* ap ); -lapack_int LAPACKE_dtptri_work( int matrix_order, char uplo, char diag, - lapack_int n, double* ap ); -lapack_int LAPACKE_ctptri_work( int matrix_order, char uplo, char diag, - lapack_int n, lapack_complex_float* ap ); -lapack_int LAPACKE_ztptri_work( int matrix_order, char uplo, char diag, - lapack_int n, lapack_complex_double* ap ); - -lapack_int LAPACKE_stptrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const float* ap, float* b, lapack_int ldb ); -lapack_int LAPACKE_dtptrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const double* ap, double* b, lapack_int ldb ); -lapack_int LAPACKE_ctptrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_float* ap, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztptrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_double* ap, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_stpttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const float* ap, float* arf ); -lapack_int LAPACKE_dtpttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const double* ap, double* arf ); -lapack_int LAPACKE_ctpttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* ap, - lapack_complex_float* arf ); -lapack_int LAPACKE_ztpttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* ap, - lapack_complex_double* arf ); - -lapack_int LAPACKE_stpttr_work( int matrix_order, char uplo, lapack_int n, - const float* ap, float* a, lapack_int lda ); -lapack_int LAPACKE_dtpttr_work( int matrix_order, char uplo, lapack_int n, - const double* ap, double* a, lapack_int lda ); -lapack_int LAPACKE_ctpttr_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_ztpttr_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_strcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, const float* a, - lapack_int lda, float* rcond, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dtrcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, const double* a, - lapack_int lda, double* rcond, double* work, - lapack_int* iwork ); -lapack_int LAPACKE_ctrcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - float* rcond, lapack_complex_float* work, - float* rwork ); -lapack_int LAPACKE_ztrcon_work( int matrix_order, char norm, char uplo, - char diag, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - double* rcond, lapack_complex_double* work, - double* rwork ); - -lapack_int LAPACKE_strevc_work( int matrix_order, char side, char howmny, - lapack_logical* select, lapack_int n, - const float* t, lapack_int ldt, float* vl, - lapack_int ldvl, float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, float* work ); -lapack_int LAPACKE_dtrevc_work( int matrix_order, char side, char howmny, - lapack_logical* select, lapack_int n, - const double* t, lapack_int ldt, double* vl, - lapack_int ldvl, double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, double* work ); -lapack_int LAPACKE_ctrevc_work( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* vl, lapack_int ldvl, - lapack_complex_float* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_ztrevc_work( int matrix_order, char side, char howmny, - const lapack_logical* select, lapack_int n, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* vl, lapack_int ldvl, - lapack_complex_double* vr, lapack_int ldvr, - lapack_int mm, lapack_int* m, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_strexc_work( int matrix_order, char compq, lapack_int n, - float* t, lapack_int ldt, float* q, - lapack_int ldq, lapack_int* ifst, - lapack_int* ilst, float* work ); -lapack_int LAPACKE_dtrexc_work( int matrix_order, char compq, lapack_int n, - double* t, lapack_int ldt, double* q, - lapack_int ldq, lapack_int* ifst, - lapack_int* ilst, double* work ); -lapack_int LAPACKE_ctrexc_work( int matrix_order, char compq, lapack_int n, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* q, lapack_int ldq, - lapack_int ifst, lapack_int ilst ); -lapack_int LAPACKE_ztrexc_work( int matrix_order, char compq, lapack_int n, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* q, lapack_int ldq, - lapack_int ifst, lapack_int ilst ); - -lapack_int LAPACKE_strrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const float* a, lapack_int lda, const float* b, - lapack_int ldb, const float* x, lapack_int ldx, - float* ferr, float* berr, float* work, - lapack_int* iwork ); -lapack_int LAPACKE_dtrrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const double* a, lapack_int lda, - const double* b, lapack_int ldb, - const double* x, lapack_int ldx, double* ferr, - double* berr, double* work, lapack_int* iwork ); -lapack_int LAPACKE_ctrrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - const lapack_complex_float* x, lapack_int ldx, - float* ferr, float* berr, - lapack_complex_float* work, float* rwork ); -lapack_int LAPACKE_ztrrfs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - const lapack_complex_double* x, lapack_int ldx, - double* ferr, double* berr, - lapack_complex_double* work, double* rwork ); - -lapack_int LAPACKE_strsen_work( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - float* t, lapack_int ldt, float* q, - lapack_int ldq, float* wr, float* wi, - lapack_int* m, float* s, float* sep, - float* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_dtrsen_work( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - double* t, lapack_int ldt, double* q, - lapack_int ldq, double* wr, double* wi, - lapack_int* m, double* s, double* sep, - double* work, lapack_int lwork, - lapack_int* iwork, lapack_int liwork ); -lapack_int LAPACKE_ctrsen_work( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* w, lapack_int* m, - float* s, float* sep, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_ztrsen_work( int matrix_order, char job, char compq, - const lapack_logical* select, lapack_int n, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* w, lapack_int* m, - double* s, double* sep, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_strsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const float* t, lapack_int ldt, const float* vl, - lapack_int ldvl, const float* vr, - lapack_int ldvr, float* s, float* sep, - lapack_int mm, lapack_int* m, float* work, - lapack_int ldwork, lapack_int* iwork ); -lapack_int LAPACKE_dtrsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const double* t, lapack_int ldt, - const double* vl, lapack_int ldvl, - const double* vr, lapack_int ldvr, double* s, - double* sep, lapack_int mm, lapack_int* m, - double* work, lapack_int ldwork, - lapack_int* iwork ); -lapack_int LAPACKE_ctrsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_float* t, lapack_int ldt, - const lapack_complex_float* vl, lapack_int ldvl, - const lapack_complex_float* vr, lapack_int ldvr, - float* s, float* sep, lapack_int mm, - lapack_int* m, lapack_complex_float* work, - lapack_int ldwork, float* rwork ); -lapack_int LAPACKE_ztrsna_work( int matrix_order, char job, char howmny, - const lapack_logical* select, lapack_int n, - const lapack_complex_double* t, lapack_int ldt, - const lapack_complex_double* vl, - lapack_int ldvl, - const lapack_complex_double* vr, - lapack_int ldvr, double* s, double* sep, - lapack_int mm, lapack_int* m, - lapack_complex_double* work, lapack_int ldwork, - double* rwork ); - -lapack_int LAPACKE_strsyl_work( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const float* a, lapack_int lda, const float* b, - lapack_int ldb, float* c, lapack_int ldc, - float* scale ); -lapack_int LAPACKE_dtrsyl_work( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const double* a, lapack_int lda, - const double* b, lapack_int ldb, double* c, - lapack_int ldc, double* scale ); -lapack_int LAPACKE_ctrsyl_work( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* c, lapack_int ldc, - float* scale ); -lapack_int LAPACKE_ztrsyl_work( int matrix_order, char trana, char tranb, - lapack_int isgn, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* c, lapack_int ldc, - double* scale ); - -lapack_int LAPACKE_strtri_work( int matrix_order, char uplo, char diag, - lapack_int n, float* a, lapack_int lda ); -lapack_int LAPACKE_dtrtri_work( int matrix_order, char uplo, char diag, - lapack_int n, double* a, lapack_int lda ); -lapack_int LAPACKE_ctrtri_work( int matrix_order, char uplo, char diag, - lapack_int n, lapack_complex_float* a, - lapack_int lda ); -lapack_int LAPACKE_ztrtri_work( int matrix_order, char uplo, char diag, - lapack_int n, lapack_complex_double* a, - lapack_int lda ); - -lapack_int LAPACKE_strtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const float* a, lapack_int lda, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dtrtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const double* a, lapack_int lda, double* b, - lapack_int ldb ); -lapack_int LAPACKE_ctrtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztrtrs_work( int matrix_order, char uplo, char trans, - char diag, lapack_int n, lapack_int nrhs, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_strttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const float* a, lapack_int lda, - float* arf ); -lapack_int LAPACKE_dtrttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const double* a, lapack_int lda, - double* arf ); -lapack_int LAPACKE_ctrttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_float* a, - lapack_int lda, lapack_complex_float* arf ); -lapack_int LAPACKE_ztrttf_work( int matrix_order, char transr, char uplo, - lapack_int n, const lapack_complex_double* a, - lapack_int lda, lapack_complex_double* arf ); - -lapack_int LAPACKE_strttp_work( int matrix_order, char uplo, lapack_int n, - const float* a, lapack_int lda, float* ap ); -lapack_int LAPACKE_dtrttp_work( int matrix_order, char uplo, lapack_int n, - const double* a, lapack_int lda, double* ap ); -lapack_int LAPACKE_ctrttp_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - lapack_complex_float* ap ); -lapack_int LAPACKE_ztrttp_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - lapack_complex_double* ap ); - -lapack_int LAPACKE_stzrzf_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* tau, - float* work, lapack_int lwork ); -lapack_int LAPACKE_dtzrzf_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* tau, - double* work, lapack_int lwork ); -lapack_int LAPACKE_ctzrzf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_ztzrzf_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cungbr_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, - lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zungbr_work( int matrix_order, char vect, lapack_int m, - lapack_int n, lapack_int k, - lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunghr_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunghr_work( int matrix_order, lapack_int n, lapack_int ilo, - lapack_int ihi, lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunglq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunglq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cungql_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zungql_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cungqr_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zungqr_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cungrq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zungrq_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int k, lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cungtr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zungtr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmbr_work( int matrix_order, char vect, char side, - char trans, lapack_int m, lapack_int n, - lapack_int k, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmbr_work( int matrix_order, char vect, char side, - char trans, lapack_int m, lapack_int n, - lapack_int k, const lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmhr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmhr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int ilo, - lapack_int ihi, const lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmlq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmlq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmql_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmql_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmqr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmqr_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmrq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmrq_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmrz_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const lapack_complex_float* a, - lapack_int lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmrz_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, const lapack_complex_double* a, - lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cunmtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const lapack_complex_float* a, lapack_int lda, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_zunmtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const lapack_complex_double* a, lapack_int lda, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work, lapack_int lwork ); - -lapack_int LAPACKE_cupgtr_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_float* ap, - const lapack_complex_float* tau, - lapack_complex_float* q, lapack_int ldq, - lapack_complex_float* work ); -lapack_int LAPACKE_zupgtr_work( int matrix_order, char uplo, lapack_int n, - const lapack_complex_double* ap, - const lapack_complex_double* tau, - lapack_complex_double* q, lapack_int ldq, - lapack_complex_double* work ); - -lapack_int LAPACKE_cupmtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const lapack_complex_float* ap, - const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int ldc, - lapack_complex_float* work ); -lapack_int LAPACKE_zupmtr_work( int matrix_order, char side, char uplo, - char trans, lapack_int m, lapack_int n, - const lapack_complex_double* ap, - const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int ldc, - lapack_complex_double* work ); - -lapack_int LAPACKE_claghe( int matrix_order, lapack_int n, lapack_int k, - const float* d, lapack_complex_float* a, - lapack_int lda, lapack_int* iseed ); -lapack_int LAPACKE_zlaghe( int matrix_order, lapack_int n, lapack_int k, - const double* d, lapack_complex_double* a, - lapack_int lda, lapack_int* iseed ); - -lapack_int LAPACKE_slagsy( int matrix_order, lapack_int n, lapack_int k, - const float* d, float* a, lapack_int lda, - lapack_int* iseed ); -lapack_int LAPACKE_dlagsy( int matrix_order, lapack_int n, lapack_int k, - const double* d, double* a, lapack_int lda, - lapack_int* iseed ); -lapack_int LAPACKE_clagsy( int matrix_order, lapack_int n, lapack_int k, - const float* d, lapack_complex_float* a, - lapack_int lda, lapack_int* iseed ); -lapack_int LAPACKE_zlagsy( int matrix_order, lapack_int n, lapack_int k, - const double* d, lapack_complex_double* a, - lapack_int lda, lapack_int* iseed ); - -lapack_int LAPACKE_slapmr( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, float* x, lapack_int ldx, - lapack_int* k ); -lapack_int LAPACKE_dlapmr( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, double* x, - lapack_int ldx, lapack_int* k ); -lapack_int LAPACKE_clapmr( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, lapack_complex_float* x, - lapack_int ldx, lapack_int* k ); -lapack_int LAPACKE_zlapmr( int matrix_order, lapack_logical forwrd, - lapack_int m, lapack_int n, lapack_complex_double* x, - lapack_int ldx, lapack_int* k ); - - -float LAPACKE_slapy2( float x, float y ); -double LAPACKE_dlapy2( double x, double y ); - -float LAPACKE_slapy3( float x, float y, float z ); -double LAPACKE_dlapy3( double x, double y, double z ); - -lapack_int LAPACKE_slartgp( float f, float g, float* cs, float* sn, float* r ); -lapack_int LAPACKE_dlartgp( double f, double g, double* cs, double* sn, - double* r ); - -lapack_int LAPACKE_slartgs( float x, float y, float sigma, float* cs, - float* sn ); -lapack_int LAPACKE_dlartgs( double x, double y, double sigma, double* cs, - double* sn ); - - -//LAPACK 3.3.0 -lapack_int LAPACKE_cbbcsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, lapack_int m, - lapack_int p, lapack_int q, float* theta, float* phi, - lapack_complex_float* u1, lapack_int ldu1, - lapack_complex_float* u2, lapack_int ldu2, - lapack_complex_float* v1t, lapack_int ldv1t, - lapack_complex_float* v2t, lapack_int ldv2t, - float* b11d, float* b11e, float* b12d, float* b12e, - float* b21d, float* b21e, float* b22d, float* b22e ); -lapack_int LAPACKE_cbbcsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - lapack_int m, lapack_int p, lapack_int q, - float* theta, float* phi, - lapack_complex_float* u1, lapack_int ldu1, - lapack_complex_float* u2, lapack_int ldu2, - lapack_complex_float* v1t, lapack_int ldv1t, - lapack_complex_float* v2t, lapack_int ldv2t, - float* b11d, float* b11e, float* b12d, - float* b12e, float* b21d, float* b21e, - float* b22d, float* b22e, float* rwork, - lapack_int lrwork ); -lapack_int LAPACKE_cheswapr( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_cheswapr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_chetri2( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_chetri2_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_chetri2x( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, lapack_int nb ); -lapack_int LAPACKE_chetri2x_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int nb ); -lapack_int LAPACKE_chetrs2( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_chetrs2_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* work ); -lapack_int LAPACKE_csyconv( int matrix_order, char uplo, char way, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_csyconv_work( int matrix_order, char uplo, char way, - lapack_int n, lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* work ); -lapack_int LAPACKE_csyswapr( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_csyswapr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_csytri2( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_csytri2_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_csytri2x( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, lapack_int nb ); -lapack_int LAPACKE_csytri2x_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int nb ); -lapack_int LAPACKE_csytrs2( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_csytrs2_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_float* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* work ); -lapack_int LAPACKE_cunbdb( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - lapack_complex_float* x11, lapack_int ldx11, - lapack_complex_float* x12, lapack_int ldx12, - lapack_complex_float* x21, lapack_int ldx21, - lapack_complex_float* x22, lapack_int ldx22, - float* theta, float* phi, - lapack_complex_float* taup1, - lapack_complex_float* taup2, - lapack_complex_float* tauq1, - lapack_complex_float* tauq2 ); -lapack_int LAPACKE_cunbdb_work( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - lapack_complex_float* x11, lapack_int ldx11, - lapack_complex_float* x12, lapack_int ldx12, - lapack_complex_float* x21, lapack_int ldx21, - lapack_complex_float* x22, lapack_int ldx22, - float* theta, float* phi, - lapack_complex_float* taup1, - lapack_complex_float* taup2, - lapack_complex_float* tauq1, - lapack_complex_float* tauq2, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_cuncsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - lapack_complex_float* x11, lapack_int ldx11, - lapack_complex_float* x12, lapack_int ldx12, - lapack_complex_float* x21, lapack_int ldx21, - lapack_complex_float* x22, lapack_int ldx22, - float* theta, lapack_complex_float* u1, - lapack_int ldu1, lapack_complex_float* u2, - lapack_int ldu2, lapack_complex_float* v1t, - lapack_int ldv1t, lapack_complex_float* v2t, - lapack_int ldv2t ); -lapack_int LAPACKE_cuncsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - char signs, lapack_int m, lapack_int p, - lapack_int q, lapack_complex_float* x11, - lapack_int ldx11, lapack_complex_float* x12, - lapack_int ldx12, lapack_complex_float* x21, - lapack_int ldx21, lapack_complex_float* x22, - lapack_int ldx22, float* theta, - lapack_complex_float* u1, lapack_int ldu1, - lapack_complex_float* u2, lapack_int ldu2, - lapack_complex_float* v1t, lapack_int ldv1t, - lapack_complex_float* v2t, lapack_int ldv2t, - lapack_complex_float* work, lapack_int lwork, - float* rwork, lapack_int lrwork, - lapack_int* iwork ); -lapack_int LAPACKE_dbbcsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, lapack_int m, - lapack_int p, lapack_int q, double* theta, - double* phi, double* u1, lapack_int ldu1, double* u2, - lapack_int ldu2, double* v1t, lapack_int ldv1t, - double* v2t, lapack_int ldv2t, double* b11d, - double* b11e, double* b12d, double* b12e, - double* b21d, double* b21e, double* b22d, - double* b22e ); -lapack_int LAPACKE_dbbcsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - lapack_int m, lapack_int p, lapack_int q, - double* theta, double* phi, double* u1, - lapack_int ldu1, double* u2, lapack_int ldu2, - double* v1t, lapack_int ldv1t, double* v2t, - lapack_int ldv2t, double* b11d, double* b11e, - double* b12d, double* b12e, double* b21d, - double* b21e, double* b22d, double* b22e, - double* work, lapack_int lwork ); -lapack_int LAPACKE_dorbdb( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - double* x11, lapack_int ldx11, double* x12, - lapack_int ldx12, double* x21, lapack_int ldx21, - double* x22, lapack_int ldx22, double* theta, - double* phi, double* taup1, double* taup2, - double* tauq1, double* tauq2 ); -lapack_int LAPACKE_dorbdb_work( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - double* x11, lapack_int ldx11, double* x12, - lapack_int ldx12, double* x21, lapack_int ldx21, - double* x22, lapack_int ldx22, double* theta, - double* phi, double* taup1, double* taup2, - double* tauq1, double* tauq2, double* work, - lapack_int lwork ); -lapack_int LAPACKE_dorcsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - double* x11, lapack_int ldx11, double* x12, - lapack_int ldx12, double* x21, lapack_int ldx21, - double* x22, lapack_int ldx22, double* theta, - double* u1, lapack_int ldu1, double* u2, - lapack_int ldu2, double* v1t, lapack_int ldv1t, - double* v2t, lapack_int ldv2t ); -lapack_int LAPACKE_dorcsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - char signs, lapack_int m, lapack_int p, - lapack_int q, double* x11, lapack_int ldx11, - double* x12, lapack_int ldx12, double* x21, - lapack_int ldx21, double* x22, lapack_int ldx22, - double* theta, double* u1, lapack_int ldu1, - double* u2, lapack_int ldu2, double* v1t, - lapack_int ldv1t, double* v2t, lapack_int ldv2t, - double* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_dsyconv( int matrix_order, char uplo, char way, lapack_int n, - double* a, lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_dsyconv_work( int matrix_order, char uplo, char way, - lapack_int n, double* a, lapack_int lda, - const lapack_int* ipiv, double* work ); -lapack_int LAPACKE_dsyswapr( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int i1, lapack_int i2 ); -lapack_int LAPACKE_dsyswapr_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int i1, lapack_int i2 ); -lapack_int LAPACKE_dsytri2( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_dsytri2_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int lwork ); -lapack_int LAPACKE_dsytri2x( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, const lapack_int* ipiv, - lapack_int nb ); -lapack_int LAPACKE_dsytri2x_work( int matrix_order, char uplo, lapack_int n, - double* a, lapack_int lda, - const lapack_int* ipiv, double* work, - lapack_int nb ); -lapack_int LAPACKE_dsytrs2( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, lapack_int lda, - const lapack_int* ipiv, double* b, lapack_int ldb ); -lapack_int LAPACKE_dsytrs2_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const double* a, - lapack_int lda, const lapack_int* ipiv, - double* b, lapack_int ldb, double* work ); -lapack_int LAPACKE_sbbcsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, lapack_int m, - lapack_int p, lapack_int q, float* theta, float* phi, - float* u1, lapack_int ldu1, float* u2, - lapack_int ldu2, float* v1t, lapack_int ldv1t, - float* v2t, lapack_int ldv2t, float* b11d, - float* b11e, float* b12d, float* b12e, float* b21d, - float* b21e, float* b22d, float* b22e ); -lapack_int LAPACKE_sbbcsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - lapack_int m, lapack_int p, lapack_int q, - float* theta, float* phi, float* u1, - lapack_int ldu1, float* u2, lapack_int ldu2, - float* v1t, lapack_int ldv1t, float* v2t, - lapack_int ldv2t, float* b11d, float* b11e, - float* b12d, float* b12e, float* b21d, - float* b21e, float* b22d, float* b22e, - float* work, lapack_int lwork ); -lapack_int LAPACKE_sorbdb( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, float* x11, - lapack_int ldx11, float* x12, lapack_int ldx12, - float* x21, lapack_int ldx21, float* x22, - lapack_int ldx22, float* theta, float* phi, - float* taup1, float* taup2, float* tauq1, - float* tauq2 ); -lapack_int LAPACKE_sorbdb_work( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - float* x11, lapack_int ldx11, float* x12, - lapack_int ldx12, float* x21, lapack_int ldx21, - float* x22, lapack_int ldx22, float* theta, - float* phi, float* taup1, float* taup2, - float* tauq1, float* tauq2, float* work, - lapack_int lwork ); -lapack_int LAPACKE_sorcsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, float* x11, - lapack_int ldx11, float* x12, lapack_int ldx12, - float* x21, lapack_int ldx21, float* x22, - lapack_int ldx22, float* theta, float* u1, - lapack_int ldu1, float* u2, lapack_int ldu2, - float* v1t, lapack_int ldv1t, float* v2t, - lapack_int ldv2t ); -lapack_int LAPACKE_sorcsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - char signs, lapack_int m, lapack_int p, - lapack_int q, float* x11, lapack_int ldx11, - float* x12, lapack_int ldx12, float* x21, - lapack_int ldx21, float* x22, lapack_int ldx22, - float* theta, float* u1, lapack_int ldu1, - float* u2, lapack_int ldu2, float* v1t, - lapack_int ldv1t, float* v2t, lapack_int ldv2t, - float* work, lapack_int lwork, - lapack_int* iwork ); -lapack_int LAPACKE_ssyconv( int matrix_order, char uplo, char way, lapack_int n, - float* a, lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_ssyconv_work( int matrix_order, char uplo, char way, - lapack_int n, float* a, lapack_int lda, - const lapack_int* ipiv, float* work ); -lapack_int LAPACKE_ssyswapr( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int i1, lapack_int i2 ); -lapack_int LAPACKE_ssyswapr_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int i1, lapack_int i2 ); -lapack_int LAPACKE_ssytri2( int matrix_order, char uplo, lapack_int n, float* a, - lapack_int lda, const lapack_int* ipiv ); -lapack_int LAPACKE_ssytri2_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int lwork ); -lapack_int LAPACKE_ssytri2x( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, const lapack_int* ipiv, - lapack_int nb ); -lapack_int LAPACKE_ssytri2x_work( int matrix_order, char uplo, lapack_int n, - float* a, lapack_int lda, - const lapack_int* ipiv, float* work, - lapack_int nb ); -lapack_int LAPACKE_ssytrs2( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, lapack_int lda, - const lapack_int* ipiv, float* b, lapack_int ldb ); -lapack_int LAPACKE_ssytrs2_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const float* a, - lapack_int lda, const lapack_int* ipiv, - float* b, lapack_int ldb, float* work ); -lapack_int LAPACKE_zbbcsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, lapack_int m, - lapack_int p, lapack_int q, double* theta, - double* phi, lapack_complex_double* u1, - lapack_int ldu1, lapack_complex_double* u2, - lapack_int ldu2, lapack_complex_double* v1t, - lapack_int ldv1t, lapack_complex_double* v2t, - lapack_int ldv2t, double* b11d, double* b11e, - double* b12d, double* b12e, double* b21d, - double* b21e, double* b22d, double* b22e ); -lapack_int LAPACKE_zbbcsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - lapack_int m, lapack_int p, lapack_int q, - double* theta, double* phi, - lapack_complex_double* u1, lapack_int ldu1, - lapack_complex_double* u2, lapack_int ldu2, - lapack_complex_double* v1t, lapack_int ldv1t, - lapack_complex_double* v2t, lapack_int ldv2t, - double* b11d, double* b11e, double* b12d, - double* b12e, double* b21d, double* b21e, - double* b22d, double* b22e, double* rwork, - lapack_int lrwork ); -lapack_int LAPACKE_zheswapr( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_zheswapr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_zhetri2( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_zhetri2_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int lwork ); -lapack_int LAPACKE_zhetri2x( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, lapack_int nb ); -lapack_int LAPACKE_zhetri2x_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int nb ); -lapack_int LAPACKE_zhetrs2( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); -lapack_int LAPACKE_zhetrs2_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* work ); -lapack_int LAPACKE_zsyconv( int matrix_order, char uplo, char way, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_zsyconv_work( int matrix_order, char uplo, char way, - lapack_int n, lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* work ); -lapack_int LAPACKE_zsyswapr( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_zsyswapr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int i1, - lapack_int i2 ); -lapack_int LAPACKE_zsytri2( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv ); -lapack_int LAPACKE_zsytri2_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int lwork ); -lapack_int LAPACKE_zsytri2x( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, lapack_int nb ); -lapack_int LAPACKE_zsytri2x_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double* a, lapack_int lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int nb ); -lapack_int LAPACKE_zsytrs2( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb ); -lapack_int LAPACKE_zsytrs2_work( int matrix_order, char uplo, lapack_int n, - lapack_int nrhs, const lapack_complex_double* a, - lapack_int lda, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* work ); -lapack_int LAPACKE_zunbdb( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - lapack_complex_double* x11, lapack_int ldx11, - lapack_complex_double* x12, lapack_int ldx12, - lapack_complex_double* x21, lapack_int ldx21, - lapack_complex_double* x22, lapack_int ldx22, - double* theta, double* phi, - lapack_complex_double* taup1, - lapack_complex_double* taup2, - lapack_complex_double* tauq1, - lapack_complex_double* tauq2 ); -lapack_int LAPACKE_zunbdb_work( int matrix_order, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - lapack_complex_double* x11, lapack_int ldx11, - lapack_complex_double* x12, lapack_int ldx12, - lapack_complex_double* x21, lapack_int ldx21, - lapack_complex_double* x22, lapack_int ldx22, - double* theta, double* phi, - lapack_complex_double* taup1, - lapack_complex_double* taup2, - lapack_complex_double* tauq1, - lapack_complex_double* tauq2, - lapack_complex_double* work, lapack_int lwork ); -lapack_int LAPACKE_zuncsd( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, char signs, - lapack_int m, lapack_int p, lapack_int q, - lapack_complex_double* x11, lapack_int ldx11, - lapack_complex_double* x12, lapack_int ldx12, - lapack_complex_double* x21, lapack_int ldx21, - lapack_complex_double* x22, lapack_int ldx22, - double* theta, lapack_complex_double* u1, - lapack_int ldu1, lapack_complex_double* u2, - lapack_int ldu2, lapack_complex_double* v1t, - lapack_int ldv1t, lapack_complex_double* v2t, - lapack_int ldv2t ); -lapack_int LAPACKE_zuncsd_work( int matrix_order, char jobu1, char jobu2, - char jobv1t, char jobv2t, char trans, - char signs, lapack_int m, lapack_int p, - lapack_int q, lapack_complex_double* x11, - lapack_int ldx11, lapack_complex_double* x12, - lapack_int ldx12, lapack_complex_double* x21, - lapack_int ldx21, lapack_complex_double* x22, - lapack_int ldx22, double* theta, - lapack_complex_double* u1, lapack_int ldu1, - lapack_complex_double* u2, lapack_int ldu2, - lapack_complex_double* v1t, lapack_int ldv1t, - lapack_complex_double* v2t, lapack_int ldv2t, - lapack_complex_double* work, lapack_int lwork, - double* rwork, lapack_int lrwork, - lapack_int* iwork ); -//LAPACK 3.4.0 -lapack_int LAPACKE_sgemqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const float* v, lapack_int ldv, - const float* t, lapack_int ldt, float* c, - lapack_int ldc ); -lapack_int LAPACKE_dgemqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const double* v, lapack_int ldv, - const double* t, lapack_int ldt, double* c, - lapack_int ldc ); -lapack_int LAPACKE_cgemqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const lapack_complex_float* v, - lapack_int ldv, const lapack_complex_float* t, - lapack_int ldt, lapack_complex_float* c, - lapack_int ldc ); -lapack_int LAPACKE_zgemqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const lapack_complex_double* v, - lapack_int ldv, const lapack_complex_double* t, - lapack_int ldt, lapack_complex_double* c, - lapack_int ldc ); - -lapack_int LAPACKE_sgeqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, float* a, lapack_int lda, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dgeqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, double* a, lapack_int lda, double* t, - lapack_int ldt ); -lapack_int LAPACKE_cgeqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* t, - lapack_int ldt ); -lapack_int LAPACKE_zgeqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* t, - lapack_int ldt ); - -lapack_int LAPACKE_sgeqrt2( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dgeqrt2( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* t, - lapack_int ldt ); -lapack_int LAPACKE_cgeqrt2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_zgeqrt2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_sgeqrt3( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dgeqrt3( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* t, - lapack_int ldt ); -lapack_int LAPACKE_cgeqrt3( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_zgeqrt3( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_stpmqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, const float* v, - lapack_int ldv, const float* t, lapack_int ldt, - float* a, lapack_int lda, float* b, - lapack_int ldb ); -lapack_int LAPACKE_dtpmqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, const double* v, - lapack_int ldv, const double* t, lapack_int ldt, - double* a, lapack_int lda, double* b, - lapack_int ldb ); -lapack_int LAPACKE_ctpmqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb ); -lapack_int LAPACKE_ztpmqrt( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb ); - -lapack_int LAPACKE_dtpqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int l, lapack_int nb, double* a, - lapack_int lda, double* b, lapack_int ldb, double* t, - lapack_int ldt ); -lapack_int LAPACKE_ctpqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int l, lapack_int nb, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* t, - lapack_complex_float* b, lapack_int ldb, - lapack_int ldt ); -lapack_int LAPACKE_ztpqrt( int matrix_order, lapack_int m, lapack_int n, - lapack_int l, lapack_int nb, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_stpqrt2( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* b, lapack_int ldb, - float* t, lapack_int ldt ); -lapack_int LAPACKE_dtpqrt2( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* b, - lapack_int ldb, double* t, lapack_int ldt ); -lapack_int LAPACKE_ctpqrt2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_ztpqrt2( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_stprfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, lapack_int l, const float* v, - lapack_int ldv, const float* t, lapack_int ldt, - float* a, lapack_int lda, float* b, lapack_int ldb, - lapack_int myldwork ); -lapack_int LAPACKE_dtprfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, lapack_int l, const double* v, - lapack_int ldv, const double* t, lapack_int ldt, - double* a, lapack_int lda, double* b, lapack_int ldb, - lapack_int myldwork ); -lapack_int LAPACKE_ctprfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, lapack_int l, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_int myldwork ); -lapack_int LAPACKE_ztprfb( int matrix_order, char side, char trans, char direct, - char storev, lapack_int m, lapack_int n, - lapack_int k, lapack_int l, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_int myldwork ); - -lapack_int LAPACKE_sgemqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const float* v, lapack_int ldv, - const float* t, lapack_int ldt, float* c, - lapack_int ldc, float* work ); -lapack_int LAPACKE_dgemqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const double* v, lapack_int ldv, - const double* t, lapack_int ldt, double* c, - lapack_int ldc, double* work ); -lapack_int LAPACKE_cgemqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const lapack_complex_float* v, - lapack_int ldv, const lapack_complex_float* t, - lapack_int ldt, lapack_complex_float* c, - lapack_int ldc, lapack_complex_float* work ); -lapack_int LAPACKE_zgemqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int nb, const lapack_complex_double* v, - lapack_int ldv, const lapack_complex_double* t, - lapack_int ldt, lapack_complex_double* c, - lapack_int ldc, lapack_complex_double* work ); - -lapack_int LAPACKE_sgeqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, float* a, lapack_int lda, - float* t, lapack_int ldt, float* work ); -lapack_int LAPACKE_dgeqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, double* a, lapack_int lda, - double* t, lapack_int ldt, double* work ); -lapack_int LAPACKE_cgeqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, lapack_complex_float* a, - lapack_int lda, lapack_complex_float* t, - lapack_int ldt, lapack_complex_float* work ); -lapack_int LAPACKE_zgeqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int nb, lapack_complex_double* a, - lapack_int lda, lapack_complex_double* t, - lapack_int ldt, lapack_complex_double* work ); - -lapack_int LAPACKE_sgeqrt2_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dgeqrt2_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* t, - lapack_int ldt ); -lapack_int LAPACKE_cgeqrt2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_zgeqrt2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_sgeqrt3_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* t, - lapack_int ldt ); -lapack_int LAPACKE_dgeqrt3_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* t, - lapack_int ldt ); -lapack_int LAPACKE_cgeqrt3_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_zgeqrt3_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_stpmqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, const float* v, - lapack_int ldv, const float* t, lapack_int ldt, - float* a, lapack_int lda, float* b, - lapack_int ldb, float* work ); -lapack_int LAPACKE_dtpmqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, const double* v, - lapack_int ldv, const double* t, - lapack_int ldt, double* a, lapack_int lda, - double* b, lapack_int ldb, double* work ); -lapack_int LAPACKE_ctpmqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* work ); -lapack_int LAPACKE_ztpmqrt_work( int matrix_order, char side, char trans, - lapack_int m, lapack_int n, lapack_int k, - lapack_int l, lapack_int nb, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* work ); - -lapack_int LAPACKE_dtpqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int l, lapack_int nb, double* a, - lapack_int lda, double* b, lapack_int ldb, - double* t, lapack_int ldt, double* work ); -lapack_int LAPACKE_ctpqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int l, lapack_int nb, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* t, - lapack_complex_float* b, lapack_int ldb, - lapack_int ldt, lapack_complex_float* work ); -lapack_int LAPACKE_ztpqrt_work( int matrix_order, lapack_int m, lapack_int n, - lapack_int l, lapack_int nb, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* work ); - -lapack_int LAPACKE_stpqrt2_work( int matrix_order, lapack_int m, lapack_int n, - float* a, lapack_int lda, float* b, - lapack_int ldb, float* t, lapack_int ldt ); -lapack_int LAPACKE_dtpqrt2_work( int matrix_order, lapack_int m, lapack_int n, - double* a, lapack_int lda, double* b, - lapack_int ldb, double* t, lapack_int ldt ); -lapack_int LAPACKE_ctpqrt2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - lapack_complex_float* t, lapack_int ldt ); -lapack_int LAPACKE_ztpqrt2_work( int matrix_order, lapack_int m, lapack_int n, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - lapack_complex_double* t, lapack_int ldt ); - -lapack_int LAPACKE_stprfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, lapack_int l, - const float* v, lapack_int ldv, const float* t, - lapack_int ldt, float* a, lapack_int lda, - float* b, lapack_int ldb, const float* mywork, - lapack_int myldwork ); -lapack_int LAPACKE_dtprfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, lapack_int l, - const double* v, lapack_int ldv, - const double* t, lapack_int ldt, double* a, - lapack_int lda, double* b, lapack_int ldb, - const double* mywork, lapack_int myldwork ); -lapack_int LAPACKE_ctprfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, lapack_int l, - const lapack_complex_float* v, lapack_int ldv, - const lapack_complex_float* t, lapack_int ldt, - lapack_complex_float* a, lapack_int lda, - lapack_complex_float* b, lapack_int ldb, - const float* mywork, lapack_int myldwork ); -lapack_int LAPACKE_ztprfb_work( int matrix_order, char side, char trans, - char direct, char storev, lapack_int m, - lapack_int n, lapack_int k, lapack_int l, - const lapack_complex_double* v, lapack_int ldv, - const lapack_complex_double* t, lapack_int ldt, - lapack_complex_double* a, lapack_int lda, - lapack_complex_double* b, lapack_int ldb, - const double* mywork, lapack_int myldwork ); -//LAPACK 3.X.X -lapack_int LAPACKE_csyr( int matrix_order, char uplo, lapack_int n, - lapack_complex_float alpha, - const lapack_complex_float* x, lapack_int incx, - lapack_complex_float* a, lapack_int lda ); -lapack_int LAPACKE_zsyr( int matrix_order, char uplo, lapack_int n, - lapack_complex_double alpha, - const lapack_complex_double* x, lapack_int incx, - lapack_complex_double* a, lapack_int lda ); - -lapack_int LAPACKE_csyr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_float alpha, - const lapack_complex_float* x, - lapack_int incx, lapack_complex_float* a, - lapack_int lda ); -lapack_int LAPACKE_zsyr_work( int matrix_order, char uplo, lapack_int n, - lapack_complex_double alpha, - const lapack_complex_double* x, - lapack_int incx, lapack_complex_double* a, - lapack_int lda ); - - - -#define LAPACK_sgetrf LAPACK_GLOBAL(sgetrf,SGETRF) -#define LAPACK_dgetrf LAPACK_GLOBAL(dgetrf,DGETRF) -#define LAPACK_cgetrf LAPACK_GLOBAL(cgetrf,CGETRF) -#define LAPACK_zgetrf LAPACK_GLOBAL(zgetrf,ZGETRF) -#define LAPACK_sgbtrf LAPACK_GLOBAL(sgbtrf,SGBTRF) -#define LAPACK_dgbtrf LAPACK_GLOBAL(dgbtrf,DGBTRF) -#define LAPACK_cgbtrf LAPACK_GLOBAL(cgbtrf,CGBTRF) -#define LAPACK_zgbtrf LAPACK_GLOBAL(zgbtrf,ZGBTRF) -#define LAPACK_sgttrf LAPACK_GLOBAL(sgttrf,SGTTRF) -#define LAPACK_dgttrf LAPACK_GLOBAL(dgttrf,DGTTRF) -#define LAPACK_cgttrf LAPACK_GLOBAL(cgttrf,CGTTRF) -#define LAPACK_zgttrf LAPACK_GLOBAL(zgttrf,ZGTTRF) -#define LAPACK_spotrf LAPACK_GLOBAL(spotrf,SPOTRF) -#define LAPACK_dpotrf LAPACK_GLOBAL(dpotrf,DPOTRF) -#define LAPACK_cpotrf LAPACK_GLOBAL(cpotrf,CPOTRF) -#define LAPACK_zpotrf LAPACK_GLOBAL(zpotrf,ZPOTRF) -#define LAPACK_dpstrf LAPACK_GLOBAL(dpstrf,DPSTRF) -#define LAPACK_spstrf LAPACK_GLOBAL(spstrf,SPSTRF) -#define LAPACK_zpstrf LAPACK_GLOBAL(zpstrf,ZPSTRF) -#define LAPACK_cpstrf LAPACK_GLOBAL(cpstrf,CPSTRF) -#define LAPACK_dpftrf LAPACK_GLOBAL(dpftrf,DPFTRF) -#define LAPACK_spftrf LAPACK_GLOBAL(spftrf,SPFTRF) -#define LAPACK_zpftrf LAPACK_GLOBAL(zpftrf,ZPFTRF) -#define LAPACK_cpftrf LAPACK_GLOBAL(cpftrf,CPFTRF) -#define LAPACK_spptrf LAPACK_GLOBAL(spptrf,SPPTRF) -#define LAPACK_dpptrf LAPACK_GLOBAL(dpptrf,DPPTRF) -#define LAPACK_cpptrf LAPACK_GLOBAL(cpptrf,CPPTRF) -#define LAPACK_zpptrf LAPACK_GLOBAL(zpptrf,ZPPTRF) -#define LAPACK_spbtrf LAPACK_GLOBAL(spbtrf,SPBTRF) -#define LAPACK_dpbtrf LAPACK_GLOBAL(dpbtrf,DPBTRF) -#define LAPACK_cpbtrf LAPACK_GLOBAL(cpbtrf,CPBTRF) -#define LAPACK_zpbtrf LAPACK_GLOBAL(zpbtrf,ZPBTRF) -#define LAPACK_spttrf LAPACK_GLOBAL(spttrf,SPTTRF) -#define LAPACK_dpttrf LAPACK_GLOBAL(dpttrf,DPTTRF) -#define LAPACK_cpttrf LAPACK_GLOBAL(cpttrf,CPTTRF) -#define LAPACK_zpttrf LAPACK_GLOBAL(zpttrf,ZPTTRF) -#define LAPACK_ssytrf LAPACK_GLOBAL(ssytrf,SSYTRF) -#define LAPACK_dsytrf LAPACK_GLOBAL(dsytrf,DSYTRF) -#define LAPACK_csytrf LAPACK_GLOBAL(csytrf,CSYTRF) -#define LAPACK_zsytrf LAPACK_GLOBAL(zsytrf,ZSYTRF) -#define LAPACK_chetrf LAPACK_GLOBAL(chetrf,CHETRF) -#define LAPACK_zhetrf LAPACK_GLOBAL(zhetrf,ZHETRF) -#define LAPACK_ssptrf LAPACK_GLOBAL(ssptrf,SSPTRF) -#define LAPACK_dsptrf LAPACK_GLOBAL(dsptrf,DSPTRF) -#define LAPACK_csptrf LAPACK_GLOBAL(csptrf,CSPTRF) -#define LAPACK_zsptrf LAPACK_GLOBAL(zsptrf,ZSPTRF) -#define LAPACK_chptrf LAPACK_GLOBAL(chptrf,CHPTRF) -#define LAPACK_zhptrf LAPACK_GLOBAL(zhptrf,ZHPTRF) -#define LAPACK_sgetrs LAPACK_GLOBAL(sgetrs,SGETRS) -#define LAPACK_dgetrs LAPACK_GLOBAL(dgetrs,DGETRS) -#define LAPACK_cgetrs LAPACK_GLOBAL(cgetrs,CGETRS) -#define LAPACK_zgetrs LAPACK_GLOBAL(zgetrs,ZGETRS) -#define LAPACK_sgbtrs LAPACK_GLOBAL(sgbtrs,SGBTRS) -#define LAPACK_dgbtrs LAPACK_GLOBAL(dgbtrs,DGBTRS) -#define LAPACK_cgbtrs LAPACK_GLOBAL(cgbtrs,CGBTRS) -#define LAPACK_zgbtrs LAPACK_GLOBAL(zgbtrs,ZGBTRS) -#define LAPACK_sgttrs LAPACK_GLOBAL(sgttrs,SGTTRS) -#define LAPACK_dgttrs LAPACK_GLOBAL(dgttrs,DGTTRS) -#define LAPACK_cgttrs LAPACK_GLOBAL(cgttrs,CGTTRS) -#define LAPACK_zgttrs LAPACK_GLOBAL(zgttrs,ZGTTRS) -#define LAPACK_spotrs LAPACK_GLOBAL(spotrs,SPOTRS) -#define LAPACK_dpotrs LAPACK_GLOBAL(dpotrs,DPOTRS) -#define LAPACK_cpotrs LAPACK_GLOBAL(cpotrs,CPOTRS) -#define LAPACK_zpotrs LAPACK_GLOBAL(zpotrs,ZPOTRS) -#define LAPACK_dpftrs LAPACK_GLOBAL(dpftrs,DPFTRS) -#define LAPACK_spftrs LAPACK_GLOBAL(spftrs,SPFTRS) -#define LAPACK_zpftrs LAPACK_GLOBAL(zpftrs,ZPFTRS) -#define LAPACK_cpftrs LAPACK_GLOBAL(cpftrs,CPFTRS) -#define LAPACK_spptrs LAPACK_GLOBAL(spptrs,SPPTRS) -#define LAPACK_dpptrs LAPACK_GLOBAL(dpptrs,DPPTRS) -#define LAPACK_cpptrs LAPACK_GLOBAL(cpptrs,CPPTRS) -#define LAPACK_zpptrs LAPACK_GLOBAL(zpptrs,ZPPTRS) -#define LAPACK_spbtrs LAPACK_GLOBAL(spbtrs,SPBTRS) -#define LAPACK_dpbtrs LAPACK_GLOBAL(dpbtrs,DPBTRS) -#define LAPACK_cpbtrs LAPACK_GLOBAL(cpbtrs,CPBTRS) -#define LAPACK_zpbtrs LAPACK_GLOBAL(zpbtrs,ZPBTRS) -#define LAPACK_spttrs LAPACK_GLOBAL(spttrs,SPTTRS) -#define LAPACK_dpttrs LAPACK_GLOBAL(dpttrs,DPTTRS) -#define LAPACK_cpttrs LAPACK_GLOBAL(cpttrs,CPTTRS) -#define LAPACK_zpttrs LAPACK_GLOBAL(zpttrs,ZPTTRS) -#define LAPACK_ssytrs LAPACK_GLOBAL(ssytrs,SSYTRS) -#define LAPACK_dsytrs LAPACK_GLOBAL(dsytrs,DSYTRS) -#define LAPACK_csytrs LAPACK_GLOBAL(csytrs,CSYTRS) -#define LAPACK_zsytrs LAPACK_GLOBAL(zsytrs,ZSYTRS) -#define LAPACK_chetrs LAPACK_GLOBAL(chetrs,CHETRS) -#define LAPACK_zhetrs LAPACK_GLOBAL(zhetrs,ZHETRS) -#define LAPACK_ssptrs LAPACK_GLOBAL(ssptrs,SSPTRS) -#define LAPACK_dsptrs LAPACK_GLOBAL(dsptrs,DSPTRS) -#define LAPACK_csptrs LAPACK_GLOBAL(csptrs,CSPTRS) -#define LAPACK_zsptrs LAPACK_GLOBAL(zsptrs,ZSPTRS) -#define LAPACK_chptrs LAPACK_GLOBAL(chptrs,CHPTRS) -#define LAPACK_zhptrs LAPACK_GLOBAL(zhptrs,ZHPTRS) -#define LAPACK_strtrs LAPACK_GLOBAL(strtrs,STRTRS) -#define LAPACK_dtrtrs LAPACK_GLOBAL(dtrtrs,DTRTRS) -#define LAPACK_ctrtrs LAPACK_GLOBAL(ctrtrs,CTRTRS) -#define LAPACK_ztrtrs LAPACK_GLOBAL(ztrtrs,ZTRTRS) -#define LAPACK_stptrs LAPACK_GLOBAL(stptrs,STPTRS) -#define LAPACK_dtptrs LAPACK_GLOBAL(dtptrs,DTPTRS) -#define LAPACK_ctptrs LAPACK_GLOBAL(ctptrs,CTPTRS) -#define LAPACK_ztptrs LAPACK_GLOBAL(ztptrs,ZTPTRS) -#define LAPACK_stbtrs LAPACK_GLOBAL(stbtrs,STBTRS) -#define LAPACK_dtbtrs LAPACK_GLOBAL(dtbtrs,DTBTRS) -#define LAPACK_ctbtrs LAPACK_GLOBAL(ctbtrs,CTBTRS) -#define LAPACK_ztbtrs LAPACK_GLOBAL(ztbtrs,ZTBTRS) -#define LAPACK_sgecon LAPACK_GLOBAL(sgecon,SGECON) -#define LAPACK_dgecon LAPACK_GLOBAL(dgecon,DGECON) -#define LAPACK_cgecon LAPACK_GLOBAL(cgecon,CGECON) -#define LAPACK_zgecon LAPACK_GLOBAL(zgecon,ZGECON) -#define LAPACK_sgbcon LAPACK_GLOBAL(sgbcon,SGBCON) -#define LAPACK_dgbcon LAPACK_GLOBAL(dgbcon,DGBCON) -#define LAPACK_cgbcon LAPACK_GLOBAL(cgbcon,CGBCON) -#define LAPACK_zgbcon LAPACK_GLOBAL(zgbcon,ZGBCON) -#define LAPACK_sgtcon LAPACK_GLOBAL(sgtcon,SGTCON) -#define LAPACK_dgtcon LAPACK_GLOBAL(dgtcon,DGTCON) -#define LAPACK_cgtcon LAPACK_GLOBAL(cgtcon,CGTCON) -#define LAPACK_zgtcon LAPACK_GLOBAL(zgtcon,ZGTCON) -#define LAPACK_spocon LAPACK_GLOBAL(spocon,SPOCON) -#define LAPACK_dpocon LAPACK_GLOBAL(dpocon,DPOCON) -#define LAPACK_cpocon LAPACK_GLOBAL(cpocon,CPOCON) -#define LAPACK_zpocon LAPACK_GLOBAL(zpocon,ZPOCON) -#define LAPACK_sppcon LAPACK_GLOBAL(sppcon,SPPCON) -#define LAPACK_dppcon LAPACK_GLOBAL(dppcon,DPPCON) -#define LAPACK_cppcon LAPACK_GLOBAL(cppcon,CPPCON) -#define LAPACK_zppcon LAPACK_GLOBAL(zppcon,ZPPCON) -#define LAPACK_spbcon LAPACK_GLOBAL(spbcon,SPBCON) -#define LAPACK_dpbcon LAPACK_GLOBAL(dpbcon,DPBCON) -#define LAPACK_cpbcon LAPACK_GLOBAL(cpbcon,CPBCON) -#define LAPACK_zpbcon LAPACK_GLOBAL(zpbcon,ZPBCON) -#define LAPACK_sptcon LAPACK_GLOBAL(sptcon,SPTCON) -#define LAPACK_dptcon LAPACK_GLOBAL(dptcon,DPTCON) -#define LAPACK_cptcon LAPACK_GLOBAL(cptcon,CPTCON) -#define LAPACK_zptcon LAPACK_GLOBAL(zptcon,ZPTCON) -#define LAPACK_ssycon LAPACK_GLOBAL(ssycon,SSYCON) -#define LAPACK_dsycon LAPACK_GLOBAL(dsycon,DSYCON) -#define LAPACK_csycon LAPACK_GLOBAL(csycon,CSYCON) -#define LAPACK_zsycon LAPACK_GLOBAL(zsycon,ZSYCON) -#define LAPACK_checon LAPACK_GLOBAL(checon,CHECON) -#define LAPACK_zhecon LAPACK_GLOBAL(zhecon,ZHECON) -#define LAPACK_sspcon LAPACK_GLOBAL(sspcon,SSPCON) -#define LAPACK_dspcon LAPACK_GLOBAL(dspcon,DSPCON) -#define LAPACK_cspcon LAPACK_GLOBAL(cspcon,CSPCON) -#define LAPACK_zspcon LAPACK_GLOBAL(zspcon,ZSPCON) -#define LAPACK_chpcon LAPACK_GLOBAL(chpcon,CHPCON) -#define LAPACK_zhpcon LAPACK_GLOBAL(zhpcon,ZHPCON) -#define LAPACK_strcon LAPACK_GLOBAL(strcon,STRCON) -#define LAPACK_dtrcon LAPACK_GLOBAL(dtrcon,DTRCON) -#define LAPACK_ctrcon LAPACK_GLOBAL(ctrcon,CTRCON) -#define LAPACK_ztrcon LAPACK_GLOBAL(ztrcon,ZTRCON) -#define LAPACK_stpcon LAPACK_GLOBAL(stpcon,STPCON) -#define LAPACK_dtpcon LAPACK_GLOBAL(dtpcon,DTPCON) -#define LAPACK_ctpcon LAPACK_GLOBAL(ctpcon,CTPCON) -#define LAPACK_ztpcon LAPACK_GLOBAL(ztpcon,ZTPCON) -#define LAPACK_stbcon LAPACK_GLOBAL(stbcon,STBCON) -#define LAPACK_dtbcon LAPACK_GLOBAL(dtbcon,DTBCON) -#define LAPACK_ctbcon LAPACK_GLOBAL(ctbcon,CTBCON) -#define LAPACK_ztbcon LAPACK_GLOBAL(ztbcon,ZTBCON) -#define LAPACK_sgerfs LAPACK_GLOBAL(sgerfs,SGERFS) -#define LAPACK_dgerfs LAPACK_GLOBAL(dgerfs,DGERFS) -#define LAPACK_cgerfs LAPACK_GLOBAL(cgerfs,CGERFS) -#define LAPACK_zgerfs LAPACK_GLOBAL(zgerfs,ZGERFS) -#define LAPACK_dgerfsx LAPACK_GLOBAL(dgerfsx,DGERFSX) -#define LAPACK_sgerfsx LAPACK_GLOBAL(sgerfsx,SGERFSX) -#define LAPACK_zgerfsx LAPACK_GLOBAL(zgerfsx,ZGERFSX) -#define LAPACK_cgerfsx LAPACK_GLOBAL(cgerfsx,CGERFSX) -#define LAPACK_sgbrfs LAPACK_GLOBAL(sgbrfs,SGBRFS) -#define LAPACK_dgbrfs LAPACK_GLOBAL(dgbrfs,DGBRFS) -#define LAPACK_cgbrfs LAPACK_GLOBAL(cgbrfs,CGBRFS) -#define LAPACK_zgbrfs LAPACK_GLOBAL(zgbrfs,ZGBRFS) -#define LAPACK_dgbrfsx LAPACK_GLOBAL(dgbrfsx,DGBRFSX) -#define LAPACK_sgbrfsx LAPACK_GLOBAL(sgbrfsx,SGBRFSX) -#define LAPACK_zgbrfsx LAPACK_GLOBAL(zgbrfsx,ZGBRFSX) -#define LAPACK_cgbrfsx LAPACK_GLOBAL(cgbrfsx,CGBRFSX) -#define LAPACK_sgtrfs LAPACK_GLOBAL(sgtrfs,SGTRFS) -#define LAPACK_dgtrfs LAPACK_GLOBAL(dgtrfs,DGTRFS) -#define LAPACK_cgtrfs LAPACK_GLOBAL(cgtrfs,CGTRFS) -#define LAPACK_zgtrfs LAPACK_GLOBAL(zgtrfs,ZGTRFS) -#define LAPACK_sporfs LAPACK_GLOBAL(sporfs,SPORFS) -#define LAPACK_dporfs LAPACK_GLOBAL(dporfs,DPORFS) -#define LAPACK_cporfs LAPACK_GLOBAL(cporfs,CPORFS) -#define LAPACK_zporfs LAPACK_GLOBAL(zporfs,ZPORFS) -#define LAPACK_dporfsx LAPACK_GLOBAL(dporfsx,DPORFSX) -#define LAPACK_sporfsx LAPACK_GLOBAL(sporfsx,SPORFSX) -#define LAPACK_zporfsx LAPACK_GLOBAL(zporfsx,ZPORFSX) -#define LAPACK_cporfsx LAPACK_GLOBAL(cporfsx,CPORFSX) -#define LAPACK_spprfs LAPACK_GLOBAL(spprfs,SPPRFS) -#define LAPACK_dpprfs LAPACK_GLOBAL(dpprfs,DPPRFS) -#define LAPACK_cpprfs LAPACK_GLOBAL(cpprfs,CPPRFS) -#define LAPACK_zpprfs LAPACK_GLOBAL(zpprfs,ZPPRFS) -#define LAPACK_spbrfs LAPACK_GLOBAL(spbrfs,SPBRFS) -#define LAPACK_dpbrfs LAPACK_GLOBAL(dpbrfs,DPBRFS) -#define LAPACK_cpbrfs LAPACK_GLOBAL(cpbrfs,CPBRFS) -#define LAPACK_zpbrfs LAPACK_GLOBAL(zpbrfs,ZPBRFS) -#define LAPACK_sptrfs LAPACK_GLOBAL(sptrfs,SPTRFS) -#define LAPACK_dptrfs LAPACK_GLOBAL(dptrfs,DPTRFS) -#define LAPACK_cptrfs LAPACK_GLOBAL(cptrfs,CPTRFS) -#define LAPACK_zptrfs LAPACK_GLOBAL(zptrfs,ZPTRFS) -#define LAPACK_ssyrfs LAPACK_GLOBAL(ssyrfs,SSYRFS) -#define LAPACK_dsyrfs LAPACK_GLOBAL(dsyrfs,DSYRFS) -#define LAPACK_csyrfs LAPACK_GLOBAL(csyrfs,CSYRFS) -#define LAPACK_zsyrfs LAPACK_GLOBAL(zsyrfs,ZSYRFS) -#define LAPACK_dsyrfsx LAPACK_GLOBAL(dsyrfsx,DSYRFSX) -#define LAPACK_ssyrfsx LAPACK_GLOBAL(ssyrfsx,SSYRFSX) -#define LAPACK_zsyrfsx LAPACK_GLOBAL(zsyrfsx,ZSYRFSX) -#define LAPACK_csyrfsx LAPACK_GLOBAL(csyrfsx,CSYRFSX) -#define LAPACK_cherfs LAPACK_GLOBAL(cherfs,CHERFS) -#define LAPACK_zherfs LAPACK_GLOBAL(zherfs,ZHERFS) -#define LAPACK_zherfsx LAPACK_GLOBAL(zherfsx,ZHERFSX) -#define LAPACK_cherfsx LAPACK_GLOBAL(cherfsx,CHERFSX) -#define LAPACK_ssprfs LAPACK_GLOBAL(ssprfs,SSPRFS) -#define LAPACK_dsprfs LAPACK_GLOBAL(dsprfs,DSPRFS) -#define LAPACK_csprfs LAPACK_GLOBAL(csprfs,CSPRFS) -#define LAPACK_zsprfs LAPACK_GLOBAL(zsprfs,ZSPRFS) -#define LAPACK_chprfs LAPACK_GLOBAL(chprfs,CHPRFS) -#define LAPACK_zhprfs LAPACK_GLOBAL(zhprfs,ZHPRFS) -#define LAPACK_strrfs LAPACK_GLOBAL(strrfs,STRRFS) -#define LAPACK_dtrrfs LAPACK_GLOBAL(dtrrfs,DTRRFS) -#define LAPACK_ctrrfs LAPACK_GLOBAL(ctrrfs,CTRRFS) -#define LAPACK_ztrrfs LAPACK_GLOBAL(ztrrfs,ZTRRFS) -#define LAPACK_stprfs LAPACK_GLOBAL(stprfs,STPRFS) -#define LAPACK_dtprfs LAPACK_GLOBAL(dtprfs,DTPRFS) -#define LAPACK_ctprfs LAPACK_GLOBAL(ctprfs,CTPRFS) -#define LAPACK_ztprfs LAPACK_GLOBAL(ztprfs,ZTPRFS) -#define LAPACK_stbrfs LAPACK_GLOBAL(stbrfs,STBRFS) -#define LAPACK_dtbrfs LAPACK_GLOBAL(dtbrfs,DTBRFS) -#define LAPACK_ctbrfs LAPACK_GLOBAL(ctbrfs,CTBRFS) -#define LAPACK_ztbrfs LAPACK_GLOBAL(ztbrfs,ZTBRFS) -#define LAPACK_sgetri LAPACK_GLOBAL(sgetri,SGETRI) -#define LAPACK_dgetri LAPACK_GLOBAL(dgetri,DGETRI) -#define LAPACK_cgetri LAPACK_GLOBAL(cgetri,CGETRI) -#define LAPACK_zgetri LAPACK_GLOBAL(zgetri,ZGETRI) -#define LAPACK_spotri LAPACK_GLOBAL(spotri,SPOTRI) -#define LAPACK_dpotri LAPACK_GLOBAL(dpotri,DPOTRI) -#define LAPACK_cpotri LAPACK_GLOBAL(cpotri,CPOTRI) -#define LAPACK_zpotri LAPACK_GLOBAL(zpotri,ZPOTRI) -#define LAPACK_dpftri LAPACK_GLOBAL(dpftri,DPFTRI) -#define LAPACK_spftri LAPACK_GLOBAL(spftri,SPFTRI) -#define LAPACK_zpftri LAPACK_GLOBAL(zpftri,ZPFTRI) -#define LAPACK_cpftri LAPACK_GLOBAL(cpftri,CPFTRI) -#define LAPACK_spptri LAPACK_GLOBAL(spptri,SPPTRI) -#define LAPACK_dpptri LAPACK_GLOBAL(dpptri,DPPTRI) -#define LAPACK_cpptri LAPACK_GLOBAL(cpptri,CPPTRI) -#define LAPACK_zpptri LAPACK_GLOBAL(zpptri,ZPPTRI) -#define LAPACK_ssytri LAPACK_GLOBAL(ssytri,SSYTRI) -#define LAPACK_dsytri LAPACK_GLOBAL(dsytri,DSYTRI) -#define LAPACK_csytri LAPACK_GLOBAL(csytri,CSYTRI) -#define LAPACK_zsytri LAPACK_GLOBAL(zsytri,ZSYTRI) -#define LAPACK_chetri LAPACK_GLOBAL(chetri,CHETRI) -#define LAPACK_zhetri LAPACK_GLOBAL(zhetri,ZHETRI) -#define LAPACK_ssptri LAPACK_GLOBAL(ssptri,SSPTRI) -#define LAPACK_dsptri LAPACK_GLOBAL(dsptri,DSPTRI) -#define LAPACK_csptri LAPACK_GLOBAL(csptri,CSPTRI) -#define LAPACK_zsptri LAPACK_GLOBAL(zsptri,ZSPTRI) -#define LAPACK_chptri LAPACK_GLOBAL(chptri,CHPTRI) -#define LAPACK_zhptri LAPACK_GLOBAL(zhptri,ZHPTRI) -#define LAPACK_strtri LAPACK_GLOBAL(strtri,STRTRI) -#define LAPACK_dtrtri LAPACK_GLOBAL(dtrtri,DTRTRI) -#define LAPACK_ctrtri LAPACK_GLOBAL(ctrtri,CTRTRI) -#define LAPACK_ztrtri LAPACK_GLOBAL(ztrtri,ZTRTRI) -#define LAPACK_dtftri LAPACK_GLOBAL(dtftri,DTFTRI) -#define LAPACK_stftri LAPACK_GLOBAL(stftri,STFTRI) -#define LAPACK_ztftri LAPACK_GLOBAL(ztftri,ZTFTRI) -#define LAPACK_ctftri LAPACK_GLOBAL(ctftri,CTFTRI) -#define LAPACK_stptri LAPACK_GLOBAL(stptri,STPTRI) -#define LAPACK_dtptri LAPACK_GLOBAL(dtptri,DTPTRI) -#define LAPACK_ctptri LAPACK_GLOBAL(ctptri,CTPTRI) -#define LAPACK_ztptri LAPACK_GLOBAL(ztptri,ZTPTRI) -#define LAPACK_sgeequ LAPACK_GLOBAL(sgeequ,SGEEQU) -#define LAPACK_dgeequ LAPACK_GLOBAL(dgeequ,DGEEQU) -#define LAPACK_cgeequ LAPACK_GLOBAL(cgeequ,CGEEQU) -#define LAPACK_zgeequ LAPACK_GLOBAL(zgeequ,ZGEEQU) -#define LAPACK_dgeequb LAPACK_GLOBAL(dgeequb,DGEEQUB) -#define LAPACK_sgeequb LAPACK_GLOBAL(sgeequb,SGEEQUB) -#define LAPACK_zgeequb LAPACK_GLOBAL(zgeequb,ZGEEQUB) -#define LAPACK_cgeequb LAPACK_GLOBAL(cgeequb,CGEEQUB) -#define LAPACK_sgbequ LAPACK_GLOBAL(sgbequ,SGBEQU) -#define LAPACK_dgbequ LAPACK_GLOBAL(dgbequ,DGBEQU) -#define LAPACK_cgbequ LAPACK_GLOBAL(cgbequ,CGBEQU) -#define LAPACK_zgbequ LAPACK_GLOBAL(zgbequ,ZGBEQU) -#define LAPACK_dgbequb LAPACK_GLOBAL(dgbequb,DGBEQUB) -#define LAPACK_sgbequb LAPACK_GLOBAL(sgbequb,SGBEQUB) -#define LAPACK_zgbequb LAPACK_GLOBAL(zgbequb,ZGBEQUB) -#define LAPACK_cgbequb LAPACK_GLOBAL(cgbequb,CGBEQUB) -#define LAPACK_spoequ LAPACK_GLOBAL(spoequ,SPOEQU) -#define LAPACK_dpoequ LAPACK_GLOBAL(dpoequ,DPOEQU) -#define LAPACK_cpoequ LAPACK_GLOBAL(cpoequ,CPOEQU) -#define LAPACK_zpoequ LAPACK_GLOBAL(zpoequ,ZPOEQU) -#define LAPACK_dpoequb LAPACK_GLOBAL(dpoequb,DPOEQUB) -#define LAPACK_spoequb LAPACK_GLOBAL(spoequb,SPOEQUB) -#define LAPACK_zpoequb LAPACK_GLOBAL(zpoequb,ZPOEQUB) -#define LAPACK_cpoequb LAPACK_GLOBAL(cpoequb,CPOEQUB) -#define LAPACK_sppequ LAPACK_GLOBAL(sppequ,SPPEQU) -#define LAPACK_dppequ LAPACK_GLOBAL(dppequ,DPPEQU) -#define LAPACK_cppequ LAPACK_GLOBAL(cppequ,CPPEQU) -#define LAPACK_zppequ LAPACK_GLOBAL(zppequ,ZPPEQU) -#define LAPACK_spbequ LAPACK_GLOBAL(spbequ,SPBEQU) -#define LAPACK_dpbequ LAPACK_GLOBAL(dpbequ,DPBEQU) -#define LAPACK_cpbequ LAPACK_GLOBAL(cpbequ,CPBEQU) -#define LAPACK_zpbequ LAPACK_GLOBAL(zpbequ,ZPBEQU) -#define LAPACK_dsyequb LAPACK_GLOBAL(dsyequb,DSYEQUB) -#define LAPACK_ssyequb LAPACK_GLOBAL(ssyequb,SSYEQUB) -#define LAPACK_zsyequb LAPACK_GLOBAL(zsyequb,ZSYEQUB) -#define LAPACK_csyequb LAPACK_GLOBAL(csyequb,CSYEQUB) -#define LAPACK_zheequb LAPACK_GLOBAL(zheequb,ZHEEQUB) -#define LAPACK_cheequb LAPACK_GLOBAL(cheequb,CHEEQUB) -#define LAPACK_sgesv LAPACK_GLOBAL(sgesv,SGESV) -#define LAPACK_dgesv LAPACK_GLOBAL(dgesv,DGESV) -#define LAPACK_cgesv LAPACK_GLOBAL(cgesv,CGESV) -#define LAPACK_zgesv LAPACK_GLOBAL(zgesv,ZGESV) -#define LAPACK_dsgesv LAPACK_GLOBAL(dsgesv,DSGESV) -#define LAPACK_zcgesv LAPACK_GLOBAL(zcgesv,ZCGESV) -#define LAPACK_sgesvx LAPACK_GLOBAL(sgesvx,SGESVX) -#define LAPACK_dgesvx LAPACK_GLOBAL(dgesvx,DGESVX) -#define LAPACK_cgesvx LAPACK_GLOBAL(cgesvx,CGESVX) -#define LAPACK_zgesvx LAPACK_GLOBAL(zgesvx,ZGESVX) -#define LAPACK_dgesvxx LAPACK_GLOBAL(dgesvxx,DGESVXX) -#define LAPACK_sgesvxx LAPACK_GLOBAL(sgesvxx,SGESVXX) -#define LAPACK_zgesvxx LAPACK_GLOBAL(zgesvxx,ZGESVXX) -#define LAPACK_cgesvxx LAPACK_GLOBAL(cgesvxx,CGESVXX) -#define LAPACK_sgbsv LAPACK_GLOBAL(sgbsv,SGBSV) -#define LAPACK_dgbsv LAPACK_GLOBAL(dgbsv,DGBSV) -#define LAPACK_cgbsv LAPACK_GLOBAL(cgbsv,CGBSV) -#define LAPACK_zgbsv LAPACK_GLOBAL(zgbsv,ZGBSV) -#define LAPACK_sgbsvx LAPACK_GLOBAL(sgbsvx,SGBSVX) -#define LAPACK_dgbsvx LAPACK_GLOBAL(dgbsvx,DGBSVX) -#define LAPACK_cgbsvx LAPACK_GLOBAL(cgbsvx,CGBSVX) -#define LAPACK_zgbsvx LAPACK_GLOBAL(zgbsvx,ZGBSVX) -#define LAPACK_dgbsvxx LAPACK_GLOBAL(dgbsvxx,DGBSVXX) -#define LAPACK_sgbsvxx LAPACK_GLOBAL(sgbsvxx,SGBSVXX) -#define LAPACK_zgbsvxx LAPACK_GLOBAL(zgbsvxx,ZGBSVXX) -#define LAPACK_cgbsvxx LAPACK_GLOBAL(cgbsvxx,CGBSVXX) -#define LAPACK_sgtsv LAPACK_GLOBAL(sgtsv,SGTSV) -#define LAPACK_dgtsv LAPACK_GLOBAL(dgtsv,DGTSV) -#define LAPACK_cgtsv LAPACK_GLOBAL(cgtsv,CGTSV) -#define LAPACK_zgtsv LAPACK_GLOBAL(zgtsv,ZGTSV) -#define LAPACK_sgtsvx LAPACK_GLOBAL(sgtsvx,SGTSVX) -#define LAPACK_dgtsvx LAPACK_GLOBAL(dgtsvx,DGTSVX) -#define LAPACK_cgtsvx LAPACK_GLOBAL(cgtsvx,CGTSVX) -#define LAPACK_zgtsvx LAPACK_GLOBAL(zgtsvx,ZGTSVX) -#define LAPACK_sposv LAPACK_GLOBAL(sposv,SPOSV) -#define LAPACK_dposv LAPACK_GLOBAL(dposv,DPOSV) -#define LAPACK_cposv LAPACK_GLOBAL(cposv,CPOSV) -#define LAPACK_zposv LAPACK_GLOBAL(zposv,ZPOSV) -#define LAPACK_dsposv LAPACK_GLOBAL(dsposv,DSPOSV) -#define LAPACK_zcposv LAPACK_GLOBAL(zcposv,ZCPOSV) -#define LAPACK_sposvx LAPACK_GLOBAL(sposvx,SPOSVX) -#define LAPACK_dposvx LAPACK_GLOBAL(dposvx,DPOSVX) -#define LAPACK_cposvx LAPACK_GLOBAL(cposvx,CPOSVX) -#define LAPACK_zposvx LAPACK_GLOBAL(zposvx,ZPOSVX) -#define LAPACK_dposvxx LAPACK_GLOBAL(dposvxx,DPOSVXX) -#define LAPACK_sposvxx LAPACK_GLOBAL(sposvxx,SPOSVXX) -#define LAPACK_zposvxx LAPACK_GLOBAL(zposvxx,ZPOSVXX) -#define LAPACK_cposvxx LAPACK_GLOBAL(cposvxx,CPOSVXX) -#define LAPACK_sppsv LAPACK_GLOBAL(sppsv,SPPSV) -#define LAPACK_dppsv LAPACK_GLOBAL(dppsv,DPPSV) -#define LAPACK_cppsv LAPACK_GLOBAL(cppsv,CPPSV) -#define LAPACK_zppsv LAPACK_GLOBAL(zppsv,ZPPSV) -#define LAPACK_sppsvx LAPACK_GLOBAL(sppsvx,SPPSVX) -#define LAPACK_dppsvx LAPACK_GLOBAL(dppsvx,DPPSVX) -#define LAPACK_cppsvx LAPACK_GLOBAL(cppsvx,CPPSVX) -#define LAPACK_zppsvx LAPACK_GLOBAL(zppsvx,ZPPSVX) -#define LAPACK_spbsv LAPACK_GLOBAL(spbsv,SPBSV) -#define LAPACK_dpbsv LAPACK_GLOBAL(dpbsv,DPBSV) -#define LAPACK_cpbsv LAPACK_GLOBAL(cpbsv,CPBSV) -#define LAPACK_zpbsv LAPACK_GLOBAL(zpbsv,ZPBSV) -#define LAPACK_spbsvx LAPACK_GLOBAL(spbsvx,SPBSVX) -#define LAPACK_dpbsvx LAPACK_GLOBAL(dpbsvx,DPBSVX) -#define LAPACK_cpbsvx LAPACK_GLOBAL(cpbsvx,CPBSVX) -#define LAPACK_zpbsvx LAPACK_GLOBAL(zpbsvx,ZPBSVX) -#define LAPACK_sptsv LAPACK_GLOBAL(sptsv,SPTSV) -#define LAPACK_dptsv LAPACK_GLOBAL(dptsv,DPTSV) -#define LAPACK_cptsv LAPACK_GLOBAL(cptsv,CPTSV) -#define LAPACK_zptsv LAPACK_GLOBAL(zptsv,ZPTSV) -#define LAPACK_sptsvx LAPACK_GLOBAL(sptsvx,SPTSVX) -#define LAPACK_dptsvx LAPACK_GLOBAL(dptsvx,DPTSVX) -#define LAPACK_cptsvx LAPACK_GLOBAL(cptsvx,CPTSVX) -#define LAPACK_zptsvx LAPACK_GLOBAL(zptsvx,ZPTSVX) -#define LAPACK_ssysv LAPACK_GLOBAL(ssysv,SSYSV) -#define LAPACK_dsysv LAPACK_GLOBAL(dsysv,DSYSV) -#define LAPACK_csysv LAPACK_GLOBAL(csysv,CSYSV) -#define LAPACK_zsysv LAPACK_GLOBAL(zsysv,ZSYSV) -#define LAPACK_ssysvx LAPACK_GLOBAL(ssysvx,SSYSVX) -#define LAPACK_dsysvx LAPACK_GLOBAL(dsysvx,DSYSVX) -#define LAPACK_csysvx LAPACK_GLOBAL(csysvx,CSYSVX) -#define LAPACK_zsysvx LAPACK_GLOBAL(zsysvx,ZSYSVX) -#define LAPACK_dsysvxx LAPACK_GLOBAL(dsysvxx,DSYSVXX) -#define LAPACK_ssysvxx LAPACK_GLOBAL(ssysvxx,SSYSVXX) -#define LAPACK_zsysvxx LAPACK_GLOBAL(zsysvxx,ZSYSVXX) -#define LAPACK_csysvxx LAPACK_GLOBAL(csysvxx,CSYSVXX) -#define LAPACK_chesv LAPACK_GLOBAL(chesv,CHESV) -#define LAPACK_zhesv LAPACK_GLOBAL(zhesv,ZHESV) -#define LAPACK_chesvx LAPACK_GLOBAL(chesvx,CHESVX) -#define LAPACK_zhesvx LAPACK_GLOBAL(zhesvx,ZHESVX) -#define LAPACK_zhesvxx LAPACK_GLOBAL(zhesvxx,ZHESVXX) -#define LAPACK_chesvxx LAPACK_GLOBAL(chesvxx,CHESVXX) -#define LAPACK_sspsv LAPACK_GLOBAL(sspsv,SSPSV) -#define LAPACK_dspsv LAPACK_GLOBAL(dspsv,DSPSV) -#define LAPACK_cspsv LAPACK_GLOBAL(cspsv,CSPSV) -#define LAPACK_zspsv LAPACK_GLOBAL(zspsv,ZSPSV) -#define LAPACK_sspsvx LAPACK_GLOBAL(sspsvx,SSPSVX) -#define LAPACK_dspsvx LAPACK_GLOBAL(dspsvx,DSPSVX) -#define LAPACK_cspsvx LAPACK_GLOBAL(cspsvx,CSPSVX) -#define LAPACK_zspsvx LAPACK_GLOBAL(zspsvx,ZSPSVX) -#define LAPACK_chpsv LAPACK_GLOBAL(chpsv,CHPSV) -#define LAPACK_zhpsv LAPACK_GLOBAL(zhpsv,ZHPSV) -#define LAPACK_chpsvx LAPACK_GLOBAL(chpsvx,CHPSVX) -#define LAPACK_zhpsvx LAPACK_GLOBAL(zhpsvx,ZHPSVX) -#define LAPACK_sgeqrf LAPACK_GLOBAL(sgeqrf,SGEQRF) -#define LAPACK_dgeqrf LAPACK_GLOBAL(dgeqrf,DGEQRF) -#define LAPACK_cgeqrf LAPACK_GLOBAL(cgeqrf,CGEQRF) -#define LAPACK_zgeqrf LAPACK_GLOBAL(zgeqrf,ZGEQRF) -#define LAPACK_sgeqpf LAPACK_GLOBAL(sgeqpf,SGEQPF) -#define LAPACK_dgeqpf LAPACK_GLOBAL(dgeqpf,DGEQPF) -#define LAPACK_cgeqpf LAPACK_GLOBAL(cgeqpf,CGEQPF) -#define LAPACK_zgeqpf LAPACK_GLOBAL(zgeqpf,ZGEQPF) -#define LAPACK_sgeqp3 LAPACK_GLOBAL(sgeqp3,SGEQP3) -#define LAPACK_dgeqp3 LAPACK_GLOBAL(dgeqp3,DGEQP3) -#define LAPACK_cgeqp3 LAPACK_GLOBAL(cgeqp3,CGEQP3) -#define LAPACK_zgeqp3 LAPACK_GLOBAL(zgeqp3,ZGEQP3) -#define LAPACK_sorgqr LAPACK_GLOBAL(sorgqr,SORGQR) -#define LAPACK_dorgqr LAPACK_GLOBAL(dorgqr,DORGQR) -#define LAPACK_sormqr LAPACK_GLOBAL(sormqr,SORMQR) -#define LAPACK_dormqr LAPACK_GLOBAL(dormqr,DORMQR) -#define LAPACK_cungqr LAPACK_GLOBAL(cungqr,CUNGQR) -#define LAPACK_zungqr LAPACK_GLOBAL(zungqr,ZUNGQR) -#define LAPACK_cunmqr LAPACK_GLOBAL(cunmqr,CUNMQR) -#define LAPACK_zunmqr LAPACK_GLOBAL(zunmqr,ZUNMQR) -#define LAPACK_sgelqf LAPACK_GLOBAL(sgelqf,SGELQF) -#define LAPACK_dgelqf LAPACK_GLOBAL(dgelqf,DGELQF) -#define LAPACK_cgelqf LAPACK_GLOBAL(cgelqf,CGELQF) -#define LAPACK_zgelqf LAPACK_GLOBAL(zgelqf,ZGELQF) -#define LAPACK_sorglq LAPACK_GLOBAL(sorglq,SORGLQ) -#define LAPACK_dorglq LAPACK_GLOBAL(dorglq,DORGLQ) -#define LAPACK_sormlq LAPACK_GLOBAL(sormlq,SORMLQ) -#define LAPACK_dormlq LAPACK_GLOBAL(dormlq,DORMLQ) -#define LAPACK_cunglq LAPACK_GLOBAL(cunglq,CUNGLQ) -#define LAPACK_zunglq LAPACK_GLOBAL(zunglq,ZUNGLQ) -#define LAPACK_cunmlq LAPACK_GLOBAL(cunmlq,CUNMLQ) -#define LAPACK_zunmlq LAPACK_GLOBAL(zunmlq,ZUNMLQ) -#define LAPACK_sgeqlf LAPACK_GLOBAL(sgeqlf,SGEQLF) -#define LAPACK_dgeqlf LAPACK_GLOBAL(dgeqlf,DGEQLF) -#define LAPACK_cgeqlf LAPACK_GLOBAL(cgeqlf,CGEQLF) -#define LAPACK_zgeqlf LAPACK_GLOBAL(zgeqlf,ZGEQLF) -#define LAPACK_sorgql LAPACK_GLOBAL(sorgql,SORGQL) -#define LAPACK_dorgql LAPACK_GLOBAL(dorgql,DORGQL) -#define LAPACK_cungql LAPACK_GLOBAL(cungql,CUNGQL) -#define LAPACK_zungql LAPACK_GLOBAL(zungql,ZUNGQL) -#define LAPACK_sormql LAPACK_GLOBAL(sormql,SORMQL) -#define LAPACK_dormql LAPACK_GLOBAL(dormql,DORMQL) -#define LAPACK_cunmql LAPACK_GLOBAL(cunmql,CUNMQL) -#define LAPACK_zunmql LAPACK_GLOBAL(zunmql,ZUNMQL) -#define LAPACK_sgerqf LAPACK_GLOBAL(sgerqf,SGERQF) -#define LAPACK_dgerqf LAPACK_GLOBAL(dgerqf,DGERQF) -#define LAPACK_cgerqf LAPACK_GLOBAL(cgerqf,CGERQF) -#define LAPACK_zgerqf LAPACK_GLOBAL(zgerqf,ZGERQF) -#define LAPACK_sorgrq LAPACK_GLOBAL(sorgrq,SORGRQ) -#define LAPACK_dorgrq LAPACK_GLOBAL(dorgrq,DORGRQ) -#define LAPACK_cungrq LAPACK_GLOBAL(cungrq,CUNGRQ) -#define LAPACK_zungrq LAPACK_GLOBAL(zungrq,ZUNGRQ) -#define LAPACK_sormrq LAPACK_GLOBAL(sormrq,SORMRQ) -#define LAPACK_dormrq LAPACK_GLOBAL(dormrq,DORMRQ) -#define LAPACK_cunmrq LAPACK_GLOBAL(cunmrq,CUNMRQ) -#define LAPACK_zunmrq LAPACK_GLOBAL(zunmrq,ZUNMRQ) -#define LAPACK_stzrzf LAPACK_GLOBAL(stzrzf,STZRZF) -#define LAPACK_dtzrzf LAPACK_GLOBAL(dtzrzf,DTZRZF) -#define LAPACK_ctzrzf LAPACK_GLOBAL(ctzrzf,CTZRZF) -#define LAPACK_ztzrzf LAPACK_GLOBAL(ztzrzf,ZTZRZF) -#define LAPACK_sormrz LAPACK_GLOBAL(sormrz,SORMRZ) -#define LAPACK_dormrz LAPACK_GLOBAL(dormrz,DORMRZ) -#define LAPACK_cunmrz LAPACK_GLOBAL(cunmrz,CUNMRZ) -#define LAPACK_zunmrz LAPACK_GLOBAL(zunmrz,ZUNMRZ) -#define LAPACK_sggqrf LAPACK_GLOBAL(sggqrf,SGGQRF) -#define LAPACK_dggqrf LAPACK_GLOBAL(dggqrf,DGGQRF) -#define LAPACK_cggqrf LAPACK_GLOBAL(cggqrf,CGGQRF) -#define LAPACK_zggqrf LAPACK_GLOBAL(zggqrf,ZGGQRF) -#define LAPACK_sggrqf LAPACK_GLOBAL(sggrqf,SGGRQF) -#define LAPACK_dggrqf LAPACK_GLOBAL(dggrqf,DGGRQF) -#define LAPACK_cggrqf LAPACK_GLOBAL(cggrqf,CGGRQF) -#define LAPACK_zggrqf LAPACK_GLOBAL(zggrqf,ZGGRQF) -#define LAPACK_sgebrd LAPACK_GLOBAL(sgebrd,SGEBRD) -#define LAPACK_dgebrd LAPACK_GLOBAL(dgebrd,DGEBRD) -#define LAPACK_cgebrd LAPACK_GLOBAL(cgebrd,CGEBRD) -#define LAPACK_zgebrd LAPACK_GLOBAL(zgebrd,ZGEBRD) -#define LAPACK_sgbbrd LAPACK_GLOBAL(sgbbrd,SGBBRD) -#define LAPACK_dgbbrd LAPACK_GLOBAL(dgbbrd,DGBBRD) -#define LAPACK_cgbbrd LAPACK_GLOBAL(cgbbrd,CGBBRD) -#define LAPACK_zgbbrd LAPACK_GLOBAL(zgbbrd,ZGBBRD) -#define LAPACK_sorgbr LAPACK_GLOBAL(sorgbr,SORGBR) -#define LAPACK_dorgbr LAPACK_GLOBAL(dorgbr,DORGBR) -#define LAPACK_sormbr LAPACK_GLOBAL(sormbr,SORMBR) -#define LAPACK_dormbr LAPACK_GLOBAL(dormbr,DORMBR) -#define LAPACK_cungbr LAPACK_GLOBAL(cungbr,CUNGBR) -#define LAPACK_zungbr LAPACK_GLOBAL(zungbr,ZUNGBR) -#define LAPACK_cunmbr LAPACK_GLOBAL(cunmbr,CUNMBR) -#define LAPACK_zunmbr LAPACK_GLOBAL(zunmbr,ZUNMBR) -#define LAPACK_sbdsqr LAPACK_GLOBAL(sbdsqr,SBDSQR) -#define LAPACK_dbdsqr LAPACK_GLOBAL(dbdsqr,DBDSQR) -#define LAPACK_cbdsqr LAPACK_GLOBAL(cbdsqr,CBDSQR) -#define LAPACK_zbdsqr LAPACK_GLOBAL(zbdsqr,ZBDSQR) -#define LAPACK_sbdsdc LAPACK_GLOBAL(sbdsdc,SBDSDC) -#define LAPACK_dbdsdc LAPACK_GLOBAL(dbdsdc,DBDSDC) -#define LAPACK_ssytrd LAPACK_GLOBAL(ssytrd,SSYTRD) -#define LAPACK_dsytrd LAPACK_GLOBAL(dsytrd,DSYTRD) -#define LAPACK_sorgtr LAPACK_GLOBAL(sorgtr,SORGTR) -#define LAPACK_dorgtr LAPACK_GLOBAL(dorgtr,DORGTR) -#define LAPACK_sormtr LAPACK_GLOBAL(sormtr,SORMTR) -#define LAPACK_dormtr LAPACK_GLOBAL(dormtr,DORMTR) -#define LAPACK_chetrd LAPACK_GLOBAL(chetrd,CHETRD) -#define LAPACK_zhetrd LAPACK_GLOBAL(zhetrd,ZHETRD) -#define LAPACK_cungtr LAPACK_GLOBAL(cungtr,CUNGTR) -#define LAPACK_zungtr LAPACK_GLOBAL(zungtr,ZUNGTR) -#define LAPACK_cunmtr LAPACK_GLOBAL(cunmtr,CUNMTR) -#define LAPACK_zunmtr LAPACK_GLOBAL(zunmtr,ZUNMTR) -#define LAPACK_ssptrd LAPACK_GLOBAL(ssptrd,SSPTRD) -#define LAPACK_dsptrd LAPACK_GLOBAL(dsptrd,DSPTRD) -#define LAPACK_sopgtr LAPACK_GLOBAL(sopgtr,SOPGTR) -#define LAPACK_dopgtr LAPACK_GLOBAL(dopgtr,DOPGTR) -#define LAPACK_sopmtr LAPACK_GLOBAL(sopmtr,SOPMTR) -#define LAPACK_dopmtr LAPACK_GLOBAL(dopmtr,DOPMTR) -#define LAPACK_chptrd LAPACK_GLOBAL(chptrd,CHPTRD) -#define LAPACK_zhptrd LAPACK_GLOBAL(zhptrd,ZHPTRD) -#define LAPACK_cupgtr LAPACK_GLOBAL(cupgtr,CUPGTR) -#define LAPACK_zupgtr LAPACK_GLOBAL(zupgtr,ZUPGTR) -#define LAPACK_cupmtr LAPACK_GLOBAL(cupmtr,CUPMTR) -#define LAPACK_zupmtr LAPACK_GLOBAL(zupmtr,ZUPMTR) -#define LAPACK_ssbtrd LAPACK_GLOBAL(ssbtrd,SSBTRD) -#define LAPACK_dsbtrd LAPACK_GLOBAL(dsbtrd,DSBTRD) -#define LAPACK_chbtrd LAPACK_GLOBAL(chbtrd,CHBTRD) -#define LAPACK_zhbtrd LAPACK_GLOBAL(zhbtrd,ZHBTRD) -#define LAPACK_ssterf LAPACK_GLOBAL(ssterf,SSTERF) -#define LAPACK_dsterf LAPACK_GLOBAL(dsterf,DSTERF) -#define LAPACK_ssteqr LAPACK_GLOBAL(ssteqr,SSTEQR) -#define LAPACK_dsteqr LAPACK_GLOBAL(dsteqr,DSTEQR) -#define LAPACK_csteqr LAPACK_GLOBAL(csteqr,CSTEQR) -#define LAPACK_zsteqr LAPACK_GLOBAL(zsteqr,ZSTEQR) -#define LAPACK_sstemr LAPACK_GLOBAL(sstemr,SSTEMR) -#define LAPACK_dstemr LAPACK_GLOBAL(dstemr,DSTEMR) -#define LAPACK_cstemr LAPACK_GLOBAL(cstemr,CSTEMR) -#define LAPACK_zstemr LAPACK_GLOBAL(zstemr,ZSTEMR) -#define LAPACK_sstedc LAPACK_GLOBAL(sstedc,SSTEDC) -#define LAPACK_dstedc LAPACK_GLOBAL(dstedc,DSTEDC) -#define LAPACK_cstedc LAPACK_GLOBAL(cstedc,CSTEDC) -#define LAPACK_zstedc LAPACK_GLOBAL(zstedc,ZSTEDC) -#define LAPACK_sstegr LAPACK_GLOBAL(sstegr,SSTEGR) -#define LAPACK_dstegr LAPACK_GLOBAL(dstegr,DSTEGR) -#define LAPACK_cstegr LAPACK_GLOBAL(cstegr,CSTEGR) -#define LAPACK_zstegr LAPACK_GLOBAL(zstegr,ZSTEGR) -#define LAPACK_spteqr LAPACK_GLOBAL(spteqr,SPTEQR) -#define LAPACK_dpteqr LAPACK_GLOBAL(dpteqr,DPTEQR) -#define LAPACK_cpteqr LAPACK_GLOBAL(cpteqr,CPTEQR) -#define LAPACK_zpteqr LAPACK_GLOBAL(zpteqr,ZPTEQR) -#define LAPACK_sstebz LAPACK_GLOBAL(sstebz,SSTEBZ) -#define LAPACK_dstebz LAPACK_GLOBAL(dstebz,DSTEBZ) -#define LAPACK_sstein LAPACK_GLOBAL(sstein,SSTEIN) -#define LAPACK_dstein LAPACK_GLOBAL(dstein,DSTEIN) -#define LAPACK_cstein LAPACK_GLOBAL(cstein,CSTEIN) -#define LAPACK_zstein LAPACK_GLOBAL(zstein,ZSTEIN) -#define LAPACK_sdisna LAPACK_GLOBAL(sdisna,SDISNA) -#define LAPACK_ddisna LAPACK_GLOBAL(ddisna,DDISNA) -#define LAPACK_ssygst LAPACK_GLOBAL(ssygst,SSYGST) -#define LAPACK_dsygst LAPACK_GLOBAL(dsygst,DSYGST) -#define LAPACK_chegst LAPACK_GLOBAL(chegst,CHEGST) -#define LAPACK_zhegst LAPACK_GLOBAL(zhegst,ZHEGST) -#define LAPACK_sspgst LAPACK_GLOBAL(sspgst,SSPGST) -#define LAPACK_dspgst LAPACK_GLOBAL(dspgst,DSPGST) -#define LAPACK_chpgst LAPACK_GLOBAL(chpgst,CHPGST) -#define LAPACK_zhpgst LAPACK_GLOBAL(zhpgst,ZHPGST) -#define LAPACK_ssbgst LAPACK_GLOBAL(ssbgst,SSBGST) -#define LAPACK_dsbgst LAPACK_GLOBAL(dsbgst,DSBGST) -#define LAPACK_chbgst LAPACK_GLOBAL(chbgst,CHBGST) -#define LAPACK_zhbgst LAPACK_GLOBAL(zhbgst,ZHBGST) -#define LAPACK_spbstf LAPACK_GLOBAL(spbstf,SPBSTF) -#define LAPACK_dpbstf LAPACK_GLOBAL(dpbstf,DPBSTF) -#define LAPACK_cpbstf LAPACK_GLOBAL(cpbstf,CPBSTF) -#define LAPACK_zpbstf LAPACK_GLOBAL(zpbstf,ZPBSTF) -#define LAPACK_sgehrd LAPACK_GLOBAL(sgehrd,SGEHRD) -#define LAPACK_dgehrd LAPACK_GLOBAL(dgehrd,DGEHRD) -#define LAPACK_cgehrd LAPACK_GLOBAL(cgehrd,CGEHRD) -#define LAPACK_zgehrd LAPACK_GLOBAL(zgehrd,ZGEHRD) -#define LAPACK_sorghr LAPACK_GLOBAL(sorghr,SORGHR) -#define LAPACK_dorghr LAPACK_GLOBAL(dorghr,DORGHR) -#define LAPACK_sormhr LAPACK_GLOBAL(sormhr,SORMHR) -#define LAPACK_dormhr LAPACK_GLOBAL(dormhr,DORMHR) -#define LAPACK_cunghr LAPACK_GLOBAL(cunghr,CUNGHR) -#define LAPACK_zunghr LAPACK_GLOBAL(zunghr,ZUNGHR) -#define LAPACK_cunmhr LAPACK_GLOBAL(cunmhr,CUNMHR) -#define LAPACK_zunmhr LAPACK_GLOBAL(zunmhr,ZUNMHR) -#define LAPACK_sgebal LAPACK_GLOBAL(sgebal,SGEBAL) -#define LAPACK_dgebal LAPACK_GLOBAL(dgebal,DGEBAL) -#define LAPACK_cgebal LAPACK_GLOBAL(cgebal,CGEBAL) -#define LAPACK_zgebal LAPACK_GLOBAL(zgebal,ZGEBAL) -#define LAPACK_sgebak LAPACK_GLOBAL(sgebak,SGEBAK) -#define LAPACK_dgebak LAPACK_GLOBAL(dgebak,DGEBAK) -#define LAPACK_cgebak LAPACK_GLOBAL(cgebak,CGEBAK) -#define LAPACK_zgebak LAPACK_GLOBAL(zgebak,ZGEBAK) -#define LAPACK_shseqr LAPACK_GLOBAL(shseqr,SHSEQR) -#define LAPACK_dhseqr LAPACK_GLOBAL(dhseqr,DHSEQR) -#define LAPACK_chseqr LAPACK_GLOBAL(chseqr,CHSEQR) -#define LAPACK_zhseqr LAPACK_GLOBAL(zhseqr,ZHSEQR) -#define LAPACK_shsein LAPACK_GLOBAL(shsein,SHSEIN) -#define LAPACK_dhsein LAPACK_GLOBAL(dhsein,DHSEIN) -#define LAPACK_chsein LAPACK_GLOBAL(chsein,CHSEIN) -#define LAPACK_zhsein LAPACK_GLOBAL(zhsein,ZHSEIN) -#define LAPACK_strevc LAPACK_GLOBAL(strevc,STREVC) -#define LAPACK_dtrevc LAPACK_GLOBAL(dtrevc,DTREVC) -#define LAPACK_ctrevc LAPACK_GLOBAL(ctrevc,CTREVC) -#define LAPACK_ztrevc LAPACK_GLOBAL(ztrevc,ZTREVC) -#define LAPACK_strsna LAPACK_GLOBAL(strsna,STRSNA) -#define LAPACK_dtrsna LAPACK_GLOBAL(dtrsna,DTRSNA) -#define LAPACK_ctrsna LAPACK_GLOBAL(ctrsna,CTRSNA) -#define LAPACK_ztrsna LAPACK_GLOBAL(ztrsna,ZTRSNA) -#define LAPACK_strexc LAPACK_GLOBAL(strexc,STREXC) -#define LAPACK_dtrexc LAPACK_GLOBAL(dtrexc,DTREXC) -#define LAPACK_ctrexc LAPACK_GLOBAL(ctrexc,CTREXC) -#define LAPACK_ztrexc LAPACK_GLOBAL(ztrexc,ZTREXC) -#define LAPACK_strsen LAPACK_GLOBAL(strsen,STRSEN) -#define LAPACK_dtrsen LAPACK_GLOBAL(dtrsen,DTRSEN) -#define LAPACK_ctrsen LAPACK_GLOBAL(ctrsen,CTRSEN) -#define LAPACK_ztrsen LAPACK_GLOBAL(ztrsen,ZTRSEN) -#define LAPACK_strsyl LAPACK_GLOBAL(strsyl,STRSYL) -#define LAPACK_dtrsyl LAPACK_GLOBAL(dtrsyl,DTRSYL) -#define LAPACK_ctrsyl LAPACK_GLOBAL(ctrsyl,CTRSYL) -#define LAPACK_ztrsyl LAPACK_GLOBAL(ztrsyl,ZTRSYL) -#define LAPACK_sgghrd LAPACK_GLOBAL(sgghrd,SGGHRD) -#define LAPACK_dgghrd LAPACK_GLOBAL(dgghrd,DGGHRD) -#define LAPACK_cgghrd LAPACK_GLOBAL(cgghrd,CGGHRD) -#define LAPACK_zgghrd LAPACK_GLOBAL(zgghrd,ZGGHRD) -#define LAPACK_sggbal LAPACK_GLOBAL(sggbal,SGGBAL) -#define LAPACK_dggbal LAPACK_GLOBAL(dggbal,DGGBAL) -#define LAPACK_cggbal LAPACK_GLOBAL(cggbal,CGGBAL) -#define LAPACK_zggbal LAPACK_GLOBAL(zggbal,ZGGBAL) -#define LAPACK_sggbak LAPACK_GLOBAL(sggbak,SGGBAK) -#define LAPACK_dggbak LAPACK_GLOBAL(dggbak,DGGBAK) -#define LAPACK_cggbak LAPACK_GLOBAL(cggbak,CGGBAK) -#define LAPACK_zggbak LAPACK_GLOBAL(zggbak,ZGGBAK) -#define LAPACK_shgeqz LAPACK_GLOBAL(shgeqz,SHGEQZ) -#define LAPACK_dhgeqz LAPACK_GLOBAL(dhgeqz,DHGEQZ) -#define LAPACK_chgeqz LAPACK_GLOBAL(chgeqz,CHGEQZ) -#define LAPACK_zhgeqz LAPACK_GLOBAL(zhgeqz,ZHGEQZ) -#define LAPACK_stgevc LAPACK_GLOBAL(stgevc,STGEVC) -#define LAPACK_dtgevc LAPACK_GLOBAL(dtgevc,DTGEVC) -#define LAPACK_ctgevc LAPACK_GLOBAL(ctgevc,CTGEVC) -#define LAPACK_ztgevc LAPACK_GLOBAL(ztgevc,ZTGEVC) -#define LAPACK_stgexc LAPACK_GLOBAL(stgexc,STGEXC) -#define LAPACK_dtgexc LAPACK_GLOBAL(dtgexc,DTGEXC) -#define LAPACK_ctgexc LAPACK_GLOBAL(ctgexc,CTGEXC) -#define LAPACK_ztgexc LAPACK_GLOBAL(ztgexc,ZTGEXC) -#define LAPACK_stgsen LAPACK_GLOBAL(stgsen,STGSEN) -#define LAPACK_dtgsen LAPACK_GLOBAL(dtgsen,DTGSEN) -#define LAPACK_ctgsen LAPACK_GLOBAL(ctgsen,CTGSEN) -#define LAPACK_ztgsen LAPACK_GLOBAL(ztgsen,ZTGSEN) -#define LAPACK_stgsyl LAPACK_GLOBAL(stgsyl,STGSYL) -#define LAPACK_dtgsyl LAPACK_GLOBAL(dtgsyl,DTGSYL) -#define LAPACK_ctgsyl LAPACK_GLOBAL(ctgsyl,CTGSYL) -#define LAPACK_ztgsyl LAPACK_GLOBAL(ztgsyl,ZTGSYL) -#define LAPACK_stgsna LAPACK_GLOBAL(stgsna,STGSNA) -#define LAPACK_dtgsna LAPACK_GLOBAL(dtgsna,DTGSNA) -#define LAPACK_ctgsna LAPACK_GLOBAL(ctgsna,CTGSNA) -#define LAPACK_ztgsna LAPACK_GLOBAL(ztgsna,ZTGSNA) -#define LAPACK_sggsvp LAPACK_GLOBAL(sggsvp,SGGSVP) -#define LAPACK_dggsvp LAPACK_GLOBAL(dggsvp,DGGSVP) -#define LAPACK_cggsvp LAPACK_GLOBAL(cggsvp,CGGSVP) -#define LAPACK_zggsvp LAPACK_GLOBAL(zggsvp,ZGGSVP) -#define LAPACK_stgsja LAPACK_GLOBAL(stgsja,STGSJA) -#define LAPACK_dtgsja LAPACK_GLOBAL(dtgsja,DTGSJA) -#define LAPACK_ctgsja LAPACK_GLOBAL(ctgsja,CTGSJA) -#define LAPACK_ztgsja LAPACK_GLOBAL(ztgsja,ZTGSJA) -#define LAPACK_sgels LAPACK_GLOBAL(sgels,SGELS) -#define LAPACK_dgels LAPACK_GLOBAL(dgels,DGELS) -#define LAPACK_cgels LAPACK_GLOBAL(cgels,CGELS) -#define LAPACK_zgels LAPACK_GLOBAL(zgels,ZGELS) -#define LAPACK_sgelsy LAPACK_GLOBAL(sgelsy,SGELSY) -#define LAPACK_dgelsy LAPACK_GLOBAL(dgelsy,DGELSY) -#define LAPACK_cgelsy LAPACK_GLOBAL(cgelsy,CGELSY) -#define LAPACK_zgelsy LAPACK_GLOBAL(zgelsy,ZGELSY) -#define LAPACK_sgelss LAPACK_GLOBAL(sgelss,SGELSS) -#define LAPACK_dgelss LAPACK_GLOBAL(dgelss,DGELSS) -#define LAPACK_cgelss LAPACK_GLOBAL(cgelss,CGELSS) -#define LAPACK_zgelss LAPACK_GLOBAL(zgelss,ZGELSS) -#define LAPACK_sgelsd LAPACK_GLOBAL(sgelsd,SGELSD) -#define LAPACK_dgelsd LAPACK_GLOBAL(dgelsd,DGELSD) -#define LAPACK_cgelsd LAPACK_GLOBAL(cgelsd,CGELSD) -#define LAPACK_zgelsd LAPACK_GLOBAL(zgelsd,ZGELSD) -#define LAPACK_sgglse LAPACK_GLOBAL(sgglse,SGGLSE) -#define LAPACK_dgglse LAPACK_GLOBAL(dgglse,DGGLSE) -#define LAPACK_cgglse LAPACK_GLOBAL(cgglse,CGGLSE) -#define LAPACK_zgglse LAPACK_GLOBAL(zgglse,ZGGLSE) -#define LAPACK_sggglm LAPACK_GLOBAL(sggglm,SGGGLM) -#define LAPACK_dggglm LAPACK_GLOBAL(dggglm,DGGGLM) -#define LAPACK_cggglm LAPACK_GLOBAL(cggglm,CGGGLM) -#define LAPACK_zggglm LAPACK_GLOBAL(zggglm,ZGGGLM) -#define LAPACK_ssyev LAPACK_GLOBAL(ssyev,SSYEV) -#define LAPACK_dsyev LAPACK_GLOBAL(dsyev,DSYEV) -#define LAPACK_cheev LAPACK_GLOBAL(cheev,CHEEV) -#define LAPACK_zheev LAPACK_GLOBAL(zheev,ZHEEV) -#define LAPACK_ssyevd LAPACK_GLOBAL(ssyevd,SSYEVD) -#define LAPACK_dsyevd LAPACK_GLOBAL(dsyevd,DSYEVD) -#define LAPACK_cheevd LAPACK_GLOBAL(cheevd,CHEEVD) -#define LAPACK_zheevd LAPACK_GLOBAL(zheevd,ZHEEVD) -#define LAPACK_ssyevx LAPACK_GLOBAL(ssyevx,SSYEVX) -#define LAPACK_dsyevx LAPACK_GLOBAL(dsyevx,DSYEVX) -#define LAPACK_cheevx LAPACK_GLOBAL(cheevx,CHEEVX) -#define LAPACK_zheevx LAPACK_GLOBAL(zheevx,ZHEEVX) -#define LAPACK_ssyevr LAPACK_GLOBAL(ssyevr,SSYEVR) -#define LAPACK_dsyevr LAPACK_GLOBAL(dsyevr,DSYEVR) -#define LAPACK_cheevr LAPACK_GLOBAL(cheevr,CHEEVR) -#define LAPACK_zheevr LAPACK_GLOBAL(zheevr,ZHEEVR) -#define LAPACK_sspev LAPACK_GLOBAL(sspev,SSPEV) -#define LAPACK_dspev LAPACK_GLOBAL(dspev,DSPEV) -#define LAPACK_chpev LAPACK_GLOBAL(chpev,CHPEV) -#define LAPACK_zhpev LAPACK_GLOBAL(zhpev,ZHPEV) -#define LAPACK_sspevd LAPACK_GLOBAL(sspevd,SSPEVD) -#define LAPACK_dspevd LAPACK_GLOBAL(dspevd,DSPEVD) -#define LAPACK_chpevd LAPACK_GLOBAL(chpevd,CHPEVD) -#define LAPACK_zhpevd LAPACK_GLOBAL(zhpevd,ZHPEVD) -#define LAPACK_sspevx LAPACK_GLOBAL(sspevx,SSPEVX) -#define LAPACK_dspevx LAPACK_GLOBAL(dspevx,DSPEVX) -#define LAPACK_chpevx LAPACK_GLOBAL(chpevx,CHPEVX) -#define LAPACK_zhpevx LAPACK_GLOBAL(zhpevx,ZHPEVX) -#define LAPACK_ssbev LAPACK_GLOBAL(ssbev,SSBEV) -#define LAPACK_dsbev LAPACK_GLOBAL(dsbev,DSBEV) -#define LAPACK_chbev LAPACK_GLOBAL(chbev,CHBEV) -#define LAPACK_zhbev LAPACK_GLOBAL(zhbev,ZHBEV) -#define LAPACK_ssbevd LAPACK_GLOBAL(ssbevd,SSBEVD) -#define LAPACK_dsbevd LAPACK_GLOBAL(dsbevd,DSBEVD) -#define LAPACK_chbevd LAPACK_GLOBAL(chbevd,CHBEVD) -#define LAPACK_zhbevd LAPACK_GLOBAL(zhbevd,ZHBEVD) -#define LAPACK_ssbevx LAPACK_GLOBAL(ssbevx,SSBEVX) -#define LAPACK_dsbevx LAPACK_GLOBAL(dsbevx,DSBEVX) -#define LAPACK_chbevx LAPACK_GLOBAL(chbevx,CHBEVX) -#define LAPACK_zhbevx LAPACK_GLOBAL(zhbevx,ZHBEVX) -#define LAPACK_sstev LAPACK_GLOBAL(sstev,SSTEV) -#define LAPACK_dstev LAPACK_GLOBAL(dstev,DSTEV) -#define LAPACK_sstevd LAPACK_GLOBAL(sstevd,SSTEVD) -#define LAPACK_dstevd LAPACK_GLOBAL(dstevd,DSTEVD) -#define LAPACK_sstevx LAPACK_GLOBAL(sstevx,SSTEVX) -#define LAPACK_dstevx LAPACK_GLOBAL(dstevx,DSTEVX) -#define LAPACK_sstevr LAPACK_GLOBAL(sstevr,SSTEVR) -#define LAPACK_dstevr LAPACK_GLOBAL(dstevr,DSTEVR) -#define LAPACK_sgees LAPACK_GLOBAL(sgees,SGEES) -#define LAPACK_dgees LAPACK_GLOBAL(dgees,DGEES) -#define LAPACK_cgees LAPACK_GLOBAL(cgees,CGEES) -#define LAPACK_zgees LAPACK_GLOBAL(zgees,ZGEES) -#define LAPACK_sgeesx LAPACK_GLOBAL(sgeesx,SGEESX) -#define LAPACK_dgeesx LAPACK_GLOBAL(dgeesx,DGEESX) -#define LAPACK_cgeesx LAPACK_GLOBAL(cgeesx,CGEESX) -#define LAPACK_zgeesx LAPACK_GLOBAL(zgeesx,ZGEESX) -#define LAPACK_sgeev LAPACK_GLOBAL(sgeev,SGEEV) -#define LAPACK_dgeev LAPACK_GLOBAL(dgeev,DGEEV) -#define LAPACK_cgeev LAPACK_GLOBAL(cgeev,CGEEV) -#define LAPACK_zgeev LAPACK_GLOBAL(zgeev,ZGEEV) -#define LAPACK_sgeevx LAPACK_GLOBAL(sgeevx,SGEEVX) -#define LAPACK_dgeevx LAPACK_GLOBAL(dgeevx,DGEEVX) -#define LAPACK_cgeevx LAPACK_GLOBAL(cgeevx,CGEEVX) -#define LAPACK_zgeevx LAPACK_GLOBAL(zgeevx,ZGEEVX) -#define LAPACK_sgesvd LAPACK_GLOBAL(sgesvd,SGESVD) -#define LAPACK_dgesvd LAPACK_GLOBAL(dgesvd,DGESVD) -#define LAPACK_cgesvd LAPACK_GLOBAL(cgesvd,CGESVD) -#define LAPACK_zgesvd LAPACK_GLOBAL(zgesvd,ZGESVD) -#define LAPACK_sgesdd LAPACK_GLOBAL(sgesdd,SGESDD) -#define LAPACK_dgesdd LAPACK_GLOBAL(dgesdd,DGESDD) -#define LAPACK_cgesdd LAPACK_GLOBAL(cgesdd,CGESDD) -#define LAPACK_zgesdd LAPACK_GLOBAL(zgesdd,ZGESDD) -#define LAPACK_dgejsv LAPACK_GLOBAL(dgejsv,DGEJSV) -#define LAPACK_sgejsv LAPACK_GLOBAL(sgejsv,SGEJSV) -#define LAPACK_dgesvj LAPACK_GLOBAL(dgesvj,DGESVJ) -#define LAPACK_sgesvj LAPACK_GLOBAL(sgesvj,SGESVJ) -#define LAPACK_sggsvd LAPACK_GLOBAL(sggsvd,SGGSVD) -#define LAPACK_dggsvd LAPACK_GLOBAL(dggsvd,DGGSVD) -#define LAPACK_cggsvd LAPACK_GLOBAL(cggsvd,CGGSVD) -#define LAPACK_zggsvd LAPACK_GLOBAL(zggsvd,ZGGSVD) -#define LAPACK_ssygv LAPACK_GLOBAL(ssygv,SSYGV) -#define LAPACK_dsygv LAPACK_GLOBAL(dsygv,DSYGV) -#define LAPACK_chegv LAPACK_GLOBAL(chegv,CHEGV) -#define LAPACK_zhegv LAPACK_GLOBAL(zhegv,ZHEGV) -#define LAPACK_ssygvd LAPACK_GLOBAL(ssygvd,SSYGVD) -#define LAPACK_dsygvd LAPACK_GLOBAL(dsygvd,DSYGVD) -#define LAPACK_chegvd LAPACK_GLOBAL(chegvd,CHEGVD) -#define LAPACK_zhegvd LAPACK_GLOBAL(zhegvd,ZHEGVD) -#define LAPACK_ssygvx LAPACK_GLOBAL(ssygvx,SSYGVX) -#define LAPACK_dsygvx LAPACK_GLOBAL(dsygvx,DSYGVX) -#define LAPACK_chegvx LAPACK_GLOBAL(chegvx,CHEGVX) -#define LAPACK_zhegvx LAPACK_GLOBAL(zhegvx,ZHEGVX) -#define LAPACK_sspgv LAPACK_GLOBAL(sspgv,SSPGV) -#define LAPACK_dspgv LAPACK_GLOBAL(dspgv,DSPGV) -#define LAPACK_chpgv LAPACK_GLOBAL(chpgv,CHPGV) -#define LAPACK_zhpgv LAPACK_GLOBAL(zhpgv,ZHPGV) -#define LAPACK_sspgvd LAPACK_GLOBAL(sspgvd,SSPGVD) -#define LAPACK_dspgvd LAPACK_GLOBAL(dspgvd,DSPGVD) -#define LAPACK_chpgvd LAPACK_GLOBAL(chpgvd,CHPGVD) -#define LAPACK_zhpgvd LAPACK_GLOBAL(zhpgvd,ZHPGVD) -#define LAPACK_sspgvx LAPACK_GLOBAL(sspgvx,SSPGVX) -#define LAPACK_dspgvx LAPACK_GLOBAL(dspgvx,DSPGVX) -#define LAPACK_chpgvx LAPACK_GLOBAL(chpgvx,CHPGVX) -#define LAPACK_zhpgvx LAPACK_GLOBAL(zhpgvx,ZHPGVX) -#define LAPACK_ssbgv LAPACK_GLOBAL(ssbgv,SSBGV) -#define LAPACK_dsbgv LAPACK_GLOBAL(dsbgv,DSBGV) -#define LAPACK_chbgv LAPACK_GLOBAL(chbgv,CHBGV) -#define LAPACK_zhbgv LAPACK_GLOBAL(zhbgv,ZHBGV) -#define LAPACK_ssbgvd LAPACK_GLOBAL(ssbgvd,SSBGVD) -#define LAPACK_dsbgvd LAPACK_GLOBAL(dsbgvd,DSBGVD) -#define LAPACK_chbgvd LAPACK_GLOBAL(chbgvd,CHBGVD) -#define LAPACK_zhbgvd LAPACK_GLOBAL(zhbgvd,ZHBGVD) -#define LAPACK_ssbgvx LAPACK_GLOBAL(ssbgvx,SSBGVX) -#define LAPACK_dsbgvx LAPACK_GLOBAL(dsbgvx,DSBGVX) -#define LAPACK_chbgvx LAPACK_GLOBAL(chbgvx,CHBGVX) -#define LAPACK_zhbgvx LAPACK_GLOBAL(zhbgvx,ZHBGVX) -#define LAPACK_sgges LAPACK_GLOBAL(sgges,SGGES) -#define LAPACK_dgges LAPACK_GLOBAL(dgges,DGGES) -#define LAPACK_cgges LAPACK_GLOBAL(cgges,CGGES) -#define LAPACK_zgges LAPACK_GLOBAL(zgges,ZGGES) -#define LAPACK_sggesx LAPACK_GLOBAL(sggesx,SGGESX) -#define LAPACK_dggesx LAPACK_GLOBAL(dggesx,DGGESX) -#define LAPACK_cggesx LAPACK_GLOBAL(cggesx,CGGESX) -#define LAPACK_zggesx LAPACK_GLOBAL(zggesx,ZGGESX) -#define LAPACK_sggev LAPACK_GLOBAL(sggev,SGGEV) -#define LAPACK_dggev LAPACK_GLOBAL(dggev,DGGEV) -#define LAPACK_cggev LAPACK_GLOBAL(cggev,CGGEV) -#define LAPACK_zggev LAPACK_GLOBAL(zggev,ZGGEV) -#define LAPACK_sggevx LAPACK_GLOBAL(sggevx,SGGEVX) -#define LAPACK_dggevx LAPACK_GLOBAL(dggevx,DGGEVX) -#define LAPACK_cggevx LAPACK_GLOBAL(cggevx,CGGEVX) -#define LAPACK_zggevx LAPACK_GLOBAL(zggevx,ZGGEVX) -#define LAPACK_dsfrk LAPACK_GLOBAL(dsfrk,DSFRK) -#define LAPACK_ssfrk LAPACK_GLOBAL(ssfrk,SSFRK) -#define LAPACK_zhfrk LAPACK_GLOBAL(zhfrk,ZHFRK) -#define LAPACK_chfrk LAPACK_GLOBAL(chfrk,CHFRK) -#define LAPACK_dtfsm LAPACK_GLOBAL(dtfsm,DTFSM) -#define LAPACK_stfsm LAPACK_GLOBAL(stfsm,STFSM) -#define LAPACK_ztfsm LAPACK_GLOBAL(ztfsm,ZTFSM) -#define LAPACK_ctfsm LAPACK_GLOBAL(ctfsm,CTFSM) -#define LAPACK_dtfttp LAPACK_GLOBAL(dtfttp,DTFTTP) -#define LAPACK_stfttp LAPACK_GLOBAL(stfttp,STFTTP) -#define LAPACK_ztfttp LAPACK_GLOBAL(ztfttp,ZTFTTP) -#define LAPACK_ctfttp LAPACK_GLOBAL(ctfttp,CTFTTP) -#define LAPACK_dtfttr LAPACK_GLOBAL(dtfttr,DTFTTR) -#define LAPACK_stfttr LAPACK_GLOBAL(stfttr,STFTTR) -#define LAPACK_ztfttr LAPACK_GLOBAL(ztfttr,ZTFTTR) -#define LAPACK_ctfttr LAPACK_GLOBAL(ctfttr,CTFTTR) -#define LAPACK_dtpttf LAPACK_GLOBAL(dtpttf,DTPTTF) -#define LAPACK_stpttf LAPACK_GLOBAL(stpttf,STPTTF) -#define LAPACK_ztpttf LAPACK_GLOBAL(ztpttf,ZTPTTF) -#define LAPACK_ctpttf LAPACK_GLOBAL(ctpttf,CTPTTF) -#define LAPACK_dtpttr LAPACK_GLOBAL(dtpttr,DTPTTR) -#define LAPACK_stpttr LAPACK_GLOBAL(stpttr,STPTTR) -#define LAPACK_ztpttr LAPACK_GLOBAL(ztpttr,ZTPTTR) -#define LAPACK_ctpttr LAPACK_GLOBAL(ctpttr,CTPTTR) -#define LAPACK_dtrttf LAPACK_GLOBAL(dtrttf,DTRTTF) -#define LAPACK_strttf LAPACK_GLOBAL(strttf,STRTTF) -#define LAPACK_ztrttf LAPACK_GLOBAL(ztrttf,ZTRTTF) -#define LAPACK_ctrttf LAPACK_GLOBAL(ctrttf,CTRTTF) -#define LAPACK_dtrttp LAPACK_GLOBAL(dtrttp,DTRTTP) -#define LAPACK_strttp LAPACK_GLOBAL(strttp,STRTTP) -#define LAPACK_ztrttp LAPACK_GLOBAL(ztrttp,ZTRTTP) -#define LAPACK_ctrttp LAPACK_GLOBAL(ctrttp,CTRTTP) -#define LAPACK_sgeqrfp LAPACK_GLOBAL(sgeqrfp,SGEQRFP) -#define LAPACK_dgeqrfp LAPACK_GLOBAL(dgeqrfp,DGEQRFP) -#define LAPACK_cgeqrfp LAPACK_GLOBAL(cgeqrfp,CGEQRFP) -#define LAPACK_zgeqrfp LAPACK_GLOBAL(zgeqrfp,ZGEQRFP) -#define LAPACK_clacgv LAPACK_GLOBAL(clacgv,CLACGV) -#define LAPACK_zlacgv LAPACK_GLOBAL(zlacgv,ZLACGV) -#define LAPACK_slarnv LAPACK_GLOBAL(slarnv,SLARNV) -#define LAPACK_dlarnv LAPACK_GLOBAL(dlarnv,DLARNV) -#define LAPACK_clarnv LAPACK_GLOBAL(clarnv,CLARNV) -#define LAPACK_zlarnv LAPACK_GLOBAL(zlarnv,ZLARNV) -#define LAPACK_sgeqr2 LAPACK_GLOBAL(sgeqr2,SGEQR2) -#define LAPACK_dgeqr2 LAPACK_GLOBAL(dgeqr2,DGEQR2) -#define LAPACK_cgeqr2 LAPACK_GLOBAL(cgeqr2,CGEQR2) -#define LAPACK_zgeqr2 LAPACK_GLOBAL(zgeqr2,ZGEQR2) -#define LAPACK_slacpy LAPACK_GLOBAL(slacpy,SLACPY) -#define LAPACK_dlacpy LAPACK_GLOBAL(dlacpy,DLACPY) -#define LAPACK_clacpy LAPACK_GLOBAL(clacpy,CLACPY) -#define LAPACK_zlacpy LAPACK_GLOBAL(zlacpy,ZLACPY) -#define LAPACK_sgetf2 LAPACK_GLOBAL(sgetf2,SGETF2) -#define LAPACK_dgetf2 LAPACK_GLOBAL(dgetf2,DGETF2) -#define LAPACK_cgetf2 LAPACK_GLOBAL(cgetf2,CGETF2) -#define LAPACK_zgetf2 LAPACK_GLOBAL(zgetf2,ZGETF2) -#define LAPACK_slaswp LAPACK_GLOBAL(slaswp,SLASWP) -#define LAPACK_dlaswp LAPACK_GLOBAL(dlaswp,DLASWP) -#define LAPACK_claswp LAPACK_GLOBAL(claswp,CLASWP) -#define LAPACK_zlaswp LAPACK_GLOBAL(zlaswp,ZLASWP) -#define LAPACK_slange LAPACK_GLOBAL(slange,SLANGE) -#define LAPACK_dlange LAPACK_GLOBAL(dlange,DLANGE) -#define LAPACK_clange LAPACK_GLOBAL(clange,CLANGE) -#define LAPACK_zlange LAPACK_GLOBAL(zlange,ZLANGE) -#define LAPACK_clanhe LAPACK_GLOBAL(clanhe,CLANHE) -#define LAPACK_zlanhe LAPACK_GLOBAL(zlanhe,ZLANHE) -#define LAPACK_slansy LAPACK_GLOBAL(slansy,SLANSY) -#define LAPACK_dlansy LAPACK_GLOBAL(dlansy,DLANSY) -#define LAPACK_clansy LAPACK_GLOBAL(clansy,CLANSY) -#define LAPACK_zlansy LAPACK_GLOBAL(zlansy,ZLANSY) -#define LAPACK_slantr LAPACK_GLOBAL(slantr,SLANTR) -#define LAPACK_dlantr LAPACK_GLOBAL(dlantr,DLANTR) -#define LAPACK_clantr LAPACK_GLOBAL(clantr,CLANTR) -#define LAPACK_zlantr LAPACK_GLOBAL(zlantr,ZLANTR) -#define LAPACK_slamch LAPACK_GLOBAL(slamch,SLAMCH) -#define LAPACK_dlamch LAPACK_GLOBAL(dlamch,DLAMCH) -#define LAPACK_sgelq2 LAPACK_GLOBAL(sgelq2,SGELQ2) -#define LAPACK_dgelq2 LAPACK_GLOBAL(dgelq2,DGELQ2) -#define LAPACK_cgelq2 LAPACK_GLOBAL(cgelq2,CGELQ2) -#define LAPACK_zgelq2 LAPACK_GLOBAL(zgelq2,ZGELQ2) -#define LAPACK_slarfb LAPACK_GLOBAL(slarfb,SLARFB) -#define LAPACK_dlarfb LAPACK_GLOBAL(dlarfb,DLARFB) -#define LAPACK_clarfb LAPACK_GLOBAL(clarfb,CLARFB) -#define LAPACK_zlarfb LAPACK_GLOBAL(zlarfb,ZLARFB) -#define LAPACK_slarfg LAPACK_GLOBAL(slarfg,SLARFG) -#define LAPACK_dlarfg LAPACK_GLOBAL(dlarfg,DLARFG) -#define LAPACK_clarfg LAPACK_GLOBAL(clarfg,CLARFG) -#define LAPACK_zlarfg LAPACK_GLOBAL(zlarfg,ZLARFG) -#define LAPACK_slarft LAPACK_GLOBAL(slarft,SLARFT) -#define LAPACK_dlarft LAPACK_GLOBAL(dlarft,DLARFT) -#define LAPACK_clarft LAPACK_GLOBAL(clarft,CLARFT) -#define LAPACK_zlarft LAPACK_GLOBAL(zlarft,ZLARFT) -#define LAPACK_slarfx LAPACK_GLOBAL(slarfx,SLARFX) -#define LAPACK_dlarfx LAPACK_GLOBAL(dlarfx,DLARFX) -#define LAPACK_clarfx LAPACK_GLOBAL(clarfx,CLARFX) -#define LAPACK_zlarfx LAPACK_GLOBAL(zlarfx,ZLARFX) -#define LAPACK_slatms LAPACK_GLOBAL(slatms,SLATMS) -#define LAPACK_dlatms LAPACK_GLOBAL(dlatms,DLATMS) -#define LAPACK_clatms LAPACK_GLOBAL(clatms,CLATMS) -#define LAPACK_zlatms LAPACK_GLOBAL(zlatms,ZLATMS) -#define LAPACK_slag2d LAPACK_GLOBAL(slag2d,SLAG2D) -#define LAPACK_dlag2s LAPACK_GLOBAL(dlag2s,DLAG2S) -#define LAPACK_clag2z LAPACK_GLOBAL(clag2z,CLAG2Z) -#define LAPACK_zlag2c LAPACK_GLOBAL(zlag2c,ZLAG2C) -#define LAPACK_slauum LAPACK_GLOBAL(slauum,SLAUUM) -#define LAPACK_dlauum LAPACK_GLOBAL(dlauum,DLAUUM) -#define LAPACK_clauum LAPACK_GLOBAL(clauum,CLAUUM) -#define LAPACK_zlauum LAPACK_GLOBAL(zlauum,ZLAUUM) -#define LAPACK_slagge LAPACK_GLOBAL(slagge,SLAGGE) -#define LAPACK_dlagge LAPACK_GLOBAL(dlagge,DLAGGE) -#define LAPACK_clagge LAPACK_GLOBAL(clagge,CLAGGE) -#define LAPACK_zlagge LAPACK_GLOBAL(zlagge,ZLAGGE) -#define LAPACK_slaset LAPACK_GLOBAL(slaset,SLASET) -#define LAPACK_dlaset LAPACK_GLOBAL(dlaset,DLASET) -#define LAPACK_claset LAPACK_GLOBAL(claset,CLASET) -#define LAPACK_zlaset LAPACK_GLOBAL(zlaset,ZLASET) -#define LAPACK_slasrt LAPACK_GLOBAL(slasrt,SLASRT) -#define LAPACK_dlasrt LAPACK_GLOBAL(dlasrt,DLASRT) -#define LAPACK_slagsy LAPACK_GLOBAL(slagsy,SLAGSY) -#define LAPACK_dlagsy LAPACK_GLOBAL(dlagsy,DLAGSY) -#define LAPACK_clagsy LAPACK_GLOBAL(clagsy,CLAGSY) -#define LAPACK_zlagsy LAPACK_GLOBAL(zlagsy,ZLAGSY) -#define LAPACK_claghe LAPACK_GLOBAL(claghe,CLAGHE) -#define LAPACK_zlaghe LAPACK_GLOBAL(zlaghe,ZLAGHE) -#define LAPACK_slapmr LAPACK_GLOBAL(slapmr,SLAPMR) -#define LAPACK_dlapmr LAPACK_GLOBAL(dlapmr,DLAPMR) -#define LAPACK_clapmr LAPACK_GLOBAL(clapmr,CLAPMR) -#define LAPACK_zlapmr LAPACK_GLOBAL(zlapmr,ZLAPMR) -#define LAPACK_slapy2 LAPACK_GLOBAL(slapy2,SLAPY2) -#define LAPACK_dlapy2 LAPACK_GLOBAL(dlapy2,DLAPY2) -#define LAPACK_slapy3 LAPACK_GLOBAL(slapy3,SLAPY3) -#define LAPACK_dlapy3 LAPACK_GLOBAL(dlapy3,DLAPY3) -#define LAPACK_slartgp LAPACK_GLOBAL(slartgp,SLARTGP) -#define LAPACK_dlartgp LAPACK_GLOBAL(dlartgp,DLARTGP) -#define LAPACK_slartgs LAPACK_GLOBAL(slartgs,SLARTGS) -#define LAPACK_dlartgs LAPACK_GLOBAL(dlartgs,DLARTGS) -// LAPACK 3.3.0 -#define LAPACK_cbbcsd LAPACK_GLOBAL(cbbcsd,CBBCSD) -#define LAPACK_cheswapr LAPACK_GLOBAL(cheswapr,CHESWAPR) -#define LAPACK_chetri2 LAPACK_GLOBAL(chetri2,CHETRI2) -#define LAPACK_chetri2x LAPACK_GLOBAL(chetri2x,CHETRI2X) -#define LAPACK_chetrs2 LAPACK_GLOBAL(chetrs2,CHETRS2) -#define LAPACK_csyconv LAPACK_GLOBAL(csyconv,CSYCONV) -#define LAPACK_csyswapr LAPACK_GLOBAL(csyswapr,CSYSWAPR) -#define LAPACK_csytri2 LAPACK_GLOBAL(csytri2,CSYTRI2) -#define LAPACK_csytri2x LAPACK_GLOBAL(csytri2x,CSYTRI2X) -#define LAPACK_csytrs2 LAPACK_GLOBAL(csytrs2,CSYTRS2) -#define LAPACK_cunbdb LAPACK_GLOBAL(cunbdb,CUNBDB) -#define LAPACK_cuncsd LAPACK_GLOBAL(cuncsd,CUNCSD) -#define LAPACK_dbbcsd LAPACK_GLOBAL(dbbcsd,DBBCSD) -#define LAPACK_dorbdb LAPACK_GLOBAL(dorbdb,DORBDB) -#define LAPACK_dorcsd LAPACK_GLOBAL(dorcsd,DORCSD) -#define LAPACK_dsyconv LAPACK_GLOBAL(dsyconv,DSYCONV) -#define LAPACK_dsyswapr LAPACK_GLOBAL(dsyswapr,DSYSWAPR) -#define LAPACK_dsytri2 LAPACK_GLOBAL(dsytri2,DSYTRI2) -#define LAPACK_dsytri2x LAPACK_GLOBAL(dsytri2x,DSYTRI2X) -#define LAPACK_dsytrs2 LAPACK_GLOBAL(dsytrs2,DSYTRS2) -#define LAPACK_sbbcsd LAPACK_GLOBAL(sbbcsd,SBBCSD) -#define LAPACK_sorbdb LAPACK_GLOBAL(sorbdb,SORBDB) -#define LAPACK_sorcsd LAPACK_GLOBAL(sorcsd,SORCSD) -#define LAPACK_ssyconv LAPACK_GLOBAL(ssyconv,SSYCONV) -#define LAPACK_ssyswapr LAPACK_GLOBAL(ssyswapr,SSYSWAPR) -#define LAPACK_ssytri2 LAPACK_GLOBAL(ssytri2,SSYTRI2) -#define LAPACK_ssytri2x LAPACK_GLOBAL(ssytri2x,SSYTRI2X) -#define LAPACK_ssytrs2 LAPACK_GLOBAL(ssytrs2,SSYTRS2) -#define LAPACK_zbbcsd LAPACK_GLOBAL(zbbcsd,ZBBCSD) -#define LAPACK_zheswapr LAPACK_GLOBAL(zheswapr,ZHESWAPR) -#define LAPACK_zhetri2 LAPACK_GLOBAL(zhetri2,ZHETRI2) -#define LAPACK_zhetri2x LAPACK_GLOBAL(zhetri2x,ZHETRI2X) -#define LAPACK_zhetrs2 LAPACK_GLOBAL(zhetrs2,ZHETRS2) -#define LAPACK_zsyconv LAPACK_GLOBAL(zsyconv,ZSYCONV) -#define LAPACK_zsyswapr LAPACK_GLOBAL(zsyswapr,ZSYSWAPR) -#define LAPACK_zsytri2 LAPACK_GLOBAL(zsytri2,ZSYTRI2) -#define LAPACK_zsytri2x LAPACK_GLOBAL(zsytri2x,ZSYTRI2X) -#define LAPACK_zsytrs2 LAPACK_GLOBAL(zsytrs2,ZSYTRS2) -#define LAPACK_zunbdb LAPACK_GLOBAL(zunbdb,ZUNBDB) -#define LAPACK_zuncsd LAPACK_GLOBAL(zuncsd,ZUNCSD) -// LAPACK 3.4.0 -#define LAPACK_sgemqrt LAPACK_GLOBAL(sgemqrt,SGEMQRT) -#define LAPACK_dgemqrt LAPACK_GLOBAL(dgemqrt,DGEMQRT) -#define LAPACK_cgemqrt LAPACK_GLOBAL(cgemqrt,CGEMQRT) -#define LAPACK_zgemqrt LAPACK_GLOBAL(zgemqrt,ZGEMQRT) -#define LAPACK_sgeqrt LAPACK_GLOBAL(sgeqrt,SGEQRT) -#define LAPACK_dgeqrt LAPACK_GLOBAL(dgeqrt,DGEQRT) -#define LAPACK_cgeqrt LAPACK_GLOBAL(cgeqrt,CGEQRT) -#define LAPACK_zgeqrt LAPACK_GLOBAL(zgeqrt,ZGEQRT) -#define LAPACK_sgeqrt2 LAPACK_GLOBAL(sgeqrt2,SGEQRT2) -#define LAPACK_dgeqrt2 LAPACK_GLOBAL(dgeqrt2,DGEQRT2) -#define LAPACK_cgeqrt2 LAPACK_GLOBAL(cgeqrt2,CGEQRT2) -#define LAPACK_zgeqrt2 LAPACK_GLOBAL(zgeqrt2,ZGEQRT2) -#define LAPACK_sgeqrt3 LAPACK_GLOBAL(sgeqrt3,SGEQRT3) -#define LAPACK_dgeqrt3 LAPACK_GLOBAL(dgeqrt3,DGEQRT3) -#define LAPACK_cgeqrt3 LAPACK_GLOBAL(cgeqrt3,CGEQRT3) -#define LAPACK_zgeqrt3 LAPACK_GLOBAL(zgeqrt3,ZGEQRT3) -#define LAPACK_stpmqrt LAPACK_GLOBAL(stpmqrt,STPMQRT) -#define LAPACK_dtpmqrt LAPACK_GLOBAL(dtpmqrt,DTPMQRT) -#define LAPACK_ctpmqrt LAPACK_GLOBAL(ctpmqrt,CTPMQRT) -#define LAPACK_ztpmqrt LAPACK_GLOBAL(ztpmqrt,ZTPMQRT) -#define LAPACK_dtpqrt LAPACK_GLOBAL(dtpqrt,DTPQRT) -#define LAPACK_ctpqrt LAPACK_GLOBAL(ctpqrt,CTPQRT) -#define LAPACK_ztpqrt LAPACK_GLOBAL(ztpqrt,ZTPQRT) -#define LAPACK_stpqrt2 LAPACK_GLOBAL(stpqrt2,STPQRT2) -#define LAPACK_dtpqrt2 LAPACK_GLOBAL(dtpqrt2,DTPQRT2) -#define LAPACK_ctpqrt2 LAPACK_GLOBAL(ctpqrt2,CTPQRT2) -#define LAPACK_ztpqrt2 LAPACK_GLOBAL(ztpqrt2,ZTPQRT2) -#define LAPACK_stprfb LAPACK_GLOBAL(stprfb,STPRFB) -#define LAPACK_dtprfb LAPACK_GLOBAL(dtprfb,DTPRFB) -#define LAPACK_ctprfb LAPACK_GLOBAL(ctprfb,CTPRFB) -#define LAPACK_ztprfb LAPACK_GLOBAL(ztprfb,ZTPRFB) -// LAPACK 3.X.X -#define LAPACK_csyr LAPACK_GLOBAL(csyr,CSYR) -#define LAPACK_zsyr LAPACK_GLOBAL(zsyr,ZSYR) - - -void LAPACK_sgetrf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_dgetrf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_cgetrf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* ipiv, lapack_int *info ); -void LAPACK_zgetrf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* ipiv, lapack_int *info ); -void LAPACK_sgbtrf( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, float* ab, lapack_int* ldab, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_dgbtrf( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, double* ab, lapack_int* ldab, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_cgbtrf( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_complex_float* ab, lapack_int* ldab, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_zgbtrf( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_complex_double* ab, lapack_int* ldab, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_sgttrf( lapack_int* n, float* dl, float* d, float* du, float* du2, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_dgttrf( lapack_int* n, double* dl, double* d, double* du, - double* du2, lapack_int* ipiv, lapack_int *info ); -void LAPACK_cgttrf( lapack_int* n, lapack_complex_float* dl, - lapack_complex_float* d, lapack_complex_float* du, - lapack_complex_float* du2, lapack_int* ipiv, - lapack_int *info ); -void LAPACK_zgttrf( lapack_int* n, lapack_complex_double* dl, - lapack_complex_double* d, lapack_complex_double* du, - lapack_complex_double* du2, lapack_int* ipiv, - lapack_int *info ); -void LAPACK_spotrf( char* uplo, lapack_int* n, float* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_dpotrf( char* uplo, lapack_int* n, double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_cpotrf( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_zpotrf( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_dpstrf( char* uplo, lapack_int* n, double* a, lapack_int* lda, - lapack_int* piv, lapack_int* rank, double* tol, - double* work, lapack_int *info ); -void LAPACK_spstrf( char* uplo, lapack_int* n, float* a, lapack_int* lda, - lapack_int* piv, lapack_int* rank, float* tol, float* work, - lapack_int *info ); -void LAPACK_zpstrf( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* piv, lapack_int* rank, - double* tol, double* work, lapack_int *info ); -void LAPACK_cpstrf( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* piv, lapack_int* rank, - float* tol, float* work, lapack_int *info ); -void LAPACK_dpftrf( char* transr, char* uplo, lapack_int* n, double* a, - lapack_int *info ); -void LAPACK_spftrf( char* transr, char* uplo, lapack_int* n, float* a, - lapack_int *info ); -void LAPACK_zpftrf( char* transr, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int *info ); -void LAPACK_cpftrf( char* transr, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int *info ); -void LAPACK_spptrf( char* uplo, lapack_int* n, float* ap, lapack_int *info ); -void LAPACK_dpptrf( char* uplo, lapack_int* n, double* ap, lapack_int *info ); -void LAPACK_cpptrf( char* uplo, lapack_int* n, lapack_complex_float* ap, - lapack_int *info ); -void LAPACK_zpptrf( char* uplo, lapack_int* n, lapack_complex_double* ap, - lapack_int *info ); -void LAPACK_spbtrf( char* uplo, lapack_int* n, lapack_int* kd, float* ab, - lapack_int* ldab, lapack_int *info ); -void LAPACK_dpbtrf( char* uplo, lapack_int* n, lapack_int* kd, double* ab, - lapack_int* ldab, lapack_int *info ); -void LAPACK_cpbtrf( char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_float* ab, lapack_int* ldab, - lapack_int *info ); -void LAPACK_zpbtrf( char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_double* ab, lapack_int* ldab, - lapack_int *info ); -void LAPACK_spttrf( lapack_int* n, float* d, float* e, lapack_int *info ); -void LAPACK_dpttrf( lapack_int* n, double* d, double* e, lapack_int *info ); -void LAPACK_cpttrf( lapack_int* n, float* d, lapack_complex_float* e, - lapack_int *info ); -void LAPACK_zpttrf( lapack_int* n, double* d, lapack_complex_double* e, - lapack_int *info ); -void LAPACK_ssytrf( char* uplo, lapack_int* n, float* a, lapack_int* lda, - lapack_int* ipiv, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dsytrf( char* uplo, lapack_int* n, double* a, lapack_int* lda, - lapack_int* ipiv, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_csytrf( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* ipiv, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zsytrf( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* ipiv, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_chetrf( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* ipiv, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zhetrf( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* ipiv, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_ssptrf( char* uplo, lapack_int* n, float* ap, lapack_int* ipiv, - lapack_int *info ); -void LAPACK_dsptrf( char* uplo, lapack_int* n, double* ap, lapack_int* ipiv, - lapack_int *info ); -void LAPACK_csptrf( char* uplo, lapack_int* n, lapack_complex_float* ap, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_zsptrf( char* uplo, lapack_int* n, lapack_complex_double* ap, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_chptrf( char* uplo, lapack_int* n, lapack_complex_float* ap, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_zhptrf( char* uplo, lapack_int* n, lapack_complex_double* ap, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_sgetrs( char* trans, lapack_int* n, lapack_int* nrhs, - const float* a, lapack_int* lda, const lapack_int* ipiv, - float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_dgetrs( char* trans, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const lapack_int* ipiv, - double* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_cgetrs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zgetrs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_sgbtrs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const float* ab, lapack_int* ldab, - const lapack_int* ipiv, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dgbtrs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const double* ab, lapack_int* ldab, - const lapack_int* ipiv, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cgbtrs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const lapack_complex_float* ab, - lapack_int* ldab, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zgbtrs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const lapack_complex_double* ab, - lapack_int* ldab, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_sgttrs( char* trans, lapack_int* n, lapack_int* nrhs, - const float* dl, const float* d, const float* du, - const float* du2, const lapack_int* ipiv, float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dgttrs( char* trans, lapack_int* n, lapack_int* nrhs, - const double* dl, const double* d, const double* du, - const double* du2, const lapack_int* ipiv, double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_cgttrs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* du2, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zgttrs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* du2, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_spotrs( char* uplo, lapack_int* n, lapack_int* nrhs, const float* a, - lapack_int* lda, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dpotrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_cpotrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zpotrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dpftrs( char* transr, char* uplo, lapack_int* n, lapack_int* nrhs, - const double* a, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_spftrs( char* transr, char* uplo, lapack_int* n, lapack_int* nrhs, - const float* a, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zpftrs( char* transr, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_cpftrs( char* transr, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_spptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const float* ap, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dpptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* ap, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cpptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zpptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_spbtrs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const float* ab, lapack_int* ldab, float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dpbtrs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const double* ab, lapack_int* ldab, double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_cpbtrs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const lapack_complex_float* ab, lapack_int* ldab, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zpbtrs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_spttrs( lapack_int* n, lapack_int* nrhs, const float* d, - const float* e, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dpttrs( lapack_int* n, lapack_int* nrhs, const double* d, - const double* e, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cpttrs( char* uplo, lapack_int* n, lapack_int* nrhs, const float* d, - const lapack_complex_float* e, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zpttrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* d, const lapack_complex_double* e, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_ssytrs( char* uplo, lapack_int* n, lapack_int* nrhs, const float* a, - lapack_int* lda, const lapack_int* ipiv, float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dsytrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const lapack_int* ipiv, - double* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_csytrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zsytrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_chetrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zhetrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_ssptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const float* ap, const lapack_int* ipiv, float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dsptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* ap, const lapack_int* ipiv, double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_csptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zsptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_chptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zhptrs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, const lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_strtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const float* a, lapack_int* lda, float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dtrtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const double* a, lapack_int* lda, - double* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_ctrtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_ztrtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_stptrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const float* ap, float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dtptrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const double* ap, double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_ctptrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_float* ap, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_ztptrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_double* ap, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_stbtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, const float* ab, - lapack_int* ldab, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dtbtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, const double* ab, - lapack_int* ldab, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_ctbtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, - const lapack_complex_float* ab, lapack_int* ldab, - lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_ztbtrs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, - const lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_sgecon( char* norm, lapack_int* n, const float* a, lapack_int* lda, - float* anorm, float* rcond, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgecon( char* norm, lapack_int* n, const double* a, lapack_int* lda, - double* anorm, double* rcond, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_cgecon( char* norm, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* anorm, float* rcond, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zgecon( char* norm, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, double* anorm, double* rcond, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sgbcon( char* norm, lapack_int* n, lapack_int* kl, lapack_int* ku, - const float* ab, lapack_int* ldab, const lapack_int* ipiv, - float* anorm, float* rcond, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgbcon( char* norm, lapack_int* n, lapack_int* kl, lapack_int* ku, - const double* ab, lapack_int* ldab, const lapack_int* ipiv, - double* anorm, double* rcond, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_cgbcon( char* norm, lapack_int* n, lapack_int* kl, lapack_int* ku, - const lapack_complex_float* ab, lapack_int* ldab, - const lapack_int* ipiv, float* anorm, float* rcond, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zgbcon( char* norm, lapack_int* n, lapack_int* kl, lapack_int* ku, - const lapack_complex_double* ab, lapack_int* ldab, - const lapack_int* ipiv, double* anorm, double* rcond, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sgtcon( char* norm, lapack_int* n, const float* dl, const float* d, - const float* du, const float* du2, const lapack_int* ipiv, - float* anorm, float* rcond, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgtcon( char* norm, lapack_int* n, const double* dl, - const double* d, const double* du, const double* du2, - const lapack_int* ipiv, double* anorm, double* rcond, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cgtcon( char* norm, lapack_int* n, const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* du2, const lapack_int* ipiv, - float* anorm, float* rcond, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zgtcon( char* norm, lapack_int* n, const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* du2, const lapack_int* ipiv, - double* anorm, double* rcond, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_spocon( char* uplo, lapack_int* n, const float* a, lapack_int* lda, - float* anorm, float* rcond, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dpocon( char* uplo, lapack_int* n, const double* a, lapack_int* lda, - double* anorm, double* rcond, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_cpocon( char* uplo, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* anorm, float* rcond, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zpocon( char* uplo, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, double* anorm, double* rcond, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sppcon( char* uplo, lapack_int* n, const float* ap, float* anorm, - float* rcond, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dppcon( char* uplo, lapack_int* n, const double* ap, double* anorm, - double* rcond, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cppcon( char* uplo, lapack_int* n, const lapack_complex_float* ap, - float* anorm, float* rcond, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zppcon( char* uplo, lapack_int* n, const lapack_complex_double* ap, - double* anorm, double* rcond, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_spbcon( char* uplo, lapack_int* n, lapack_int* kd, const float* ab, - lapack_int* ldab, float* anorm, float* rcond, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dpbcon( char* uplo, lapack_int* n, lapack_int* kd, const double* ab, - lapack_int* ldab, double* anorm, double* rcond, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cpbcon( char* uplo, lapack_int* n, lapack_int* kd, - const lapack_complex_float* ab, lapack_int* ldab, - float* anorm, float* rcond, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zpbcon( char* uplo, lapack_int* n, lapack_int* kd, - const lapack_complex_double* ab, lapack_int* ldab, - double* anorm, double* rcond, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_sptcon( lapack_int* n, const float* d, const float* e, float* anorm, - float* rcond, float* work, lapack_int *info ); -void LAPACK_dptcon( lapack_int* n, const double* d, const double* e, - double* anorm, double* rcond, double* work, - lapack_int *info ); -void LAPACK_cptcon( lapack_int* n, const float* d, - const lapack_complex_float* e, float* anorm, float* rcond, - float* work, lapack_int *info ); -void LAPACK_zptcon( lapack_int* n, const double* d, - const lapack_complex_double* e, double* anorm, - double* rcond, double* work, lapack_int *info ); -void LAPACK_ssycon( char* uplo, lapack_int* n, const float* a, lapack_int* lda, - const lapack_int* ipiv, float* anorm, float* rcond, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dsycon( char* uplo, lapack_int* n, const double* a, lapack_int* lda, - const lapack_int* ipiv, double* anorm, double* rcond, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_csycon( char* uplo, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, float* anorm, - float* rcond, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zsycon( char* uplo, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, const lapack_int* ipiv, double* anorm, - double* rcond, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_checon( char* uplo, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, float* anorm, - float* rcond, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zhecon( char* uplo, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, const lapack_int* ipiv, double* anorm, - double* rcond, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_sspcon( char* uplo, lapack_int* n, const float* ap, - const lapack_int* ipiv, float* anorm, float* rcond, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dspcon( char* uplo, lapack_int* n, const double* ap, - const lapack_int* ipiv, double* anorm, double* rcond, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cspcon( char* uplo, lapack_int* n, const lapack_complex_float* ap, - const lapack_int* ipiv, float* anorm, float* rcond, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zspcon( char* uplo, lapack_int* n, const lapack_complex_double* ap, - const lapack_int* ipiv, double* anorm, double* rcond, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_chpcon( char* uplo, lapack_int* n, const lapack_complex_float* ap, - const lapack_int* ipiv, float* anorm, float* rcond, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zhpcon( char* uplo, lapack_int* n, const lapack_complex_double* ap, - const lapack_int* ipiv, double* anorm, double* rcond, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_strcon( char* norm, char* uplo, char* diag, lapack_int* n, - const float* a, lapack_int* lda, float* rcond, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dtrcon( char* norm, char* uplo, char* diag, lapack_int* n, - const double* a, lapack_int* lda, double* rcond, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_ctrcon( char* norm, char* uplo, char* diag, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, - float* rcond, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztrcon( char* norm, char* uplo, char* diag, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, - double* rcond, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_stpcon( char* norm, char* uplo, char* diag, lapack_int* n, - const float* ap, float* rcond, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dtpcon( char* norm, char* uplo, char* diag, lapack_int* n, - const double* ap, double* rcond, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ctpcon( char* norm, char* uplo, char* diag, lapack_int* n, - const lapack_complex_float* ap, float* rcond, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztpcon( char* norm, char* uplo, char* diag, lapack_int* n, - const lapack_complex_double* ap, double* rcond, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_stbcon( char* norm, char* uplo, char* diag, lapack_int* n, - lapack_int* kd, const float* ab, lapack_int* ldab, - float* rcond, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dtbcon( char* norm, char* uplo, char* diag, lapack_int* n, - lapack_int* kd, const double* ab, lapack_int* ldab, - double* rcond, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_ctbcon( char* norm, char* uplo, char* diag, lapack_int* n, - lapack_int* kd, const lapack_complex_float* ab, - lapack_int* ldab, float* rcond, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_ztbcon( char* norm, char* uplo, char* diag, lapack_int* n, - lapack_int* kd, const lapack_complex_double* ab, - lapack_int* ldab, double* rcond, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sgerfs( char* trans, lapack_int* n, lapack_int* nrhs, - const float* a, lapack_int* lda, const float* af, - lapack_int* ldaf, const lapack_int* ipiv, const float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* ferr, - float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgerfs( char* trans, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const double* af, - lapack_int* ldaf, const lapack_int* ipiv, const double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cgerfs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zgerfs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_dgerfsx( char* trans, char* equed, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const double* af, - lapack_int* ldaf, const lapack_int* ipiv, const double* r, - const double* c, const double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* rcond, double* berr, - lapack_int* n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int* nparams, double* params, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_sgerfsx( char* trans, char* equed, lapack_int* n, lapack_int* nrhs, - const float* a, lapack_int* lda, const float* af, - lapack_int* ldaf, const lapack_int* ipiv, const float* r, - const float* c, const float* b, lapack_int* ldb, float* x, - lapack_int* ldx, float* rcond, float* berr, - lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_zgerfsx( char* trans, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_int* ipiv, const double* r, const double* c, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cgerfsx( char* trans, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_int* ipiv, const float* r, const float* c, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* berr, lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_sgbrfs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const float* ab, lapack_int* ldab, - const float* afb, lapack_int* ldafb, const lapack_int* ipiv, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgbrfs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const double* ab, lapack_int* ldab, - const double* afb, lapack_int* ldafb, - const lapack_int* ipiv, const double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* ferr, double* berr, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cgbrfs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const lapack_complex_float* ab, - lapack_int* ldab, const lapack_complex_float* afb, - lapack_int* ldafb, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zgbrfs( char* trans, lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, const lapack_complex_double* ab, - lapack_int* ldab, const lapack_complex_double* afb, - lapack_int* ldafb, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_dgbrfsx( char* trans, char* equed, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, const double* ab, - lapack_int* ldab, const double* afb, lapack_int* ldafb, - const lapack_int* ipiv, const double* r, const double* c, - const double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* rcond, double* berr, - lapack_int* n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int* nparams, double* params, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_sgbrfsx( char* trans, char* equed, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, const float* ab, - lapack_int* ldab, const float* afb, lapack_int* ldafb, - const lapack_int* ipiv, const float* r, const float* c, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* rcond, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_zgbrfsx( char* trans, char* equed, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, - const lapack_complex_double* ab, lapack_int* ldab, - const lapack_complex_double* afb, lapack_int* ldafb, - const lapack_int* ipiv, const double* r, const double* c, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cgbrfsx( char* trans, char* equed, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, - const lapack_complex_float* ab, lapack_int* ldab, - const lapack_complex_float* afb, lapack_int* ldafb, - const lapack_int* ipiv, const float* r, const float* c, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* berr, lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_sgtrfs( char* trans, lapack_int* n, lapack_int* nrhs, - const float* dl, const float* d, const float* du, - const float* dlf, const float* df, const float* duf, - const float* du2, const lapack_int* ipiv, const float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* ferr, - float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgtrfs( char* trans, lapack_int* n, lapack_int* nrhs, - const double* dl, const double* d, const double* du, - const double* dlf, const double* df, const double* duf, - const double* du2, const lapack_int* ipiv, const double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cgtrfs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, - const lapack_complex_float* dlf, - const lapack_complex_float* df, - const lapack_complex_float* duf, - const lapack_complex_float* du2, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zgtrfs( char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, - const lapack_complex_double* dlf, - const lapack_complex_double* df, - const lapack_complex_double* duf, - const lapack_complex_double* du2, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sporfs( char* uplo, lapack_int* n, lapack_int* nrhs, const float* a, - lapack_int* lda, const float* af, lapack_int* ldaf, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dporfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const double* af, - lapack_int* ldaf, const double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* ferr, double* berr, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cporfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zporfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_dporfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const double* af, - lapack_int* ldaf, const double* s, const double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* rcond, - double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_sporfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const float* a, lapack_int* lda, const float* af, - lapack_int* ldaf, const float* s, const float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* berr, lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_zporfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const double* s, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cporfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const float* s, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_spprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const float* ap, const float* afp, const float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* ferr, - float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dpprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* ap, const double* afp, const double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cpprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, - const lapack_complex_float* afp, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zpprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* afp, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_spbrfs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const float* ab, lapack_int* ldab, const float* afb, - lapack_int* ldafb, const float* b, lapack_int* ldb, - float* x, lapack_int* ldx, float* ferr, float* berr, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dpbrfs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const double* ab, lapack_int* ldab, const double* afb, - lapack_int* ldafb, const double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* ferr, double* berr, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cpbrfs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const lapack_complex_float* ab, lapack_int* ldab, - const lapack_complex_float* afb, lapack_int* ldafb, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zpbrfs( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - const lapack_complex_double* ab, lapack_int* ldab, - const lapack_complex_double* afb, lapack_int* ldafb, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sptrfs( lapack_int* n, lapack_int* nrhs, const float* d, - const float* e, const float* df, const float* ef, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* ferr, float* berr, float* work, lapack_int *info ); -void LAPACK_dptrfs( lapack_int* n, lapack_int* nrhs, const double* d, - const double* e, const double* df, const double* ef, - const double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* ferr, double* berr, double* work, - lapack_int *info ); -void LAPACK_cptrfs( char* uplo, lapack_int* n, lapack_int* nrhs, const float* d, - const lapack_complex_float* e, const float* df, - const lapack_complex_float* ef, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zptrfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* d, const lapack_complex_double* e, - const double* df, const lapack_complex_double* ef, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_ssyrfs( char* uplo, lapack_int* n, lapack_int* nrhs, const float* a, - lapack_int* lda, const float* af, lapack_int* ldaf, - const lapack_int* ipiv, const float* b, lapack_int* ldb, - float* x, lapack_int* ldx, float* ferr, float* berr, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dsyrfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const double* af, - lapack_int* ldaf, const lapack_int* ipiv, const double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_csyrfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zsyrfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_dsyrfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, const double* af, - lapack_int* ldaf, const lapack_int* ipiv, const double* s, - const double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* rcond, double* berr, - lapack_int* n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int* nparams, double* params, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_ssyrfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const float* a, lapack_int* lda, const float* af, - lapack_int* ldaf, const lapack_int* ipiv, const float* s, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* rcond, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_zsyrfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_int* ipiv, const double* s, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_csyrfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_int* ipiv, const float* s, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* berr, lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_cherfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zherfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_zherfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* af, lapack_int* ldaf, - const lapack_int* ipiv, const double* s, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cherfsx( char* uplo, char* equed, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* af, lapack_int* ldaf, - const lapack_int* ipiv, const float* s, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* berr, lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ssprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const float* ap, const float* afp, const lapack_int* ipiv, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dsprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const double* ap, const double* afp, const lapack_int* ipiv, - const double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* ferr, double* berr, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_csprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, - const lapack_complex_float* afp, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zsprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* afp, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_chprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, - const lapack_complex_float* afp, const lapack_int* ipiv, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zhprfs( char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, - const lapack_complex_double* afp, const lapack_int* ipiv, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* ferr, - double* berr, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_strrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const float* a, lapack_int* lda, - const float* b, lapack_int* ldb, const float* x, - lapack_int* ldx, float* ferr, float* berr, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dtrrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const double* a, lapack_int* lda, - const double* b, lapack_int* ldb, const double* x, - lapack_int* ldx, double* ferr, double* berr, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ctrrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* b, - lapack_int* ldb, const lapack_complex_float* x, - lapack_int* ldx, float* ferr, float* berr, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztrrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* b, - lapack_int* ldb, const lapack_complex_double* x, - lapack_int* ldx, double* ferr, double* berr, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_stprfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const float* ap, const float* b, - lapack_int* ldb, const float* x, lapack_int* ldx, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dtprfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const double* ap, const double* b, - lapack_int* ldb, const double* x, lapack_int* ldx, - double* ferr, double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_ctprfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_float* ap, - const lapack_complex_float* b, lapack_int* ldb, - const lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztprfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* nrhs, const lapack_complex_double* ap, - const lapack_complex_double* b, lapack_int* ldb, - const lapack_complex_double* x, lapack_int* ldx, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_stbrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, const float* ab, - lapack_int* ldab, const float* b, lapack_int* ldb, - const float* x, lapack_int* ldx, float* ferr, float* berr, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dtbrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, const double* ab, - lapack_int* ldab, const double* b, lapack_int* ldb, - const double* x, lapack_int* ldx, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_ctbrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, - const lapack_complex_float* ab, lapack_int* ldab, - const lapack_complex_float* b, lapack_int* ldb, - const lapack_complex_float* x, lapack_int* ldx, float* ferr, - float* berr, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztbrfs( char* uplo, char* trans, char* diag, lapack_int* n, - lapack_int* kd, lapack_int* nrhs, - const lapack_complex_double* ab, lapack_int* ldab, - const lapack_complex_double* b, lapack_int* ldb, - const lapack_complex_double* x, lapack_int* ldx, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_sgetri( lapack_int* n, float* a, lapack_int* lda, - const lapack_int* ipiv, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgetri( lapack_int* n, double* a, lapack_int* lda, - const lapack_int* ipiv, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgetri( lapack_int* n, lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zgetri( lapack_int* n, lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_spotri( char* uplo, lapack_int* n, float* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_dpotri( char* uplo, lapack_int* n, double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_cpotri( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_zpotri( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_dpftri( char* transr, char* uplo, lapack_int* n, double* a, - lapack_int *info ); -void LAPACK_spftri( char* transr, char* uplo, lapack_int* n, float* a, - lapack_int *info ); -void LAPACK_zpftri( char* transr, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int *info ); -void LAPACK_cpftri( char* transr, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int *info ); -void LAPACK_spptri( char* uplo, lapack_int* n, float* ap, lapack_int *info ); -void LAPACK_dpptri( char* uplo, lapack_int* n, double* ap, lapack_int *info ); -void LAPACK_cpptri( char* uplo, lapack_int* n, lapack_complex_float* ap, - lapack_int *info ); -void LAPACK_zpptri( char* uplo, lapack_int* n, lapack_complex_double* ap, - lapack_int *info ); -void LAPACK_ssytri( char* uplo, lapack_int* n, float* a, lapack_int* lda, - const lapack_int* ipiv, float* work, lapack_int *info ); -void LAPACK_dsytri( char* uplo, lapack_int* n, double* a, lapack_int* lda, - const lapack_int* ipiv, double* work, lapack_int *info ); -void LAPACK_csytri( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zsytri( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_chetri( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zhetri( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_ssptri( char* uplo, lapack_int* n, float* ap, - const lapack_int* ipiv, float* work, lapack_int *info ); -void LAPACK_dsptri( char* uplo, lapack_int* n, double* ap, - const lapack_int* ipiv, double* work, lapack_int *info ); -void LAPACK_csptri( char* uplo, lapack_int* n, lapack_complex_float* ap, - const lapack_int* ipiv, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zsptri( char* uplo, lapack_int* n, lapack_complex_double* ap, - const lapack_int* ipiv, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_chptri( char* uplo, lapack_int* n, lapack_complex_float* ap, - const lapack_int* ipiv, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zhptri( char* uplo, lapack_int* n, lapack_complex_double* ap, - const lapack_int* ipiv, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_strtri( char* uplo, char* diag, lapack_int* n, float* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_dtrtri( char* uplo, char* diag, lapack_int* n, double* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_ctrtri( char* uplo, char* diag, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_ztrtri( char* uplo, char* diag, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_dtftri( char* transr, char* uplo, char* diag, lapack_int* n, - double* a, lapack_int *info ); -void LAPACK_stftri( char* transr, char* uplo, char* diag, lapack_int* n, - float* a, lapack_int *info ); -void LAPACK_ztftri( char* transr, char* uplo, char* diag, lapack_int* n, - lapack_complex_double* a, lapack_int *info ); -void LAPACK_ctftri( char* transr, char* uplo, char* diag, lapack_int* n, - lapack_complex_float* a, lapack_int *info ); -void LAPACK_stptri( char* uplo, char* diag, lapack_int* n, float* ap, - lapack_int *info ); -void LAPACK_dtptri( char* uplo, char* diag, lapack_int* n, double* ap, - lapack_int *info ); -void LAPACK_ctptri( char* uplo, char* diag, lapack_int* n, - lapack_complex_float* ap, lapack_int *info ); -void LAPACK_ztptri( char* uplo, char* diag, lapack_int* n, - lapack_complex_double* ap, lapack_int *info ); -void LAPACK_sgeequ( lapack_int* m, lapack_int* n, const float* a, - lapack_int* lda, float* r, float* c, float* rowcnd, - float* colcnd, float* amax, lapack_int *info ); -void LAPACK_dgeequ( lapack_int* m, lapack_int* n, const double* a, - lapack_int* lda, double* r, double* c, double* rowcnd, - double* colcnd, double* amax, lapack_int *info ); -void LAPACK_cgeequ( lapack_int* m, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* r, float* c, float* rowcnd, - float* colcnd, float* amax, lapack_int *info ); -void LAPACK_zgeequ( lapack_int* m, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, double* r, - double* c, double* rowcnd, double* colcnd, double* amax, - lapack_int *info ); -void LAPACK_dgeequb( lapack_int* m, lapack_int* n, const double* a, - lapack_int* lda, double* r, double* c, double* rowcnd, - double* colcnd, double* amax, lapack_int *info ); -void LAPACK_sgeequb( lapack_int* m, lapack_int* n, const float* a, - lapack_int* lda, float* r, float* c, float* rowcnd, - float* colcnd, float* amax, lapack_int *info ); -void LAPACK_zgeequb( lapack_int* m, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, double* r, - double* c, double* rowcnd, double* colcnd, double* amax, - lapack_int *info ); -void LAPACK_cgeequb( lapack_int* m, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, float* r, - float* c, float* rowcnd, float* colcnd, float* amax, - lapack_int *info ); -void LAPACK_sgbequ( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const float* ab, lapack_int* ldab, float* r, - float* c, float* rowcnd, float* colcnd, float* amax, - lapack_int *info ); -void LAPACK_dgbequ( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const double* ab, lapack_int* ldab, - double* r, double* c, double* rowcnd, double* colcnd, - double* amax, lapack_int *info ); -void LAPACK_cgbequ( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const lapack_complex_float* ab, - lapack_int* ldab, float* r, float* c, float* rowcnd, - float* colcnd, float* amax, lapack_int *info ); -void LAPACK_zgbequ( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const lapack_complex_double* ab, - lapack_int* ldab, double* r, double* c, double* rowcnd, - double* colcnd, double* amax, lapack_int *info ); -void LAPACK_dgbequb( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const double* ab, lapack_int* ldab, - double* r, double* c, double* rowcnd, double* colcnd, - double* amax, lapack_int *info ); -void LAPACK_sgbequb( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const float* ab, lapack_int* ldab, - float* r, float* c, float* rowcnd, float* colcnd, - float* amax, lapack_int *info ); -void LAPACK_zgbequb( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const lapack_complex_double* ab, - lapack_int* ldab, double* r, double* c, double* rowcnd, - double* colcnd, double* amax, lapack_int *info ); -void LAPACK_cgbequb( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const lapack_complex_float* ab, - lapack_int* ldab, float* r, float* c, float* rowcnd, - float* colcnd, float* amax, lapack_int *info ); -void LAPACK_spoequ( lapack_int* n, const float* a, lapack_int* lda, float* s, - float* scond, float* amax, lapack_int *info ); -void LAPACK_dpoequ( lapack_int* n, const double* a, lapack_int* lda, double* s, - double* scond, double* amax, lapack_int *info ); -void LAPACK_cpoequ( lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* s, float* scond, float* amax, - lapack_int *info ); -void LAPACK_zpoequ( lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, double* s, double* scond, double* amax, - lapack_int *info ); -void LAPACK_dpoequb( lapack_int* n, const double* a, lapack_int* lda, double* s, - double* scond, double* amax, lapack_int *info ); -void LAPACK_spoequb( lapack_int* n, const float* a, lapack_int* lda, float* s, - float* scond, float* amax, lapack_int *info ); -void LAPACK_zpoequb( lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, double* s, double* scond, double* amax, - lapack_int *info ); -void LAPACK_cpoequb( lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* s, float* scond, float* amax, - lapack_int *info ); -void LAPACK_sppequ( char* uplo, lapack_int* n, const float* ap, float* s, - float* scond, float* amax, lapack_int *info ); -void LAPACK_dppequ( char* uplo, lapack_int* n, const double* ap, double* s, - double* scond, double* amax, lapack_int *info ); -void LAPACK_cppequ( char* uplo, lapack_int* n, const lapack_complex_float* ap, - float* s, float* scond, float* amax, lapack_int *info ); -void LAPACK_zppequ( char* uplo, lapack_int* n, const lapack_complex_double* ap, - double* s, double* scond, double* amax, lapack_int *info ); -void LAPACK_spbequ( char* uplo, lapack_int* n, lapack_int* kd, const float* ab, - lapack_int* ldab, float* s, float* scond, float* amax, - lapack_int *info ); -void LAPACK_dpbequ( char* uplo, lapack_int* n, lapack_int* kd, const double* ab, - lapack_int* ldab, double* s, double* scond, double* amax, - lapack_int *info ); -void LAPACK_cpbequ( char* uplo, lapack_int* n, lapack_int* kd, - const lapack_complex_float* ab, lapack_int* ldab, float* s, - float* scond, float* amax, lapack_int *info ); -void LAPACK_zpbequ( char* uplo, lapack_int* n, lapack_int* kd, - const lapack_complex_double* ab, lapack_int* ldab, - double* s, double* scond, double* amax, lapack_int *info ); -void LAPACK_dsyequb( char* uplo, lapack_int* n, const double* a, - lapack_int* lda, double* s, double* scond, double* amax, - double* work, lapack_int *info ); -void LAPACK_ssyequb( char* uplo, lapack_int* n, const float* a, lapack_int* lda, - float* s, float* scond, float* amax, float* work, - lapack_int *info ); -void LAPACK_zsyequb( char* uplo, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, double* s, double* scond, double* amax, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_csyequb( char* uplo, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* s, float* scond, float* amax, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zheequb( char* uplo, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, double* s, double* scond, double* amax, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_cheequb( char* uplo, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, float* s, float* scond, float* amax, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_sgesv( lapack_int* n, lapack_int* nrhs, float* a, lapack_int* lda, - lapack_int* ipiv, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dgesv( lapack_int* n, lapack_int* nrhs, double* a, lapack_int* lda, - lapack_int* ipiv, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cgesv( lapack_int* n, lapack_int* nrhs, lapack_complex_float* a, - lapack_int* lda, lapack_int* ipiv, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zgesv( lapack_int* n, lapack_int* nrhs, lapack_complex_double* a, - lapack_int* lda, lapack_int* ipiv, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_dsgesv( lapack_int* n, lapack_int* nrhs, double* a, lapack_int* lda, - lapack_int* ipiv, double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* work, float* swork, - lapack_int* iter, lapack_int *info ); -void LAPACK_zcgesv( lapack_int* n, lapack_int* nrhs, lapack_complex_double* a, - lapack_int* lda, lapack_int* ipiv, lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - lapack_complex_double* work, lapack_complex_float* swork, - double* rwork, lapack_int* iter, lapack_int *info ); -void LAPACK_sgesvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - float* a, lapack_int* lda, float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgesvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - double* a, lapack_int* lda, double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - double* b, lapack_int* ldb, double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_cgesvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zgesvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_dgesvxx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - double* a, lapack_int* lda, double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - double* b, lapack_int* ldb, double* x, lapack_int* ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int* n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int* nparams, double* params, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_sgesvxx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - float* a, lapack_int* lda, float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_zgesvxx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* r, double* c, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cgesvxx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* r, float* c, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_sgbsv( lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, float* ab, lapack_int* ldab, - lapack_int* ipiv, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dgbsv( lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, double* ab, lapack_int* ldab, - lapack_int* ipiv, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cgbsv( lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, lapack_complex_float* ab, lapack_int* ldab, - lapack_int* ipiv, lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zgbsv( lapack_int* n, lapack_int* kl, lapack_int* ku, - lapack_int* nrhs, lapack_complex_double* ab, - lapack_int* ldab, lapack_int* ipiv, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_sgbsvx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, float* ab, - lapack_int* ldab, float* afb, lapack_int* ldafb, - lapack_int* ipiv, char* equed, float* r, float* c, float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgbsvx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, double* ab, - lapack_int* ldab, double* afb, lapack_int* ldafb, - lapack_int* ipiv, char* equed, double* r, double* c, - double* b, lapack_int* ldb, double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_cgbsvx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, lapack_complex_float* ab, - lapack_int* ldab, lapack_complex_float* afb, - lapack_int* ldafb, lapack_int* ipiv, char* equed, float* r, - float* c, lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zgbsvx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, lapack_complex_double* ab, - lapack_int* ldab, lapack_complex_double* afb, - lapack_int* ldafb, lapack_int* ipiv, char* equed, double* r, - double* c, lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_dgbsvxx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, double* ab, - lapack_int* ldab, double* afb, lapack_int* ldafb, - lapack_int* ipiv, char* equed, double* r, double* c, - double* b, lapack_int* ldb, double* x, lapack_int* ldx, - double* rcond, double* rpvgrw, double* berr, - lapack_int* n_err_bnds, double* err_bnds_norm, - double* err_bnds_comp, lapack_int* nparams, double* params, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_sgbsvxx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, float* ab, - lapack_int* ldab, float* afb, lapack_int* ldafb, - lapack_int* ipiv, char* equed, float* r, float* c, - float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* rcond, float* rpvgrw, float* berr, - lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_zgbsvxx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, - lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* afb, lapack_int* ldafb, - lapack_int* ipiv, char* equed, double* r, double* c, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cgbsvxx( char* fact, char* trans, lapack_int* n, lapack_int* kl, - lapack_int* ku, lapack_int* nrhs, lapack_complex_float* ab, - lapack_int* ldab, lapack_complex_float* afb, - lapack_int* ldafb, lapack_int* ipiv, char* equed, float* r, - float* c, lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_sgtsv( lapack_int* n, lapack_int* nrhs, float* dl, float* d, - float* du, float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_dgtsv( lapack_int* n, lapack_int* nrhs, double* dl, double* d, - double* du, double* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_cgtsv( lapack_int* n, lapack_int* nrhs, lapack_complex_float* dl, - lapack_complex_float* d, lapack_complex_float* du, - lapack_complex_float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_zgtsv( lapack_int* n, lapack_int* nrhs, lapack_complex_double* dl, - lapack_complex_double* d, lapack_complex_double* du, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_sgtsvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - const float* dl, const float* d, const float* du, - float* dlf, float* df, float* duf, float* du2, - lapack_int* ipiv, const float* b, lapack_int* ldb, float* x, - lapack_int* ldx, float* rcond, float* ferr, float* berr, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dgtsvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - const double* dl, const double* d, const double* du, - double* dlf, double* df, double* duf, double* du2, - lapack_int* ipiv, const double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* rcond, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cgtsvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* dl, - const lapack_complex_float* d, - const lapack_complex_float* du, lapack_complex_float* dlf, - lapack_complex_float* df, lapack_complex_float* duf, - lapack_complex_float* du2, lapack_int* ipiv, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zgtsvx( char* fact, char* trans, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* dl, - const lapack_complex_double* d, - const lapack_complex_double* du, lapack_complex_double* dlf, - lapack_complex_double* df, lapack_complex_double* duf, - lapack_complex_double* du2, lapack_int* ipiv, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_sposv( char* uplo, lapack_int* n, lapack_int* nrhs, float* a, - lapack_int* lda, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dposv( char* uplo, lapack_int* n, lapack_int* nrhs, double* a, - lapack_int* lda, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cposv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_zposv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dsposv( char* uplo, lapack_int* n, lapack_int* nrhs, double* a, - lapack_int* lda, double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* work, float* swork, - lapack_int* iter, lapack_int *info ); -void LAPACK_zcposv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, - lapack_complex_double* work, lapack_complex_float* swork, - double* rwork, lapack_int* iter, lapack_int *info ); -void LAPACK_sposvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - float* a, lapack_int* lda, float* af, lapack_int* ldaf, - char* equed, float* s, float* b, lapack_int* ldb, float* x, - lapack_int* ldx, float* rcond, float* ferr, float* berr, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dposvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - double* a, lapack_int* lda, double* af, lapack_int* ldaf, - char* equed, double* s, double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* rcond, double* ferr, - double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cposvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, char* equed, - float* s, lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zposvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, char* equed, - double* s, lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_dposvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - double* a, lapack_int* lda, double* af, lapack_int* ldaf, - char* equed, double* s, double* b, lapack_int* ldb, - double* x, lapack_int* ldx, double* rcond, double* rpvgrw, - double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_sposvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - float* a, lapack_int* lda, float* af, lapack_int* ldaf, - char* equed, float* s, float* b, lapack_int* ldb, float* x, - lapack_int* ldx, float* rcond, float* rpvgrw, float* berr, - lapack_int* n_err_bnds, float* err_bnds_norm, - float* err_bnds_comp, lapack_int* nparams, float* params, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_zposvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, char* equed, - double* s, lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_cposvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, char* equed, - float* s, lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_sppsv( char* uplo, lapack_int* n, lapack_int* nrhs, float* ap, - float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_dppsv( char* uplo, lapack_int* n, lapack_int* nrhs, double* ap, - double* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_cppsv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* ap, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zppsv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* ap, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_sppsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - float* ap, float* afp, char* equed, float* s, float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dppsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - double* ap, double* afp, char* equed, double* s, double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cppsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* ap, lapack_complex_float* afp, - char* equed, float* s, lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zppsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* ap, lapack_complex_double* afp, - char* equed, double* s, lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_spbsv( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - float* ab, lapack_int* ldab, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dpbsv( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - double* ab, lapack_int* ldab, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cpbsv( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - lapack_complex_float* ab, lapack_int* ldab, - lapack_complex_float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_zpbsv( char* uplo, lapack_int* n, lapack_int* kd, lapack_int* nrhs, - lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_spbsvx( char* fact, char* uplo, lapack_int* n, lapack_int* kd, - lapack_int* nrhs, float* ab, lapack_int* ldab, float* afb, - lapack_int* ldafb, char* equed, float* s, float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dpbsvx( char* fact, char* uplo, lapack_int* n, lapack_int* kd, - lapack_int* nrhs, double* ab, lapack_int* ldab, double* afb, - lapack_int* ldafb, char* equed, double* s, double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_cpbsvx( char* fact, char* uplo, lapack_int* n, lapack_int* kd, - lapack_int* nrhs, lapack_complex_float* ab, - lapack_int* ldab, lapack_complex_float* afb, - lapack_int* ldafb, char* equed, float* s, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zpbsvx( char* fact, char* uplo, lapack_int* n, lapack_int* kd, - lapack_int* nrhs, lapack_complex_double* ab, - lapack_int* ldab, lapack_complex_double* afb, - lapack_int* ldafb, char* equed, double* s, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_sptsv( lapack_int* n, lapack_int* nrhs, float* d, float* e, - float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_dptsv( lapack_int* n, lapack_int* nrhs, double* d, double* e, - double* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_cptsv( lapack_int* n, lapack_int* nrhs, float* d, - lapack_complex_float* e, lapack_complex_float* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_zptsv( lapack_int* n, lapack_int* nrhs, double* d, - lapack_complex_double* e, lapack_complex_double* b, - lapack_int* ldb, lapack_int *info ); -void LAPACK_sptsvx( char* fact, lapack_int* n, lapack_int* nrhs, const float* d, - const float* e, float* df, float* ef, const float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, float* work, lapack_int *info ); -void LAPACK_dptsvx( char* fact, lapack_int* n, lapack_int* nrhs, - const double* d, const double* e, double* df, double* ef, - const double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* rcond, double* ferr, double* berr, - double* work, lapack_int *info ); -void LAPACK_cptsvx( char* fact, lapack_int* n, lapack_int* nrhs, const float* d, - const lapack_complex_float* e, float* df, - lapack_complex_float* ef, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zptsvx( char* fact, lapack_int* n, lapack_int* nrhs, - const double* d, const lapack_complex_double* e, double* df, - lapack_complex_double* ef, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_ssysv( char* uplo, lapack_int* n, lapack_int* nrhs, float* a, - lapack_int* lda, lapack_int* ipiv, float* b, lapack_int* ldb, - float* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_dsysv( char* uplo, lapack_int* n, lapack_int* nrhs, double* a, - lapack_int* lda, lapack_int* ipiv, double* b, - lapack_int* ldb, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_csysv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zsysv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_ssysvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const float* a, lapack_int* lda, float* af, - lapack_int* ldaf, lapack_int* ipiv, const float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* ferr, float* berr, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dsysvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const double* a, lapack_int* lda, double* af, - lapack_int* ldaf, lapack_int* ipiv, const double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* rcond, - double* ferr, double* berr, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_csysvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zsysvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, - lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_dsysvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - double* a, lapack_int* lda, double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* s, double* b, - lapack_int* ldb, double* x, lapack_int* ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ssysvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - float* a, lapack_int* lda, float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* s, float* b, - lapack_int* ldb, float* x, lapack_int* ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_zsysvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* s, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_csysvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* s, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_chesv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zhesv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_chesvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zhesvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, - lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_zhesvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, double* s, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* x, lapack_int* ldx, double* rcond, - double* rpvgrw, double* berr, lapack_int* n_err_bnds, - double* err_bnds_norm, double* err_bnds_comp, - lapack_int* nparams, double* params, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_chesvxx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* af, lapack_int* ldaf, - lapack_int* ipiv, char* equed, float* s, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* x, lapack_int* ldx, float* rcond, - float* rpvgrw, float* berr, lapack_int* n_err_bnds, - float* err_bnds_norm, float* err_bnds_comp, - lapack_int* nparams, float* params, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_sspsv( char* uplo, lapack_int* n, lapack_int* nrhs, float* ap, - lapack_int* ipiv, float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dspsv( char* uplo, lapack_int* n, lapack_int* nrhs, double* ap, - lapack_int* ipiv, double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_cspsv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* ap, lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_zspsv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* ap, lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_sspsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const float* ap, float* afp, lapack_int* ipiv, - const float* b, lapack_int* ldb, float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, float* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dspsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const double* ap, double* afp, lapack_int* ipiv, - const double* b, lapack_int* ldb, double* x, - lapack_int* ldx, double* rcond, double* ferr, double* berr, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cspsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, lapack_complex_float* afp, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zspsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, lapack_complex_double* afp, - lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_chpsv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* ap, lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, lapack_int *info ); -void LAPACK_zhpsv( char* uplo, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* ap, lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_chpsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_float* ap, lapack_complex_float* afp, - lapack_int* ipiv, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* x, lapack_int* ldx, - float* rcond, float* ferr, float* berr, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zhpsvx( char* fact, char* uplo, lapack_int* n, lapack_int* nrhs, - const lapack_complex_double* ap, lapack_complex_double* afp, - lapack_int* ipiv, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* x, lapack_int* ldx, - double* rcond, double* ferr, double* berr, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sgeqrf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgeqrf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgeqrf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgeqrf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgeqpf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - lapack_int* jpvt, float* tau, float* work, - lapack_int *info ); -void LAPACK_dgeqpf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - lapack_int* jpvt, double* tau, double* work, - lapack_int *info ); -void LAPACK_cgeqpf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* jpvt, - lapack_complex_float* tau, lapack_complex_float* work, - float* rwork, lapack_int *info ); -void LAPACK_zgeqpf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* jpvt, - lapack_complex_double* tau, lapack_complex_double* work, - double* rwork, lapack_int *info ); -void LAPACK_sgeqp3( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - lapack_int* jpvt, float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dgeqp3( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - lapack_int* jpvt, double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cgeqp3( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* jpvt, - lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int *info ); -void LAPACK_zgeqp3( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* jpvt, - lapack_complex_double* tau, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int *info ); -void LAPACK_sorgqr( lapack_int* m, lapack_int* n, lapack_int* k, float* a, - lapack_int* lda, const float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dorgqr( lapack_int* m, lapack_int* n, lapack_int* k, double* a, - lapack_int* lda, const double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sormqr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const float* a, lapack_int* lda, - const float* tau, float* c, lapack_int* ldc, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dormqr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const double* a, lapack_int* lda, - const double* tau, double* c, lapack_int* ldc, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cungqr( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zungqr( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunmqr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmqr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgelqf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgelqf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgelqf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgelqf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sorglq( lapack_int* m, lapack_int* n, lapack_int* k, float* a, - lapack_int* lda, const float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dorglq( lapack_int* m, lapack_int* n, lapack_int* k, double* a, - lapack_int* lda, const double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sormlq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const float* a, lapack_int* lda, - const float* tau, float* c, lapack_int* ldc, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dormlq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const double* a, lapack_int* lda, - const double* tau, double* c, lapack_int* ldc, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cunglq( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zunglq( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunmlq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmlq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgeqlf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgeqlf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgeqlf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgeqlf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sorgql( lapack_int* m, lapack_int* n, lapack_int* k, float* a, - lapack_int* lda, const float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dorgql( lapack_int* m, lapack_int* n, lapack_int* k, double* a, - lapack_int* lda, const double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cungql( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zungql( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sormql( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const float* a, lapack_int* lda, - const float* tau, float* c, lapack_int* ldc, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dormql( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const double* a, lapack_int* lda, - const double* tau, double* c, lapack_int* ldc, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cunmql( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmql( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgerqf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgerqf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgerqf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgerqf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sorgrq( lapack_int* m, lapack_int* n, lapack_int* k, float* a, - lapack_int* lda, const float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dorgrq( lapack_int* m, lapack_int* n, lapack_int* k, double* a, - lapack_int* lda, const double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cungrq( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zungrq( lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sormrq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const float* a, lapack_int* lda, - const float* tau, float* c, lapack_int* ldc, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dormrq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const double* a, lapack_int* lda, - const double* tau, double* c, lapack_int* ldc, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cunmrq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmrq( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_stzrzf( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dtzrzf( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_ctzrzf( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_ztzrzf( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sormrz( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, const float* a, - lapack_int* lda, const float* tau, float* c, - lapack_int* ldc, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dormrz( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, const double* a, - lapack_int* lda, const double* tau, double* c, - lapack_int* ldc, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunmrz( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmrz( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, lapack_complex_double* c, - lapack_int* ldc, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sggqrf( lapack_int* n, lapack_int* m, lapack_int* p, float* a, - lapack_int* lda, float* taua, float* b, lapack_int* ldb, - float* taub, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dggqrf( lapack_int* n, lapack_int* m, lapack_int* p, double* a, - lapack_int* lda, double* taua, double* b, lapack_int* ldb, - double* taub, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cggqrf( lapack_int* n, lapack_int* m, lapack_int* p, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* taua, lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* taub, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zggqrf( lapack_int* n, lapack_int* m, lapack_int* p, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* taua, lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* taub, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sggrqf( lapack_int* m, lapack_int* p, lapack_int* n, float* a, - lapack_int* lda, float* taua, float* b, lapack_int* ldb, - float* taub, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dggrqf( lapack_int* m, lapack_int* p, lapack_int* n, double* a, - lapack_int* lda, double* taua, double* b, lapack_int* ldb, - double* taub, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cggrqf( lapack_int* m, lapack_int* p, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* taua, lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* taub, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zggrqf( lapack_int* m, lapack_int* p, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* taua, lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* taub, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgebrd( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* d, float* e, float* tauq, float* taup, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dgebrd( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* d, double* e, double* tauq, double* taup, - double* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_cgebrd( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, float* d, float* e, - lapack_complex_float* tauq, lapack_complex_float* taup, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgebrd( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, double* d, double* e, - lapack_complex_double* tauq, lapack_complex_double* taup, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgbbrd( char* vect, lapack_int* m, lapack_int* n, lapack_int* ncc, - lapack_int* kl, lapack_int* ku, float* ab, lapack_int* ldab, - float* d, float* e, float* q, lapack_int* ldq, float* pt, - lapack_int* ldpt, float* c, lapack_int* ldc, float* work, - lapack_int *info ); -void LAPACK_dgbbrd( char* vect, lapack_int* m, lapack_int* n, lapack_int* ncc, - lapack_int* kl, lapack_int* ku, double* ab, - lapack_int* ldab, double* d, double* e, double* q, - lapack_int* ldq, double* pt, lapack_int* ldpt, double* c, - lapack_int* ldc, double* work, lapack_int *info ); -void LAPACK_cgbbrd( char* vect, lapack_int* m, lapack_int* n, lapack_int* ncc, - lapack_int* kl, lapack_int* ku, lapack_complex_float* ab, - lapack_int* ldab, float* d, float* e, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* pt, lapack_int* ldpt, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zgbbrd( char* vect, lapack_int* m, lapack_int* n, lapack_int* ncc, - lapack_int* kl, lapack_int* ku, lapack_complex_double* ab, - lapack_int* ldab, double* d, double* e, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* pt, lapack_int* ldpt, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sorgbr( char* vect, lapack_int* m, lapack_int* n, lapack_int* k, - float* a, lapack_int* lda, const float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dorgbr( char* vect, lapack_int* m, lapack_int* n, lapack_int* k, - double* a, lapack_int* lda, const double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sormbr( char* vect, char* side, char* trans, lapack_int* m, - lapack_int* n, lapack_int* k, const float* a, - lapack_int* lda, const float* tau, float* c, - lapack_int* ldc, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dormbr( char* vect, char* side, char* trans, lapack_int* m, - lapack_int* n, lapack_int* k, const double* a, - lapack_int* lda, const double* tau, double* c, - lapack_int* ldc, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cungbr( char* vect, lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zungbr( char* vect, lapack_int* m, lapack_int* n, lapack_int* k, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunmbr( char* vect, char* side, char* trans, lapack_int* m, - lapack_int* n, lapack_int* k, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmbr( char* vect, char* side, char* trans, lapack_int* m, - lapack_int* n, lapack_int* k, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, lapack_complex_double* c, - lapack_int* ldc, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sbdsqr( char* uplo, lapack_int* n, lapack_int* ncvt, - lapack_int* nru, lapack_int* ncc, float* d, float* e, - float* vt, lapack_int* ldvt, float* u, lapack_int* ldu, - float* c, lapack_int* ldc, float* work, lapack_int *info ); -void LAPACK_dbdsqr( char* uplo, lapack_int* n, lapack_int* ncvt, - lapack_int* nru, lapack_int* ncc, double* d, double* e, - double* vt, lapack_int* ldvt, double* u, lapack_int* ldu, - double* c, lapack_int* ldc, double* work, - lapack_int *info ); -void LAPACK_cbdsqr( char* uplo, lapack_int* n, lapack_int* ncvt, - lapack_int* nru, lapack_int* ncc, float* d, float* e, - lapack_complex_float* vt, lapack_int* ldvt, - lapack_complex_float* u, lapack_int* ldu, - lapack_complex_float* c, lapack_int* ldc, float* work, - lapack_int *info ); -void LAPACK_zbdsqr( char* uplo, lapack_int* n, lapack_int* ncvt, - lapack_int* nru, lapack_int* ncc, double* d, double* e, - lapack_complex_double* vt, lapack_int* ldvt, - lapack_complex_double* u, lapack_int* ldu, - lapack_complex_double* c, lapack_int* ldc, double* work, - lapack_int *info ); -void LAPACK_sbdsdc( char* uplo, char* compq, lapack_int* n, float* d, float* e, - float* u, lapack_int* ldu, float* vt, lapack_int* ldvt, - float* q, lapack_int* iq, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dbdsdc( char* uplo, char* compq, lapack_int* n, double* d, - double* e, double* u, lapack_int* ldu, double* vt, - lapack_int* ldvt, double* q, lapack_int* iq, double* work, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ssytrd( char* uplo, lapack_int* n, float* a, lapack_int* lda, - float* d, float* e, float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dsytrd( char* uplo, lapack_int* n, double* a, lapack_int* lda, - double* d, double* e, double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sorgtr( char* uplo, lapack_int* n, float* a, lapack_int* lda, - const float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dorgtr( char* uplo, lapack_int* n, double* a, lapack_int* lda, - const double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sormtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const float* a, lapack_int* lda, - const float* tau, float* c, lapack_int* ldc, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dormtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const double* a, lapack_int* lda, - const double* tau, double* c, lapack_int* ldc, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_chetrd( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, float* d, float* e, - lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zhetrd( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, double* d, double* e, - lapack_complex_double* tau, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cungtr( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zungtr( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunmtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zunmtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* tau, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_ssptrd( char* uplo, lapack_int* n, float* ap, float* d, float* e, - float* tau, lapack_int *info ); -void LAPACK_dsptrd( char* uplo, lapack_int* n, double* ap, double* d, double* e, - double* tau, lapack_int *info ); -void LAPACK_sopgtr( char* uplo, lapack_int* n, const float* ap, - const float* tau, float* q, lapack_int* ldq, float* work, - lapack_int *info ); -void LAPACK_dopgtr( char* uplo, lapack_int* n, const double* ap, - const double* tau, double* q, lapack_int* ldq, double* work, - lapack_int *info ); -void LAPACK_sopmtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const float* ap, const float* tau, float* c, - lapack_int* ldc, float* work, lapack_int *info ); -void LAPACK_dopmtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const double* ap, const double* tau, - double* c, lapack_int* ldc, double* work, - lapack_int *info ); -void LAPACK_chptrd( char* uplo, lapack_int* n, lapack_complex_float* ap, - float* d, float* e, lapack_complex_float* tau, - lapack_int *info ); -void LAPACK_zhptrd( char* uplo, lapack_int* n, lapack_complex_double* ap, - double* d, double* e, lapack_complex_double* tau, - lapack_int *info ); -void LAPACK_cupgtr( char* uplo, lapack_int* n, const lapack_complex_float* ap, - const lapack_complex_float* tau, lapack_complex_float* q, - lapack_int* ldq, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zupgtr( char* uplo, lapack_int* n, const lapack_complex_double* ap, - const lapack_complex_double* tau, lapack_complex_double* q, - lapack_int* ldq, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_cupmtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const lapack_complex_float* ap, - const lapack_complex_float* tau, lapack_complex_float* c, - lapack_int* ldc, lapack_complex_float* work, - lapack_int *info ); -void LAPACK_zupmtr( char* side, char* uplo, char* trans, lapack_int* m, - lapack_int* n, const lapack_complex_double* ap, - const lapack_complex_double* tau, lapack_complex_double* c, - lapack_int* ldc, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_ssbtrd( char* vect, char* uplo, lapack_int* n, lapack_int* kd, - float* ab, lapack_int* ldab, float* d, float* e, float* q, - lapack_int* ldq, float* work, lapack_int *info ); -void LAPACK_dsbtrd( char* vect, char* uplo, lapack_int* n, lapack_int* kd, - double* ab, lapack_int* ldab, double* d, double* e, - double* q, lapack_int* ldq, double* work, - lapack_int *info ); -void LAPACK_chbtrd( char* vect, char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_float* ab, lapack_int* ldab, float* d, - float* e, lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zhbtrd( char* vect, char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_double* ab, lapack_int* ldab, double* d, - double* e, lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_ssterf( lapack_int* n, float* d, float* e, lapack_int *info ); -void LAPACK_dsterf( lapack_int* n, double* d, double* e, lapack_int *info ); -void LAPACK_ssteqr( char* compz, lapack_int* n, float* d, float* e, float* z, - lapack_int* ldz, float* work, lapack_int *info ); -void LAPACK_dsteqr( char* compz, lapack_int* n, double* d, double* e, double* z, - lapack_int* ldz, double* work, lapack_int *info ); -void LAPACK_csteqr( char* compz, lapack_int* n, float* d, float* e, - lapack_complex_float* z, lapack_int* ldz, float* work, - lapack_int *info ); -void LAPACK_zsteqr( char* compz, lapack_int* n, double* d, double* e, - lapack_complex_double* z, lapack_int* ldz, double* work, - lapack_int *info ); -void LAPACK_sstemr( char* jobz, char* range, lapack_int* n, float* d, float* e, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - lapack_int* m, float* w, float* z, lapack_int* ldz, - lapack_int* nzc, lapack_int* isuppz, lapack_logical* tryrac, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_dstemr( char* jobz, char* range, lapack_int* n, double* d, - double* e, double* vl, double* vu, lapack_int* il, - lapack_int* iu, lapack_int* m, double* w, double* z, - lapack_int* ldz, lapack_int* nzc, lapack_int* isuppz, - lapack_logical* tryrac, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_cstemr( char* jobz, char* range, lapack_int* n, float* d, float* e, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_int* nzc, lapack_int* isuppz, - lapack_logical* tryrac, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_zstemr( char* jobz, char* range, lapack_int* n, double* d, - double* e, double* vl, double* vu, lapack_int* il, - lapack_int* iu, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int* ldz, lapack_int* nzc, - lapack_int* isuppz, lapack_logical* tryrac, double* work, - lapack_int* lwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_sstedc( char* compz, lapack_int* n, float* d, float* e, float* z, - lapack_int* ldz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dstedc( char* compz, lapack_int* n, double* d, double* e, double* z, - lapack_int* ldz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_cstedc( char* compz, lapack_int* n, float* d, float* e, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zstedc( char* compz, lapack_int* n, double* d, double* e, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_sstegr( char* jobz, char* range, lapack_int* n, float* d, float* e, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - float* abstol, lapack_int* m, float* w, float* z, - lapack_int* ldz, lapack_int* isuppz, float* work, - lapack_int* lwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_dstegr( char* jobz, char* range, lapack_int* n, double* d, - double* e, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, lapack_int* isuppz, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_cstegr( char* jobz, char* range, lapack_int* n, float* d, float* e, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - float* abstol, lapack_int* m, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_int* isuppz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_zstegr( char* jobz, char* range, lapack_int* n, double* d, - double* e, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_int* isuppz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_spteqr( char* compz, lapack_int* n, float* d, float* e, float* z, - lapack_int* ldz, float* work, lapack_int *info ); -void LAPACK_dpteqr( char* compz, lapack_int* n, double* d, double* e, double* z, - lapack_int* ldz, double* work, lapack_int *info ); -void LAPACK_cpteqr( char* compz, lapack_int* n, float* d, float* e, - lapack_complex_float* z, lapack_int* ldz, float* work, - lapack_int *info ); -void LAPACK_zpteqr( char* compz, lapack_int* n, double* d, double* e, - lapack_complex_double* z, lapack_int* ldz, double* work, - lapack_int *info ); -void LAPACK_sstebz( char* range, char* order, lapack_int* n, float* vl, - float* vu, lapack_int* il, lapack_int* iu, float* abstol, - const float* d, const float* e, lapack_int* m, - lapack_int* nsplit, float* w, lapack_int* iblock, - lapack_int* isplit, float* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dstebz( char* range, char* order, lapack_int* n, double* vl, - double* vu, lapack_int* il, lapack_int* iu, double* abstol, - const double* d, const double* e, lapack_int* m, - lapack_int* nsplit, double* w, lapack_int* iblock, - lapack_int* isplit, double* work, lapack_int* iwork, - lapack_int *info ); -void LAPACK_sstein( lapack_int* n, const float* d, const float* e, - lapack_int* m, const float* w, const lapack_int* iblock, - const lapack_int* isplit, float* z, lapack_int* ldz, - float* work, lapack_int* iwork, lapack_int* ifailv, - lapack_int *info ); -void LAPACK_dstein( lapack_int* n, const double* d, const double* e, - lapack_int* m, const double* w, const lapack_int* iblock, - const lapack_int* isplit, double* z, lapack_int* ldz, - double* work, lapack_int* iwork, lapack_int* ifailv, - lapack_int *info ); -void LAPACK_cstein( lapack_int* n, const float* d, const float* e, - lapack_int* m, const float* w, const lapack_int* iblock, - const lapack_int* isplit, lapack_complex_float* z, - lapack_int* ldz, float* work, lapack_int* iwork, - lapack_int* ifailv, lapack_int *info ); -void LAPACK_zstein( lapack_int* n, const double* d, const double* e, - lapack_int* m, const double* w, const lapack_int* iblock, - const lapack_int* isplit, lapack_complex_double* z, - lapack_int* ldz, double* work, lapack_int* iwork, - lapack_int* ifailv, lapack_int *info ); -void LAPACK_sdisna( char* job, lapack_int* m, lapack_int* n, const float* d, - float* sep, lapack_int *info ); -void LAPACK_ddisna( char* job, lapack_int* m, lapack_int* n, const double* d, - double* sep, lapack_int *info ); -void LAPACK_ssygst( lapack_int* itype, char* uplo, lapack_int* n, float* a, - lapack_int* lda, const float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_dsygst( lapack_int* itype, char* uplo, lapack_int* n, double* a, - lapack_int* lda, const double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_chegst( lapack_int* itype, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_zhegst( lapack_int* itype, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* b, lapack_int* ldb, - lapack_int *info ); -void LAPACK_sspgst( lapack_int* itype, char* uplo, lapack_int* n, float* ap, - const float* bp, lapack_int *info ); -void LAPACK_dspgst( lapack_int* itype, char* uplo, lapack_int* n, double* ap, - const double* bp, lapack_int *info ); -void LAPACK_chpgst( lapack_int* itype, char* uplo, lapack_int* n, - lapack_complex_float* ap, const lapack_complex_float* bp, - lapack_int *info ); -void LAPACK_zhpgst( lapack_int* itype, char* uplo, lapack_int* n, - lapack_complex_double* ap, const lapack_complex_double* bp, - lapack_int *info ); -void LAPACK_ssbgst( char* vect, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, float* ab, lapack_int* ldab, - const float* bb, lapack_int* ldbb, float* x, - lapack_int* ldx, float* work, lapack_int *info ); -void LAPACK_dsbgst( char* vect, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, double* ab, lapack_int* ldab, - const double* bb, lapack_int* ldbb, double* x, - lapack_int* ldx, double* work, lapack_int *info ); -void LAPACK_chbgst( char* vect, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, lapack_complex_float* ab, lapack_int* ldab, - const lapack_complex_float* bb, lapack_int* ldbb, - lapack_complex_float* x, lapack_int* ldx, - lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zhbgst( char* vect, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, lapack_complex_double* ab, lapack_int* ldab, - const lapack_complex_double* bb, lapack_int* ldbb, - lapack_complex_double* x, lapack_int* ldx, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_spbstf( char* uplo, lapack_int* n, lapack_int* kb, float* bb, - lapack_int* ldbb, lapack_int *info ); -void LAPACK_dpbstf( char* uplo, lapack_int* n, lapack_int* kb, double* bb, - lapack_int* ldbb, lapack_int *info ); -void LAPACK_cpbstf( char* uplo, lapack_int* n, lapack_int* kb, - lapack_complex_float* bb, lapack_int* ldbb, - lapack_int *info ); -void LAPACK_zpbstf( char* uplo, lapack_int* n, lapack_int* kb, - lapack_complex_double* bb, lapack_int* ldbb, - lapack_int *info ); -void LAPACK_sgehrd( lapack_int* n, lapack_int* ilo, lapack_int* ihi, float* a, - lapack_int* lda, float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgehrd( lapack_int* n, lapack_int* ilo, lapack_int* ihi, double* a, - lapack_int* lda, double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cgehrd( lapack_int* n, lapack_int* ilo, lapack_int* ihi, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zgehrd( lapack_int* n, lapack_int* ilo, lapack_int* ihi, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* tau, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sorghr( lapack_int* n, lapack_int* ilo, lapack_int* ihi, float* a, - lapack_int* lda, const float* tau, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dorghr( lapack_int* n, lapack_int* ilo, lapack_int* ihi, double* a, - lapack_int* lda, const double* tau, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sormhr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, const float* a, - lapack_int* lda, const float* tau, float* c, - lapack_int* ldc, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dormhr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, const double* a, - lapack_int* lda, const double* tau, double* c, - lapack_int* ldc, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunghr( lapack_int* n, lapack_int* ilo, lapack_int* ihi, - lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zunghr( lapack_int* n, lapack_int* ilo, lapack_int* ihi, - lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cunmhr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* tau, lapack_complex_float* c, - lapack_int* ldc, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zunmhr( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* tau, lapack_complex_double* c, - lapack_int* ldc, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sgebal( char* job, lapack_int* n, float* a, lapack_int* lda, - lapack_int* ilo, lapack_int* ihi, float* scale, - lapack_int *info ); -void LAPACK_dgebal( char* job, lapack_int* n, double* a, lapack_int* lda, - lapack_int* ilo, lapack_int* ihi, double* scale, - lapack_int *info ); -void LAPACK_cgebal( char* job, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* ilo, lapack_int* ihi, - float* scale, lapack_int *info ); -void LAPACK_zgebal( char* job, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* ilo, lapack_int* ihi, - double* scale, lapack_int *info ); -void LAPACK_sgebak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const float* scale, lapack_int* m, - float* v, lapack_int* ldv, lapack_int *info ); -void LAPACK_dgebak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const double* scale, lapack_int* m, - double* v, lapack_int* ldv, lapack_int *info ); -void LAPACK_cgebak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const float* scale, lapack_int* m, - lapack_complex_float* v, lapack_int* ldv, - lapack_int *info ); -void LAPACK_zgebak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const double* scale, lapack_int* m, - lapack_complex_double* v, lapack_int* ldv, - lapack_int *info ); -void LAPACK_shseqr( char* job, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, float* h, lapack_int* ldh, float* wr, - float* wi, float* z, lapack_int* ldz, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dhseqr( char* job, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, double* h, lapack_int* ldh, double* wr, - double* wi, double* z, lapack_int* ldz, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_chseqr( char* job, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, lapack_complex_float* h, lapack_int* ldh, - lapack_complex_float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zhseqr( char* job, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, lapack_complex_double* h, lapack_int* ldh, - lapack_complex_double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_shsein( char* job, char* eigsrc, char* initv, - lapack_logical* select, lapack_int* n, const float* h, - lapack_int* ldh, float* wr, const float* wi, float* vl, - lapack_int* ldvl, float* vr, lapack_int* ldvr, - lapack_int* mm, lapack_int* m, float* work, - lapack_int* ifaill, lapack_int* ifailr, lapack_int *info ); -void LAPACK_dhsein( char* job, char* eigsrc, char* initv, - lapack_logical* select, lapack_int* n, const double* h, - lapack_int* ldh, double* wr, const double* wi, double* vl, - lapack_int* ldvl, double* vr, lapack_int* ldvr, - lapack_int* mm, lapack_int* m, double* work, - lapack_int* ifaill, lapack_int* ifailr, lapack_int *info ); -void LAPACK_chsein( char* job, char* eigsrc, char* initv, - const lapack_logical* select, lapack_int* n, - const lapack_complex_float* h, lapack_int* ldh, - lapack_complex_float* w, lapack_complex_float* vl, - lapack_int* ldvl, lapack_complex_float* vr, - lapack_int* ldvr, lapack_int* mm, lapack_int* m, - lapack_complex_float* work, float* rwork, - lapack_int* ifaill, lapack_int* ifailr, lapack_int *info ); -void LAPACK_zhsein( char* job, char* eigsrc, char* initv, - const lapack_logical* select, lapack_int* n, - const lapack_complex_double* h, lapack_int* ldh, - lapack_complex_double* w, lapack_complex_double* vl, - lapack_int* ldvl, lapack_complex_double* vr, - lapack_int* ldvr, lapack_int* mm, lapack_int* m, - lapack_complex_double* work, double* rwork, - lapack_int* ifaill, lapack_int* ifailr, lapack_int *info ); -void LAPACK_strevc( char* side, char* howmny, lapack_logical* select, - lapack_int* n, const float* t, lapack_int* ldt, float* vl, - lapack_int* ldvl, float* vr, lapack_int* ldvr, - lapack_int* mm, lapack_int* m, float* work, - lapack_int *info ); -void LAPACK_dtrevc( char* side, char* howmny, lapack_logical* select, - lapack_int* n, const double* t, lapack_int* ldt, double* vl, - lapack_int* ldvl, double* vr, lapack_int* ldvr, - lapack_int* mm, lapack_int* m, double* work, - lapack_int *info ); -void LAPACK_ctrevc( char* side, char* howmny, const lapack_logical* select, - lapack_int* n, lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* vl, lapack_int* ldvl, - lapack_complex_float* vr, lapack_int* ldvr, lapack_int* mm, - lapack_int* m, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztrevc( char* side, char* howmny, const lapack_logical* select, - lapack_int* n, lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* vl, lapack_int* ldvl, - lapack_complex_double* vr, lapack_int* ldvr, lapack_int* mm, - lapack_int* m, lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_strsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const float* t, lapack_int* ldt, - const float* vl, lapack_int* ldvl, const float* vr, - lapack_int* ldvr, float* s, float* sep, lapack_int* mm, - lapack_int* m, float* work, lapack_int* ldwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dtrsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const double* t, lapack_int* ldt, - const double* vl, lapack_int* ldvl, const double* vr, - lapack_int* ldvr, double* s, double* sep, lapack_int* mm, - lapack_int* m, double* work, lapack_int* ldwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ctrsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const lapack_complex_float* t, - lapack_int* ldt, const lapack_complex_float* vl, - lapack_int* ldvl, const lapack_complex_float* vr, - lapack_int* ldvr, float* s, float* sep, lapack_int* mm, - lapack_int* m, lapack_complex_float* work, - lapack_int* ldwork, float* rwork, lapack_int *info ); -void LAPACK_ztrsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const lapack_complex_double* t, - lapack_int* ldt, const lapack_complex_double* vl, - lapack_int* ldvl, const lapack_complex_double* vr, - lapack_int* ldvr, double* s, double* sep, lapack_int* mm, - lapack_int* m, lapack_complex_double* work, - lapack_int* ldwork, double* rwork, lapack_int *info ); -void LAPACK_strexc( char* compq, lapack_int* n, float* t, lapack_int* ldt, - float* q, lapack_int* ldq, lapack_int* ifst, - lapack_int* ilst, float* work, lapack_int *info ); -void LAPACK_dtrexc( char* compq, lapack_int* n, double* t, lapack_int* ldt, - double* q, lapack_int* ldq, lapack_int* ifst, - lapack_int* ilst, double* work, lapack_int *info ); -void LAPACK_ctrexc( char* compq, lapack_int* n, lapack_complex_float* t, - lapack_int* ldt, lapack_complex_float* q, lapack_int* ldq, - lapack_int* ifst, lapack_int* ilst, lapack_int *info ); -void LAPACK_ztrexc( char* compq, lapack_int* n, lapack_complex_double* t, - lapack_int* ldt, lapack_complex_double* q, lapack_int* ldq, - lapack_int* ifst, lapack_int* ilst, lapack_int *info ); -void LAPACK_strsen( char* job, char* compq, const lapack_logical* select, - lapack_int* n, float* t, lapack_int* ldt, float* q, - lapack_int* ldq, float* wr, float* wi, lapack_int* m, - float* s, float* sep, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dtrsen( char* job, char* compq, const lapack_logical* select, - lapack_int* n, double* t, lapack_int* ldt, double* q, - lapack_int* ldq, double* wr, double* wi, lapack_int* m, - double* s, double* sep, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_ctrsen( char* job, char* compq, const lapack_logical* select, - lapack_int* n, lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* w, lapack_int* m, float* s, - float* sep, lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_ztrsen( char* job, char* compq, const lapack_logical* select, - lapack_int* n, lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* w, lapack_int* m, double* s, - double* sep, lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_strsyl( char* trana, char* tranb, lapack_int* isgn, lapack_int* m, - lapack_int* n, const float* a, lapack_int* lda, - const float* b, lapack_int* ldb, float* c, lapack_int* ldc, - float* scale, lapack_int *info ); -void LAPACK_dtrsyl( char* trana, char* tranb, lapack_int* isgn, lapack_int* m, - lapack_int* n, const double* a, lapack_int* lda, - const double* b, lapack_int* ldb, double* c, - lapack_int* ldc, double* scale, lapack_int *info ); -void LAPACK_ctrsyl( char* trana, char* tranb, lapack_int* isgn, lapack_int* m, - lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* b, - lapack_int* ldb, lapack_complex_float* c, lapack_int* ldc, - float* scale, lapack_int *info ); -void LAPACK_ztrsyl( char* trana, char* tranb, lapack_int* isgn, lapack_int* m, - lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* b, - lapack_int* ldb, lapack_complex_double* c, lapack_int* ldc, - double* scale, lapack_int *info ); -void LAPACK_sgghrd( char* compq, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, float* a, lapack_int* lda, float* b, - lapack_int* ldb, float* q, lapack_int* ldq, float* z, - lapack_int* ldz, lapack_int *info ); -void LAPACK_dgghrd( char* compq, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, double* a, lapack_int* lda, double* b, - lapack_int* ldb, double* q, lapack_int* ldq, double* z, - lapack_int* ldz, lapack_int *info ); -void LAPACK_cgghrd( char* compq, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* z, lapack_int* ldz, - lapack_int *info ); -void LAPACK_zgghrd( char* compq, char* compz, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* z, lapack_int* ldz, - lapack_int *info ); -void LAPACK_sggbal( char* job, lapack_int* n, float* a, lapack_int* lda, - float* b, lapack_int* ldb, lapack_int* ilo, lapack_int* ihi, - float* lscale, float* rscale, float* work, - lapack_int *info ); -void LAPACK_dggbal( char* job, lapack_int* n, double* a, lapack_int* lda, - double* b, lapack_int* ldb, lapack_int* ilo, - lapack_int* ihi, double* lscale, double* rscale, - double* work, lapack_int *info ); -void LAPACK_cggbal( char* job, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* b, lapack_int* ldb, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale, float* work, lapack_int *info ); -void LAPACK_zggbal( char* job, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* b, lapack_int* ldb, - lapack_int* ilo, lapack_int* ihi, double* lscale, - double* rscale, double* work, lapack_int *info ); -void LAPACK_sggbak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const float* lscale, const float* rscale, - lapack_int* m, float* v, lapack_int* ldv, - lapack_int *info ); -void LAPACK_dggbak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const double* lscale, const double* rscale, - lapack_int* m, double* v, lapack_int* ldv, - lapack_int *info ); -void LAPACK_cggbak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const float* lscale, const float* rscale, - lapack_int* m, lapack_complex_float* v, lapack_int* ldv, - lapack_int *info ); -void LAPACK_zggbak( char* job, char* side, lapack_int* n, lapack_int* ilo, - lapack_int* ihi, const double* lscale, const double* rscale, - lapack_int* m, lapack_complex_double* v, lapack_int* ldv, - lapack_int *info ); -void LAPACK_shgeqz( char* job, char* compq, char* compz, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, float* h, lapack_int* ldh, - float* t, lapack_int* ldt, float* alphar, float* alphai, - float* beta, float* q, lapack_int* ldq, float* z, - lapack_int* ldz, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dhgeqz( char* job, char* compq, char* compz, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, double* h, - lapack_int* ldh, double* t, lapack_int* ldt, double* alphar, - double* alphai, double* beta, double* q, lapack_int* ldq, - double* z, lapack_int* ldz, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_chgeqz( char* job, char* compq, char* compz, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, lapack_complex_float* h, - lapack_int* ldh, lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zhgeqz( char* job, char* compq, char* compz, lapack_int* n, - lapack_int* ilo, lapack_int* ihi, lapack_complex_double* h, - lapack_int* ldh, lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_stgevc( char* side, char* howmny, const lapack_logical* select, - lapack_int* n, const float* s, lapack_int* lds, - const float* p, lapack_int* ldp, float* vl, - lapack_int* ldvl, float* vr, lapack_int* ldvr, - lapack_int* mm, lapack_int* m, float* work, - lapack_int *info ); -void LAPACK_dtgevc( char* side, char* howmny, const lapack_logical* select, - lapack_int* n, const double* s, lapack_int* lds, - const double* p, lapack_int* ldp, double* vl, - lapack_int* ldvl, double* vr, lapack_int* ldvr, - lapack_int* mm, lapack_int* m, double* work, - lapack_int *info ); -void LAPACK_ctgevc( char* side, char* howmny, const lapack_logical* select, - lapack_int* n, const lapack_complex_float* s, - lapack_int* lds, const lapack_complex_float* p, - lapack_int* ldp, lapack_complex_float* vl, lapack_int* ldvl, - lapack_complex_float* vr, lapack_int* ldvr, lapack_int* mm, - lapack_int* m, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_ztgevc( char* side, char* howmny, const lapack_logical* select, - lapack_int* n, const lapack_complex_double* s, - lapack_int* lds, const lapack_complex_double* p, - lapack_int* ldp, lapack_complex_double* vl, - lapack_int* ldvl, lapack_complex_double* vr, - lapack_int* ldvr, lapack_int* mm, lapack_int* m, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_stgexc( lapack_logical* wantq, lapack_logical* wantz, lapack_int* n, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - float* q, lapack_int* ldq, float* z, lapack_int* ldz, - lapack_int* ifst, lapack_int* ilst, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dtgexc( lapack_logical* wantq, lapack_logical* wantz, lapack_int* n, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* q, lapack_int* ldq, double* z, lapack_int* ldz, - lapack_int* ifst, lapack_int* ilst, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_ctgexc( lapack_logical* wantq, lapack_logical* wantz, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* z, lapack_int* ldz, lapack_int* ifst, - lapack_int* ilst, lapack_int *info ); -void LAPACK_ztgexc( lapack_logical* wantq, lapack_logical* wantz, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* z, lapack_int* ldz, lapack_int* ifst, - lapack_int* ilst, lapack_int *info ); -void LAPACK_stgsen( lapack_int* ijob, lapack_logical* wantq, - lapack_logical* wantz, const lapack_logical* select, - lapack_int* n, float* a, lapack_int* lda, float* b, - lapack_int* ldb, float* alphar, float* alphai, float* beta, - float* q, lapack_int* ldq, float* z, lapack_int* ldz, - lapack_int* m, float* pl, float* pr, float* dif, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_dtgsen( lapack_int* ijob, lapack_logical* wantq, - lapack_logical* wantz, const lapack_logical* select, - lapack_int* n, double* a, lapack_int* lda, double* b, - lapack_int* ldb, double* alphar, double* alphai, - double* beta, double* q, lapack_int* ldq, double* z, - lapack_int* ldz, lapack_int* m, double* pl, double* pr, - double* dif, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_ctgsen( lapack_int* ijob, lapack_logical* wantq, - lapack_logical* wantz, const lapack_logical* select, - lapack_int* n, lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* z, lapack_int* ldz, lapack_int* m, - float* pl, float* pr, float* dif, - lapack_complex_float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_ztgsen( lapack_int* ijob, lapack_logical* wantq, - lapack_logical* wantz, const lapack_logical* select, - lapack_int* n, lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* z, lapack_int* ldz, lapack_int* m, - double* pl, double* pr, double* dif, - lapack_complex_double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_stgsyl( char* trans, lapack_int* ijob, lapack_int* m, lapack_int* n, - const float* a, lapack_int* lda, const float* b, - lapack_int* ldb, float* c, lapack_int* ldc, const float* d, - lapack_int* ldd, const float* e, lapack_int* lde, float* f, - lapack_int* ldf, float* scale, float* dif, float* work, - lapack_int* lwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_dtgsyl( char* trans, lapack_int* ijob, lapack_int* m, lapack_int* n, - const double* a, lapack_int* lda, const double* b, - lapack_int* ldb, double* c, lapack_int* ldc, - const double* d, lapack_int* ldd, const double* e, - lapack_int* lde, double* f, lapack_int* ldf, double* scale, - double* dif, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ctgsyl( char* trans, lapack_int* ijob, lapack_int* m, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, - const lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* c, lapack_int* ldc, - const lapack_complex_float* d, lapack_int* ldd, - const lapack_complex_float* e, lapack_int* lde, - lapack_complex_float* f, lapack_int* ldf, float* scale, - float* dif, lapack_complex_float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ztgsyl( char* trans, lapack_int* ijob, lapack_int* m, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, - const lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* c, lapack_int* ldc, - const lapack_complex_double* d, lapack_int* ldd, - const lapack_complex_double* e, lapack_int* lde, - lapack_complex_double* f, lapack_int* ldf, double* scale, - double* dif, lapack_complex_double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_stgsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const float* a, lapack_int* lda, - const float* b, lapack_int* ldb, const float* vl, - lapack_int* ldvl, const float* vr, lapack_int* ldvr, - float* s, float* dif, lapack_int* mm, lapack_int* m, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dtgsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const double* a, lapack_int* lda, - const double* b, lapack_int* ldb, const double* vl, - lapack_int* ldvl, const double* vr, lapack_int* ldvr, - double* s, double* dif, lapack_int* mm, lapack_int* m, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int *info ); -void LAPACK_ctgsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, const lapack_complex_float* b, - lapack_int* ldb, const lapack_complex_float* vl, - lapack_int* ldvl, const lapack_complex_float* vr, - lapack_int* ldvr, float* s, float* dif, lapack_int* mm, - lapack_int* m, lapack_complex_float* work, - lapack_int* lwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_ztgsna( char* job, char* howmny, const lapack_logical* select, - lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, const lapack_complex_double* b, - lapack_int* ldb, const lapack_complex_double* vl, - lapack_int* ldvl, const lapack_complex_double* vr, - lapack_int* ldvr, double* s, double* dif, lapack_int* mm, - lapack_int* m, lapack_complex_double* work, - lapack_int* lwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_sggsvp( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, float* a, lapack_int* lda, - float* b, lapack_int* ldb, float* tola, float* tolb, - lapack_int* k, lapack_int* l, float* u, lapack_int* ldu, - float* v, lapack_int* ldv, float* q, lapack_int* ldq, - lapack_int* iwork, float* tau, float* work, - lapack_int *info ); -void LAPACK_dggsvp( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, double* a, lapack_int* lda, - double* b, lapack_int* ldb, double* tola, double* tolb, - lapack_int* k, lapack_int* l, double* u, lapack_int* ldu, - double* v, lapack_int* ldv, double* q, lapack_int* ldq, - lapack_int* iwork, double* tau, double* work, - lapack_int *info ); -void LAPACK_cggsvp( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* b, lapack_int* ldb, - float* tola, float* tolb, lapack_int* k, lapack_int* l, - lapack_complex_float* u, lapack_int* ldu, - lapack_complex_float* v, lapack_int* ldv, - lapack_complex_float* q, lapack_int* ldq, lapack_int* iwork, - float* rwork, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zggsvp( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* b, lapack_int* ldb, - double* tola, double* tolb, lapack_int* k, lapack_int* l, - lapack_complex_double* u, lapack_int* ldu, - lapack_complex_double* v, lapack_int* ldv, - lapack_complex_double* q, lapack_int* ldq, - lapack_int* iwork, double* rwork, - lapack_complex_double* tau, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_stgsja( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, lapack_int* k, lapack_int* l, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - float* tola, float* tolb, float* alpha, float* beta, - float* u, lapack_int* ldu, float* v, lapack_int* ldv, - float* q, lapack_int* ldq, float* work, lapack_int* ncycle, - lapack_int *info ); -void LAPACK_dtgsja( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, lapack_int* k, lapack_int* l, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* tola, double* tolb, double* alpha, double* beta, - double* u, lapack_int* ldu, double* v, lapack_int* ldv, - double* q, lapack_int* ldq, double* work, - lapack_int* ncycle, lapack_int *info ); -void LAPACK_ctgsja( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, lapack_int* k, lapack_int* l, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* tola, - float* tolb, float* alpha, float* beta, - lapack_complex_float* u, lapack_int* ldu, - lapack_complex_float* v, lapack_int* ldv, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* work, lapack_int* ncycle, - lapack_int *info ); -void LAPACK_ztgsja( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* p, lapack_int* n, lapack_int* k, lapack_int* l, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* tola, - double* tolb, double* alpha, double* beta, - lapack_complex_double* u, lapack_int* ldu, - lapack_complex_double* v, lapack_int* ldv, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* work, lapack_int* ncycle, - lapack_int *info ); -void LAPACK_sgels( char* trans, lapack_int* m, lapack_int* n, lapack_int* nrhs, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - float* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_dgels( char* trans, lapack_int* m, lapack_int* n, lapack_int* nrhs, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_cgels( char* trans, lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgels( char* trans, lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_sgelsy( lapack_int* m, lapack_int* n, lapack_int* nrhs, float* a, - lapack_int* lda, float* b, lapack_int* ldb, - lapack_int* jpvt, float* rcond, lapack_int* rank, - float* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_dgelsy( lapack_int* m, lapack_int* n, lapack_int* nrhs, double* a, - lapack_int* lda, double* b, lapack_int* ldb, - lapack_int* jpvt, double* rcond, lapack_int* rank, - double* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_cgelsy( lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, lapack_int* jpvt, - float* rcond, lapack_int* rank, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int *info ); -void LAPACK_zgelsy( lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, lapack_int* jpvt, - double* rcond, lapack_int* rank, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_sgelss( lapack_int* m, lapack_int* n, lapack_int* nrhs, float* a, - lapack_int* lda, float* b, lapack_int* ldb, float* s, - float* rcond, lapack_int* rank, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dgelss( lapack_int* m, lapack_int* n, lapack_int* nrhs, double* a, - lapack_int* lda, double* b, lapack_int* ldb, double* s, - double* rcond, lapack_int* rank, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cgelss( lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* s, - float* rcond, lapack_int* rank, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int *info ); -void LAPACK_zgelss( lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* s, - double* rcond, lapack_int* rank, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_sgelsd( lapack_int* m, lapack_int* n, lapack_int* nrhs, float* a, - lapack_int* lda, float* b, lapack_int* ldb, float* s, - float* rcond, lapack_int* rank, float* work, - lapack_int* lwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_dgelsd( lapack_int* m, lapack_int* n, lapack_int* nrhs, double* a, - lapack_int* lda, double* b, lapack_int* ldb, double* s, - double* rcond, lapack_int* rank, double* work, - lapack_int* lwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_cgelsd( lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* s, - float* rcond, lapack_int* rank, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int* iwork, - lapack_int *info ); -void LAPACK_zgelsd( lapack_int* m, lapack_int* n, lapack_int* nrhs, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* s, - double* rcond, lapack_int* rank, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_sgglse( lapack_int* m, lapack_int* n, lapack_int* p, float* a, - lapack_int* lda, float* b, lapack_int* ldb, float* c, - float* d, float* x, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgglse( lapack_int* m, lapack_int* n, lapack_int* p, double* a, - lapack_int* lda, double* b, lapack_int* ldb, double* c, - double* d, double* x, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgglse( lapack_int* m, lapack_int* n, lapack_int* p, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* c, lapack_complex_float* d, - lapack_complex_float* x, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zgglse( lapack_int* m, lapack_int* n, lapack_int* p, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* c, lapack_complex_double* d, - lapack_complex_double* x, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sggglm( lapack_int* n, lapack_int* m, lapack_int* p, float* a, - lapack_int* lda, float* b, lapack_int* ldb, float* d, - float* x, float* y, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dggglm( lapack_int* n, lapack_int* m, lapack_int* p, double* a, - lapack_int* lda, double* b, lapack_int* ldb, double* d, - double* x, double* y, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cggglm( lapack_int* n, lapack_int* m, lapack_int* p, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* d, lapack_complex_float* x, - lapack_complex_float* y, lapack_complex_float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_zggglm( lapack_int* n, lapack_int* m, lapack_int* p, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* d, lapack_complex_double* x, - lapack_complex_double* y, lapack_complex_double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_ssyev( char* jobz, char* uplo, lapack_int* n, float* a, - lapack_int* lda, float* w, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dsyev( char* jobz, char* uplo, lapack_int* n, double* a, - lapack_int* lda, double* w, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cheev( char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, float* w, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zheev( char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, double* w, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_ssyevd( char* jobz, char* uplo, lapack_int* n, float* a, - lapack_int* lda, float* w, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dsyevd( char* jobz, char* uplo, lapack_int* n, double* a, - lapack_int* lda, double* w, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_cheevd( char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, float* w, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zheevd( char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, double* w, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_ssyevx( char* jobz, char* range, char* uplo, lapack_int* n, - float* a, lapack_int* lda, float* vl, float* vu, - lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, float* z, lapack_int* ldz, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_dsyevx( char* jobz, char* range, char* uplo, lapack_int* n, - double* a, lapack_int* lda, double* vl, double* vu, - lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, double* z, lapack_int* ldz, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_cheevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, float* vl, - float* vu, lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_zheevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, double* vl, - double* vu, lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_ssyevr( char* jobz, char* range, char* uplo, lapack_int* n, - float* a, lapack_int* lda, float* vl, float* vu, - lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, float* z, lapack_int* ldz, - lapack_int* isuppz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dsyevr( char* jobz, char* range, char* uplo, lapack_int* n, - double* a, lapack_int* lda, double* vl, double* vu, - lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, double* z, lapack_int* ldz, - lapack_int* isuppz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_cheevr( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, float* vl, - float* vu, lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_int* isuppz, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zheevr( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, double* vl, - double* vu, lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_int* isuppz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_sspev( char* jobz, char* uplo, lapack_int* n, float* ap, float* w, - float* z, lapack_int* ldz, float* work, lapack_int *info ); -void LAPACK_dspev( char* jobz, char* uplo, lapack_int* n, double* ap, double* w, - double* z, lapack_int* ldz, double* work, lapack_int *info ); -void LAPACK_chpev( char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* ap, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, float* rwork, - lapack_int *info ); -void LAPACK_zhpev( char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* ap, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sspevd( char* jobz, char* uplo, lapack_int* n, float* ap, float* w, - float* z, lapack_int* ldz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dspevd( char* jobz, char* uplo, lapack_int* n, double* ap, - double* w, double* z, lapack_int* ldz, double* work, - lapack_int* lwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_chpevd( char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* ap, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int* lrwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_zhpevd( char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* ap, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_sspevx( char* jobz, char* range, char* uplo, lapack_int* n, - float* ap, float* vl, float* vu, lapack_int* il, - lapack_int* iu, float* abstol, lapack_int* m, float* w, - float* z, lapack_int* ldz, float* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_dspevx( char* jobz, char* range, char* uplo, lapack_int* n, - double* ap, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, double* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_chpevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_complex_float* ap, float* vl, float* vu, - lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, float* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_zhpevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_complex_double* ap, double* vl, double* vu, - lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_ssbev( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - float* ab, lapack_int* ldab, float* w, float* z, - lapack_int* ldz, float* work, lapack_int *info ); -void LAPACK_dsbev( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - double* ab, lapack_int* ldab, double* w, double* z, - lapack_int* ldz, double* work, lapack_int *info ); -void LAPACK_chbev( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_float* ab, lapack_int* ldab, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, float* rwork, lapack_int *info ); -void LAPACK_zhbev( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_double* ab, lapack_int* ldab, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_ssbevd( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - float* ab, lapack_int* ldab, float* w, float* z, - lapack_int* ldz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dsbevd( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - double* ab, lapack_int* ldab, double* w, double* z, - lapack_int* ldz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_chbevd( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_float* ab, lapack_int* ldab, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zhbevd( char* jobz, char* uplo, lapack_int* n, lapack_int* kd, - lapack_complex_double* ab, lapack_int* ldab, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_ssbevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* kd, float* ab, lapack_int* ldab, float* q, - lapack_int* ldq, float* vl, float* vu, lapack_int* il, - lapack_int* iu, float* abstol, lapack_int* m, float* w, - float* z, lapack_int* ldz, float* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_dsbevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* kd, double* ab, lapack_int* ldab, double* q, - lapack_int* ldq, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, double* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_chbevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* kd, lapack_complex_float* ab, lapack_int* ldab, - lapack_complex_float* q, lapack_int* ldq, float* vl, - float* vu, lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, float* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_zhbevx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* kd, lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* q, lapack_int* ldq, double* vl, - double* vu, lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_sstev( char* jobz, lapack_int* n, float* d, float* e, float* z, - lapack_int* ldz, float* work, lapack_int *info ); -void LAPACK_dstev( char* jobz, lapack_int* n, double* d, double* e, double* z, - lapack_int* ldz, double* work, lapack_int *info ); -void LAPACK_sstevd( char* jobz, lapack_int* n, float* d, float* e, float* z, - lapack_int* ldz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_dstevd( char* jobz, lapack_int* n, double* d, double* e, double* z, - lapack_int* ldz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_sstevx( char* jobz, char* range, lapack_int* n, float* d, float* e, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - float* abstol, lapack_int* m, float* w, float* z, - lapack_int* ldz, float* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_dstevx( char* jobz, char* range, lapack_int* n, double* d, - double* e, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, double* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_sstevr( char* jobz, char* range, lapack_int* n, float* d, float* e, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - float* abstol, lapack_int* m, float* w, float* z, - lapack_int* ldz, lapack_int* isuppz, float* work, - lapack_int* lwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_dstevr( char* jobz, char* range, lapack_int* n, double* d, - double* e, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, lapack_int* isuppz, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_sgees( char* jobvs, char* sort, LAPACK_S_SELECT2 select, - lapack_int* n, float* a, lapack_int* lda, lapack_int* sdim, - float* wr, float* wi, float* vs, lapack_int* ldvs, - float* work, lapack_int* lwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_dgees( char* jobvs, char* sort, LAPACK_D_SELECT2 select, - lapack_int* n, double* a, lapack_int* lda, lapack_int* sdim, - double* wr, double* wi, double* vs, lapack_int* ldvs, - double* work, lapack_int* lwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_cgees( char* jobvs, char* sort, LAPACK_C_SELECT1 select, - lapack_int* n, lapack_complex_float* a, lapack_int* lda, - lapack_int* sdim, lapack_complex_float* w, - lapack_complex_float* vs, lapack_int* ldvs, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_logical* bwork, lapack_int *info ); -void LAPACK_zgees( char* jobvs, char* sort, LAPACK_Z_SELECT1 select, - lapack_int* n, lapack_complex_double* a, lapack_int* lda, - lapack_int* sdim, lapack_complex_double* w, - lapack_complex_double* vs, lapack_int* ldvs, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_logical* bwork, lapack_int *info ); -void LAPACK_sgeesx( char* jobvs, char* sort, LAPACK_S_SELECT2 select, - char* sense, lapack_int* n, float* a, lapack_int* lda, - lapack_int* sdim, float* wr, float* wi, float* vs, - lapack_int* ldvs, float* rconde, float* rcondv, float* work, - lapack_int* lwork, lapack_int* iwork, lapack_int* liwork, - lapack_logical* bwork, lapack_int *info ); -void LAPACK_dgeesx( char* jobvs, char* sort, LAPACK_D_SELECT2 select, - char* sense, lapack_int* n, double* a, lapack_int* lda, - lapack_int* sdim, double* wr, double* wi, double* vs, - lapack_int* ldvs, double* rconde, double* rcondv, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_cgeesx( char* jobvs, char* sort, LAPACK_C_SELECT1 select, - char* sense, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* sdim, lapack_complex_float* w, - lapack_complex_float* vs, lapack_int* ldvs, float* rconde, - float* rcondv, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_zgeesx( char* jobvs, char* sort, LAPACK_Z_SELECT1 select, - char* sense, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* sdim, lapack_complex_double* w, - lapack_complex_double* vs, lapack_int* ldvs, double* rconde, - double* rcondv, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_sgeev( char* jobvl, char* jobvr, lapack_int* n, float* a, - lapack_int* lda, float* wr, float* wi, float* vl, - lapack_int* ldvl, float* vr, lapack_int* ldvr, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dgeev( char* jobvl, char* jobvr, lapack_int* n, double* a, - lapack_int* lda, double* wr, double* wi, double* vl, - lapack_int* ldvl, double* vr, lapack_int* ldvr, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cgeev( char* jobvl, char* jobvr, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* w, lapack_complex_float* vl, - lapack_int* ldvl, lapack_complex_float* vr, lapack_int* ldvr, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zgeev( char* jobvl, char* jobvr, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* w, lapack_complex_double* vl, - lapack_int* ldvl, lapack_complex_double* vr, - lapack_int* ldvr, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int *info ); -void LAPACK_sgeevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, float* a, lapack_int* lda, float* wr, - float* wi, float* vl, lapack_int* ldvl, float* vr, - lapack_int* ldvr, lapack_int* ilo, lapack_int* ihi, - float* scale, float* abnrm, float* rconde, float* rcondv, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int *info ); -void LAPACK_dgeevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, double* a, lapack_int* lda, double* wr, - double* wi, double* vl, lapack_int* ldvl, double* vr, - lapack_int* ldvr, lapack_int* ilo, lapack_int* ihi, - double* scale, double* abnrm, double* rconde, - double* rcondv, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_cgeevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* w, lapack_complex_float* vl, - lapack_int* ldvl, lapack_complex_float* vr, - lapack_int* ldvr, lapack_int* ilo, lapack_int* ihi, - float* scale, float* abnrm, float* rconde, float* rcondv, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zgeevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* w, lapack_complex_double* vl, - lapack_int* ldvl, lapack_complex_double* vr, - lapack_int* ldvr, lapack_int* ilo, lapack_int* ihi, - double* scale, double* abnrm, double* rconde, - double* rcondv, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int *info ); -void LAPACK_sgesvd( char* jobu, char* jobvt, lapack_int* m, lapack_int* n, - float* a, lapack_int* lda, float* s, float* u, - lapack_int* ldu, float* vt, lapack_int* ldvt, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_dgesvd( char* jobu, char* jobvt, lapack_int* m, lapack_int* n, - double* a, lapack_int* lda, double* s, double* u, - lapack_int* ldu, double* vt, lapack_int* ldvt, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cgesvd( char* jobu, char* jobvt, lapack_int* m, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, float* s, - lapack_complex_float* u, lapack_int* ldu, - lapack_complex_float* vt, lapack_int* ldvt, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zgesvd( char* jobu, char* jobvt, lapack_int* m, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, double* s, - lapack_complex_double* u, lapack_int* ldu, - lapack_complex_double* vt, lapack_int* ldvt, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_sgesdd( char* jobz, lapack_int* m, lapack_int* n, float* a, - lapack_int* lda, float* s, float* u, lapack_int* ldu, - float* vt, lapack_int* ldvt, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dgesdd( char* jobz, lapack_int* m, lapack_int* n, double* a, - lapack_int* lda, double* s, double* u, lapack_int* ldu, - double* vt, lapack_int* ldvt, double* work, - lapack_int* lwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_cgesdd( char* jobz, lapack_int* m, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, float* s, - lapack_complex_float* u, lapack_int* ldu, - lapack_complex_float* vt, lapack_int* ldvt, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_zgesdd( char* jobz, lapack_int* m, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, double* s, - lapack_complex_double* u, lapack_int* ldu, - lapack_complex_double* vt, lapack_int* ldvt, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* iwork, lapack_int *info ); -void LAPACK_dgejsv( char* joba, char* jobu, char* jobv, char* jobr, char* jobt, - char* jobp, lapack_int* m, lapack_int* n, double* a, - lapack_int* lda, double* sva, double* u, lapack_int* ldu, - double* v, lapack_int* ldv, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_sgejsv( char* joba, char* jobu, char* jobv, char* jobr, char* jobt, - char* jobp, lapack_int* m, lapack_int* n, float* a, - lapack_int* lda, float* sva, float* u, lapack_int* ldu, - float* v, lapack_int* ldv, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_dgesvj( char* joba, char* jobu, char* jobv, lapack_int* m, - lapack_int* n, double* a, lapack_int* lda, double* sva, - lapack_int* mv, double* v, lapack_int* ldv, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sgesvj( char* joba, char* jobu, char* jobv, lapack_int* m, - lapack_int* n, float* a, lapack_int* lda, float* sva, - lapack_int* mv, float* v, lapack_int* ldv, float* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_sggsvd( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* n, lapack_int* p, lapack_int* k, lapack_int* l, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - float* alpha, float* beta, float* u, lapack_int* ldu, - float* v, lapack_int* ldv, float* q, lapack_int* ldq, - float* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_dggsvd( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* n, lapack_int* p, lapack_int* k, lapack_int* l, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* alpha, double* beta, double* u, lapack_int* ldu, - double* v, lapack_int* ldv, double* q, lapack_int* ldq, - double* work, lapack_int* iwork, lapack_int *info ); -void LAPACK_cggsvd( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* n, lapack_int* p, lapack_int* k, lapack_int* l, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* alpha, - float* beta, lapack_complex_float* u, lapack_int* ldu, - lapack_complex_float* v, lapack_int* ldv, - lapack_complex_float* q, lapack_int* ldq, - lapack_complex_float* work, float* rwork, lapack_int* iwork, - lapack_int *info ); -void LAPACK_zggsvd( char* jobu, char* jobv, char* jobq, lapack_int* m, - lapack_int* n, lapack_int* p, lapack_int* k, lapack_int* l, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* alpha, - double* beta, lapack_complex_double* u, lapack_int* ldu, - lapack_complex_double* v, lapack_int* ldv, - lapack_complex_double* q, lapack_int* ldq, - lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int *info ); -void LAPACK_ssygv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - float* w, float* work, lapack_int* lwork, lapack_int *info ); -void LAPACK_dsygv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* w, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_chegv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* w, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zhegv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* w, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_ssygvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - float* w, float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_dsygvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* w, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_chegvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* w, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zhegvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* w, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_ssygvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, float* a, lapack_int* lda, float* b, - lapack_int* ldb, float* vl, float* vu, lapack_int* il, - lapack_int* iu, float* abstol, lapack_int* m, float* w, - float* z, lapack_int* ldz, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_dsygvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, double* a, lapack_int* lda, double* b, - lapack_int* ldb, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_chegvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, float* vl, - float* vu, lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_zhegvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, double* vl, - double* vu, lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_sspgv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - float* ap, float* bp, float* w, float* z, lapack_int* ldz, - float* work, lapack_int *info ); -void LAPACK_dspgv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - double* ap, double* bp, double* w, double* z, - lapack_int* ldz, double* work, lapack_int *info ); -void LAPACK_chpgv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* ap, lapack_complex_float* bp, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, float* rwork, lapack_int *info ); -void LAPACK_zhpgv( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* ap, lapack_complex_double* bp, - double* w, lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_sspgvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - float* ap, float* bp, float* w, float* z, lapack_int* ldz, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_dspgvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - double* ap, double* bp, double* w, double* z, - lapack_int* ldz, double* work, lapack_int* lwork, - lapack_int* iwork, lapack_int* liwork, lapack_int *info ); -void LAPACK_chpgvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_float* ap, lapack_complex_float* bp, - float* w, lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zhpgvd( lapack_int* itype, char* jobz, char* uplo, lapack_int* n, - lapack_complex_double* ap, lapack_complex_double* bp, - double* w, lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_sspgvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, float* ap, float* bp, float* vl, float* vu, - lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, float* z, lapack_int* ldz, - float* work, lapack_int* iwork, lapack_int* ifail, - lapack_int *info ); -void LAPACK_dspgvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, double* ap, double* bp, double* vl, - double* vu, lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, double* z, lapack_int* ldz, - double* work, lapack_int* iwork, lapack_int* ifail, - lapack_int *info ); -void LAPACK_chpgvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, lapack_complex_float* ap, - lapack_complex_float* bp, float* vl, float* vu, - lapack_int* il, lapack_int* iu, float* abstol, - lapack_int* m, float* w, lapack_complex_float* z, - lapack_int* ldz, lapack_complex_float* work, float* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_zhpgvx( lapack_int* itype, char* jobz, char* range, char* uplo, - lapack_int* n, lapack_complex_double* ap, - lapack_complex_double* bp, double* vl, double* vu, - lapack_int* il, lapack_int* iu, double* abstol, - lapack_int* m, double* w, lapack_complex_double* z, - lapack_int* ldz, lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_ssbgv( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, float* ab, lapack_int* ldab, float* bb, - lapack_int* ldbb, float* w, float* z, lapack_int* ldz, - float* work, lapack_int *info ); -void LAPACK_dsbgv( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, double* ab, lapack_int* ldab, double* bb, - lapack_int* ldbb, double* w, double* z, lapack_int* ldz, - double* work, lapack_int *info ); -void LAPACK_chbgv( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, lapack_complex_float* ab, lapack_int* ldab, - lapack_complex_float* bb, lapack_int* ldbb, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, float* rwork, lapack_int *info ); -void LAPACK_zhbgv( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* bb, lapack_int* ldbb, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, double* rwork, - lapack_int *info ); -void LAPACK_ssbgvd( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, float* ab, lapack_int* ldab, float* bb, - lapack_int* ldbb, float* w, float* z, lapack_int* ldz, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_dsbgvd( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, double* ab, lapack_int* ldab, double* bb, - lapack_int* ldbb, double* w, double* z, lapack_int* ldz, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_chbgvd( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, lapack_complex_float* ab, lapack_int* ldab, - lapack_complex_float* bb, lapack_int* ldbb, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* lrwork, lapack_int* iwork, lapack_int* liwork, - lapack_int *info ); -void LAPACK_zhbgvd( char* jobz, char* uplo, lapack_int* n, lapack_int* ka, - lapack_int* kb, lapack_complex_double* ab, lapack_int* ldab, - lapack_complex_double* bb, lapack_int* ldbb, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, lapack_int* iwork, - lapack_int* liwork, lapack_int *info ); -void LAPACK_ssbgvx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* ka, lapack_int* kb, float* ab, lapack_int* ldab, - float* bb, lapack_int* ldbb, float* q, lapack_int* ldq, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - float* abstol, lapack_int* m, float* w, float* z, - lapack_int* ldz, float* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_dsbgvx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* ka, lapack_int* kb, double* ab, - lapack_int* ldab, double* bb, lapack_int* ldbb, double* q, - lapack_int* ldq, double* vl, double* vu, lapack_int* il, - lapack_int* iu, double* abstol, lapack_int* m, double* w, - double* z, lapack_int* ldz, double* work, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_chbgvx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* ka, lapack_int* kb, lapack_complex_float* ab, - lapack_int* ldab, lapack_complex_float* bb, - lapack_int* ldbb, lapack_complex_float* q, lapack_int* ldq, - float* vl, float* vu, lapack_int* il, lapack_int* iu, - float* abstol, lapack_int* m, float* w, - lapack_complex_float* z, lapack_int* ldz, - lapack_complex_float* work, float* rwork, lapack_int* iwork, - lapack_int* ifail, lapack_int *info ); -void LAPACK_zhbgvx( char* jobz, char* range, char* uplo, lapack_int* n, - lapack_int* ka, lapack_int* kb, lapack_complex_double* ab, - lapack_int* ldab, lapack_complex_double* bb, - lapack_int* ldbb, lapack_complex_double* q, lapack_int* ldq, - double* vl, double* vu, lapack_int* il, lapack_int* iu, - double* abstol, lapack_int* m, double* w, - lapack_complex_double* z, lapack_int* ldz, - lapack_complex_double* work, double* rwork, - lapack_int* iwork, lapack_int* ifail, lapack_int *info ); -void LAPACK_sgges( char* jobvsl, char* jobvsr, char* sort, - LAPACK_S_SELECT3 selctg, lapack_int* n, float* a, - lapack_int* lda, float* b, lapack_int* ldb, lapack_int* sdim, - float* alphar, float* alphai, float* beta, float* vsl, - lapack_int* ldvsl, float* vsr, lapack_int* ldvsr, - float* work, lapack_int* lwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_dgges( char* jobvsl, char* jobvsr, char* sort, - LAPACK_D_SELECT3 selctg, lapack_int* n, double* a, - lapack_int* lda, double* b, lapack_int* ldb, - lapack_int* sdim, double* alphar, double* alphai, - double* beta, double* vsl, lapack_int* ldvsl, double* vsr, - lapack_int* ldvsr, double* work, lapack_int* lwork, - lapack_logical* bwork, lapack_int *info ); -void LAPACK_cgges( char* jobvsl, char* jobvsr, char* sort, - LAPACK_C_SELECT2 selctg, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, lapack_int* sdim, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* vsl, lapack_int* ldvsl, - lapack_complex_float* vsr, lapack_int* ldvsr, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_logical* bwork, lapack_int *info ); -void LAPACK_zgges( char* jobvsl, char* jobvsr, char* sort, - LAPACK_Z_SELECT2 selctg, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, lapack_int* sdim, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* vsl, lapack_int* ldvsl, - lapack_complex_double* vsr, lapack_int* ldvsr, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_logical* bwork, lapack_int *info ); -void LAPACK_sggesx( char* jobvsl, char* jobvsr, char* sort, - LAPACK_S_SELECT3 selctg, char* sense, lapack_int* n, - float* a, lapack_int* lda, float* b, lapack_int* ldb, - lapack_int* sdim, float* alphar, float* alphai, float* beta, - float* vsl, lapack_int* ldvsl, float* vsr, - lapack_int* ldvsr, float* rconde, float* rcondv, - float* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_dggesx( char* jobvsl, char* jobvsr, char* sort, - LAPACK_D_SELECT3 selctg, char* sense, lapack_int* n, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - lapack_int* sdim, double* alphar, double* alphai, - double* beta, double* vsl, lapack_int* ldvsl, double* vsr, - lapack_int* ldvsr, double* rconde, double* rcondv, - double* work, lapack_int* lwork, lapack_int* iwork, - lapack_int* liwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_cggesx( char* jobvsl, char* jobvsr, char* sort, - LAPACK_C_SELECT2 selctg, char* sense, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, lapack_int* sdim, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* vsl, lapack_int* ldvsl, - lapack_complex_float* vsr, lapack_int* ldvsr, float* rconde, - float* rcondv, lapack_complex_float* work, - lapack_int* lwork, float* rwork, lapack_int* iwork, - lapack_int* liwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_zggesx( char* jobvsl, char* jobvsr, char* sort, - LAPACK_Z_SELECT2 selctg, char* sense, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, lapack_int* sdim, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* vsl, lapack_int* ldvsl, - lapack_complex_double* vsr, lapack_int* ldvsr, - double* rconde, double* rcondv, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int* iwork, - lapack_int* liwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_sggev( char* jobvl, char* jobvr, lapack_int* n, float* a, - lapack_int* lda, float* b, lapack_int* ldb, float* alphar, - float* alphai, float* beta, float* vl, lapack_int* ldvl, - float* vr, lapack_int* ldvr, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dggev( char* jobvl, char* jobvr, lapack_int* n, double* a, - lapack_int* lda, double* b, lapack_int* ldb, double* alphar, - double* alphai, double* beta, double* vl, lapack_int* ldvl, - double* vr, lapack_int* ldvr, double* work, - lapack_int* lwork, lapack_int *info ); -void LAPACK_cggev( char* jobvl, char* jobvr, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* vl, lapack_int* ldvl, - lapack_complex_float* vr, lapack_int* ldvr, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int *info ); -void LAPACK_zggev( char* jobvl, char* jobvr, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* vl, lapack_int* ldvl, - lapack_complex_double* vr, lapack_int* ldvr, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int *info ); -void LAPACK_sggevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, float* a, lapack_int* lda, float* b, - lapack_int* ldb, float* alphar, float* alphai, float* beta, - float* vl, lapack_int* ldvl, float* vr, lapack_int* ldvr, - lapack_int* ilo, lapack_int* ihi, float* lscale, - float* rscale, float* abnrm, float* bbnrm, float* rconde, - float* rcondv, float* work, lapack_int* lwork, - lapack_int* iwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_dggevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, double* a, lapack_int* lda, double* b, - lapack_int* ldb, double* alphar, double* alphai, - double* beta, double* vl, lapack_int* ldvl, double* vr, - lapack_int* ldvr, lapack_int* ilo, lapack_int* ihi, - double* lscale, double* rscale, double* abnrm, - double* bbnrm, double* rconde, double* rcondv, double* work, - lapack_int* lwork, lapack_int* iwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_cggevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* vl, lapack_int* ldvl, - lapack_complex_float* vr, lapack_int* ldvr, lapack_int* ilo, - lapack_int* ihi, float* lscale, float* rscale, float* abnrm, - float* bbnrm, float* rconde, float* rcondv, - lapack_complex_float* work, lapack_int* lwork, float* rwork, - lapack_int* iwork, lapack_logical* bwork, - lapack_int *info ); -void LAPACK_zggevx( char* balanc, char* jobvl, char* jobvr, char* sense, - lapack_int* n, lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* vl, lapack_int* ldvl, - lapack_complex_double* vr, lapack_int* ldvr, - lapack_int* ilo, lapack_int* ihi, double* lscale, - double* rscale, double* abnrm, double* bbnrm, - double* rconde, double* rcondv, lapack_complex_double* work, - lapack_int* lwork, double* rwork, lapack_int* iwork, - lapack_logical* bwork, lapack_int *info ); -void LAPACK_dsfrk( char* transr, char* uplo, char* trans, lapack_int* n, - lapack_int* k, double* alpha, const double* a, - lapack_int* lda, double* beta, double* c ); -void LAPACK_ssfrk( char* transr, char* uplo, char* trans, lapack_int* n, - lapack_int* k, float* alpha, const float* a, lapack_int* lda, - float* beta, float* c ); -void LAPACK_zhfrk( char* transr, char* uplo, char* trans, lapack_int* n, - lapack_int* k, double* alpha, const lapack_complex_double* a, - lapack_int* lda, double* beta, lapack_complex_double* c ); -void LAPACK_chfrk( char* transr, char* uplo, char* trans, lapack_int* n, - lapack_int* k, float* alpha, const lapack_complex_float* a, - lapack_int* lda, float* beta, lapack_complex_float* c ); -void LAPACK_dtfsm( char* transr, char* side, char* uplo, char* trans, - char* diag, lapack_int* m, lapack_int* n, double* alpha, - const double* a, double* b, lapack_int* ldb ); -void LAPACK_stfsm( char* transr, char* side, char* uplo, char* trans, - char* diag, lapack_int* m, lapack_int* n, float* alpha, - const float* a, float* b, lapack_int* ldb ); -void LAPACK_ztfsm( char* transr, char* side, char* uplo, char* trans, - char* diag, lapack_int* m, lapack_int* n, - lapack_complex_double* alpha, const lapack_complex_double* a, - lapack_complex_double* b, lapack_int* ldb ); -void LAPACK_ctfsm( char* transr, char* side, char* uplo, char* trans, - char* diag, lapack_int* m, lapack_int* n, - lapack_complex_float* alpha, const lapack_complex_float* a, - lapack_complex_float* b, lapack_int* ldb ); -void LAPACK_dtfttp( char* transr, char* uplo, lapack_int* n, const double* arf, - double* ap, lapack_int *info ); -void LAPACK_stfttp( char* transr, char* uplo, lapack_int* n, const float* arf, - float* ap, lapack_int *info ); -void LAPACK_ztfttp( char* transr, char* uplo, lapack_int* n, - const lapack_complex_double* arf, lapack_complex_double* ap, - lapack_int *info ); -void LAPACK_ctfttp( char* transr, char* uplo, lapack_int* n, - const lapack_complex_float* arf, lapack_complex_float* ap, - lapack_int *info ); -void LAPACK_dtfttr( char* transr, char* uplo, lapack_int* n, const double* arf, - double* a, lapack_int* lda, lapack_int *info ); -void LAPACK_stfttr( char* transr, char* uplo, lapack_int* n, const float* arf, - float* a, lapack_int* lda, lapack_int *info ); -void LAPACK_ztfttr( char* transr, char* uplo, lapack_int* n, - const lapack_complex_double* arf, lapack_complex_double* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_ctfttr( char* transr, char* uplo, lapack_int* n, - const lapack_complex_float* arf, lapack_complex_float* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_dtpttf( char* transr, char* uplo, lapack_int* n, const double* ap, - double* arf, lapack_int *info ); -void LAPACK_stpttf( char* transr, char* uplo, lapack_int* n, const float* ap, - float* arf, lapack_int *info ); -void LAPACK_ztpttf( char* transr, char* uplo, lapack_int* n, - const lapack_complex_double* ap, lapack_complex_double* arf, - lapack_int *info ); -void LAPACK_ctpttf( char* transr, char* uplo, lapack_int* n, - const lapack_complex_float* ap, lapack_complex_float* arf, - lapack_int *info ); -void LAPACK_dtpttr( char* uplo, lapack_int* n, const double* ap, double* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_stpttr( char* uplo, lapack_int* n, const float* ap, float* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_ztpttr( char* uplo, lapack_int* n, const lapack_complex_double* ap, - lapack_complex_double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_ctpttr( char* uplo, lapack_int* n, const lapack_complex_float* ap, - lapack_complex_float* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_dtrttf( char* transr, char* uplo, lapack_int* n, const double* a, - lapack_int* lda, double* arf, lapack_int *info ); -void LAPACK_strttf( char* transr, char* uplo, lapack_int* n, const float* a, - lapack_int* lda, float* arf, lapack_int *info ); -void LAPACK_ztrttf( char* transr, char* uplo, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* arf, lapack_int *info ); -void LAPACK_ctrttf( char* transr, char* uplo, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* arf, lapack_int *info ); -void LAPACK_dtrttp( char* uplo, lapack_int* n, const double* a, lapack_int* lda, - double* ap, lapack_int *info ); -void LAPACK_strttp( char* uplo, lapack_int* n, const float* a, lapack_int* lda, - float* ap, lapack_int *info ); -void LAPACK_ztrttp( char* uplo, lapack_int* n, const lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* ap, - lapack_int *info ); -void LAPACK_ctrttp( char* uplo, lapack_int* n, const lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* ap, - lapack_int *info ); -void LAPACK_sgeqrfp( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_dgeqrfp( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_cgeqrfp( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_zgeqrfp( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int* lwork, - lapack_int *info ); -void LAPACK_clacgv( lapack_int* n, lapack_complex_float* x, lapack_int* incx ); -void LAPACK_zlacgv( lapack_int* n, lapack_complex_double* x, lapack_int* incx ); -void LAPACK_slarnv( lapack_int* idist, lapack_int* iseed, lapack_int* n, - float* x ); -void LAPACK_dlarnv( lapack_int* idist, lapack_int* iseed, lapack_int* n, - double* x ); -void LAPACK_clarnv( lapack_int* idist, lapack_int* iseed, lapack_int* n, - lapack_complex_float* x ); -void LAPACK_zlarnv( lapack_int* idist, lapack_int* iseed, lapack_int* n, - lapack_complex_double* x ); -void LAPACK_sgeqr2( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int *info ); -void LAPACK_dgeqr2( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int *info ); -void LAPACK_cgeqr2( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zgeqr2( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_slacpy( char* uplo, lapack_int* m, lapack_int* n, const float* a, - lapack_int* lda, float* b, lapack_int* ldb ); -void LAPACK_dlacpy( char* uplo, lapack_int* m, lapack_int* n, const double* a, - lapack_int* lda, double* b, lapack_int* ldb ); -void LAPACK_clacpy( char* uplo, lapack_int* m, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb ); -void LAPACK_zlacpy( char* uplo, lapack_int* m, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb ); -void LAPACK_sgetf2( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_dgetf2( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - lapack_int* ipiv, lapack_int *info ); -void LAPACK_cgetf2( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int* ipiv, lapack_int *info ); -void LAPACK_zgetf2( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int* ipiv, lapack_int *info ); -void LAPACK_slaswp( lapack_int* n, float* a, lapack_int* lda, lapack_int* k1, - lapack_int* k2, const lapack_int* ipiv, lapack_int* incx ); -void LAPACK_dlaswp( lapack_int* n, double* a, lapack_int* lda, lapack_int* k1, - lapack_int* k2, const lapack_int* ipiv, lapack_int* incx ); -void LAPACK_claswp( lapack_int* n, lapack_complex_float* a, lapack_int* lda, - lapack_int* k1, lapack_int* k2, const lapack_int* ipiv, - lapack_int* incx ); -void LAPACK_zlaswp( lapack_int* n, lapack_complex_double* a, lapack_int* lda, - lapack_int* k1, lapack_int* k2, const lapack_int* ipiv, - lapack_int* incx ); -float LAPACK_slange( char* norm, lapack_int* m, lapack_int* n, const float* a, - lapack_int* lda, float* work ); -double LAPACK_dlange( char* norm, lapack_int* m, lapack_int* n, const double* a, - lapack_int* lda, double* work ); -float LAPACK_clange( char* norm, lapack_int* m, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, float* work ); -double LAPACK_zlange( char* norm, lapack_int* m, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, double* work ); -float LAPACK_clanhe( char* norm, char* uplo, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, float* work ); -double LAPACK_zlanhe( char* norm, char* uplo, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, double* work ); -float LAPACK_slansy( char* norm, char* uplo, lapack_int* n, const float* a, - lapack_int* lda, float* work ); -double LAPACK_dlansy( char* norm, char* uplo, lapack_int* n, const double* a, - lapack_int* lda, double* work ); -float LAPACK_clansy( char* norm, char* uplo, lapack_int* n, - const lapack_complex_float* a, lapack_int* lda, float* work ); -double LAPACK_zlansy( char* norm, char* uplo, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, double* work ); -float LAPACK_slantr( char* norm, char* uplo, char* diag, lapack_int* m, - lapack_int* n, const float* a, lapack_int* lda, float* work ); -double LAPACK_dlantr( char* norm, char* uplo, char* diag, lapack_int* m, - lapack_int* n, const double* a, lapack_int* lda, double* work ); -float LAPACK_clantr( char* norm, char* uplo, char* diag, lapack_int* m, - lapack_int* n, const lapack_complex_float* a, lapack_int* lda, - float* work ); -double LAPACK_zlantr( char* norm, char* uplo, char* diag, lapack_int* m, - lapack_int* n, const lapack_complex_double* a, lapack_int* lda, - double* work ); -float LAPACK_slamch( char* cmach ); -double LAPACK_dlamch( char* cmach ); -void LAPACK_sgelq2( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* tau, float* work, lapack_int *info ); -void LAPACK_dgelq2( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* tau, double* work, lapack_int *info ); -void LAPACK_cgelq2( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* tau, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zgelq2( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* tau, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_slarfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, const float* v, - lapack_int* ldv, const float* t, lapack_int* ldt, float* c, - lapack_int* ldc, float* work, lapack_int* ldwork ); -void LAPACK_dlarfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, - const double* v, lapack_int* ldv, const double* t, - lapack_int* ldt, double* c, lapack_int* ldc, double* work, - lapack_int* ldwork ); -void LAPACK_clarfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, - const lapack_complex_float* v, lapack_int* ldv, - const lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int* ldwork ); -void LAPACK_zlarfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, - const lapack_complex_double* v, lapack_int* ldv, - const lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int* ldwork ); -void LAPACK_slarfg( lapack_int* n, float* alpha, float* x, lapack_int* incx, - float* tau ); -void LAPACK_dlarfg( lapack_int* n, double* alpha, double* x, lapack_int* incx, - double* tau ); -void LAPACK_clarfg( lapack_int* n, lapack_complex_float* alpha, - lapack_complex_float* x, lapack_int* incx, - lapack_complex_float* tau ); -void LAPACK_zlarfg( lapack_int* n, lapack_complex_double* alpha, - lapack_complex_double* x, lapack_int* incx, - lapack_complex_double* tau ); -void LAPACK_slarft( char* direct, char* storev, lapack_int* n, lapack_int* k, - const float* v, lapack_int* ldv, const float* tau, float* t, - lapack_int* ldt ); -void LAPACK_dlarft( char* direct, char* storev, lapack_int* n, lapack_int* k, - const double* v, lapack_int* ldv, const double* tau, - double* t, lapack_int* ldt ); -void LAPACK_clarft( char* direct, char* storev, lapack_int* n, lapack_int* k, - const lapack_complex_float* v, lapack_int* ldv, - const lapack_complex_float* tau, lapack_complex_float* t, - lapack_int* ldt ); -void LAPACK_zlarft( char* direct, char* storev, lapack_int* n, lapack_int* k, - const lapack_complex_double* v, lapack_int* ldv, - const lapack_complex_double* tau, lapack_complex_double* t, - lapack_int* ldt ); -void LAPACK_slarfx( char* side, lapack_int* m, lapack_int* n, const float* v, - float* tau, float* c, lapack_int* ldc, float* work ); -void LAPACK_dlarfx( char* side, lapack_int* m, lapack_int* n, const double* v, - double* tau, double* c, lapack_int* ldc, double* work ); -void LAPACK_clarfx( char* side, lapack_int* m, lapack_int* n, - const lapack_complex_float* v, lapack_complex_float* tau, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work ); -void LAPACK_zlarfx( char* side, lapack_int* m, lapack_int* n, - const lapack_complex_double* v, lapack_complex_double* tau, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work ); -void LAPACK_slatms( lapack_int* m, lapack_int* n, char* dist, lapack_int* iseed, - char* sym, float* d, lapack_int* mode, float* cond, - float* dmax, lapack_int* kl, lapack_int* ku, char* pack, - float* a, lapack_int* lda, float* work, lapack_int *info ); -void LAPACK_dlatms( lapack_int* m, lapack_int* n, char* dist, lapack_int* iseed, - char* sym, double* d, lapack_int* mode, double* cond, - double* dmax, lapack_int* kl, lapack_int* ku, char* pack, - double* a, lapack_int* lda, double* work, - lapack_int *info ); -void LAPACK_clatms( lapack_int* m, lapack_int* n, char* dist, lapack_int* iseed, - char* sym, float* d, lapack_int* mode, float* cond, - float* dmax, lapack_int* kl, lapack_int* ku, char* pack, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zlatms( lapack_int* m, lapack_int* n, char* dist, lapack_int* iseed, - char* sym, double* d, lapack_int* mode, double* cond, - double* dmax, lapack_int* kl, lapack_int* ku, char* pack, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_slag2d( lapack_int* m, lapack_int* n, const float* sa, - lapack_int* ldsa, double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_dlag2s( lapack_int* m, lapack_int* n, const double* a, - lapack_int* lda, float* sa, lapack_int* ldsa, - lapack_int *info ); -void LAPACK_clag2z( lapack_int* m, lapack_int* n, - const lapack_complex_float* sa, lapack_int* ldsa, - lapack_complex_double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_zlag2c( lapack_int* m, lapack_int* n, - const lapack_complex_double* a, lapack_int* lda, - lapack_complex_float* sa, lapack_int* ldsa, - lapack_int *info ); -void LAPACK_slauum( char* uplo, lapack_int* n, float* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_dlauum( char* uplo, lapack_int* n, double* a, lapack_int* lda, - lapack_int *info ); -void LAPACK_clauum( char* uplo, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_zlauum( char* uplo, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_int *info ); -void LAPACK_slagge( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const float* d, float* a, lapack_int* lda, - lapack_int* iseed, float* work, lapack_int *info ); -void LAPACK_dlagge( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const double* d, double* a, lapack_int* lda, - lapack_int* iseed, double* work, lapack_int *info ); -void LAPACK_clagge( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const float* d, lapack_complex_float* a, - lapack_int* lda, lapack_int* iseed, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zlagge( lapack_int* m, lapack_int* n, lapack_int* kl, - lapack_int* ku, const double* d, lapack_complex_double* a, - lapack_int* lda, lapack_int* iseed, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_slaset( char* uplo, lapack_int* m, lapack_int* n, float* alpha, - float* beta, float* a, lapack_int* lda ); -void LAPACK_dlaset( char* uplo, lapack_int* m, lapack_int* n, double* alpha, - double* beta, double* a, lapack_int* lda ); -void LAPACK_claset( char* uplo, lapack_int* m, lapack_int* n, - lapack_complex_float* alpha, lapack_complex_float* beta, - lapack_complex_float* a, lapack_int* lda ); -void LAPACK_zlaset( char* uplo, lapack_int* m, lapack_int* n, - lapack_complex_double* alpha, lapack_complex_double* beta, - lapack_complex_double* a, lapack_int* lda ); -void LAPACK_slasrt( char* id, lapack_int* n, float* d, lapack_int *info ); -void LAPACK_dlasrt( char* id, lapack_int* n, double* d, lapack_int *info ); -void LAPACK_claghe( lapack_int* n, lapack_int* k, const float* d, - lapack_complex_float* a, lapack_int* lda, lapack_int* iseed, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zlaghe( lapack_int* n, lapack_int* k, const double* d, - lapack_complex_double* a, lapack_int* lda, - lapack_int* iseed, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_slagsy( lapack_int* n, lapack_int* k, const float* d, float* a, - lapack_int* lda, lapack_int* iseed, float* work, - lapack_int *info ); -void LAPACK_dlagsy( lapack_int* n, lapack_int* k, const double* d, double* a, - lapack_int* lda, lapack_int* iseed, double* work, - lapack_int *info ); -void LAPACK_clagsy( lapack_int* n, lapack_int* k, const float* d, - lapack_complex_float* a, lapack_int* lda, lapack_int* iseed, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zlagsy( lapack_int* n, lapack_int* k, const double* d, - lapack_complex_double* a, lapack_int* lda, - lapack_int* iseed, lapack_complex_double* work, - lapack_int *info ); -void LAPACK_slapmr( lapack_logical* forwrd, lapack_int* m, lapack_int* n, - float* x, lapack_int* ldx, lapack_int* k ); -void LAPACK_dlapmr( lapack_logical* forwrd, lapack_int* m, lapack_int* n, - double* x, lapack_int* ldx, lapack_int* k ); -void LAPACK_clapmr( lapack_logical* forwrd, lapack_int* m, lapack_int* n, - lapack_complex_float* x, lapack_int* ldx, lapack_int* k ); -void LAPACK_zlapmr( lapack_logical* forwrd, lapack_int* m, lapack_int* n, - lapack_complex_double* x, lapack_int* ldx, lapack_int* k ); -float LAPACK_slapy2( float* x, float* y ); -double LAPACK_dlapy2( double* x, double* y ); -float LAPACK_slapy3( float* x, float* y, float* z ); -double LAPACK_dlapy3( double* x, double* y, double* z ); -void LAPACK_slartgp( float* f, float* g, float* cs, float* sn, float* r ); -void LAPACK_dlartgp( double* f, double* g, double* cs, double* sn, double* r ); -void LAPACK_slartgs( float* x, float* y, float* sigma, float* cs, float* sn ); -void LAPACK_dlartgs( double* x, double* y, double* sigma, double* cs, - double* sn ); -// LAPACK 3.3.0 -void LAPACK_cbbcsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - lapack_int* m, lapack_int* p, lapack_int* q, - float* theta, float* phi, - lapack_complex_float* u1, lapack_int* ldu1, - lapack_complex_float* u2, lapack_int* ldu2, - lapack_complex_float* v1t, lapack_int* ldv1t, - lapack_complex_float* v2t, lapack_int* ldv2t, - float* b11d, float* b11e, float* b12d, - float* b12e, float* b21d, float* b21e, - float* b22d, float* b22e, float* rwork, - lapack_int* lrwork , lapack_int *info ); -void LAPACK_cheswapr( char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* i1, - lapack_int* i2 ); -void LAPACK_chetri2( char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_chetri2x( char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int* nb , lapack_int *info ); -void LAPACK_chetrs2( char* uplo, lapack_int* n, - lapack_int* nrhs, const lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* work , lapack_int *info ); -void LAPACK_csyconv( char* uplo, char* way, - lapack_int* n, lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_float* work , lapack_int *info ); -void LAPACK_csyswapr( char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* i1, - lapack_int* i2 ); -void LAPACK_csytri2( char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_csytri2x( char* uplo, lapack_int* n, - lapack_complex_float* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int* nb , lapack_int *info ); -void LAPACK_csytrs2( char* uplo, lapack_int* n, - lapack_int* nrhs, const lapack_complex_float* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* work , lapack_int *info ); -void LAPACK_cunbdb( char* trans, char* signs, - lapack_int* m, lapack_int* p, lapack_int* q, - lapack_complex_float* x11, lapack_int* ldx11, - lapack_complex_float* x12, lapack_int* ldx12, - lapack_complex_float* x21, lapack_int* ldx21, - lapack_complex_float* x22, lapack_int* ldx22, - float* theta, float* phi, - lapack_complex_float* taup1, - lapack_complex_float* taup2, - lapack_complex_float* tauq1, - lapack_complex_float* tauq2, - lapack_complex_float* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_cuncsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - char* signs, lapack_int* m, lapack_int* p, - lapack_int* q, lapack_complex_float* x11, - lapack_int* ldx11, lapack_complex_float* x12, - lapack_int* ldx12, lapack_complex_float* x21, - lapack_int* ldx21, lapack_complex_float* x22, - lapack_int* ldx22, float* theta, - lapack_complex_float* u1, lapack_int* ldu1, - lapack_complex_float* u2, lapack_int* ldu2, - lapack_complex_float* v1t, lapack_int* ldv1t, - lapack_complex_float* v2t, lapack_int* ldv2t, - lapack_complex_float* work, lapack_int* lwork, - float* rwork, lapack_int* lrwork, - lapack_int* iwork , lapack_int *info ); -void LAPACK_dbbcsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - lapack_int* m, lapack_int* p, lapack_int* q, - double* theta, double* phi, double* u1, - lapack_int* ldu1, double* u2, lapack_int* ldu2, - double* v1t, lapack_int* ldv1t, double* v2t, - lapack_int* ldv2t, double* b11d, double* b11e, - double* b12d, double* b12e, double* b21d, - double* b21e, double* b22d, double* b22e, - double* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_dorbdb( char* trans, char* signs, - lapack_int* m, lapack_int* p, lapack_int* q, - double* x11, lapack_int* ldx11, double* x12, - lapack_int* ldx12, double* x21, lapack_int* ldx21, - double* x22, lapack_int* ldx22, double* theta, - double* phi, double* taup1, double* taup2, - double* tauq1, double* tauq2, double* work, - lapack_int* lwork , lapack_int *info ); -void LAPACK_dorcsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - char* signs, lapack_int* m, lapack_int* p, - lapack_int* q, double* x11, lapack_int* ldx11, - double* x12, lapack_int* ldx12, double* x21, - lapack_int* ldx21, double* x22, lapack_int* ldx22, - double* theta, double* u1, lapack_int* ldu1, - double* u2, lapack_int* ldu2, double* v1t, - lapack_int* ldv1t, double* v2t, lapack_int* ldv2t, - double* work, lapack_int* lwork, - lapack_int* iwork , lapack_int *info ); -void LAPACK_dsyconv( char* uplo, char* way, - lapack_int* n, double* a, lapack_int* lda, - const lapack_int* ipiv, double* work , lapack_int *info ); -void LAPACK_dsyswapr( char* uplo, lapack_int* n, - double* a, lapack_int* i1, lapack_int* i2 ); -void LAPACK_dsytri2( char* uplo, lapack_int* n, - double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_dsytri2x( char* uplo, lapack_int* n, - double* a, lapack_int* lda, - const lapack_int* ipiv, double* work, - lapack_int* nb , lapack_int *info ); -void LAPACK_dsytrs2( char* uplo, lapack_int* n, - lapack_int* nrhs, const double* a, - lapack_int* lda, const lapack_int* ipiv, - double* b, lapack_int* ldb, double* work , lapack_int *info ); -void LAPACK_sbbcsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - lapack_int* m, lapack_int* p, lapack_int* q, - float* theta, float* phi, float* u1, - lapack_int* ldu1, float* u2, lapack_int* ldu2, - float* v1t, lapack_int* ldv1t, float* v2t, - lapack_int* ldv2t, float* b11d, float* b11e, - float* b12d, float* b12e, float* b21d, - float* b21e, float* b22d, float* b22e, - float* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_sorbdb( char* trans, char* signs, - lapack_int* m, lapack_int* p, lapack_int* q, - float* x11, lapack_int* ldx11, float* x12, - lapack_int* ldx12, float* x21, lapack_int* ldx21, - float* x22, lapack_int* ldx22, float* theta, - float* phi, float* taup1, float* taup2, - float* tauq1, float* tauq2, float* work, - lapack_int* lwork , lapack_int *info ); -void LAPACK_sorcsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - char* signs, lapack_int* m, lapack_int* p, - lapack_int* q, float* x11, lapack_int* ldx11, - float* x12, lapack_int* ldx12, float* x21, - lapack_int* ldx21, float* x22, lapack_int* ldx22, - float* theta, float* u1, lapack_int* ldu1, - float* u2, lapack_int* ldu2, float* v1t, - lapack_int* ldv1t, float* v2t, lapack_int* ldv2t, - float* work, lapack_int* lwork, - lapack_int* iwork , lapack_int *info ); -void LAPACK_ssyconv( char* uplo, char* way, - lapack_int* n, float* a, lapack_int* lda, - const lapack_int* ipiv, float* work , lapack_int *info ); -void LAPACK_ssyswapr( char* uplo, lapack_int* n, - float* a, lapack_int* i1, lapack_int* i2 ); -void LAPACK_ssytri2( char* uplo, lapack_int* n, - float* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_float* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_ssytri2x( char* uplo, lapack_int* n, - float* a, lapack_int* lda, - const lapack_int* ipiv, float* work, - lapack_int* nb , lapack_int *info ); -void LAPACK_ssytrs2( char* uplo, lapack_int* n, - lapack_int* nrhs, const float* a, - lapack_int* lda, const lapack_int* ipiv, - float* b, lapack_int* ldb, float* work , lapack_int *info ); -void LAPACK_zbbcsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - lapack_int* m, lapack_int* p, lapack_int* q, - double* theta, double* phi, - lapack_complex_double* u1, lapack_int* ldu1, - lapack_complex_double* u2, lapack_int* ldu2, - lapack_complex_double* v1t, lapack_int* ldv1t, - lapack_complex_double* v2t, lapack_int* ldv2t, - double* b11d, double* b11e, double* b12d, - double* b12e, double* b21d, double* b21e, - double* b22d, double* b22e, double* rwork, - lapack_int* lrwork , lapack_int *info ); -void LAPACK_zheswapr( char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* i1, - lapack_int* i2 ); -void LAPACK_zhetri2( char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_zhetri2x( char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int* nb , lapack_int *info ); -void LAPACK_zhetrs2( char* uplo, lapack_int* n, - lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* work , lapack_int *info ); -void LAPACK_zsyconv( char* uplo, char* way, - lapack_int* n, lapack_complex_double* a, - lapack_int* lda, const lapack_int* ipiv, - lapack_complex_double* work , lapack_int *info ); -void LAPACK_zsyswapr( char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* i1, - lapack_int* i2 ); -void LAPACK_zsytri2( char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_zsytri2x( char* uplo, lapack_int* n, - lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* work, lapack_int* nb , lapack_int *info ); -void LAPACK_zsytrs2( char* uplo, lapack_int* n, - lapack_int* nrhs, - const lapack_complex_double* a, lapack_int* lda, - const lapack_int* ipiv, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* work , lapack_int *info ); -void LAPACK_zunbdb( char* trans, char* signs, - lapack_int* m, lapack_int* p, lapack_int* q, - lapack_complex_double* x11, lapack_int* ldx11, - lapack_complex_double* x12, lapack_int* ldx12, - lapack_complex_double* x21, lapack_int* ldx21, - lapack_complex_double* x22, lapack_int* ldx22, - double* theta, double* phi, - lapack_complex_double* taup1, - lapack_complex_double* taup2, - lapack_complex_double* tauq1, - lapack_complex_double* tauq2, - lapack_complex_double* work, lapack_int* lwork , lapack_int *info ); -void LAPACK_zuncsd( char* jobu1, char* jobu2, - char* jobv1t, char* jobv2t, char* trans, - char* signs, lapack_int* m, lapack_int* p, - lapack_int* q, lapack_complex_double* x11, - lapack_int* ldx11, lapack_complex_double* x12, - lapack_int* ldx12, lapack_complex_double* x21, - lapack_int* ldx21, lapack_complex_double* x22, - lapack_int* ldx22, double* theta, - lapack_complex_double* u1, lapack_int* ldu1, - lapack_complex_double* u2, lapack_int* ldu2, - lapack_complex_double* v1t, lapack_int* ldv1t, - lapack_complex_double* v2t, lapack_int* ldv2t, - lapack_complex_double* work, lapack_int* lwork, - double* rwork, lapack_int* lrwork, - lapack_int* iwork , lapack_int *info ); -// LAPACK 3.4.0 -void LAPACK_sgemqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* nb, const float* v, - lapack_int* ldv, const float* t, lapack_int* ldt, float* c, - lapack_int* ldc, float* work, lapack_int *info ); -void LAPACK_dgemqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* nb, const double* v, - lapack_int* ldv, const double* t, lapack_int* ldt, - double* c, lapack_int* ldc, double* work, - lapack_int *info ); -void LAPACK_cgemqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* nb, - const lapack_complex_float* v, lapack_int* ldv, - const lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* c, lapack_int* ldc, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zgemqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* nb, - const lapack_complex_double* v, lapack_int* ldv, - const lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* c, lapack_int* ldc, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_sgeqrt( lapack_int* m, lapack_int* n, lapack_int* nb, float* a, - lapack_int* lda, float* t, lapack_int* ldt, float* work, - lapack_int *info ); -void LAPACK_dgeqrt( lapack_int* m, lapack_int* n, lapack_int* nb, double* a, - lapack_int* lda, double* t, lapack_int* ldt, double* work, - lapack_int *info ); -void LAPACK_cgeqrt( lapack_int* m, lapack_int* n, lapack_int* nb, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_zgeqrt( lapack_int* m, lapack_int* n, lapack_int* nb, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_sgeqrt2( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* t, lapack_int* ldt, lapack_int *info ); -void LAPACK_dgeqrt2( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* t, lapack_int* ldt, lapack_int *info ); -void LAPACK_cgeqrt2( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_zgeqrt2( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_sgeqrt3( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* t, lapack_int* ldt, lapack_int *info ); -void LAPACK_dgeqrt3( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* t, lapack_int* ldt, lapack_int *info ); -void LAPACK_cgeqrt3( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_zgeqrt3( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_stpmqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, lapack_int* nb, - const float* v, lapack_int* ldv, const float* t, - lapack_int* ldt, float* a, lapack_int* lda, float* b, - lapack_int* ldb, float* work, lapack_int *info ); -void LAPACK_dtpmqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, lapack_int* nb, - const double* v, lapack_int* ldv, const double* t, - lapack_int* ldt, double* a, lapack_int* lda, double* b, - lapack_int* ldb, double* work, lapack_int *info ); -void LAPACK_ctpmqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, lapack_int* nb, - const lapack_complex_float* v, lapack_int* ldv, - const lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_ztpmqrt( char* side, char* trans, lapack_int* m, lapack_int* n, - lapack_int* k, lapack_int* l, lapack_int* nb, - const lapack_complex_double* v, lapack_int* ldv, - const lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_dtpqrt( lapack_int* m, lapack_int* n, lapack_int* l, lapack_int* nb, - double* a, lapack_int* lda, double* b, lapack_int* ldb, - double* t, lapack_int* ldt, double* work, - lapack_int *info ); -void LAPACK_ctpqrt( lapack_int* m, lapack_int* n, lapack_int* l, lapack_int* nb, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* t, lapack_complex_float* b, - lapack_int* ldb, lapack_int* ldt, - lapack_complex_float* work, lapack_int *info ); -void LAPACK_ztpqrt( lapack_int* m, lapack_int* n, lapack_int* l, lapack_int* nb, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* work, lapack_int *info ); -void LAPACK_stpqrt2( lapack_int* m, lapack_int* n, float* a, lapack_int* lda, - float* b, lapack_int* ldb, float* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_dtpqrt2( lapack_int* m, lapack_int* n, double* a, lapack_int* lda, - double* b, lapack_int* ldb, double* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_ctpqrt2( lapack_int* m, lapack_int* n, lapack_complex_float* a, - lapack_int* lda, lapack_complex_float* b, lapack_int* ldb, - lapack_complex_float* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_ztpqrt2( lapack_int* m, lapack_int* n, lapack_complex_double* a, - lapack_int* lda, lapack_complex_double* b, lapack_int* ldb, - lapack_complex_double* t, lapack_int* ldt, - lapack_int *info ); -void LAPACK_stprfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, lapack_int* l, - const float* v, lapack_int* ldv, const float* t, - lapack_int* ldt, float* a, lapack_int* lda, float* b, - lapack_int* ldb, const float* mywork, - lapack_int* myldwork ); -void LAPACK_dtprfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, lapack_int* l, - const double* v, lapack_int* ldv, const double* t, - lapack_int* ldt, double* a, lapack_int* lda, double* b, - lapack_int* ldb, const double* mywork, - lapack_int* myldwork ); -void LAPACK_ctprfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, lapack_int* l, - const lapack_complex_float* v, lapack_int* ldv, - const lapack_complex_float* t, lapack_int* ldt, - lapack_complex_float* a, lapack_int* lda, - lapack_complex_float* b, lapack_int* ldb, - const float* mywork, lapack_int* myldwork ); -void LAPACK_ztprfb( char* side, char* trans, char* direct, char* storev, - lapack_int* m, lapack_int* n, lapack_int* k, lapack_int* l, - const lapack_complex_double* v, lapack_int* ldv, - const lapack_complex_double* t, lapack_int* ldt, - lapack_complex_double* a, lapack_int* lda, - lapack_complex_double* b, lapack_int* ldb, - const double* mywork, lapack_int* myldwork ); -// LAPACK 3.X.X -void LAPACK_csyr( char* uplo, lapack_int* n, lapack_complex_float* alpha, - const lapack_complex_float* x, lapack_int* incx, - lapack_complex_float* a, lapack_int* lda ); -void LAPACK_zsyr( char* uplo, lapack_int* n, lapack_complex_double* alpha, - const lapack_complex_double* x, lapack_int* incx, - lapack_complex_double* a, lapack_int* lda ); - -#ifdef __cplusplus -} -#endif /* __cplusplus */ - -#endif /* _LAPACKE_H_ */ - -#endif /* _MKL_LAPACKE_H_ */ diff --git a/Eigen/src/misc/lapacke_mangling.h b/Eigen/src/misc/lapacke_mangling.h deleted file mode 100644 index 6211fd144..000000000 --- a/Eigen/src/misc/lapacke_mangling.h +++ /dev/null @@ -1,17 +0,0 @@ -#ifndef LAPACK_HEADER_INCLUDED -#define LAPACK_HEADER_INCLUDED - -#ifndef LAPACK_GLOBAL -#if defined(LAPACK_GLOBAL_PATTERN_LC) || defined(ADD_) -#define LAPACK_GLOBAL(lcname,UCNAME) lcname##_ -#elif defined(LAPACK_GLOBAL_PATTERN_UC) || defined(UPPER) -#define LAPACK_GLOBAL(lcname,UCNAME) UCNAME -#elif defined(LAPACK_GLOBAL_PATTERN_MC) || defined(NOCHANGE) -#define LAPACK_GLOBAL(lcname,UCNAME) lcname -#else -#define LAPACK_GLOBAL(lcname,UCNAME) lcname##_ -#endif -#endif - -#endif - diff --git a/Eigen/src/plugins/ArrayCwiseBinaryOps.h b/Eigen/src/plugins/ArrayCwiseBinaryOps.h deleted file mode 100644 index 1f8a531af..000000000 --- a/Eigen/src/plugins/ArrayCwiseBinaryOps.h +++ /dev/null @@ -1,332 +0,0 @@ - -/** \returns an expression of the coefficient wise product of \c *this and \a other - * - * \sa MatrixBase::cwiseProduct - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const EIGEN_CWISE_BINARY_RETURN_TYPE(Derived,OtherDerived,product) -operator*(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return EIGEN_CWISE_BINARY_RETURN_TYPE(Derived,OtherDerived,product)(derived(), other.derived()); -} - -/** \returns an expression of the coefficient wise quotient of \c *this and \a other - * - * \sa MatrixBase::cwiseQuotient - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const OtherDerived> -operator/(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); -} - -/** \returns an expression of the coefficient-wise min of \c *this and \a other - * - * Example: \include Cwise_min.cpp - * Output: \verbinclude Cwise_min.out - * - * \sa max() - */ -EIGEN_MAKE_CWISE_BINARY_OP(min,min) - -/** \returns an expression of the coefficient-wise min of \c *this and scalar \a other - * - * \sa max() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, - const CwiseNullaryOp, PlainObject> > -#ifdef EIGEN_PARSED_BY_DOXYGEN -min -#else -(min) -#endif -(const Scalar &other) const -{ - return (min)(Derived::PlainObject::Constant(rows(), cols(), other)); -} - -/** \returns an expression of the coefficient-wise max of \c *this and \a other - * - * Example: \include Cwise_max.cpp - * Output: \verbinclude Cwise_max.out - * - * \sa min() - */ -EIGEN_MAKE_CWISE_BINARY_OP(max,max) - -/** \returns an expression of the coefficient-wise max of \c *this and scalar \a other - * - * \sa min() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, - const CwiseNullaryOp, PlainObject> > -#ifdef EIGEN_PARSED_BY_DOXYGEN -max -#else -(max) -#endif -(const Scalar &other) const -{ - return (max)(Derived::PlainObject::Constant(rows(), cols(), other)); -} - -/** \returns an expression of the coefficient-wise power of \c *this to the given array of \a exponents. - * - * This function computes the coefficient-wise power. - * - * Example: \include Cwise_array_power_array.cpp - * Output: \verbinclude Cwise_array_power_array.out - */ -EIGEN_MAKE_CWISE_BINARY_OP(pow,pow) - -#ifndef EIGEN_PARSED_BY_DOXYGEN -EIGEN_MAKE_SCALAR_BINARY_OP_ONTHERIGHT(pow,pow) -#else -/** \returns an expression of the coefficients of \c *this rasied to the constant power \a exponent - * - * \tparam T is the scalar type of \a exponent. It must be compatible with the scalar type of the given expression. - * - * This function computes the coefficient-wise power. The function MatrixBase::pow() in the - * unsupported module MatrixFunctions computes the matrix power. - * - * Example: \include Cwise_pow.cpp - * Output: \verbinclude Cwise_pow.out - * - * \sa ArrayBase::pow(ArrayBase), square(), cube(), exp(), log() - */ -template -const CwiseBinaryOp,Derived,Constant > pow(const T& exponent) const; -#endif - - -// TODO code generating macros could be moved to Macros.h and could include generation of documentation -#define EIGEN_MAKE_CWISE_COMP_OP(OP, COMPARATOR) \ -template \ -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const OtherDerived> \ -OP(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const \ -{ \ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); \ -}\ -typedef CwiseBinaryOp, const Derived, const CwiseNullaryOp, PlainObject> > Cmp ## COMPARATOR ## ReturnType; \ -typedef CwiseBinaryOp, const CwiseNullaryOp, PlainObject>, const Derived > RCmp ## COMPARATOR ## ReturnType; \ -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const Cmp ## COMPARATOR ## ReturnType \ -OP(const Scalar& s) const { \ - return this->OP(Derived::PlainObject::Constant(rows(), cols(), s)); \ -} \ -EIGEN_DEVICE_FUNC friend EIGEN_STRONG_INLINE const RCmp ## COMPARATOR ## ReturnType \ -OP(const Scalar& s, const Derived& d) { \ - return Derived::PlainObject::Constant(d.rows(), d.cols(), s).OP(d); \ -} - -#define EIGEN_MAKE_CWISE_COMP_R_OP(OP, R_OP, RCOMPARATOR) \ -template \ -EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE const CwiseBinaryOp, const OtherDerived, const Derived> \ -OP(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const \ -{ \ - return CwiseBinaryOp, const OtherDerived, const Derived>(other.derived(), derived()); \ -} \ -EIGEN_DEVICE_FUNC \ -inline const RCmp ## RCOMPARATOR ## ReturnType \ -OP(const Scalar& s) const { \ - return Derived::PlainObject::Constant(rows(), cols(), s).R_OP(*this); \ -} \ -friend inline const Cmp ## RCOMPARATOR ## ReturnType \ -OP(const Scalar& s, const Derived& d) { \ - return d.R_OP(Derived::PlainObject::Constant(d.rows(), d.cols(), s)); \ -} - - - -/** \returns an expression of the coefficient-wise \< operator of *this and \a other - * - * Example: \include Cwise_less.cpp - * Output: \verbinclude Cwise_less.out - * - * \sa all(), any(), operator>(), operator<=() - */ -EIGEN_MAKE_CWISE_COMP_OP(operator<, LT) - -/** \returns an expression of the coefficient-wise \<= operator of *this and \a other - * - * Example: \include Cwise_less_equal.cpp - * Output: \verbinclude Cwise_less_equal.out - * - * \sa all(), any(), operator>=(), operator<() - */ -EIGEN_MAKE_CWISE_COMP_OP(operator<=, LE) - -/** \returns an expression of the coefficient-wise \> operator of *this and \a other - * - * Example: \include Cwise_greater.cpp - * Output: \verbinclude Cwise_greater.out - * - * \sa all(), any(), operator>=(), operator<() - */ -EIGEN_MAKE_CWISE_COMP_R_OP(operator>, operator<, LT) - -/** \returns an expression of the coefficient-wise \>= operator of *this and \a other - * - * Example: \include Cwise_greater_equal.cpp - * Output: \verbinclude Cwise_greater_equal.out - * - * \sa all(), any(), operator>(), operator<=() - */ -EIGEN_MAKE_CWISE_COMP_R_OP(operator>=, operator<=, LE) - -/** \returns an expression of the coefficient-wise == operator of *this and \a other - * - * \warning this performs an exact comparison, which is generally a bad idea with floating-point types. - * In order to check for equality between two vectors or matrices with floating-point coefficients, it is - * generally a far better idea to use a fuzzy comparison as provided by isApprox() and - * isMuchSmallerThan(). - * - * Example: \include Cwise_equal_equal.cpp - * Output: \verbinclude Cwise_equal_equal.out - * - * \sa all(), any(), isApprox(), isMuchSmallerThan() - */ -EIGEN_MAKE_CWISE_COMP_OP(operator==, EQ) - -/** \returns an expression of the coefficient-wise != operator of *this and \a other - * - * \warning this performs an exact comparison, which is generally a bad idea with floating-point types. - * In order to check for equality between two vectors or matrices with floating-point coefficients, it is - * generally a far better idea to use a fuzzy comparison as provided by isApprox() and - * isMuchSmallerThan(). - * - * Example: \include Cwise_not_equal.cpp - * Output: \verbinclude Cwise_not_equal.out - * - * \sa all(), any(), isApprox(), isMuchSmallerThan() - */ -EIGEN_MAKE_CWISE_COMP_OP(operator!=, NEQ) - - -#undef EIGEN_MAKE_CWISE_COMP_OP -#undef EIGEN_MAKE_CWISE_COMP_R_OP - -// scalar addition -#ifndef EIGEN_PARSED_BY_DOXYGEN -EIGEN_MAKE_SCALAR_BINARY_OP(operator+,sum) -#else -/** \returns an expression of \c *this with each coeff incremented by the constant \a scalar - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - * - * Example: \include Cwise_plus.cpp - * Output: \verbinclude Cwise_plus.out - * - * \sa operator+=(), operator-() - */ -template -const CwiseBinaryOp,Derived,Constant > operator+(const T& scalar) const; -/** \returns an expression of \a expr with each coeff incremented by the constant \a scalar - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - */ -template friend -const CwiseBinaryOp,Constant,Derived> operator+(const T& scalar, const StorageBaseType& expr); -#endif - -#ifndef EIGEN_PARSED_BY_DOXYGEN -EIGEN_MAKE_SCALAR_BINARY_OP(operator-,difference) -#else -/** \returns an expression of \c *this with each coeff decremented by the constant \a scalar - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - * - * Example: \include Cwise_minus.cpp - * Output: \verbinclude Cwise_minus.out - * - * \sa operator+=(), operator-() - */ -template -const CwiseBinaryOp,Derived,Constant > operator-(const T& scalar) const; -/** \returns an expression of the constant matrix of value \a scalar decremented by the coefficients of \a expr - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - */ -template friend -const CwiseBinaryOp,Constant,Derived> operator-(const T& scalar, const StorageBaseType& expr); -#endif - - -#ifndef EIGEN_PARSED_BY_DOXYGEN - EIGEN_MAKE_SCALAR_BINARY_OP_ONTHELEFT(operator/,quotient) -#else - /** - * \brief Component-wise division of the scalar \a s by array elements of \a a. - * - * \tparam Scalar is the scalar type of \a x. It must be compatible with the scalar type of the given array expression (\c Derived::Scalar). - */ - template friend - inline const CwiseBinaryOp,Constant,Derived> - operator/(const T& s,const StorageBaseType& a); -#endif - -/** \returns an expression of the coefficient-wise ^ operator of *this and \a other - * - * \warning this operator is for expression of bool only. - * - * Example: \include Cwise_boolean_xor.cpp - * Output: \verbinclude Cwise_boolean_xor.out - * - * \sa operator&&(), select() - */ -template -EIGEN_DEVICE_FUNC -inline const CwiseBinaryOp -operator^(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - EIGEN_STATIC_ASSERT((internal::is_same::value && internal::is_same::value), - THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL); - return CwiseBinaryOp(derived(),other.derived()); -} - -// NOTE disabled until we agree on argument order -#if 0 -/** \cpp11 \returns an expression of the coefficient-wise polygamma function. - * - * \specialfunctions_module - * - * It returns the \a n -th derivative of the digamma(psi) evaluated at \c *this. - * - * \warning Be careful with the order of the parameters: x.polygamma(n) is equivalent to polygamma(n,x) - * - * \sa Eigen::polygamma() - */ -template -inline const CwiseBinaryOp, const DerivedN, const Derived> -polygamma(const EIGEN_CURRENT_STORAGE_BASE_CLASS &n) const -{ - return CwiseBinaryOp, const DerivedN, const Derived>(n.derived(), this->derived()); -} -#endif - -/** \returns an expression of the coefficient-wise zeta function. - * - * \specialfunctions_module - * - * It returns the Riemann zeta function of two arguments \c *this and \a q: - * - * \param *this is the exposent, it must be > 1 - * \param q is the shift, it must be > 0 - * - * \note This function supports only float and double scalar types. To support other scalar types, the user has - * to provide implementations of zeta(T,T) for any scalar type T to be supported. - * - * This method is an alias for zeta(*this,q); - * - * \sa Eigen::zeta() - */ -template -inline const CwiseBinaryOp, const Derived, const DerivedQ> -zeta(const EIGEN_CURRENT_STORAGE_BASE_CLASS &q) const -{ - return CwiseBinaryOp, const Derived, const DerivedQ>(this->derived(), q.derived()); -} diff --git a/Eigen/src/plugins/ArrayCwiseUnaryOps.h b/Eigen/src/plugins/ArrayCwiseUnaryOps.h deleted file mode 100644 index 43615bd56..000000000 --- a/Eigen/src/plugins/ArrayCwiseUnaryOps.h +++ /dev/null @@ -1,567 +0,0 @@ - - -typedef CwiseUnaryOp, const Derived> AbsReturnType; -typedef CwiseUnaryOp, const Derived> ArgReturnType; -typedef CwiseUnaryOp, const Derived> Abs2ReturnType; -typedef CwiseUnaryOp, const Derived> SqrtReturnType; -typedef CwiseUnaryOp, const Derived> RsqrtReturnType; -typedef CwiseUnaryOp, const Derived> SignReturnType; -typedef CwiseUnaryOp, const Derived> InverseReturnType; -typedef CwiseUnaryOp, const Derived> BooleanNotReturnType; - -typedef CwiseUnaryOp, const Derived> ExpReturnType; -typedef CwiseUnaryOp, const Derived> Expm1ReturnType; -typedef CwiseUnaryOp, const Derived> LogReturnType; -typedef CwiseUnaryOp, const Derived> Log1pReturnType; -typedef CwiseUnaryOp, const Derived> Log10ReturnType; -typedef CwiseUnaryOp, const Derived> CosReturnType; -typedef CwiseUnaryOp, const Derived> SinReturnType; -typedef CwiseUnaryOp, const Derived> TanReturnType; -typedef CwiseUnaryOp, const Derived> AcosReturnType; -typedef CwiseUnaryOp, const Derived> AsinReturnType; -typedef CwiseUnaryOp, const Derived> AtanReturnType; -typedef CwiseUnaryOp, const Derived> TanhReturnType; -typedef CwiseUnaryOp, const Derived> SinhReturnType; -typedef CwiseUnaryOp, const Derived> CoshReturnType; -typedef CwiseUnaryOp, const Derived> SquareReturnType; -typedef CwiseUnaryOp, const Derived> CubeReturnType; -typedef CwiseUnaryOp, const Derived> RoundReturnType; -typedef CwiseUnaryOp, const Derived> FloorReturnType; -typedef CwiseUnaryOp, const Derived> CeilReturnType; -typedef CwiseUnaryOp, const Derived> IsNaNReturnType; -typedef CwiseUnaryOp, const Derived> IsInfReturnType; -typedef CwiseUnaryOp, const Derived> IsFiniteReturnType; - -/** \returns an expression of the coefficient-wise absolute value of \c *this - * - * Example: \include Cwise_abs.cpp - * Output: \verbinclude Cwise_abs.out - * - * \sa Math functions, abs2() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const AbsReturnType -abs() const -{ - return AbsReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise phase angle of \c *this - * - * Example: \include Cwise_arg.cpp - * Output: \verbinclude Cwise_arg.out - * - * \sa abs() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const ArgReturnType -arg() const -{ - return ArgReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise squared absolute value of \c *this - * - * Example: \include Cwise_abs2.cpp - * Output: \verbinclude Cwise_abs2.out - * - * \sa Math functions, abs(), square() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const Abs2ReturnType -abs2() const -{ - return Abs2ReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise exponential of *this. - * - * This function computes the coefficient-wise exponential. The function MatrixBase::exp() in the - * unsupported module MatrixFunctions computes the matrix exponential. - * - * Example: \include Cwise_exp.cpp - * Output: \verbinclude Cwise_exp.out - * - * \sa Math functions, pow(), log(), sin(), cos() - */ -EIGEN_DEVICE_FUNC -inline const ExpReturnType -exp() const -{ - return ExpReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise exponential of *this minus 1. - * - * In exact arithmetic, \c x.expm1() is equivalent to \c x.exp() - 1, - * however, with finite precision, this function is much more accurate when \c x is close to zero. - * - * \sa Math functions, exp() - */ -EIGEN_DEVICE_FUNC -inline const Expm1ReturnType -expm1() const -{ - return Expm1ReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise logarithm of *this. - * - * This function computes the coefficient-wise logarithm. The function MatrixBase::log() in the - * unsupported module MatrixFunctions computes the matrix logarithm. - * - * Example: \include Cwise_log.cpp - * Output: \verbinclude Cwise_log.out - * - * \sa Math functions, log() - */ -EIGEN_DEVICE_FUNC -inline const LogReturnType -log() const -{ - return LogReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise logarithm of 1 plus \c *this. - * - * In exact arithmetic, \c x.log() is equivalent to \c (x+1).log(), - * however, with finite precision, this function is much more accurate when \c x is close to zero. - * - * \sa Math functions, log() - */ -EIGEN_DEVICE_FUNC -inline const Log1pReturnType -log1p() const -{ - return Log1pReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise base-10 logarithm of *this. - * - * This function computes the coefficient-wise base-10 logarithm. - * - * Example: \include Cwise_log10.cpp - * Output: \verbinclude Cwise_log10.out - * - * \sa Math functions, log() - */ -EIGEN_DEVICE_FUNC -inline const Log10ReturnType -log10() const -{ - return Log10ReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise square root of *this. - * - * This function computes the coefficient-wise square root. The function MatrixBase::sqrt() in the - * unsupported module MatrixFunctions computes the matrix square root. - * - * Example: \include Cwise_sqrt.cpp - * Output: \verbinclude Cwise_sqrt.out - * - * \sa Math functions, pow(), square() - */ -EIGEN_DEVICE_FUNC -inline const SqrtReturnType -sqrt() const -{ - return SqrtReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise inverse square root of *this. - * - * This function computes the coefficient-wise inverse square root. - * - * Example: \include Cwise_sqrt.cpp - * Output: \verbinclude Cwise_sqrt.out - * - * \sa pow(), square() - */ -EIGEN_DEVICE_FUNC -inline const RsqrtReturnType -rsqrt() const -{ - return RsqrtReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise signum of *this. - * - * This function computes the coefficient-wise signum. - * - * Example: \include Cwise_sign.cpp - * Output: \verbinclude Cwise_sign.out - * - * \sa pow(), square() - */ -EIGEN_DEVICE_FUNC -inline const SignReturnType -sign() const -{ - return SignReturnType(derived()); -} - - -/** \returns an expression of the coefficient-wise cosine of *this. - * - * This function computes the coefficient-wise cosine. The function MatrixBase::cos() in the - * unsupported module MatrixFunctions computes the matrix cosine. - * - * Example: \include Cwise_cos.cpp - * Output: \verbinclude Cwise_cos.out - * - * \sa Math functions, sin(), acos() - */ -EIGEN_DEVICE_FUNC -inline const CosReturnType -cos() const -{ - return CosReturnType(derived()); -} - - -/** \returns an expression of the coefficient-wise sine of *this. - * - * This function computes the coefficient-wise sine. The function MatrixBase::sin() in the - * unsupported module MatrixFunctions computes the matrix sine. - * - * Example: \include Cwise_sin.cpp - * Output: \verbinclude Cwise_sin.out - * - * \sa Math functions, cos(), asin() - */ -EIGEN_DEVICE_FUNC -inline const SinReturnType -sin() const -{ - return SinReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise tan of *this. - * - * Example: \include Cwise_tan.cpp - * Output: \verbinclude Cwise_tan.out - * - * \sa Math functions, cos(), sin() - */ -EIGEN_DEVICE_FUNC -inline const TanReturnType -tan() const -{ - return TanReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise arc tan of *this. - * - * Example: \include Cwise_atan.cpp - * Output: \verbinclude Cwise_atan.out - * - * \sa Math functions, tan(), asin(), acos() - */ -EIGEN_DEVICE_FUNC -inline const AtanReturnType -atan() const -{ - return AtanReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise arc cosine of *this. - * - * Example: \include Cwise_acos.cpp - * Output: \verbinclude Cwise_acos.out - * - * \sa Math functions, cos(), asin() - */ -EIGEN_DEVICE_FUNC -inline const AcosReturnType -acos() const -{ - return AcosReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise arc sine of *this. - * - * Example: \include Cwise_asin.cpp - * Output: \verbinclude Cwise_asin.out - * - * \sa Math functions, sin(), acos() - */ -EIGEN_DEVICE_FUNC -inline const AsinReturnType -asin() const -{ - return AsinReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise hyperbolic tan of *this. - * - * Example: \include Cwise_tanh.cpp - * Output: \verbinclude Cwise_tanh.out - * - * \sa Math functions, tan(), sinh(), cosh() - */ -EIGEN_DEVICE_FUNC -inline const TanhReturnType -tanh() const -{ - return TanhReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise hyperbolic sin of *this. - * - * Example: \include Cwise_sinh.cpp - * Output: \verbinclude Cwise_sinh.out - * - * \sa Math functions, sin(), tanh(), cosh() - */ -EIGEN_DEVICE_FUNC -inline const SinhReturnType -sinh() const -{ - return SinhReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise hyperbolic cos of *this. - * - * Example: \include Cwise_cosh.cpp - * Output: \verbinclude Cwise_cosh.out - * - * \sa Math functions, tan(), sinh(), cosh() - */ -EIGEN_DEVICE_FUNC -inline const CoshReturnType -cosh() const -{ - return CoshReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise inverse of *this. - * - * Example: \include Cwise_inverse.cpp - * Output: \verbinclude Cwise_inverse.out - * - * \sa operator/(), operator*() - */ -EIGEN_DEVICE_FUNC -inline const InverseReturnType -inverse() const -{ - return InverseReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise square of *this. - * - * Example: \include Cwise_square.cpp - * Output: \verbinclude Cwise_square.out - * - * \sa Math functions, abs2(), cube(), pow() - */ -EIGEN_DEVICE_FUNC -inline const SquareReturnType -square() const -{ - return SquareReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise cube of *this. - * - * Example: \include Cwise_cube.cpp - * Output: \verbinclude Cwise_cube.out - * - * \sa Math functions, square(), pow() - */ -EIGEN_DEVICE_FUNC -inline const CubeReturnType -cube() const -{ - return CubeReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise round of *this. - * - * Example: \include Cwise_round.cpp - * Output: \verbinclude Cwise_round.out - * - * \sa Math functions, ceil(), floor() - */ -EIGEN_DEVICE_FUNC -inline const RoundReturnType -round() const -{ - return RoundReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise floor of *this. - * - * Example: \include Cwise_floor.cpp - * Output: \verbinclude Cwise_floor.out - * - * \sa Math functions, ceil(), round() - */ -EIGEN_DEVICE_FUNC -inline const FloorReturnType -floor() const -{ - return FloorReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise ceil of *this. - * - * Example: \include Cwise_ceil.cpp - * Output: \verbinclude Cwise_ceil.out - * - * \sa Math functions, floor(), round() - */ -EIGEN_DEVICE_FUNC -inline const CeilReturnType -ceil() const -{ - return CeilReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise isnan of *this. - * - * Example: \include Cwise_isNaN.cpp - * Output: \verbinclude Cwise_isNaN.out - * - * \sa isfinite(), isinf() - */ -EIGEN_DEVICE_FUNC -inline const IsNaNReturnType -isNaN() const -{ - return IsNaNReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise isinf of *this. - * - * Example: \include Cwise_isInf.cpp - * Output: \verbinclude Cwise_isInf.out - * - * \sa isnan(), isfinite() - */ -EIGEN_DEVICE_FUNC -inline const IsInfReturnType -isInf() const -{ - return IsInfReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise isfinite of *this. - * - * Example: \include Cwise_isFinite.cpp - * Output: \verbinclude Cwise_isFinite.out - * - * \sa isnan(), isinf() - */ -EIGEN_DEVICE_FUNC -inline const IsFiniteReturnType -isFinite() const -{ - return IsFiniteReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise ! operator of *this - * - * \warning this operator is for expression of bool only. - * - * Example: \include Cwise_boolean_not.cpp - * Output: \verbinclude Cwise_boolean_not.out - * - * \sa operator!=() - */ -EIGEN_DEVICE_FUNC -inline const BooleanNotReturnType -operator!() const -{ - EIGEN_STATIC_ASSERT((internal::is_same::value), - THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL); - return BooleanNotReturnType(derived()); -} - - -// --- SpecialFunctions module --- - -typedef CwiseUnaryOp, const Derived> LgammaReturnType; -typedef CwiseUnaryOp, const Derived> DigammaReturnType; -typedef CwiseUnaryOp, const Derived> ErfReturnType; -typedef CwiseUnaryOp, const Derived> ErfcReturnType; - -/** \cpp11 \returns an expression of the coefficient-wise ln(|gamma(*this)|). - * - * \specialfunctions_module - * - * Example: \include Cwise_lgamma.cpp - * Output: \verbinclude Cwise_lgamma.out - * - * \note This function supports only float and double scalar types in c++11 mode. To support other scalar types, - * or float/double in non c++11 mode, the user has to provide implementations of lgamma(T) for any scalar - * type T to be supported. - * - * \sa Math functions, digamma() - */ -EIGEN_DEVICE_FUNC -inline const LgammaReturnType -lgamma() const -{ - return LgammaReturnType(derived()); -} - -/** \returns an expression of the coefficient-wise digamma (psi, derivative of lgamma). - * - * \specialfunctions_module - * - * \note This function supports only float and double scalar types. To support other scalar types, - * the user has to provide implementations of digamma(T) for any scalar - * type T to be supported. - * - * \sa Math functions, Eigen::digamma(), Eigen::polygamma(), lgamma() - */ -EIGEN_DEVICE_FUNC -inline const DigammaReturnType -digamma() const -{ - return DigammaReturnType(derived()); -} - -/** \cpp11 \returns an expression of the coefficient-wise Gauss error - * function of *this. - * - * \specialfunctions_module - * - * Example: \include Cwise_erf.cpp - * Output: \verbinclude Cwise_erf.out - * - * \note This function supports only float and double scalar types in c++11 mode. To support other scalar types, - * or float/double in non c++11 mode, the user has to provide implementations of erf(T) for any scalar - * type T to be supported. - * - * \sa Math functions, erfc() - */ -EIGEN_DEVICE_FUNC -inline const ErfReturnType -erf() const -{ - return ErfReturnType(derived()); -} - -/** \cpp11 \returns an expression of the coefficient-wise Complementary error - * function of *this. - * - * \specialfunctions_module - * - * Example: \include Cwise_erfc.cpp - * Output: \verbinclude Cwise_erfc.out - * - * \note This function supports only float and double scalar types in c++11 mode. To support other scalar types, - * or float/double in non c++11 mode, the user has to provide implementations of erfc(T) for any scalar - * type T to be supported. - * - * \sa Math functions, erf() - */ -EIGEN_DEVICE_FUNC -inline const ErfcReturnType -erfc() const -{ - return ErfcReturnType(derived()); -} diff --git a/Eigen/src/plugins/BlockMethods.h b/Eigen/src/plugins/BlockMethods.h deleted file mode 100644 index 5caf14469..000000000 --- a/Eigen/src/plugins/BlockMethods.h +++ /dev/null @@ -1,1356 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2010 Gael Guennebaud -// Copyright (C) 2006-2010 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#ifndef EIGEN_PARSED_BY_DOXYGEN - -/// \internal expression type of a column */ -typedef Block::RowsAtCompileTime, 1, !IsRowMajor> ColXpr; -typedef const Block::RowsAtCompileTime, 1, !IsRowMajor> ConstColXpr; -/// \internal expression type of a row */ -typedef Block::ColsAtCompileTime, IsRowMajor> RowXpr; -typedef const Block::ColsAtCompileTime, IsRowMajor> ConstRowXpr; -/// \internal expression type of a block of whole columns */ -typedef Block::RowsAtCompileTime, Dynamic, !IsRowMajor> ColsBlockXpr; -typedef const Block::RowsAtCompileTime, Dynamic, !IsRowMajor> ConstColsBlockXpr; -/// \internal expression type of a block of whole rows */ -typedef Block::ColsAtCompileTime, IsRowMajor> RowsBlockXpr; -typedef const Block::ColsAtCompileTime, IsRowMajor> ConstRowsBlockXpr; -/// \internal expression type of a block of whole columns */ -template struct NColsBlockXpr { typedef Block::RowsAtCompileTime, N, !IsRowMajor> Type; }; -template struct ConstNColsBlockXpr { typedef const Block::RowsAtCompileTime, N, !IsRowMajor> Type; }; -/// \internal expression type of a block of whole rows */ -template struct NRowsBlockXpr { typedef Block::ColsAtCompileTime, IsRowMajor> Type; }; -template struct ConstNRowsBlockXpr { typedef const Block::ColsAtCompileTime, IsRowMajor> Type; }; -/// \internal expression of a block */ -typedef Block BlockXpr; -typedef const Block ConstBlockXpr; -/// \internal expression of a block of fixed sizes */ -template struct FixedBlockXpr { typedef Block Type; }; -template struct ConstFixedBlockXpr { typedef Block Type; }; - -typedef VectorBlock SegmentReturnType; -typedef const VectorBlock ConstSegmentReturnType; -template struct FixedSegmentReturnType { typedef VectorBlock Type; }; -template struct ConstFixedSegmentReturnType { typedef const VectorBlock Type; }; - -#endif // not EIGEN_PARSED_BY_DOXYGEN - -/// \returns an expression of a block in \c *this with either dynamic or fixed sizes. -/// -/// \param startRow the first row in the block -/// \param startCol the first column in the block -/// \param blockRows number of rows in the block, specified at either run-time or compile-time -/// \param blockCols number of columns in the block, specified at either run-time or compile-time -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example using runtime (aka dynamic) sizes: \include MatrixBase_block_int_int_int_int.cpp -/// Output: \verbinclude MatrixBase_block_int_int_int_int.out -/// -/// \newin{3.4}: -/// -/// The number of rows \a blockRows and columns \a blockCols can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. In the later case, \c n plays the role of a runtime fallback value in case \c N equals Eigen::Dynamic. -/// Here is an example with a fixed number of rows \c NRows and dynamic number of columns \c cols: -/// \code -/// mat.block(i,j,fix,cols) -/// \endcode -/// -/// This function thus fully covers the features offered by the following overloads block(Index, Index), -/// and block(Index, Index, Index, Index) that are thus obsolete. Indeed, this generic version avoids -/// redundancy, it preserves the argument order, and prevents the need to rely on the template keyword in templated code. -/// -/// but with less redundancy and more consistency as it does not modify the argument order -/// and seamlessly enable hybrid fixed/dynamic sizes. -/// -/// \note Even in the case that the returned expression has dynamic size, in the case -/// when it is applied to a fixed-size matrix, it inherits a fixed maximal size, -/// which means that evaluating it does not cause a dynamic memory allocation. -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa class Block, fix, fix(int) -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline typename FixedBlockXpr<...,...>::Type -#endif -block(Index startRow, Index startCol, NRowsType blockRows, NColsType blockCols) -{ - return typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type( - derived(), startRow, startCol, internal::get_runtime_value(blockRows), internal::get_runtime_value(blockCols)); -} - -/// This is the const version of block(Index,Index,NRowsType,NColsType) -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline const typename ConstFixedBlockXpr<...,...>::Type -#endif -block(Index startRow, Index startCol, NRowsType blockRows, NColsType blockCols) const -{ - return typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type( - derived(), startRow, startCol, internal::get_runtime_value(blockRows), internal::get_runtime_value(blockCols)); -} - - - -/// \returns a expression of a top-right corner of \c *this with either dynamic or fixed sizes. -/// -/// \param cRows the number of rows in the corner -/// \param cCols the number of columns in the corner -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example with dynamic sizes: \include MatrixBase_topRightCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_topRightCorner_int_int.out -/// -/// The number of rows \a blockRows and columns \a blockCols can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline typename FixedBlockXpr<...,...>::Type -#endif -topRightCorner(NRowsType cRows, NColsType cCols) -{ - return typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), 0, cols() - internal::get_runtime_value(cCols), internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// This is the const version of topRightCorner(NRowsType, NColsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline const typename ConstFixedBlockXpr<...,...>::Type -#endif -topRightCorner(NRowsType cRows, NColsType cCols) const -{ - return typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), 0, cols() - internal::get_runtime_value(cCols), internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// \returns an expression of a fixed-size top-right corner of \c *this. -/// -/// \tparam CRows the number of rows in the corner -/// \tparam CCols the number of columns in the corner -/// -/// Example: \include MatrixBase_template_int_int_topRightCorner.cpp -/// Output: \verbinclude MatrixBase_template_int_int_topRightCorner.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa class Block, block(Index,Index) -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedBlockXpr::Type topRightCorner() -{ - return typename FixedBlockXpr::Type(derived(), 0, cols() - CCols); -} - -/// This is the const version of topRightCorner(). -template -EIGEN_DEVICE_FUNC -inline const typename ConstFixedBlockXpr::Type topRightCorner() const -{ - return typename ConstFixedBlockXpr::Type(derived(), 0, cols() - CCols); -} - -/// \returns an expression of a top-right corner of \c *this. -/// -/// \tparam CRows number of rows in corner as specified at compile-time -/// \tparam CCols number of columns in corner as specified at compile-time -/// \param cRows number of rows in corner as specified at run-time -/// \param cCols number of columns in corner as specified at run-time -/// -/// This function is mainly useful for corners where the number of rows is specified at compile-time -/// and the number of columns is specified at run-time, or vice versa. The compile-time and run-time -/// information should not contradict. In other words, \a cRows should equal \a CRows unless -/// \a CRows is \a Dynamic, and the same for the number of columns. -/// -/// Example: \include MatrixBase_template_int_int_topRightCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_template_int_int_topRightCorner_int_int.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa class Block -/// -template -inline typename FixedBlockXpr::Type topRightCorner(Index cRows, Index cCols) -{ - return typename FixedBlockXpr::Type(derived(), 0, cols() - cCols, cRows, cCols); -} - -/// This is the const version of topRightCorner(Index, Index). -template -inline const typename ConstFixedBlockXpr::Type topRightCorner(Index cRows, Index cCols) const -{ - return typename ConstFixedBlockXpr::Type(derived(), 0, cols() - cCols, cRows, cCols); -} - - - -/// \returns an expression of a top-left corner of \c *this with either dynamic or fixed sizes. -/// -/// \param cRows the number of rows in the corner -/// \param cCols the number of columns in the corner -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example: \include MatrixBase_topLeftCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_topLeftCorner_int_int.out -/// -/// The number of rows \a blockRows and columns \a blockCols can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline typename FixedBlockXpr<...,...>::Type -#endif -topLeftCorner(NRowsType cRows, NColsType cCols) -{ - return typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), 0, 0, internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// This is the const version of topLeftCorner(Index, Index). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline const typename ConstFixedBlockXpr<...,...>::Type -#endif -topLeftCorner(NRowsType cRows, NColsType cCols) const -{ - return typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), 0, 0, internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// \returns an expression of a fixed-size top-left corner of \c *this. -/// -/// The template parameters CRows and CCols are the number of rows and columns in the corner. -/// -/// Example: \include MatrixBase_template_int_int_topLeftCorner.cpp -/// Output: \verbinclude MatrixBase_template_int_int_topLeftCorner.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedBlockXpr::Type topLeftCorner() -{ - return typename FixedBlockXpr::Type(derived(), 0, 0); -} - -/// This is the const version of topLeftCorner(). -template -EIGEN_DEVICE_FUNC -inline const typename ConstFixedBlockXpr::Type topLeftCorner() const -{ - return typename ConstFixedBlockXpr::Type(derived(), 0, 0); -} - -/// \returns an expression of a top-left corner of \c *this. -/// -/// \tparam CRows number of rows in corner as specified at compile-time -/// \tparam CCols number of columns in corner as specified at compile-time -/// \param cRows number of rows in corner as specified at run-time -/// \param cCols number of columns in corner as specified at run-time -/// -/// This function is mainly useful for corners where the number of rows is specified at compile-time -/// and the number of columns is specified at run-time, or vice versa. The compile-time and run-time -/// information should not contradict. In other words, \a cRows should equal \a CRows unless -/// \a CRows is \a Dynamic, and the same for the number of columns. -/// -/// Example: \include MatrixBase_template_int_int_topLeftCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_template_int_int_topLeftCorner_int_int.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa class Block -/// -template -inline typename FixedBlockXpr::Type topLeftCorner(Index cRows, Index cCols) -{ - return typename FixedBlockXpr::Type(derived(), 0, 0, cRows, cCols); -} - -/// This is the const version of topLeftCorner(Index, Index). -template -inline const typename ConstFixedBlockXpr::Type topLeftCorner(Index cRows, Index cCols) const -{ - return typename ConstFixedBlockXpr::Type(derived(), 0, 0, cRows, cCols); -} - - - -/// \returns an expression of a bottom-right corner of \c *this with either dynamic or fixed sizes. -/// -/// \param cRows the number of rows in the corner -/// \param cCols the number of columns in the corner -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example: \include MatrixBase_bottomRightCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_bottomRightCorner_int_int.out -/// -/// The number of rows \a blockRows and columns \a blockCols can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline typename FixedBlockXpr<...,...>::Type -#endif -bottomRightCorner(NRowsType cRows, NColsType cCols) -{ - return typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), rows() - internal::get_runtime_value(cRows), cols() - internal::get_runtime_value(cCols), - internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// This is the const version of bottomRightCorner(NRowsType, NColsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline const typename ConstFixedBlockXpr<...,...>::Type -#endif -bottomRightCorner(NRowsType cRows, NColsType cCols) const -{ - return typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), rows() - internal::get_runtime_value(cRows), cols() - internal::get_runtime_value(cCols), - internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// \returns an expression of a fixed-size bottom-right corner of \c *this. -/// -/// The template parameters CRows and CCols are the number of rows and columns in the corner. -/// -/// Example: \include MatrixBase_template_int_int_bottomRightCorner.cpp -/// Output: \verbinclude MatrixBase_template_int_int_bottomRightCorner.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedBlockXpr::Type bottomRightCorner() -{ - return typename FixedBlockXpr::Type(derived(), rows() - CRows, cols() - CCols); -} - -/// This is the const version of bottomRightCorner(). -template -EIGEN_DEVICE_FUNC -inline const typename ConstFixedBlockXpr::Type bottomRightCorner() const -{ - return typename ConstFixedBlockXpr::Type(derived(), rows() - CRows, cols() - CCols); -} - -/// \returns an expression of a bottom-right corner of \c *this. -/// -/// \tparam CRows number of rows in corner as specified at compile-time -/// \tparam CCols number of columns in corner as specified at compile-time -/// \param cRows number of rows in corner as specified at run-time -/// \param cCols number of columns in corner as specified at run-time -/// -/// This function is mainly useful for corners where the number of rows is specified at compile-time -/// and the number of columns is specified at run-time, or vice versa. The compile-time and run-time -/// information should not contradict. In other words, \a cRows should equal \a CRows unless -/// \a CRows is \a Dynamic, and the same for the number of columns. -/// -/// Example: \include MatrixBase_template_int_int_bottomRightCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_template_int_int_bottomRightCorner_int_int.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa class Block -/// -template -inline typename FixedBlockXpr::Type bottomRightCorner(Index cRows, Index cCols) -{ - return typename FixedBlockXpr::Type(derived(), rows() - cRows, cols() - cCols, cRows, cCols); -} - -/// This is the const version of bottomRightCorner(Index, Index). -template -inline const typename ConstFixedBlockXpr::Type bottomRightCorner(Index cRows, Index cCols) const -{ - return typename ConstFixedBlockXpr::Type(derived(), rows() - cRows, cols() - cCols, cRows, cCols); -} - - - -/// \returns an expression of a bottom-left corner of \c *this with either dynamic or fixed sizes. -/// -/// \param cRows the number of rows in the corner -/// \param cCols the number of columns in the corner -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example: \include MatrixBase_bottomLeftCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_bottomLeftCorner_int_int.out -/// -/// The number of rows \a blockRows and columns \a blockCols can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline typename FixedBlockXpr<...,...>::Type -#endif -bottomLeftCorner(NRowsType cRows, NColsType cCols) -{ - return typename FixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), rows() - internal::get_runtime_value(cRows), 0, - internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// This is the const version of bottomLeftCorner(NRowsType, NColsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type -#else -inline typename ConstFixedBlockXpr<...,...>::Type -#endif -bottomLeftCorner(NRowsType cRows, NColsType cCols) const -{ - return typename ConstFixedBlockXpr::value,internal::get_fixed_value::value>::Type - (derived(), rows() - internal::get_runtime_value(cRows), 0, - internal::get_runtime_value(cRows), internal::get_runtime_value(cCols)); -} - -/// \returns an expression of a fixed-size bottom-left corner of \c *this. -/// -/// The template parameters CRows and CCols are the number of rows and columns in the corner. -/// -/// Example: \include MatrixBase_template_int_int_bottomLeftCorner.cpp -/// Output: \verbinclude MatrixBase_template_int_int_bottomLeftCorner.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedBlockXpr::Type bottomLeftCorner() -{ - return typename FixedBlockXpr::Type(derived(), rows() - CRows, 0); -} - -/// This is the const version of bottomLeftCorner(). -template -EIGEN_DEVICE_FUNC -inline const typename ConstFixedBlockXpr::Type bottomLeftCorner() const -{ - return typename ConstFixedBlockXpr::Type(derived(), rows() - CRows, 0); -} - -/// \returns an expression of a bottom-left corner of \c *this. -/// -/// \tparam CRows number of rows in corner as specified at compile-time -/// \tparam CCols number of columns in corner as specified at compile-time -/// \param cRows number of rows in corner as specified at run-time -/// \param cCols number of columns in corner as specified at run-time -/// -/// This function is mainly useful for corners where the number of rows is specified at compile-time -/// and the number of columns is specified at run-time, or vice versa. The compile-time and run-time -/// information should not contradict. In other words, \a cRows should equal \a CRows unless -/// \a CRows is \a Dynamic, and the same for the number of columns. -/// -/// Example: \include MatrixBase_template_int_int_bottomLeftCorner_int_int.cpp -/// Output: \verbinclude MatrixBase_template_int_int_bottomLeftCorner_int_int.out -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa class Block -/// -template -inline typename FixedBlockXpr::Type bottomLeftCorner(Index cRows, Index cCols) -{ - return typename FixedBlockXpr::Type(derived(), rows() - cRows, 0, cRows, cCols); -} - -/// This is the const version of bottomLeftCorner(Index, Index). -template -inline const typename ConstFixedBlockXpr::Type bottomLeftCorner(Index cRows, Index cCols) const -{ - return typename ConstFixedBlockXpr::Type(derived(), rows() - cRows, 0, cRows, cCols); -} - - - -/// \returns a block consisting of the top rows of \c *this. -/// -/// \param n the number of rows in the block -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// -/// Example: \include MatrixBase_topRows_int.cpp -/// Output: \verbinclude MatrixBase_topRows_int.out -/// -/// The number of rows \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename NRowsBlockXpr::value>::Type -#else -inline typename NRowsBlockXpr<...>::Type -#endif -topRows(NRowsType n) -{ - return typename NRowsBlockXpr::value>::Type - (derived(), 0, 0, internal::get_runtime_value(n), cols()); -} - -/// This is the const version of topRows(NRowsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstNRowsBlockXpr::value>::Type -#else -inline const typename ConstNRowsBlockXpr<...>::Type -#endif -topRows(NRowsType n) const -{ - return typename ConstNRowsBlockXpr::value>::Type - (derived(), 0, 0, internal::get_runtime_value(n), cols()); -} - -/// \returns a block consisting of the top rows of \c *this. -/// -/// \tparam N the number of rows in the block as specified at compile-time -/// \param n the number of rows in the block as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_topRows.cpp -/// Output: \verbinclude MatrixBase_template_int_topRows.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename NRowsBlockXpr::Type topRows(Index n = N) -{ - return typename NRowsBlockXpr::Type(derived(), 0, 0, n, cols()); -} - -/// This is the const version of topRows(). -template -EIGEN_DEVICE_FUNC -inline typename ConstNRowsBlockXpr::Type topRows(Index n = N) const -{ - return typename ConstNRowsBlockXpr::Type(derived(), 0, 0, n, cols()); -} - - - -/// \returns a block consisting of the bottom rows of \c *this. -/// -/// \param n the number of rows in the block -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// -/// Example: \include MatrixBase_bottomRows_int.cpp -/// Output: \verbinclude MatrixBase_bottomRows_int.out -/// -/// The number of rows \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename NRowsBlockXpr::value>::Type -#else -inline typename NRowsBlockXpr<...>::Type -#endif -bottomRows(NRowsType n) -{ - return typename NRowsBlockXpr::value>::Type - (derived(), rows() - internal::get_runtime_value(n), 0, internal::get_runtime_value(n), cols()); -} - -/// This is the const version of bottomRows(NRowsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstNRowsBlockXpr::value>::Type -#else -inline const typename ConstNRowsBlockXpr<...>::Type -#endif -bottomRows(NRowsType n) const -{ - return typename ConstNRowsBlockXpr::value>::Type - (derived(), rows() - internal::get_runtime_value(n), 0, internal::get_runtime_value(n), cols()); -} - -/// \returns a block consisting of the bottom rows of \c *this. -/// -/// \tparam N the number of rows in the block as specified at compile-time -/// \param n the number of rows in the block as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_bottomRows.cpp -/// Output: \verbinclude MatrixBase_template_int_bottomRows.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename NRowsBlockXpr::Type bottomRows(Index n = N) -{ - return typename NRowsBlockXpr::Type(derived(), rows() - n, 0, n, cols()); -} - -/// This is the const version of bottomRows(). -template -EIGEN_DEVICE_FUNC -inline typename ConstNRowsBlockXpr::Type bottomRows(Index n = N) const -{ - return typename ConstNRowsBlockXpr::Type(derived(), rows() - n, 0, n, cols()); -} - - - -/// \returns a block consisting of a range of rows of \c *this. -/// -/// \param startRow the index of the first row in the block -/// \param n the number of rows in the block -/// \tparam NRowsType the type of the value handling the number of rows in the block, typically Index. -/// -/// Example: \include DenseBase_middleRows_int.cpp -/// Output: \verbinclude DenseBase_middleRows_int.out -/// -/// The number of rows \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename NRowsBlockXpr::value>::Type -#else -inline typename NRowsBlockXpr<...>::Type -#endif -middleRows(Index startRow, NRowsType n) -{ - return typename NRowsBlockXpr::value>::Type - (derived(), startRow, 0, internal::get_runtime_value(n), cols()); -} - -/// This is the const version of middleRows(Index,NRowsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstNRowsBlockXpr::value>::Type -#else -inline const typename ConstNRowsBlockXpr<...>::Type -#endif -middleRows(Index startRow, NRowsType n) const -{ - return typename ConstNRowsBlockXpr::value>::Type - (derived(), startRow, 0, internal::get_runtime_value(n), cols()); -} - -/// \returns a block consisting of a range of rows of \c *this. -/// -/// \tparam N the number of rows in the block as specified at compile-time -/// \param startRow the index of the first row in the block -/// \param n the number of rows in the block as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include DenseBase_template_int_middleRows.cpp -/// Output: \verbinclude DenseBase_template_int_middleRows.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename NRowsBlockXpr::Type middleRows(Index startRow, Index n = N) -{ - return typename NRowsBlockXpr::Type(derived(), startRow, 0, n, cols()); -} - -/// This is the const version of middleRows(). -template -EIGEN_DEVICE_FUNC -inline typename ConstNRowsBlockXpr::Type middleRows(Index startRow, Index n = N) const -{ - return typename ConstNRowsBlockXpr::Type(derived(), startRow, 0, n, cols()); -} - - - -/// \returns a block consisting of the left columns of \c *this. -/// -/// \param n the number of columns in the block -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example: \include MatrixBase_leftCols_int.cpp -/// Output: \verbinclude MatrixBase_leftCols_int.out -/// -/// The number of columns \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename NColsBlockXpr::value>::Type -#else -inline typename NColsBlockXpr<...>::Type -#endif -leftCols(NColsType n) -{ - return typename NColsBlockXpr::value>::Type - (derived(), 0, 0, rows(), internal::get_runtime_value(n)); -} - -/// This is the const version of leftCols(NColsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstNColsBlockXpr::value>::Type -#else -inline const typename ConstNColsBlockXpr<...>::Type -#endif -leftCols(NColsType n) const -{ - return typename ConstNColsBlockXpr::value>::Type - (derived(), 0, 0, rows(), internal::get_runtime_value(n)); -} - -/// \returns a block consisting of the left columns of \c *this. -/// -/// \tparam N the number of columns in the block as specified at compile-time -/// \param n the number of columns in the block as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_leftCols.cpp -/// Output: \verbinclude MatrixBase_template_int_leftCols.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename NColsBlockXpr::Type leftCols(Index n = N) -{ - return typename NColsBlockXpr::Type(derived(), 0, 0, rows(), n); -} - -/// This is the const version of leftCols(). -template -EIGEN_DEVICE_FUNC -inline typename ConstNColsBlockXpr::Type leftCols(Index n = N) const -{ - return typename ConstNColsBlockXpr::Type(derived(), 0, 0, rows(), n); -} - - - -/// \returns a block consisting of the right columns of \c *this. -/// -/// \param n the number of columns in the block -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example: \include MatrixBase_rightCols_int.cpp -/// Output: \verbinclude MatrixBase_rightCols_int.out -/// -/// The number of columns \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename NColsBlockXpr::value>::Type -#else -inline typename NColsBlockXpr<...>::Type -#endif -rightCols(NColsType n) -{ - return typename NColsBlockXpr::value>::Type - (derived(), 0, cols() - internal::get_runtime_value(n), rows(), internal::get_runtime_value(n)); -} - -/// This is the const version of rightCols(NColsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstNColsBlockXpr::value>::Type -#else -inline const typename ConstNColsBlockXpr<...>::Type -#endif -rightCols(NColsType n) const -{ - return typename ConstNColsBlockXpr::value>::Type - (derived(), 0, cols() - internal::get_runtime_value(n), rows(), internal::get_runtime_value(n)); -} - -/// \returns a block consisting of the right columns of \c *this. -/// -/// \tparam N the number of columns in the block as specified at compile-time -/// \param n the number of columns in the block as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_rightCols.cpp -/// Output: \verbinclude MatrixBase_template_int_rightCols.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename NColsBlockXpr::Type rightCols(Index n = N) -{ - return typename NColsBlockXpr::Type(derived(), 0, cols() - n, rows(), n); -} - -/// This is the const version of rightCols(). -template -EIGEN_DEVICE_FUNC -inline typename ConstNColsBlockXpr::Type rightCols(Index n = N) const -{ - return typename ConstNColsBlockXpr::Type(derived(), 0, cols() - n, rows(), n); -} - - - -/// \returns a block consisting of a range of columns of \c *this. -/// -/// \param startCol the index of the first column in the block -/// \param numCols the number of columns in the block -/// \tparam NColsType the type of the value handling the number of columns in the block, typically Index. -/// -/// Example: \include DenseBase_middleCols_int.cpp -/// Output: \verbinclude DenseBase_middleCols_int.out -/// -/// The number of columns \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename NColsBlockXpr::value>::Type -#else -inline typename NColsBlockXpr<...>::Type -#endif -middleCols(Index startCol, NColsType numCols) -{ - return typename NColsBlockXpr::value>::Type - (derived(), 0, startCol, rows(), internal::get_runtime_value(numCols)); -} - -/// This is the const version of middleCols(Index,NColsType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstNColsBlockXpr::value>::Type -#else -inline const typename ConstNColsBlockXpr<...>::Type -#endif -middleCols(Index startCol, NColsType numCols) const -{ - return typename ConstNColsBlockXpr::value>::Type - (derived(), 0, startCol, rows(), internal::get_runtime_value(numCols)); -} - -/// \returns a block consisting of a range of columns of \c *this. -/// -/// \tparam N the number of columns in the block as specified at compile-time -/// \param startCol the index of the first column in the block -/// \param n the number of columns in the block as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include DenseBase_template_int_middleCols.cpp -/// Output: \verbinclude DenseBase_template_int_middleCols.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename NColsBlockXpr::Type middleCols(Index startCol, Index n = N) -{ - return typename NColsBlockXpr::Type(derived(), 0, startCol, rows(), n); -} - -/// This is the const version of middleCols(). -template -EIGEN_DEVICE_FUNC -inline typename ConstNColsBlockXpr::Type middleCols(Index startCol, Index n = N) const -{ - return typename ConstNColsBlockXpr::Type(derived(), 0, startCol, rows(), n); -} - - - -/// \returns a fixed-size expression of a block of \c *this. -/// -/// The template parameters \a NRows and \a NCols are the number of -/// rows and columns in the block. -/// -/// \param startRow the first row in the block -/// \param startCol the first column in the block -/// -/// Example: \include MatrixBase_block_int_int.cpp -/// Output: \verbinclude MatrixBase_block_int_int.out -/// -/// \note The usage of of this overload is discouraged from %Eigen 3.4, better used the generic -/// block(Index,Index,NRowsType,NColsType), here is the one-to-one equivalence: -/// \code -/// mat.template block(i,j) <--> mat.block(i,j,fix,fix) -/// \endcode -/// -/// \note since block is a templated member, the keyword template has to be used -/// if the matrix type is also a template parameter: \code m.template block<3,3>(1,1); \endcode -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedBlockXpr::Type block(Index startRow, Index startCol) -{ - return typename FixedBlockXpr::Type(derived(), startRow, startCol); -} - -/// This is the const version of block<>(Index, Index). */ -template -EIGEN_DEVICE_FUNC -inline const typename ConstFixedBlockXpr::Type block(Index startRow, Index startCol) const -{ - return typename ConstFixedBlockXpr::Type(derived(), startRow, startCol); -} - -/// \returns an expression of a block of \c *this. -/// -/// \tparam NRows number of rows in block as specified at compile-time -/// \tparam NCols number of columns in block as specified at compile-time -/// \param startRow the first row in the block -/// \param startCol the first column in the block -/// \param blockRows number of rows in block as specified at run-time -/// \param blockCols number of columns in block as specified at run-time -/// -/// This function is mainly useful for blocks where the number of rows is specified at compile-time -/// and the number of columns is specified at run-time, or vice versa. The compile-time and run-time -/// information should not contradict. In other words, \a blockRows should equal \a NRows unless -/// \a NRows is \a Dynamic, and the same for the number of columns. -/// -/// Example: \include MatrixBase_template_int_int_block_int_int_int_int.cpp -/// Output: \verbinclude MatrixBase_template_int_int_block_int_int_int_int.cpp -/// -/// \note The usage of of this overload is discouraged from %Eigen 3.4, better used the generic -/// block(Index,Index,NRowsType,NColsType), here is the one-to-one complete equivalence: -/// \code -/// mat.template block(i,j,rows,cols) <--> mat.block(i,j,fix(rows),fix(cols)) -/// \endcode -/// If we known that, e.g., NRows==Dynamic and NCols!=Dynamic, then the equivalence becomes: -/// \code -/// mat.template block(i,j,rows,NCols) <--> mat.block(i,j,rows,fix) -/// \endcode -/// -EIGEN_DOC_BLOCK_ADDONS_NOT_INNER_PANEL -/// -/// \sa block(Index,Index,NRowsType,NColsType), class Block -/// -template -inline typename FixedBlockXpr::Type block(Index startRow, Index startCol, - Index blockRows, Index blockCols) -{ - return typename FixedBlockXpr::Type(derived(), startRow, startCol, blockRows, blockCols); -} - -/// This is the const version of block<>(Index, Index, Index, Index). -template -inline const typename ConstFixedBlockXpr::Type block(Index startRow, Index startCol, - Index blockRows, Index blockCols) const -{ - return typename ConstFixedBlockXpr::Type(derived(), startRow, startCol, blockRows, blockCols); -} - -/// \returns an expression of the \a i-th column of \c *this. Note that the numbering starts at 0. -/// -/// Example: \include MatrixBase_col.cpp -/// Output: \verbinclude MatrixBase_col.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(column-major) -/** - * \sa row(), class Block */ -EIGEN_DEVICE_FUNC -inline ColXpr col(Index i) -{ - return ColXpr(derived(), i); -} - -/// This is the const version of col(). -EIGEN_DEVICE_FUNC -inline ConstColXpr col(Index i) const -{ - return ConstColXpr(derived(), i); -} - -/// \returns an expression of the \a i-th row of \c *this. Note that the numbering starts at 0. -/// -/// Example: \include MatrixBase_row.cpp -/// Output: \verbinclude MatrixBase_row.out -/// -EIGEN_DOC_BLOCK_ADDONS_INNER_PANEL_IF(row-major) -/** - * \sa col(), class Block */ -EIGEN_DEVICE_FUNC -inline RowXpr row(Index i) -{ - return RowXpr(derived(), i); -} - -/// This is the const version of row(). */ -EIGEN_DEVICE_FUNC -inline ConstRowXpr row(Index i) const -{ - return ConstRowXpr(derived(), i); -} - -/// \returns an expression of a segment (i.e. a vector block) in \c *this with either dynamic or fixed sizes. -/// -/// \only_for_vectors -/// -/// \param start the first coefficient in the segment -/// \param n the number of coefficients in the segment -/// \tparam NType the type of the value handling the number of coefficients in the segment, typically Index. -/// -/// Example: \include MatrixBase_segment_int_int.cpp -/// Output: \verbinclude MatrixBase_segment_int_int.out -/// -/// The number of coefficients \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -/// \note Even in the case that the returned expression has dynamic size, in the case -/// when it is applied to a fixed-size vector, it inherits a fixed maximal size, -/// which means that evaluating it does not cause a dynamic memory allocation. -/// -/// \sa block(Index,Index,NRowsType,NColsType), fix, fix(int), class Block -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedSegmentReturnType::value>::Type -#else -inline typename FixedSegmentReturnType<...>::Type -#endif -segment(Index start, NType n) -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename FixedSegmentReturnType::value>::Type - (derived(), start, internal::get_runtime_value(n)); -} - - -/// This is the const version of segment(Index,NType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedSegmentReturnType::value>::Type -#else -inline const typename ConstFixedSegmentReturnType<...>::Type -#endif -segment(Index start, NType n) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename ConstFixedSegmentReturnType::value>::Type - (derived(), start, internal::get_runtime_value(n)); -} - -/// \returns an expression of the first coefficients of \c *this with either dynamic or fixed sizes. -/// -/// \only_for_vectors -/// -/// \param n the number of coefficients in the segment -/// \tparam NType the type of the value handling the number of coefficients in the segment, typically Index. -/// -/// Example: \include MatrixBase_start_int.cpp -/// Output: \verbinclude MatrixBase_start_int.out -/// -/// The number of coefficients \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -/// \note Even in the case that the returned expression has dynamic size, in the case -/// when it is applied to a fixed-size vector, it inherits a fixed maximal size, -/// which means that evaluating it does not cause a dynamic memory allocation. -/// -/// \sa class Block, block(Index,Index) -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedSegmentReturnType::value>::Type -#else -inline typename FixedSegmentReturnType<...>::Type -#endif -head(NType n) -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename FixedSegmentReturnType::value>::Type - (derived(), 0, internal::get_runtime_value(n)); -} - -/// This is the const version of head(NType). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedSegmentReturnType::value>::Type -#else -inline const typename ConstFixedSegmentReturnType<...>::Type -#endif -head(NType n) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename ConstFixedSegmentReturnType::value>::Type - (derived(), 0, internal::get_runtime_value(n)); -} - -/// \returns an expression of a last coefficients of \c *this with either dynamic or fixed sizes. -/// -/// \only_for_vectors -/// -/// \param n the number of coefficients in the segment -/// \tparam NType the type of the value handling the number of coefficients in the segment, typically Index. -/// -/// Example: \include MatrixBase_end_int.cpp -/// Output: \verbinclude MatrixBase_end_int.out -/// -/// The number of coefficients \a n can also be specified at compile-time by passing Eigen::fix, -/// or Eigen::fix(n) as arguments. -/// See \link block(Index,Index,NRowsType,NColsType) block() \endlink for the details. -/// -/// \note Even in the case that the returned expression has dynamic size, in the case -/// when it is applied to a fixed-size vector, it inherits a fixed maximal size, -/// which means that evaluating it does not cause a dynamic memory allocation. -/// -/// \sa class Block, block(Index,Index) -/// -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline typename FixedSegmentReturnType::value>::Type -#else -inline typename FixedSegmentReturnType<...>::Type -#endif -tail(NType n) -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename FixedSegmentReturnType::value>::Type - (derived(), this->size() - internal::get_runtime_value(n), internal::get_runtime_value(n)); -} - -/// This is the const version of tail(Index). -template -EIGEN_DEVICE_FUNC -#ifndef EIGEN_PARSED_BY_DOXYGEN -inline const typename ConstFixedSegmentReturnType::value>::Type -#else -inline const typename ConstFixedSegmentReturnType<...>::Type -#endif -tail(NType n) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename ConstFixedSegmentReturnType::value>::Type - (derived(), this->size() - internal::get_runtime_value(n), internal::get_runtime_value(n)); -} - -/// \returns a fixed-size expression of a segment (i.e. a vector block) in \c *this -/// -/// \only_for_vectors -/// -/// \tparam N the number of coefficients in the segment as specified at compile-time -/// \param start the index of the first element in the segment -/// \param n the number of coefficients in the segment as specified at compile-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_segment.cpp -/// Output: \verbinclude MatrixBase_template_int_segment.out -/// -/// \sa segment(Index,NType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedSegmentReturnType::Type segment(Index start, Index n = N) -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename FixedSegmentReturnType::Type(derived(), start, n); -} - -/// This is the const version of segment(Index). -template -EIGEN_DEVICE_FUNC -inline typename ConstFixedSegmentReturnType::Type segment(Index start, Index n = N) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename ConstFixedSegmentReturnType::Type(derived(), start, n); -} - -/// \returns a fixed-size expression of the first coefficients of \c *this. -/// -/// \only_for_vectors -/// -/// \tparam N the number of coefficients in the segment as specified at compile-time -/// \param n the number of coefficients in the segment as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_start.cpp -/// Output: \verbinclude MatrixBase_template_int_start.out -/// -/// \sa head(NType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedSegmentReturnType::Type head(Index n = N) -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename FixedSegmentReturnType::Type(derived(), 0, n); -} - -/// This is the const version of head(). -template -EIGEN_DEVICE_FUNC -inline typename ConstFixedSegmentReturnType::Type head(Index n = N) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename ConstFixedSegmentReturnType::Type(derived(), 0, n); -} - -/// \returns a fixed-size expression of the last coefficients of \c *this. -/// -/// \only_for_vectors -/// -/// \tparam N the number of coefficients in the segment as specified at compile-time -/// \param n the number of coefficients in the segment as specified at run-time -/// -/// The compile-time and run-time information should not contradict. In other words, -/// \a n should equal \a N unless \a N is \a Dynamic. -/// -/// Example: \include MatrixBase_template_int_end.cpp -/// Output: \verbinclude MatrixBase_template_int_end.out -/// -/// \sa tail(NType), class Block -/// -template -EIGEN_DEVICE_FUNC -inline typename FixedSegmentReturnType::Type tail(Index n = N) -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename FixedSegmentReturnType::Type(derived(), size() - n); -} - -/// This is the const version of tail. -template -EIGEN_DEVICE_FUNC -inline typename ConstFixedSegmentReturnType::Type tail(Index n = N) const -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return typename ConstFixedSegmentReturnType::Type(derived(), size() - n); -} diff --git a/Eigen/src/plugins/CommonCwiseBinaryOps.h b/Eigen/src/plugins/CommonCwiseBinaryOps.h deleted file mode 100644 index 8b6730ede..000000000 --- a/Eigen/src/plugins/CommonCwiseBinaryOps.h +++ /dev/null @@ -1,115 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2016 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -// This file is a base class plugin containing common coefficient wise functions. - -/** \returns an expression of the difference of \c *this and \a other - * - * \note If you want to substract a given scalar from all coefficients, see Cwise::operator-(). - * - * \sa class CwiseBinaryOp, operator-=() - */ -EIGEN_MAKE_CWISE_BINARY_OP(operator-,difference) - -/** \returns an expression of the sum of \c *this and \a other - * - * \note If you want to add a given scalar to all coefficients, see Cwise::operator+(). - * - * \sa class CwiseBinaryOp, operator+=() - */ -EIGEN_MAKE_CWISE_BINARY_OP(operator+,sum) - -/** \returns an expression of a custom coefficient-wise operator \a func of *this and \a other - * - * The template parameter \a CustomBinaryOp is the type of the functor - * of the custom operator (see class CwiseBinaryOp for an example) - * - * Here is an example illustrating the use of custom functors: - * \include class_CwiseBinaryOp.cpp - * Output: \verbinclude class_CwiseBinaryOp.out - * - * \sa class CwiseBinaryOp, operator+(), operator-(), cwiseProduct() - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp -binaryExpr(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other, const CustomBinaryOp& func = CustomBinaryOp()) const -{ - return CwiseBinaryOp(derived(), other.derived(), func); -} - - -#ifndef EIGEN_PARSED_BY_DOXYGEN -EIGEN_MAKE_SCALAR_BINARY_OP(operator*,product) -#else -/** \returns an expression of \c *this scaled by the scalar factor \a scalar - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - */ -template -const CwiseBinaryOp,Derived,Constant > operator*(const T& scalar) const; -/** \returns an expression of \a expr scaled by the scalar factor \a scalar - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - */ -template friend -const CwiseBinaryOp,Constant,Derived> operator*(const T& scalar, const StorageBaseType& expr); -#endif - - - -#ifndef EIGEN_PARSED_BY_DOXYGEN -EIGEN_MAKE_SCALAR_BINARY_OP_ONTHERIGHT(operator/,quotient) -#else -/** \returns an expression of \c *this divided by the scalar value \a scalar - * - * \tparam T is the scalar type of \a scalar. It must be compatible with the scalar type of the given expression. - */ -template -const CwiseBinaryOp,Derived,Constant > operator/(const T& scalar) const; -#endif - -/** \returns an expression of the coefficient-wise boolean \b and operator of \c *this and \a other - * - * \warning this operator is for expression of bool only. - * - * Example: \include Cwise_boolean_and.cpp - * Output: \verbinclude Cwise_boolean_and.out - * - * \sa operator||(), select() - */ -template -EIGEN_DEVICE_FUNC -inline const CwiseBinaryOp -operator&&(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - EIGEN_STATIC_ASSERT((internal::is_same::value && internal::is_same::value), - THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL); - return CwiseBinaryOp(derived(),other.derived()); -} - -/** \returns an expression of the coefficient-wise boolean \b or operator of \c *this and \a other - * - * \warning this operator is for expression of bool only. - * - * Example: \include Cwise_boolean_or.cpp - * Output: \verbinclude Cwise_boolean_or.out - * - * \sa operator&&(), select() - */ -template -EIGEN_DEVICE_FUNC -inline const CwiseBinaryOp -operator||(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - EIGEN_STATIC_ASSERT((internal::is_same::value && internal::is_same::value), - THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL); - return CwiseBinaryOp(derived(),other.derived()); -} diff --git a/Eigen/src/plugins/CommonCwiseUnaryOps.h b/Eigen/src/plugins/CommonCwiseUnaryOps.h deleted file mode 100644 index 89f4faaac..000000000 --- a/Eigen/src/plugins/CommonCwiseUnaryOps.h +++ /dev/null @@ -1,163 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -// This file is a base class plugin containing common coefficient wise functions. - -#ifndef EIGEN_PARSED_BY_DOXYGEN - -/** \internal the return type of conjugate() */ -typedef typename internal::conditional::IsComplex, - const CwiseUnaryOp, const Derived>, - const Derived& - >::type ConjugateReturnType; -/** \internal the return type of real() const */ -typedef typename internal::conditional::IsComplex, - const CwiseUnaryOp, const Derived>, - const Derived& - >::type RealReturnType; -/** \internal the return type of real() */ -typedef typename internal::conditional::IsComplex, - CwiseUnaryView, Derived>, - Derived& - >::type NonConstRealReturnType; -/** \internal the return type of imag() const */ -typedef CwiseUnaryOp, const Derived> ImagReturnType; -/** \internal the return type of imag() */ -typedef CwiseUnaryView, Derived> NonConstImagReturnType; - -typedef CwiseUnaryOp, const Derived> NegativeReturnType; - -#endif // not EIGEN_PARSED_BY_DOXYGEN - -/// \returns an expression of the opposite of \c *this -/// -EIGEN_DOC_UNARY_ADDONS(operator-,opposite) -/// -EIGEN_DEVICE_FUNC -inline const NegativeReturnType -operator-() const { return NegativeReturnType(derived()); } - - -template struct CastXpr { typedef typename internal::cast_return_type, const Derived> >::type Type; }; - -/// \returns an expression of \c *this with the \a Scalar type casted to -/// \a NewScalar. -/// -/// The template parameter \a NewScalar is the type we are casting the scalars to. -/// -EIGEN_DOC_UNARY_ADDONS(cast,conversion function) -/// -/// \sa class CwiseUnaryOp -/// -template -EIGEN_DEVICE_FUNC -typename CastXpr::Type -cast() const -{ - return typename CastXpr::Type(derived()); -} - -/// \returns an expression of the complex conjugate of \c *this. -/// -EIGEN_DOC_UNARY_ADDONS(conjugate,complex conjugate) -/// -/// \sa Math functions, MatrixBase::adjoint() -EIGEN_DEVICE_FUNC -inline ConjugateReturnType -conjugate() const -{ - return ConjugateReturnType(derived()); -} - -/// \returns a read-only expression of the real part of \c *this. -/// -EIGEN_DOC_UNARY_ADDONS(real,real part function) -/// -/// \sa imag() -EIGEN_DEVICE_FUNC -inline RealReturnType -real() const { return RealReturnType(derived()); } - -/// \returns an read-only expression of the imaginary part of \c *this. -/// -EIGEN_DOC_UNARY_ADDONS(imag,imaginary part function) -/// -/// \sa real() -EIGEN_DEVICE_FUNC -inline const ImagReturnType -imag() const { return ImagReturnType(derived()); } - -/// \brief Apply a unary operator coefficient-wise -/// \param[in] func Functor implementing the unary operator -/// \tparam CustomUnaryOp Type of \a func -/// \returns An expression of a custom coefficient-wise unary operator \a func of *this -/// -/// The function \c ptr_fun() from the C++ standard library can be used to make functors out of normal functions. -/// -/// Example: -/// \include class_CwiseUnaryOp_ptrfun.cpp -/// Output: \verbinclude class_CwiseUnaryOp_ptrfun.out -/// -/// Genuine functors allow for more possibilities, for instance it may contain a state. -/// -/// Example: -/// \include class_CwiseUnaryOp.cpp -/// Output: \verbinclude class_CwiseUnaryOp.out -/// -EIGEN_DOC_UNARY_ADDONS(unaryExpr,unary function) -/// -/// \sa unaryViewExpr, binaryExpr, class CwiseUnaryOp -/// -template -EIGEN_DEVICE_FUNC -inline const CwiseUnaryOp -unaryExpr(const CustomUnaryOp& func = CustomUnaryOp()) const -{ - return CwiseUnaryOp(derived(), func); -} - -/// \returns an expression of a custom coefficient-wise unary operator \a func of *this -/// -/// The template parameter \a CustomUnaryOp is the type of the functor -/// of the custom unary operator. -/// -/// Example: -/// \include class_CwiseUnaryOp.cpp -/// Output: \verbinclude class_CwiseUnaryOp.out -/// -EIGEN_DOC_UNARY_ADDONS(unaryViewExpr,unary function) -/// -/// \sa unaryExpr, binaryExpr class CwiseUnaryOp -/// -template -EIGEN_DEVICE_FUNC -inline const CwiseUnaryView -unaryViewExpr(const CustomViewOp& func = CustomViewOp()) const -{ - return CwiseUnaryView(derived(), func); -} - -/// \returns a non const expression of the real part of \c *this. -/// -EIGEN_DOC_UNARY_ADDONS(real,real part function) -/// -/// \sa imag() -EIGEN_DEVICE_FUNC -inline NonConstRealReturnType -real() { return NonConstRealReturnType(derived()); } - -/// \returns a non const expression of the imaginary part of \c *this. -/// -EIGEN_DOC_UNARY_ADDONS(imag,imaginary part function) -/// -/// \sa real() -EIGEN_DEVICE_FUNC -inline NonConstImagReturnType -imag() { return NonConstImagReturnType(derived()); } diff --git a/Eigen/src/plugins/IndexedViewMethods.h b/Eigen/src/plugins/IndexedViewMethods.h deleted file mode 100644 index a7ec63adf..000000000 --- a/Eigen/src/plugins/IndexedViewMethods.h +++ /dev/null @@ -1,267 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2017 Gael Guennebaud -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -#if !defined(EIGEN_PARSED_BY_DOXYGEN) - -// This file is automatically included twice to generate const and non-const versions - -#ifndef EIGEN_INDEXED_VIEW_METHOD_2ND_PASS -#define EIGEN_INDEXED_VIEW_METHOD_CONST const -#define EIGEN_INDEXED_VIEW_METHOD_TYPE ConstIndexedViewType -#else -#define EIGEN_INDEXED_VIEW_METHOD_CONST -#define EIGEN_INDEXED_VIEW_METHOD_TYPE IndexedViewType -#endif - -#ifndef EIGEN_INDEXED_VIEW_METHOD_2ND_PASS -protected: - -// define some aliases to ease readability - -template -struct IvcRowType : public internal::IndexedViewCompatibleType {}; - -template -struct IvcColType : public internal::IndexedViewCompatibleType {}; - -template -struct IvcType : public internal::IndexedViewCompatibleType {}; - -typedef typename internal::IndexedViewCompatibleType::type IvcIndex; - -template -typename IvcRowType::type -ivcRow(const Indices& indices) const { - return internal::makeIndexedViewCompatible(indices, internal::variable_if_dynamic(derived().rows()),Specialized); -} - -template -typename IvcColType::type -ivcCol(const Indices& indices) const { - return internal::makeIndexedViewCompatible(indices, internal::variable_if_dynamic(derived().cols()),Specialized); -} - -template -typename IvcColType::type -ivcSize(const Indices& indices) const { - return internal::makeIndexedViewCompatible(indices, internal::variable_if_dynamic(derived().size()),Specialized); -} - -template -struct valid_indexed_view_overload { - enum { value = !(internal::is_valid_index_type::value && internal::is_valid_index_type::value) }; -}; - -public: - -#endif - -template -struct EIGEN_INDEXED_VIEW_METHOD_TYPE { - typedef IndexedView::type, - typename IvcColType::type> type; -}; - -// This is the generic version - -template -typename internal::enable_if::value - && internal::traits::type>::ReturnAsIndexedView, - typename EIGEN_INDEXED_VIEW_METHOD_TYPE::type >::type -operator()(const RowIndices& rowIndices, const ColIndices& colIndices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - return typename EIGEN_INDEXED_VIEW_METHOD_TYPE::type - (derived(), ivcRow(rowIndices), ivcCol(colIndices)); -} - -// The following overload returns a Block<> object - -template -typename internal::enable_if::value - && internal::traits::type>::ReturnAsBlock, - typename internal::traits::type>::BlockType>::type -operator()(const RowIndices& rowIndices, const ColIndices& colIndices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - typedef typename internal::traits::type>::BlockType BlockType; - typename IvcRowType::type actualRowIndices = ivcRow(rowIndices); - typename IvcColType::type actualColIndices = ivcCol(colIndices); - return BlockType(derived(), - internal::first(actualRowIndices), - internal::first(actualColIndices), - internal::size(actualRowIndices), - internal::size(actualColIndices)); -} - -// The following overload returns a Scalar - -template -typename internal::enable_if::value - && internal::traits::type>::ReturnAsScalar, - CoeffReturnType >::type -operator()(const RowIndices& rowIndices, const ColIndices& colIndices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - return Base::operator()(internal::eval_expr_given_size(rowIndices,rows()),internal::eval_expr_given_size(colIndices,cols())); -} - -#if EIGEN_HAS_STATIC_ARRAY_TEMPLATE - -// The folowing three overloads are needed to handle raw Index[N] arrays. - -template -IndexedView::type> -operator()(const RowIndicesT (&rowIndices)[RowIndicesN], const ColIndices& colIndices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - return IndexedView::type> - (derived(), rowIndices, ivcCol(colIndices)); -} - -template -IndexedView::type, const ColIndicesT (&)[ColIndicesN]> -operator()(const RowIndices& rowIndices, const ColIndicesT (&colIndices)[ColIndicesN]) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - return IndexedView::type,const ColIndicesT (&)[ColIndicesN]> - (derived(), ivcRow(rowIndices), colIndices); -} - -template -IndexedView -operator()(const RowIndicesT (&rowIndices)[RowIndicesN], const ColIndicesT (&colIndices)[ColIndicesN]) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - return IndexedView - (derived(), rowIndices, colIndices); -} - -#endif // EIGEN_HAS_STATIC_ARRAY_TEMPLATE - -// Overloads for 1D vectors/arrays - -template -typename internal::enable_if< - IsRowMajor && (!(internal::get_compile_time_incr::type>::value==1 || internal::is_valid_index_type::value)), - IndexedView::type> >::type -operator()(const Indices& indices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return IndexedView::type> - (derived(), IvcIndex(0), ivcCol(indices)); -} - -template -typename internal::enable_if< - (!IsRowMajor) && (!(internal::get_compile_time_incr::type>::value==1 || internal::is_valid_index_type::value)), - IndexedView::type,IvcIndex> >::type -operator()(const Indices& indices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return IndexedView::type,IvcIndex> - (derived(), ivcRow(indices), IvcIndex(0)); -} - -template -typename internal::enable_if< - (internal::get_compile_time_incr::type>::value==1) && (!internal::is_valid_index_type::value) && (!Symbolic::is_symbolic::value), - VectorBlock::value> >::type -operator()(const Indices& indices) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - typename IvcType::type actualIndices = ivcSize(indices); - return VectorBlock::value> - (derived(), internal::first(actualIndices), internal::size(actualIndices)); -} - -template -typename internal::enable_if::value, CoeffReturnType >::type -operator()(const IndexType& id) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - return Base::operator()(internal::eval_expr_given_size(id,size())); -} - -#if EIGEN_HAS_STATIC_ARRAY_TEMPLATE - -template -typename internal::enable_if >::type -operator()(const IndicesT (&indices)[IndicesN]) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return IndexedView - (derived(), IvcIndex(0), indices); -} - -template -typename internal::enable_if >::type -operator()(const IndicesT (&indices)[IndicesN]) EIGEN_INDEXED_VIEW_METHOD_CONST -{ - EIGEN_STATIC_ASSERT_VECTOR_ONLY(Derived) - return IndexedView - (derived(), indices, IvcIndex(0)); -} - -#endif // EIGEN_HAS_STATIC_ARRAY_TEMPLATE - -#undef EIGEN_INDEXED_VIEW_METHOD_CONST -#undef EIGEN_INDEXED_VIEW_METHOD_TYPE - -#ifndef EIGEN_INDEXED_VIEW_METHOD_2ND_PASS -#define EIGEN_INDEXED_VIEW_METHOD_2ND_PASS -#include "IndexedViewMethods.h" -#undef EIGEN_INDEXED_VIEW_METHOD_2ND_PASS -#endif - -#else // EIGEN_PARSED_BY_DOXYGEN - -/** - * \returns a generic submatrix view defined by the rows and columns indexed \a rowIndices and \a colIndices respectively. - * - * Each parameter must either be: - * - An integer indexing a single row or column - * - Eigen::all indexing the full set of respective rows or columns in increasing order - * - An ArithmeticSequence as returned by the Eigen::seq and Eigen::seqN functions - * - Any %Eigen's vector/array of integers or expressions - * - Plain C arrays: \c int[N] - * - And more generally any type exposing the following two member functions: - * \code - * operator[]() const; - * size() const; - * \endcode - * where \c stands for any integer type compatible with Eigen::Index (i.e. \c std::ptrdiff_t). - * - * The last statement implies compatibility with \c std::vector, \c std::valarray, \c std::array, many of the Range-v3's ranges, etc. - * - * If the submatrix can be represented using a starting position \c (i,j) and positive sizes \c (rows,columns), then this - * method will returns a Block object after extraction of the relevant information from the passed arguments. This is the case - * when all arguments are either: - * - An integer - * - Eigen::all - * - An ArithmeticSequence with compile-time increment strictly equal to 1, as returned by Eigen::seq(a,b), and Eigen::seqN(a,N). - * - * Otherwise a more general IndexedView object will be returned, after conversion of the inputs - * to more suitable types \c RowIndices' and \c ColIndices'. - * - * For 1D vectors and arrays, you better use the operator()(const Indices&) overload, which behave the same way but taking a single parameter. - * - * See also this question and its answer for an example of how to duplicate coefficients. - * - * \sa operator()(const Indices&), class Block, class IndexedView, DenseBase::block(Index,Index,Index,Index) - */ -template -IndexedView_or_Block -operator()(const RowIndices& rowIndices, const ColIndices& colIndices); - -/** This is an overload of operator()(const RowIndices&, const ColIndices&) for 1D vectors or arrays - * - * \only_for_vectors - */ -template -IndexedView_or_VectorBlock -operator()(const Indices& indices); - -#endif // EIGEN_PARSED_BY_DOXYGEN diff --git a/Eigen/src/plugins/MatrixCwiseBinaryOps.h b/Eigen/src/plugins/MatrixCwiseBinaryOps.h deleted file mode 100644 index f1084abef..000000000 --- a/Eigen/src/plugins/MatrixCwiseBinaryOps.h +++ /dev/null @@ -1,152 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -// This file is a base class plugin containing matrix specifics coefficient wise functions. - -/** \returns an expression of the Schur product (coefficient wise product) of *this and \a other - * - * Example: \include MatrixBase_cwiseProduct.cpp - * Output: \verbinclude MatrixBase_cwiseProduct.out - * - * \sa class CwiseBinaryOp, cwiseAbs2 - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const EIGEN_CWISE_BINARY_RETURN_TYPE(Derived,OtherDerived,product) -cwiseProduct(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return EIGEN_CWISE_BINARY_RETURN_TYPE(Derived,OtherDerived,product)(derived(), other.derived()); -} - -/** \returns an expression of the coefficient-wise == operator of *this and \a other - * - * \warning this performs an exact comparison, which is generally a bad idea with floating-point types. - * In order to check for equality between two vectors or matrices with floating-point coefficients, it is - * generally a far better idea to use a fuzzy comparison as provided by isApprox() and - * isMuchSmallerThan(). - * - * Example: \include MatrixBase_cwiseEqual.cpp - * Output: \verbinclude MatrixBase_cwiseEqual.out - * - * \sa cwiseNotEqual(), isApprox(), isMuchSmallerThan() - */ -template -EIGEN_DEVICE_FUNC -inline const CwiseBinaryOp, const Derived, const OtherDerived> -cwiseEqual(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); -} - -/** \returns an expression of the coefficient-wise != operator of *this and \a other - * - * \warning this performs an exact comparison, which is generally a bad idea with floating-point types. - * In order to check for equality between two vectors or matrices with floating-point coefficients, it is - * generally a far better idea to use a fuzzy comparison as provided by isApprox() and - * isMuchSmallerThan(). - * - * Example: \include MatrixBase_cwiseNotEqual.cpp - * Output: \verbinclude MatrixBase_cwiseNotEqual.out - * - * \sa cwiseEqual(), isApprox(), isMuchSmallerThan() - */ -template -EIGEN_DEVICE_FUNC -inline const CwiseBinaryOp, const Derived, const OtherDerived> -cwiseNotEqual(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); -} - -/** \returns an expression of the coefficient-wise min of *this and \a other - * - * Example: \include MatrixBase_cwiseMin.cpp - * Output: \verbinclude MatrixBase_cwiseMin.out - * - * \sa class CwiseBinaryOp, max() - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const OtherDerived> -cwiseMin(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); -} - -/** \returns an expression of the coefficient-wise min of *this and scalar \a other - * - * \sa class CwiseBinaryOp, min() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const ConstantReturnType> -cwiseMin(const Scalar &other) const -{ - return cwiseMin(Derived::Constant(rows(), cols(), other)); -} - -/** \returns an expression of the coefficient-wise max of *this and \a other - * - * Example: \include MatrixBase_cwiseMax.cpp - * Output: \verbinclude MatrixBase_cwiseMax.out - * - * \sa class CwiseBinaryOp, min() - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const OtherDerived> -cwiseMax(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); -} - -/** \returns an expression of the coefficient-wise max of *this and scalar \a other - * - * \sa class CwiseBinaryOp, min() - */ -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const ConstantReturnType> -cwiseMax(const Scalar &other) const -{ - return cwiseMax(Derived::Constant(rows(), cols(), other)); -} - - -/** \returns an expression of the coefficient-wise quotient of *this and \a other - * - * Example: \include MatrixBase_cwiseQuotient.cpp - * Output: \verbinclude MatrixBase_cwiseQuotient.out - * - * \sa class CwiseBinaryOp, cwiseProduct(), cwiseInverse() - */ -template -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseBinaryOp, const Derived, const OtherDerived> -cwiseQuotient(const EIGEN_CURRENT_STORAGE_BASE_CLASS &other) const -{ - return CwiseBinaryOp, const Derived, const OtherDerived>(derived(), other.derived()); -} - -typedef CwiseBinaryOp, const Derived, const ConstantReturnType> CwiseScalarEqualReturnType; - -/** \returns an expression of the coefficient-wise == operator of \c *this and a scalar \a s - * - * \warning this performs an exact comparison, which is generally a bad idea with floating-point types. - * In order to check for equality between two vectors or matrices with floating-point coefficients, it is - * generally a far better idea to use a fuzzy comparison as provided by isApprox() and - * isMuchSmallerThan(). - * - * \sa cwiseEqual(const MatrixBase &) const - */ -EIGEN_DEVICE_FUNC -inline const CwiseScalarEqualReturnType -cwiseEqual(const Scalar& s) const -{ - return CwiseScalarEqualReturnType(derived(), Derived::Constant(rows(), cols(), s), internal::scalar_cmp_op()); -} diff --git a/Eigen/src/plugins/MatrixCwiseUnaryOps.h b/Eigen/src/plugins/MatrixCwiseUnaryOps.h deleted file mode 100644 index b1be3d566..000000000 --- a/Eigen/src/plugins/MatrixCwiseUnaryOps.h +++ /dev/null @@ -1,85 +0,0 @@ -// This file is part of Eigen, a lightweight C++ template library -// for linear algebra. -// -// Copyright (C) 2008-2009 Gael Guennebaud -// Copyright (C) 2006-2008 Benoit Jacob -// -// This Source Code Form is subject to the terms of the Mozilla -// Public License v. 2.0. If a copy of the MPL was not distributed -// with this file, You can obtain one at http://mozilla.org/MPL/2.0/. - -// This file is included into the body of the base classes supporting matrix specific coefficient-wise functions. -// This include MatrixBase and SparseMatrixBase. - - -typedef CwiseUnaryOp, const Derived> CwiseAbsReturnType; -typedef CwiseUnaryOp, const Derived> CwiseAbs2ReturnType; -typedef CwiseUnaryOp, const Derived> CwiseSqrtReturnType; -typedef CwiseUnaryOp, const Derived> CwiseSignReturnType; -typedef CwiseUnaryOp, const Derived> CwiseInverseReturnType; - -/// \returns an expression of the coefficient-wise absolute value of \c *this -/// -/// Example: \include MatrixBase_cwiseAbs.cpp -/// Output: \verbinclude MatrixBase_cwiseAbs.out -/// -EIGEN_DOC_UNARY_ADDONS(cwiseAbs,absolute value) -/// -/// \sa cwiseAbs2() -/// -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseAbsReturnType -cwiseAbs() const { return CwiseAbsReturnType(derived()); } - -/// \returns an expression of the coefficient-wise squared absolute value of \c *this -/// -/// Example: \include MatrixBase_cwiseAbs2.cpp -/// Output: \verbinclude MatrixBase_cwiseAbs2.out -/// -EIGEN_DOC_UNARY_ADDONS(cwiseAbs2,squared absolute value) -/// -/// \sa cwiseAbs() -/// -EIGEN_DEVICE_FUNC -EIGEN_STRONG_INLINE const CwiseAbs2ReturnType -cwiseAbs2() const { return CwiseAbs2ReturnType(derived()); } - -/// \returns an expression of the coefficient-wise square root of *this. -/// -/// Example: \include MatrixBase_cwiseSqrt.cpp -/// Output: \verbinclude MatrixBase_cwiseSqrt.out -/// -EIGEN_DOC_UNARY_ADDONS(cwiseSqrt,square-root) -/// -/// \sa cwisePow(), cwiseSquare() -/// -EIGEN_DEVICE_FUNC -inline const CwiseSqrtReturnType -cwiseSqrt() const { return CwiseSqrtReturnType(derived()); } - -/// \returns an expression of the coefficient-wise signum of *this. -/// -/// Example: \include MatrixBase_cwiseSign.cpp -/// Output: \verbinclude MatrixBase_cwiseSign.out -/// -EIGEN_DOC_UNARY_ADDONS(cwiseSign,sign function) -/// -EIGEN_DEVICE_FUNC -inline const CwiseSignReturnType -cwiseSign() const { return CwiseSignReturnType(derived()); } - - -/// \returns an expression of the coefficient-wise inverse of *this. -/// -/// Example: \include MatrixBase_cwiseInverse.cpp -/// Output: \verbinclude MatrixBase_cwiseInverse.out -/// -EIGEN_DOC_UNARY_ADDONS(cwiseInverse,inverse) -/// -/// \sa cwiseProduct() -/// -EIGEN_DEVICE_FUNC -inline const CwiseInverseReturnType -cwiseInverse() const { return CwiseInverseReturnType(derived()); } - - diff --git a/apf/CMakeLists.txt b/apf/CMakeLists.txt index a9667653b..a50f56d88 100644 --- a/apf/CMakeLists.txt +++ b/apf/CMakeLists.txt @@ -96,8 +96,6 @@ target_include_directories(apf PUBLIC $ ) -target_link_libraries (apf PRIVATE eigen) - # Link this library to these others target_link_libraries(apf PUBLIC diff --git a/apf/apfMatrix.cc b/apf/apfMatrix.cc index 3c54dd79b..b262f2949 100644 --- a/apf/apfMatrix.cc +++ b/apf/apfMatrix.cc @@ -9,7 +9,7 @@ #include "apf2mth.h" #include #include -#include <../Eigen/Dense> +#include namespace apf { diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 9da44dbfd..0935060be 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -357,9 +357,10 @@ bool Snapper::trySwapOrSplit(FirstProblemPlane* FPP) else { Entity* edges[3]; mesh->getDownward(ents[0], 1, edges); - for (int i=0; i<3; i++) (edgeSwap->run(edges[i])) { numSwap++; return true; } + for (int i=0; i<3; i++) + if (edgeSwap->run(edges[i])) { numSwap++; return true; } // if (runFaceSwap(adapt, ents[0], false)) { numSwap++; return true; } - if (splitCollapse.run(ents[1], FPP->vert, qual)) { numSplitCollapse++; return true; s} + if (splitCollapse.run(ents[1], FPP->vert, qual)) { numSplitCollapse++; return true; } } return false; } From a8f64c6392cc19f295e33ba5930891d0e40e846d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 21 Nov 2025 16:57:49 -0500 Subject: [PATCH 288/319] remove unused --- ma/maCoarsen.cc | 6 +++--- ma/maCoarsen.h | 2 +- ma/maDBG.cc | 1 - ma/maDBG.h | 3 ++- ma/maMesh.h | 1 - ma/maQuality.cc | 1 - 6 files changed, 6 insertions(+), 8 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 4efec71a9..d0df4169f 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -456,10 +456,9 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback } }; -void coarsenMultiple(Adapt* a) +bool coarsenMultiple(Adapt* a) { - if (!a->input->shouldCoarsen) - return; + if (!a->input->shouldCoarsen) return false; double t0 = pcu::Time(); CollapseAll collapseAll(a); int totalSuccess = 0; @@ -474,6 +473,7 @@ void coarsenMultiple(Adapt* a) double t1 = pcu::Time(); print(a->mesh->getPCU(), "coarsened %d edges in %f seconds", totalSuccess, t1-t0); + return true; } diff --git a/ma/maCoarsen.h b/ma/maCoarsen.h index 8069fe3dc..2e4283c77 100644 --- a/ma/maCoarsen.h +++ b/ma/maCoarsen.h @@ -14,7 +14,7 @@ namespace ma { class Adapt; -void coarsenMultiple(Adapt* a); +bool coarsenMultiple(Adapt* a); bool coarsen(Adapt* a); bool coarsenLayer(Adapt* a); diff --git a/ma/maDBG.cc b/ma/maDBG.cc index a90f3bbd9..fdd77f4ab 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -30,7 +30,6 @@ static double PI = 3.14159265359; namespace ma_dbg { -// If no dimension specified then it will write the greatest dimension to the file. // If no dimension specified then it will write the greatest dimension to the file. void writeMesh(ma::Mesh* m, const char* prefix, diff --git a/ma/maDBG.h b/ma/maDBG.h index 61f699442..09c654a32 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -25,7 +25,8 @@ void writeMesh(ma::Mesh* m, const char* prefix, const char* suffix); -/* Creates a field to contain the model classification for each entity*/ +/* Creates a field to contain the model classification for each vertex. Which can be + printed to a file using writeMesh() with dim=0. */ void addClassification(ma::Adapt* a); void addTargetLocation(ma::Adapt* a, diff --git a/ma/maMesh.h b/ma/maMesh.h index fdd7eabef..cabff9763 100644 --- a/ma/maMesh.h +++ b/ma/maMesh.h @@ -16,7 +16,6 @@ #include #include #include -#include namespace ma { diff --git a/ma/maQuality.cc b/ma/maQuality.cc index a3221d51d..85f465116 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -26,7 +26,6 @@ bool areTetsValid(Mesh* m, EntityArray& tets) size_t n = tets.getSize(); for (size_t i = 0; i < n; ++i){ ma::getVertPoints(m,tets[i],v); - // if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0.00001) if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) return false; } From 3e26c517266f116d7455c5dcfaee9e942f9a9be6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 21 Nov 2025 17:12:15 -0500 Subject: [PATCH 289/319] removed unused --- CMakeLists.txt | 2 +- ma/CMakeLists.txt | 2 +- ma/ma.cc | 24 ------------------------ ma/pkg_tribits.cmake | 1 + 4 files changed, 3 insertions(+), 26 deletions(-) diff --git a/CMakeLists.txt b/CMakeLists.txt index e2681a9e9..10231b554 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -4,7 +4,7 @@ if(DEFINED TRIBITS_PACKAGE) endif() # This is the top level CMake file for the SCOREC build -cmake_minimum_required(VERSION 3.13) +cmake_minimum_required(VERSION 3.12) project(SCOREC VERSION 4.1.0 LANGUAGES CXX C) diff --git a/ma/CMakeLists.txt b/ma/CMakeLists.txt index 4851e7561..b645c069f 100644 --- a/ma/CMakeLists.txt +++ b/ma/CMakeLists.txt @@ -29,8 +29,8 @@ set(SOURCES maSnap.cc maEdgeSwap.cc maFaceSwap.cc - maShape.cc maFixShape.cc + maShape.cc maShapeHandler.cc maQuality.cc maSplits.cc diff --git a/ma/ma.cc b/ma/ma.cc index eabfc5e9e..a3d6a153b 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -72,30 +72,6 @@ void adapt(Input* in) CALLGRIND_START_INSTRUMENTATION; coarsenMultiple(a); CALLGRIND_STOP_INSTRUMENTATION; - - // const Vector target(1502.327985, 375.402966, 174.096195); - // ma::Iterator* it = a->mesh->begin(0); - // Entity* vert; - // while ((vert = a->mesh->iterate(it))) { - // Vector pos = getPosition(a->mesh, vert); - // if (apf::areClose(pos, target, 1e-5)) { - // apf::Adjacent tets; - // a->mesh->getAdjacent(vert, 3, tets); - // for (int i=0; isizeField->measure(tets[i])); - // printf("Qual %f\n", qual); - // if (qual < .1) { - // ma_dbg::addClassification(a); - // ma_dbg::flagEntityAllDim(a, 3, "worst_tet", &tets[i], 1); - // apf::writeVtkFiles("mesh_tets", a->mesh, 3); - // apf::writeVtkFiles("mesh_faces", a->mesh, 2); - // apf::writeVtkFiles("mesh_verts", a->mesh, 1); - // exit(1); - // } - // } - // } - // } - for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); diff --git a/ma/pkg_tribits.cmake b/ma/pkg_tribits.cmake index c149c2fca..62d340dbd 100644 --- a/ma/pkg_tribits.cmake +++ b/ma/pkg_tribits.cmake @@ -27,6 +27,7 @@ set(SOURCES maEdgeSwap.cc maShape.cc maFixShape.cc + maFaceSwap.cc maShapeHandler.cc maQuality.cc maSplits.cc From 58caf50966682da63eef442715591754df1d07a6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 21 Nov 2025 21:10:19 -0500 Subject: [PATCH 290/319] optional Eigen library --- CMakeLists.txt | 22 ++++++++++++---------- apf/apfMatrix.cc | 25 +++++++++++++++---------- 2 files changed, 27 insertions(+), 20 deletions(-) diff --git a/CMakeLists.txt b/CMakeLists.txt index 10231b554..88623f2d4 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -36,16 +36,6 @@ elseif(ENABLE_OMEGA_H) bob_set_cxx_standard(17) endif() - -include(FetchContent) -FetchContent_Declare( - eigen - GIT_REPOSITORY https://gitlab.com/libeigen/eigen.git - GIT_TAG 5.0 -) -FetchContent_MakeAvailable(eigen) -include_directories(${eigen_SOURCE_DIR}) - # # option related to MPI # @@ -186,6 +176,18 @@ if(DEBUG_FPP) add_definitions(-DDEBUG_FPP) endif() +if(ENABLE_EIGEN) + include(FetchContent) + FetchContent_Declare( + eigen + GIT_REPOSITORY https://gitlab.com/libeigen/eigen.git + GIT_TAG 5.0 + ) + FetchContent_MakeAvailable(eigen) + include_directories(${eigen_SOURCE_DIR}) + add_definitions(-DEIGEN_ENABLED) +endif() + configure_file(SCOREC_config.h.in SCOREC_config.h) install(FILES "${CMAKE_BINARY_DIR}/SCOREC_config.h" DESTINATION include) include_directories(PUBLIC "$") diff --git a/apf/apfMatrix.cc b/apf/apfMatrix.cc index b262f2949..6f6745fb9 100644 --- a/apf/apfMatrix.cc +++ b/apf/apfMatrix.cc @@ -9,7 +9,9 @@ #include "apf2mth.h" #include #include +#ifdef EIGEN_ENABLED #include +#endif namespace apf { @@ -70,16 +72,7 @@ int eigen(Matrix3x3 const& A, Vector<3>* eigenVectors, double* eigenValues) { - // mth::Matrix A2 = to_mth(A); - // mth::Matrix L; - // mth::Matrix Q; - // bool converged = mth::eigenQR(A2, L, Q, 100); - // PCU_ALWAYS_ASSERT(converged); - // for (unsigned i = 0; i < 3; ++i) - // eigenValues[i] = L(i,i); - // for (unsigned i = 0; i < 3; ++i) - // for (unsigned j = 0; j < 3; ++j) - // eigenVectors[j][i] = Q(i,j); +#ifdef EIGEN_ENABLED Eigen::Matrix3d matrix; for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) @@ -94,6 +87,18 @@ int eigen(Matrix3x3 const& A, for (unsigned i = 0; i < 3; ++i) for (unsigned j = 0; j < 3; ++j) eigenVectors[j][i] = vectors(i,j); +#else + mth::Matrix A2 = to_mth(A); + mth::Matrix L; + mth::Matrix Q; + bool converged = mth::eigenQR(A2, L, Q, 100); + PCU_ALWAYS_ASSERT(converged); + for (unsigned i = 0; i < 3; ++i) + eigenValues[i] = L(i,i); + for (unsigned i = 0; i < 3; ++i) + for (unsigned j = 0; j < 3; ++j) + eigenVectors[j][i] = Q(i,j); +#endif return 3; } From 2f90f89818874c585704b22c109db9463b01c446 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 29 Nov 2025 14:32:24 -0500 Subject: [PATCH 291/319] remove extra coarsen --- ma/ma.cc | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index a3d6a153b..1453620c5 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -70,16 +70,15 @@ void adapt(Input* in) Adapt* a = new Adapt(in); preBalance(a); CALLGRIND_START_INSTRUMENTATION; - coarsenMultiple(a); CALLGRIND_STOP_INSTRUMENTATION; for (int i = 0; i < in->maximumIterations; ++i) { print(a->mesh->getPCU(), "iteration %d", i); + coarsenMultiple(a); + coarsenLayer(a); midBalance(a); refine(a); snap(a); - coarsenMultiple(a); - coarsenLayer(a); } allowSplitCollapseOutsideLayer(a); // fixElementShapes(a); From 55cb127d29b6f3ed4e07355eadfcf321c4163057 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 29 Nov 2025 15:14:54 -0500 Subject: [PATCH 292/319] remove debugging --- ma/maCollapse.cc | 80 ------------------------------------------------ 1 file changed, 80 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 34e252450..124ea86dd 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -607,86 +607,6 @@ bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) return true; } -static int DEBUG=0; - -void printCollapseInfo(Collapse& collapse, Entity* edge, Entity* vert) -{ - Adapt* adapt = collapse.adapt; - Mesh* m = adapt->mesh; - // const Vector target(1502.327985, 375.402966, 174.096195); - // Entity* found = 0; - // for (Entity* shape : collapse.elementsToKeep) { - // Entity* verts[4]; - // adapt->mesh->getDownward(shape, 0, verts); - // for (Entity* v : verts) { - // Vector pos = getPosition(adapt->mesh, v); - // if (apf::areClose(pos, target, 1e-5)) found = v; - // } - // } - // if (!found) return; - // if (++DEBUG != 4) return; - - - if (m->getModelType(m->toModel(edge)) != 2) return; - Vector prev = getPosition(m, collapse.vertToCollapse); - Vector target = getPosition(m, collapse.vertToKeep); - m->setPoint(collapse.vertToCollapse, 0, target); - double worstQual = 1; - Entity* worst; - for (Entity* e : collapse.elementsToKeep) { - double qual = adapt->sizeField->measure(e); - if (qual < worstQual) { - worstQual = qual; - worst = e; - } - } - m->setPoint(collapse.vertToCollapse, 0, prev); - if (cbrt(worstQual) > 0.01) return; - printf("worst qual before %f\n", cbrt(adapt->sizeField->measure(worst))); - printf("worst qual after %f\n", cbrt(worstQual)); - - - ma_dbg::addClassification(adapt); - ma_dbg::flagEntity(adapt, 1, "edge_to_collapse", &edge, 1); - ma_dbg::flagEntity(adapt, 0, "vert_to_collapse", &vert, 1); - - ma_dbg::flagEntityAllDim(adapt, 3, "worst_entity", &worst, 1); - std::vector elemsToCollapse(collapse.elementsToCollapse.begin(), collapse.elementsToCollapse.end()); - ma_dbg::flagEntityAllDim(adapt, 3, "tets_to_collapse", &elemsToCollapse[0], elemsToCollapse.size()); - std::vector elemsToKeep(collapse.elementsToKeep.begin(), collapse.elementsToKeep.end()); - ma_dbg::flagEntityAllDim(adapt, 3, "tets_to_keep", &elemsToKeep[0], elemsToKeep.size()); - - apf::writeVtkFiles("mesh_tets_before", adapt->mesh, 3); - apf::writeVtkFiles("mesh_faces_before", adapt->mesh, 2); - apf::writeVtkFiles("mesh_edges_before", adapt->mesh, 1); - - collapse.rebuildElements(); - collapse.fitElements(); - collapse.unmark(); - collapse.destroyOldElements(); - - worstQual = 1; - for (Entity* e : collapse.newElements) { - double qual = adapt->sizeField->measure(e); - if (qual < worstQual) { - worstQual = qual; - worst = e; - } - } - - printf("worst qual %f\n", cbrt(worstQual)); - ma_dbg::addClassification(adapt); - ma_dbg::flagEntityAllDim(adapt, 3, "worst_entity", &worst, 1); - std::vector newElements(collapse.newElements.begin(), collapse.newElements.end()); - ma_dbg::flagEntityAllDim(adapt, 3, "new_tets", &newElements[0], newElements.size()); - - apf::writeVtkFiles("mesh_tets_after", adapt->mesh, 3); - apf::writeVtkFiles("mesh_faces_after", adapt->mesh, 2); - apf::writeVtkFiles("mesh_edges_after", adapt->mesh, 1); - - exit(0); -} - bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double qualityToBeat) { Adapt* adapt = collapse.adapt; From 6fa0fd9a70b8395692987b53edc904b7c19516cd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 29 Nov 2025 15:26:31 -0500 Subject: [PATCH 293/319] moved one sided collapse --- ma/maCoarsen.cc | 2 +- ma/maCollapse.cc | 65 ++++++++++++++++++++++++------------------------ ma/maCollapse.h | 2 +- 3 files changed, 34 insertions(+), 35 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index d0df4169f..6fbc4aa08 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -429,7 +429,7 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback for (size_t i=0; i < sorted.size(); i++) { // Entity* opposite = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); // if (!tryCollapseEdge(a, sorted[i].edge, opposite, collapse, adjacent)) continue; - if (!collapseEdgeVertex(collapse, sorted[i].edge, vertex, qualityToBeat)) continue; + if (!collapse.run(sorted[i].edge, vertex, qualityToBeat)) continue; flagIndependentSet(adjacent); collapse.destroyOldElements(); return true; diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 124ea86dd..a77c28ee6 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -27,6 +27,38 @@ void Collapse::Init(Adapt* a) vertToKeep = 0; } + +bool Collapse::run(Entity* edge, Entity* vert, double qualityToBeat) +{ + PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); + PCU_ALWAYS_ASSERT(adapt->mesh->getType(vert) == apf::Mesh::VERTEX); + if (!setEdge(edge)) return false; + if (!checkClass()) return false; + if (!getFlag(adapt, vert, COLLAPSE)) { unmark(); return false; } + vertToCollapse = vert; + vertToKeep = getEdgeVertOppositeVert(adapt->mesh, edge, vert); + clearFlag(adapt, vertToKeep, COLLAPSE); + computeElementSets(); + if (elementsToKeep.size() == 0) { unmark(); return false; } + if (!isValid()) { unmark(); return false; } + + if (!checkEdgeCollapseTopology(adapt, edge)) { unmark(); return false; } + if (!getFlag(adapt, vert, COLLAPSE)) { unmark(); return false; } + PCU_ALWAYS_ASSERT(vertToCollapse == vert); + + if (!adapt->input->shouldForceAdaptation) + qualityToBeat = std::min(adapt->input->goodQuality, + std::max(getOldQuality(),adapt->input->validQuality)); + + if (anyWorseQuality(qualityToBeat)) { unmark(); return false;} + + rebuildElements(); + fitElements(); + unmark(); + return true; +} + + bool Collapse::requestLocality(apf::CavityOp* o) { /* get vertices again since this is sometimes used @@ -607,39 +639,6 @@ bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) return true; } -bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double qualityToBeat) -{ - Adapt* adapt = collapse.adapt; - PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); - PCU_ALWAYS_ASSERT(adapt->mesh->getType(vert) == apf::Mesh::VERTEX); - if (!collapse.setEdge(edge)) return false; - if (!collapse.checkClass()) return false; - if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } - collapse.vertToCollapse = vert; - collapse.vertToKeep = getEdgeVertOppositeVert(adapt->mesh, edge, vert); - clearFlag(adapt, collapse.vertToKeep, COLLAPSE); - collapse.computeElementSets(); - if (collapse.elementsToKeep.size() == 0) { collapse.unmark(); return false; } - if (!collapse.isValid()) { collapse.unmark(); return false; } - - if (!checkEdgeCollapseTopology(adapt, edge)) { collapse.unmark(); return false; } - if (!getFlag(adapt, vert, COLLAPSE)) { collapse.unmark(); return false; } - PCU_ALWAYS_ASSERT(collapse.vertToCollapse == vert); - - if (!adapt->input->shouldForceAdaptation) - qualityToBeat = std::min(adapt->input->goodQuality, - std::max(collapse.getOldQuality(),adapt->input->validQuality)); - - if (collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false;} - - // printCollapseInfo(collapse, edge, vert); - - collapse.rebuildElements(); - collapse.fitElements(); - collapse.unmark(); - return true; -} - bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert) { Adapt* adapter = collapse.adapt; diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 33d6a9353..21e4043d9 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -24,6 +24,7 @@ class Collapse { public: void Init(Adapt* a); + bool run(Entity* edge, Entity* vert, double qualityToBeat); bool requestLocality(apf::CavityOp* o); void destroyOldElements(); void destroyNewElements(); @@ -62,7 +63,6 @@ class Collapse bool checkEdgeCollapseTopology(Adapt* a, Entity* edge); bool isRequiredForAnEdgeCollapse(Adapt* adapt, Entity* vertex); bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex); -bool collapseEdgeVertex(Collapse& collapse, Entity* edge, Entity* vert, double qualityToBeat); bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat); bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert); From 1ec2df30a7788d7b791ae286798a2da7d489d2b8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Dec 2025 15:21:03 -0500 Subject: [PATCH 294/319] removed usage of wrong quality measure --- ma/maCollapse.cc | 2 +- ma/maFixShape.cc | 6 +++--- ma/maQuality.cc | 9 +++++++++ ma/maShape.h | 1 + ma/maSnapper.cc | 7 +++++-- 5 files changed, 19 insertions(+), 6 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index a77c28ee6..9c0b11f82 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -91,7 +91,7 @@ bool Collapse::anyWorseQuality(double qualityToBeat) adapt->mesh->setPoint(vertToCollapse, 0, target); bool worse = false; for (Entity* e : elementsToKeep) - if (adapt->sizeField->measure(e) < qualityToBeat) + if (adapt->shape->getQuality(e) < qualityToBeat) {worse = true; break;} adapt->mesh->setPoint(vertToCollapse, 0, prev); return worse; diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 506e89b70..7d04442f0 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -129,7 +129,7 @@ double FixShape::getWorstShape(EntityArray& tets, Entity*& worst) { double worstQuality = 1; for (int i=0; isizeField->measure(tets[i]); + double quality = a->shape->getQuality(tets[i]); if (quality < worstQuality) { worstQuality = quality; worst = tets[i]; @@ -201,10 +201,10 @@ bool FixShape::isOneLargeAngle(Entity* tet, Entity*& worstTriangle) { Entity* triangles[4]; a->mesh->getDownward(tet, 2, triangles); - double worstQuality = a->sizeField->measure(triangles[0]); + double worstQuality = a->shape->getQuality(triangles[0]); worstTriangle = triangles[0]; for (int i=1; i<4; i++) { - double quality = a->sizeField->measure(triangles[i]); + double quality = a->shape->getQuality(triangles[i]); if (quality < worstQuality) { worstQuality = quality; worstTriangle = triangles[i]; diff --git a/ma/maQuality.cc b/ma/maQuality.cc index 85f465116..8303b52ec 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -20,6 +20,15 @@ namespace ma { +bool isTetValid(Mesh* m, Entity* tet) +{ + Vector v[4]; + ma::getVertPoints(m,tet,v); + if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) + return false; + return true; +} + bool areTetsValid(Mesh* m, EntityArray& tets) { Vector v[4]; diff --git a/ma/maShape.h b/ma/maShape.h index d72c7bbaa..30a502a19 100644 --- a/ma/maShape.h +++ b/ma/maShape.h @@ -20,6 +20,7 @@ class Adapt; /* quick check of positivity of volumes based on vertices */ bool areTetsValid(Mesh* m, EntityArray& tets); +bool isTetValid(Mesh* m, Entity* tets); double measureTriQuality(Mesh* m, SizeField* f, Entity* tri, bool useMax=true); double measureTetQuality(Mesh* m, SizeField* f, Entity* tet, bool useMax=true); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index a58979e33..6f4706b94 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -582,7 +582,10 @@ static void getInvalid(Adapt* a, Upward& adjacentElements, apf::Up& invalid) algorithm that moves curves would need to change */ if (getFlag(a, adjacentElements[i], LAYER)) continue; - if (a->shape->getQuality(adjacentElements[i]) < a->input->validQuality) + if (a->mesh->getType(adjacentElements[i]) == apf::Mesh::TET + && !isTetValid(a->mesh, adjacentElements[i])) + invalid.e[invalid.n++] = adjacentElements[i]; + else if (a->shape->getQuality(adjacentElements[i]) < a->input->validQuality) invalid.e[invalid.n++] = adjacentElements[i]; } } @@ -636,7 +639,7 @@ bool Snapper::run() if (!success) FPP = getFPP(adapt, vert, snapTag, invalid); if (!success) success = tryCollapseToVertex(FPP); if (!success) success = tryReduceCommonEdges(FPP); - if (!success) success = tryCollapseTetEdges(FPP); + // if (!success) success = tryCollapseTetEdges(FPP); //TODO causing holes in mesh if (!success) success = trySwapOrSplit(FPP); } From f6a883954bcc639f3d19778457f100e064c784d9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Dec 2025 21:06:00 -0500 Subject: [PATCH 295/319] use mesh element without pointer --- apf/apfElement.cc | 4 ++++ apf/apfElement.h | 1 + apf/apfElementOf.h | 4 ++++ apf/apfVectorElement.cc | 5 +++++ apf/apfVectorElement.h | 1 + ma/maSize.cc | 17 ++++++++--------- 6 files changed, 23 insertions(+), 9 deletions(-) diff --git a/apf/apfElement.cc b/apf/apfElement.cc index 534e6a35c..ac107cb56 100644 --- a/apf/apfElement.cc +++ b/apf/apfElement.cc @@ -26,6 +26,10 @@ void Element::init(Field* f, MeshEntity* e, VectorElement* p) getNodeData(); } +Element::Element() +{ +} + Element::Element(Field* f, MeshEntity* e) { init(f,e,0); diff --git a/apf/apfElement.h b/apf/apfElement.h index 9a1b1f185..0be5f16db 100644 --- a/apf/apfElement.h +++ b/apf/apfElement.h @@ -21,6 +21,7 @@ class VectorElement; class Element { public: + Element(); Element(Field* f, MeshEntity* e); Element(Field* f, VectorElement* p); virtual ~Element(); diff --git a/apf/apfElementOf.h b/apf/apfElementOf.h index afedf6111..5296d14a7 100644 --- a/apf/apfElementOf.h +++ b/apf/apfElementOf.h @@ -18,6 +18,10 @@ template class ElementOf : public Element { public: + ElementOf(): + Element() + { + } ElementOf(FieldOf* f, MeshEntity* e): Element(f,e) { diff --git a/apf/apfVectorElement.cc b/apf/apfVectorElement.cc index fa49e6a16..c5ffd52b1 100644 --- a/apf/apfVectorElement.cc +++ b/apf/apfVectorElement.cc @@ -10,6 +10,11 @@ namespace apf { +VectorElement::VectorElement(): + ElementOf() +{ +} + VectorElement::VectorElement(VectorField* f, MeshEntity* e): ElementOf(f,e) { diff --git a/apf/apfVectorElement.h b/apf/apfVectorElement.h index de4c3c447..bc503de44 100644 --- a/apf/apfVectorElement.h +++ b/apf/apfVectorElement.h @@ -18,6 +18,7 @@ class VectorField; class VectorElement : public ElementOf { public: + VectorElement(); VectorElement(VectorField* f, MeshEntity* e); VectorElement(VectorField* f, VectorElement* p); virtual ~VectorElement() {} diff --git a/ma/maSize.cc b/ma/maSize.cc index c0a39ea9b..3388f0563 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -212,25 +212,24 @@ struct MetricSizeField : public SizeField } double measure(Entity* e) { - if (me == 0) me = apf::createMeshElement(mesh, e); - else me->init(mesh->getCoordinateField(), e, 0); + me.init(mesh->getCoordinateField(), e, 0); int integrationOrder = std::max(mesh->getShape()->getOrder(), order)+1; double measurement = 0; - int dim = apf::getDimension(me); - int np = numIntegrationPoints.try_emplace(dim, countIntPoints(me,integrationOrder)).first->second; - double w = integrationWeight.try_emplace(dim, getIntWeight(me,integrationOrder,0)).first->second; + int dim = apf::getDimension(&me); + int np = numIntegrationPoints.try_emplace(dim, countIntPoints(&me,integrationOrder)).first->second; + double w = integrationWeight.try_emplace(dim, getIntWeight(&me,integrationOrder,0)).first->second; for (int p=0; p < np; ++p) { Vector point; auto it = integrationPoint.find({dim, p}); if (it == integrationPoint.end()) { - getIntPoint(me,integrationOrder,p,point); + getIntPoint(&me,integrationOrder,p,point); integrationPoint.insert(it, {{dim, p}, point}); } else point = it->second; Matrix Q; - getTransform(me,point,Q); + getTransform(&me,point,Q); Matrix J; - apf::getJacobian(me,point,J); + apf::getJacobian(&me,point,J); /* transforms the rows of J, the differential tangent vectors, into the metric space, then uses the generalized determinant */ double dV2 = apf::getJacobianDeterminant(J*Q,dim); @@ -253,7 +252,7 @@ struct MetricSizeField : public SizeField } Mesh* mesh; int order; // this is the underlying sizefield order (default 1) - apf::MeshElement* me=0; + apf::MeshElement me; std::map numIntegrationPoints; std::map integrationWeight; std::map, Vector> integrationPoint; From a80fbc1bb2deaf260b14ba93527c0528aa8b44b1 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Dec 2025 21:17:46 -0500 Subject: [PATCH 296/319] simplify get integration point --- apf/apf.cc | 7 +++++++ apf/apf.h | 9 +++++++++ ma/maSize.cc | 8 +------- 3 files changed, 17 insertions(+), 7 deletions(-) diff --git a/apf/apf.cc b/apf/apf.cc index 662a69709..f589340c0 100644 --- a/apf/apf.cc +++ b/apf/apf.cc @@ -357,6 +357,13 @@ void getIntPoint(MeshElement* e, int order, int point, Vector3& param) param = p->param; } +Vector3 getIntPoint(MeshElement* e, int order, int point) +{ + IntegrationPoint const* p = + getIntegration(e->getType())->getAccurate(order)->getPoint(point); + return p->param; +} + double getIntWeight(MeshElement* e, int order, int point) { IntegrationPoint const* p = diff --git a/apf/apf.h b/apf/apf.h index 9a9ba849a..3d03379da 100644 --- a/apf/apf.h +++ b/apf/apf.h @@ -383,6 +383,15 @@ int countIntPoints(MeshElement* e, int order); */ void getIntPoint(MeshElement* e, int order, int point, Vector3& param); + +/** \brief Get an integration point in an element. + * + * \param order The polynomial order of accuracy. + * \param point The integration point number. + * \returns The resulting local coordinate of the integration point. + */ +Vector3 getIntPoint(MeshElement* e, int order, int point); + /** \brief Get the weight of an integration point in an element. * * \details All integration point tables in APF are scaled diff --git a/ma/maSize.cc b/ma/maSize.cc index 3388f0563..c0f4b7bc3 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -219,13 +219,7 @@ struct MetricSizeField : public SizeField int np = numIntegrationPoints.try_emplace(dim, countIntPoints(&me,integrationOrder)).first->second; double w = integrationWeight.try_emplace(dim, getIntWeight(&me,integrationOrder,0)).first->second; for (int p=0; p < np; ++p) { - Vector point; - auto it = integrationPoint.find({dim, p}); - if (it == integrationPoint.end()) { - getIntPoint(&me,integrationOrder,p,point); - integrationPoint.insert(it, {{dim, p}, point}); - } - else point = it->second; + Vector point = integrationPoint.try_emplace({dim, p}, getIntPoint(&me,integrationOrder,p)).first->second; Matrix Q; getTransform(&me,point,Q); Matrix J; From 169a0be1c89e7f53ddee94aea115b3befe527fe3 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Dec 2025 22:42:11 -0500 Subject: [PATCH 297/319] remove max jacobian --- ma/maQuality.cc | 22 +++++++++++----------- 1 file changed, 11 insertions(+), 11 deletions(-) diff --git a/ma/maQuality.cc b/ma/maQuality.cc index 8303b52ec..e02851946 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -151,22 +151,22 @@ double measureTetQuality(Mesh* m, SizeField* f, Entity* tet, bool useMax) * If useMax is true metric at a (downward) vertex with the * largest determinant is used. * Note: In the future we may want to used average of Q over the tet */ - Matrix Q; - if (useMax) - Q = getMetricWithMaxJacobean(m, f, tet); - else { - apf::MeshElement* me = createMeshElement(m, tet); - Vector xi(0.25, 0.25, 0.25); - f->getTransform(me, xi, Q); - apf::destroyMeshElement(me); - } + // Matrix Q; + // if (useMax) + // Q = getMetricWithMaxJacobean(m, f, tet); + // else { + // apf::MeshElement* me = createMeshElement(m, tet); + // Vector xi(0.25, 0.25, 0.25); + // f->getTransform(me, xi, Q); + // apf::destroyMeshElement(me); + // } Entity* e[6]; m->getDownward(tet,1,e); double l[6]; for (int i=0; i < 6; ++i) - l[i] = qMeasure(m, e[i], Q); - double V = qMeasure(m, tet, Q); + l[i] = f->measure(e[i]); + double V = f->measure(tet); double s=0; for (int i=0; i < 6; ++i) s += l[i]*l[i]; From 2ab64c8a681eca0d9c81b47d9fe70fb1cead5f4e Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 3 Dec 2025 22:53:11 -0500 Subject: [PATCH 298/319] simplify element usage --- ma/maSize.cc | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index c0f4b7bc3..5620d30d7 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -524,10 +524,10 @@ struct LogAnisoSizeField : public MetricSizeField Vector const& xi, Matrix& Q) { - if (logMElement==0) logMElement = apf::createElement(logMField,me); - else if (me->getEntity() != logMElement->getEntity()) logMElement->init(logMField,me->getEntity(),me); + if (me->getEntity() != logMElement.getEntity()) + logMElement.init(logMField,me->getEntity(),me); Matrix logM; - apf::getMatrix(logMElement,xi,logM); + apf::getMatrix(&logMElement,xi,logM); Vector v; Matrix R; orthogonalEigenDecompForSymmetricMatrix(logM, v, R); @@ -541,10 +541,10 @@ struct LogAnisoSizeField : public MetricSizeField Vector const& xi, Entity* newVert) { - if (logMElement==0) logMElement = apf::createElement(logMField,parent); - else if (parent->getEntity() != logMElement->getEntity()) logMElement->init(logMField,parent->getEntity(),parent); + if (parent->getEntity() != logMElement.getEntity()) + logMElement.init(logMField,parent->getEntity(),parent); Matrix logM; - apf::getMatrix(logMElement,xi,logM); + apf::getMatrix(&logMElement,xi,logM); this->setValue(newVert,logM); } void setValue( @@ -590,7 +590,7 @@ struct LogAnisoSizeField : public MetricSizeField return apf::getShape(logMField)->hasNodesIn(dimension); } apf::NewArray fieldVal; - apf::Element* logMElement=0; + apf::Element logMElement; apf::Field* logMField; LogMEval logMEval; }; From 2ae9e37910bfcfdeb6214bf47e299195975a6d68 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 4 Dec 2025 16:45:19 -0500 Subject: [PATCH 299/319] moved reposition --- ma/maReposition.cc | 62 ++++++++++++++++++++++++++++++++++++++++++++++ ma/maReposition.h | 20 +++++++++++++++ ma/maSnapper.cc | 12 ++++++--- ma/maSnapper.h | 2 ++ 4 files changed, 92 insertions(+), 4 deletions(-) diff --git a/ma/maReposition.cc b/ma/maReposition.cc index 42be04314..900284a3f 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -1,4 +1,7 @@ #include "maReposition.h" +#include "maAdapt.h" +#include "maShape.h" +#include "maShapeHandler.h" #include #include #include @@ -11,6 +14,65 @@ namespace ma { +RepositionVertex::RepositionVertex(Adapt* a) : adapt(a), mesh(a->mesh) +{ +} + +void findInvalid(Adapt* a, Upward& adjacentElements, apf::Up& invalid) +{ + double worstQuality = 1; + invalid.n = 0; + for (size_t i = 0; i < adjacentElements.getSize(); ++i) { + /* for now, when snapping a vertex on the boundary + layer, ignore the quality of layer elements. + not only do we not have metrics for this, but the + algorithm that moves curves would need to change */ + if (getFlag(a, adjacentElements[i], LAYER)) + continue; + double quality; + if (a->mesh->getType(adjacentElements[i]) == apf::Mesh::TET && !isTetValid(a->mesh, adjacentElements[i])) + quality = -1; + else + quality = a->shape->getQuality(adjacentElements[i]); + + if (quality < worstQuality) + worstQuality = quality; + if (quality < a->input->validQuality) + invalid.e[invalid.n++] = adjacentElements[i]; + } +} + +bool RepositionVertex::move(Entity* vertex, Vector target) +{ + invalid.n = 0; + adjacentElements.setSize(0); + this->vertex = vertex; + this->prevPosition = getPosition(mesh, vertex); + mesh->setPoint(vertex, 0, target); + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + findInvalid(adapt, adjacentElements, invalid); + if (invalid.n == 0) return true; + cancel(vertex); + return false; +} + +void RepositionVertex::cancel(Entity* vertex) +{ + PCU_ALWAYS_ASSERT(this->vertex == vertex); + mesh->setPoint(vertex, 0, prevPosition); +} + +apf::Up& RepositionVertex::getInvalid() +{ + return invalid; +} + +double RepositionVertex::getWorstQuality() +{ + return worstQuality; +} + + typedef mth::AD AD; typedef mth::Vector ADVec; diff --git a/ma/maReposition.h b/ma/maReposition.h index 87f603926..355817ad7 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -2,9 +2,29 @@ #define MA_REPOSITION_H #include "maMesh.h" +#include "ma.h" namespace ma { +class RepositionVertex +{ + public: + RepositionVertex(Adapt* a); + bool move(Entity* vertex, Vector target); + void cancel(Entity* vertex); + apf::Up& getInvalid(); + double getWorstQuality(); + + private: + Adapt* adapt; + Mesh* mesh; + Entity* vertex; + Vector prevPosition; + Upward adjacentElements; + apf::Up invalid; + double worstQuality; +}; + bool repositionVertex(Mesh* m, Entity* v, int max_iters, double initial_speed); diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index 6f4706b94..ccf1a0895 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -38,7 +38,7 @@ namespace ma { -Snapper::Snapper(Adapt* a, Tag* st) : mesh(a->mesh), splitCollapse(a), doubleSplitCollapse(a) +Snapper::Snapper(Adapt* a, Tag* st) : mesh(a->mesh), splitCollapse(a), doubleSplitCollapse(a), reposition(a) { adapt = a; adapt = a; @@ -625,8 +625,12 @@ to apply certain opperators so other algoritms were adapted from old scorec libr */ bool Snapper::run() { - apf::Up invalid; - bool success = tryReposition(adapt, vert, snapTag, invalid); + if (!mesh->hasTag(vert, snapTag)) return true; + Vector target; + adapt->mesh->getDoubleTag(vert, snapTag, &target[0]); + bool success = reposition.move(vert, target); + apf::Up& invalid = reposition.getInvalid(); + if (success) { numSnapped++; mesh->removeTag(vert,snapTag); @@ -639,7 +643,7 @@ bool Snapper::run() if (!success) FPP = getFPP(adapt, vert, snapTag, invalid); if (!success) success = tryCollapseToVertex(FPP); if (!success) success = tryReduceCommonEdges(FPP); - // if (!success) success = tryCollapseTetEdges(FPP); //TODO causing holes in mesh + if (!success) success = tryCollapseTetEdges(FPP); //TODO causing holes in mesh if (!success) success = trySwapOrSplit(FPP); } diff --git a/ma/maSnapper.h b/ma/maSnapper.h index 9b505311d..38319213d 100644 --- a/ma/maSnapper.h +++ b/ma/maSnapper.h @@ -14,6 +14,7 @@ #include "maSingleSplitCollapse.h" #include "maDoubleSplitCollapse.h" #include "maEdgeSwap.h" +#include "maReposition.h" namespace apf { class CavityOp; @@ -52,6 +53,7 @@ class Snapper Collapse collapse; SingleSplitCollapse splitCollapse; DoubleSplitCollapse doubleSplitCollapse; + RepositionVertex reposition; EdgeSwap* edgeSwap; bool tryCollapseToVertex(FirstProblemPlane* FPP); From 293d8daeaa64694593d0d689a3ac1f9d0e7125f8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 4 Dec 2025 17:06:43 -0500 Subject: [PATCH 300/319] small rewrite --- ma/maReposition.cc | 20 +++++++++----------- ma/maReposition.h | 2 ++ 2 files changed, 11 insertions(+), 11 deletions(-) diff --git a/ma/maReposition.cc b/ma/maReposition.cc index 900284a3f..ffa5557f8 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -18,27 +18,25 @@ RepositionVertex::RepositionVertex(Adapt* a) : adapt(a), mesh(a->mesh) { } -void findInvalid(Adapt* a, Upward& adjacentElements, apf::Up& invalid) +void RepositionVertex::findInvalid() { - double worstQuality = 1; + worstQuality = 1; invalid.n = 0; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { /* for now, when snapping a vertex on the boundary layer, ignore the quality of layer elements. not only do we not have metrics for this, but the algorithm that moves curves would need to change */ - if (getFlag(a, adjacentElements[i], LAYER)) - continue; + if (getFlag(adapt, adjacentElements[i], LAYER)) continue; + double quality; - if (a->mesh->getType(adjacentElements[i]) == apf::Mesh::TET && !isTetValid(a->mesh, adjacentElements[i])) + if (mesh->getType(adjacentElements[i]) == apf::Mesh::TET && !isTetValid(mesh, adjacentElements[i])) quality = -1; else - quality = a->shape->getQuality(adjacentElements[i]); + quality = adapt->shape->getQuality(adjacentElements[i]); - if (quality < worstQuality) - worstQuality = quality; - if (quality < a->input->validQuality) - invalid.e[invalid.n++] = adjacentElements[i]; + if (quality < worstQuality) worstQuality = quality; + if (quality < adapt->input->validQuality) invalid.e[invalid.n++] = adjacentElements[i]; } } @@ -50,7 +48,7 @@ bool RepositionVertex::move(Entity* vertex, Vector target) this->prevPosition = getPosition(mesh, vertex); mesh->setPoint(vertex, 0, target); mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - findInvalid(adapt, adjacentElements, invalid); + findInvalid(); if (invalid.n == 0) return true; cancel(vertex); return false; diff --git a/ma/maReposition.h b/ma/maReposition.h index 355817ad7..95a927abe 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -23,6 +23,8 @@ class RepositionVertex Upward adjacentElements; apf::Up invalid; double worstQuality; + + void findInvalid(); }; bool repositionVertex(Mesh* m, Entity* v, From 5836973c27bab0b3229ebae1a92a4efc7a79e4cd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 4 Dec 2025 22:18:17 -0500 Subject: [PATCH 301/319] removed unsused --- ma/maReposition.cc | 15 +++++++++++- ma/maReposition.h | 2 ++ ma/maSnapper.cc | 59 ++++------------------------------------------ 3 files changed, 20 insertions(+), 56 deletions(-) diff --git a/ma/maReposition.cc b/ma/maReposition.cc index ffa5557f8..ef359763e 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -18,6 +18,18 @@ RepositionVertex::RepositionVertex(Adapt* a) : adapt(a), mesh(a->mesh) { } +void RepositionVertex::storeOldCache() +{ + oldCache.clear(); + for (size_t i = 0; i < adjacentElements.getSize(); ++i) { + if (mesh->hasTag(adjacentElements[i], adapt->qualityCache)) { + oldCache.push_back(getCachedQuality(adapt, adjacentElements[i])); + mesh->removeTag(adjacentElements[i], adapt->qualityCache); + } + else oldCache.push_back(-1); + } +} + void RepositionVertex::findInvalid() { worstQuality = 1; @@ -46,8 +58,9 @@ bool RepositionVertex::move(Entity* vertex, Vector target) adjacentElements.setSize(0); this->vertex = vertex; this->prevPosition = getPosition(mesh, vertex); - mesh->setPoint(vertex, 0, target); mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + // storeOldCache(); + mesh->setPoint(vertex, 0, target); findInvalid(); if (invalid.n == 0) return true; cancel(vertex); diff --git a/ma/maReposition.h b/ma/maReposition.h index 95a927abe..bc7a2fd9c 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -23,8 +23,10 @@ class RepositionVertex Upward adjacentElements; apf::Up invalid; double worstQuality; + std::vector oldCache; void findInvalid(); + void storeOldCache(); }; bool repositionVertex(Mesh* m, Entity* v, diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index ccf1a0895..e29b97ca5 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -306,23 +306,6 @@ int getTetStats(Adapt* a, Entity* vert, Entity* face, Entity* region, Entity* en return bit; } -static void getInvalidTets(Adapt* a, Upward& adjacentElements, apf::Up& invalid) -{ - invalid.n = 0; - Vector v[4]; - for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - /* for now, when snapping a vertex on the boundary - layer, ignore the quality of layer elements. - not only do we not have metrics for this, but the - algorithm that moves curves would need to change */ - if (getFlag(a, adjacentElements[i], LAYER)) - continue; - ma::getVertPoints(a->mesh,adjacentElements[i],v); - if ((cross((v[1] - v[0]), (v[2] - v[0])) * (v[3] - v[0])) < 0) - invalid.e[invalid.n++] = adjacentElements[i]; - } -} - static int debugprint = 0; /* @@ -572,46 +555,12 @@ static FirstProblemPlane* getFPP(Adapt* a, Entity* vertex, Tag* snapTag, apf::Up return FPP; } -static void getInvalid(Adapt* a, Upward& adjacentElements, apf::Up& invalid) -{ - invalid.n = 0; - for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - /* for now, when snapping a vertex on the boundary - layer, ignore the quality of layer elements. - not only do we not have metrics for this, but the - algorithm that moves curves would need to change */ - if (getFlag(a, adjacentElements[i], LAYER)) - continue; - if (a->mesh->getType(adjacentElements[i]) == apf::Mesh::TET - && !isTetValid(a->mesh, adjacentElements[i])) - invalid.e[invalid.n++] = adjacentElements[i]; - else if (a->shape->getQuality(adjacentElements[i]) < a->input->validQuality) - invalid.e[invalid.n++] = adjacentElements[i]; - } -} - -//Moved vertex to model surface or returns invalid elements if not possible -static bool tryReposition(Adapt* adapt, Entity* vertex, Tag* snapTag, apf::Up& invalid) -{ - Mesh* mesh = adapt->mesh; - if (!mesh->hasTag(vertex, snapTag)) return true; - Vector prev = getPosition(mesh, vertex); - Vector target; - mesh->getDoubleTag(vertex, snapTag, &target[0]); - Upward adjacentElements; - mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - - mesh->setPoint(vertex, 0, target); - getInvalid(adapt, adjacentElements, invalid); - if (invalid.n == 0) return true; - mesh->setPoint(vertex, 0, prev); - return false; -} - bool Snapper::trySimpleSnap() { - apf::Up invalid; - return tryReposition(adapt, vert, snapTag, invalid); + if (!mesh->hasTag(vert, snapTag)) return true; + Vector target; + adapt->mesh->getDoubleTag(vert, snapTag, &target[0]); + return reposition.move(vert, target); } #if defined(DEBUG_FPP) static int DEBUGFAILED=0; From 1c9ca21c6a886e7c73a46732cdf78e2f34d30ee3 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 4 Dec 2025 23:55:05 -0500 Subject: [PATCH 302/319] move to heightest quality --- ma/maFixShape.cc | 42 ++---------------------------------- ma/maFixShape.h | 4 ++-- ma/maReposition.cc | 53 ++++++++++++++++++++++++++++++++++++++++++++++ ma/maReposition.h | 4 ++++ 4 files changed, 61 insertions(+), 42 deletions(-) diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 7d04442f0..18aff2ccc 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -56,7 +56,7 @@ void unMarkBadQualityNew(Adapt* a) m->end(it); } -FixShape::FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt), split(adapt) +FixShape::FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt), split(adapt), reposition(adapt) { a = adapt; mesh = a->mesh; @@ -138,44 +138,6 @@ double FixShape::getWorstShape(EntityArray& tets, Entity*& worst) return worstQuality; } -Vector FixShape::avgCavityPos(Entity* vert) -{ - apf::Up edges; - mesh->getUp(vert, edges); - Vector avg(0,0,0); - for (int i=0; igetAdjacent(vert, mesh->getDimension(), adjacent); - Entity* worstShape; - Vector prevPos = getPosition(mesh, vert); - getWorstShape(adjacent, worstShape); - Vector dir = (avgCavityPos(vert) - prevPos).normalize(); - double speed = (avgCavityPos(vert) - prevPos).getLength()/2; - double prevWorstQuality = 0; - for (int i=0; i<10; i++) { - double worstQuality = getWorstShape(adjacent, worstShape); - if (worstQuality > prevWorstQuality) { - prevWorstQuality = worstQuality; - prevPos = getPosition(mesh, vert); - mesh->setPoint(vert, 0, prevPos + (dir * speed)); - speed *= 2; - } - else { - mesh->setPoint(vert, 0, prevPos); - speed /= 4; - } - } -} - bool FixShape::splitReposition(Entity* edge) { if (!isInModelRegion(mesh, edge)) return false; @@ -185,7 +147,7 @@ bool FixShape::splitReposition(Entity* edge) split.makeNewElements(); split.transfer(); Entity* newVert = split.getSplitVert(0); - repositionVertex(newVert); + reposition.moveToHighestQuality(newVert); EntityArray adjacent; mesh->getAdjacent(newVert, mesh->getDimension(), adjacent); diff --git a/ma/maFixShape.h b/ma/maFixShape.h index e12c34f89..b26b5e988 100644 --- a/ma/maFixShape.h +++ b/ma/maFixShape.h @@ -10,6 +10,7 @@ #include "maSingleSplitCollapse.h" #include "maFaceSplitCollapse.h" #include "maFaceSwap.h" +#include "maReposition.h" namespace ma { class Adapt; @@ -23,6 +24,7 @@ class FixShape : public Operator SingleSplitCollapse splitCollapse; DoubleSplitCollapse doubleSplitCollapse; FaceSplitCollapse faceSplitCollapse; + RepositionVertex reposition; EdgeSwap* edgeSwap; Splits split; Entity* badTet; @@ -56,8 +58,6 @@ class FixShape : public Operator double getWorstShape(EntityArray& tets, Entity*& worst); Entity* getLongestEdge(Entity* edges[3]); - Vector avgCavityPos(Entity* vert); - void repositionVertex(Entity* vert); bool splitReposition(Entity* edge); bool collapseRegion(Entity* tet); diff --git a/ma/maReposition.cc b/ma/maReposition.cc index ef359763e..6a2c71522 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -67,6 +67,59 @@ bool RepositionVertex::move(Entity* vertex, Vector target) return false; } +Vector RepositionVertex::cavityCenter() +{ + apf::Up edges; + mesh->getUp(vertex, edges); + Vector avg(0,0,0); + for (int i=0; ishape->getQuality(adjacentElements[i]); + if (quality < worstQuality) { + worstQuality = quality; + worstTet = adjacentElements[i]; + } + } +} + +void RepositionVertex::moveToHighestQuality(Entity* vertex) +{ + invalid.n = 0; + adjacentElements.setSize(0); + this->vertex = vertex; + prevPosition = getPosition(mesh, vertex); + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + storeOldCache(); + + Vector center = cavityCenter(); + Vector dir = (center - prevPosition).normalize(); + double speed = (center - prevPosition).getLength()/2; + double prevWorstQuality = 0; + for (int i=0; i<10; i++) { + findWorstShape(); + if (worstQuality > prevWorstQuality) { + prevWorstQuality = worstQuality; + prevPosition = getPosition(mesh, vertex); + mesh->setPoint(vertex, 0, prevPosition + (dir * speed)); + speed *= 2; + } + else { + mesh->setPoint(vertex, 0, prevPosition); + speed /= 4; + } + } +} + void RepositionVertex::cancel(Entity* vertex) { PCU_ALWAYS_ASSERT(this->vertex == vertex); diff --git a/ma/maReposition.h b/ma/maReposition.h index bc7a2fd9c..999e2a044 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -11,6 +11,7 @@ class RepositionVertex public: RepositionVertex(Adapt* a); bool move(Entity* vertex, Vector target); + void moveToHighestQuality(Entity* vertex); void cancel(Entity* vertex); apf::Up& getInvalid(); double getWorstQuality(); @@ -22,11 +23,14 @@ class RepositionVertex Vector prevPosition; Upward adjacentElements; apf::Up invalid; + Entity* worstTet; double worstQuality; std::vector oldCache; void findInvalid(); void storeOldCache(); + Vector cavityCenter(); + void findWorstShape(); }; bool repositionVertex(Mesh* m, Entity* v, From 1447fae412a93230aa0f427c044997e631e22177 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 5 Dec 2025 17:02:26 -0500 Subject: [PATCH 303/319] debugging functions --- ma/ma.cc | 1 + ma/maSize.cc | 11 +++++++++++ 2 files changed, 12 insertions(+) diff --git a/ma/ma.cc b/ma/ma.cc index 1453620c5..cd746c999 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -64,6 +64,7 @@ void printHistogramStats(Adapt* a) void adapt(Input* in) { + apf::writeVtkFiles("mesh_tets_start", in->mesh, 3); double t0 = pcu::Time(); print(in->mesh->getPCU(), "version 2.0 !"); validateInput(in); diff --git a/ma/maSize.cc b/ma/maSize.cc index 5620d30d7..9231ebb18 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -487,6 +487,17 @@ struct LogAnisoSizeField : public MetricSizeField { apf::destroyField(logMField); } + Vector clampLength(Vector const& v, double maxLen) + { + double len = v.getLength(); + if (len == 0.0) return v; + + double clamped = len; + if (maxLen > 0.0 && clamped > maxLen) clamped = maxLen; + + if (clamped == len) return v; + return v * (clamped / len); + } void init(Mesh* m, apf::Field* sizes, apf::Field* frames) { mesh = m; From 2c9597533ebb266aa2d6c5970fd21fc45e54f2d8 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 11 Dec 2025 14:21:49 -0500 Subject: [PATCH 304/319] fixed quality over 1.0 --- ma/ma.cc | 1 + ma/maDBG.cc | 11 ++++++++++- ma/maDBG.h | 2 +- ma/maFixShape.cc | 2 +- ma/maQuality.cc | 22 +++++++++++----------- ma/maSize.cc | 14 +++++--------- ma/maSnapper.cc | 2 +- 7 files changed, 30 insertions(+), 24 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index cd746c999..441780514 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -93,6 +93,7 @@ void adapt(Input* in) double t1 = pcu::Time(); print(m->getPCU(), "mesh adapted in %f seconds", t1-t0); m->verify(); + ma_dbg::addFieldInfo(a); apf::writeVtkFiles("mesh_tets_end", m, 3); printHistogramStats(a); diff --git a/ma/maDBG.cc b/ma/maDBG.cc index fdd77f4ab..056fa5845 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -58,7 +58,7 @@ apf::Field* getField(ma::Adapt* a, int dim, const char* fieldName) return field; } -void addClassification(ma::Adapt* a) +void addFieldInfo(ma::Adapt* a) { ma::Mesh* m = a->mesh; apf::Field* fieldVert = getField(a, 0, "vert_classification"); @@ -86,6 +86,15 @@ void addClassification(ma::Adapt* a) apf::setComponents(fieldFace, e, 0, &modelDimension); } m->end(it); + + // measure qualities + std::vector lq_metric; + std::vector lq_no_metric; + ma::getLinearQualitiesInMetricSpace(a->mesh, a->sizeField, lq_metric); + ma::getLinearQualitiesInPhysicalSpace(a->mesh, lq_no_metric); + colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_metric, "qual_metric"); + colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_no_metric, "qual_no_metric"); + } void addTargetLocation(ma::Adapt* a, diff --git a/ma/maDBG.h b/ma/maDBG.h index 09c654a32..7b061b30b 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -27,7 +27,7 @@ void writeMesh(ma::Mesh* m, /* Creates a field to contain the model classification for each vertex. Which can be printed to a file using writeMesh() with dim=0. */ -void addClassification(ma::Adapt* a); +void addFieldInfo(ma::Adapt* a); void addTargetLocation(ma::Adapt* a, const char* fieldName); diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 18aff2ccc..0321ae788 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -368,7 +368,7 @@ void FixShape::printBadShape(Entity* problemTet) else if (isTwoLargeAngles(problemTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); else print(a->mesh->getPCU(), "Worst is three large angles\n"); - ma_dbg::addClassification(a); + ma_dbg::addFieldInfo(a); EntitySet bad; bad.insert(problemTet); diff --git a/ma/maQuality.cc b/ma/maQuality.cc index e02851946..8303b52ec 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -151,22 +151,22 @@ double measureTetQuality(Mesh* m, SizeField* f, Entity* tet, bool useMax) * If useMax is true metric at a (downward) vertex with the * largest determinant is used. * Note: In the future we may want to used average of Q over the tet */ - // Matrix Q; - // if (useMax) - // Q = getMetricWithMaxJacobean(m, f, tet); - // else { - // apf::MeshElement* me = createMeshElement(m, tet); - // Vector xi(0.25, 0.25, 0.25); - // f->getTransform(me, xi, Q); - // apf::destroyMeshElement(me); - // } + Matrix Q; + if (useMax) + Q = getMetricWithMaxJacobean(m, f, tet); + else { + apf::MeshElement* me = createMeshElement(m, tet); + Vector xi(0.25, 0.25, 0.25); + f->getTransform(me, xi, Q); + apf::destroyMeshElement(me); + } Entity* e[6]; m->getDownward(tet,1,e); double l[6]; for (int i=0; i < 6; ++i) - l[i] = f->measure(e[i]); - double V = f->measure(tet); + l[i] = qMeasure(m, e[i], Q); + double V = qMeasure(m, tet, Q); double s=0; for (int i=0; i < 6; ++i) s += l[i]*l[i]; diff --git a/ma/maSize.cc b/ma/maSize.cc index 9231ebb18..a40ad2284 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -487,16 +487,11 @@ struct LogAnisoSizeField : public MetricSizeField { apf::destroyField(logMField); } - Vector clampLength(Vector const& v, double maxLen) + void clampComponents(Vector& v, double max) { - double len = v.getLength(); - if (len == 0.0) return v; - - double clamped = len; - if (maxLen > 0.0 && clamped > maxLen) clamped = maxLen; - - if (clamped == len) return v; - return v * (clamped / len); + if (v[0] > max) v[0] = max; + if (v[1] > max) v[1] = max; + if (v[2] > max) v[2] = max; } void init(Mesh* m, apf::Field* sizes, apf::Field* frames) { @@ -519,6 +514,7 @@ struct LogAnisoSizeField : public MetricSizeField Matrix f; apf::getVector(sizes, ent, i, h); apf::getMatrix(frames, ent, i, f); + // clampComponents(h, 5); Vector s(log(1/h[0]/h[0]), log(1/h[1]/h[1]), log(1/h[2]/h[2])); Matrix S(s[0], 0 , 0, 0 , s[1], 0, diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index e29b97ca5..b11dbd7f7 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -97,7 +97,7 @@ static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) static void printFPP(Adapt* a, FirstProblemPlane* FPP) { ma_dbg::addTargetLocation(a, "snap_target"); - ma_dbg::addClassification(a); + ma_dbg::addFieldInfo(a); apf::writeVtkFiles("FPP_Mesh", a->mesh); EntitySet invalid; From 0c36c21d404a6b508649822889a5cf66581ff7b9 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 11 Dec 2025 16:49:51 -0500 Subject: [PATCH 305/319] remove unused split reposition --- ma/maReposition.cc | 13 +------------ ma/maReposition.h | 2 -- 2 files changed, 1 insertion(+), 14 deletions(-) diff --git a/ma/maReposition.cc b/ma/maReposition.cc index 6a2c71522..b76b921ea 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -32,7 +32,6 @@ void RepositionVertex::storeOldCache() void RepositionVertex::findInvalid() { - worstQuality = 1; invalid.n = 0; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { /* for now, when snapping a vertex on the boundary @@ -47,7 +46,6 @@ void RepositionVertex::findInvalid() else quality = adapt->shape->getQuality(adjacentElements[i]); - if (quality < worstQuality) worstQuality = quality; if (quality < adapt->input->validQuality) invalid.e[invalid.n++] = adjacentElements[i]; } } @@ -85,10 +83,7 @@ void RepositionVertex::findWorstShape() worstQuality = 1; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { double quality = adapt->shape->getQuality(adjacentElements[i]); - if (quality < worstQuality) { - worstQuality = quality; - worstTet = adjacentElements[i]; - } + if (quality < worstQuality) worstQuality = quality; } } @@ -131,12 +126,6 @@ apf::Up& RepositionVertex::getInvalid() return invalid; } -double RepositionVertex::getWorstQuality() -{ - return worstQuality; -} - - typedef mth::AD AD; typedef mth::Vector ADVec; diff --git a/ma/maReposition.h b/ma/maReposition.h index 999e2a044..f7de26c23 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -14,7 +14,6 @@ class RepositionVertex void moveToHighestQuality(Entity* vertex); void cancel(Entity* vertex); apf::Up& getInvalid(); - double getWorstQuality(); private: Adapt* adapt; @@ -23,7 +22,6 @@ class RepositionVertex Vector prevPosition; Upward adjacentElements; apf::Up invalid; - Entity* worstTet; double worstQuality; std::vector oldCache; From 3f3e2305271332746f83a1642b4fcdb9c623b7c0 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 12 Dec 2025 22:25:16 -0500 Subject: [PATCH 306/319] cache quality functions --- ma/maQuality.cc | 4 ++-- ma/maSize.cc | 27 +++++++++++++++++++++++++++ ma/maSize.h | 2 ++ 3 files changed, 31 insertions(+), 2 deletions(-) diff --git a/ma/maQuality.cc b/ma/maQuality.cc index 8303b52ec..4a6ca9a83 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -165,8 +165,8 @@ double measureTetQuality(Mesh* m, SizeField* f, Entity* tet, bool useMax) m->getDownward(tet,1,e); double l[6]; for (int i=0; i < 6; ++i) - l[i] = qMeasure(m, e[i], Q); - double V = qMeasure(m, tet, Q); + l[i] = f->measure(e[i], Q); + double V = f->measure(tet, Q); double s=0; for (int i=0; i < 6; ++i) s += l[i]*l[i]; diff --git a/ma/maSize.cc b/ma/maSize.cc index a40ad2284..eb6543446 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -60,6 +60,14 @@ double IdentitySizeField::measure(Entity* e) return x; } +double IdentitySizeField::measure(Entity* e, Matrix const& Q) +{ + apf::MeshElement* me = apf::createMeshElement(mesh,e); + double x = apf::measure(me); + apf::destroyMeshElement(me); + return x; +} + bool IdentitySizeField::shouldSplit(Entity*) { return false; @@ -231,6 +239,25 @@ struct MetricSizeField : public SizeField } return measurement; } + double measure(Entity* e, Matrix const& Q) + { + me.init(mesh->getCoordinateField(), e, 0); + int integrationOrder = std::max(mesh->getShape()->getOrder(), order)+1; + double measurement = 0; + int dim = apf::getDimension(&me); + int np = numIntegrationPoints.try_emplace(dim, countIntPoints(&me,integrationOrder)).first->second; + double w = integrationWeight.try_emplace(dim, getIntWeight(&me,integrationOrder,0)).first->second; + for (int p=0; p < np; ++p) { + Vector point = integrationPoint.try_emplace({dim, p}, getIntPoint(&me,integrationOrder,p)).first->second; + Matrix J; + apf::getJacobian(&me,point,J); + /* transforms the rows of J, the differential tangent vectors, + into the metric space, then uses the generalized determinant */ + double dV2 = apf::getJacobianDeterminant(J*Q,dim); + measurement += w*dV2; + } + return measurement; + } bool shouldSplit(Entity* edge) { return this->measure(edge) > MAXLENGTH; diff --git a/ma/maSize.h b/ma/maSize.h index e8f9b6058..c32fd8088 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -32,6 +32,7 @@ class SizeField public: virtual ~SizeField(); virtual double measure(Entity* e) = 0; + virtual double measure(Entity* e, Matrix const& Q) = 0; virtual bool shouldSplit(Entity* edge) = 0; virtual bool shouldCollapse(Entity* edge) = 0; virtual void interpolate( @@ -57,6 +58,7 @@ struct IdentitySizeField : public SizeField { IdentitySizeField(Mesh* m); double measure(Entity* e); + double measure(Entity* e, Matrix const& Q); bool shouldSplit(Entity*); bool shouldCollapse(Entity*); void interpolate( From c74573d101cda06316b59000ff3ea5bf9bec596b Mon Sep 17 00:00:00 2001 From: Angelyr Date: Wed, 17 Dec 2025 17:31:22 -0500 Subject: [PATCH 307/319] using golden search --- ma/maReposition.cc | 50 +++++++++++++++++++++++++++------------------- ma/maReposition.h | 2 +- 2 files changed, 31 insertions(+), 21 deletions(-) diff --git a/ma/maReposition.cc b/ma/maReposition.cc index b76b921ea..d5887b68c 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -11,6 +11,7 @@ #include #include +#include namespace ma { @@ -78,13 +79,36 @@ Vector RepositionVertex::cavityCenter() return avg; } -void RepositionVertex::findWorstShape() +double RepositionVertex::findWorstShape(Vector position) { - worstQuality = 1; + mesh->setPoint(vertex, 0, position); + double worst = 1; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { double quality = adapt->shape->getQuality(adjacentElements[i]); - if (quality < worstQuality) worstQuality = quality; + if (quality < worst) worst = quality; } + return worst; +} + +Vector goldenSearch(const std::function &f, Vector left, Vector right, double tol) +{ + Vector prev_mean = left; + Vector mean = left; + const double M_GOLDEN_RATIO = (1.0 + std::sqrt(5.0)) / 2.0; + + do { + prev_mean = mean; + Vector delta_left = left + (right - left) * M_GOLDEN_RATIO; + Vector delta_right = right + (left - right) * M_GOLDEN_RATIO; + + if (f(delta_left) < f(delta_right)) + right = delta_right; + else + left = delta_left; + + mean = (left + right) / 2.f; + } while ((left-right).getLength() > tol); + return prev_mean; } void RepositionVertex::moveToHighestQuality(Entity* vertex) @@ -92,27 +116,13 @@ void RepositionVertex::moveToHighestQuality(Entity* vertex) invalid.n = 0; adjacentElements.setSize(0); this->vertex = vertex; - prevPosition = getPosition(mesh, vertex); mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); storeOldCache(); + prevPosition = getPosition(mesh, vertex); Vector center = cavityCenter(); - Vector dir = (center - prevPosition).normalize(); - double speed = (center - prevPosition).getLength()/2; - double prevWorstQuality = 0; - for (int i=0; i<10; i++) { - findWorstShape(); - if (worstQuality > prevWorstQuality) { - prevWorstQuality = worstQuality; - prevPosition = getPosition(mesh, vertex); - mesh->setPoint(vertex, 0, prevPosition + (dir * speed)); - speed *= 2; - } - else { - mesh->setPoint(vertex, 0, prevPosition); - speed /= 4; - } - } + const auto getQuality = [this](const Vector& pos) { return this->findWorstShape(pos); }; + Vector newPosition = goldenSearch(getQuality, prevPosition, center, 0.000001); } void RepositionVertex::cancel(Entity* vertex) diff --git a/ma/maReposition.h b/ma/maReposition.h index f7de26c23..7c817b2dd 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -28,7 +28,7 @@ class RepositionVertex void findInvalid(); void storeOldCache(); Vector cavityCenter(); - void findWorstShape(); + double findWorstShape(Vector position); }; bool repositionVertex(Mesh* m, Entity* v, From eb19262ba86fb79338af428a25256a3dc48382bd Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 18 Dec 2025 16:12:57 -0500 Subject: [PATCH 308/319] better reposition target --- ma/ma.cc | 2 +- ma/maReposition.cc | 84 ++++++++++++++++++++++++++++++---------------- ma/maReposition.h | 7 +++- 3 files changed, 63 insertions(+), 30 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 441780514..2753660a5 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -92,10 +92,10 @@ void adapt(Input* in) double t1 = pcu::Time(); print(m->getPCU(), "mesh adapted in %f seconds", t1-t0); + printHistogramStats(a); m->verify(); ma_dbg::addFieldInfo(a); apf::writeVtkFiles("mesh_tets_end", m, 3); - printHistogramStats(a); delete a; // cleanup input object and associated sizefield and solutiontransfer objects diff --git a/ma/maReposition.cc b/ma/maReposition.cc index d5887b68c..d115bae57 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -19,6 +19,17 @@ RepositionVertex::RepositionVertex(Adapt* a) : adapt(a), mesh(a->mesh) { } +void RepositionVertex::init(Entity* vertex) +{ + this->invalid.n = 0; + this->adjEdges.n = 0; + this->adjacentElements.setSize(0); + this->vertex = vertex; + this->prevPosition = getPosition(mesh, vertex); + mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + storeOldCache(); +} + void RepositionVertex::storeOldCache() { oldCache.clear(); @@ -33,7 +44,6 @@ void RepositionVertex::storeOldCache() void RepositionVertex::findInvalid() { - invalid.n = 0; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { /* for now, when snapping a vertex on the boundary layer, ignore the quality of layer elements. @@ -53,12 +63,7 @@ void RepositionVertex::findInvalid() bool RepositionVertex::move(Entity* vertex, Vector target) { - invalid.n = 0; - adjacentElements.setSize(0); - this->vertex = vertex; - this->prevPosition = getPosition(mesh, vertex); - mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - // storeOldCache(); + init(vertex); mesh->setPoint(vertex, 0, target); findInvalid(); if (invalid.n == 0) return true; @@ -66,19 +71,6 @@ bool RepositionVertex::move(Entity* vertex, Vector target) return false; } -Vector RepositionVertex::cavityCenter() -{ - apf::Up edges; - mesh->getUp(vertex, edges); - Vector avg(0,0,0); - for (int i=0; isetPoint(vertex, 0, position); @@ -113,16 +105,52 @@ Vector goldenSearch(const std::function &f, Vector left, Vector void RepositionVertex::moveToHighestQuality(Entity* vertex) { - invalid.n = 0; - adjacentElements.setSize(0); - this->vertex = vertex; - mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); - storeOldCache(); + init(vertex); + mesh->getUp(vertex, adjEdges); - prevPosition = getPosition(mesh, vertex); - Vector center = cavityCenter(); + Vector center = modelCenter(); + Vector target = center + (prevPosition - center)/4; const auto getQuality = [this](const Vector& pos) { return this->findWorstShape(pos); }; - Vector newPosition = goldenSearch(getQuality, prevPosition, center, 0.000001); + Vector newPosition = goldenSearch(getQuality, prevPosition, target, 0.000001); +} + +Vector RepositionVertex::modelCenter() +{ + Model* vertModel = mesh->toModel(vertex); + Vector avg(0,0,0); + for (int i=0; itoModel(adjEdges.e[i])) continue; + Entity* opp = getEdgeVertOppositeVert(mesh, adjEdges.e[i], vertex); + avg += getPosition(mesh, opp); + } + avg = avg / adjEdges.n; + return avg; +} + +double RepositionVertex::findShortestEdge(Vector position) +{ + double quality = findWorstShape(position); + if (quality < startingQuality && quality < adapt->input->goodQuality) return -1; + + double shortest = 1000; + for (int i=0; isizeField->measure(adjEdges.e[i]); + if (length < shortest) shortest = length; + } + return shortest; +} + +void RepositionVertex::moveToImproveShortEdges(Entity* vertex) +{ + int dim = mesh->getModelType(mesh->toModel(vertex)); + if (dim == 0) return; + init(vertex); + + mesh->getUp(vertex, adjEdges); + this->startingQuality = findWorstShape(prevPosition); + Vector center = modelCenter(); + const auto getLength = [this](const Vector& pos) { return this->findShortestEdge(pos); }; + goldenSearch(getLength, prevPosition, center, 0.000001); } void RepositionVertex::cancel(Entity* vertex) diff --git a/ma/maReposition.h b/ma/maReposition.h index 7c817b2dd..0ec2c801b 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -12,6 +12,7 @@ class RepositionVertex RepositionVertex(Adapt* a); bool move(Entity* vertex, Vector target); void moveToHighestQuality(Entity* vertex); + void moveToImproveShortEdges(Entity* vertex); void cancel(Entity* vertex); apf::Up& getInvalid(); @@ -22,13 +23,17 @@ class RepositionVertex Vector prevPosition; Upward adjacentElements; apf::Up invalid; + apf::Up adjEdges; double worstQuality; + double startingQuality; std::vector oldCache; void findInvalid(); void storeOldCache(); - Vector cavityCenter(); + Vector modelCenter(); + void init(Entity* vertex); double findWorstShape(Vector position); + double findShortestEdge(Vector position); }; bool repositionVertex(Mesh* m, Entity* v, From 59a9f4e902b2df312099af029221a7c8e5c9e07f Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 19 Dec 2025 18:24:01 -0500 Subject: [PATCH 309/319] reposition existing vertices --- ma/maFixShape.cc | 36 +++++++++++++----------------------- ma/maFixShape.h | 1 + ma/maQuality.cc | 9 +++++++++ ma/maReposition.cc | 27 ++++++++++++++++++--------- ma/maReposition.h | 3 ++- ma/maShape.h | 1 + 6 files changed, 44 insertions(+), 33 deletions(-) diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 0321ae788..2aa98a22d 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -27,33 +27,21 @@ namespace ma { -struct IsBadQuality : public Predicate -{ - IsBadQuality(Adapt* a_):a(a_) {} - bool operator()(Entity* e) - { - return a->shape->getQuality(e) < a->input->goodQuality; - } - Adapt* a; -}; - int markBadQualityNew(Adapt* a) -{ - IsBadQuality p(a); - return markEntities(a, a->mesh->getDimension(), p, BAD_QUALITY, OK_QUALITY); -} - -void unMarkBadQualityNew(Adapt* a) { Mesh* m = a->mesh; Iterator* it; Entity* e; it = m->begin(m->getDimension()); + int total = 0; while ((e = m->iterate(it))) { - if (getFlag(a, e, ma::BAD_QUALITY)) - clearFlag(a, e, ma::BAD_QUALITY); + if (getAndCacheQuality(a, e) < a->input->goodQuality){ + setFlag(a, e, ma::BAD_QUALITY); + total++; + } } m->end(it); + return total; } FixShape::FixShape(Adapt* adapt) : splitCollapse(adapt), doubleSplitCollapse(adapt), faceSplitCollapse(adapt), split(adapt), reposition(adapt) @@ -140,14 +128,13 @@ double FixShape::getWorstShape(EntityArray& tets, Entity*& worst) bool FixShape::splitReposition(Entity* edge) { - if (!isInModelRegion(mesh, edge)) return false; if (!split.setEdges(&edge, 1)) return false; double worstQuality = getWorstQuality(a,split.getTets()); split.makeNewElements(); split.transfer(); Entity* newVert = split.getSplitVert(0); - reposition.moveToHighestQuality(newVert); + reposition.moveToImproveQuality(newVert); EntityArray adjacent; mesh->getAdjacent(newVert, mesh->getDimension(), adjacent); @@ -203,6 +190,7 @@ bool FixShape::fixOneLargeAngle(Entity* tet) for (int i=0; i<3; i++) if (edges[i] != longestEdge && collapseEdge(edges[i])) {numCollapse++; return true;} + if (reposition.improveQuality(tet)) {numReposition++; return true;} return false; } @@ -277,6 +265,7 @@ bool FixShape::fixTwoLargeAngles(Entity* tet, Entity* problemEnts[4]) } } if (doubleSplitCollapse.run(problemEnts)) {numDoubleSplitCollapse++; return true;} + if (reposition.improveQuality(tet)) {numReposition++; return true;} return false; } @@ -304,6 +293,7 @@ bool FixShape::fixThreeLargeAngles(Entity* tet, Entity* problemEnts[4]) Entity* v = getTriVertOppositeEdge(a->mesh, problemEnts[2], problemEnts[1]); if (splitCollapse.run(problemEnts[1], v)) {numEdgeSplitCollapse++; return true;} if (faceSplitCollapse.run(problemEnts[0], tet)) {numFaceSplitCollapse++; return true;} + if (reposition.moveToImproveQuality(v)) {numReposition++; return true;} return false; } @@ -329,9 +319,9 @@ int FixShape::collect(int val) { } void FixShape::printNumOperations() { - print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n split reposition %9d\n double split collapse %d\n " + print(a->mesh->getPCU(), "shape operations: \n collapses %17d\n edge swaps %16d\n reposition %16d\n split reposition %9d\n double split collapse %d\n " "edge split collapses %5d\n face split collapses %3d\n region collapses %7d\n face swaps %12d\n ", - collect(numCollapse), collect(numEdgeSwap), collect(numSplitReposition), collect(numDoubleSplitCollapse), + collect(numCollapse), collect(numEdgeSwap), collect(numReposition), collect(numSplitReposition), collect(numDoubleSplitCollapse), collect(numEdgeSplitCollapse), collect(numFaceSplitCollapse), collect(numRegionCollapse), collect(numFaceSwap)); } void FixShape::printBadTypes() @@ -457,7 +447,7 @@ void fixElementShapesNew(Adapt* a) originalCount,count,t1-t0); fixShape.printNumOperations(); fixShape.printNumTypes(); - unMarkBadQualityNew(a); + clearFlagFromDimension(a, BAD_QUALITY, a->mesh->getDimension()); } } \ No newline at end of file diff --git a/ma/maFixShape.h b/ma/maFixShape.h index b26b5e988..1fbb8c1e1 100644 --- a/ma/maFixShape.h +++ b/ma/maFixShape.h @@ -32,6 +32,7 @@ class FixShape : public Operator int numCollapse=0; int numEdgeSwap=0; int numFaceSwap=0; + int numReposition=0; int numSplitReposition=0; int numRegionCollapse=0; int numEdgeSplitCollapse=0; diff --git a/ma/maQuality.cc b/ma/maQuality.cc index 4a6ca9a83..9ca8a8c87 100644 --- a/ma/maQuality.cc +++ b/ma/maQuality.cc @@ -190,6 +190,15 @@ double measureElementQuality(Mesh* m, SizeField* f, Entity* e, bool useMax) return table[m->getType(e)](m,f,e,useMax); } +double getAndCacheQuality(Adapt* a, Entity* e) +{ + if (a->mesh->hasTag(e, a->qualityCache)) + return getCachedQuality(a, e); + double quality = a->shape->getQuality(e); + setCachedQuality(a, e, quality); + return quality; +} + double getWorstQuality(Adapt* a, Entity** e, size_t n) { PCU_ALWAYS_ASSERT(n); diff --git a/ma/maReposition.cc b/ma/maReposition.cc index d115bae57..eb9b61fa6 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -82,36 +82,45 @@ double RepositionVertex::findWorstShape(Vector position) return worst; } -Vector goldenSearch(const std::function &f, Vector left, Vector right, double tol) +double goldenSearch(const std::function &f, Vector left, Vector right, double tol) { - Vector prev_mean = left; - Vector mean = left; const double M_GOLDEN_RATIO = (1.0 + std::sqrt(5.0)) / 2.0; + double leftValue; do { - prev_mean = mean; Vector delta_left = left + (right - left) * M_GOLDEN_RATIO; Vector delta_right = right + (left - right) * M_GOLDEN_RATIO; + leftValue = f(delta_left); - if (f(delta_left) < f(delta_right)) + if (leftValue < f(delta_right)) right = delta_right; else left = delta_left; - mean = (left + right) / 2.f; } while ((left-right).getLength() > tol); - return prev_mean; + return leftValue; } -void RepositionVertex::moveToHighestQuality(Entity* vertex) +bool RepositionVertex::moveToImproveQuality(Entity* vertex) { + if (mesh->getModelType(mesh->toModel(vertex)) != 3) return false; //TODO: remove limitation init(vertex); mesh->getUp(vertex, adjEdges); Vector center = modelCenter(); Vector target = center + (prevPosition - center)/4; const auto getQuality = [this](const Vector& pos) { return this->findWorstShape(pos); }; - Vector newPosition = goldenSearch(getQuality, prevPosition, target, 0.000001); + worstQuality = goldenSearch(getQuality, prevPosition, target, 0.000001); + return worstQuality > adapt->input->goodQuality; +} + +bool RepositionVertex::improveQuality(Entity* tet) +{ + Entity* verts[4]; + mesh->getDownward(tet, 0, verts); + for (int i=0; i<4; i++) + if (moveToImproveQuality(verts[i])) return true; + return false; } Vector RepositionVertex::modelCenter() diff --git a/ma/maReposition.h b/ma/maReposition.h index 0ec2c801b..1aac6f4c0 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -11,8 +11,9 @@ class RepositionVertex public: RepositionVertex(Adapt* a); bool move(Entity* vertex, Vector target); - void moveToHighestQuality(Entity* vertex); + bool moveToImproveQuality(Entity* vertex); void moveToImproveShortEdges(Entity* vertex); + bool improveQuality(Entity* tet); void cancel(Entity* vertex); apf::Up& getInvalid(); diff --git a/ma/maShape.h b/ma/maShape.h index 30a502a19..db3df76af 100644 --- a/ma/maShape.h +++ b/ma/maShape.h @@ -34,6 +34,7 @@ double measureQuadraticTetQuality(Mesh* m, Entity* tet); double getWorstQuality(Adapt* a, EntityArray& e); double getWorstQuality(Adapt* a, Entity** e, size_t n); +double getAndCacheQuality(Adapt* a, Entity* e); /* has worse quality than qualityToBeat */ From 29741419d96dffbadb3807a307031b8ed9eaf420 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 20 Dec 2025 15:33:40 -0500 Subject: [PATCH 310/319] clamp sizefield --- ma/maSize.cc | 33 +++++++++++++++++++++++++-------- 1 file changed, 25 insertions(+), 8 deletions(-) diff --git a/ma/maSize.cc b/ma/maSize.cc index eb6543446..137df13dd 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -514,12 +514,6 @@ struct LogAnisoSizeField : public MetricSizeField { apf::destroyField(logMField); } - void clampComponents(Vector& v, double max) - { - if (v[0] > max) v[0] = max; - if (v[1] > max) v[1] = max; - if (v[2] > max) v[2] = max; - } void init(Mesh* m, apf::Field* sizes, apf::Field* frames) { mesh = m; @@ -541,7 +535,6 @@ struct LogAnisoSizeField : public MetricSizeField Matrix f; apf::getVector(sizes, ent, i, h); apf::getMatrix(frames, ent, i, f); - // clampComponents(h, 5); Vector s(log(1/h[0]/h[0]), log(1/h[1]/h[1]), log(1/h[2]/h[2])); Matrix S(s[0], 0 , 0, 0 , s[1], 0, @@ -666,10 +659,34 @@ struct IsoUserField : public IsoSizeField FieldReader reader; }; +static void clampSizeField(Mesh*m, apf::Field* sizes) +{ + Vector lower; + Vector upper; + getBoundingBox(m, lower, upper); + Entity* ent; + Iterator* it; + for (int d = 0; d <= m->getDimension(); d++) { + it = m->begin(d); + while( (ent = m->iterate(it)) ){ + int type = m->getType(ent); + int non = sizes->getShape()->countNodesOn(type); + for (int i = 0; i < non; i++) { + Vector h; + apf::getVector(sizes, ent, i, h); + if (h[0] > upper[0]) h[0] = upper[0]; + if (h[1] > upper[1]) h[1] = upper[1]; + if (h[2] > upper[2]) h[2] = upper[2]; + apf::setVector(sizes, ent, i, h); + } + } + } +} + SizeField* makeSizeField(Mesh* m, apf::Field* sizes, apf::Field* frames, bool logInterpolation) { - // logInterpolation is "false" by default + clampSizeField(m, sizes); if (! logInterpolation) { AnisoSizeField* anisoF = new AnisoSizeField(); anisoF->init(m, sizes, frames); From 2e99dfb4e5e08f4ec4ec01bb2f3b2d40ba7627c1 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 20 Dec 2025 16:07:31 -0500 Subject: [PATCH 311/319] universal size cache --- ma/maAdapt.cc | 38 +++++++++++++++++++++++++++++++------- ma/maAdapt.h | 7 +++++-- ma/maCoarsen.cc | 25 ++++--------------------- ma/maSize.cc | 10 ++++++++++ ma/maSize.h | 2 ++ 5 files changed, 52 insertions(+), 30 deletions(-) diff --git a/ma/maAdapt.cc b/ma/maAdapt.cc index bff23cf90..adcbc407b 100644 --- a/ma/maAdapt.cc +++ b/ma/maAdapt.cc @@ -29,7 +29,7 @@ Adapt::Adapt(Input* in) input = in; mesh = in->mesh; setupFlags(this); - setupQualityCache(this); + setupCache(this); deleteCallback = 0; buildCallback = 0; sizeField = in->sizeField; @@ -52,7 +52,7 @@ Adapt::Adapt(Input* in) Adapt::~Adapt() { clearFlags(this); - clearQualityCache(this); + clearCache(this); delete refine; delete shape; } @@ -147,25 +147,49 @@ void clearFlagFromDimension(Adapt* a, int flag, int dimension) m->end(it); } -void setupQualityCache(Adapt* a) +void setupCache(Adapt* a) { a->qualityCache = a->mesh->createDoubleTag("ma_qual_cache",1); + a->sizeCache = a->mesh->createDoubleTag("ma_size_cache",1); } -void clearQualityCache(Adapt* a) +void clearCache(Adapt* a) { Mesh* m = a->mesh; Entity* e; - // only faces and regions can have the quality tag - for (int d=2; d <= 3; ++d) + for (int d=1; d <= 3; ++d) { Iterator* it = m->begin(d); - while ((e = m->iterate(it))) + while ((e = m->iterate(it))) { if (m->hasTag(e,a->qualityCache)) m->removeTag(e,a->qualityCache); + if (m->hasTag(e,a->sizeCache)) + m->removeTag(e,a->sizeCache); + } m->end(it); } m->destroyTag(a->qualityCache); + m->destroyTag(a->sizeCache); +} + +double getCachedSize(Adapt* a, Entity* e) +{ + int type = a->mesh->getType(e); + int ed = apf::Mesh::typeDimension[type]; + PCU_ALWAYS_ASSERT(ed != 0); + if (!a->mesh->hasTag(e,a->sizeCache)) + return 0.0; //we assume 0.0 is the default value for all qualities + double size; + a->mesh->getDoubleTag(e,a->sizeCache,&size); + return size; +} + +void setCachedSize(Adapt* a, Entity* e, double size) +{ + int type = a->mesh->getType(e); + int ed = apf::Mesh::typeDimension[type]; + PCU_ALWAYS_ASSERT(ed != 0); + a->mesh->setDoubleTag(e,a->sizeCache,&size); } double getCachedQuality(Adapt* a, Entity* e) diff --git a/ma/maAdapt.h b/ma/maAdapt.h index 0b7a0324d..a1a8d77d3 100644 --- a/ma/maAdapt.h +++ b/ma/maAdapt.h @@ -50,6 +50,7 @@ class Adapt Mesh* mesh; Tag* flagsTag; Tag* qualityCache; // to avoid repeated quality computations + Tag* sizeCache; // to avoid repeated size computations DeleteCallback* deleteCallback; apf::BuildCallback* buildCallback; SizeField* sizeField; @@ -76,8 +77,10 @@ void clearFlagMatched(Adapt* a, Entity* e, int flag); void clearFlagFromDimension(Adapt* a, int flag, int dimension); -void setupQualityCache(Adapt* a); -void clearQualityCache(Adapt* a); +void setupCache(Adapt* a); +void clearCache(Adapt* a); +double getCachedSize(Adapt* a, Entity* e); +void setCachedSize(Adapt* a, Entity* e, double size); double getCachedQuality(Adapt* a, Entity* e); void setCachedQuality(Adapt* a, Entity* e, double q); diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 6fbc4aa08..27abab743 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -43,19 +43,6 @@ namespace ma { namespace { -//Measures edge length and stores the result so it doesn't have to be calculated again -double getLength(Adapt* a, Tag* lengthTag, Entity* edge) -{ - double length = 0; - if (a->mesh->hasTag(edge, lengthTag)) - a->mesh->getDoubleTag(edge, lengthTag, &length); - else { - length = a->sizeField->measure(edge); - a->mesh->setDoubleTag(edge, lengthTag, &length); - } - return length; -} - //Make sure that a collapse will not create an edge longer than the max bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent) { @@ -330,15 +317,14 @@ bool coarsen(Adapt* a) } //returns a list of vertices that bound a short edge -std::list getShortEdgeVerts(Adapt* a, Tag* lengthTag) +std::list getShortEdgeVerts(Adapt* a) { std::list shortEdgeVerts; Iterator* it = a->mesh->begin(1); Entity* edge; while ((edge = a->mesh->iterate(it))) { - double length = getLength(a, lengthTag, edge); - if (length > MINLENGTH) continue; + if (getAndCacheSize(a, edge) > MINLENGTH) continue; Entity* vertices[2]; a->mesh->getDownward(edge,0,vertices); for (int i = 0; i < 2; i++) { @@ -357,7 +343,6 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback public: Adapt* a; Entity* vertex; - Tag* lengthTag; Collapse collapse; std::list shortEdgeVerts; @@ -367,14 +352,12 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback { a = adapt; collapse.Init(a); - lengthTag = a->mesh->createDoubleTag("edge_length", 1); - shortEdgeVerts = getShortEdgeVerts(a, lengthTag); + shortEdgeVerts = getShortEdgeVerts(a); } ~CollapseAll() { ma::clearFlagFromDimension(a, CHECKED, 0); - a->mesh->destroyTag(lengthTag); } int getTargetDimension() { return 0; } @@ -420,7 +403,7 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback std::vector sorted; for (int i=0; i < adjacent.n; i++) { - double length = getLength(a, lengthTag, adjacent.e[i]); + double length = getAndCacheSize(a, adjacent.e[i]); EdgeLength measured{adjacent.e[i], length}; if (measured.length > MINLENGTH) continue; sorted.push_back(measured); diff --git a/ma/maSize.cc b/ma/maSize.cc index 137df13dd..106fa858e 100644 --- a/ma/maSize.cc +++ b/ma/maSize.cc @@ -14,6 +14,7 @@ #include #include #include "apfVectorElement.h" +#include "maAdapt.h" namespace ma { @@ -719,6 +720,15 @@ SizeField* makeSizeField(Mesh* m, apf::Field* size) return new IsoUserField(m, size); } +double getAndCacheSize(Adapt* a, Entity* e) +{ + if (a->mesh->hasTag(e, a->sizeCache)) + return getCachedSize(a, e); + double size = a->sizeField->measure(e); + setCachedSize(a, e, size); + return size; +} + double getAverageEdgeLength(Mesh* m) { IdentitySizeField sizeField(m); diff --git a/ma/maSize.h b/ma/maSize.h index c32fd8088..f3e4ebfc4 100644 --- a/ma/maSize.h +++ b/ma/maSize.h @@ -18,6 +18,7 @@ namespace ma { +class Adapt; typedef apf::Matrix3x3 Matrix; /* Desired length bounds in metric space to replace hard coded values. Right now these values are const, since we are not sure it is worth while to have the user, @@ -114,6 +115,7 @@ SizeField* makeSizeField(Mesh* m, AnisotropicFunction* f, SizeField* makeSizeField(Mesh* m, apf::Field* size); SizeField* makeSizeField(Mesh* m, IsotropicFunction* f); +double getAndCacheSize(Adapt* a, Entity* e); double getAverageEdgeLength(Mesh* m); double getMaximumEdgeLength(Mesh* m, SizeField* sf = 0); From d0289ffea9eb901926adecb876171f8aba0541f6 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 20 Dec 2025 16:45:49 -0500 Subject: [PATCH 312/319] cache edge lengths fix shape --- ma/maCoarsen.cc | 40 ---------------------------------------- ma/maFixShape.cc | 28 +++++++--------------------- ma/maReposition.cc | 10 +++++++--- 3 files changed, 14 insertions(+), 64 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 27abab743..4c36b4d36 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -41,44 +41,6 @@ This file contains two coarsening alogrithms. namespace ma { -namespace { - -//Make sure that a collapse will not create an edge longer than the max -bool collapseSizeCheck(Adapt* a, Entity* vertex, Entity* edge, apf::Up& adjacent) -{ - Entity* vCollapse = getEdgeVertOppositeVert(a->mesh, edge, vertex); - for (int i=0; imesh, adjacent.e[i], vCollapse)}; - Entity* newEdge = a->mesh->createEntity(apf::Mesh::EDGE, 0, newEdgeVerts); - double length = a->sizeField->measure(newEdge); - destroyElement(a, newEdge); - if (length > MAXLENGTH) return false; - } - return true; -} - -bool tryCollapseEdge(Adapt* a, Entity* edge, Entity* keep, Collapse& collapse, apf::Up& adjacent) -{ - PCU_ALWAYS_ASSERT(a->mesh->getType(edge) == apf::Mesh::EDGE); - bool alreadyFlagged = true; - if (keep) alreadyFlagged = getFlag(a, keep, DONT_COLLAPSE); - if (!alreadyFlagged) setFlag(a, keep, DONT_COLLAPSE); - - double quality = a->input->shouldForceAdaptation ? a->input->validQuality - : a->input->goodQuality; - - bool result = false; - if (collapse.setEdge(edge) && - collapse.checkClass() && - collapse.checkTopo() && - collapse.tryBothDirections(quality)) { - result = true; - } - if (!alreadyFlagged) clearFlag(a, keep, DONT_COLLAPSE); - return result; -} -} - class CollapseChecker : public apf::CavityOp { public: @@ -410,8 +372,6 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback } std::sort(sorted.begin(), sorted.end()); for (size_t i=0; i < sorted.size(); i++) { - // Entity* opposite = getEdgeVertOppositeVert(a->mesh, sorted[i].edge, vertex); - // if (!tryCollapseEdge(a, sorted[i].edge, opposite, collapse, adjacent)) continue; if (!collapse.run(sorted[i].edge, vertex, qualityToBeat)) continue; flagIndependentSet(adjacent); collapse.destroyOldElements(); diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 2aa98a22d..3ed1d97db 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -34,12 +34,11 @@ int markBadQualityNew(Adapt* a) Entity* e; it = m->begin(m->getDimension()); int total = 0; - while ((e = m->iterate(it))) { + while ((e = m->iterate(it))) if (getAndCacheQuality(a, e) < a->input->goodQuality){ setFlag(a, e, ma::BAD_QUALITY); total++; } - } m->end(it); return total; } @@ -103,29 +102,16 @@ bool FixShape::fixShortEdge(Entity* tet) Entity* edges[6]; a->mesh->getDownward(tet, 1, edges); for (int i=0; i<6; i++) - if (a->sizeField->measure(edges[i]) < MINLENGTH) + if (getAndCacheSize(a, edges[i]) < MINLENGTH) if (collapseEdge(edges[i])) { numCollapse++; return true; } for (int i=0; i<6; i++) - if (a->sizeField->measure(edges[i]) < MINLENGTH) + if (getAndCacheSize(a, edges[i]) < MINLENGTH) if (collapseToAdjacent(edges[i])) { numCollapse++; return true; } return false; } -double FixShape::getWorstShape(EntityArray& tets, Entity*& worst) -{ - double worstQuality = 1; - for (int i=0; ishape->getQuality(tets[i]); - if (quality < worstQuality) { - worstQuality = quality; - worst = tets[i]; - } - } - return worstQuality; -} - bool FixShape::splitReposition(Entity* edge) { if (!split.setEdges(&edge, 1)) @@ -164,10 +150,10 @@ bool FixShape::isOneLargeAngle(Entity* tet, Entity*& worstTriangle) Entity* FixShape::getLongestEdge(Entity* edges[3]) { - double longestLength = a->sizeField->measure(edges[0]); + double longestLength = 0; Entity* longestEdge = edges[0]; - for (int i=1; i<3; i++) { - double length = a->sizeField->measure(edges[i]); + for (int i=0; i<3; i++) { + double length = getAndCacheSize(a, edges[i]); if (length > longestLength) { longestLength = length; longestEdge = edges[i]; @@ -338,7 +324,7 @@ bool FixShape::isShortEdge(Entity* tet) a->mesh->getDownward(tet, 1, edges); int numShortEdges=0; for (int i=0; i<6; i++) - if (a->sizeField->measure(edges[i]) < MINLENGTH) + if (getAndCacheSize(a, edges[i]) < MINLENGTH) numShortEdges++; if (numShortEdges==0) return false; diff --git a/ma/maReposition.cc b/ma/maReposition.cc index eb9b61fa6..aac600954 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -27,6 +27,7 @@ void RepositionVertex::init(Entity* vertex) this->vertex = vertex; this->prevPosition = getPosition(mesh, vertex); mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + mesh->getUp(vertex, adjEdges); storeOldCache(); } @@ -40,6 +41,11 @@ void RepositionVertex::storeOldCache() } else oldCache.push_back(-1); } + + for (size_t i = 0; i < adjEdges.n; ++i) { + if (mesh->hasTag(adjEdges.e[i], adapt->sizeCache)) + mesh->removeTag(adjEdges.e[i], adapt->sizeCache); + } } void RepositionVertex::findInvalid() @@ -105,7 +111,6 @@ bool RepositionVertex::moveToImproveQuality(Entity* vertex) { if (mesh->getModelType(mesh->toModel(vertex)) != 3) return false; //TODO: remove limitation init(vertex); - mesh->getUp(vertex, adjEdges); Vector center = modelCenter(); Vector target = center + (prevPosition - center)/4; @@ -154,8 +159,7 @@ void RepositionVertex::moveToImproveShortEdges(Entity* vertex) int dim = mesh->getModelType(mesh->toModel(vertex)); if (dim == 0) return; init(vertex); - - mesh->getUp(vertex, adjEdges); + this->startingQuality = findWorstShape(prevPosition); Vector center = modelCenter(); const auto getLength = [this](const Vector& pos) { return this->findShortestEdge(pos); }; From 5a66078fadffd95a6a9c9965801d4f75b8f9a3a1 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sat, 20 Dec 2025 18:08:37 -0500 Subject: [PATCH 313/319] cache all quality --- ma/maFixShape.cc | 8 ++++---- ma/maReposition.cc | 21 +++++++++------------ ma/maReposition.h | 3 +-- 3 files changed, 14 insertions(+), 18 deletions(-) diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 3ed1d97db..616af03b5 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -136,10 +136,10 @@ bool FixShape::isOneLargeAngle(Entity* tet, Entity*& worstTriangle) { Entity* triangles[4]; a->mesh->getDownward(tet, 2, triangles); - double worstQuality = a->shape->getQuality(triangles[0]); + double worstQuality = 1; worstTriangle = triangles[0]; - for (int i=1; i<4; i++) { - double quality = a->shape->getQuality(triangles[i]); + for (int i=0; i<4; i++) { + double quality = getAndCacheQuality(a, triangles[i]); if (quality < worstQuality) { worstQuality = quality; worstTriangle = triangles[i]; @@ -382,7 +382,7 @@ void FixShape::printNumTypes() Entity* worstShape; while ((tet = a->mesh->iterate(it))) { if (!getFlag(a, tet, BAD_QUALITY)) continue; - double qual = a->shape->getQuality(tet); + double qual = getAndCacheQuality(a, tet); if (qual < worstQual) { worstQual = qual; worstShape = tet; diff --git a/ma/maReposition.cc b/ma/maReposition.cc index aac600954..8e6c9a47d 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -28,23 +28,20 @@ void RepositionVertex::init(Entity* vertex) this->prevPosition = getPosition(mesh, vertex); mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); mesh->getUp(vertex, adjEdges); - storeOldCache(); + clearAdjCache(); } -void RepositionVertex::storeOldCache() +void RepositionVertex::clearAdjCache() { - oldCache.clear(); - for (size_t i = 0; i < adjacentElements.getSize(); ++i) { - if (mesh->hasTag(adjacentElements[i], adapt->qualityCache)) { - oldCache.push_back(getCachedQuality(adapt, adjacentElements[i])); + for (size_t i = 0; i < adjacentElements.getSize(); ++i) mesh->removeTag(adjacentElements[i], adapt->qualityCache); - } - else oldCache.push_back(-1); - } - - for (size_t i = 0; i < adjEdges.n; ++i) { - if (mesh->hasTag(adjEdges.e[i], adapt->sizeCache)) + for (size_t i = 0; i < adjEdges.n; ++i) mesh->removeTag(adjEdges.e[i], adapt->sizeCache); + apf::Adjacent adjTri; + mesh->getAdjacent(vertex, 2, adjTri); + for (size_t i = 0; i < adjTri.getSize(); ++i) { + mesh->removeTag(adjTri[i], adapt->qualityCache); + mesh->removeTag(adjTri[i], adapt->sizeCache); } } diff --git a/ma/maReposition.h b/ma/maReposition.h index 1aac6f4c0..6a335c88b 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -27,10 +27,9 @@ class RepositionVertex apf::Up adjEdges; double worstQuality; double startingQuality; - std::vector oldCache; void findInvalid(); - void storeOldCache(); + void clearAdjCache(); Vector modelCenter(); void init(Entity* vertex); double findWorstShape(Vector position); From be49cddb26dae7bb46d0ecd5aed6a5965864c415 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Sun, 21 Dec 2025 00:57:20 -0500 Subject: [PATCH 314/319] simplify --- ma/maCollapse.cc | 10 +++------- 1 file changed, 3 insertions(+), 7 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 9c0b11f82..036753a0b 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -74,12 +74,9 @@ bool Collapse::isValid() Vector prev = getPosition(adapt->mesh, vertToCollapse); Vector target = getPosition(adapt->mesh, vertToKeep); adapt->mesh->setPoint(vertToCollapse, 0, target); - EntityArray elements; - elements.setSize(elementsToKeep.size()); - int i=0; + bool valid = true; for (Entity* e : elementsToKeep) - elements[i++] = e; - bool valid = areTetsValid(adapt->mesh, elements); + if (!isTetValid(adapt->mesh, e)) {valid = false; break;} adapt->mesh->setPoint(vertToCollapse, 0, prev); return valid; } @@ -91,8 +88,7 @@ bool Collapse::anyWorseQuality(double qualityToBeat) adapt->mesh->setPoint(vertToCollapse, 0, target); bool worse = false; for (Entity* e : elementsToKeep) - if (adapt->shape->getQuality(e) < qualityToBeat) - {worse = true; break;} + if (adapt->shape->getQuality(e) < qualityToBeat) {worse = true; break;} adapt->mesh->setPoint(vertToCollapse, 0, prev); return worse; } From 512dcb78e686ded6446a3158f7f35ffb139c2f23 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Mon, 22 Dec 2025 13:55:01 -0500 Subject: [PATCH 315/319] reposition and min quality --- ma/maCoarsen.cc | 3 ++- ma/maReposition.cc | 11 +++++++++-- 2 files changed, 11 insertions(+), 3 deletions(-) diff --git a/ma/maCoarsen.cc b/ma/maCoarsen.cc index 4c36b4d36..e7b99f3a7 100644 --- a/ma/maCoarsen.cc +++ b/ma/maCoarsen.cc @@ -40,6 +40,7 @@ This file contains two coarsening alogrithms. #include "maShapeHandler.h" namespace ma { +const double MINIMUM_QUALITY = std::pow(.1, 3); class CollapseChecker : public apf::CavityOp { @@ -360,7 +361,7 @@ class CollapseAll : public apf::CavityOp, public DeleteCallback */ bool collapseShortest(Entity* vertex, apf::Up& adjacent) { - double qualityToBeat = a->input->shouldForceAdaptation ? a->input->validQuality + double qualityToBeat = a->input->shouldForceAdaptation ? MINIMUM_QUALITY : a->input->goodQuality; std::vector sorted; diff --git a/ma/maReposition.cc b/ma/maReposition.cc index 8e6c9a47d..9d6bc2d28 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -76,7 +76,14 @@ bool RepositionVertex::move(Entity* vertex, Vector target) double RepositionVertex::findWorstShape(Vector position) { - mesh->setPoint(vertex, 0, position); + Model* gm = mesh->toModel(vertex); + if (mesh->getModelType(gm) < 3) { + Vector p; + mesh->getParamOn(gm,vertex,p); + mesh->snapToModel(gm,p,position); + mesh->setPoint(vertex,0,position); + } + else mesh->setPoint(vertex, 0, position); double worst = 1; for (size_t i = 0; i < adjacentElements.getSize(); ++i) { double quality = adapt->shape->getQuality(adjacentElements[i]); @@ -106,7 +113,7 @@ double goldenSearch(const std::function &f, Vector left, Vector bool RepositionVertex::moveToImproveQuality(Entity* vertex) { - if (mesh->getModelType(mesh->toModel(vertex)) != 3) return false; //TODO: remove limitation + if (mesh->getModelType(mesh->toModel(vertex)) < 2) return false; //TODO: remove limitation init(vertex); Vector center = modelCenter(); From ac66f6a509b3a67aa53d2ed3c68c51b1a5a31c0d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Thu, 8 Jan 2026 15:24:07 -0500 Subject: [PATCH 316/319] added algorithms --- ma/adapt_algorithms.tex | 128 ++++++++++++++++++++++++++++++++++++++++ ma/adapt_tet_types.png | Bin 0 -> 269385 bytes ma/maCollapse.cc | 55 +++++++++-------- ma/maCollapse.h | 1 + 4 files changed, 158 insertions(+), 26 deletions(-) create mode 100644 ma/adapt_algorithms.tex create mode 100644 ma/adapt_tet_types.png diff --git a/ma/adapt_algorithms.tex b/ma/adapt_algorithms.tex new file mode 100644 index 000000000..61534ea15 --- /dev/null +++ b/ma/adapt_algorithms.tex @@ -0,0 +1,128 @@ +\documentclass{article} +\usepackage{graphicx} % Required for inserting images +\usepackage{algorithm} +\usepackage{algpseudocode} +\usepackage{float} % For [H] placement +\usepackage[a4paper, margin=0.5in]{geometry} +\usepackage[font=scriptsize,labelfont=bf]{caption} +\usepackage{caption} +\captionsetup[figure]{justification=centering, font=small} + +\title{Mesh Adapt Pseudo Code} +\author{} +\date{} + +\begin{document} + +\maketitle + +\section{Algorithms} + + +\begin{algorithm} +\caption{Adapt Top Level} +\begin{algorithmic}[1] + \State $numIterations$ = number of splits necessary to reduce the longest edge to the desired edge length + \For{\textbf{each} $numIterations$} + \State collapse all edges below desired length if possible + \State split all edges above desired edge length + \State snap all new vertices to model boundary + \EndFor + + \State for each shape below minimum quality, attempt operations to collapse shape or improve quality + +\end{algorithmic} +\end{algorithm} + + +\begin{algorithm} +\caption{Coarsen} +\begin{algorithmic}[1] + \For {every edge} + \State if the edge length is less than the desired edge length, then add both vertices to a list + \EndFor + + \While {there are unchecked vertices in list} + \State flag vertex as checked + \State attempt to collapse adjacent edges with current vertex removed, starting with the shortest edge until one succeeds + \State if an edge collapse succeeds, then remove flag from adjacent vertices so they are processed again + \EndWhile + +\end{algorithmic} +\end{algorithm} + + +\begin{figure}[H] + \centering + \includegraphics[width=0.7\linewidth]{adapt_tet_types.png} + \caption{Types of low quality tetrahedron\\ + Reproduced from Wan, J., "An automated adaptive procedure for 3D metal forming simulations", Ph.D. Thesis, Rensselaer Polytechnic Institute, Troy, NY 12180 (2006)} + \label{fig:tetTypes} +\end{figure} + + +\begin{algorithm} +\caption{Snapping} +\begin{algorithmic}[1] + \While {there are any vertices are not on model boundary} + \State reposition the vertex to the model boundary, if no adjacent element is inverted then we are done + \State otherwise use inverted adjacent elements to calculate the first problem plane (FPP) + \State now we will attempt different operations to move the vertex towards the FPP until one succeeds starting with operations that are more likely to succeed + \State attempt collapsing edges shared by inverted elements that will move the vertex to the FPP + \State attempt to collapse edges on the FPP so FPP disappears + \State attempt to collapse edges shared by inverted elements to simplify the FPP + \State evaluate collapsing any edge that will move vertex towards the FPP and select the collapse that results in the highest quality elements + \State we will determine which of the problem entities in Figure 1 is preventing movement to FPP, using the method described section 6.4.2.2 of Li's Thesis + \If {\textbf{one large dihedral angle}} + \State attempt swapping the longest edge + \State attempt split-collapse on the longest edge + \EndIf + \If {\textbf{two large dihedral angles}} + \State attempt swapping either problem edge + \State attempt split-collapse on either problem edge + \State attempt double-split-collapse on both problem edges + \ElsIf {\textbf{three large dihedral angles}} + \State attempt swapping any edge in problem face + \State attempt swapping the problem face + \State attempt split-collapsing towards the FPP + \EndIf + \EndWhile + +\end{algorithmic} +\end{algorithm} + + +\begin{algorithm} +\caption{Fix Element Shapes} +\begin{algorithmic}[1] +\While {the number of low quality entities decreases} + \State we will attempt different operations and check if they increase quality + \State attempt to collapse any short edges in entity + \State we will determine which of the low quality entities in Figure 1 matches the current entity, using the method described section 6.4.2.2 of Li's Thesis + \If {\textbf{one large dihedral angle}} + \State attempt region-collapse if the tetrahedron is on the surface + \State attempt edge-swap on the longest edge in the low quality triangle + \State attempt split-collapse on the longest edge in the low quality triangle + \State attempt edge-collapse on any edge in the low quality triangle besides the longest edge + \State reposition vertices to improve quality + \EndIf + \If {\textbf{two large dihedral angles}} + \State attempt region-collapse if the tetrahedron is on the surface + \State attempt edge-swap on $M^{1}_{j_0}$ or $M^{1}_{j_1}$ + \State attempt split-collapse on $M^{1}_{j_0}$ or $M^{1}_{j_1}$ + \State attempt double-split-collapse on $M^{1}_{j_0}$ and $M^{1}_{j_1}$ + \State reposition vertices to improve quality + \ElsIf {\textbf{three large dihedral angles}} + \State attempt edge-collapse on $M^{1}_{j_0}$, $M^{1}_{j_1}$, or $M^{1}_{j_2}$ with $M^{0}_{i_3}$ deleted + \State attempt edge-swap on any edge bounding triangle made by $M^{0}_{i_0}$, $M^{0}_{i_1}$, and $M^{0}_{i_2}$ + \State attempt face-swap on the triangle made by $M^{0}_{i_0}$, $M^{0}_{i_1}$, $M^{0}_{i_2}$ + \State attempt split-collapse on the triangle made by $M^{0}_{i_0}$, $M^{0}_{i_1}$, $M^{0}_{i_2}$ with $M^{0}_{i_3}$ deleted + \State attempt face-split-collapse on the triangle made by $M^{0}_{i_0}$, $M^{0}_{i_1}$, $M^{0}_{i_2}$ with $M^{0}_{i_3}$ deleted + \State reposition vertex $M^{0}_{i_3}$ to improve quality + \EndIf +\EndWhile + +\end{algorithmic} +\end{algorithm} + +\end{document} diff --git a/ma/adapt_tet_types.png b/ma/adapt_tet_types.png new file mode 100644 index 0000000000000000000000000000000000000000..4856009c65acc4cb7d4426ca6e7a0b16ce60e546 GIT binary patch literal 269385 zcmeGFXH=C}*98n8V~n>NHBr%EBN0%FfQo>kfDIH7>AhJG(vhOlH3p4XP^1WmfPi$6 zCLN4Qks=*LstQOIP*D2$<~qc@&-i}7KVQelxNj5ST-V-fuQk`4b8W7x96P*p@!G`< z24kuGkwa<>#=>C+_ABjYFp|BNOrKbQ zzb~>mqHD)sEPFx!%qzBzKFwgTBIOV5*SKgj(CYZ0!hyva`8Y6@AGp0px+s6;ip77V ztWwMBQ%K?YwaJ!$P>o+GTW=M|-H7Z1P2XINi(elvD&Ho`G=4ojJKpQEXNdFBR?!dV z3R<&U^NlJS_q*m;ZTRTeHsocvfB*i=`26pGo(Y|?UiSSj_}^z0hc7SxfBwF2`@aA0 zum3H_|Ld#4=ev0EVxN$Zq}nLu{IV+|xpnmod`-Fk z58t1nWySdgJJ&ESsXY!2-M2=>sLr}z=5e0$w^-BK$Jrll@97*IOc))tPcX<*lbIgA zve9{9yO>$sk=L(Zr=+Hex>IDb|6B_4{DF(1(#Nx9OMib-LBl^+7LFyk&nPZkC%#iV z&8%Kv>2KTisYe~tys=t{Z)D!T-}OwWm}3$j&bwvHVLV~2H?Lw{wu5_06EtH$w>+(JT11+$ZJ4N1mHi#Y`N`1nc;l2!9v z9A)L?`fiBiR~6k_=j-oplKB1m7%e;5-*~F>p_E>MTb@~CV#3v>>q?uNnhf|m156&? zEhs3!qeMM;uwL}PPs=oAKjr}=qle-aZ$i7u`~`V<4uyq?;vD|_`y-aGBWkdf}z)pm6D z*?&47hdx`#@L3!a6QgkSs1J{$vvV2#81SpPx#f@5&D`ZaOwTd*=b6w!978@1VS~(2 zgo>iKfuUhnU!PgxDt;{C?c2A#Bkte-EwO6hzhBSDxM?^~X#vAWVPaz9ZK{daQ>#`p zIgd2+#$zW=oJh$iaA@zByzuFPpRi$UdHGRMZ=S5o%;<9;iel9wJvrsQXTKG&Oy4{? zA!*-p=b`(oW8UXd!G^dImO`Y0ul;C`YJIfo!5|51zo4L?tp5Vj=7nm<{C)hsK|yi6 zihgH5wPYzMDAc^Vx5c5et_rm4xZSJj*XxGrw z3*?D0$g=hH^i(^3JhY{?wX45BZljb_&+R>*wiye{PY$G3j&|NtR`A9yM`;^578+#5 z%Pe-0S5Q{=&&kR8zmL(H9qz}tw5}BEzCqHysxC%->}#`izYJ@_>r>8<^u*LuP#o4= z!^$dgcfKjD!E%}DD!sPDa&l%b|NhnKONGQ(oAXfbmF3b^ov-eR=(o-PzOFt$A)-`D z9WP#tw(Tm-9?G8@#e>Bf=A8dLI-1rbudJ+%?W-7I?!Gu2`uJ$TqlgHe{(*MF+>xm69`7dx(ys>D{ET7|9$NK8ky*5g%;^Z{F7y0JnWObd-s-)34R_KQMIvovO9mXLw|#Bo)pXU$L|lC@srR3MvL5o z2M;tJALT@FHJ9J>_O_bjnB2X4cc8dsAhRMc^2Qnwy^qVKM(;d-@#2h$iAgF;yVOr8 zuBYd$yqb|wn?WaO9bw=d%R-hO3Q8`{ii*^k-hTZ$HKn z`1eo7&+G?QQ&&%SojPAwT-;nPf#c`nvnr_R7M&i~>5*bd$IlTJxfG`=Vb9wIs`GMl zSN-zK@A9Q3B`R`qSF_Y2=#|Q5u{VZaUb%n&*_Zme-mY80*mvDwa?~_f#=UL5ptQ6R za%bAZLj`y7tYVgLcM9pIL{!DFz796y81`HH_DD-hFJ89HPgrV2Xmmm4qX$yXT8@s6 z-VqAE0y7CB|1Ac?V0qdqhRwRBJm-vK4|avE6*JQ*`y^wKY4eZX>2^LOo5`MVue38| zt2Gl1bRRx^DDF5jIo8$Ld0I3_Pgq#ktS$>^ACz1+%fa)K_o}(H86Y zr5i!1fv;6EN;lKoEh+i7JW)1S(!u^?@CCEt+Z*2IyXJ7N>75!X&^9xRMSyM5*4F<2 zON1Tb=RURUrVV!Jt5Zd8UJ~q9P`zdN+dxyevdoNzs;a74Yj!%G7w6u*!ujh!%$+-T z-0eN`kOC1k;hr3VWyYuWF7Z;aIX|C@p+My{?+sz#RWnTg5C(!#<*<`!}BuU8*DGtP5Lr&Jt+(r(uLGyw(N;r+`+ zXU?3_z3}#_W!&F?|Ltz?I?FXMILN`t8FS*rReqEzQD%A7r`DVVck8HQ!8Kb#Tpl43 zVw6Lq&8i=HAhYgv{qHHPvfSHz7!1!mQIpqv!otTm1hq7d9Qhkdx!5p_RVGr<^W0;J zc&dA!*GI~ZeaXce)pd04-{z7@q=T7vd&8d6#>Q{izCEZxv04d%KP}%FkBVwu{YbX2 zD(p(EM$DscZO+Qr#svJ9w1jr=+I1GENz!#Pt->nH zwrjC#SVxGhjm@2qkdQzL>%`faDf8~~0KKOc0Y$er#EDzJjYgHRJ$EiF_rJ_j_|pPu zhL7#X%8+88NySqOxcBVQFY^D5np#J#grcIj=93tA< zjs3QUEUx_N&x#8cEI>IpVx2eU$N67{G4SngG{TldW@hdRM#@2E*95vsuseLX_yF(u zlPBLh@DE=YcoSAB!!p46p=HK?@yKsE_CN)A5lJ9Ehca(Si1Br)MJz0=`Lj#&sNS7C z`N-(vy9Ie)UhnDt4+cIneuR{w77s94?8Vi1edU%_zx~F?#l>a5nv;{?+S)p3W_25PlP0h{yDEfEe z;^M?oGcrW%`&v&Xzj<)GU^UhYuTeMJTg$O>Wq4GGn;vpf^6Xla9_;nQuS4zDuD4Kd zHgR)zb$5S_3W@0)e|L>*=f&aUc3W>0KFZDAyLA0773>$4DCCgYYJcwUPqD9;8lOlV zlqM7e&9DOtWDgyBb6Pg|nG8xfp4@_|Ehs9gE~uSY_fX1t^vx-+7}*=E#T~Kc!bZ7g zMV&{h4|8nXXeBBrzwu(nJf$GS79JWEXvZDHW$VNQMprA#t`b(Qxtdj_YfkREF?3E`KJ(7v*8xmLiAGZyDRfBrl=^R3;y`Ke_?0ALn?Lf8BE zCsXy`N{x415ztP2;5IcV0hAS8<tKbBcjt!> z+Touc2hKW6g%S|Qp}V&?#;iW}Rc&o8 zGlQqEB`dY)Cg&;9sg5hlHJ)1NO0lNDAek2$ubw~zX@4lXm2TUmkf5LO`sRNfgXN#J z2Vr$}8c3vyZf3<)+ zkDq;#swTdCZF6B%a)n2AW*TBG5;8518)2B~IhlW05el@{~&bE2?XZP#ixDfYQ z-T4cbX}q|)v_dTI-WKJ)fu>aPRP<};^h%gofqBEvmpF9?m?Xx&tSl{6%Q-(-m!K~p zWSCv|e?D1`&hSkHGrC!aj%V{U6ZFPBWwSCeG9DlgF_E82D=RYsW^}c*{In7cVyH6W zR8bPmI*CJXO=Ketvn8 z{P9PxA4fzh#t7A3e z&=iC|d9qDZIKpM(v+aco8MEUZ|6DSf zo?c$sME`Vkok?6(6Cr=^K;`KI91cXtSTPC#VVL~cN%OJ6X2M3PO(F_R=Hv4~0tc@x z(=`Faiq%PeZ|Ugjrds61l~f&m*u2z--`2sw_sW$kXlJEv{kHu8o?%-fue|fOPxYde zd&BWX{RtUu@AX`1&0it|%}!6~Jvn}v&?S)jYNyWn5UJVm4|=&5lci@yYs;j6T0-%m zlA=PrzBl*|9MxDfwn#6&oNM@Z?o3k&Lz81QQ?O+5V*8$|Ka>J?$f8SFyW943*vunh zo2tSNf*DA8y;j019?g{D$ib54ip+B#I(vIfXOck%wK??*<&6}rTPx!>eMY&{x;@_z zXeXDz%gpT55PP9l5Hy`ckHoQNO%&zIii!%*L3vIN6XWAOwm;=-^B*E=3FRiZ8f~m=4cY8Hfsy8*$IX~bSnIraoX9t(i5F4mvZhnWSDKA z+?3^=mbR0AIG(&g7llJ3m8nD-W5DkxA-yye&>I#^+5%|4N$U7bcrGE388@i}y-dyktpEY_V3a+T|og;~qR- z(j2Z*_>FKRFFG>dLvCbmkZ(aFXVA2B2n;I+OGcu;P-Li}s)@Ob+aOTh3>e5;Sj696 zzx$+U4#?AZE@3}$fO-uScuS^vV`6>2>y!nPrE%!cU)Y}rJZX$^fg95z-D%8>7zu=R z1d(e+w7gf}fB1k>$}bNPE--pOu52QFw6d~NWOU-^iRIsVWRp`<)zL0R zD7tUn0OJ_CsstwhZ%wo`TDdYhS6N#RA3iL5_%Pz2RdNr$foi9}k&}FN zb+!1EJFk>fUe(wHPI;_edf(CP9ueDh<7t@%XMTL^gWPtP*^8!v8`BEFO_+V z*r$2(e~LyTl5`r4rq5Ry(Al~g&9CXi=Pvh&MpU#j$vWjB?;lf>Yu1iA7X&>tt(mR))wJyH0(rM}D9@6RMM}v-K^4(a5ojoZW1gdwUS@Dv_P_Ip~2um zc2hz}+Fi;4jA4!jwEO>@(nbD$evc8fXA32as#~ z-WT3bICgASzcOzt5dE0b6i#9fetZ_S^-ZJR$JRdncMI#6ei`%^N;4JH@^`X>_9HWZnrh=olhI^r(h;btLzc}4g zCJ>vrHeSwHyERA~1tk`?N>l;j|;I&O>=Xv^OiRPobadw;63o?E zWX|mV#2k8h+A-oai4?wF(DCtO6zEO!@!@xC_nfDm@Yut>F%S`Cq2hpt^aE#mI#CB? zp*kX54a-sfKOE>cHnz5ENc_mACZfvn^3`a}EtwL5XfI;aqjnN!td~|InWU5a2tr9H zb%--@s95vS*2w#}HR?m}iM)fppx=KD+7D7b=JX$x=Wl>7R^30y*f(+yX%>4J_@ST^ z{gI4JfuNC)b+QhTmm~?jcyaLSSM6ChZM4jQl$N)XbdMkJ(429SeTB$Fl61fcLl55% zd>d+nO3Y2Rtpvdgk5rBKqmDJ9a#ZQ>00x*Fy;IULOf zP%=yMSUI5j#$Ig+SvBeXPrXjc>FZS6QJ(vOMKp29x&Rvzo1oiOA!TYpxPy$+lUgaQ zj<&Z#jLyiuMYe;t7U2VJY;07JkP|18hKGj*{k~;uv|NRf24X(8)ZWD8 zoqA@FbG?vlQv#eF9r-0C^`H`pe~AMNBn)a^Ud_oV8~hAZKxhs|*`psl0I37nghl9I zSx*~&M5QVRg?($SSPkIsPC$}$%VsU)X3#F#k(JZy!I=WqS&O1@-bcwiBbxK;UMVR} zC^~r)-9bdDa`poTd)~OA-rtZwFu<2zT@ECCHJb0P!9mMJK^Yliq!+z>mn<+zCX~4| zUgAH}*V@H{V?@O@ba*$TjJ~56xhrtT8PD^dT1@YO{pxwWXNaA^rp*x1l)b%Ity`zx z86M+FSh}~y-FMEv8+O|sI#cSC{A&LE`I?YFf|}C* z_w&zn8!oi`AtNL6uVMvB7eOzwaN)vqtJdtQAvSTQLNJY?5Yf_NF!(0>>wR?9j8o6rx!@p*Y{{b()l2@-(Nm!X4Ki8|)8-mDy0uS7~N^-lFib^P2 zWg(p>`_7*~j}zq&jO_!hBozd-4L4B+IJ%?(U2%3%`hAVi1O$7$;)6%}|R!O%~~vk{2+7YhGQdh~UlyLV6I9jFII&*iS8 z7x<>Bsh5&Bo?x`<;PO{MZ=2hbPhBhZ7qLzq`t&Ig4;sAd9Heg}pgM7r*Xx0*Ou-&& zy9ywgcZ6hL9C<{UA1jDbpIo(QIzB#rozoXps@Czk;V7IjivGgTL!UwlJ5hnPuYYpl z#U?Igd!a{<9-&eS(!MNQwq6C_0X+yr1re&P7uplhL(Y+T?5>F6bL9H<>u)p9g+ttc zaJCygd8@(Y2&$VT!=Os>$b+N<*T1bX{=mV5gnT{z`iuJQn+d3!OQfa-Qt4noTBbEI z(59ZmydS8g3w`FjsE7zYDXCWG`8<$1)RG2DI>aK=N4d>R>W1uLU4z9S8t@LB{|m7A z1g1z(K)Rgi;-6;C47q#WzTE(}hsZlRR*Xw4{s!z+c@G#1Li7mGrxr*+(mVhm?3Vhw zAdB|3<>i2$23=QL;394g2)+vKEAp+tjvXmgi!x-UA@^tk*X#uAL_rFBKsQ`Q&t&}k z{iEkf8N+xAP&9clOCjx096G2o1f5`GJJOR_V!BJcK&VO z`*OVAV2xR_jt`(FSW`+BM45t<(NIx2p6I85*KI&K0$aFLG&>#zm7PdIC1BrIffh$! zM|wC`^(@E@6bs)fp$L5 zD9=gq-21=a%Q)VO?W8l;+23#e0r^Qy72vD@*JEP%YEL!Xb|R^3M+#p5mvwFOGM zW}^U*>eYWOj86{`!5;LY>sY6c}KIzy&CN;*((USu4`cj+{p97vC%_xdxf-lbg_|Q4tYist#+`PQ8A$OKOifR&g z7J|2?b|GF6tW5rzrlt)<-xR!HX5ryQ!|(U2YeXKG#oHpk<1 zezzg;f1ZbUeCp0}Bi0M8E@7ng8#Yi`TCi}T{)PAN-_L$_9BF)xYKjBmG&9yn8F=Xi zNey6A3QlVO&%3&~XhbS-0GV`jbw!dihn9>m3`NX_4GGcFeCgKhMwV~W-gQdR`}rII zUv_B)ub`kJw1L{TJZF+=P=g0OxePXM-rU!0U7)F=atGvXeRwpZRrUktr!-Z(dX*(S)Qk7GhiqJNfBQis%e5%f$fhDVi_}T=)cPd*`20R~H4E+m~@B!fg?52B7_;j`6b;5{a#K~*?7~-C|Xys;N80XZ- zj?H0|V}1j+pj3i0&I5r2xPuQOHbkL%1aXB!WMri2yXPKAG-?+wW&*kc>^(MipV6H9 zHYD;{k^fS z)A}{WE@8kyko0OvKk)Rqb0-vA4RVEV$Br7wZzChgZSkYmaEc?NqM(r7Caeb-tc4b; z4y-mjOp5;bNANUSL5ASPq3^ddwQAN&yXXLOr_5f2>1?vneK!2sMyDeM)1Plt2vZDq z6os>28VNuWJPNiT;?gAs3E%(YA@wzq|KbUN8YMvFgU1kD-ag2@0NNPlt_n9Rt4}hs2fC5j*(L_~ zzOZ=dZt~9%eE?_xMZp#MQBfZ`3SR28BK8UJA@3Kwh4S9W8zj3xa4bcULUr2K=l~Rj1t8fJA~SO=_3#Y!Y1o zu}Wxa_IXp=h-Y|(%7KdE50+f)%h;IE=*5VaFAu?hMQ#}&c+fYS4V`|j3TZDRqyR%0 z1jYLftAG0~8mB=2)2B}jy7KBVYP=*CC`*m`ptm|d)Rq8g$rO@VUrpo<98asc*H08> zzrL!9%I^T3V3+`34{>sGejXlHK_^YxYGVKJyBCCFvEiq!-Md(wuyT5@eCKY9PA?BB z*9k?(vU{C`RUPpW03=Q2tax|UEY&E;gmz7b*BoKf5U6?mXs<*`Q_wPCA{s#r&3=B-47JC!CG(uq*CrE=_3JH)Y9edL5h4v(a7C)F z7Ie($P{GZ!YV~U7JtUlx7cX8gpMsW!iS!xsd^%}VM1m7qglsE9!t>tUyLGYU=>hn9 zgZec~6#f)8%syKcy1zT~4mGO1Q6UY4MG+5kIH*IC?b7^>>@BF`AQ7T~L1F;kx)&$j zgC>mMv{V&7>gNXmiLr2Abso<>SxbObDiv_wF@p zru9fdo7$Uw4pGkz9YXB*Glrz?nGkWOqS)P2kkPIY<(SpyM0j(^w4#z6HZ@DJI z!t#rO<`KBas8Wyh#U=Hj_K2TKFwD^cT&f2XZBw|y*#FpDxNrLdcbz*Kw!Dx+ z=X?Su2UOEvNN;lba7)5-`lIXYw4>64U8{mtb$)7(8l1s)j_nOE{RJScHg2sk33W&{^={;-UZm;G>$$6|O*&Y&}=J!D*t) zpGd-hb9X^EMj=^}zUg`W`gUMqfPFDG_}067_wM4QOEuBJz#0Slgim0g0DuK4ZLupg z8ueis+j-*ok5cd#GIF~FY7X_jYS1&puvOB5XXUXWp{+Zl4t(Sf-BeoNd644 zP{d#XVck!*?|u7qdfG+Iv?iit<-2hiaz~Il?fUuE7N?%DYvnrF%^IAf`T}=%qM~jt z;e-YULqaS-a^=l1K? z8oitgLt1z+f~@Gj<`}-=HJ-ET+Zc?^nB^`94n~FT%G&h@fJi820AW7JHt+6**BZ;>p-2qv~66rT| zmHd$-vC@Tb{S{R!|FG1 zO=P>VU`A>}ib9X3);X0gxErbrxR_AHf0N4uo0uPN^qgHOK<|WNoc^pm*D~b$sdqIfJO`Ral@&)pppF$8+7&vj%Timvg~d)LS^Xh-=5`zhSjGBj>yTY!&?6vDYO2@UYDK!fIy;F#rODlv$M3iB>e4Aw#1ukog zh=_w@pfPFIkiIwFtlokNrmhMqC027k{0ZqtMN09g99&%1w?&A{1%0jo+d%s9e}2gO z`qsSL)4rE=fl>!pN3jc^3@D}X>cE`x`oV5)Y8(*GD*IU`K=o{6(gtalanDA?M!q3+ zFizh-C7@YT1_+Tg3Ko%vqX*8@wB6NQ=n<}QxzT8Vcur(6<{XIHKtekJ`;_F^fV#LQ5IVHfp=VikJn(j~$Ch2>B|fk-WwknGq{WZ?XJ3JZ+)WS z9s*Oudpn@4CB?x#E1uK%ys}c6bQvs{7;>wqpKx%>6dZ7{gl?lM3U*5jRTM-uh8kRf zPe=oSl8fpDRVo@JZ3EZGj~@j|5fz&RsYwpHLu^ggL=9Bt$g4kdJ^}-7Hri8-fCHNf7uV#sp(NxC zbF`tvFY$HbDASyVX1tCns>fv6pN1e7|3t5OTvSnBUKJr(F@S8}2#Z17g*L~-=+$S+ z1c!xI-&nSB?^*Q@XJ_X)Aq1c~Q-+nf z`%Kgc9J4qLl;#=GUiD~)S?3&CCZP4qS~8R6ZvGaArm^j20%bkucZA^IBI|(8yL56Z zH}^plyn9JWLz@2C2odD5lmN&oWG$O?w{Cu_1nw&zoh7;Y3`erQxj&hsb-;r-bc5`~ z>$AGdt=FLSp2QAgbSMhj7m%!JVDNyfd&xZfpr44Vgm48OpFElD`t{6`^kp!Lz#BM~ zV#STJzyWez8xw$0%}Vb4!L*P-0Vs3VeYR%RDzy5>V4_pmSqw>8JheGEFE5XpLNtI# zKk+5*Pf?j*U%4YZBf7N|B@H%>XnZL@elmP6w9UXV;=~c{yZ#=<0`guTbjt>4kfSeG zDiaR^5`nl-vh-8J!0DoTwrb_S?JBZTI3#djpck;Izz+&i-hv5^64JJsf`TWRK`51y zkq>f)th9cm7B2dUv1pbfM^sG(t&`TSUCpDsuZ9sM-59Ge>|GF6A zPS=KbE&ibl1cJcm-YFPy`=KWjJK#1wau{jC4tefW*dvxLF*yLQK>^5?n~&ZUQq_SbgBkI@AjYe-@gaZ{ zkdqSd0tGYu^B9-WoQV2rHjPC*m(Z>V?iYHev5g+&*{K?bKNlia*Cwzg{J%2P$W4Ira# zY#o6O1B%E&I44`}e*rCyzE@^;oGj~Nu&L7k5SxGZS?eKF4J^PaA@UW?K~p)Xwn$Xv zrt)DHvRn^|Mz?SK@sN0q<6~C)_?DWQTKSlH3S4OEXR8k&i^{H^@TMY(b0WBX``tL* zd5p|gh!?8-pn*%OtCOo7#zwZI!32}q}=a_}@F`U1ux z)YSv@jG|(;SH(?Qdq7Bt0fy?%JVNdVv>4^dx6tSJ!%0q=PqEOFJ@R;5VDg>?vV9Pb zkWhtQ8>$G0bK5<+%Ly~4s2tW;CqR5 z!UPcEC9EcbmX%@MG4WxsE9RD@K9_Ji4ga%{0~IUL2riU-tpq)K%QxjhtIL)aB#=pP z5`;B14+y@%bJsJ_oDgldeocyXyEGXdym^4R0M6TB*>r_mgHDbpm2j}9{L<2G>{+Et zE6Cl>Xi-Do>OW(19t|nwA&}nXJ%MB?!3m~zhYEO+cLWe0ADC$PXsUq=sZBOmh&)fG zKKy+Y&5K9o56}`c4J$9ezH}*)ZEAU3=VhC$4 zI**2R*10E&$RY)8*?!>7cJQT!^+St1hz(u3c4uZ^?Kp(OM(U%)&Q|S%47BrBtX5oYF3)a0j}xnUo(O@>q)>$Z66 z+nAMT&k#lsKL_E8h(KY4H&GsFN8H){JoxBa>vyYB=LhPo9^G6)uB1CsaYOAas1xd_ zz%It)9pj?CG8n^^TamHBe5M7^>iN5Vm7MiLwI(6w->SikM@*992f%g@ z&On4_xv%+qKngg%+RfVY^Jsh=l{pA#2QcLHg2wmp)o(h=CY+Xmye9&;{oMp^?9l3}D8rNq=~*w<5KF z;f?fz`S(-aHzRs(7$vGf@mFxHBX1lO8w|2UB7vQSV+s*m1GWzI1g|M_9X>@13F?O* zez3Z6coqAIuw_T~5y|T4I8KB-zOI(OXD?>~DEi2Vh-f6^&)>dDd@%3Egd}|N#18@t z-^s|ha94KrQ)><~$5zrbky}V-!}Mqt>Yt4+>hmOIm$cKbRyaC2^A7tbNgK48uhL;` z3~-kR+C4yuR8o1IAq7>kj3A=e5r+bCJY)GRLGY%6DU<7Qi4v=#4L$C0EcN< zo=u7_@?mqA!+!2PsInrdr9%Ylw?KQA&6=IUB(7=d4Rdw)+o+kQac3NBvc3@G zLpOAk*Z0T5ic85KT5%F8Jmw>NaMrug61^qEj{pRExWcjrm1_XDpM$<5w;`580g$zd zrl+x+c7snbAR7$@BN_kB%v$fJHUOZbjsvFvWNp|fk;QX{)-Ii7Xij0j>2>4re~<)AEia^CLNT$*?=dJ!!##kC zbut2YU?@HmNiepg!T)iF$qW>vZk1*Lk+@Z9(2SAU%Z5z*`G&2zD7~dJD>QHz2#~^V z%Vwb3A#|f}CXhsoXU1h15wSpuFo~*@3pmgD0<3+3=30bs{f*sXNJPhC`v4;GkT8t5 zY=rpD@$0W)a5V&p2x*dE6aG?}^RD4OZa zinWN-*YtgnZzvmp+y$UfBjFLqI9=aJsK}WssnKmOSAm|y51lZqiGll zBxbi5B!RpC>M!)=Foud}@z6Xuco`~>AopZR5@vK<<)55KMKSU|3{VH5$KFng!~69> z%xt*HDZ10TE%yLdiJ}@j;rTOP_1V)qQch_E&DA!GiD{AzO-;=kF4Qp4;+CM;kqy{c z5jG@g#5yHyS$L7{1u&6LwmGIote91c4uSJCT#9Kn?+%dRfiO2{j!?+H{Sd5cA;j6k zf^TO?3N}ghpiuS6D+YF>oC8LKK8)bim?z~u1_f=3IG(F9)2FD$bUdwv=@s11VKkCE z!}~u0E^FeW#oT9I=o%f6l)SvMbY~J;B9cq#JVhP?0tev!-B7YR4^1wXD;jB%xXQ-# zxpP}uTbo+)XFEtaki?jYEf`$v0tpf0j~5G9xT6CSXIT&@jR-h~ElO#cc>%_OSa79a zNw(7sR-D(6b8wApG1xD|9!g0Rs*Q2v)6EEkJI z=$}O*ByteRt6V30)Gj+K>s5QZG14c~MZXEASRy5`Kta`K2-DF_Dp6~I)0j@8C>vGZ_33nF9;H@x!lHX0K?+Q#Og4< za8g-CRjx(6n#)NX!u`!to^E5X)7VwQV=yqsU!pC;ic%v1<5GGC^bW11X{K?H= z4v>gOOq4qgjdw+ej4|1|Uz8^tVf$s--w^+LeC$U)$d!CNVa!^hJ?xNS- zi9m<<*N}u9PU8#cbLb|Nub*1uV6XvMPnTM_&p6PRaJh|#u}^b6(k}9nSg{95S>WKi z$Dh)@9(iL8`Xq>O8aCjv1X8KT2Ab4?vmub9tTkdVGd}8}lL9iX_^CK#VD{Zq5KYMq zIY-P*vzs;>{TN(!LU{_O@;*H#l|yPg*iMDngq!SuoXWZ+Ml{Q~*QwotecvmW%LQH(Otqh>uW)`nG@r4BeDGF7SX4Oc7BzQov2yD|B9XjTsXEXt2F zxX{O`%U2s^eM?&b@llxqbIAk)(nQ`FK7C156seqO1<~viM4hA4rpxl^QXo!!JdiAd3Y_i;B!HM8Ux9|kath%A$TRQ?WC^Ysny}5QF064B`H~o*Fdr) zQnl^khovM8n1gauWilTloeM(xOVCYyTw>Ds1LKl+adkD#)7OAAOowy&z|cX${Ae4Y zXT4$GevU^C2lI*Bg7ld7y5J0PWtSF;S4H$4G-nXe6{t>v?j(PZoou%KT6gHRlvl`q z4|`!XJDP2R>@JQd7%xS+W0fE|L__*{TTUkd3^FoVKO`^yty_-*3)h1VqT8twDJKK! zu$^|mibWECfgwT_Cgu*;jFpU@x$dL3Aw%`A_f`v_|N%#PE+M$dhhGn*~txY4IpG;0i#|r|$*_4SQxf(vLvX z#B5;<%0%_s(y@nW9T0y8DE- zWBQ457?E)#(!4Q4-Ua_I8HKwi`ThaJNTUa+)mXYR^eNChWTj6o)cy$GHX9xYYOdz) zF+2-%IHVEraB~uz&{@y{C%XryKH1HnaZDoB)Tf+LWE;qAg660niZI$nx~WhSKX9ln zQgIE4mbU|sE>f#J2A7)v1YvUf0n(NG>RZ8?L*~gHJ9d1ssq*<)}V1}1A_P6RylC|cGpg~sgtKEz(J26(R6y5CdK zXlS#WnOEQU!`D#-Yn2$Y{5Menaq>$58{yKDZcP3gqLaiON+_N&P=0CkZS-lj2`0fttF^(#pI#3+Ji|ml1%V(@lm+L3+Xe_{CWuD4(>modtW2-CMYjwvxu$nWKFy}_7`zU&~PiBum-yB$wgqFq2r z!I@92a^`~>4gZfkbmCv!pCdRhM?rgx%kg#tAGJcwfzH&2`eoLZi;G(Rq(Ln<3A>M< zeXXI&VpmunNj{>Ml=2(QXaPw?=RT6XK^G8EsAMMmhSaF1L(*O+I zb(^QQfC3{01E7j-ryznSYm;I2c^R;cL}ien9gol0$NwCcs4`lP8-#i34-$!qp2Tgk zcZ+BWWdtLqUS4!e)NIe~puCcjFM6QeemoRMpa#fj$~kiiJ3)-o80H=V?vh^{xeOC} znE8`ohqlV|b0k%T`UGLd)ouLULP}9sM=>ZsAYthK95MrvuZfUhix!@rh%bne(1GY* zBjpNzF(`+G(An7;K@_@2O5D4?zE~Q7BGoDQLYpa6E>sOtBOrRyZD_AvP3RY_#*1Eh zf1MrxSQB_)415v}Q1eYI0eGJYEYVGM5I*3@CpWWQrBoEPfTUoY!uK}+iR=u)A5TP- zH333FdU4V=Fq_v~BQ}M9M|UMa#X%X9>Gw+VfHe)HVRU^hSwXOZ9*LuDGanf3S3ozQ zBJp_J*+y8OeFkBamx?$hGm_{|KZ3}RA;la&pGKCUYtv-i7|x<3wUH4PZ2pp&oC%W) ztq%UA#sa9@BoN`7K*9$YFf9~B&fdhFPc?XtN3=wJtvMN-=EEKT&@~O@?v~R|z(W!F ziL4>){I(6Iu(@!$2R@#S&-wmf^C$m+KVi?!ll>R;eRFvf=BJ=fy)C!$g$!l}v6XCG z=+exKw1Apxk?)VvZ8%oubO9Cq4N-k^?!CC-rW!KgA2_O_*>qKCJvcQK1KXxeGT1RV zT2q)!FF??BC9rkO6X%S zRB}*Z;2Xo;qmMv2^W&<8o3l04(GX1lc?v=(3N>AxL36EGaR{O4yJ$FysP*N`C2+8@ z#|-NAY*vkYEZaHj_D%=&xs>tGxq%kB|F_w%?(!4;K&KoU`gZ8=n!3V&hqXY&?Fll_jS z7%|7hq`XHZ5%?_|KI@8czeUTIX(8G*aSss<^+0Ekeb@tMcQr~ES>r($=zznY(+ zLfIfWqRd}J8y64aAz_sn!){~JT@ibSt6ze$Y?Z(dqqP#5K@z2q#)TkoJ<%W}oekh@ zK}-y1w@}SybWCBa zOu^z~tI!P5{Ssh=m^ghZW+XgeOX#x8ik{e9MDE&c$1h=0p`yonHwGjLx+3k9tr*{p zp(q-Gfo@OqIy;qRzGA1cMSQ~}CQwYte!=#=-{rwYQ5qmWMErR3g*hh3Y=AhgC_(u< zkIuawmvdpSPNIWjMAm@eC1wjH{unsA9Ulsa6M!IHzn;ZS@(RuTKyHPNz4>MW9c1#n z6Q9CKJC}KV4qC8vPr6$IRc9Nwyc%47ZEjPR#0fApw!+=6Oc)Vy76EHYU@}iH@GM5$ zW+D((y)Y+>QcY5$B_u_l&7I|nIk|ulAypg;v_EpVdMN?1fm}>y7`#XtCNDQ}1z{x_ z9o>X68JPQLEl2nvGJkkT*B$lOi}LeE6B0;v07e7^~%X4Ww%g3%%zLzC42wXOnM3D{0>thS zWTxaQCr*a~DpxGV2ATE;E#9Wd!z@7t7t)?ZpE}`gOtRA=H@&(^Ptfu^HK8p(t{NW~ zM9K}6a(+rZFM7gWR59F{6_KSCPpTVcJt3KprJ7A_V4gz>2)h>X!A^#C69CX?6yFH8 zB@%q@r^%IKi54sc-8Dy*g?YLjL=TbfG>me6!j>POuj0M?KUaZ`D@hOE^AHV?Gp{!L z1K$xrj+5Sl+(&Vrr8Yp*fsmz$6hmgm9F{RZD0gNt23^6)keh*7em@LVDhBGk_#S*v zq&#{!^jat-l*VX4Ko+J>{AfQaxII_tmPycjnAHCR^W4Ew&J70D5D~;Md=FNIZX8AC zWHYz4ZU$Q(AdosXqvujV!$I0ZfBeya9dBWa#iv-FKj)15705vZlv^JClFY<~C$ruw z{ea?#pzzP1>=R@saff`?tTWDQSc%{m*b`GsT^xeKkFQt_?1D_j9@4+$PP6Wpf+BEU$vkVx1mx&ADB|M;15@tF>q8jxB11UpBS^uyqjLrq z6guG&Kw;;|S$IsxKw=1P-CBOr$`gubAI21`kn77!ig4xEPP00`*}YU#4NTY=O=$-P z0yaoF)iE*q{UpduX|qi#X>7nF)S8T8xZ!>>d2}%dfIMM_n?ML&&{45lN<|as<0_UU z4bJ&ZNww{uQ1R8Iy2C~gFtSt|hnOTxcxga}Ya=%x!_uOnoB>hCp?I?IW}}2MEMdcb z_rF$-XSM=m(%os~5(eo3%S$N<-qI|R#4 zwmVK;YEYG>CnE4oeKydRMwGaIaaJ-XGKQhye(u*lHYaN zYn>3H1VlvP)8VJ7srN9*h|6T@t_-TXsBnPDsZD}>e0QLWAO>J8OWLdysAIeY=Rj}z z+=>DuDh%Xnp(j_$Klee7)D;XVu(fvBIc??1AW5YY)E3QzGpD_1L>Q2m#*@&y;D$stIRu{@FONOMpDz@HuYqb0qu<80Y80@OZ=WI_nyY2b7)&Qm@{s zLqn1H^!w&?(WsI0pcr5{4K?E>Z0+rLl2tef6K;hfjB&bwvd7qa`^9{t0>|b&(8d(VA#x{`8-y@n$4*g zfTfImukFv7T4YHCIc#woKtq7$BY68>P9lv#EC@ZIT{7E*7)%0p$A?4Oy$Tmb?~}(p z>+Pn~<0EYMpS<@&VNgbdl?rGUH-V7x z9sLhFF`5WrFn-%by@t~BMJ_FT(1~%m&duF)n-KeUUW8@gEYB<#AwDSe1drjlgd-XH zJQz3JCipuhQ+r{k@e$P>|4zQlR#p zG{`VuctVkMj{?*%dANwgC-7KwcLIEceL#PWxTJpU;}UUP21co$z6$4FBJE{kq{s#z zsAR|_U@)dIDQK2>1k^rY5pKw(D}X5nGZ_AJ4{d?z2(V;iziME%^82Ggm#XZm3Xc8)Z9?zk>=;U~~}qOxawTl{p*l96}=D zq*Ft`L56fE9tiowdXmy!9)0K{SOU7(8e`eIFrJB?ip#S52tNa!*kK1ZDWe~W{iATg zNExm+z!ka&F0`DxMgxApJAke93t?z}kbZ3oG!iB**M_7OTeb8DcN+%>%@Ao<-0vO@ zk&u1u!KLOEb5M{Th(^Z($ZU%$C@$I&(gXeqMwc{1^)nAKP?c{ zDX(tizz0OXT!45OV8|P}ru+OCPa{^yQ$)WKfEocGK3p|K1Jra+8tSZopkUeNb~sH@ zl1D>W)ASn`NPJNemM3c%ev<~MHE>T>MG}V)52OK;CZm^W6Na*FNdwTN&y&)QITzyR z=*+PJ*R#Q^D+yX2dho2cVyAtN3hwyog$ysK(Wyu`NX()cibd&SYHZ5I$S?hJoYjz^ zF&6?Yofx7J*RKH>|EWiAX5;O1s7s-6GHcN93kldGDH#jr9)5!WY$UgKVsJQUdO1ym zqLoG`$0wQ{M!*W|MdrjE+=4(sG?_&&PnV{#c{wYZRl_498aOB#Tmg>-`u=}Zoe5md zc^CHYgh;fglr35eh04AbTBsO`gh=i%mJnlC%F>=K!eETbQdyEAyV7Qz85v8Kp+#hy zl#ry}@41=xdEfawpHDMSb@yL>zjLm0UDr9kc~gPC2Y>uE1^BnyJ+cCT{hDyStLINY z#%rIbmmzlK5?Z@P(-fj&$n;>;R!eV3RN(Yj!k`EMV${Wf?&Onf0!NCY;Ga9MtLkll zlkD0XZ6Ccu9Ao{cPIL;zbrWA`uZvpRNNogb)HB;Q^!mg0kEIy`u7SA`?!X5W9 zvDp1tqB@Fa6+FRQK2uzK+8R6L4&i1hEhk3C2T65bUgAd@lV$R#-<PwYKYL1LDk&Y6nqNO(- zQ=L@hgs$1gB)c7G@ojT047Hnoiu57w5NS$V{Icc_6x=IRm<8K|#8T2zf`MePvwTquvT9+ooZLdN7$MTp$j zGaWTWHTDE(C1tl{?x?|#?u=%dLb^ybzQ!Atq(J*@FW*ds^!AW3pFixj13V7uot&1V zjS-$w=-lF$2_$CK6udE(s%*q~o5V9`u<}UH6Qo?(mf`JfOFS&lM^i6;+~pJW!L#QH zcQ_?_^0(;8BN_3{^Wm}uQ?B4Trh(sOhfa6Sb;h?K!#Bj!7+haB)1T7#h}3Xw#@jpv z75&~hUj<1cJHK1wT_Vk3XgI8lpxn71Fzp=`qc;IUC8-j-^yg9{z#P6baH|zlKFnON zM5P5Mg0MpGV4IM}9o1tV&-<4ennNaT$ukPkyHZ=s4y3pmDXW#M65V>2)$Icj>QN)aJp4U0;;l2DC{sm26x94LXJlk@VG8}e|M$wSbsD|* z$mu65-9R5>*{-rBL2x%GTjfKX3xy+tjAu?yWP6LIBiK|$C&-n_D)UKSzHH&be4xIx zh&{T=aQ{^KJSvoXzo2k{7M9#_s}Q|t=1h?=yE_mYH%CyT+$XlD$k24ld;k?C zs|*sKeR*x8nf`)p;G;$JtX*JyV7wf$gXvSI2SE}-XXj_se_bHOA@8BreKkey1Z)_B zG2k*E#XKu4?7%!7si9?*F_sOHiv&a9%-& zfr)I*_BpzZ8g&<~qZ9c7H~UpY1(;|0gKty22tD)D-WATwD|qh4t&HPtW$uIY-pP3? zU0q}}ili!++cI8^44s^`N$>5OH&O`8c{k{;Jxg}K+LWV|WV^s>Ck=`*Vu{fKG^S7B|Izcf}-lGGUQN zCms1h1c|)_JrN2$73-9Y9{HJPf7FB5jx1=p>PvCOvp=Q3Ppn1OUo1lH-{8%r(BH;8 zQJg7_x-xJ!|FW$KDvQd?!5Sh!{E|iwg_wx>uu(G9dvYc8xnOx#%Xpr!SYg(WXvb_os+#;rA4RlvTy?edk#EUt6+ zNXmB$zA4N*p?62n^h`FJxbPrq1 zPt;kmx+Nysu?I(Xsq7SI>z7w{@zayBuwi09460cymrnqBo?@O10LLifoz|rSTSqb| zSr|^~v|asqNGz3nC%gc3B8|j3tp8bFoW+@8@TA`RuqjJf^9M@yixVaxYPry|aw?K= zFVxY7HJksYyJS-Fj(ab%m>Vs&8*xUH>5RR>6jRAcTQ73LqxbMgnY;wdehF10)(*~Q znUQMHovF$|8If?L+>mkNs-|o;g=>h|YsIxf!TraGSh40EX22i;`)}r=qzF9wI9NnS z@n_$q$7_?4Yy!Zm;+CY0K_Uo4EI_ zNoL04bt9s;t<{W(isHsYSJjt6sgar2ocG{WD(tvB!GjqZb!aUq3wGil`rY;DE(APtV-(z2@H2dj9-5 zQ>mAi7+0A{%ZaYBaU@MR7d~EQ*pA!!_3JwTyka<;FCyYen-=dFpB9lc^6{mhHrzqi z9y!B{Tz$N~y>oJNBi#?^wQs+X4i2L>ZL;y4$E?Zn>%}SxL*+MRR9Q^q^-xOPBR&^f zLk7uw^R(b&PLn20vgzA5{LrBvn2RxKe)_0RrU|F}($|LVRkNn1M%hqN&Fe=+4DK*^ za61;6!-x@082B-@c%vJOY{cl%t!|k7!*;oaOZyH+kb-$1;2M4B&1(+-ipQlGr-QN? z(=Bw}e_8eZkd34Kb71k8kMrojPbio+)!)A>N> zE_!zw()6MnS>+Cq#+hFl3SU3J_Yd!WvYtJ6ZuafldWy|EcV4|4<>+Yen01`S(SM9O zYBlicZ-ZC$0RpWf!6-7(9rI5wc&ZGq7E|2Ey5oZ=6B^)j&Zh?C=N)hn_z#^lsWrZr zTTGy;uCDF?)#~376Pl@I&(imQ{vvO|@(4u1KHB4wD3PX@G5NP)n>KA+7R&&|^geU; zY&^^BczU{_pCS_ti^s5mpstS!8nI!6fp>&m6wOwj6&b9>1FZ{RJb!-O%d3-xMMrpP z{!)VGOv=D_6&063`fDI)qitvYxhE3HUc}nqSzn>txdmwH1!%c+;L^Hv>g@+DS9I&v zt)g;KDdC7;9m?)@3oPi+y?YCi3sO=~+E#OR%C#qr)DQ0KD$l>lMAi^jHS6KYSp%=>rltdERrs_4+W_o>?^zYKL87Z(T)ns6qdBR`PS1d((IrEma~Yd-7Lb0=jF ze*Xch@>-laLX;KHD7^>hK(g`fg>n@0j1kQFXw-C`W|8t^WYtI1wG4&eX^=L8%P*J1 zjS7kA$=9a$NJ>f?F~>1(D24Pp3gQHWxqc*JBd;!__YS&@cKWXBeoP%84dJX3gqM_wB@#j&PcZ7*{Avat%#QQ!=HDf^t5P6Mhmw zaShpi+n2i^4=`PCE`&u9*i&i#(}D$?i0?y2kJjc*DMzYa%)Ne@KbV@ zz&7|-^GH6qNv_1$Y_L!mb5vNH5owRnEp7PQtlb-4z5l+lb<37Di=-51p`MLBYph4>Ii=GE~ziNThSbnLlY1PuosAh`L5 zyhX%^f{UyAijv?gH|Mw@R6WqtG+|Q+U(N-6>BFHM(d>uit5!v)JqBlN#C(xJTD0lW zL(i`!6J1AFM<*nszOIc*Te<#Ee!ecmV%Lf@>pykt(xoXg1g&V;*HVn}@{$w8Z2?C_ zl?DXWTX*lq{pL1VPhw`-68S?cwoDON?pAY3VkUkPx5qCJm_h^(!w((s`d&BN*tri+ zc9A!?bLY;0&7m6%|N_46Xt`rWF>Pr#-w7`zBK{x zS!>XO{FoQLv+n|*E#a2Dvn@Ezl7l)U;hb6W+7OdPm(&LjA1YZsJ8h;lpcZZ7;E>(7 zMLCQ7$#i-R&n$ka$EI(}^jq6J3PhQ0$pq{66g|qx9f4-eQAdYRSTOc*plxFXn?#oU z&i+4ll7PwMiRdO*?zmt-g9)$4DYvkBo}}Vbq2pypr>)n7XIu4FXH$fwOg_ub%ac(G z7=kmA^>f(mK&1GTlqeWV8Q4Y+*YPe>_we)#1u~F{-&I%mt(Y=(stF`j7y}~q*9TDo zhN4TNrgpGD;7~5*Tyv4iNZ*iFpAn_I$ zgM%hrB>1`RhbbY*h40wWin`O{0gQP7cTZMngP<@55c1~z`$)&oFpP?~kWapK|Nd~MK#m+WDz}fs?gZt+Ms~cw;l~lUcK-5<%N)F9TQB^O zAh5hWmY)u?j7c=vn9cpwH2>N|mxVbmH45U#3@qm#ukAQ=sM^Da4`(q+YJc~w*IWae zlmtPZ4xc{VoLXTcgzt^l>FMdLhM&@`%$|ypT^WCIWG9E&KlQt1|9A-!v;?UPWFNlYhgiMr$%6xwmFz1G&C}1VoBuL0 z3?gS=!0u@kLwmFJFJLT*wKVP6QO&-t+6=L74QVB6;aST4 zb@;FhknRHCcBltiRzpb3%AS8%wapgfbgN%5ZZ4R6=B?JfFGjas+Px^bf!w34!!qL9TrhE;n0{6IMbu}k{Fqn%lDItB)z zJVsY(@n>aRA(>fx_+&w-V)9HDk6M@Gy;5JldX>NJ|q6bH~;+iqj|Gt z&H4=-xTCtK1rG%MFB?CWZmU)r44A~sjC~*l`j{c5XK{6PTMgHJt8K?5o`wJYwYLemv-tl zeVKMz&6`h~J2#pk9p;@nMRhx~`s)DbT@!L#7DT7KB%!LA*-tbK}Ud zaZlE+P|Lh?N1tn3$EV|C=#=rB!Qh}8eb8FOrcL1o56+A`mti4K=6;Dpj54z##cxT| z3Cx!vlPtGafRI>PNI8wm2kktPM8*z5tj{F&YquY?`M2J6DL}8sXBMh2`}gr0UOOnj zEPaeI$BJCR5$X$&p=c>2_f@_rRZL}pFB&y5_S*D*0fh=_4IjC8kTG_ISdD=sPMg`c z&6846T#v14V`yk7c>uU&gC~zg8PQFTos&yI786_73CBYoy=bZHxe%DNeq^U?0ycwf z%&wu^E&NNw70m@#!^gO$2vSbU(sBaKuy?S6mEI11I-+-E2*$^N6`q0pL zf}%~YUiu}jsc1wtJ$pK^vGK4+K|-cALeyMd{jMYTQ&?1V`EGUjn$%Ql;iS6yTrgrK z^g~D))U!_?XAsAeN1uN3@xh;(u@S?_K77oxo?Pe;SnT-MsF5RWXpWVl`yDH|OHm z*q55BjWD1H*|@O<%Wn;J*7B7rU2D`jSXyfGFq{@G>Os!E@pVohegMow>bN74=$K)! zxvrj`Y5L_WS2S=MXw&;vI=r(WBKNzwYO1`NrDo^O0a7=mMxbrh2&B@4DeKRONz3bM z`_F%TMh(k7`rD{jucdGwlzokW&yl2XL8eaQ(?RirmcLWbeqas8mv}<}a9LUQ5AR)z z&3G9?ER>qC?V#mj_R^i%j{HhfL+GWwgVbzc}_(yrYGL=GNmL%zItHPqBJcGZgguF;0w z0zUma1-yJ!rffexx1`y*bLVE=J7TOD;^ox}{~Ney2x@Zlk-SYYF*y*tIyyRvxpQAH zvS(N@+kNrtd(C<7&Rk!bL!g3nIV>=65cKb~nKSeL@t3Tf(pgo|+X+VX;p{gp*e?ND zJc6h_Caw8AO!idJ3EXY@lJk|7G#kjVu}+|KDFXK}7r=k$%$c1S%k%EpwU&xPoeV9` zL-r*TA3uIPlNOaNn>UBhReJSjObbl8Zh_%6ZnBplFu<0+1o>G+9oBOWohdpb!t!LV z)b@<+Z7^!osB5Rnvj_l~g|E;6*&%qABP2`|D7r(xeny;GLaI~OH!u*8m6F9a3x~^f zAZ^o~xpg{g;LNH|-66dSU%zg~%43VgGj}Fn=~8E^{j|dsgnV5iqb62Xhc#_;G&(cmd`n2&hVUbM7$XTEayb>AgP^`1dW14zn18$nrn6k?W?Lqr zFm%co*0Y)cLC?;DGNqT+{_oRWp$nS{oB`g3ko_+I^_MnS=F}k0cew%)d<#ajhj9XP zlP&}BTDNY^6sN{x&a^uo6{R`7hcRI&024S2O+0o%0HiHDD%aY9aaW32PcIGT2`(g2 zx(v3mYQ|BknfRFFlasql-N0bgCB6I$#@O97^vvmaiM5Sr%LQo{BgKXGCh%Ms{o`PYmd#wSmmvYmCS!?h*#cVWYiGju7C;oG1GQ$&k^ zw-0;ou?w2?gm#Z^H}?*1!)Dn&`ODO#4Ri@k}$ckV3?q-xR_y=4{MB;3Q%Ll z?Acu&^l>MbBih8aH?0ZA+ya=$Vg*&aD{`P3V``o*a@RUQg^{PR>;e!MW?I>9w%egK zJK@W;LAxA@h8C0DknNmHhd7h@6z$rza~wWAkxCaraPz0dZyy>^gKeAqX)1uwk4dn{ zfB!ujLfm)GoG56%n>%gQfef*qkaDz8kJoS5u;E#aDjtIN*g0kt(J3h@$4{MdqT-8( zbW8^~#$ip=V9DeVQZ1Yn3T8+OuOmIr`~PKiu-!|*zOglKK)5`%bv{;nTg&_1r(V*+ zU-ahDX>C@TvTI*P1cASmRIHK@{Ump$n4f8&LKkTN%>Yx+%6U0yymuFE-LLjgO9c-f zCV(U*M`BaXG33Ui+A-=ofATN>9es4WSXpJ?yJyJdIuPT`txis53e8$%<|1&Q)OA!Q zIfi=c!^8b(OE$7qHsn;m77BzEhUO~hY$y#HKYqMXAAh59aEoW|HKoiIJPK z+ASvOs)1h_9MYDCLf9Ey)#l~JNd^|c36MDa=1;+4j&T$3);eyL9ASBq=i|pYU4Y(r zBQ*u-Y#sV}RH^0gv13~T8#4jzY53x8x0Bnl;qCJ2uha87nO{$SXF`mL6ub9{GSPcn zc5mIf4zTX>b_(uieUM}}_@S_{P@%Yb|7VvQ2+I`Z(x!{^v49j&c}JgeMw;zSR042zev`H*NY?El!^XK!D7peFms^HPF6 zs~(U0)~Z+JAwpVgYXHoOLr0IQ=vj&9MrxtwpB`b9O+m*x+IQB_Ms)Qx1qF4MH|1-zZxFMV@0cSwoFfq>G)FQ23#t*PhOuJ-Z_w zkJ}E83k=(~jUkJ;)D6O$d|}7D9IJB_){f53c)43jRh&EFPp~{Bvm;)toTTg24(rHd zO!JC@;J6z85+Di#it6MxK?AgvskkS4!6fuqF& zPw%>3%-ULBQQQa{auk#KY`3>z`ypdgz}rR1t?PQ)OkSg^<_-3ettcop*z$@H))nzS zr%!`@iHYl2M@ryH?tHH=Ouy}gOGE=gmV7cc=J0+ZF;%J@b`@K04I7C|%4H>4N2hgb z%jAn2Fg?}M^dqPgC#wcUF2{c|(wy7l2aKPzF*csY(rEjnrLKD@ghn`IPzfE~6POQe zWJZvp6L0eo;29b>GRQfP7Uk||j@GgIDrkBw;wJ?uvSfu5!h$QAQps!i#>^Tt(WsWa zIj)P;tI!U(5R(`y99ZCz`!@wM+YSrb24*Nk*eWC;W8^D)nqfb3SLM7p4uXN~hF;{rZi&Ui9@aQ(>aG?qbZ?>#^<`sfT_tf!WBVc(-Mt z+IA8YrMcF-OgIF`$HRV$xW10T$T+>GvC^w)dC8gZBN+}}ltVSw9X)!~$ZI83MHURQxt(y7qSt9VJazL^S8!<)F&F$3+)XtWZ_#XQ8z?4BoLIyWs9Ef)oTS^hGFtP?He?zq>S$ZV5Km77 ztb9TUz@(*!c}ufv21MwmX3kq_u_Lhy?NGZHbEm4FZS~HWlHN8oqMn089a4)OM`~o@^`- zqwLiySizw&mK%h6ys%tX0joCo&A!PlE=|d&TknvsT`yYNf&XQ(Lf9Q=@&Nkik%I6a zq}m59x{PAqo(Qt%+GkWQvZ$kii~8qBdonEp$}$Nzxk=aMp#YP|JZoR%DepNW*dD+b z3Q-wtD=Q_=>>GLJ2yg?oY|HrT>eUde_4~sko@C%`;$?JT0BTIi1!ApiVx+fF4uoSH zIh69~*gOr`_sYpdNRcJn;LaX1TqD&3d-v`QEFbQ{=>|hbjELAjeh>F4C2eqRg+}8R zZ6in?L&*mI>Iy1>Y2@?DPe`wX9*wSDyP5~_cjF@0tWlGT#ieaHFb9-<1&G#&(y1-I z3NcfqJ&AM3hr-tyc?z>B5VpNtU<8KONZT>}ax#{cwvOhiS`jqiGz9Xb z)&FZ9Y4!a5`}bRR@3u;g#wIlMW`nOp~TBwXdfS=eo ziOM5JjSA(*gmDy23k0VFl`dq~cNRQFk{N$ep{T2UKROVe6TZ!vv3&)TN;ycN0VIh7 z)ggdq%yi%83dk|R#z=Y8ztOb@!bK(#gZP5PKI|P&b{VpwCHn1~#;3gg*JOsGfF(xEyD3b1bnI&r* zyS)DerVce$RM*rLqa4n9aKZu?S?)(oCw4gX*f2iKt!;5)z~*}DdD^|K+ZIcN`@U>- z-Q(i6ZCg(#gWGs^#HnVKMpxi_rE-6HsJ=f`A)Xom>=FUJqKIVia61ymu`L>T8ByN$ zTlR0;l^@?UH8V@ps}C~J*WZ_tVwudOmyXPp@L1&uD8}cqjyZ-xBjDOEnd?>kgSojc z&#CegTY((e_~svfSg6+Qua_>_Q7^5>4HB)Z=rCYFYgE`Q-dXO5?(`1WT?oc7X-^ft zo=0h$62LYW#RrLB)COhO9l(1iY-7l#36}!T8p+M(YmBcwq{0!7o*@+MSa7>-S5q)4 zvn9NsSC_vQTU+h0p6bj6z8%!Tuq{^U+q{LTWBd=-^zPx^iq4OZ-GlO| zv$M6;#q#B3SIeOeED3uVJ3ztgOD%a|l2b5@7k2F%PY)+23sp}*hj4ME41$0G1{#n~ z%<>2xSAeR-iRR!&`&fuSE%N?wHeTBB0^siDtgM8BBc`Gla)Wfk3&Scg%wJ8h|G|fp;guR^Ii+ z;i`1RzP`_W?iskO1rT)zJbtc`Lexqe1fdSK_XXOZ*4W|=muV0&rSwQf&>by>6Cuv9 zWDyhebnwmXv}Zy|cH3M~*E$1vry0w9!q?V1bC+uUv@ zy*S~}(Y6W0z>ED>R&|zwhCSJ8;+DGGKxP@EFEj&%ot!gG zz@XO*YZRMz?~Z1>D`@NMBULh-R2F=xh$2{<_h*>X`W$<-Ixa3QA9v5UJ$)!Xeht{X zJ)6hCOfkgSxiLpRuc7ve&|SP_Nk#4FpN))+B6LZvSX>j9(%r%nd3lKc+ccleX zO|-4S2?$%fgYTF>P%LM`FWel=5UQAV0}Tnq>lxT%6x@qcERakzz1g!r=e>RJ-fvth zuU9|KoN3C=M&NAHq)8?$EINqFaZ)pK3d^3I+>v%vpRpbumLIQb$Q%BV#mNzl;Ycbd zzPTzm2^abA(~M2L zKFx&~<>zw@3*&wb6^lCi=+M=26ItDH&A;D%Lta8QfZ#Y4I{quHfP(O4fm7~9*8MWYEJ`})Y8^Sk5Q`xWY#3-ee5E8Q((!0NW2@dH1bdt}Sfpi%Q0}in$jE=5>UD?5egtc%#zHbWBoK|nd z0~!xEh07p|VXGDnv&e~1h8@7wuU@^1eeJWdrm73?4tbX%u2Y`Dc7lb_9Xv7rCl`#N ziuhfe!?flA+;2rGv#sMDv#DdNdtraF!I)Bew!H*<*erY}1t zY!VT80;cFlt6vGHn<(lGN!Lop252YH676x!PK-P(LwsYzQHI|)iv^^kuWz0nXak%b z0rX^rMon4c)fTxJ8f(NHHa_l%%j5;w`&F;*Hp4fycKi12JefMIET)Icv7UB$iO7{u z{Pw}`8VK}Vm+CZE;P78_{`{&m^)iAcs+qx;pC3^=5hA1*HS*M?Nh#MOc43!?Z^a zkGk@C3l>aG30}tIsGQFt>W7~w(&0IM2Z>0dPUByz55ZwdhOp3{X9-LMbinq9?LU2j zA@%)5ARq$S#tvNaN?)jHM3*P_Qt5rwa4H`G-4YQoLMgBL_nFP{|ERNgZ4aKN8GbF~ zw-P{CMq7c=4Nl={1!*Z{9(GV}coa;D=<`$u@vOK5b&5&u?z$^iu0-Y8d>_+xz{}ef zQo%D#azXD4!;3zCMyK6!B$Mum6$`RgDPZl+*M1sI(}B=$mU32wFV|tyr%(5#z0cx; zXAFMyl*rV>hod>+09v;}==mZP)pOUi%GG?KW2@;Rk&3N2zX5z>IFKGVvX&>OXR;l` z*?+n+0bU=PX+3gSF;o18LgGIA029$xYP>3smrOCyqo%t|@XW{TXS@9i2qJBHg;Ll8 zv2jd(KL6>Z4P*mBZ4?SIQ%RfJIFfeU!Io*mfulGo++H16$a2P|;W|g?fD6`hS(qXO zQr}82!t9uoH2@L^Ar_y=Z^RtH^;)nbWle|qljeXBL_0q+u_dWEhmW^d;dz{6rgCy} ze0ecg{$@sA(c*wob^JwVR=n>NuA+X*zXO$o)1v+}n4~Fevz#Y#oLeB_Ma~=N$}MN1 zR!EMMdLFGaw4j0hu{=(=?D_n!-!@T-n$e8r-$kHqzo434KnfuEq&I!er6#7NXu@iJ zUWEiZ62}h3XSbze-VLBqspdgh3_qe+UalP@DoQoR>onRJ*yaKy+(VarujYiYUJoo0 zF-ovrShZNBpoYO!<{wgK(vd0u^_^qLTSOI|$G3gB`nsv5Clc@N0c#us%+A{xfAC? z6nvbN+TtCAviLdy7SE4nj7A)kvrY!BtQv75$WB2~;PzxkZ#YBoO`ueULPtwQ;HmlD z@fO{#Se^4i&1k^N?Qv0wjZwrTag!H!$RLM9xAzg+(cV5oxv8_POVci)4JzC{_?MbO z+-BxhUH|yw4_&O|guE12k*;v8XVP#O^GuWkk{$y!fr&F^Y+?;{;30@XxaN>1@0=lL{~+;ma5Aai}S>I)`d+_O_g5# zqa;E&fG0aEtAR`aHgdyUE4Dzi7iE<*%9u<6b9+3=4k3iecwmX)WI&-G)Ag~@Z4~XV zc0595J|~ir=OW#c;b)2{XR+gnX_0^-=LpH>KFamSjR(IjWDGz=jQl~4ch0(i&cdl4BM6{=HSl_mg_Qka2`g*a-f>0%QSTu>E) zrFciJSr#c(QUyXFn{k>zjIUC;mRBtvdS%rlSn>(ymv$4L7qLdHp2Sq8_kmu(i3`gs z8sO5iJaPWA8-l7VL{gxI%1i9IF<}BbJVCo0aw+!h&Z(HG;JDpZMkFm7@#BwqJeG}= zNRhg6!?=@teAi;)pc0@=5hK00!k9(CB9mvT@13+69t2)v8jTC0ELd5oE0AjUVFVD_ z)Uzo-X{abNJrrWtVuJBy_FHa}qujvh`R$}}g)S=-iKlG1chnAPr#vJH!JtObU$$+z zmOHhPq(?C{lc044BPCddT1i{S^`=tC%vle9$@u&8O~-Mozw+jddd{(tI7DsPgMKWVo``eV<6f$qwL;m55rOi>l;U2&ahaM-DhMP&0B8>s{CI#P5+hh`MFeN1`3_tpoZ{OE z%#(+3p1V_#lb2`8GsSr*);=-Y<1SCId;yf~x3IV&i^s~DJd%q%BBbTxGYcJJ+-6YL z%Y)x&V!u)JsAJoN;lxkpOHU6*&flO$GEPh7!2q(gK>89=nW`>xKals0YRT7tnun6? zvV9BJ#9b{ks0-e=fB$-}wd0^cZTSl={S-s!2_XOw8UAtN{$UTDB9ifXZEEPLd($Sn%ItsYPTqLG^I_zz;h*|QzKt^sw z!H%>vTXA)ft|D|L$k*2ep^fb$FDXYJ*q4;l1Sm?@@`c)i(levC+d7@1PlQoalP#^ofw-k6w}eYnTdi4>kLM7uI*eKMOcO)4@7z%HT{hZ4EPh}RV1 zG?RFY-BDC-@51NL!yy0eq)s&f1-2}4b%E<7dJmO(88icQBgw1kk6(>MWMmnD2-(z_TYSG+Q3nz#%DmB zEM|~){E;IuXueYKs0_Vv4ZbC~hJ1@cZ;+EK2a&&|`d?mQD*j$5 z{?3+_cMdO$=hae0boEZxB8dV|evnu7`KxnL`DbE48j=ow2K`G7Sm8P6!`bj~4Qi=S z5VlnBf{J;p1xzz*fP_ujP!In4p_Q~*-u!i7E7~ltUcbH;%OGsX;XCE+SOMK|ILQ)% z?-;|4nXaoP{Nt%hgtf6~Q2{24hVB)3#PvFjFX5o{V)ilenlu#gITkBs9DsHqRwsgQ z@mQ~mi}OrdSBq(7k6ln}dXjk9B`T50(&AgbY|59E7CZ+|VA#i~j()2?cBQi-*HGFq zc3D8Ekzp%uiczW$))pg~)x)bTpWx**$M z<|?Og6xf@LRjXIq{rlu%G>k{xQ{d zxj+MD3wl!V=+U&XP}PkRr}@8y;<*VRjDtxCZ?-x=<5Ec?%Y==kzQ;4Y26%0L==9%M zyaMTiwz09vL@r=#m>F&gn*E}Hk=Z0@q|>+>wJ7*u|9{RI(7|goaB0`D7VR{Hf`ZbT zcYebp%z=XE#U(HyP1#6_7%ax}NQjRPaOE_yHUmFaEFx&Tawe1p1}bsjV&XHOh+G1& zRge!Rczd@JXa}uL;h4z=Letdo1O7JwWnv5r!^mOeHHW%ZjF!AmITS?cRT3T=%Bcj+ zM3$n~rOp$7Wg1coRUSTOzU+ZsOhN+Qr-m5OkZX}#k4DPbrk~#zoSfYf;z{KitGE#o z9o>vo$h`Rt^u?KK|F|z8B7+0Eq~M$~r5&PN+@j4Uuzt9*OvwQ)JB=KI8$u=QFr$7cz^BXTZC0D;8-}ZhE_YE zqW80+riyAtF1%w$B_co^KY8-VI0v3kpoAbGLkOe`=|%!PR}InA>hrP>@83Hh(wm>! zLC)^D^_ujmh-aKMq%XX$r3F=hAS_A@R<({F++5bvr}Y~gYH>4XV!CCyVV&Rl3|w|* zQK=?FubNT+xs2y5I-`9En-VkN^`fV2&{iP4T!G2L>!HcK<`xw^-=r*+^p}Lcv$!EY zS6Y7Rc_h0MUQ>?p*^^5fJX?Dy$bHo@BVXyX(@r zB7Q$n76e=iCWw=<$%Sv;Xt643J~EiN0d7={jST|Jx_57U>_rX{QR~#H6Ga~ly-bc7 zz&tZ`9PKU_Ep2=Bkd6cN2+hHRFR~TXhv4wxmEl{|#)&~9ik3g(SlaqqWXPeePh*(d z=P$IAODBVz6zYN)8AtT@g3X#rG2%z<7bq9V{;N`SqCR;YU(C26TqIK8(A-ms7GoQWCC#*TWg`Ap}{k`{Leq_SRslKNKs!*D7Bv_^~=F5 zI~e@!J7b0rjP#^N&Lbyh!PQWgYvM%Y6<2=3yopckTb77qv0hV{C}K8j=%4vR%31+L z%xxqgDuf;#J$g8gGL3;yP)N~l$2p7G#P`wrn__kuF>++rrQTod>uXzzX3tRdO@u@+ zQ$#m|VOS}|r%zQzbG0zL1pF0;5*y%{$IQ2eWG<8ip+NAZdz`PYuY%+axs8y|p`|T= zOMsfM4?A9h{RF^;!Lmt%HSO$5@3@&1L=Y>I*+_lsaI*39IeiAL`lv;f08UB@{2a@#ziDY`cm?=7U=`szn5NCj{ciG^w+XtF;`f*PL2UXBiNw~G{+*zy<3#s~r zd}GNf-Oe5&n0>QX#bco}8noO7PW{Q8(!rX+tI3i@&~p?XVnM8m?8(S{O$Z#$YIYR!dlM}!N5(a@ zr&XDfl#Qj@8IGl4B$1(OCYX~qw5_R30GF}5_z+1PG?~=|FfC1G$00+ZVp6Su|1>^_iK-{4P@*E3jCBEG&6O>3OH{ z0E>uLMDMu-Mb9vyYi)J*}xtO#-J|M5q2wgMaK$jP6w4jnvL zOlQ=sJ9my$XbR*GoLjcf>Uh|;5-DZEJDA`osC$Cws9dp0gP z{VwKNRUADs3`qpOA70Vd{iVRb5;)^cyetqkNgs4dVzFmn>Qdb0V&fpqi9!WK#M4 z7L}Z(5k}RP0AK)ACmMNm?(vHjQwp3RQHf7Yz+f(WDZ!y&R+o)}>T7`WE|6K#{g%Gj zi5*y6q2iyQb~Q-!V1mJAjLgy~DHQ9ePn|vgpr1guWy^Ii@}PT%m{N$xFpA-ydrL$K z(*Iw9v*#i-DB#mp`!211JL1kXK< zPT0R_ci@kRn}#r%2v4K}L1pz!kzrt26BNfQi1#^07=*)UI~TnKIwWFYB+yCvIc4oC z=tN(`d-yrRdU;iuF2QWVvwrKmfJRLT58_@?A^oy-j4R1y`302S>d2y_2yHKYMSFhz z^=unMU3ZJ`l$Kz8Xh2^YVk>vW$9LRrJ$0i@*}3iJST%s^SJ?Y^KzelrA<$<2<9?9I z;fE`pCIU`v47=k5hDYu-n|XzD~jC(%f!$^u_IhB*KUeo$ANw< zC|F4pw%cFdidP40zQbD=t((7U2UacGfz9w5z?Dghu0o8VaGo+bf*TOLfZQp7JZ0av zST>yAQi;#WjOKoJ>ZdB=6UXYdZ6NL!QL`JE^=FaZ+|$1$F1*es4r{Tj46NC$d~`02CpqjVD37*w zfkvzygGAG)Hia4c@m&KF0(i%@)wW!k4bv`h^^3=ox`Mx#OCmONb}SzS+bj{1s#d&e z1o?1C0+xWt{d7S{$tccQa@@4}^Z)E<$E%n02%9N>ny+5KJ2ACN=XnHA|KY>dQ-eMj zoW4`9kei?ijV?8y_h52h)ZI5sG%Ojh%|6O*m#y%l0#V4csTz zu;>G`^n$hAP*;>NApeAPf8+lVFYb-9|94Mup_no89kdhP(oD)1IxHC5 z?i5pIPnDmAD^X2B)I78DLrQ^%qm!|iWb?l;yfB6_P4rYM=rhvs~OP_dZ7N#m!Q5Ch}70S-5jOl-vQaz=l9 zQ^99ZxapdhY(gH6u9&+}WDdtvO~@Mhl10$BAjj9Yu00Yc$#x@^2xL zNv7?r`uIlI&ywy#b1fqq1ziofFnv!}F1KeIl(cw?#^G)-bHoX~?p|!hq#UiCWvl{ z0XIHTc`4z`l#Z#Q;7NlhLP{3(R6yxm~PMlfOyIxprF%2zh9 zO+>-?_-V=G|L#j;Ir$3H;EKpAXzcE}s$I{MwD3ZLz2BmOGcq@l^%8(ykL%tyCspD5 z8c+z4pz=atC{8;dw%j7t{Z5XIFmgARJ|dbl+uN^>;U)UfIite!q14b}kl!~35uB6{b?QEr=(Zqhb9aLQ{@YM@f^l^rTUlC}X4?^7b~vN)%%bLz&M^W4>2{ zaYsp{(jt79FbpPB`pWV=_rfUhFveu84w4@tq2qk)cU4@?;2n{ASeJ>!BOHOMF+%%r zyr=71(V5FXiZR9OI*~dTs&Ewl;v@-1Cu} zQim{-3+NG-a=Hr*j9FBdWQZY*hoLp$6oq%$XXrPz%_ykNDMD33r zoANHjE42kg1kWy`K%)VA&@_fX@PF9G3bV$nBQy!`;$v>2Ya;BEJUclz90CIX^d?ny zUkIlUl9O>+xF@6@w(Vr;P8kV-6_Ql~8oraWT?y?q)V(6OWG^#E|Nr;w%zPC|pkx*R zDKTaZ(+i7;iOO*nBY(4N$41CSDy8^T8*A#GIF_3P5eor`^39z~0{PkX`;RK0!F zO2P&pU4nt^@ub`NfB(IX&MFRl%4q^-l&&6`mXah^x~lT0CQ$2!m|CHeIl0awZDcCO zreW*`QAq%CWa$o2o45eQv?X1h1fjIhqzEumhyMMII|uqQFJ-8Im+g@G7f$alcj1xt zQ{fQ)Wo=be)p1TWm!?MOd1VYBApyEUdDdfh-v#ZtsN>Y=m;uZVrN_z^vTN%gb>XOKOfv9s4i!bF6D?+xiF&g*(-vi zjSK%tve(z~Ge|bfyKn~ni`E5Q9MMe?La({B4#L~g!I2FS(k1=YTuG8t74*hFY%^7a zSU96<3%evDyNr6en)>#x7eHSm{|XO<^tn76K5X`^S+s9V^k0!EGMX$d-|vVF&Ww2x zX32sRU?#TSK?D@8U7i5W4ieE2AI`Q{mtjEEJ1)U9Km@c`0F1R;;B&IE+VP(-OiUO>lRs3>wIMu|0(o0J1q5FT8Btuzb`1BD3L%HKx> zikhbgk%FH`FP1N=9GPB`J|=#L1IpJtVPVnuE)zX&u~s_oQY zcI}c;QPuRl<#T8gq~S0(x7WXFyl1s9`5qk|DFLofEF7l*(zBm+B#GxIE<|#=koK~I zq3~34@$YY^u0GCmEK%ezj9q5<6GiKc$~BK(+ue}?A(ls>j>d7OURN_(T|hPXDD#K6 znKRx~G!6{1NQc@}ru?I4vT@4UMHcetIbRzk0}HEzlT#xSe>P#Nh$DNh`8@d)Jc}oV z40stWMac1e@5=RroTP?Lv8H*CJ z0z7{3*378K^d?w)Dqy-VeO#U*bvxi!KvjyPg&ZeB>% zx^??@7E3N?yD2vw&omCIrac3eXmWF^DLi6o7}uSCKuiq{uxv3@Nv0WqS#(;p`oXzM zP1c*ZZHZ`7$kCG}#yae*)ll{jFrV`hwNuW4VEKdk$(*D%Votd?bEjb4LV#(mulP_J zdE)kuZ%wyFrTrD*dogNyN5wIr%%t$qg9qXU@wEA7Nyk#QgSj{C0O?JorVs&%aR)i+ zrYH*xu?V9np*eFI8N@#XDl123Z6z!kJ!({Q1~JGa0G2|o5y+F$Xdv8tZiHP3!>k$p zqlfD|gp!l3Df7nYLH3lJ``9~fi4BPY!-=`Lq{d2yrRE5N>EOZMz9NjB9v)YOpK1X6a zDUvYCPo1v4KMwFGV|gfVo!~Zw;eiIIUKglvW34}c2QGqNz_gccR0Nn2Rh7d8BdOqQ zS6flQ8Zm|qZbhC<+{%Ixng5&ZnXz=UJzh{D6|fn!eb$N-jKZN=fTht|*M2{7Vsl)a zMRMFJKqvvb5K#oAGJMNa2VS>8QkSDA*+!x*5U2sJswr<>wligiWhC930 zeT79w{t)?|0;srD;)bSln&8iK=NxxhhGaa4=$4#aV-)w0$0l}JMJ5Df0H;PG*8hBK zva9HSv}UX96dZ%bpesPMj4;5P#hk>i7qyda{4SlZ8XCgrGM!7}lsR*10?VHU(`*1s zmCf)c8+)>KmDF3w&Vq6BJL33g>>y++7A87)_6C^-mhTaHF zN;}|joAIM`$V*2CD_ABeRnF@-m2)OwQDgUijHe;im#T@HIQG7@M>9j+4^B$77T%Y> z!RPyomPx2*sJI@4h;B%vSB)Gr9Zi^L8VrqFJjJI0djy*v7J+%II zscg6cSH>^e*#OC5aF-S)n;~!I1VOPGwzmuH{4%JO%vchrg-b`6%!rK}4ZY1tN%`Lf zF*cPB6=|OVw>bMB)*~Y#Ud8~6F4M8YNUt7jao0H}!??LW_YRI`v0U|PX$<8Ff;^s< zRy0Ql^-of}W3o5L&oJ>#`V+b?vp{;x`|0eQ`hm6};i9{$E3hVJcdQ#o72jVZT2lL^ zk7o`*91AYQ`1)@flQ~EIsf78>2y7)HtTP8@%QI{h2c9ggn@9g*2U}a!XhX4R!7KpV z-Bwb03YY8hc3$$~!+z2YLZ_vumFPHWPQ?Tp%8DFRB}v2}6czPh^i66pMzfYVQy%Z( zP`K3Y$#k-4FxS-Tqk00IRZRQAt$8ag6Z@`&yCi^xQ>cmaUbHuvy_W7G9wJtupd5MB z)D(pr8r1SpN?TFg3JO%}=Srp0l&EQb>Qgr`j#TLI(hc#CuDHnW%Bq(R^{=wMm*Rbw zaa1(XDX{tI`-uri#*56&oPr)=nQk+)A=bM90MZplT3a z0EsQv3wNAx-}6PO6OxYb^^D?^s^aF&BUeAar-E_{do@F-E~rz%T|l=m0ZQb^JO~x@ zAQ)?>_Ira`v3zoYG~Z?dZPGKj1K`S*fw-9CwOaQoOKiUt1#m|AH}b-CrW5%3V zDDmiu*ATW;Zp^m34EjUUP<5;e$xbCJVfK+Za9=Ff^3>@u%a(C<>El*V@HzdN{?$mm zmeN^fkvLsy1%d8UtWhryEFCrSIPOkSdUdg%gm4c^icM87k&-d*jb$V;t1{}Jk3lS4 zF*N#Q>U~EZMSm z??#ZUf>!?lD6IiZN5ot>jY|i9b^cg1hx&2(_ewgU{uu^M7&3i$pRUf!X-^8%GF}Vq zr*b-K>F-^T!3cZlwf@hoy4_TMf^;=anqYX`G*fp;zu@)xb7tMw`c=R7>v*t~rm%Ip zcekMz%sTl?O%14Sn8&K$82ctI%(S!*@#xFcJN85Lkv#(WJ{{uogb0v%S~xD#z0ddr_yTtRvhH z$ddqCiJJ!V02Pk)iO|){mshVk`xk>Xvw<%{r%Ma26t+#8Y_0-N#0S^ci6!ICQ|UUF zNhN$>G0fK)dgEn)9$QsRs3Id$mD+NA2fsDceM zf-0}oKgp=6`BGm0fnZYvMOR#EGLrqzfaBaAY(a|4_e0YsF;+4MvRdrZGWI=|Lwwt# z*u%cW-T`NpeVqf@PJ_WuDqdAl2tiZL84#-Z)|UCqe2Au`j_a3W0&s%VtsMHVy=5ZM zL#TKeMFLfWnnO3Igk~=P2WJBxd_=U|G^ZNDz}XCmEs0~+ri)MGcMlVF_eu1iiP((~ z{x~iv;4LkI1}jF4_wqWOV?Vb1I(8p6vZNbokVs*$GwSOG^5f#OVQZ;Vp~yrQ&mOg@ z11RkXrcL3cq%buayz(TxFH!VVJIMs!-~At-si+TL^Qkk%6f!)U zCj_e1oMxin@)!Bf(QLSV@jGqayVqxW=(dX&gCb2TRXPbLXspEmH4XoIZi{vd=nexW zUzRcCu2qX7?5AJdY-;~W%~!g^7+r~x&eD0DCd^fyL_T;;T>AS9;+{amNY)iA5Qc22 z0F`c`oYv6{6#kgm>o9n6PajR1Fo6LjLvQcivBPVoc9c*gkhlMJT#!U14g>3{KVvS8 z#yCsmV$-{K+~ld_32~C+=pyj08!QG~+ASiE68xI}M+?jl7LoNd81-??n-2Amun^r# zlkHBn9u&;9w}}Pk3=lwe+D#c*_u}PP-;e%~(7B4zFeYPqYTDF!hh;A1er?d2WDzsd4imAHo$txC zv@RdBgV0#O=_>;n5i-J3g) zbCns!@=cV=hNu~qi#CO3h4&6;*a-Qfgeb#gj_*C@lqSwJYm~yj9?k|i-QJCC3hlx4 ztHDfAk>?_a5v#T$^wR^3QGySpRXQHunN5!#D@zHs3CmQ%o2=R{JRs@wZnGZ77GI~)!_4b|L?@_@4b>U*g`$RkiX zTPI7$y@?OnyWncEKF5f1kMQ4^7P~GVbW9ZV1VrGe8bYxcBZLrhuZkdom5vLh@oO?1 zg=1H==yOHj;awyG;?HSi$z;dyaQ16}vg zM8c}SQQu$6fh9}gs!+=WpNlyp|NQr{91+*YA*x6)#;Gtd#^*4(UDW}J3xZt`4|{_r zDe>r(#fprXf7EA$HGkjmxc-m|lkI!$ns=QtsnV*?_zMYDROGsh#Kc{MtkSCgQem3; zCw9`rYq&kY^b3&!Med{VbLgBoDf%{WHG9dc%;5mRK9(W{?p~9oRNU$FLRu#j{TRxdq|dp|Hg!H zDU;tgPC1PNM1wvHsExR{yK>;_iG+iuCr;GVtJUrsY8UGL!dm0FPUf)1FDteC%y0NG z-5|C0x1cX|_0vLfqu1m(rj`65`;w`f(&EUhNGJoR@#lW9u;|#c=U5M`X5yLuJ}L%J zsC52A)>F)Ft$F}7rNKtto^H@&Y)YA&7r%j0KT7xAMu%F_#3&7Ra$xcF!^>DU(uf%A zvvQfxQgVixxBxi#MwgxmOg)@F8ATynLYBfWAtPQPso^rpZpE*Ac4_>SDHpH0H)p@q zzZ~kx^Ow|2>j?#OdzqEzlv}^S1L8uo4*>MlFLxQS0u(US*5m)WXr%({yjc5R800Df zG`fe9y;;CPpamQlJ9wop1k?nMpuiH6dq%H9aojj_=E*rrS~Y7`w_r%dyxmovse7wZ zTKBFyJ*EE9b)1iIuJYuF|7=F_lHG3Es+BbPyBzIGe_IjQa~QY`j-n|X3vFKTRTG~0 z{q&QDxA!AcZG#I(u^&k<3&)1|L~q#O1YNaX9Ez@~sJ_zW1T`H^q=-%nj3|Hc;s<97 zIWqE{bl(6jDu+TDTVez>Prn_EYcT|Ut10_5o8_1@;a?u*gp;#$Ijrl8W?E}|_9B9| z%tRbq6gE*F=8t0mpiWDJSGIwU%c8AZRpYVQ#;hz28$^x4Jl|Lcu?GA%SbXBmTRDZ`!UqRLITjGyOCQg}J{hGF5Sr}g#! zhp96G%QmvRtLGrU7)+|i?xEB00MQcgnGa)~vC(dLa7V{#+D+9U4 zq10%6NvZmn-HZ{^(Lpl^9#8@@=^aD_(AWGjbdtwwK6jKBgJSbAU&@}P6f|&sF~v^0 zbgPEgLo9gNrE@2Y6gxqE+;PX_%-`zm1~oLsoc=ZK4#t;BsFTE09t4y5R6BYHaZ9W{ z{uL&(5N8-Fx3mZ_0rM3H31QSw2G1n9Qtq|m&r5MnV7t1SQRycBwZZC63+4iGiC~N% zZObG~+A!KWEn%x*{ma-?;3gqo#4uo*(DN?ZJ-`bY=h)Z;cY6=IOH|$leU5Ktf5SLn zFBP~U=aAE+-_>-KNQsy`L#q;zq%x@A(h6ze<$=!_ym0%mV{ITOh}B~9n*Iz^#d;sf zq5V^CKy z0OcurquPi$<_A7~y@ArY(B%j6n=}!TQ_(L_DNFOeriV}i;nj)gyAC%PNu1JU4-6$( zmLhvB!W2_fmdtq%@US?~SzrrKdR6sG;QUkVxjRd9gC|;dKuL1EjG*{Na6NV`>^T*t zfQYAV#qy~5mlPp$}~nydja32$AFC$0+d*1AaZ2KP7%)0n@35HLkZ3 zfKAGL&4#K2d| zOngRo2()kOLqcq~6*_pZ#oTV&*J9B6a~BG)!=U80EoPOEP@XB2#U3rr1bq@nY~*gp zS-4Bp?%%qBT5pxUl9f(PdI)gxFri4El;8=(Lovkk-A*x^1MDNsy2x8O^sU{oX?367 zE4^1F--F9Bp?AzN7}kPA;tk7hjJgNQKg{>=e&)3dSa@C{6cynTQc0h}02(KzkhJAGRV8(OHNb*qMCFZ}n!F8U5>)cD>=79qXuq2iP7BZ)yGO{MGRCv@W? zuorV&X+^Lgfii#;46r}?@yswFrm)xTA{dbn^c~*(E@Kw7pNHVBw?)i-C;YxnFCGef zvWPo`!%Bm)uR8zo0NVm{O&j7*pdjP5t=NDC7<``LQLa(3n9TUbG5Z1)6w~sUzz9r3TId27Esr7@f^Y}rEn3gc2)P^XRS9G?g z?3QrH3Im~?!w9H`%y2UQ-+dH1`GtiscOHoe%L1IFiCp4`MqhTIZrW;U4to4@;$Y-_ z#>tLr?93&_SnyLh*rChR82!zZ%~cdZl0l?0kvZ1RtJ?T82&}>j%%M6GHj6k&Ga(?G z&A^#h0)N}|6o0RY8KUsD!E|V_)Rw4qqrF8va-I96v97V*%jE=R%ACm(rxe^>%Ls2_u^!&|^98L$sX+Y{U{fus>kU6>S+qSj;a`@08M7yTPqTJX> zKpGYw9U0d&pr~@9S+B3B85yauzb;jGJ&9ux3V=H3DTpWHh)~A`$kcf1I7uSa}27q8x zWFFPvuwm1j>BxS3`R~bIq!XxWBr=L|Dw>{|sFTs4R|p+*YOA z@WmC0Y-k}%Pn~>bmbO&cn_16_nY~d1^WV+b%}Uz_^CG&)`G`z8ar(tvN|5qCAmi>8 zAoyX;9yy*>72;U+-nj4WB<6*PC&00G++k`4-@b=@wy2O6Ume=Z(`%*NQ6G$xK6Shf zsz&rAG4p)xz}{lhK_H2^K(n#)O#R=vt+I)NO)p39%$XV;;<;AEV|wb_ay7rzjg7CW zeKP)a`?7oBo4bkcW{7+Z3G_E7_mpn8Z{O~u6DSa=8T>}RfK^_5PY~RlD1k?{q%r6~A6x=|W5Sqj{{VW_SQDOMiygS&o zaSrhwC?7ucjrr#aN0;`Qo|^aJ{rfDUgz?`o@ZqGM?~43iR!V@wZCgEO+s2I>D=xu_ zr`77IJeK<36Q}91z(7T9$}_+v8x#lpY4`}VOu?{L#8{Pr7Byz$(e+5JXRjza`oIk%;fVk0c&AL2ZXi<0x zhH-zcdpN;E|HlS{XSCOmp9SIt(-9!T#qEEjyjkAf-Us62L#Pe#=~WS0hl4|_2VoFR z2LMv_0VuC6@#Jgz_F93jrpIf|oXUa(H9s}Aj4Rsqj@#3I*{hqVdge@EaFZAFzbvC; z`f_3A#MCp(nB6U|d^8-rsB%+SGX>?7`I6*6Pn}wDtTBM0axS%~OrS(&N&palOrK-8 zmBzW@BzkY(ba9Q*_oVF;Y(&@D{3G9-F_lncjpd?LH_4u$ePe(inf} z$QHpC#9gJ6H&I(~Z;fVc4U-ii4_NPRIG|I}HuqRGTN(wY%G#B@h(XeA^Qma3cpRn(0-OOY7%y8a!GbLx;i2hy}Dfs4bDguu&ffYcpZ{R{zHQF}r&HE@n3LP&+LH zMzk@X)*~1BUp7Hr=p-G6EV0@A!V-FICw9nMOeyu)BQ+SMZv1~AU;R#3B^V!gC_vtn z&EfHf53gr>=`fF{5xLQp@?K5>Bmi%jHvjdP|C^N079lLjWqoP`ZbJIXF>R$WXU3=W zy5(L${tj~mdn|G5t8>nxdl&1{+9x#UWX2%6WJ(S6L5=_EJMr?!N}0G4;s_#;!IeTg zi|ZRFb>5DR4@ZiBIv&|m-&~@WSm%g^`wfpqziQ8w^?%$yYq@^xr*!uHY4o1j1m8W+ zF=MROHZ*#?d7u^)RCcfTJ{AG;+^K{eJDfQDZcg~lC(oXxSIu#hIUxiB+(l*20vJQ@ z>fb%aK&T>W#L=$}C;UeFHJ6}l4#Oam{ZBBjx-(_tb4WksUAqM$i_mE$;9}!_D%X=T zfq>oJ?n7sW4w_QUf-2-Zza*|VR6++&o%#WL)V}8Q>TcWaen>o(5wP;@CAcq~i*Q=? z)T-jIG1$!ZPVppwZD7+B?%11-_KvC?_nZgHf89j8A}tqx+eR1^uza)IXoCkbOUum9 z*W!Cf=f1Y~i9ymyYwe~@do70!O|d1Sc>+St(P_1x+zpLwzqA|Hwokt=k6&e~W!(5B z_4rZfCg9K|)U-@&tVn`6ZH6Fx?$X&eH#-|A#!=3#@fRq^B7Plo@wA$&?&&!;T$p=A zGPp@I;OrSM*uVAi;nvx%@0cVBDfhnwVL~&`Q*O$#@aSEw$Vfo$BfK@t*(Z1iuaf9+ zu26&k>ttZV6DbG2@42LfDCzyjCjR$4_eaoK@FG6T|qfVAt%XRB1Y7uoN@yDXkvcY!(FEb z3oFXiHR=xBmIyi#;>ApHF2d;@%ta}@d;E$E&l;66$`}BUZ1z!2!9S{8_gy!!q&GrR z;7^$*Lazpxcb)b7SyG%f^@~JpsML!wolJ_q1$>3Dt0Pgz*zSBl;|P9S77$$7xS;X@ zvVy+LUr%;$!rg>i#pnS(Anzh%-@ZrfEqkBjm2Gn!3r0h~y8VuaEWpE;fVa1v>fw-x zD8iA~U#RdOuMk2C$E2&WA-H>sQ8undhx2d#BwUcU53@L)kLGTA%pn#4f>fxBf+WI{ zmO^cYgQO>t2nyVdB`f^LWPmF|)$mTa^KA{4SXiLY z>1)32!i81aG^do8m5FN;v+7YS!GWEIIC%Q8&N_-f%4DG_HFz*^g;aU`5KLYQe7~uJA~ZDh=?FMWS-Jn{dWGmdDbX%8yGi5`-v z;0y)`k*R|L`2eZ5i!Y>bcEx&q)A3Go=FEYkaG+>u-qIyYL@=4oAS`5kop8Q5F0@;i zXGpss8VU5KPMdq_d3qZD)cV~gjSI`wgP(POe1%e2{;f0&;63qEe``e2BQg>w(5((P zb_3P{G?v5%zWiuapv4HoGFnS6tE>f~G_eCKm)7CM%Dup^;)4YS5G6}^9@pG_9Uxk9 z8I{N|6W}rjyUOEQ|9iUBidw_)#1piWl_JWId4ADI-(CV^qVmU?KkEmg0POv3cWCsLR?G-T zxHD0+a;~r>16L;5qcni{MF%UA=131|^mj9FW=ED$bkOCfdzC+D55kiKmlDW7TOfyp z_T>hN6#}*seUFd-ql1dah{W0tJq?S~E=AFx30IWoAGC4f=wmm|HR2{Je^8Vkpq4&s zZ6YC^ut6A-U|;{5cU|1e(*NN3i82Q-s6@!j!ipv$+hPZI031H$sna*wMAv}CqenME zX46|a{y^_~1Z5&)5bh*i{j!qBwbgfEY0a$0yhqbV+wNMsSkZWEdZen(EiKa?VM)tZ zoGUt&aOz=B*r|v7kHkasS9l%XWZyG>*@|Y@>Ka-;+F$w8C>@+|_hOxp=_ z9(@%FxFCMQcc6$BRv@V8{eFF!M%WP57DH;1ao4R|>7NQ#(?y)eA&Gd1aLntrgmhLl z7j8)Si}Fg=-9w__{>{0q%R>9`-{$X*j?Q(TvV&3{w3FoBLYM}SH;jypb1rU(!rd9$ z`YN{)TFCZHJ4;X2m;|@9&QH7!J}N5U>T2(a(^@~qgbQ8C%-goN?%uT}naVtIbB7_3 zPO=h9;%EC){o7bH+&W-^YiY*4;m@C553>HnIx-(?9-2waWvv*XmqJo5%z2#yZ^w^i zgbcS@iuQ%SPaN@+PfQbrE&Ly(4WqzXid$x3G77GLs9hVG;@5h)*c zUriD@&IOwW%na~>)b97LM1`cSK?E{ifUJZUAy+;1%W-qI{DQ}ZoH?^3^xQElB{zb> zS%BJP?R~=}B$OUZ%%66$A%!S1rvH#`IOO^kxT5!ZWZFYM47P2jPY2SK9(1bP+SyWe zAPKq~YaWeIM_k8n;_^rpdxgXx)25RqdEM>~VIr{XX{^UZ4ZROXM~za^)HEEj>tq>{ zln``d0&2=%#Oo$rc@_Avt|miM4b zI;9+&(mH@uhVR{cRR^zcz=Z5}HSzb?rT3PVt$-fh2;F^lXIp6*RXiL2rBPj*@4y%F zk%p0aqYM~KO!I_o3#I0)k2lj%cp)u1{Jcy{w)gN_Selm~z0Ds`E*GXbcycoZ%-;d9 zaIQqV&h4^IBx9oVq3VYmmltgxC&=cTISl!!-)SS7B1vOzt;gZDr9yE0Yn4Y2y)F=% zUe{=VJEAVxYtU6b*2sqC6xM|NgQNxE^-}ZwSg5n^}W5u?;0FTHkT>=#8tLe5ty47KaJ6@W*`|!)4zk3C(EW zz-R*loe)ugTev-fpuzVR3ko{7({p*c>00wjS}TuBbw{aRnYzoCFpfnCNq+_?s_(A0 zWG3PI3BQ0$fsax_bcD5x>|`4~!V1~&J8=4wCr_VtVe~^R#eyYb^2D@0u)MvUY9S!= zi!%_nQ7ob2`Vq{^v&?m#YLKF{<=SkT(UhH>NpwX8e@*WxZ+&fZsXm#lp4aVM>r^Mn zftK0#_+&tXKCJxY<@RCStZus7msW14n%Hfwsb1`?8xfV`_U^?C70=IcX1&wKDtb_J zX+YS5wu*Ga`9v!-2dXdGn@eRt;5uD&ZxQJ(iw5uhqGOwEx)38|m6>d(p)pV>)iap- zOY#guB-qk?(kAvU$&8LikCoh<+ab;_F2T%sEZSgh z%8?QlHYI?}<0WvUzBFMR4c7oCmry3AM*zq#fTsnxNGE?F<~*S zbwc=Nm$`gk?#~x4xZuV@c_xomnRaSJhFC2yH=J9$cYKdv{$oE&)lfIEN5F&nWyw1b zMTN}2-oLh}+sJqqe_^)(;#rMqL^f@u6jBM_$qCyc;P&+RKyDv0$| z(P}7kNF7sN=Qp#~>Dp3D_7UTPahMb2dtowfbOWZV7XR{$sHt?hiK%{z`GB-kSHka7 zIfIs!=A@kyp(W)j>z1x1q)J6mUC)~p$qOGK0c2AV|9;B z#!Zq|Arq2x6%kNe1PP^Zb8gr=pCud_ZHG)_K@wf&E8ic?zC=7^dH;iiaLU>_v; z45PAw(iZ|193X0o%t@ z9X?falLRV_J96aAF`eJv8Qwfs+1Po`EI6@0%094f#-H8xoZF{i)x=82N{3k%gH|0_ zg7VDn-HSP95*2FSO?X>i9=ry%)~&a9zOY@NyVE(bV#RFbQ_wO}1d`5X!om_#u&gSU zw)@44kcE@96|f+MpNe(R51a`oFq_PbqOLKvm$|l-8pk@@b<;Is(m>;E3;5AQRRs-0 zHgyFi8$gRz4V6!YN{&)-q=Q4Knc0rC2LwJ(dBT^3(6HfUqgd1?Dq|NPGNq-32|wsVSD2Aj|f2$`s#S zHXK}%nO}8wE_UFHb`h3m+(uV41yfi6d=;_E!XMWJ+6eY{FHK!(`DJb)9r z#VN)C^+m9?QG{jCEjlf1dwr*bh)4L7vTC?q%wvA^ zSzRH}9z6@IxAlGZczLShc?ML@A;dxjMb9r3#qE@(!pKEJl zlRiG>o>8uKbedIK3(7YzN+Mx_$57u!5Mxt^@vF*6Rw7bv(p3W>IH*{sQ@A->{W9 zB=}$~a?!^9S?6JX5zV7^U%E6LPafkD0guII3-4#~pF~$YBA}re!3kfIGx72mk6jjf zKx!BL3!`q4Ym>Y(*Y)ds@HS*NZW#pAwvh|=zIyqx3;^pWHjA;Qe$>9c!qoa;tXr+v5pp3m>a??>_B9@p!fLI<$KNdJ7em z%2)6Jkmr47G-K7_2mjBLt1JNRg8Y+5w?hA4aKuiF?Kt0rM2=I6bl6k zFo-Qy6Uvg@z)xf`HKVVbBV(>1f@E}{8(Tvdrrk4Q-cjTd%COf6HiqmEqX{nRU#=0j zZo>l4ox8u3;1;i&o^0Qws7Rsye(T4NK}UNezkD!(ukYVb_ak1uml>nV7PsC!Me@Dx zj|wZpmWI40cyHoI4e}&u1bPzW5_^X=L+pY`ly_q+J8xCi4H2IAV0zsY8zd|fh3z8x z`a7v&)*%qOQ1HbZi3TKl_l3BZbMd7^Xr&F?dZ2p6<34XOdRDdp`7KaLgfs1smQxC0 z?yj6wfa$1$tAmxHWCW;J2*Vk;{907$1I2f32C%E_eS4sj9tT@8lt%aT48wrfdIr6j z+#oKo?}hPX6n-c-(%4Z52J4;<_nN2E!=QIY-jEaS&ooDks-ooM+fDi1)5=g$SC@9m zFv^KR%Ax8xQv~^=qVd&^c$^wQ*NfyJ1i?f{>hSP=dYkqeZZvK%d=_|JSPk%-8WLYiL|XxOF(H10ENeU>9Ai!K0cWVynD zy2hdNDon(-NVJX=98pD0makYLwt?b}KhQSqCng@~=Cc44nTHlTjiV3$b^iRbQrl_O zhDsO1z$MDBdp)Ezxu??pYx@jq*1#`bv}6gOr&{b~N>}-Jl4jQCEV}{}{*F)r2%}5- z6Yse!wm2hm;Lc_%+E&J=ouZ=@KN7_56sK;6xcT=34suJSc+ji|~YWUQ( z_3dCl(vGdi+K}^ezn@6vX^W|%#PJIZT^7LOB~=DmCMc5d7QjnGhuTRXSoJO4x-22; zgC{=CK^(?hI*Yb;%ndOEW3dpi><@CN!3EbZ_u5!^YzE^jBfN_Pgy?rE!Or?rn3N&d zrG+acoaippf!--TeK|l3MS8U(N35;e#LZ?ORy)Xhhp!Cax#e4Uk;&QBV9Y%DzMdij zy|;{HD5hggw?QZ?q1fZuc~4Z}VxYiNXj0kg4|L1oo5|-9Mi^y42G8u96*j42BQH;S zvZ9LyN8LX+4)E}>a{Kq*r274-!%9k3^n5$D?AZLn>nm>CuF4t(Zg@>y?N4Iai|}C- zn{v!X(XO)ka|_?EoI(~O#vy{joN509-dv`p!hS`+8Jw5|jBeXM0xfH3rWi z#8IFG0=mE@XgYW9ssd$!q$A=kDP$Sq69V4}PY}|O&w{dErlw_-aq7hl>Ka2t_fH$#vZ4q?mWmG)ociWx+1mAk#HwySB{Q{RVt|siGc!R$K-nf-CNcYlIv^{y803#S`k8lDBVvajNUw8@6m|?TRxn7++NOmcA$a zN9a$8{cav{Y9G4Af6}CT3+I(V;x6Is3g455arsEq+lNCpx9zLSUus9FmhBoqi95{7 zBunk@ z&|bv;NZOe#Tbd(7Z(?DQ=v^4!L;?ECD&NcC<-$J3MdP`hUMVwsS-8M2^X_$#DHL?M zjPPxhuPCAiM+L0d-L6KiT;g1U?0M`Gp-4=g)w+>~z!~$pokNM5!H+IxV>tUb_BfS; z=m?dfeVdt#ttoB2vB;J`$eQu%(e`)Zt~5?6Wp~w{A!@VcoONxSbh6!|>Td1L{(DxK z@%MaBJMBl-Dhi}(T^2j5^_&Le$)sFFXP6lYrUxDeJZ13pp)U&)vma*YAS09|cchqd zw`X##{`>#e%9KL^VH*~*dR={em9!ByxRI@CiQEsIRNRDEx&gyyc7c|PEOQqOpn3RQ zMh$>Yxf>kRg@ZusjbM>Ha6Q6=*aaR^zNeq&kj|tuQPw!J4O&b_xOZLq_TA6(duP&vOHxRVvv)tI+I6(5si|it9z-|eBv+r$FIt~oHQ;8-`b2*>5x;K>R`PL^*Pq&a$lXw+Y;Mn=Y*`X><>c*srC;7I{JABzlSI z4cAsyfdMP?ZMol~bEOK(`o>3`>8PcW_NCsmt?~Wc&QqqOV3i&F(Ms2bSU78f@nD!L(rmKhb3Pf+b!0k*J1}H-kklM?wgf{H=GAlLAemK7ug33 zCJ+4BZ@>Usp0jYU86;)pxurp0{zML5l5Y*HlaNqEB zh@lwH2Da$@QuVo7M#U>fhn~z8tf2Se<_)?nZ7PnI6X2LInn`+M3y`obDoUSm0QGv- z5n39TkG=xN3g|BP`y3OWN2Pzk^oz2~1Tp&I{PYKC!K9&Nd?X

1{h+09M1O1;fS8x?%FC?Vu`+6p@rU+HGRN1nOX`tCQ z02*vbH55b_r_jV+p+Ejamml=ugT>a?x(YM1)SN< z=P1YN9H5f+1k>X`V!y{TP_Le3uJ<|8je7+RRALZw;fHq&iz}Uj=x)l`_ETIQS?8gD z#A|guddLZCjYGkUMff9f7i|7Tv_#j^^TW>doL%X8c#pD)=i69N{owdb%mimJl@mM* zewD}bXNK~r?w(omb-Cne*>nwS|9*e5Ko;&G{kyLYCQBoshw@Sjj&wWD;&S4UCRbC5 zh{we4`YCAd&>-{af$KFJ(@(BlnX*_7uhfD(4-c+|ulnP^<^~=vkJ&o(chwIcigcV? ziMbFoctVyO_FK39deM(J*6e#}qjD$1B>e(-mh>SoxP*=u8!a>p1(sG5pU-Pw{Yu#K zHzutPr<-cSB`>|Z!!5J2twJ_0;p2^OW*2F261wV(RU}-HJkSt9+{GS;;N$xv&OqhJ zzeLj|#{g17lCi{3N;35Rdz=?~j^PwVT>b4k_QxFgzMfz^u+Bu@1V3`He@!1^0+q<5 zL!o;afy+WX+PS_swho+bH2b=08w-v8{foxdE?J>z?on4=1vv7q;Zk>nd-CR=R+xLu zt!>P!|KeKrxuzG`rO?)y&<8VgvqFbtri689P$dAU@@UrDGK^&PLKB5p*r8hWaqLDG z2;_`F%Y3epYtfsdEs%b>O!(?*s#15~GOc;2s(@Pi_S)~&GciFE`3@VBJIexNuBTOE zgs~_6j8KlbP<@s@9SfXr##n$91_%mPB=-Al=KpyTU^R^Si}VyyU5Pu2piEIwIY)A+ zt`FlG025N&H}8KK_k>D7gq3d}-POEVoiJ8YG23(a)1^zlp6T*9C%$flPK~R~Fd4Cc zD379ZU%5S8;>j9bKS%PoSo$BN0wLd(c#Aa!q5a^<+eKH#bq5^~!vUI2K*#Gxn#ycK zC{C+a!%>NK+P;4p5eyMVN*>*UH9AMX0rBw+1BNarr9swhpH`9AD%3`%$6~64J)dB+ z)Dp7`2FsL8Y(m-egqg_HvVkc)QAsyHbRJQ6J$;li9`7MfZ4eu*e*GeyqBg-16t$;9 z#6g6%`;q&VJvudr#|bn9r_W4P&rne;Y8YlXW4)RpJh<@6TQ21E5!y!D?vY zT>0+5Ei=@S_pVMJ2uEYdCLt6gn+&?fnZn5#MKqRaGAJ>aJuBY+AhI5$&628@*K%}a zV>slnk^I;oc+Dyh3Kr~$uR5NPP*6VtQhZbPqK|~_G3e+@&st^jDf$`1P016bRV--% z|6=>4&h&VfMQ<-*XcF6nZ<{}^3=}#;? z@x5ObXyz{eQE$qYjt0x)u3rP*JSz+wU-R*9TyKV`GSogq4FFTi=Qe-&TGekan+j?y z*z2S8fUQ{E@XR{OIl}cSCpxq*fCc&jQbLNxDfoQuc5AzU1r}Fc<5W>$65)d#}PqM)$UFRzx>x-JpBF3G&^wWOtrI0O@6b$okIUYK4L_=;&%F>Na z5DbheOsetn5n~b&q3|$@`fnwW5-2ueg5X7;*MC=)f#FSC) z&jS)j!I$!5@1go&05d& z_Ese?c7SVK`8Zt~C3ow!f_O5ks<6Y+BIU6@KP>omj9vn7ebKUI6}j|l*JJg@N4tJi zo@XqAFM~LUb`l7{ zPy$bs3?~2gT~aUwHx>MyFLm}R?PY7@$B4Y+CLsxUD$J``}BlO16yekMZ8u=pfTn5dfC)+lNUxDTt&MDfe0 zBWZ3ZLFoL+0>=N+s3r&3HK7q-IVS=hjA-Oa?(T@baN%c$sps>Au?mrL<$$=CS6Ry? zvoowjWP2S;;Kjz(J@+RVc>)md{6185?eR6Q^c zVf;=F?cO;iS9atuDU;?OBFy^rSuyV`(qleX2HA!O1~jU_ysLI$MWgP*f1A~Od2^4D zhbHhsqozXGq_lBmIrg=pZ3P}QBn5F5ldc>E?)3Zowj;ItCL&1K$!i2U=fB5)i}78E z@yCw?%@t$CtYF_@D3j47V_kUCvaSp8GLMni{r<L8l=X_g5M3f59!)Y!{&a0De ztyr`ugJ0-3pyHXB@B+imK&>rnvVQ0=SV06y-aJR#8yNAiqi2GznkPvW9*u7p&%?+v ziPO^sd6LX0=m26h6jb>F1qvdc&#)HIr9pq%APA0nI!j{7zVco(24C!yy_x}0jaXkeal z9!zSx>i0TW{s61V3{DUp#`__lbndw_DiT7Z_(?ED?zPy*nP@`?ESg!6pIuJE%cw9A zEf8^0#+4KpKDQMLf(CVW3kq(ZiN>F}aBOsnn*Yc^B+0`0gy#vO8yl0*qoE-%HrB6o zy4CF?R?9!BF(TH@7^3K;81ODVoS0TlHe{GEd*U#-q{6CNIDZYl)3xw}+R`JK z&VYA%A*}Y*$$$L!9PTc~Z6;DFxLb^arOQCZ6XT?!UA-!N)D7`_Bc@4+S==nZ0_%TAA4AJu7yHCV*QIhD-;Nb zMU+TEHiNR+cejfX+!dO^r=0@8WdVK5sr9&!m~m$h_uz$A_N^TtbQ)UP>2$WUq8d=Xkic37Uihf z*;XVk6gP@MSb)qsL(O_d@o_WI7q1@1^tf`>CzE4)08CD!0^&UAh**V}FS!)3+?pGX ztWeCzSMRccHXxgVw{ga3C}?bVm}SyZla7AC4f1S}S*^5jl-ER5%93q6c8J^FnYoHU zT5IXGp%my}nCBS@(MCpjLVX6h5Fw zbjt}@?XXR@9iiHmAc22LAiYM6qrH6wdS2Kcnt~iKL{FVB55t=OrX=T2`ma6KVRV$3 zRyu^5q>O<11B5P~X2W!%(|(f2LjXO*_}2IMW$|wyIx21|tTLk;%2oQ$F-?DdNBic# z4b@c_eh&;%aUUuD#pVA6e~=QHdBUsT7S5cs85=D|bIMo#9qh7$IF<>tt5}4bK6Uly zKg?Q@PS!I`fB@Z`?q|mBINghk+4wtB@~{~)uQG2M$#DG;O+s-w^ohqi#;Nz ztP2GK?2eHDyZF^#i*DFKAl(2qcNjU2>`sMWi_~%>=_l&Nup%CgEC{CgkVcZAMci7I91b-al=QI~fS6COaul1?}Ivw>cfWOum6Y zUdLNTA@q`w1VxaYkX(_Df|L2*F5C-t%R8`!%gCr7W<92Kqk+g-#MT@?7$!$&W2Dp! zeg|!{1X-IFx+f^yMg1clXRlbY#G2w)96bg$uNYK0>4f6AE3!77wTV0di z%B!eP3AioBq`BPM^V4rmhDRzM5orbUGt1i5c&@H%Yd@BrJ6Kyuz8bMit8IU+h?r+l zN(v^qM?#Pe6%mk1D#A&@MC-Z;M~^Lbr2<3 z8yZg5<$9L8S@-JMvy=vDmZSZTLRgSmle{5oFA(lkRU=80?(92DO?cHxaw2KalS3h6 zIc{W|RsK8aY`9xuE5yA+kYfGOvGoXWV?(_z|i=HsMg`;g7Ii-B?ArajLrc zd`l>k{MD^Gbhs97@NY)re}_j~t@;wP)%|bPv>C09`HB@W|L3b7vjFlytp%StJOp{MGf+_6K|;6tvDu!gXvXsw_^@TV${Cqn>!K&J`&2*oujRe zjNPRQ8WP&;GWr5puqEvagBKePLy^F>6t}^w5I||6pvD-zWJy2LhdK;b=!T84%XL|? zoCU-*@z>U!Yq!)*{kws7VpP?O+c6kIWK1#{znChsln26zc{ch7)txO2b@MGd9qlry z6oFG{eQz-Z;Oa|X8m=th7~d-45^IjSskNBnV;+WZirlu{$+17j_S6)L-$@>$V(JD{ zRv;m-=!E5!%)kIk7%k{BEy^1%qgN0!VnH3-8NF#-g_I#H#Ni+6t@`)k_#WBdy<#mX zvt8nIyk&d&!V$W{PCywV0z`p{aFSjJKm%?}3nROZ>Gw3@UFn)QN82#E;zdZcnsoA6 z<3iiDT|4a@(t79c_BZd%nV$wf-x`q8ZnI+Dx|eExEe zUcr=-DbQ&u?PjFnu6CQPh!jGsf!YSE;sAkKOoSF-x#;BNuV4x#;4&k9lhR9H8{5|$ zIg)UC<il4L7a$YFhV8OXV-EeL(~j38|o0 z;s`)Yi$1#25~t}scxFT9+`twmxQquxLBh`!ix}tgoGH;y*T5lO{N=;k1$EeW0GO6) z45&;`L_#6ka(I1qytgplM{0p^Q-q6;n!CdY|DDPZsnF5fWCQaM}-b}{-(b^i`miaPF3$eulWtQTq|iA6QHQcb~D02;7_zDC{FUu}FzVJ5jNNmE zy2wA1$4w=W2TV2ru1)ecf^tQAH1BpGl5Q%6@=84J;oESY{nf|Jx3Ek0?@?Mhym%mXA8Dc(t#;@wa z$EjYUe`(KpIZnYYbHQ3tAV^%g9b5Ob|N}YVV2f8-@HW z@Rd?0{P*+{-xq1&l`Vh-ivvzEAo}y^8e=r2>&e;*<-we^?qU)m1@)z82wqI4t})z{ z3tV?^jI0VJCCDad;YGvD6Yd8lnZl5U1t;x0T8!klYYc*`N`l~%ng9Ao&8piy*sf&F zth_u;@X8>#RXni<*Ea@kZjb-`mgFk8Dyx5*?StSX}CCWeE;3i9?8M*@A<4`gkNB0DXhjY{$#Q+3H5L|MuWu z3pK^lLd^{==JZNKjv`w}aBm8o`nN~sgV>WYKgch%ukNKM53r@PadRfe(8gsfA(DMi z{4>VG0Nq8<1S}Z@Q@TvPOmbMaCzaIuPzK6!h4@I4Sc*N|=1XxlU@1BELq@FnuxU_F z6pGu-Orl&6Q{B3KTSdY2IONgzhTX(fuAPb)pZYa640l)ldTWKS?jO~5T*S!?b$=Fc zoe2ZjR?AQu7#2RaeUjG-1LEp#XiXEcBeA1UH{NjST4hPDuP)S&x$XuXn_hup)fX%*9B{cru?Ki zJFWc85uP4cPcR)YY^kMCz+%XGyF3oU5|F3DiieWov}3HJnzM77f2x;CpBa~9D)V3f zKpq{*(-01wNAB%&3n%(FOk4Zli-9rxQ=WBd5rV!xY>E1&UU>57vK7Jd;;TpDqAqJT zQYTZ{@Js#rR?in2016&#=?ayut`b|_U{Vs3G^-l zIhwHJ8+_@}uHHFKd>xKG{z_tdr_|ijB$L%sqS)OwKsF!>uM0CP%rpvDo2Pfe{>poh ze)^xVWlmsu{`zZVOpJiYAw+ae2Dexdj7>%71j;mh1+8A&GMlA)9NG!0zK(=1r zxZTqMT|UG>ab$S;RTwJ*dbT&$hv7g$n529!JGLM4jQlfTM>2>Ix(n*W zV1}X(pLdf$QL6$8l{NJF!~eZ?Yh7yUFti}Yj$Ls&suyY_;xxxGW<%TOU;R>DwN5?b z+AiN51300w$A-WrDCF$x&MJf7&*Qk^y%P*}JrV~7UO=k<416>tnt^VGD&hCINEwRq zOYQYfqdTX+u^K&E6QULi*!)7M7UA3uiqz*h2M-@!&m%#nu%~_e z0KO{y{t^~aY#C%^Rr|_#NP1g-BdEqmA||s{!ERWXQPj^ceOtpN?Ix;HFmRemI=aj1 zdd`cWk92wnFl3TiIaL{4s_Wqr8x0@6cl8Nbe`W5*mzt*L*+Z|4N9TKG(6*Syeqo2= z;+oLa~PKOM8(TCe!1j~HHd z>lWO6(owJx!4b)!spr$uMxXyZVxp1rcH2@OVTIy#a{`_QFBuqoMQPN?XeRNzB*S_l@}~ z^h~5$1dOox?F^Qy{ZZFgYu=WD(9?Y@fJ#_Qr{Mn-_jp-&K+5QQ5tAlPEFbV%O;y#e zdHtFG%dZ%~wSpE>@zACBCYrD+Z~dP9Qt=+7l)JA7sKiOl+TfUd?b_xC(@Pkh8()~R z4{av*!Laf3&C8e9ed|6-WhEa&Hz{`kL1h9%{lSd?u~x&XSGAS4JWYTH2Bx{9@H)?h z7Reg(?*n`(3}R##{Vz#=vHl{CmOi9PdkZ?@3 zT-i>6_3AoqC*8BOQLHoRw1+d4(VxvPx<+k?~fFj9)NQ?%=~=9luVQjGzQI(HxHCQkGFv= zobx?y!*f30@yC8Y{p8qxrA;^8#e*h8Q)gHCm2VZX-WWhe!RV;Ojo&siZmE^__1~9V zM5u%!qK877lLNGK^TO}*Mb7)>%a_#oVO_~TFV4K3vOn?k-B-p3kJiN3o{Ib6^RfPr zt*`Bs;!9179=x9kdMeKm_&>XRCj<+Y@rFQBW|5u(Y8*x(e`FuAR0ygdYl@~$Z3omW z2sag~PnO*Ho}(XsI{rBbb+Q2O6dvbAG4d!bkcsB$mb97D?tWhtb_T7f70P<;8CDLniZ28Xu01Yk%%tGjvqe+aw)d| zv7#*=H09muR$5I&HY{w0aO(1o^etw$7mTL(98I{ozi1n8@AK|){4|+-j^mhXIqF#O z?;Oyy=9R@j_wzM17VghuY*4sTcIng)vGlJ|u%AY9IR+%cQ(58P`W2$goumqUH16w3 z!bCzbkOcS{ixw`D93DV z-Yl?e`Kg%5NNZNH@qKmn&Z_(L#+}k?CM+=l^ZADdU`#}d2fhqT?)Uk>4@Au~zU<{mUGudK#l84j$F?~Pi4Z=|0gj8T*})>J4=zs0uVdQi z>aGJQCZ-vlvMsNf+V25MTc!|IF&dCD19Bl6vRmSkE*)o4MTA>hzFoT*>paRjA zG;7wZNY`0|3_w^#N@PP%DP<;K6jV8Rhg@#GZ=+EiLp>cKMC0WkE83VOmCvwR_1xubi%R3^BS(^EQ)7}Cg(yc5au^^4!?=%W)A)cn$`&S*o zryu?JiT)!eZMmLSlhn_zB?8xd9)Gs`fkUc0cPhq=@lF0!Ixf_h^a3)efF^g=7-6Z% zzu+~E-JYAijdOwjtxyXfLU|K)WQQMvMp=d7B(Ku#>&3cGv%&8>rncKU?2f9Or3ky zXBgxSO3v6 zoHuePR{Hu})f=d;Kul{(+9_HT`eVCxGI9M{OOOuR>s3$acsl@b_yCNia-v<%cN`ix zBMWy9mC>UIy7y!B&t}g|YCYN7LWDeHEY?}H_(8lX=nEV-0o_4*WG#UFEHJ0EiDF3r za%K%K9@4oUq&V*7cfH#U$&LUOCG1kcH=?ERQaR^_0l5uv4%=nZJ>KLc+^U=#Urb!H zs9c1TEJS;H2^-vo-7mA)dn2?H@jVlpETI_i?@s%q2O})RoNE0bG5O^GFDYmE>toT& zjgNBv*?Ic-RBaW&l9>e##^U}A3S><)#;jAeYi7G;$ksct(CF1dxP2*0O}J|^n5GLX zfn~^jqRfV!h#x}yi4&XAM#wF|342|7x)`k+>4qAjn~#iC#fDZ!b0X3nwsOg?Nr#ox zu6y0}bl9M@p6;6NDeKXreP(c4e+e1bflxPS#;yGPO-^dH7dtvk9qG{ybGnMPY5XYi z*R#gMBtP1BTSxj5(bAFh*u6tlOiTt&U4>d&Mumu%6{6d6N*hT$mWRUg$)tr8CeU(U z=^_z4;bpiL(2847%0<*4(Q|_^Z|%N~qB`JiUkZ11@RABG@h1W8Typ)ZD#TDF747%m z#k;?zrsih*bEYo|elh}r3WGpy6Ipi5utC-H=|*MaA6-cPfP@uqi?2l2-vNeBd3K#? zC_@TcAz9AEH|(`f&OD?Pg79pi-dZ(>8nnMaLJ~PC zgm%OWmyM(D=gbM1o4FM4U*b06wQ!;5sb?ErzIY)XCPE6uoJFJ&G8}yS_N}ZOqo33u zJk+tl=}xN9JMDKt{>)&i&7HwoZF|w;-|{^>dKRy&^1=OpWwsl+Xr)}Eoh(9iSEZA{ z5T>K3&5paEpx}45U>z_`k=Tut{W3bgaaZTztC}1fuZ7!(Qm%OH45QL5gjPwL5_V(F zBf0aCo^Najm@9KRs95Nc6kx0n7X-(|?l8;|TGMM}Gh&2)gF9Fzl0WId zIAo_^>~}*PiX!>?7OKl7h3+)AVuAT7Qdb0l9GSu`r2eYz8e$_86JcsfU&ws*S2q92 zs$^fXuEr5src9~t-*&SknU&BW41JV^3VpSq-Mony}O&8?zr8uv{ z_7>}w?u*sau-B2_8h@*kYN0$xFif#}pm3CE&nE{=H^jMzgCR!+t+??oh9|Ge23I~x zIU{(1R|Tfi4VCnxqNZ`W)H9my2i0Li?X%7lqz9Qo+NO;-hxHUB2BE+S6KVM@@G9r; z3d1Me(0#&p4Wi1Ib3hfQ_a)bfvQzdl)4Iu8N=C2FYUz>h@fjwZEXFfjP(>E;Wm9=$ z(*=&VjuFzdY10B zhHRh{u^87E3Q4%xdNwcMbCa>5AP&N%*a}mL$>4|LIqZ@_A=68A=wjL;TPk2+r`8q5 zkq$+kA!R0^-*K3AklrtbEoJ;J%K@cnm_0i;`W-ulGcbvh`6DDhbcy$62;Afwr02XA zLDBg)w^?3y{{0P|ne*p2<+v#_fTn(JUq8l_98KLJjj~u>wd!hzzm22suAQ*5W|CHf zvUo2apJcCswe47VkpYyGB0Pk*wW!QGxO;R#bR@P{gMdS`hQ|Oy9Eo*I-^3hDR1HW{ z0_pM3RrBjUc_+NH?J^uHt$Dn|mbmr6wUQ!TBrnd+x~${8JinxXVF+bopZ@(T z*8CvXA>yhz40|ao5g32&N?F&ykV4o`N%08Y1YT%w z-kJda;nlqsR5Mw^z5w{7AX%DN$y`cC22whS4*(;cZokZ{xi5R)Wm^M<$Um^r-(I5N z{99QnZ1)Gx5@d!LJto!Bh9o15HmE^AKppcIVzrjlx2)nX7nC^USN~;z!isjT?BDgC zM9A{p;{-)x$OF;%0C~>${uy=psVp+kVtmw-Z4Swkmt8-o-w{|&UodF5X)MWN20vB2 zbKr071T5TgYeCXn^k&fE-sked7(!tKdc(tRtqLhq)>9Iz{RZtY!}_;f4QHAbuPkSb zBd3Q_Uf5%lU>n5nV#0)0`TK8X?Q1*^znr&J?JeKJ$aN%t2Yra};dnoiu)Wp#nVFp| zZeK$Xk}`ogffzW6JD#Lz`~eexv9(o)W(jSzG$%a-zboM~QypDK^~@s;ByWlWTgWej z0OjlnKV=zGl0skqSu^)<&=FC33V(njFatvPwGJfTMW`aCjs)%tty{3V-247?) zwbrH!rFh%6ZN;1bb5EcEZ{?`%d-5<4rI${y8Cyr~Tb!X1!Qv@Zc>Ue)?C~5c^_*$Y#Pz*vb0gK@>{&9mA+p@`lfW z!JH|)`Pi1HnFhmT+k0tq-8%XeIiFOKOSUYl7`MY)AWWEa&10^Tm4qMH|JR!ePUd=Y zL<|?P69{aghnrh+aq==_c@wq!cr^4Q%@}yFgl7~DeA&GBl=@vwO~abUOhFwaOEh-tCKSRXl0CRGXc1Xi>ivVx8?G-~3+_c8Mx z1)L;nD^*SN?(~o=BlceM!bAyZR_`O`XUysIEuF)MmnHO}TY$N)P>2)4&p+>0_Osvc zwH+I||BrN5`S?8XZePPToK%gqkPa-yrR~R?m^y3*%S@!a;*M<;11BGE@*o75_U@%C92B@?TZnc`3$GJXyX|wDqKD)kcIlFt{CUb+0c9+Vns6W`GLUYB>BRw9 zlEO$f{A3332fVNHoH0-vTT&0NW4eMW_{M{g2p3xc_&oXT9}8IGj4X@(`)^5KWw1GJ z1#F4#QcOa)`3#iQ0YT!!tW_-RRxNmSVevqLvy#ZJ=(J?RDnp?oE z!}omgorFm(Xm1BEDp62rY@z$gVnZg-ly6U?Vcg1Mo8?oc+;@JHW}+J!Shu>Br-g=K z9y;I1i9H4HNS$(<=bRdKC=ww2-R^M=F`hhe$RS2%h$0b|fmq@2-Mk&M1$Tn`m?8UM zC}nugvc1oDN>pnIh+MR#hf9X^Y|G$!mPOBh5gepEn+Nv7a|Gt|D$s7#nzom5i3rGj zAGiRkJ(^jOxUT0bojNfz8?vMcly%vf+@WJfBUBAfFtC^Uf|O^@+)FO3{?|$+gTmei zPmV48CMjCzQ-ZOMjz}+?eybuIVD#;tnuV>{%D@4&;`}oI2}JbEP^u*`0(rJ-9&MrY z%V?Y4mj%0MFneGSs1QL_=*3C)#HGt`s`U*FM(6b;)orsMkCy%g%ii1Rz~LWemZsLT6#N(QazMS4RSu7G&u zQbD9RTmfmyq*GtS48fzGBOu&Y#0Kxm;(=GxxPZ8X=tvX0@rRCqbyu1|t84wh^f6*u z-qL~J9wY>EKtL8WAy4~`IYiCU=HmPrwqpRQU_tpeZanqoP(wEucP!u>uwfWW z5HABeL8f1iaZhFU=`^jv=%8AB*Ra=Z!i15aVkdPle6hBV;-}h=-PuP4fIN#fksd%> zfu(ZR8J_~FiaqM_u@s9dAourW@ul=NlSMVddj{nNtzTWRO2UcO;NIkYR0 zOcp}nV(%SHyx`t!H0$XyQmwOy+1H_M3YUC<dN@hz#rw`WAar+Zs>k6R8!7`m3sd!~)0^OZ;jB+~b{|N2Y&+IIM=We2aXcCNk7 z`-kaxnR;CW+1|0A0kmc5n`{h24k2`N*E1_Efv^QPk{<EBTS1#qu`h;^ zp7@E0JQ-QuxT_P<=b?G}=ZuddSV!326^S%d%d;#%ow+lmIbrY7({~u=*Ahfe%6F>o zY_}p(AB$MG-b)o=8%Tt|N$OS8(G*%h4O-2b;WO1dh0!ES=NrhLk#-;;+ic<^Ao3s*-N8I^8) zsL4v9EU2?eBC4!{lv0w??)2hvJCWQXkl0qF?E6jIDN$V)Eg~crJ_Ei9uQm@_^akP?M%;Vf?n2Wxy)&px!IE{DT~R*WZl7%W>vy5o|0C~B{Bq8} z|NqN23}a`QAJWo&-n==cd)49x8`iG9_NtQuI#{l(bk73)-J!Xn$3KH0 zt0;%St>up9bkbzQC;mZmUsK)r^CgmbmmcIK6^Y0L4(ga|)BAOL9&CsVKt3S(>R(M| zZlN^nGdG_J8E}qr&N2ROjX=DQ46F{qq-ZQx{ij*2wpc@OJ+-E5wa>{8VMP zVX1@-bLXzTyGCLvW?@Qi1Ij)yC?b$p{*wZe=ax}SBkb2oeWj|RgRZ_51Obuhvojrr zz-k=d;Sdyyd$Mes;`)$zGO!gN$ot5ACZuUGUMDDesH`fSlRH{LqdZ5_6rrniXMlCi zg2K7C_VMW%39*_%qCcQM{PutRP{J{a$f)<02^{Y>YX0_{yUCg7w3nU|J(sn1`KM9s z7uN>N59dC|b7JovJ-+5F&iBTXsJv2~HT3YgHGb3JEKCXWFtNT*G z&6_j(89KTO9}33eFc=N*`z9JG;7kyt@Gjt!UvGR#c=_^lTZ9KE-xgKD(KiZzmn~aE zJJo|%+Z}dvJQNWTk#SOL1P>8W4gbMEWJ(|bn}coI7aJR!v3n;l#6f#5{R$5pIu!D1 zO%5>@Zsjik!c*>9Zt<^RVI(O$xn+7Ey8((eZQ6{P8_b4tyUQJj^bV3wq4VWa_ZTYB>a*(~+^E;Af3|=$ zl6S)T&uLZHS9&QChu|jdEmTzJtXSdI79mA@;m}SEAY+OZ;_|hIWuhiHarw`muXF2z z9~dg$PM9l^fSwj>T1yjFl0X#Y_c5Ot1@eq9I6}smxs3M?9eIPmkVL_GOr11Wq!XW2 zMZ}ChI#Ls!Us#wBE%7i0iYO^RK`RY-J;c0AR|Q%ooAjS-IRtpD_LRAd5r}hGd+nf~ zp=Lz-df((>sD^o00o7SU=Ph2`4JC=RG3+p{kzL4RTHmjdV54#Bm==72Lz2s3uygX( zyhI)8PBrY~m|8J)Gj;iE@P-j~vAZT$MQrWY-;7?rj2UQ-ff8nkaK)bRl$Azz45PIV zs_7gxAjV(psiFOgfm)GjOiwH?1|b=`FCx2@XD8_^d;6BVk+jKES?;wKD$p;RaE z5Ka)ok)W)i@|vU6DdJI0O-;i#%|WE2h20m{hD4raloYrE!RRs=W2r@`C=}}y+h!}D z{n1ei{2BFi1`d9P&JwB-tKOd%Rh)B$G}Wgje2w-N1&OeI@kO(&9zA}1fHpXYod@ms z$r8^`_4mq)U29PvG4#2(7go00?(ddBV3SV!;EIROi}#wi`&YoDsu_c zbOx{dQoUs-WqM@rJ4WyL?uttq@gt4-mP|AYv~dVs_HbkcfChr z;xk|%*)(k8{wr6up4(soDL=5MRH_@_xIr6S_yG@A@u;&~E?3zT)fm=G^Pb3WYZGzC1TqM|b8``Rw%rc+iU zCyuHS@F$fCjr!rni1&UC*Xj^VJ~(xG>EnDt4N{4VYCR(4DTtmAj(GtPGPtO|^}e@N z4qa#@;=ON@?6$T|@!x4}=%GF&#NiWdor>FuIv>5AbW#CP&A57Xs3h&EPdv}_8SFQB zrtMSlfK~pwlut_b&eFPu|qiR|p$tUgAFWl%6g;Ed0X4_*f`@YenXkHpc zyng-q35ieSN+JEHd=FTq6?7aa(2FvY# z%Ujvmp4!b6)QlfC?$Xtdz<>MBoz10_T3p7*CNNb|9=+i`@;+U+n@L_}KQ&f>#b0nv zjMJFosg@!dIncJ+s#^-G_h!W`{S+$|5HvN;mIAh#P(Ihqy7Re#0Q?yUM%0D$^yqTd z*Eimf(5Mr~gcsn=f89Mw``L>cA`>Asd(1?sB?IUPX;z~GLswuJd^}thlIqC?ZzSW2(_nk_M9}_bkN=& zbzWPPzS3a@dMe@MS(0a%9XCs(bG|52WhSkR8^W4e)>W-L7x*C+4FgV{%P*rlAu5X0 zZOXhK05?`Mk^|q_55kKC0+T#o5~Wu%@qKrycu}$1%_^{!BJ>d>^6z0pME!g$Lv)Gtp;cNtUtx?-W$>6~>m89M;PxkCj8;yUMy zTS0tU#z|G~RviSw8#{jdc{mDmP=n3;Y7#@^?4_8Jqf_O$MugdMKN81XhXEm2G8(2p z*SN>4YqDcqLt0NBHL5eG;x16rk^-vXi@K65n#NRnJd}hNlo)`wNS9$9XEJ;M zXnk*V(#;J8w#>B3uDL?9YTQRZsM#K+;aUBkVlQ!zrbdECwVJpty3?U5R3cP32Naxh zCItKA{*7DRzd6VtALJ#`)r-YwqC8Nc5cvF-b|zVv3p_cj(57836=>V7Y5;PQJ66ut`@%@`qG zef8?whqStWgmdGJo+T8d=Yh*u7oTfi`{xbDsX*+Lc-NGQUsM?m6-mUHMwxv^Rj4RM|GD(dv2!MfDlCo2>Py?kdpt-~g~qsXQFEhbVe|d~efJRZTDx`a$+B;) z{5Ruj%@V+2r@VRn8s45GzC16X8SH0pXQzID{Luk; zas)z720$bj&KZ33Z?DVnrx+Fm_&K~ep3C@>0iO3YI80Kghkp6(Z}7c?YC#gSay;+r z>JoWMUR?rPuFY$hM0(pc7$(x&jrIoJDKixHK%*wW)1*RAwsM9TM{c+@l4{wqC6|jd z^OYe{zV2b-z=^u++e38FdsqG5p>z(`Wn0)OYFHRc-y_?pIyn zz^DTU4?g+GJ2M^SXpp-tMwbkPnPjVl51gr`;?>CGf5+5t31uirjPK9G4t#6P5kgNQ zLs+Em;Tj{uPBfw(Bl9Pic*=;67UT`%S)CC(UQ0;h_g6zM8o2BjtA(YlgqeFz5vqa8 z9+BJ}*fS572W8SeMAO7?8GkxqNaG6*0c!e>nYMrb{$QzMM>j%O4Z!qJ^L3T1d1ePW z-lRN<3s1ouQx_!_P~>3`U~%Hp^IaVSzAR$>B>PNAER`)FwI1X?ry+q|epr$&Lk|yZ z!_qR(;XF=QIv2p5?!(cTX*NeP^@`F-5iPJfD2|&m5pqp~Bl}r*{i)Xg9=+>eydyd! z>E0)TP)N8PDmQ(%9)86567frrk25%%(mRf-C9zX$lDaEIFFGgYS*R~vOk^6aaK!XM zkRj2OtNcU3vRq2BqF@$Vca`~AVQeQgCvDcPTgTjpIR=?uq*{UJUIXr;{m5l!pC&w| zN%R+a_&jgPFK52&k1u$*d};+`Ri2>j*_GQd=x205zM!m=tgJr=mp~9hhNC^H6S8^>*MyFr zH0exRo8z1*DU+8Ovr;BcgI&T5=2FiueQQrBO%Iui*}t}sDry-K3ayTp=tz4gEO!sA z$32u_(qGM3QEGHz%h8Y|C;Wm83+bjB zC=WmcB#p74!lh{e7gdzn?6&bZI`=ML9e9Q$!#~h#`J6_mr+Drl1sAEN?u9G5N+k~a zPoSxZZcRDay5Tgi!s5kl)}1P;f2b+Hwk}VZNs`!el&uHo%1vN+?--qUt`$n()_ku8 zb__BE(F=5klT((WTuuUB4xTQNog=Yyh^xMjD9Z@uM0BZ#+9@pyC>Th(FTs3E6Bz)o zIHRE(SO#GxS6emW=dA)L``*v<8VDlb3;~v=JDfg=Yth8hXN(Xj*og$icC^6EFKSD+ zcRG>v*-Mx12f8T_95~DP>mGP2!M~Cz9qVr`#hPT?F!f@zsWj-+;{}}{_YG`_ylrv< zO&ft@K1mn^%(T#$D7+bXX^z2tDU8RcU3+DM>2Ic_q=Y=CJG(dYrft1Qx~26wftpOp zp6@fWtwV}*#<}w&%55#hQea#e5zDPAKHW>o(I{|O-tOG|+9Z=)h&riWmQ4f!&!CuD zs#7q3oGZi2`!3Vcjmd1*&Ga3K*2U?dZV>m2pz`3ECX1zx0DQj@aaFp(O<1z!i&XF` z*)`B2zd*sky5B)cKp1Om6^y`Q75e34JiBS0+3mG0rp+q(Z~hO(3zBH_-rMksj2l1xBEOxI1H&!pi1>@e9$Yz4)M8P={X_uUAul>c4SX){Df!$ z>9z|klb9y}Q}zsBjIQfvlBvwhDgcj)`fYhTG~m(>{FSLNQY;&! z{#jO4T2f1RdH%sro^n=`Mh%1i2=bR4Rl&%#@QR8gI~pH)j8yl{O=+vK9D;HYG~H(T zxVib^KOH@MSd^-}f980!<=camn#?NUj4^Sg8y}S6vDiV%Y>dL^f(P14BW`v}N};vg zUgClnuKwtlC?WHl_$0U1|^y`sE4`4FvfS_+Me<01wV0)@E* za517vty&y2XY(qz&-GEtbi{A0js_S;Mn=kKcr|RdG@Or*n@O1<#TQFg2fZf(bFP|_ z(^@=I5jKpx+kUhIG$xFUBzF^k$O_J%+#c#;I<~Fh-2l?@Aa+Tn4C~gRL!Zh$*Rhpz z_H@>oJ&fU))T4@aM-*|?pfLRo{Rrq>qxpvS9_!`D=y|Vvh~xHDSyfSTnANqND%oSE>Jqs8h-?Qy_i(^R%xD1JG&Ve ztvNf(Csy?c2Zp>!07o$eAhgrGVSP@xq5PqfA5#n-?JmO#s8mjxkG`qL;1gmS#+m)Z zu4}@OJ&7{gP~K}Ec{bo`rc6C(vvup%F>{4!9sIgsi-^_=DT&L+eYK+9F{jDopf6h% zuhL3G^~RqB?BX8<+kxw*(d{=P5Hgj zOJ=aK#ysBjz&C61tWd?+Z^M9sIC0`*zWVt12wO_4n>NHPQ_1J`AM>TnN766B4_rZ= zJk9?2AkBc2(1C=G&0*DI(yO@&omS47W1X|&ci1k;3K7yCq^RIS`NX=qItL}6Rtk9Y z6PCYp!{Y0@H_~mh4vPO{t01>;ZMoQNudv%!s#)hpVU5yOqDK+PN#0hnlv}I2q1eMZ zIb6AAf{YnVIXgyo@19NBc?bf?bo|AhJdxoL3|Sf4IrZ$+W|EO->;Ja5w~z1FrFCcI z#Uv%R8&NTnoxY8pU?RYU+l2o<&+~0$kR=^*ZzH0jk4v~`2i>WyRhF!Xu_Vvj5#`cU zf~4h(F8{5yntO})lNLnc$igqr0#6HbB!Vk;e+-3~easiB^0L!rt#iY(0a~WQ##150 z>gJ?9MqCb ztyF`en3b?~`3^?h4n%-ErO&GA{Xa{Vc+wuBA!KeTo*~MB(EQ8%061w3Q@fo=0uNX?etPt=hDi4u;0|w?iXrs3WYC#|39+XI+zX!%0aZ;DMW*&Uu#^ zKhW$!DibCcyzcP{bfZ_N@5nKba;5|kT)QyGuv{NmCE)R?@V2xlSwpDR@|% z9TiBD34l=A&!#FA(10RUm!9=R01_UVuW>`VkE>D0ydvR~sPeddvg=?3-M}ZyZ?$TS zJZwjgr|{7LH9&_f+vq#r2WhAKo z9gcrI5<6O0=}L4%wvJPLe@9%b%N{&nmS@diG5B^=k)m z+@a?>!Ij@8FqVlJt641>^kQ<*4v7RUf)i9)36VxFZ%CSNW2+<09~^?I%y0)Sy`ne< zs-k0-4)rYa))Yva03`0lk+Wcf9C0|i4r1X^S5hTs;a7nAEkRtWRRI; zehE{-4}~HI#dxIw1Vyyh18H}$c5COI1$#T_?!eqk+EcriFD^i6AyJ%6m_YOc*?Tas z4ZJ5VODcJ#l?Ok`t!;@lu<~}gaPC|aa#NDq24Sp974aHAvEX~sI7X-g6b|8eUU4JV zEWh!qFtNW5S+bYsc_le&yYCZZVh3DDc-UV!O-Wk7-imAx0|rUS&0amHF}?Lr85|{9 zaQu;kcn+#(+YmqKZ?qw1ctT2C_ht}+8TX82OTI{S$B;)>l~pJfMo95DVvoPUGaf31 z;zcAQC1p~vC-0aWFsW$u^n^~WnoBB325llOk~Y_CZcav9CgT%_ANn?jL7h;GkxZ*$60u5)Tsj|ew!2H7;=5{UWsf23<&fp!m!D@i>qyr`io!X=nm7Ya-cKw~ZaNnI4)Ffk`lR23 zXZ!)De2*ZkB!#YIvo8FotuIXGYN9mRM@>Ak>pnn4LAJKBc^nK5VHjmRotH22<*{j!+ZCNP&0J9kUcGu% z@*n;^&T_t`wu7+DatC5~5xi3k^NN%-EY5yFmD~fAP=9BtM&>gqZ#DId(0$LoDlxGL7#nS z!;MOW9)MyyMf-K6Y;vEZg9jW3b#)bk>7vyL;@}m%;C`CdLkVwQ1@Xu+Sd^Vg&jq{@zv*TvQKk1_tS$}|Ol zBWU@i_teGL+S+XLsKLb{R=5)Ha~Mk`rSB4a;1T-L2L!3Znylh((xQ`exRn|ykONC9 zuax)KLV>~N?I?RW`dejUZ+7Lv61teN=^Z+DynW~u#h8#bKQQs^3%jpNySXm?$S6p; zBc(V%*|TsIClyo9nY_cY9NwBwrnvw=Pok$k@6-y)5?`8kr|bucex0y|SvrJ@!K0qp zj>bDnW9$#o37mLBF6r_=?lEf$q?d>sQ`S&IcGz~o4eCY7UPmzOl|Mym8}2}3Bn0<1 zu6dP8bMY?3f71e#$?9PQZ-Z|Ig*KS{h_4+HMB_uLsFnG`(!UeLz)DX>Sb7Jc+jgKl z5Zi5|F8BJ+^vew98v&O)BzX0*Q*;jG#&ks12MzBWf8qtMM`}AnEsoFb$E4|@ef4kQ z;29RvjwmWv#ij|dgv0U4oks4;bUp=X3VB(83BWf`W$g&hADwKX0Ob4)PQA7oit6b! zsV&hzRNHWh*SN1PW{ogV>hRwNSSqMt*oPD9F_V+w()Qcq$8#rGe`-abH=VghBTV1i zpVp%iqA6x;RvQ7ikQ|-z#(r-twL0{8Sw#ls)Ht(?8SdMqrS=+88cw#G1V)YRkkT@rK`Eh>t;hf_x@FINYclSWRm#33gtb%Mp&skn ziH=10S^~jdllJ^Wsn2R8f($`2cTgGb?AnIZ^t5SB$<{O{7MkYtS6FDM)b93}X{|f3 z$7?1+NFOBuf;a#||0_>c1WMOjC8f6K=HEX;tCF5fwmXM`hbAul zsLA`0!RhEx1g}2J_$*DN4#z$n>`XnLNVnNA`0IEMTw|hi2YC-@*@Qzh4Qz>`am=@c zStv(IyvSS>Dpl6tB4PE69$6w>$S*27#5J0Z+6G`LmA)dHPZ805Hg#{YVSmw*t`$RP zrJ{j1&OWeL_FlR+U`xL3BnL%}Q`g@A1rV9cNQ~~Gy$I6u1M6dPjs3eR}OsHJ5l72-0(D)1{ zsS>|VO1Bji3~Rjora-xX12RWkzH)_(&iuE#BwSh7FSpTHJ{*W?5&#GN4MT7w`}AD! z`0Li+5EVHzwlcuyh+>`gL#vVH(#K`hBWVCi%D{E3Q64P&lc71bW5gzaC4yzJ@AB|p zK)uH!Rre_qWei%i`v@b(uR*X7{0B%`_!}P{QQZ4qWx= z(0QvjZPHRd{sU1yAmWzK3llNX`jbK-je~^poAW@OgDqpm0s1sutp3Ad6G?T~NM|t6 zskTk(yfp|rIDPRbPsEd8#9W3J0Hsja9ai%B=i7r2D5l27O#Wf<4T)m-9uDLZp%p^K zw3n`Q9z|Rq7fZvXv{_)2GniB|a{H@0EjT`nM4SwqxO1FlU7|c&zYA^DYL3BDV{o5x+2db#KfUijZfbK-tOx$cKbGgKlt8aWip21~9fUAceLM6~?mN-! z%w*dU?Q0%4ckR$;U(J>)(Z5=F+mz2;uX6lRX7QQ8mc1;e5O}9~+kG$Db>cULLh-G) z(NU_WE+NzzNEQVJVD+-UW+rdVj%3FdY<_Zf-|T+}u2$F3^Vdx%nAXndD5m1=KVFXb zx%u9EsvI!r)ilcT-gQD#>+rE-`bXUgYfa+n*00!=rf=R|v3EjJsA*Hhly;tHev73g z8zT_s_n&hzY++As@pFVjPP?D>W+E;=*{Nc6t{i@NEaCn3!^x>mtFgL zb7s$e#z=$F_^Q~dhpLVay7MMh{|i)FXVFBV*z1dcVl$BoQ)iDrEBZi_c~-aHu{MuH zQkUMngUADJu%5JA#ia842C}fdLIYwqWk&{MyGySb-P>tu8ZxQjn;CN@ z?5y9oXol!@cRY41jW?LE-cX(R9*;1&IPGg)5O0_G_7X-Ip)#=;ND?6uFwQ zC0pLycWK?eeL6^^nf3IShlwk6#8+>FP^ZI6ppV9aamke-cT6J}W##+cC26 zPoFE74;lJZ}35DX# z=q?|cD54~J{xaGkh#0~wx$xsWoND!#-Z4-bCC}|%iqEH!_zH@kV_@@E`C0D*bt#QA zjc@n%klP>W+3Tp-tz0y$*W~&@uj;yCaFh9u(z2j6pE!?dh`gye-C2R zFPXN*MXyt8 zVbL)?D=qJS6l{_#4)}c0!PZ?%*9Q&O4^W2h(R|$92i#Yp*Vh&o{rg1gFyMhNS=>Aq z4+gJvSDIk?q+K9CO-WYfI*Yz775P=g<7PMKMi{>g)1r)ILGYS{kUdUy9P-`u^YrG< zJ$h8_Wt>g4pbFm)TV(IhJlPN$3o*1cFD|EDplRVl!=T#4hMZ?IL#cc#HMZ|k z{hW4h$+>Yor-j0KI_P-kaPO7$xI8grsV-?rs+ug`uw=_AW1jCma$T41-3Ow!t*foQ zw6o;djk548Wi6_b4F}xiRv0{hlMGvRyXn@dl|;Oz)*j#8(;#f!N%j8KUFGzHfPQc51+q;PcqntH5ZDB+0v? z7~6smakNCAo(3y>Qd{FLQ&v9_(7mIiDGj`thGeV;nn^=LN#WcE<8+-09m=E(^#k-4 z5QKH*T2n#Dwy&kv}`auEDluYc(mQ zJujwhXTl`jwQH|l<%S(QY;Zey^5W$0wbLoYT0jz4&v#Zwp8xUHTQpr=ux8D9ImSt6 zCN7^hq4EId;m!R=M;{eFBlerPO|@&6F1{nzJzQ&L%3@pn++vU7meriOb7kW>Q@%vW zFO%F`w`=$L#@Y|KEonO5Xd&MD`{_XuYxG~pil*~jCpa6)FNSiip# z@tkTh62I+>46Cypz*;AZ#?$TaMMT`jOIfE0!tA2boJz7e_B zkCfVA{f0(lpJx?rsGCF#=Vh1hLDL2=I;i|3%}@^>IuwA}Ub^f>T6Z5(Gd6UOuzq{a z{?n(_d7(FcQQ&UmfT5LP-urSm^ue%CiL>{S2YdpD^XZj+?{`&;!XMa(K`{0>X(A|&`+cxUrb3PtfTmMlL8Ny?x<{+I@Vv6!mG@bzQt4;;9kmzUR0RYhec zkXFQQ6TTm}8HTX&1*WF#nw)^bb+u+Po$Wcz#YnM_)pj45uq`ehH+unp7O?v6A&$Q% z5zSTmUe@=OwvZNT{p*m87R?j}Yx~dscRpE%=VZfnm1i%-4J|~=7HfEHZC2<8CpeCC z;M|R*2YLFm7G9n|v8BCdXlicZ@^UzxIb!EI?A8VoBuCP9=rX;&e~0Szn3zs*N5|efq3N-2?z6!Gq`bs(x8E|f_f|R@2D;f@$F^(wr@T2 zz^q>#?Dibe8kfJ}OU;KcoXgC`D{Zcq-*`U^dUPILh|`RmCSD|^Y=EdIl&h(@x`e+= zWp=mk!o{n}GA;YhWEUHlC5a{KM)uADI_gXa+%j1Wvb-+UF@d!>2I&N5aX@1|J z;#kxKzfam@8E#VHcIwn6c>ayNyrbokC8tQm*xnxY25$N(sLvlroa8w!b=yxInsu=c zn=1Bp1LrM^+NfUhmSd32nlYMudY~bi4A~t8ojE zDA-gcbUTeen+;y4-b~TQ>vYVb$nC373|ufxZvKr<$JEvH_Jne^uRsmZNp8W&d#K80 zd)s_=r(a1B+<9~xZc*0(>?_?8ytx*niaH=U)Q0L4B!kT@+sRt4eDdJCn-3)_gXz|T z!IA%$7MTUChz>7!-JTpWgN(E+a;^OO4Ob;Ad!3M7<1$#lpCgPt=)&-0M2M+-n>71$ zuZKxSl0xCBE(opX5fB&Ts5pPz;oA4_zNV5#Q>qv5%dsAp)v%8y;+Fu4(pfuG8^fIZ z;^+rYk_HQB&H4u@7gC?i@p40UATQ3%d=9)4A2Y}A>i5i>b~mwb8w74fzJ@#3g=|kJ z)vJeY2uzi>VtX=ec~V`pNwdh#nwMvbO=yH}2 zyiRT-T8qv{gAF3DDJ734NxnHRE;g?Ib5>97HFz(Bkd>RDYlDxfl`~~~s*LD6WBX+j zM!qaFR1@}i!OWS5`c)XPb%k*$GR;7G9*Z+vp_^p>MGZK@ zRG1%PI^-I4MzGERiAprFXTMmx%SY87-oHN|k4E)D7$rSo59v}9jw18*uv3~?|NZSJ zJpqzj=OqAN+Qd~B*+$7dI4Nwi1UkKKYtMmeM-9#GVMNN~D%Bdm4plH7wW3d8)6>w$ zlDU3R{)g5V5c+85Q`Ten#q$Xg07uX>=i}faZ`-Y)$A3Wth=xB-Qo$rc`uH?$(Ryro z$A|CmD~bjSee>M17_9XS z5H0Dt#;12w5*VL;WU%px!TP2_@nfOnIq?s49_TSw15_sGSKQO-iMzwS{?K}PV^^T8 zGfs;cEv{+Z6pA`Wr*jV#im`2sj^h3=K#*i<7e9~OVKnh;Y3RFW7mnn-q4oROEkUu1 z+E4y=jqss3?)N+oq-j^M#X#xn9;R>zzyL|7B^D=KkFix z4#j~#hcf`JrsK))^R%_~!FFs`Azm0Vh&Gw>pUnsV=Ym7;cXmk(Z@I(7PlKaM<7 zl=&2ZTV0X2k^m~$Bby8PsWdcYGr_LtsxAhOc&FFI4u|`@hWX{3fBUgP`m}=5zqV>> zbjf87=ygs6$^R`dwx&@AlwU3)!)o8#c0S;v>?*%XVd@Tgr>)YPii#kBcOYDdIpK1YpjE{<>V`%0v5CpZn_q_c zL;hdpmTR=dyI2v{e@fPtzTdDXgER!5AlH5%!M&5pki24Bk6PQ%M%X5 zH~~-tAze%V?c~xWooEzV4yM*L6O9I)E^k@7E8|y>OU{As^H$FE{=8+55#3WFSLWj8DRZ zb?df+M;M5&RlJ#EYk=xb3p_jbF0;XE;<%Ku~!- zIZr!s~h>?JrnmXr&QydIiU@j%>`6ryz?qy6> zD7Kp;UVcF+@CnexgvP0YX^lSbvbMegySb8VKG*n+ES^S1%tC-ocyv=m{*)%Y6?=_mV_FfVeZr6+ z)YNjC`1zDL@2&&q-|`COaY4J&Npz+)e6N`--`(h{WrgK=r!igC4FOc?wY!w&^lV5; zJRwev9eaVz-<7JZUJ_jq_p#PE(qNb@J(6<0&6@*Y<6s3Yk^N2b(pXFyZ85aO&aY(= z?@8}1X2W{cgK|2{Sqv!wg?_;peFE&hz`kPKc4gpy-8dTtH7d)p6sNQq}*IpyU&yHv=H^tc%=*8Au2A)MRF;AF|RQZ+1wKi|1K;bOEdx>c*~@w+w~Us`qhZ&zO&Zy-_xxp3_yWVwF`;zQy~l5`SZ zBBVIWt&o4yXwFy){y5KrXqt}=JE^>@*j+M+3c(5naMdC5!BH@2^Jd2$JCdWs6VQzE6&T{D~Y%trqS6_rE08r7cB(ut5~HEZWz!h2WTp zA8s|XhOt2vvep8?yyj<{#-HOad$SS2T_OMtzzf{~u?v0v{;6hfeXb#e^g+ZKn{e#^ z`&<9}!8d|=M=0d0*R~BlJ>e*m?%61=|!+(Fa@1xl1A>ZVR!|RW|f27kyaZC7y z|Nh)+(WzTEKdL1HImYiYL;V^(FyY6{|86~>>toMkwE(9{UuGe=nvaLgxyX%v1#i%$0#4z7OkCrl z?47W;|EC{c)A-N#o5{iX-#^YR=l^$t8vj+F_GkZZxfO~jy~F|h?;pPF|JIs+Yo++V zE#@Dq6#v=$A3yM>iI|K3{qz5)U+mVx?a?}Wg+ZThafOaJT#e=|Lw;+`#>MQG1_|NA zUCVschNi{ZUvOw;BNW5w0)ACO`d6V3wY;-k$<#1hZzKGm(9StWKN9a=QO~uUE?BJB z?ou`A@C2Po=i`&^_on6fWvEO&aKdw(Z0Y*7Pl-Q1z1$Kce1kQHt8BfeNCv-f=t@7d z2!>6shr}g<#dN&=?@R(9%djBU`TJUinHJ6#ze}Y`*ur6_sG-(IA)^ZyM3W2UM$;E{ z7QLW9e0=7sA(hqD`ctOt6~D74;jlmYUd+i!;IThcffT>OQiMl0$)xSSF9FyVtf63@ zUbeNXH4>&1NtQnIEg9IQo_05Mi-TveqV;>xqT%cC^Gv@d{s;yN|@FUIZY2<9n|ENEv_^o9KC-FiV38{DewifkGAzi$t?<2{bI9U!UyhPbT=~pl*-xL0vm`Jjd_Y zOuA%Q==x(`u0|jM+Cj(ux$2gpx;$q&{}{G#ui1DaLB_iW(ro#yUBg#z0?KuMmSZhH zoW(2qQByXgX532b(i2)4pD8)ey>)HW`-9yK?}uF*OFygXlGMa@#h2PwT|{cM3H*b` zH^f7^b?wqMM;AbZgdyT3BFjqZ)M8K2Q8jDWv+6JJgWf~?ruli>29P?}DEpf(csI~L zT>^N&B@%=VDJ<|jf54T$i;u0^9mkVDw>@?QYAKS_JvGkyu-vi)Y zGX{0@RGW!G3?i?&R$a?gQk=p&vb(OnB;1IJX9>p)5gG=eBm}+CEQ`AiSu#I;rCqF{ zRbf}L`rCernXRKEGt;Rt@TZSuATMZs*d8IQ04cicJv8;sCaLek@hl;h{DMatjj7hu zXz?w37o?7L%sszdWiQj->!yw?*&nkBzEjp(j-D87;r@KQn%cg2%*J9?B|I{;F6mE3 zA>*k|lRV09mQt?!f;;CcR}wPpvX|-Yp(}3aQS-3~smo|osmjrD^ZpG7F0E&(icMYp$oeh2seVuQEM$t#nh zU>p4DjzDsJSK`3@;;V?(4B4U^N+)%4a{Kk|d%NJ*Ua~4C@YizJ`ps-I`D@&lcdBiF z8yVlxXKzCT`Om+^<-ywvO=t5tbA$QA8KF#HV^Q@H;mF0MZ|*if-d@q|Xb=f3V#d3% zHMxP1qM8zh^Q<5Lsx)+!91{{y|0(;L-XNJ9MrFQ6;ooorr_)cg0<-N-ejTf`VpAS; z0FZbNyiC;+Ed&<&!t+!(j!)`#xZYj!#nIlA4Jm~VzT0c|$szs#trAH;^21j! zh3^A{;#_sEd|Cj56n#WK01y{5SU!nDu?bsxzp?ptwb1d%uHH4@R9IL}w2#ofBnscU zt+aj6**l6jO490!ckT>BD4*0?NW{pEjYy);VxbB7?7zw-n4!;+<0k|mHa;r}3YgYv z$~p;a%pbNWeD4wM_geH0thtJ$swY6R*JPVHMZZ1lS%>AR&N8|ApwKi^yY8ggOo6~V zH<#3r%%baX@}Cf3l}fGd$HVPV$jc$JUXdNE!F*P51*H4_0BA5mjCbrjy$?zmtD%l znm19)eSpZD$sD=*lHz#BhJ-gBPJeDkMiz5+Zz=s0^ORK3xfg1Xh2bV>UK4g#@Vh z(kQpZnz?^MP(x(AXtyC#zz6|_9L(~HWV1{tYj}yf#??)>uR|U8l(~(*3nRMGkHFW< zbpYbXc^K{!%Ex+5grq7HY6Dwd_oHbt4 z8|h?L-#1M-8ZSuXt+x*yLWY%1O+&$5O@JZ!PMl+^4Oa$B_(cmB8oE$naGPAlc|3Y{ ztPGge+-+!vVC9iSSAXvQY+Q3?YNJuRooE>y+?T&~Zp%)ekc37q&He(e-u!M&{}`dm z8SU#N2o(3*qIq-iSVB7zJ#X|YzCW=hyTEW*3{-+7DzN8U{0akLN;jd>a9jfEcAY68 znnV03htWq(0DY9W?HP8m>RaodDIgO005vFQfy-KchN0xf12C=SQ$MvSEOcA>LNzF6 zjeRvQfj(EqeC%@atYK6*2!Do4Ur1av>Cz4P6+~uN-n!ctc)sSA6W!o3^o3Hw17?;k~BdkvAi##s6&aJEPCJ z3$v_TQ)5d8jto%GajwGR4K;|I5A8;d@y|c?1iz%87;O3n0w77b0S4)Aae?4K$O4?h zLLxc63$wdM&k2_hQu5T#FS!_Xl^#Fh?;&)8c>3p|8|EeM9zl0uaAH=$=ij*Yo{}8Y zeC&ZlZDaneeN{CzB0>W2_0veWTQUibQoL>G^8xDJjUJ#}@u zFl^5$ml-ngCV$pL`dqWT{kKkbFH*=PwPmtZR#}MhapepnN<7qnSzr` zLsmV?tIJL`8rE#Y<0k}ebw8CX4(PLLuc zF-}9ZD71fpW~9Fs%->TIQf7sba<5uS4DRViM!&n(OxK@VwHhJviP_;4h^144{ao*= zLFTNH?9CX+!;zrck?5hy6Gi@5hkYq4&%|{9S)k3;&^Cw_TM!eJw7lCtvRt$5X<(_5}qT0TzofJjSBL0~`Q>j*>1M#{sI&CV!@{G3ul zD*F`dOO}0P9}-88apzlMmAAF-HVkdqCL@BNO@8A@IzNl~n5^MAiS9htQhOQ_$4wP^X>NARZxD6Av8Ohz+H>eEV$2B_96ysoI1SXZin-@{6mBJo z?M-6qlx#wz2DS(_hB^|2UWt>6`_}9w$8j#uq^I3( z9TPV6qFuxH^%yGih#}ZIwca+LT>N?3#Nc@*Jbcla-Q{ZNKEk5CrMG&LSohg(!?r5B z6J4LintK4Geuq6Sc>jJ2sexGq_#dLbX%EWznwDmPnO$oOcoK*2E#@nUS9~? z>oh^@BG!04>fp>TJqr(U)lU-`j7cr-|DX%17Fs($qBaRNqTKdUW| zrh0(Bqh1~A5mLS421BqC)vm^VUZ&B1Ickipq@GM@2X>5)Y{GTm8)E$l0G|4PybmgK zCnQUO#C(8?D%1YHD|dJNnHpU1#>VjCN7hS`{D{C>X}>#%CwO5+n~AF4rBxT_ zy05{AWtU-#3elK!fDa+p&gVg3^BtEYw=p@`}Bjc32;AaM8hp6r%VX9*yD&p*M12nrEJ%-ADi~-Tc)=g-=)2~e}X%RKdadoZL z&Ud5FAkFHk)1AIF6%*t$C%c@)iDfBAK4JV}W zAffy9L$`P)p1wa5Ce?$Z5N3~Jn8!!5NvDzPSWSo^K0SqT&9EOANOIqUt9Qd`2U#n3 zs-!${0`3Ib9^?xXfvqWk@6#mTKE`*RXE|Y;dFxt2pNp*NOg|Op34qk1n+@LuRIcY3 zt^bgJyI11y`DgdSu3srZB3Y6Z5o9E?*7^?HfQ6&cpPg`7iwtUw@M9m*mY;Gnw0^K+ z$mEYZ-~y7wzV^Ns$T8FSvi`caI$1Jxn4>>kA7jk6wCg!Gf8)xqjV`3ed{fv;mRKk|&`ht>QJ#|j-$u!D?(k;c&F zt-B6>Gd35{S@y5NE^Z8^Mec@W6X}<)k;4hWNENy44sZH>6J5d$+iY4oNDApZP&ogl zb&(aNx;|S+?Ou1VW}ao2QC!e`wI$xmb1@oD-Y^m0gHw|StEk*VE|-zhKv0dyF z@$RLGF~w(gCvW+Cw&4?mFf}QmB00+3N|F3MWQDUvlB2rrG0{>rA6xek9R0i3vW~v& zwb*5~;V~cnmK9EXAGolyQ^<|;cTv>O#m!~g*#GjI>!!*v;ms1TiWS0NE z?nbB#w_UyQZm?5IoqHCQAxYqAZP>2~FO##AWA5w(yY?y*^i>f2@i;N_T?3oyw2N>B zDt-FgD%kKoCptomI{r}I^(eePk+_ppv6sc;ZY%e!#14G1=b!uAWi5BsmYpl6k&5Ji}>;Nk>O(d zU(gyk&&NqwPW?;!lwE#y;Ygf6;@Yy3?s=a6Yjs1}a01rE1NM*SdW=cRxjD<_kM)pu z=7+P;<4tUx>lbnP*AJaLb?Vu@)UpN&|U8r@t+7WN-c9? z1Jxdsv-@|Ca)$tm!>%xb8hx&Tw;&GyBoZ7u?^Q^7CY(jN!Od_Y$oc=>}%UkYyanNkC9~$L4yGdlrfHQoZ&_bhqy*Mi}&ROJ&;U zC)3+oO~}QCZT52~1sDou4@Ech5pF1|&B6`agw00YaY2sDQX(X*jGB7R&g1?3;Po7f zcSUvmkRqumC+{n;V{)`E@*j$D9yQ}13>ZKD<-a5^pQZqFm~j)28s+xC!&bcf#%(iK zH`2+OcE>P{gx&Bts^erpM0wWld%l$TnTOuR^Gui&NZ`7jf-3WXEGmJDlWkBwm#%L~ zF^b{uIa$S(b8}nQO0U;G6n5&~{ZxssTlNQJC($bddA7`? zcEXb-ehf5>y}<~xh=ocZyFx>?nXZDdO1reju+>-&S?9AikLbt38_lP8bww^QO-1Ec z!N+dM8X@lyLzs5EJ0b=kP=$v7mO`lc5l+q zp-Dy#uS&D+($;soCHKtlO~4WTTQ%VZLCON7GyLyax_3Wk+~osq^4-%KgBIT^;=bZ< zY`3#bn&3)}Mw3$df&m-Z7s zIp>u2Wy_lX^wVk9|D|@X(x!1BUc9s#UwhT--3KTI%b2*OQGeqZgUpM&4c5EQ?Mu|D z9NfQu0%73Y0=44D?nZv&Ej_xVq6L=!Cw2|?Yjc6va|AT?hq2{_2DdC^e=LxB?KiV+ znCm(Asn1H1I)hfm#bm;NdzDL*hTWg)p^ivu0~>Et9M2^Y9-SGO8gXWF21!_c;!D>5JHmBG{PgsY*IQ*G!An+s!n41YpnUypl~@ufDsm z?AM|0+NPuY7A=xrsSyE3Yd-s8jCO!V`W6$NdV>w0$HgxDYdvEF%Y&QF^VhwQJnj`m zfl2fc`SVeo%5jHX8@_%IZwRMGyl7+7BA|B9M2df|Eu4_OBT;FlZn(*b?H5M{y>VN6 zHSWviMs3kplQ`k|OgGALo+Wh9^rayJPQSBTkUp>e@e&pnpSm+179u|*rQKJnik#@h zSSH6MwtAPBsA(u`jox$>}{jxDjKgG>c?w|(xkcxlEKcxhle5Gzm!uuLqKq>j*{+c@LB_#(Fp5AT?cz^cX zx$s@o++3S3LY0d;ULyC1GUCatOM??>ls8F)>+dV>7g9^337xPr9#}paJE~7S+A%^X zhjuWufb>n0;mdimJxzb{gOrq%j>}1A80CF_zHnX%)rhXXeWxGFNHT2OeZ;MH!ex-J z3BN0xHxXw+Zpy=othVaeXSvA5Z)=89<3UWW%WWxDu_r&6b)x|%x9V6yN>0x6~@Y&g;%s6-row{`wO=I(YW>ODSUrJK(kWpUu zf?a=4v!xH8vAwdEq_WORrD=0#lnk!y_gi&Ubt1?%l~7 zV5!?Uy?#WnBb5W1LnemhFp+x%NhjBQGGL|H@_z+Urs8cKMV`1UnA zYPhFzhUSpyicRzu`iAP-Vh2Tdic$C%G`dCh%9x=Seo*8Xgw>B+h{^SyvmtFBO zgE(!PE;k7f;Y8f~6=|c!)9hPe+~OO#5Rpl_Did(F?K$>|PGtZ$w5obnyBw+X!*M&F zx|}y!%NpOET(|oTtUQ3pdsK>tlqraUDC4gF;uVFJHP(o_GrwN zRX)tBsA47MAZlEOlsMLVa&GKO&W5p94Wvq1JFiq>m@)hsYd&wt_28Cf^(E`}yj|3~ zwQJuNI88RM$fFX+@$+MWH1923>pka%rYMDe{NnZCd(2HKxwJ9CGF+6%>&L!!@7($L zg$F{%OfhfNLQHYY+<$Gn{**@!$nSDj{4$6dO5V=M&oi~|m;0zzliIELb+P_$My1X> z-yP1MBgm`VF8%V-g#hM9&(_cT?CdN288oYTt!oCAbDA!`XhI$9FMoJZOq7@$cHeU` zn$D=kibXC86`aW~M$uUBH2j-}XJF|cN7ZHm9vw3_(T~N#AoKFv!?wk*%O=)~KXmq3 z@#$aREmx!NwR<%|9Cy2QOEHH%zY^d&){nBO$+0MRkQ}t=N)jzRB8CEPx9r#nR5qUl zap_nuOWSkY$kdz7{Blem4eix=nW<>aCZ5ScR;BbcYBiPiywa8B=>^vx8&fFnSul2d zwao|Idgf}$_Mr$gtFS=u{nU2Y=ZC$Q$`B|g)qA0)aRp^jUS*@kV=`(UHpTAaA3YPd zoX9NNn$X(Bdx6zBi^nBa1@3msl}p&hlxI-|$LCG*@6>;G#;YOG1}WX3%bg?sXCD^F ze66dq8aj5}3~;w7r|Ag@ufIa1ie9htO`|3p?o@2nB0NHM#c+Go52Jd#87}n)H!caa zO>)2HJIj3)OS)lGG&H_a;`pt?w!C%y5dJA-#gOE~SnHR4Q61)AUR+l+L*g7GJN8Xj zKe&~mf4oI4EwqeMvVQJKy{gBS*|FiC3M9of2K(FJ?l2rz@n6kEfkIJab zM@Ke%u5;Nnx(c>$VqAK1xYgG^mS5vkacYTI#?z1`khz~$U9?l4GZG6#XJbBgapp~v z4ZE+H{sE&3H?^Yz!l|NHkkNXNSl2t7K5sETS{WITz1(F&gjIB5Qt-mSbWd$qu8CK- zMWlEn?<`6Y)>TYU%p&)#x!W98-L!RuT`pAHr|NfeKPhQ*PqW{Rc9vaFe}~wl#`5T> zw$OG3HOd;p(m&4N=)W1-sAO<9`h3<@r{(H-szjxTivAYPdSps~L@&Ia(D>iCm z-TD-jaj^Tk9eXDPQLb_wYY&f^aqh^wPZQ1O!3em+>6#lZHymVa{r}i|6ThDG_K!D= zeH;5)wh$q*R4R;RlI+<_AzPM;(xMc`E=5WxHP$4ANV{wmMT#hCp`8}8L`mm)W$tqx z=kYjy!8ym{ci+F6xre^r&*%NVme=)qy)L8f)k!s8Yv%J%qdV`%rQULH9Ph5@2$ zPP@p%s$F~w%YHtHsdHRin%4NK?X8*LsHOcJ!{HNVog=2sU@KcSP8_|~Z%&(6V>Gpn#!#z%j9II7M)$7oO$Q1b^=;2F5% z%%F%e=Rp0SDV>g3wWs@dX6BLWk0JllcI*G>4QgoHC07Gs`NZeJOn)^~+Y;3Hn|)9H z`hv;u(1+hrp{z1rbPc+0B6`stY6v{F=?lnS;Hk|fjJ~zwKbgV>(JqJ*jfqn5T?9;} zH$#Nc9zO!?XjOm~TQwh0S8G-?=zGB=Aw5tD;G?`)0~l2L)9J*Xw`K1));zxcGp_4dsrHvM`}ciSc|H8D$y2Rh<4z}g zL=Ck&l@Xnme4eJwb}D)#Ta{$Tcl!r^k){HY!u&*$hEq+QB}`{N@qPm@QP*P1k>^#0 zC!zxCISpa1#z__0q-arnh;$-L`P7noKcW23qrB=F)G*(!OWx>jw*Je0juJ*ca)S`>q~t3*Z}Vh8YcIlC5*77e0-^kF@Uwbi z@z$#!S*ld$^y3NXJbKva9H`P%H0feS}KZ!anE-OX=s#H?gYd>BWG<>dOBp?sbjvrzIjz|H*cMFWOSFBnyY}LOF}oC z5G*b7(MIy!y6mWMKc~t^)4hKs&l(oDzGt^?=6i>|UatWPsC`aOavQCl+O|oXYTSXL zS4HfK*_QnM`0?YPPhRxwW?3}9$g$j>`q!Kka3cF@EW_Q9o@5l3Ii+OY zsOEvh{`jwKtS`6xD|%m6esW@@9`w2wGE@g5mnn5BKEY~>-u@b8IVB>g#i1V$3F)PW zl}ktlwZ3_3M7jNWp&l0kA8iFN-H8EjmRB`=_i>IN$BGz4QQrE;FRa9DF2JdNGb%ON`z4Lzb?NFq0Jy=<;nOG z>{W~@F1=e$?$G-7IYe|kr+aoe8=W=a3^=x}im5rdi7*ww$Zyq>MLH17MI6It%bd|= zDa&Z1JAZPRb!7gxs#C*e@5t~GC4>k~C$-hh{~9t-A2IVQDPcEtvUOf@Cr)@~xB5Sy z_4(7M>yu=WW)?&sd{r&wALrKft(?h3`{60NYC@5qc`|6$M8 z+@u3jGI-`+5uRs`y^YW!sngC%Ve-U+w{h2D#>%Lkzw4r^|LUSNYTGsi-+#T4x23f0 z%bcp-HYA$SkOv{`eHzo7__I{o(-K+wBsNOix*tKKsP?1shsQjmZ}Goqv7)oJ$BnPF z-SUHJKB5W0F&nVKz}DGyJS{u0hz2(?GZht>-T@eJ+wb$fN9HKk&>mK zZV5m-fpnSzJ+07h!U^;M@k)-<=}Vtse<&i34@?15MKr|3QWrXkumIwB8Du^r4y|im zOYyF`0z`jPslQMO*McloQ=uT18y&gWV-$`;KoORyyiv2}ti#2MSE;`Gu|Eo#|bwdRfrrXDdrD-EmGC=L^d71&$)A_AHmD%WzYqj69Pc{3>cNp z7JA8QsqVu~rbjP|ijFI)(O5;LzV&O`!mOI?1&>+$?WY)#YZ3M7?<|^Ls7cH;PGR4v zflBcMDx2q2n*(89N!El6nkp<$&R@pfkF#&A)JO9EqFoJ5)MlMQh8{?E=r#ws8?{X@ za?{eX^gPETalMSY(yuVK6dr)k4uTD;TqsB+D4$Z>>XR>$E#J2FMDTbdU} zRQNov{d>J5k26SiAI^;N4!*&X~5Rqzj!Sk{)bR*6$5j z35{SYU;Og}uO#8wDyEVEZ$UTIcAELE(_xy+`Jk$b*Q3gL@8gSxwx>zB;_$h!1k%wh zAEC2o+oU)+&SI&Gym|Ruj$4^PI1U~5wsH=x8}1d^jKoS9sBC#~V=x*gkcV$7_Ym#| za)FAX?$|N4l?DV$h)Z{Ak zg=Q|dKl zV}0BUew10q|Mnr#Ua|NSA5-YOw&{J4=E(#?h$*D)v9Co013<00V)1hSq6J_YGAkF7 zw^htl21^Sqj{ESP(xl8*f~v+;KpF_%)T%te}FfQk#P?5le6OR7~OBe^2 zO`U%{%)9g<>SN8Z4m87+Dii1;biX{CWa6ze-iN6jC65XE+_V`QS@~{I1Lg}O%h=3S zoSgJZCyH?pw=Dp~fkMGSDaWfQF>}qAv+m;_rxraLLyaKDK%%kBI!6>rKi%_`_TYmq zMmFm@d6BAKv||9Sb<%11_=T3LH+cmLMTyonZTSBQXRw!XKXYwqv*ZJuv$5Yss;lcX znYxiuU8%}rod3?4+NkKIn|yqp7KN`a=9F5&~d`L>4vZY>pSbDgrnd>XZ z2ARnPH<>w7ge10EPdE_Q8^xzDuy2rtZ!j&T_#0$7nM7rI>jwQ(n{6>)_-z|zY-V-) zQM2%`lyPE1;^zDF9Rs+~NhV0%9N+BKRx{2hh6A<6&mpeOnws}7h>Mz6-O3qbAsDVm z2>lT#v7}D`W@@yoU{3H z=K3g@QWDf{H4T9{-ZS$QH6yS2F>|~uF>DZ+@ratfTJ#r@dad6ZJ=Xfx>E};xt+;1S zCW@4zg-lbq^YUC9;c`#^hR^m~e2j05zHY{HI=OA5p|r{Qv{=A-(jDNIUbJlSEnp?4 zI!SFDx5O*jU0nId!)?*baTVXJqn{NWw9j*r}-D)}}@lymXi6!iLyVS~SM7^6n3;-d|B5ob$1Wc$9bPH3DGq7+Gv`CX&X&ZRc)f z?6DS8n{RorK}goZxY?ULws<_8B=;3Nly!gPAKgkx`t*nM%oFNU2z;XY6?WwGgNwE1 z3&MPk%#qP2SZ)@5&e#+0V$Bti;`y<>(Pf}jXLvY`J znIkaa>Tv!$)`1FnI79zY9oSrk|ZK8*7tT8J)AqS0*-t!UyB-lvm`nk}`X3fS-5})X(l=sg-QHETh)D zO?#y;y&+D+O7UWwh57fcQ|p8p1FLzgAtL&bh)vy{xn8#;HQz8sR@yex5{}sj%cxI# zgqtY8gV~t|_04dx!IN>7cCckm%(vy%4|#36ev)seLwxL40YHBNK)ev$jN5maYD3NI zS!>`mcoj*%r$e?t;4m2?YLK?Y&3puX?&5Og6SP1XGfZk_Am|^7tx=)$Vh4u#l-UU*$R*|21Fd%6U>?Q{CU_u&{wq6?(-Y6w#n$4zbNb2wtnQ{Cals^$NGO; zlfw09wR+l-qkeuCOFsbxc*5R_;X(TU8A&xH^D` zKH(fE(FV^zzM6rX0s>UaB+Q&vVAIPH!b|F?r{~IEuglQZeANt9wk9&41SEc4VgZHZ zYw=mbq8W@NZamKdI2uGVrk%so65ox-QDD}qQP@Zx&=BGgH${k81N!#8H(5{52R?Sq z>>?@G<&?M=T{O%wLaL=Mz0&>z2h>R_g(zTF!SR zp4MY)YrCQhg$=bOxH$I-G3||i7H-rXd`LVpOemNP79eQxMzIW zvxjqQKEbP4U;_tpl*`XgdmReA7EY(!%zC(I>n>g0mJ)JH(H(j%+Yp$@!s`5JFPbu31F^mx$)l_)uEAgfEQ+|WT9`D& zfb6$JI{!pxTj94hFE7t*+>iVYc(;*uGV`>uLFa+**a?)7w+NQ~2>dLD6S7v5MlR5> z2|r6~@Xw`#Ir&OCyV-iTc<{Y|3l~mGh4E??FWvUiLLh&oZMQM53DAndPf%&wjR<`B zQsqgFJC}K)@lPUy)DyZF@ADI@NSG%}CLgulNM$Bm!dq=i z=2M@(sTJ3!vPb@FW?G3*8#|Uz!=Ar>)mYj&LkGC=CF7PZ@xaYrNP^dXs|S8h^oz=f zeQp!uz-KlF_|C@@_`*MLzrBoduofQ!a7hr)FKfp~!(%@VV?3j6K^jNDv>fw+DMybV zUmK8r04?5e{@8T00tLq)>|o3R*@TC|=0LYV{=VjYVp1q9<>L%XvPz-zI;U@-60B!? zxxd}0iqIf3{qW)jcgRGd#ux*RajnOdPi+KJ7$Jqd%&*&e2T7yl9v^y} z^uN{E%jE)y{#N6%rKcx0{>)R+szxDlQg9GYl{xo{UwDPe70FxlBjrS6Cl_cw1f5k& zjCDgaDsFV%XweeoerTlqcP3zOIxPB~ zX$U@>oCdJx&RleOaxTsqst!-`)6Lv8#8T+K)MW4G9DfD8x+0!G5)RVmAPa7zr0MK8H2R>qdNb%(k{~!Z+!VM`+ndK2q6F-CL zZ`Q-Nu>F#3cOb$)R`k<(e8~1-!zru~3)otF8R+t!4YPH)(k(iT{cx!z#gRH^pwfP( zM-pZ8)3FW(cqd%|QB|r{K9Ok=IrMqO&d-}rVOc}sgJlyQYGe`KKk?{7{61#HyD93r zZ3^AU)(Wb((Mp?6Z4Cw?)DOW&r{*-$Z5?<@O4~NykWh!pENNVnY)7>}^=5PE6$SvS zA%%TAt-fkjc2ar%EXUm*v_dCA`O*a}7l7QP5A=#A5^ij#9lN<9Bem9^l2qq|9qxS! zR^$FtR0-Xt{I4hA9O;;!{rtWuKK5cXh4e#Ve7fCDcU}(4{JyQ@gs&! zzH37ne_=z$4W;Cf0Y+=rUKEZ{w^3^kcVoBrG0RSe72)I+x@ngu+)T(P)UXj~Ip<)! zo&U&|-}#iIc-=7>xSZvMoxo6kw6Nx0sV*str$5_xEGOr)7nzx^EBBL*&HKl3s0@oQ z8$|gtd|J*Rz>@D@p!qkIkvvAy|3>2OD%Y7qo9f^WRW;e`=T)I~!dpeK{(R}5Od5nV zKU&6X-Nrjdb%S^q2m>f3Fvt~qEX!VT#|>|9D1H^}PY(NJKmO?(l4;WDSH@;S7PQNu zzds@3#t(LJCxl!K%`s0a_#Qir#{eva3Jvb83!vT;`7JV!h>6f*;;!@QL5D)3090Gr z=5>s!R%5WH>*pQKNcIGlBtCRbtHX=Gb62+ZEc#;0?>`QF6KUZ0g>!hEBlN^m%``i& zNYfhQ9S1*whVT;;UoM1tA*5_M6onMtW0;zF*Q{ZY zXUt+k@-`L17HW!H;c)byYJKX*cN8jW(#g?@S?rLwegR&wP$c`+C0#+$aDhgCafG@~ z)r$HyaLAw5mrzod;rlnQM+U;{d@(s%w(Z@BTw`Yo+JQ#0)B zR}4V5&~72di5=&vEVg9Gm2TfZAtM45HAD4ZM?2mY8@zy(m&8g1%O%BchcT=Zn3CL0 z{tps04j)`}PeAtzNoreA&IF3kb)irlXWQF{DUJ&uIIgZfnZet=EGQ6C2T$ZB=!UO? z@m!>Lv0djUKHDO@ZnNeRJ;yo%nzA|9No-C|c?{yTh$ZpkyK7W{QwfW=@3#@VJQCm) zzM>F?JkAj*sn!1OjwqFGQH9?V>9Y{Co|8HbH_)^7#d%l^fOj4$&6@gAo)B&Ezn z>R`iU;}Y@g+wwO8+yR4TzMam)GeAb`t$f8KdI?xGLsJpJ*AK4zZ}S@X4KpyCl6@C*kyqRv8uWt=gIja&cN^N5MQ&_>Hj-x?t!_DHO^05>0dV~k!Ny{L=JFp(2)@8j0B+BPQLu=%54lJZt5T)N0*reb3&DAW1Mq9R< zOfSb=EDUX@`FTKKpdb<zO3SZ<~emJW&ebYyvi0p&-E+%HP2^g(Fq7)$VB zMPo)!%OBS1KZ9-jIO+RB9M2T^SjGejcr`9*N)^+p4|J~H%C)o%qBAe`G#G}PoUmlT z4k*P1Wm#pu6O%xN!-k7};_wbqSos$K{#W9jz6XVm?^#uSwF?BS^?XW?bN};7bC`xI znphD?MN+TcUJ~W4%$dTxau9EjqGdi!7j^5F(Rd?^Y@Q%4M&(cqHhI*8JA1>Fi9v6F zoe=gk7bks?_ZxcYOY|E0soZ@1dWX3#Jr{~~OYeo<%mnv(PZjzMy>Spi-`9g2CgRsj z20kyqCRgXA`l@MH)lM;nJuEO=1hHA597acC7?Duf{_`4{a0BgVC13Uw*F@Y8=h9kK z6Q{O-pk)s7PU0?zJrjDw5}M)^klr$}e(3#bQ)BVm+3W=m6^~CNl<~sgOKsZAX<2~r zX7Y%5cuU~|uWKrTAjOA{e2@U4I>;)hnJliuU(oh(|F4Y9 ziz#Oo&@PN(xsKdR@nQ&D$$;jx46&nob?lhGHaSoP@?`D^q)DY03&s#a z9lf&lya&MzbWfkI`#nn{FY*D$(aX;8{(rDPFeF8@b!82KwW_>R6+%d zzk*;IVi_VKdNcx15nTR$6u+-lm+5?2G2WEeM2qmPt82`0EGKZD{&KISn(QTj`gZI< z=b`HYcofE)zg^iTp4mJ#P~x<9$p=vIZleW|)Io<8@S9UVQU>NCa3n0v<>ZTH91aa) z3P*wcg)*i@q_`lnLHJOli|<}+;{vm%cGbi9ORF{#<0yLNEl5}p7phXvmNI0KLPmU< z`K?Ao1w_e=fn7015z)R-%pM>Q`IjNp63S|UuW)&-eJysb^}0|}9%W}R5c+%6i7AMq zD<7uiQ+L*n4v9@N1!NL*>XgR^@q7a5TF-s%POWLdLWp_>aG1((3Bj4+amDl)orK{=r|>|C*o_J7a=Sr2hN$|0N@+ z-(UIv|Hl8XbQv2*bJVnfLReQYTZu0)AH+*lE{SMcLFe_UDQMfz=YL2v9{Jz#*X&>x z6kBi*Beh%)#tfo=9|c=heD+}u8PYtV0A+^Ff#YewuQw9GP9ZGsw_mBkcGYftVXqzXh0owQlt#xQPWBgpWN<3DZKy29byA7K zeYs4^HbGJNKZ`^K;}Knr8eeTC{EaSYLh&MVk|63`5JM*MXhnk|6E+}+5b@fOU%3bF z@`P4Nat^yl4jrm5t0H8}&1%`4C}p&7ViP1ET&D~X{@oF8AB^ne z^bTEgEml!=(Y1et4JHG!@(c#%dLGi1qeqU+=tH|j#h%)&w*I4&PXo9EhhLGzw>u?t zJ1VVeHHIB?1=B@f_&3=mD zVmRD$umu%$R{Z|ui~=yh(9-)Ajt+hu&8pa?fjhj5$vOI@>sdbII&gppu%i&CUQ&(A zuY^`|ZpJ#BHR#<-8V%urP?w9*_Lg|Y7*Dl6t83$GAuR49YcQEoYl6cW}*N6QNa zxLHisJP(yXL$0JzU&8h2F6rhE{nG+&qpj{>>T;m>cuEW=S%-1gcAT^6;#p| zB7FjUQza$~or@b%Um?p+{{2LI5wNy9$#}1tHv2`utX{OU(_j&n%Pa>osRu{=4QbBP z0FW+&y#~@3ij^HL&|3>u*@d%7?QQYV`LeBnGFi$$p|qg)5C>-ELHG#CB<|k*`&%+M z-j+2=Nq-8zi(gjR@=AMsG-|2vBT2+^c#a2MjgTKcn6n)@l-r3CU{ik4WL{~^uj=*s zsnE`Y!D80(`rUkiQD-o&a$97}-tG_ZDbmD3mJ}*gvv9?Q4JH7c=vq%gye?aH?)Q&Y zi0u)#ph139azd^rC!6jx<1VAICbeX48Cxqo^weXAAU7=Pm->RI<-)unqQ} zFdLN3spSQr6k4%7-F^USk{n?{A7d)5>qcleCs2G?|1KitO(M#KQIwlxa6>Fw&*?!el znIg)lcNnLw%i1WvQM2I+z9)zbXm>p!d}@qYZ<9t{;L_ltcnbQU3V`p&x$5P-8t zcom~uaUQSw6&_|hj6YPs9{+Fm?&)?%s{@hic zo+Zcwf(Q!0V+?|KQXWe9RVC#{Gd^6$9~)VfT!3e*7>9{@6v9056)QiQMBWisHr)@x zGXA7hjTNFU#7UV}E z&nbnB$Gj|ek-C7tVui?1rl-U2KUv{$mk~UcJJSCBn1Cnuf~&@XtQMaoO z-|A^Fe${HJ9tpT#0M`PUh}nh!LwD@ZAul_aLI)%v;arcP!^{V0*Xd_9ti~wdCxp>7Ue*o`H1(I zg684Oqxb*xL_Sg%20{%Js%nkWv^5gV`uVZK2pcZFr;PCw@u(N)XwHx@m&UF>?q>_9 zbR*1_XybV-s}&g7{pg(k9!Wxw1j-yDwbetbaAR?>3F8old5&!$4f&i6T9m7Xv9V%ezmLpjx(VakGzLrOiDF`s<>nk9Wj~drEJ9L7^*f81%h#>$|4Y8!8gUD{@pC`fJBKL5 zu9BZ+t73#t)j5&7ylrX0-5!kO1~7Y>MmS>%&6%B%O`Zj@)ZVNthH%1UPP?^!AuyQg z^P?~MAb{IpRV@)Q%h>IR;3NFXeH@!UnAkf^i30IzGwP4})dSkT8^s8K>aRcc%Nk4n z=Vg#lYzBm&QK!uVWxnV=B2H13ErAjb0_qkEK_-%$ZfA(Ve9_Cnh>{67 zTk?PZNCkPUkGYx$>D;y_W;2PuiE|VWBy&baXH3W0-7HSCw$B@1XJ&JtwUC;9q+#_hS46iM>BTJySw88N63n61p} zDp5I=HiEwzi>0v~6pHyEw8yp~d)ZB){jDu_`j88Y!M0|zIZWnh?maDKp$FrNs$YjR zvM(|})872wJ2H;>?+by4#;&5xSSm7i#~kbwg=XDvV30_EDe;$33zw&}W=j^wFp1OL zZ2ixOzhyZK-Igph{88;!^C3bQqO}aLK9GIVh$XVN6?@Sd-*_6Ndc}5?oyR!<+Epd_ zqk^D7NU~@26WRRt2Lk!}{l!m(xMV6!7auBn!8w&m-_MlKl%@-V{gt=gwaMHHug`mr_keu&{D-sa^8 za}pPq`_BiZ^^*@K^Lz{P^ulXoMu@sIsn-l4HqA#spg$K3m{Rhrkg55&;m%tGZ`oe= ze}2~e@>w6t&Btt31&1TW9$3c60v^#_9Pu&4MJ)w89mVSi<38-^VPW;)Mq*c74<*p! zA~unm{*3#<`ixu)?aWSV5Lb&cyt4SKON5^%tobLLV^WI5iNdF+WJjr8Ce_pyN@MGB zwzf#CrclZzra6x1k^dAwQs9^ubZ@9_>~K^~N)g*j6#LS_iWmv!w4P=1)SvdMM<^0{ zP&kBbz`{qwEn}U3hG}4rMF-voW!0-ggp4YA6Fv+}^F5)Zbj;uTo zuD z4j;J63Mgbe9LtDF(-egW9~fC69Jp*8w1G4W4|;Y=Itd8D3$LCk!S^bKV@#4Z zW_%=^c-gjeVLGNCvh#|wJC>z?V&*{vlhsDKEd(M&>}V*Ad-0Rgh}@Wd?JtHTsidK= z_;5UW<*il1H=AIwtUi-CG?h%Uo1`kDb1A;wT<2A(z<~vw7$meGZa!scAD&382R--6zxSC2Z&EXM0{W zOkkRFtSFe*(P9Z@fweG}EY{ktnqG2#0I_YOhL&&4wEpy*04MdB+V-ByHjK7h0jjqd z+~jZtcAo1fIo%fVUy26fma34TUUBqGHO*zWu{hC_%``U$Pe!IB^AAC1$SsLPh$#m; z%KW=@9@C$eJP|6@o3Ijsjp!&OWDZ>j{|-0UjY{s({PQWe6qb0LW00u7repC)q2=nQ za$>e{awBEK`GheeLQmRJDI14#ml9q{eUCkUJ$SQ-QVv>}x>QG-)jZMXUgVUyr8A?G zr89b^(~eP#5}#xdg6w`}1(+odce^oe2siO}lLZB`yc_*TQxPjgLy7;n(?l0i zwp3&t|k~S_Y`jSbEN|D%0~EeP-k%QRWW9mZA+MS8jXpX=U7v#BHps z83G7-&fO^+mEX?wN?}{tiG@;$Ro;@>IKBjK>FD^tjQXLX!IH&82oHKgSl1?K0xwmP z1)Hvv2kBKkBAzbJBjn%-FiDtT^~b0p`c;ZEK87uqe0Reh8lh4!RsSU>y;~Vieuair zEL-9@V6x3e_G>FxozP^*9kkjDsNeM<3Pj3aT6Q_n+sF=cPgrVpcl*bsulq$-wkn`W z>766A8N5C6_7RT$f<9vRVAwI~OqnU#Rs^t72T)C_wc>=x_L4NA!iW#T3$_Z%tIWT_ zc2IUn>QzL2cB4}-a0_7VEwj`kK1L+WuUNa35c7^H%jzdFlaVcZJl`MHtAFJrgN3A@ z4v`t3j00s-H;n!49k(G&6C#Sh;lMg3l*bDx(mQqSdXWQbOtKEoy=^`5C5Om`F4WjT zz1Lq2w(D3Bu*LD#@eW*u(EvF`=UG)MaEM(+4Qdjes`xhdt5^{!Xfa_}RYfI1QH~X~R$T%lm$su+ z!S(GO=h!4TW@Mbej3NmT`2@#y2`1k!xI@QJv_{=QA10Xgn;I#rzW!xs<|-D`kl^OQ zj7<$Z|5IBwy{~@%Mg4HmSW}6-%1j!j$!=4b0Bk?Vj&=EvNWoG85-)>lWDXL56b+Je z1#$;jaemv->d60I(g_`x=U|e>AOM&ymt?E)*2T0z@9Fv3sO_S^q#C%@L|!0{JlNN+ zKK4~jTjrVq0wgG*tWAf`^hNX0s5n`?C-^%elCL1l>p+U6M-_+-ca+Cn^NM*7H&zpl zL?7o^2L+0W^O~!_HXcIpN%p-0o)u;$&ufO^?{3N}=}0 z`t=`rmB)CFcX9SqUD(FW&CUKx@sX(MC9Wa!pTuSio>Ta+u~XkvO&QAQ6(fw*c|6rlp=?R8jUIb z@Zo-3ToXP@9RK;VbLRn3d-v_z*S?6?H(WzQ4_e>3A)1<+X?|Pr>Ay=qoLf=R*4o;7 z(CyIBJ$`^lr zmICEIohc0UIOWeebnd)|lzjj7>m}d+PEJqnN-~S* z9~jo^|JAqenWWx*`!*yR$iBVVY_A>Ue&E0~uZaE6V|R(QHV`Q zXhvUW@Ns2Aa!1t#twKXXW&5bj(`es`r(>x$=U^ko%Ad(5=uP^bvFY5QL!-8B+v>Rd z>IwC67xSa2DYJo6ic3oFK781is=reGe50oeMz>rOH2K8BcLN7cp1dxXN~c+i7VU4q z8tX^+ns}kjhK(Bw+R-cQB33;zyFzT+2kP0|G{#BAG)9M>$f_`@+vy_Sv3+gzXk6n} z^A!%OnU34FcklhQG_PLj`}ghhCic#ngfa`&3jTHQJ9Co6CNb=R{015D@H-Gp( zl~d&LyUEFI6_%}9WnK4!eMsqWXd5}zI$X*EXf+O_Lnnv3BhN8X1t_Ka+DI-bY( z_uqfta|s9@GGxfI)vKGRsRhq-n0uIy5;A+RSJ>9CgIl#~B@er6j~)iMVq;@Fs^#iU zo}5ckm<;4S8@rpHU{jYCFJ9bd%~RirE-UEO8`9=I1j5Yy@ImzjU%~3ryD3m@72#$5 zxvu`mj^Lku{8D15u>Jh`0yWFrq@x4de);+pFR3HBpOwxJb>xw6I2kGi?F0YBV920aVpKDYe+`vdq|tvsN8XwsxfM|g2vyLQcmTfLTU zap&h}Z{EE5Hz=qkYvW5B8=HU6p8W@Bh0nw0aKe;%^s$t*Dd+S%ELyav*{sXs9V(UY zh91=C1MT3<#ooKukn9|X9`RFUfkAHK_KUphd#xMo2aDNDnPmpeDLvXz!y+f<5RB4X z{t-iRU06>C=tu6MB>J^LqR^p#=LUZKR%XOA%MDQb(IM1)(1^O}EOeju< zSLY(JD7^>{wewCzhs4-e1<<)E2%SFin9!kgN%kMFM;(z8y3q&^6XlvBxzcl+5{tvO z)rmb*mUDWryKEva zC8lQU_m8KePI1oEM<^;PN?e6ndKVvzYgj~4WE*75&!tLp@EriQvl~33MFyk0YcyQ! zgKEoGMaeVmqcvx}-^*cmSf8ctY}r5c3L)b(fqNp;%v}V#mWx+hoOfwu+aMR)re-Uc zW_H79Z##gxXI9L%9(QWL`8@OP2B6equ-E%YyB*F?jF`#fme1wARA0wZ;9q(#l?9i( zD#X5dW4yItuL(Dv_H5mv#XVmw>)DJ(@gr#Ry;3=zt8m_r1aslL_0a+0j#b05@3^?* z8|P9bCXj^Y{?+qQAZluB4=nL|lhsk8n_2Pu_xH#gh$yD8pk@RC;}0WK)s8JV)NLGLo_CJ@V0Z2wj491808O`crx9W({N;W6zwC*gffNsCxmvQJ=5Tym zTwl2Q33D@<4-E%sHE-#p0G(w3n8G1EcUne|_vokB29-;P@9K6n*$v;_j`>C!=tAM; z={>0Rxxx*j&u$8>-o_;{ANXs3|Gu}jP%}ii)R`nuv@5i1*|N`bWgu!j2Hd+Zlefa0 ze%v^`Y5-q|g!ZFc;{pL--@${Eh!CSHd$c5Oy7DcXI#qvZ4&`EppP$mlRSoJg2j*>a za*AIV?2W^LNc{PMx^pGkespd1Se3(Mt)tC&P-QgCjkj4{KD zCTw#-3!s90%RY}sb!;(Z=g2~;kM=7Ap^J2-9^2{T<8$~`pkY%uHXU#Hj~F@fXy|Cl zl^m>2G?~~6RyJ~vJ4TqgPc)N37!aYLq zK1M%h>O~(;<_gp+6XC9Fx9TybRTnjrj+IGg$VagMn-HD*sojl_Z_07WTY82Nqi+QS zMPB-siE5?CgTzDwrP^m;AJ?Es^XD{@UZ)bry8HL5 z&(+n_+xa3Y!D56*vrNZ~8B=-t{3V{q8%kUKV5%FgtxifXNJ1VDNPp|LtWfWLH(!wk zH~sqQke-oomvWS+I+=t1jLg9|=}g?GU^#r}kcuHC)6S5Pki*Op2A1qeJjV;aPsMYc z@$B-214fP(dg}JHPIqZ7mswb}adNn1$txc|YSd(^&htaJQ$H2QQ&v2~%@U{S z!FO%(USAkbb-$cWxdor>fNI(xlJSlo51YaJz5i~*!BqXJ&z<)(2fV7B zr7Yc8e$oj;r4Do26T#0?bTw<+HXelOPR&Zo4I74Vz5XHfF6Yu3KRY{pO5nT|{G;?+ z>$@a9d9wR+G5z^=e#(XS{`;}fK^)hD+0D$4RgQGM*SV3(wcDC2xc3^rhor!%{fC0A z&c^mOYklNE^C4zfJ#Tp4@8-!X6K8b(csJwH_K^8~%O22a&Q;|WSlQS-VAuCKNm5W| zI#qj2I@S5(9nki^Oqx|z0ui35?0Jn`^(NA;Es1(EK{5rOcV;?o1MDn1v}>1A$Fq~F z3;xhu+RgT@Osgt#-07$qDX@~NnVp?oiH@Td8ISqaGFmWbA&qIom0$Gh*KZEhqK^GX z1r9~mQEUH%uCoJ6hGyGd7xMe5l#F%`eA!+^9%3%5vtT_&HgP--4*j<89~)r#0z7tfkB?Syt_}|8L%n_ zG9_rtG~zB*`6fWiz}4&5AEdZEXMgu=5YJn4>{zMi*j&Hkn$gi6I~uUX-~cEkRqAZ} zoM1^Ks00_?SlPTh=Z-rNW`fanwfKevytg!|bhAazW6hO^t_hlbw(-wkO{3cJ5}H~{ zJ9R~3;J0tzCXR8aTsdUP&8Z0?3F%Q=$=! zcKimnJi?Kad?_!6e3(m{{~i4Oe1w-*C+U%a(^^y*44E}+mTM1n<~0SYauW|7 zW*9$-(3^tA7nxFj$2FbSa?$&+?ZI;c`Lx?f z9r`CupY8+xc{KO_K>DkcWT&6s+YxRaBJ3b|C;zdgm7~4=zu-g)3I+xS6zBPo2M6(F zq#AT}brnbWf%cb7xSur6j9$j$hG|{+fOvaE!_wsRtV~=`dePaFZg)j_DuZtkRTuA6 zY_A>y5!d{~^9NR2wmgIZQ}Ah)uJcdL6us8xnr_>+?f8ikkMjIML0hAX80zkl@a9cV zVE7~PlS>9rK}g-kss6-F*1vr2Ca{8=7Fpd{_VJJh2*`A0G;>c0jlkUZXc4ZH(gPP@ zT!(YvkG&ek10Iq|Mj%L8v}DN&0t989GO*mBG-e5hz>80VG~cUfuR3g48`_3@)O6Q* zb$`?)!B|7D(Uc6C!lhHLQ=Gcr`&h{Qi*Fl_qe3}%C2aew$?MF(1Hkb+0db$h&}56; zVLIyF+4-~M8No<>1+!_$N-je@HSjK13i9GL^u)`^QPM)w@l~ozZsYAWP`I%s*^O+i zY+pS{UA?{Bby!b(IR^Ld-J5tZFLCE|x)H0-g)h5K!i&k{wtNn+NkhjhPm(ec=+m77Z}AmLPAC| zf^v>nW=Gq}0wYCGH`%BVHT|3y9J%F$1k(RI5P&#dpR}QYCJ>M=o8D2Pr0JOLJ&zJ( zQH0GP48OLs$E+{UQa}fbX_t+|)j{pOE{A6RoZNqit@NnVIDU!4(GvYJ%e}vM#IRgd zuW6jtKN!9JHGB4-3KM7{k*VD0BRh}H2OsNOy^g=vBpgC1-AU>AIPv?>A0c1z4_&=F z43Fl6=(VP8A;)s4mJ=fvg<194uwg@tLscE;v@3UePe8yxg=JLeUE%yi%?Of6)TT|F z*(x0swo~%mzk9a%LXXm(=L(&n3ZVE)mJXnZ6-u<*mDAq>wCdkZYUg+5DvIPn+N z5ZzT5`glsxpCuJnf?IxHy?S+O)x*iJ%Rz~Yvm!MZ&HqCo@)nA~J=|H&ZKdM7PP>c4 z%rtw`xep#ZSO$qB{l==62%vkVr>8H240!KHF&RkH>HBaB``%F+TAtJTk8}FI9V|VU z8KWR`tPnUrU^@fb03f5_-L~%f?iqt$*fj7bp{D+A96Rt#t13Vi30yccc-&y-u?&Is zT0D-P`Lur@vAr%0@!cnQnawk}%_DF|t`F`W2M-+BdF$3_u)TfssN3v@cjuWfbjYOv zQP?i!3{%75>go*@1dJs6#nHwLUlyxCzx&9!$pi{DzR_{bO?~10AJ%oWrBC@67EtAa zD{qU7_fhk_`*8ay_|86l5DgPmxp%R(dF$4#N8o!h{p6_Tl!7_6b^AtnQ;$2lEAQF6 zw<#V7Lax{&Of zu3x`iVZw$DrL*c>>LRwgtJTF!em#?LOISg1*&3K*FKh-W?eI$N2_Akfh8xjhP1?XT zF4b_tpiTLkZak`gfauU69-zUQrps5er);}%J2}AB+l2U4((uhh83;SNS532Ls?1YC51F(;}??zjyWltRG|Z?h3+*VB84 zTINY)G2M}yDkw-vDuoia?cj3cpI7e{Al2-E-u3f)=mta5e%lRf-OyPPH{Lc_2nlV(n0iXLV!U1#jeSHXLPXcJ3 z7(LO^G{n}h_U(@}FoNUScEbq!ZJoNU-k2TLjr5C&kJeK^-GkIU`kAFJ$vkf|nVNB= zZR@Fdjr(nR23OZO%<8WQrQypIC_MZ8)M(SJ*#y=|oIBMzAB3(+)22p$9&SAlG58+}R<^c(gXQlI&Y~uG$iIHa zLBrhRi|>_*PrA@C3~pzB#O6(g@oOzQ+QZz9 zcH25Jv7zfd%c~i092M{VdB&3`PtJc}dd&RbE%k+DK_Z(=gne6uw!OxAcCMiOa$_>J zzN~jC@g~f%>Z%Q<96P|J27I^NU~ayjvT%TAW;h*9@#|ZvPq~{!c=Ixsfpbl%!6w55 z@%Xa!*H10tU;A1JcD+kWOFh0+XLQI6d`qikWo>QnMYe!5g)m56&vzyHbj5P6HA4&I zDEoF`s+BIDqs(}6fcSlCzJD^ilry~@--JH8c~N%JqoYm9gTG2v{9GuZubnFEV`_9w zlZX7O?l|tq7%)VB#(jD|F_$e#HbjZi-ZxFLXV0IBAkj z^z`&fF0WCLx{W4b&=)6)6%{;G3?hatxv4^-?nY>7xoz_6xR)EAS+(KVkp5=FI7m|sYay8&X zOQwR*ad;iGIL%G({^;0Zx2NcyQ|EL!=Rj{YP9jT>`pEJCR>VPO^38L0Ib}Un2?0X- z=jhQ6Fr5dj;&&G#y7<_!E64T7+`wItk=jb*on5KH9wjyeC+8|n8apZN`ST7u2R%@n z6y~je%sQM1UAcMYXrsl8Pg4X;oV6M9TO(#eJG{NUqdfb7&oo^&D`LM;y#_KSa=3_PX;+XV7Sf zsim)Peej+Y7T`@M-t3il38n7r)Xuzfj~+dwd5jFkFS`%Is9(oSPqGGGXWD4`92w3= z*p&1=wZ1m(m36*h-@$`hfYt53bH`<;Sp%ZDcmAn`GL{0=y2~@AgRWFph^4T}&dz2g zsz_4nqt?N^lh?GyggCm=Gw@#S6=`(n(BbWV2PcPhzi3z|e(Oj6ct}||Vs%nip>n?7 z(%dx0*51LPx!y)WgJqQO)kA&IwoRcYH6?5gsQJ2U?>?1I;f!r@Uj6v>tJe+g;|ji4 z!qI{5&wMgqG&Eyw*v@YPKzU={qs)R&d&_u?|7vDW`w!4W#qod?{ZVGud-wJmGp6%k zuW7$J=O)^EfC)?>TMuUo8;h#G2eho4cD}vz$+sDb<+j|JkF5s*8~a z&;DQVqB~CabanBM>%qL-FfLX((I$kh~;eg(J;Y-ipG2o9X9A0asB)IVg1A$PA%!~E)A_*Y3${Iqy_oe?w^Hf66z z-#w&2G2h&+>f-#M&cGu5SDyQ&X*5Geg6z>xh9laY_o0>u3lDFedF15r;{yIRfBOB5 zePLlCzvI~O2Q--@;Wmvw?amXvnFDMoOIe33jp)b=*284{+{m8M(b4krq#~hai072& zTQ-ex`u3O#NctgKmAa4ngNUQcq%)1OA0gp}YV<8Ul8MQj=izK=z}~T!lrGedRnOnv zh;Rg-rH~o|x#`2pp-aaH&_i|PUzm|*eR;o%xxl`(N6TrXn|Jo<@PX2-Qe{4qJHk_A zqLm6+P)hX|h7sFYIpqdo?$NGq;ndL<<#upKXppIhsG z>Cy)rz|4j=aOO~p{JzuHb7?fed&DRucR)`C0oATu85fhZ!}(h`tfv$R(|clK#tB8L zYxnLgw(yqttj+z~9&&XRhL3WN=cH~2L(I5VSbs{wygam?W(OdhXWl9%@n58*8-kw09f9|c28Pi-IBa;<)7^aP$z+mEBr0IgPfjz>*nBH|(&HybA&fM})yOYU9-*#&PXJDK znm7!af?3lDW{a>@q-&HO$Es9-zw4Zrx4Qc~b?<(F0%6juS#7}}?sId*7GD1=a;s&0 z4n|&kKE^zltJ3k~r%!ij1=)_Q%VmzGdLc?oLVmhz`SJ!N_8*!1Zn}Z?2#5=@;vS?T zlQ<4i3Ix)(CAq;G^B#Bk_Nm~*J$g-ECSr)I=_<`74o z8N45Qc1@6iRnb#L5SpqDz!oagTagb`JB^Ak7hNAa@k)({{==I}>fOEI+ocuhK8dSJ1B_*L8)#cP+ zQg%m;PQ!ocEmx(h?$%LYP`wKPTH5b%o$NVgob%6SL|JGsx_4*x8&Q6j>dGvqKRb2W&9huVfYEgMr2|oCI6ge|e0uMZFX>Vx zw&C=@jn+RuZ}4gUZ*CwomzGPHX8m#S(B#(}Kw+fLXZUm{^1}n}c1pyS^*RoflOIz8 z3m)6w{@z${GFpf4sFt6x7>m1F7J2X|f#Dwgt5x+E^FffKbFP6bbYy8?asRK!QbOjh z{rDSyG;d$E_K$XRT2PdZy{oVp0A&1|P_M~w72~09>@Fq705l({?@0o+QFwD0m&4?~ zxZp~6N=n$NeJu?ZGLh&QdO_COMGVPq6bljH8O7LgJg9)}8bkl;)9=g+M$d!g`0~c* zTpE^5<)jEiO2)er<=L0gaL>fk!juzo4+M;s8qJs+0y8zM(03J94g#R#TGp6B4*3)Q z44!$@w$NmNGuB2PJfwe~rv?g4%{F1yEcb&|o`GoB-cd$T58rQFr?Ys;k^!1`e(4z% zy8u}8ZYEzf4u3|9uNWqM1T8{)GG(XDyo~&0f767i(IiB5Nr)E&;5Z*Hm-hc)>%HT8 z-uplPhA0^=CA*Re$=($S4WVpFQ8?By4iXwD%4(8us1&kgokNsF!%DJ8%ScudlE&}; z>|Ed9?f1v;`s2FJbzRiw^M1cx&+&LXo{uNRPWrF)yLRmo%}o5osdqjC>-NGhgQl?2 zv}CXF3ZjE2x=8)2BNRA;&MsGcf9q0zjz+~3)@R;WpFwWKM>hT{B4XH;3<)qB#KOjX z!30wsRw1+nFFeg$ijTg+QnX(y%JS8yvMaPS69YhqP~XV`=L(l_sVjEr$n7Tx_w>Bk z3>sNC-V&1~SzFG6;+P8D~kdYprwcEGfj-IL$>KW?ZQT&fV)l-@V zDb1WYQ^2ic;8PEZ{_JOo5xpDFJ7$(CJ#QPol_v3h*%;8aS-XK6Jd5aLIt1Y~m}`#D zb+kSVGKrOc({UTo9L%Chtb!s4nkjwR%AbYTl=+MY@qpFuzdD7uC*d8++U_Y9X3`|a zS)6Ahq$bsD8Xer%vlBjD{qvxsZIVbdv-VpK;W9>*U9aXz7juCAz)LSBYBqXeHVY|p zc$FFoJozSvSMPL~6S2R#CG{Om*ese4K^8~?;ImS#N#pSS4IM1yt@bNNTl<6KO$kw( zc=trNQ8Q85??$AhWCJl~IZM%sr$m)>jnLDJ%mS%hw)yfj+mR!S$dfj6XU|TL+1I#e zQNQnkPVedLd8o5()cpT7(Ke5Wq@tnBGW|+@r8P8B){9ApA+138;O9UN%irD(p;nml zM5&I6*1!)f+7C|4$#KYXc_1hr0MoXP)-z{T$8pf)n?q_hs2^MRn%#&((byt!4}UxH zsnY<#LkKhX&v=eDR=)-iR?ySaGdKo0 z3MWQEbd`cgq%GlHvUZ!PY0hb=p}=;7j#D}VMqdnb&J%rw=n9e%SEavtH8YE9C^#QG zxt2qR4jqr#vW~^fq1VFNxL^2}0f1|0VTwL{*vih716C*YPo%mW$c)JfH-=^@$_L$P z{H&w3U*O+=w{O?JePm_+7rt*#>`)LZ<~Z6$sZwmL{`R&xk4S}%dHc{^Hi<4pL?yt1 zk#v5EGsp)2C_2QAFC>lTeZNNoS|Ug}>qJCvX;xqL)rij(`0BvopH8+RC43Z0g@fQt z6)s9XOnH|-E&VWWGuOeBB>%^g(+1dL7*wviM;d*j$qP~;wt@WzpM7|)0XkAb{_DJF zeA2|K%JF`-xp!5eP&#jQD8O z%&~=QFDueR!ony~u5V6FwWfY;4n*pMO!ZW^DcD;3*fu;Yq;;A}LmD2|>Z)=B>QiGc zV%|tltDtQWnW!SsH)=H=#eo1Sy`N>`AW!QX|CUBzjUyHz>R9L9_9;cVknsp?g;|vn zYU;FUMM&fA*Q}`>OAP+}6{`3Iq|&fe;nIoggOYFMR@Obx%r^$M27fTxQ(3q4xA5Vem9VG~_~IM8IQh zUZOkt=g$X+nuGhBd)Y?yWi(YfF)8%XQr)_xhP-pgHSH=Ilxx%_XZUUMccs=H|Xv~=lGjou)9!YXly z^_Dk;W=(z$mnI#Z;j>Xco}0Mw&R__?((j%7 zOd82uBo(7>`u%yrSRW zVrRa7>(*N>Q$LTdphoyH(AC&*5GdmONiz@W6fWvlE19rNc-p9=)KD9R+#v+*N*17$`&$zh z(->qkkmDkAC^mJ-*ah*l871o9`w(OzTLOy17+w{W1O!57e{XeF)iiqMtCubR;81C3 zX(=%k>SN}N(L@NXpWS0B8e7PU!2OjX*JZ%awuAo^e%-RNd^5OdtA~w0+ddnWG%=pj z%T>2Ix@4^@&4aLXR6)AS33szD|AKK;`<{>O;zp^#Kw8p$e!6Fe8mOtOYyas|-L-S) zMwHT<;U__TV8fMt)RCJv53(_Eqf}9+?$ufoY&xG74s};^k$%dw#L3U6GQSdnDpWUZ z+O&J{%C4eJw(yNUb;?4}JYtj?mD}|AdVQ@CQ>N$v1qK8KsZbi2Sxo57;UuwgICl>A zch%PP{rB4so@Dy?e1zVUj!s;U3r?k!Ga+J#G93_JDhtHbfyh{~5am^W{{Zc(#QdA5Xk5r#<= z92YxFv*r`k6^W2CS~VeTE)V!hI97X1=tEnon~bf+ao3A2i0uGC+E;&9{<(VfKn{_S zdEtlB(uSK4c$KmMMj2J zgq^w`WrC4>K9XWtXm)$<-AAf@3Q$z-SY_tzkH=~QRZWD1&nB=N_Ac_0N| zw{|tBaJ*Z7YUi^JXCH36F4=jnd;N)V)L6(526}(q7q-)ELSs}(+PxiyVDvqVPC4kf zeDOMep(%4rNwF|9N}`6MU(30b7Co!{UgO(n7(?24_pazo#Q@ZdbbJ1de4IoY)F zK`Rz}c!a$^(SjdRpiX|4D(@I==Je5tWU z1p9liCJyLX+G zgTj*@Iq_hGjm=UJAn7kTH9Mn=XgE+4ck0xsFgn#L5gA;c4g!#jb*aCsZkQ8w)#_I{ zUP&DUgQy(;EQi~4bDO@A7nA>J_748n#-Al|#3NxQfksASc@lyiAQp1CBCn+-DT(+R zeex{mKL?_IX|L{AK(U$=w?*>+GrbiNBUtFnSEHidi*6I>XoLV&ge~;BIj#|Ro;_60o28ih!g zS1d$21@5nLM%mEnKy)&&Qd8c#Wui+6n1X7mEVMeq1a{T$-?yGi?IH+ZX)2Ubgx)va zaCz|!b-;4rTmSL-b|@t%Vm-%L8rvl8_B$OCBQ~Q7-)ZcqTQt;}8vFbZBgRNuph!aL z3N{erKVan#N{t$f#1UU?j{=4$mOcUJ!NC7o+)A`AQdzOCa~O7XusJb114kASg+HtQFyUau9^Y4<(% zP#Dn^=&W(!54RP;AtPcPt$dHUB=rQh2AH#ZN@dUsfuzXpq+f+27M`uhx1bsjfUZQa zZpWwm&sCP4owWp2p#cn;*=#_sUc+HVzyu8}6cubnj37p;NA+;4-aMo+qm;~3s9v7e zc@mj))|@%tukQ`Kir>0Aas36_=eu|BiuxCLcnfS@EZMVSm4l(v?h{IBfOA@l`W-+p zogaYaf9T{P(ivV7HaF4E!=sZZix%D4i2_-=WePZ(C8KUNQ?IH@zEg~#=QJZjW_|ki zze&8vMW?XeQObh_xXZNxr4o)?K(e^EpFi(Flv2X`SG((5*TKZZq*?2p!`8SwrmJB# zI1SUvE=!CJ`(e-$BvN*?Hmj>ElL)M+P?+6o33{-hq1?89Q(U|O5ZLkY{4)U^J9OAV z&27XfARg|DHYT4yBD7`-B&xZ7??zm(G#ty<17E~5ZDsAY?=n*}%y0yd%p0htrR9ag zg{gVvU>ma=*avz`W&u&vifS3n{&hZg!=S?uQMKC@Romz7%3j zhj`sDU*Fu$S#t3ym0~ZwFCl$1h>QX-gI=0U()+S<#fn_^ZhU-xu_ZnE*otCHg-YBd zs+R$$I798l?Qeq~upH!vhQMZ~L*er;wdHU2Ekq7N{OACQSo@y8L;W#wdP0<2|6IE`?TJZuFmwDyYIx&jzXcduc^@efmncuKVDZ$jZKdV-&9P^UJm(1%wuQ{YFP%TQW!xZ!eBQyJC4VhrSIW%;-$B zw_wep2ck!&&zElcq~*||GV!o>?OMEnMjr9K2i6t%0a2SwXk|r6>=KzV`XdVq&G5z| z7@`E1s0>S)b1SM5-_(L{YI<-PTAzqF94=8^kc^Dy(E0=&JZL0zf2GS!VC!>BUv;}W zbfr)k4VpNY0m#)_qszfiV*`Iv2HZddR2#C3QFu*lZPDx3o!$1v#1w%SFjtX~d$>6w zRJ6~^;KICbK1xkd_@}*pZpBcB0}ht=$iWa*aOr63neNE7l^qK38TRs2;-`&_+j6 zY;D_oq~ugpRSkeEmM-36g5k0YN1@J)<3(C!=&*~TGyUaDw=6zKR2SDKE)`FoJ!|?H zJd(rwzedZ8-jh`8$=eg`SehIl?9$TGELRn&%V_5%Z<&4I+aDe3baaPw1@sou=a*Mj zjybK;ExZc_=1sa`=9&{H7VNnICoZaq7VQQG;HH&*%O1gXU*@RnFMYv#^?J z;6c=5VbLy&MCgg5?H;S_-Ot?Jxzs}4Qs=b+JJis9><>!ch+ifRKVcG~@9$eCr7&T< z@{PbdhLGPm2jkB_0Mj_&Tbb|8;IxA9=0%-|V~T zK@p=weB>oDp=5(U^4BkZe;nSHNZCO5L;RYVMOz$9o$?<*dgxnarOt(LFpEqXk6FCf zymI~}DafP~Mg_~$FvusWDGCf}+E;}_&~gz|@i~G-<;qX5xTvfEu)|c&7H(!5s$Pos3SAH!$=ZzF z3Zp{|#phUgs9(+0(zS3%lwZ=e7ZH5nKwGV9SJjFdg;J}Lii*sj3IDHanCHQNuKrbF ztg!B<{W2aKcVIUB)#-~DM{{UI&NgOuPem!o?CgST%ww3c+_Mq2Nsj4Y=y&6mA;ErL zRP3aq&P-c1h$E-6W+eWu(H%Qx3bL!`^(9^47%=n^{m_hSocp5p@6G0L7c(iLAu)UX zmpCR+13RtWauL86RZ4vB!EB!AdY;TIS}73?M5|E9kD#%B-OG8?T0ZiHKVR-SQjlpc z-kyCIKhqIsmz1ckB67jZxro-(MYmO}oktdb_J2*W6Eagl7;~|43XL0YN<>wWu9(I( z9Gz%E%P)vVrBRCZOX6LaPC6PjbZn>Y-J1caW>P8wsK{ifO!e{Eqc3WOH^xcqIx4na z7`VN@72Ogknc7@&p9L6hEv;puiyA=F{EMLwUxMA?yz$qTtA8#S?6m*CvV>NuA7IP> z6()~bQ#rT9#Nji|9gD2mfT|7VWv2P!$56rcD3{J?{olKb#Y<7fp9fCOzjI%^2#f1?{TAO>k10g{mYp&(z>(GSBbeq)w6ln1*3Sz=^`5wO$ zlfCy0bq&((UihV;<;Rz8>q}x3Wa`A!l$Hcw5o7|=m9iCP>9S?l zKpHf$ShvtjybLTYtYXi8{hYqv_)V)N^ZVQ(r=Kcu^oz^C*0lvZF`at46PHp03X1@~ z?CXBJtV!z4dLQOgWG@xZpu1_Zj!y!4qZk zhN4rb&1p#Gi!cQ7qB6DJ56hnps&o3WX6l$n@x@1mJGHm zrijGF zT#`gm-IE1-yZ7$Bbt^_`-m&>5b-p~c`qVZ98jo?Rub-aW2tc|1l$YP}U4nGHH!dnT zWNX_Svzl~(?I3&!)*W%Xd?75nS}JXxcTjiebq>Z&&U?^4-lCm0flEN-yz`8Ev92c= zDo4$C4`VDdkUGpszPE)^*c2q}O)uv?C`FCf60(i!=_zA^%aidhGw`pgVM&}h68d03 z`7GDGzyk+5GC$DOZ61ZmQ~w_4r*Tw-VFs-bQ6`on&418^V6Kj6oT1(n=vT_XT^Ehz zztLn%Wy93ut*EUJ_nkPjzx|K^r@eLc3m!H-edbsFht&GlU+ml(UZjw|wGpsOf)cpR z%Z^Y1XtM!d3be{=Mu9d8k$2!nJ};?0?7z19GNI=nurrO#&L}B9Y3Veo`y#Qs-jjA# zst(6ghCsKGD~c%6E3};V2+1T$Q4)m=oT*)yGFFWvC~&>B$o$p3m2KZb2FR%QC2Fvq z7+ZI()M&7wK)?jjJd9BFW)7(V$X(txqA>*p1Pyn_>6HK(Kt-+|a4JqJ%1nx?(4dD~A@T=0==agg)%v4S$Q&`vx`4Il#TDG_UqEHXqSpbTz%_jExf9Qf(vKUF?PEp&ZOWY>fG1QJ`+};<1Q){C z9wYoadVhL0srn3Aq2leGZuw?)hkj9jiERVLMJwG>NE(X%Gq`Aobq!$H4SG5jqnZdk zOW~S+Z=`Km=Iz_f&~Mt%&^M^d1$rPZond3N48zjVN`XOo@AL9S$k~VWTZ0wgbn8Eq z&+6p;xjyyiWR)2+>gpYC5v%R8EmP$_O_wZLn=6UAq{PUJu03YeOvm4deyxTp*Pgl87?<3)XZb!G3o@e}q8A&JUV z5mM=5n5~NCTedMn0`g>oey4ZM+kKE$j@CVpFW}3;6c#&HOxxr1S09nzXfzG6Z6_CD4fm!wlhC z2N|YKIP7P4r54M3syV&nqU)PIdBhFmM#9)tAD<{LS+eB)V8SQJNL22@6V*RH{l0ZL zjP45^7lmqlxs?P&Jn`_EqYVjj2S3ED6LBYIMDf&m*Ej|vb?8+&A8 zk`{SUK|x+PnxO!Tapqd#t9mn;&n>IcKN|! znU&k6mm(ZOcw^I{w%^)+hoDv~*`d{73G@aMU>F1m#YP72HgR9@xzNN!ZmQdEzy>I2TLa{T|==N6MQZh5V~^Z70UIBw(AizPPoC6H;Usr*yjG3Ez*e};Boq4fS()20eiEFB&K3$>OnAzz7RTQ?J4pc{bW29^g8>w?Fqhz! zq5DsN^l0+T4M8d%b5x?t)yMqZba#y6shNrf1_3T+U&dM*J1RA9jMzBfltp>5%IQCx zYfiZxY8KY7TkI(d|0y;NL9$T0%C@tJ{Q2-f$8jY9{L<*1*8`%JZmb=@(sT|S0?ZB! z^wwMk9BiXB<*?J5jrcWZi%6+}QfG;Y#iKFT^76E>)XCr`2;?RB0=_g|xy_qMcQSI! zV10CSq!aHpw}Nl#~F zLgMcv?5;eN{U`j+Q{q>Ck)gOe@F#I?@u``xkhoRtu}D5lG|m!=f6DV1T83%6BI)$M-mOZ4KVUgmrsvK?_ehrR=bF}fYI_W zxD!s!eqfl>OkuwtOuvWvaBuDi+awcC9Jym8$!WsMuU5P=s`Um*Gl+H0tp)F?|I>?W zX_09T%__&|NgapEBc1-#85Ne?UjT;4i<;q^uyE1CCNqHg;UMYBbm9>W@l->)aS&^g z>8Yz}smi)dRNdXjr0%@$kkhM9q!{_s)w%A^u>J)pnRadCu!Ez%K0Q1xt?DZeq~h}z zk#4()?Sra<)O|2L6QAVB($2Rpzr?^2-_iOw5u_lf(Q|(eon~S*GSQ~v&dBU25(%4@ z#`j1Wq7d;J6EhLAiL@%?am7$o~ zJ#XHu*ggCH@tC0@(Izc(|Lt>nt#{2S&)G^TYnwcIt~~FqLdes5d!&YJ&TNoj)vsSN zb;q=EgeXPh`8+j^2S=`{sp~fXe4m-tscv0$YTcFsCF{X$j!bV=HFsMK(uA$`D?3;>-lDtR zUn_Ox!omzSpLai{sW8KkGk(lxYBL$G#=X7!9F?XzX*@LqxQ=nry+f%AJh54}d0SKz zr#WvT86f;e6>|?_riML|*)fnHrh7~)o%5=ys$xMDL{Nn)I~Xa#b;e_0s4FJtG?G}z z3!2R!6d+p!v5m}x?&-S7WI;Vq3%k9F|G_k`FcWLq7^LbkwHjm7-teZd2>BiFqH}md?q^f!S{4>_wIxWZHRe0}_TNHl(RCfO| z{NoG#fj%y;c4|nu;KDo1c`Y+V6ah`AQD2E;lfl8;hXI)Jr#}PTcS-#?h#mbXU!lmw!4yawc(% zudPUi%~zn!z6l}z#yC%licTcZlCwp~2F4ynU}F9;7w@teSJt#5S!W^CO&M9T?)S

q|Cz{toKk3>-1GI2tz!*|*I0Z#dneJh zN*K49yLj<-!c$ZI`^Pod`=U9GgFAZN(cPzk~qzT`77dEKo21CZ-lVx8e7 zV}KF|yr@`gv(JM$cb|HC*rk(rCkj>~Wn8G%Ja+wMcj)|^gb6UrXSJo-mG%oUBwi5i zOh(|ZBDRlJ*rUHTK9P)^erVm>fai4C>MQY=Zo9p$vdOr*`e%2Vm*%O2S$^C6FoJOcdYID7)hZG)D8P@pm zrNF}NLs?loXB#wOTkdH4vsC9^FBPO3gpDnsY_HHtIzxsNs|P5!OpK#8^5SU!u%=if zaGuP;A;O+}$$SG_5=Esza{FhgA~qK$ z74Pnaq7BQwm3@ebIeNAd$~Tc?13+|I0>I-iY4G5HB(vNrLr%|D3G1e(p{bcV_1US8 zfK9mM~Ch8%f>W|9iKJCZ-?B+?sBXRkyq+8sFSEF)%EY65``&lMjMEl zQBunD`w#zD4o!tgWMc52FsGQ_BmX({`WR;hp#}Y_tfG*D2lU^>B76_-_0nu^rEbr1 zG!r_Pa#@=f5EXsy5f$Xp$`32{Gu=9|zAnw(U$Nxo4fg|sRkpQPPx0;cWz5=rCtMa3 za!|B3%0bD1VHNWzgOVm=98RKd0(_gAg=o)w1}1Ns#*@iWi5>Uu*&`FRSYZA`kv8Sr zAI|N7!=uNIoq~}Xwb~8Z{XQ>$l@`p*~X zyMpa3=iF)9eX7Fk80CpaIdWBH57WM+DtG8GY+_VRdl`Jnet1-6(G!jOk}0Q({X2GP zA`iX~4?b@>pq^NG2QC8PwjZnf?9q>V(5pAGWt$-*r;4-nR*D=N*gMCB;ui$dGW|Z$EzA zqz4Q<4u6J1F^&^6MR+W%k%$Lszxe+cwPYZHe-+3orlmXn5O*kA2?XHsWDgQroWQQFem3oZQzjTiV?qlPRav)U0I)h-yk}zQGU3Bx zW#8(W`ZX0^!&Z&)-2$LGe>;((T9e2yKMCbG^+FSBpIyn2O|y8=M~Qfga`8~^P6t1Clf){Ge(HZL_s6Dh1J zBSqaT4%_kJi|{K4P0VtPna@+uF|0OjoMuFZ~-p-GB8gDdxWz2khqC+bK39M4G%d3wyBvK0|xXDtP`T zQiww4L!tb*IUGBv z7iF6Mf%srg4P*K!PZtdDYf0MaSzpJMC=a{%XWFy#!(1M{8swVjKL2rx(ihYAA8Pjh ze!dtCrP2`B5%ygk(Q)grmb%o)L7nDz82C!iM_#4uPLTT1`Rxj94jD-qdx<;Imn*C6 z=H|EXs2X-CqBi436q8w`eyJK{u@epbEG{2*9G&Q=R2d^!Vt;`$qy*uubb?#-EP7Zx z7y!Z}e2YBZjXFKrrFwiRRgLP=JTM5SsjsIp7A0pt?K-D3>ax;qW9@^_-R5?xySuv^ zEPQs(jO{x?+f2=Y0YtGXBuv6>oc<`{uZx6D)T=o&;4RFDT1GJG@$t!-jqidNgwdP| zQzgpoD4EQp3)QVQ{mM+h{ZxPdN;F>lgvjU#3A}gN=uubqdx=koUm?Le{fvr;LdKh5 zPUU>D$I|jn9LxL-Lb)B?n~*LdTdYp^a^ZIg zX9m@Iop+l9*d|aj9?OoU#&p`Z4LBUswIkW193@GKep08}&eCV?T2BH4g;7}aQk)xv zi)7>|EV|T$))pB|2q9!P;FgTPan~S=WH3PxKV-_A!G}|Vw30;1O6}Cw?#7n1ThVFn z9|XkcmsgsBt(Vsf($MJiWBCP#vJFHnCAnOg6n(w$5J5p@H;tOS7sKJgW?r$KznISg zUJ_qEybonI5d6p)GxjxLzR%2oVoA6e9Et>ii80PNkUP5UJwrLd=TMS%T6gNJIr=9l zmODHcH|BsU~a?RkxhtY|jW0!H88ezzqSSKZT4)O2uO)+EkOK=`@Sl ze8$+?PEWtvV(Qg);HP!f&-!^}r~(+@oosIj#1!=};z&Dnd}JHA8LF-A@UH}fHNRgC z+TU&R@i0L=6K)WPy460RCSV?S6;27IN zG_MD4nAmkEqDQI2&=tu8C8>l*n}wsJ5{~`-8vKT9zS!F)%(=8e@xmfSU5g#5SC=Zb z?%k;LG5w^=IG*C1nNk8M6_YK??=MD++6>O(|{?F#yIyCP-P0RmNS<{ct=QZ=VoJ*-0GPC?xaMXY8ohKLm>j7$aDk;;p)(_QD8ZuGnYLzE{BjV^h8?=sZ@j@38q;jX`CHl;3$F+sWx4=HgY6o z=O7&u!@T8#2ZLa@WXy83LR*DWh0>-TW+!K4Z{6LRqW0a2l_mZi6Z;W;dz(l+JAzn< z$>t8?Hb-gJPX?Meka}xETu@LpM)@aw`o4YpUca$r^L8r%1|_BB2u)3kD1Lep;0*6v zggU_G%l=XiSR=_EQW^UuToo`L)G4RLRt<+fQTcHT7zLKUeC^tBm=6AFHu3on%r?>B zGTT6M$W)yAGqJZqixzLrERFlv+_s?C(oSLE*B4KvM6BS6qV~H1PA#4~afrU0-(tCH z*!<0#H!=e=Mc#ljVbZ|J;UpJ_BcTHHF-(v;4pyVgew{~BsL>D@i*xyK7>b5TslKer zYsA`CNo@j49GQOpC?U?AKO>goplqfVwP7(a`oIxE_}X-?dU5y@%2e4_Bgi(S`mX2+ zoxMN55aVHLk$c}(Kd>X>m-pL>jn09AuG^J+wo0q7Z{eQOdbg$PrOwqSt$eWvU%%h- z&CU#Uc4jcRB<`SS+O>gAZt!JHmOwz5MoKx{7(Y}M8TInQ#eXWhGbx83Gs29XI*@8k z$9%eI3ew?}UN5$nZO_6($86o|c*xg=4`A0;+!f*OBTu?QB#Uy@GC`k|OZBGCo$xVR zPnj*oPw;0l4f}e|iB_Nnq>FZX&MJ-OJj(068~(e^gkks05ZOoI6m z%SB{=Mf9NPleVWgrOR8rCU12G*1ofPM)6x}fGD%DsmdK4H3KidQr4zOmB)v>hOqrr zM0a#H<^P%OC3eUCiFb&B=)VmKY)>YI1ofb9GL2Bv#|hI!cnG4G<#|nXCS-{*|K3Wc zL%+|c#)~U!8K@2?0!r?cMH?$t4!UH&q~_8{0BgU#uI7`w>uqVJd~$|jo4yK$M(d+3 z)_1TBczIcIr$g2JV3*?2y1Qk+NOD50_9z1w3f|w#kZlXKk zIM}%DmHbBmE~-OGm==eFIjUmzLQbad8zDJ2UdQ3%qVJ{79_1c|AKWu*s}-5?dF8ZoSu%1{aNZ42GVOhL20(cg?Xi0)H4BKkRx(%!OHM{Mq};zGN+IBg zI0<#ImEsB;GrLlwJD$L^+>cIRz%KovG%12-G3SO>Td(^3Q%;vS>CWOa$zH4|heXM7 z-^+riiNwV#Ywv(lY%t0|myOE@)9k_LCeEIBOjkGU=60!lzn6V|N-=y2fy+zV_gg7z zK4DmG*t~)tDjGK%N$0b|MkT0Gk?xQm3MA+9mRbsAq!^;3K?s|aN^k7}C?nF4WIk;y z+25w){F8*iILICa#-$p2z`9lFo_L3b5+*?^wF;Ll&D#&w5rTm)&ayO5LTCD219si5 z2M&VHw0&kU=q=Dw|q1Iq4qlt(7R_Bj-9&*7VJQ>XD@^`1CnE z1w819L4)m*QzH__3SG%P91fuZ*0**O7u@6@?LCw@`BSKc@QIT0dJe;JTAS<>+Dk0u z@=M@`R;oyz+!T(5xUreuNp`^?stl6B31m3nyoQvaVp`QuIQ9A+-DQ`( z==_X9X)i7P?!UU-Z1q>AKOQ#y=dUJJmG-ZkqO3RYO7m75|4$hgVm_rU@zIMj_dr?9RmPncUHP?tuwY%*B+we~nvyEDfbB z@qr(E{l=>sd@YAp4XMuVJ$qyg)+?L$BC+PLM`n^X=eT%YSTIX5|77!amQ8iclmY`Y ztp6^ERV;jO_N9wMN9vvVvb8ShU!-|bFf|nFAhz9SrnKgB>#hmud!Og-XzyZDx*K7zs!Dh{sAG9B;N`1VFe4f#dy;C?|GWf%JxcupYSY z7}_!1b%KWKiZLUWMmM3{POthj-Dl89`Z&S&c~4D!WLyJ1d&7v%_uhUrtC6?NxYUDl zn{2hj`7H{REg*bHKRI=P-poWwTF$beTaIS3yhg@ycvjTL8?#aiI)I&XNsKEsG{fgc z`kxrx_0D9AnT_@jRUEY~IQ7CA#hfU`N5>WY&KRZMe2!iiKTL~I|M`M{rudv4I(8R@ zqiB)1I292I)Xeaz-j~{M*M{kWk}3wJuFyiW*$aC(@pyF9A|KbD?ZF#FjuUZl9RwO{ zcE-tD25`$VLY6b7L--!?Nx{NPx^5ny7PbEkny0|Wgal13Ekpl>dvMjkF!v@yo?=2Q zkN}zy=4TZpi||2YT>{&2x{(aUuvB2(umUCr5!!1@SMSmhT&TgCD)C0V$^1}0wvSUK^r#q$vG7;~awE5rQ<^wiR|Q4i!x6p{tk1 zchqp~DltWyn3Del?nn0b8K6UKLkSeLEq^nUOia0Mk}eV#4B1UWPBMD&UY}tvsL&$c z`Pd7YVDqkvELu@P1g`wqTw194YwdoyW$DW>v;5y!Cz#D4!tL%mUyG#DL+DiJoA8Pw ziG}jj&Gw=O{rKrqkd@)OLEftX+=OHiwFBH$ESW5L`}Um|=LS=dp&7r%qz~;qbom`X zMM~fs+|JW$zAr#7JL#2;{>SHg`&Cv}%9@#ckc6{|-xp1C@7Q`^Prst8UiOH02L9Ff zk5}zfRl~d|EXd={)5PS$JB!tu$bp%@LM~zQot_1m=fu_S(;4FtS(vy**RByJi~uRQ zo(~g8>cZ6gaLtLNO_ENenC!QbCn*-+M7)S(*eOHmIv7pOHTGAi>_rAwU0p5f8O0Ti zgJb_4$uxGl>R;^D8ju;BYzd&EzoccGb27=wK&Hq(Mw z2>)T~IcUg`5;A1oN+4CC+NCr1wdJlzmrc+zdXZ6$CQm#}OP!XW%tA3YoQEyLnoy#n zUPUaT3X)+k@hc^!Fi~vt%4R_!+(lj}GOiGz^5LKIX1wp``tYGj_4lm>V=*YJ8dwYD4x7?o=3M0)^4K%-o zdh_9rE7g>6XIbG89JsLq=?m)U-9!U%f8K&yDFInkIj zO#Ub+2p$p{898*U9-LDKQ@JvU%gO|-e8Nv`hEp1NU~}foZUIwKDMneWUnOVmY%bnN-?f9qcZss@+rZj_x|SapOk+ff-}WnZ1(cfhs2ou%QK%vCV8zR~zK}po35W9{t@&38_6MSOww;ed(e(B>jxJ}^PH5W6z4Zgv*O zcNyBog*Prb-+kgl9Z~Y#zr3Z(VXU-h<`$xcz zu{DN%@AJ~Czo!kj_iTJuDVrz(G%N1JsPHwf0O{v3A6I&Tv)K6O{$0g z$JV(?+8XVf5A{)M)>b!lcSmg_|0ao1d^nk@<9UymGQjVttd=1~CSCpGgiDfOQ(Oo4 z!9VMcaVQOth3i{we8X+{CP>(JB*bx`ur`mtT#vh5p3H4n=QiHIyik$XzL|Ey@jU2h zMnc8m?_4Z?1$fEOVFYSi?@b>LPq^5$F3te6Ez`&xe^RHpXfw3^Ru%>>R|eJ zQpuu~^?vB73NIEEpBf$7xc}k^Z)XQ4Ch=9f&e7y&jDS5#oDRQrbV>V;T3Q?6AdK)# zCOk*~*;*lhepM~iZxn>R-PwjG(4adveR&}=A^$KsW#|F;$|p<+&uhuf&BSV@Iw{Nv zWwBJmm=yH-=_9~hi z-vJ~LELJeiHe=h*J9g=k$UUFG8?dPL0jJ#>^@G<;eC3qQNZ>{e_d&b?X#Zo%Ege8e zFg*&aiy}0OO&>EQ0YJjCY4XzWSegwnw14(7N7l#9WdI|557>4ZFF$Az35_K=Xp7q+ z|G;y91U#rSqr*klU8!dY&HPlsb!1GHy}Dv*Hte=6lghROdIG96L!a5T46aquQN16Q%i2mw0z$S(@)MIUYuVrY@*KTMfyGG zHVey$+*~?DEGT$En4Gp2i^l!I^)uATG-dl8giQ zC4kJ30HVwt|7YcgU8iF?)src9*>r7JYJ5kNQW#d{Am60Hb2y+QI1GhTob|u#Ns!9i zh;cY(He{c+Op_Phda#TN$c9JyW{KlDuEF~d;~<;xvgc!Kb3jkU^vB>^d3oXHF_Hp{ z%gVa$`!p3u65lGjQiJNUiv@nyX^kV-t(!mulVSpgf$1|H&M{vQOLNXUSRWc1iV_Y8 zS|+lj1NeA+dzj@AD7DH`L~qIfnSVNLJN52< z0k-?{10+hS)If(~PO0|A{v?eat&K9iWo<#b)gb@h|L%-RUnViIGzd#Izkl`0ebz3t zKp}9%L^^;yvS?HPHtyu`%w%Dcgzg9qWk9-(-^(c>ee+OJg){3TPn8nr$<=H|ni)5; z@n2515#DVzmd`-O&ERoFpGbGAAX`nrVU4Ffe^uND5NAl3iqf%nr;4T|TED4C<}MlgV|sJQ4l6vT)JbB_&LjuuWi+CtgbLBYUa zSY(%BH?}Bv_Z!zird1d$mKh1qdn)FHXMAtExvrHaqq$bQEZkejv;!-A$U+Q)C&l)Iqq%dVO&UzUpl4L?a7ssMK5A;p>EOCz%;?gzP#=Mu28>;q40AfuR~ zo#l)R6a;k8LvU46mBRqFglNWd)E_fjLlcqEKvtH8Y}t}d>sHR_gIPBwrTl(>8W0y+ zx>kw=vdJya^$78#80Y(e^t7m`u;3vw;qS@OVl&pPqs<1U_U_+*6AubRyC)vHI^Cy^ ze`V9gf%Va)12(s~$gG#hH`V}_{`E)MqKD7gJUM6Px6oIi{JYAU?@Ct}9ksVV?O*RF zyR2bU16cDb@}h?@(XzBmz1F@Jz=-*wd+3uyZj3L7?6poZAyw)JW|93chV67H+%i=T@#341HnY3hxSVFvGT9mM&yo%=gRvL#~`N0 zh5Mm9c8vWo*^UW0(eMz?*ahS!i{@xgWNcrIJFik`2pX5ZR$Ef{RDNSi_iUe|*2awN zZRKG#eM-F}YXt=#h|ib%4`MR)pZQ^f2!DF|W38ngAHtZ0zm z_`in%pL%6YKl~xL)7vDL^%}>M+=#S?**|P7jD2FxZ3_w-x#hxTWA*?ae1G;~a=gA(tU>Mxbu&xxtFpQLIxv=&dLf*?@uh{1Vrp;;?xyN zhpbdWq7W`h&H)a`QWMgiv!TR=>61|5feQAUa*W3H^scRDrawHz@~K4L?nK_4VYFzn zp<%@da)4xH+JDf${qzpQ5?#bliLUayhJl{f$zixJ39B#B_w!G*=s!x0B#n!~(U$ zK^~uU<)TQiFy6vG69J~UIna_)NC_E;3OP(x9oXIZRefL?cLz&_ zr{Qlx9wBP;82)xzhE!W1`r_Da7HN^-PlxtYy^7*fwr5g|isLSbGqM74P|kZ)LqGBd zN#m0B$Eb+{p6LRf%?T6Uluu+cnV)J^6sLl4izMF|xI(;9b2uwKx)(}-WP4NI%Grqc zW>W_XRV1eZU62gEp^pb`(Otucx#5h3muSV}shDKEA?nxv#tgP?(`o2>e+~BjyiKO( z9)kkh#Pi03lCV;<~89R@YKZ2HRZ~cH*a*3&`;2w1##}M z4VXByi+LWc-}_8Pm;_61;Pzt|pPe*hNa2%SX)oHXuGXpg=^i`TJdLf{zkJuP4>)07 z__`4a1sbFekFqbH+sYOk`l4{w`@*VB%yEQgtK_5gn07f9;Vgu&rt}Diw-VjP*4EYr zwIA=q0vFhqC9jgM${}kfhpdwbVGyW>{Y@MCPnSD7Y$cNG%TQr@xdmcNQAkUt2+(8V zW`Y@c8o-+<9%WJ%%DNZIO+i5q&K+(tT!8ZY4#<94IB6s{$7^d)8mzf@c?-v}?b9)u({t(-a3>tUCNPv}64*o4U*12vpLt zBhwx?xl>ZiO5uQsHBS;&G214wgh}7=RWpsngu;C}z5mv&$O8HZyebGVML7>*J-rbF zF6A1NL{J1bm*W06G<$+RctVsSC~**{QY{8emv~KjCB(=pr{5@|bkSb^OSc;Fn!VMr zZ&c^9b542=x+B$oc(E0&p^BEd$KH!sr&-x(T#i7)|A*>1Tq5TblacbsGNp(_3VWENQQ-1ln>K=$#pHd$T$lI_L+v`|-ftWdfNSVcWA(-^aE zVwF}72ps2)!D{;XE(ksCYH2V`{}xMEKI|qcv8bn*;!|^~-F;_p=QTN;$R)j`&3-D$ zBDETBllr@d^*IDmS>}Y;LjsrD-B{*Wbxtze(&a_Z*u~glbPpBS&4-%EHY9>&4<{PTX-x#vJK*qs_S zh=06xJuUlZSz3xued?mkmE#EPAsQ(VF}gLm$HDm79ww^>l+8Bm6l>Zkc17mxFD+O4y;65*-m}lXd*8~te;G7y{FK1xzY5m= zdG+pj!$1uihr!`?jY#ox7l{Fyj4&VC5tc57Ua2spvK5qSbN}JVwb|GP1j)=knAo(N z$FzQ3L`*JhXz{{5J#17Bk`p_BpWLd|`uPu#6s#}0o|^gM<$C9X0k>~|Iam>76YIOS zuxLcx!{b)IS0Cp@LK37?3sZXJBzxR*PxY_2n({N!FdPxK+LO!P7G&&R(0()kdy;-( z{f!ej_(H*t2WbuDgf&BxiU>g%xW^SvGu zRI)EL>8}3&c{-E__=VreAn6v>9M&Igd&q0<++r95S;0ap5SNgU5iKUMx4)wv-TmR? zy5B#VGu$x}Y?BSUE$7Uc)8#;T_I9i81Q%L3@YGJe1$@^51{<-EfHwg^kxxlWt*9~!8GQh}4nTo7{zO%TQnJHfNc8-qM zk=dTzwm3aB+?lgAdd-@_4Gr}Xd<_1wiX6&=YmbC7eV;eDxr&fC)OTad<QxtD?cG8s3cS#qEZmyc1`_Iz*8?7ujIGe^V zY4s#UpJ|xVN89hc{`khxqh|H5sTt$!?9ynUMEl)+^zPzJC98T%tHT`t$-BccC}IR4 z6+T35v7?+PYRZsP{P|F_%)IByyNvT)jco^K|Cpj{vNh~`rkJE#)b zcxw6>d#-DvfEmTD88{{Oew^wsZd@jzOKe#w0eTN`POTth0y<|rrUb>4XwHJyZt$hf zOpJ6{1?pm5S8vRN$nuu`q@2JTk3mLnB5v5-#-_9A`Ud>@Vi=G43>KtTZk^~Ggz$k{ z3*=6Hoo}O{0Ns=r(kxKJaKw>|O{2Q1toW$<+S{`-(j+Y_eAsx61L5Wrdsu&ufPYJN z`$JE)QSPHhb7%XPX+rcC(?W=4Fa_n#Pa_l+WI0YkLg%k5`NJ##$;{8{T6RLq(Dx6; z17SA1_U+q-rnHaen*4_k*?DuTyXWfQMZd8Hotf&l9dyUW&F$}T%GRS+*L5{C-0*K5 z5ug~bOJtp(3-_zG{o~n;ko>{}4rkDmc{4PLnZ^%c z41kV|t|FfpMc2)Vxt6bKXpbCd1jakCNx!>q&)u*9*ZZq}wOgnz#l?5s9u59-?@eot z)$3^}AeO&)|5u8hML_QOVV#TnBpdYUqYXS~10>GeN7$Pq&NZc>6<6*TnA@rc*}MRo zWTGYjI|HipUs{Ek@5F=*w_lZ-CvV&lHbX6yC-&aD=2)Pe-t;t+gfMexPZ252oqK5D zTc(6TMtiNa{UJ+UI2p1Mr;(E4fyM#d2kgY)!|SBtu+CZrrlzVe@gs@wESM-P*l|5H zBxE@5Y*pWm5j=#iynWzGR7Xl#0jag&u}Aa%zn<)5{Zzi)^4o}jva_>`KTz|=ll8|m zH;AAE>kC&_#L-)KbXZr?E#;BSKCRoLp^yemUZo+yW7w64^$VZrRNWc8Vn04=mk(AV zRw?@Or6nXhO{Br|4#$Ue%F5e#1`jcLQJmBbRL6;ck#=g3LY3G<8#=vpK-{cLtQRm{gZ*7O9s@t zj8ZiSj9P&ulrYA8=NrA)a>sJDok>QvTD^PsE@ZnHZa=dSJFR9q+C5^)vuDq6(QgV% zv4J9T-qU`zS>q)9{p3|_=a2UC;nC)8=HPh$=w5#7uZt>k=Vgxe8nJHOP+5=+g^1ko z0B3tuCPDll^VG#p1TQAyem!s3*#-+9LYxx2pPQjTS+HP1@z8q(1qWghrk|O8qo9L# z*ISZ)Dq~5`O|wN7#^zYSoGqTv64!XbxCy8q+Ld(`Wdwp8(ZxR9f2A^V)27CZcihbI zvrO%vAkZ-Z(gSs^e3!`IlZdpExG|ehQizI*$~`@61VV_4MB`BikOVs-a`jn8kqsjm z64G$7WJ~~aoSbbvy#M;kbAf7j6hQ}8O^Nz{Jw{9qRC*%{0+^{^^}@{H>HXZ?uw&sD zi7uf>E>`H1PF({-%-4?=ai^%RW`0JYIo z-KIeTCP83}ta#pjTI_6MyaOzjJ1LOR+ER$vwo@a9wS6D}t(K=ER8;1$a7iGJ&1SLn+{I?(_cswPZ9yTn0u)8wvQsJ| zQg#v&O;Xt_MP(g(`zoU}wS*#)l^mPHu_`K+BJseZ8;iwXT}AskUD7o%6MM4>`Rf%0nbq&C(W4XEQ|49o>0TW^xY&+iptk4#;2q zvLaC5LTl~MY3B~rYV6=s00y%?wK*5C^_}q(CywS#&3ZyFRP(*6m#u;1`nG}=6h?{W zJ}@*?z4CAQEJTT0*bR})w4YzQb0xXeHC#y&hJJL2k`gWFkCJ(-46Z^|ECq8PY-wrZ z?!LpNpN@{sx$p&b6>l_{FU}H2Z)j*JI}iP@Evw6AQvuM3w#Rg$4IVv;O)<&E?AMqv z&-fetdkKxCb2v5E#DRCOtnBruU|WM_rpc9En&pP^o=I~nK*tK(QJz4}+F1K<2Q_Q` zqiTh#gF`b;>f8#R>tT(mNt?r)&#v@2Ft%fQet3c7-H(q83+H;a9**7%OCl1bA0;&k zrSX#{`B;1S^(peNtx%;E2_lGIbgHJ~eY?}F!TqI!?IX#Y@VICK?s^+OiZ=c?@-Dgt|akS43HeV>1DJZQ~THdFVjB zcQcQ=B;K8&jeby7W%H&GNPdea4F^MCD@1To%2LQ2jkc!gbX0McHWiMBS|e%j=?vw! zVimxR-8y@CQ|546vlc@oQHH4C<_BMWTyy(&dRACr;lSTieC{?@|NRI@t#D0=(^YW7 zQLe77kwhqZY8V+A&6_tb_%t_C>vrveK}&?_L*U|Bk+y@zgB~jMG(@YcS35dpKQ~TP z@hFX&0Q;xFs+wK8+|5J<6Yu?GK(w9+ZTZ)sEbk_t8$V$}074t>=l}5o_l`K}uEc_t z-F>)nS99~$oJeQh+y(ioJk`)-fAG@??V!{5x zHMyr}YIGW0_H+AC&jaai^Ivy+@D34L^;LmIZ$m;85 z>nB-T6p;5oFQ@i5ZmZU~Z~y)Q&&?$Vli2-(eS%%S`h5#aS7(g-fj?A zxCS?57QJ3g?4x*;(<0GH9Y>c-qs)*Opy{T?{?)ygiESOqW6a7_%MBAKf~tvX-zu@^ z1fa4^P;7zbtw-Cpg(uD+_AT=X0E17%0clz_sor^J=XRD~f9$ z?me&mkQ~z@G}xeh6)6TX;ek03AU4T>w4+Cv{n4*`@7^MKnd1dVoL99y*^o`0qI|do$;8ug zojlo&X*j+~Cy8B3r`=jE$@76a@?nm>n&cqn4~AWl`H#KR@ZmGefu^)ds8LEQetsNr?KEv7p0v1{7hbhr64}WT{?E0 zKDWfNyu_!9`#yiG+Jh6!V290$4i6ZdlVJnz`=tCcRP0Ia1(5ZKX?qIU)&R|ilOD@ zMC?7bc=Dfc-3BYyLdIVTiU+Our=3_!_t@4+`%KOFLbkxgHTSyWZ ztRzct-a7d?jU7Ao+Ur~l&s0cRTDko3);l>l>D&?$RBXI|w}*$;G+IrDySE?T|8>(= zUc@dNtGn5%Fv@J>jPyM#SIUrFdXyTOF?@Mr8PqQ}uX(4J z`my@dELG!ijSXuOe0TugS}^9O<5$RPRVp|t9db7RZLOzQpWR|C&3o~O7JyB;k1tox zpFf}Xu@Qm5kxYHwAIfLpAd%aTiXRmneWSFrvlPNG!e8X3!q-5B=JEM&X6?OJUU?EQ*pC&kDC6}5CUa&fIvYVUM zubzjw@)VJKyr=NyT!XB zk$C%0&$_tTQ7;SIP&^GjAyN>1N$S63hQsjM6js~sPZ;js1=@?yiYXVXlWLC~Jt|;= z7l1S9ZplOYv13O=!2s>7SoN2Qz7;D@P(y^Ce#eN7Skrs}Wg%3rYLdp}d}A)L4?^jIcZQ2{jViTpoyrHz~O+iMHLQO@~qDTRtbo5 zmkJOB93{epe(sJ&o0*|?TF4B&i8H&ju4b7}=0gTK+V{yvBXrWXm=*!NbzzCN;^U?M z{rf{X#eI&q2L^@I(hRXhPW-b(Wdq5O#U&-ROHX0I8tLxdZ}Oa^U$#AT#2qEank-!! zRb&m+Gu*O3ho;I=}8+6lQBcLs~lD@G3Jd-)L>$vXYXG z^zDGQz%;++MD{l|4Ii@H)Qn@@J$k>FkB>2pZ0pXQTOhGv1E{{GWd{USrA}dO))y8$4h^ZI7w3R^dr3oQIvxJze8o-VLNO~V5$`(b;zQNBqiJOBotWCs_#3SreXY4U zm$L07d?wBczrjjyutmsnz*VjZpvsPOU|$=q5u+<>37m=q#**dHC?ZE+T+7Q62#w>o z^6PMAsL(Auc424L)YZMlJa^my=Mq{7rf&`Ym0b!{uA}$yq$ARSqSqN;=2Vea`D@b2 zzpG~`tVRsC(b>mIkWjM?9uoy4hpK)xRBNc zt!UuIbBd~oIJ3^=ihVD6?>~Ps7a=>Tw_m;wg=f^MQ>QY-p+_mnYSE+lN_@w37)J^; zFrU`~wb#EPx0hWAU?Y_q!`)W{M9Dsr*OCx1A?1Nyf!@x;rKNKvH=2Jf|KYMJhQ9n# z8#JD>JqHDK`TUf_hYvTVW?DO|=^u`x>|dETPwDFFjs7c^DGyv+m-;8|AnGHJvFc&t zd)OkLl@%_imy*EQ6(JK2yy~eR=(2jUhnmS4K)NkBY_%7@_)`|s-^o;q)`egYPa89X zU?l*Dzarm_$=yOfdx)yyEZ%t{`+Wa8Y9x`}v5m|Gx5hbx_f69wQISBxbK~E_i4MY6-RUvbGn3y6(Tmdm(keJ#$9+NE<6tH6v@MSIxkTPV(=qoUGxmrm!El`XrlX|m#3apfMf zE490cI2U<|GRyftNsx{-YQ7&s>N>FEoTNCz)Kh@=GR3=D@hOKsdc67KZ<`%=)-*RU zMHpB-$B0m|q!TCdciXp-A$+Y2;Z`uX%4BB5PeIsAU`z&IS9he4I7<3C?(QRNSueLA zHWf9Y)FI@G#Z!RQq#FWfun_bm_yUWFZh{QNJw+Sq?YE$%NhdKgA+fy2i*7w}HpMj? zZ{QhLR$5OyCIR+*eA%q6P*)PRV1eu+a&0`oz?a!X^{OQx#WG^t`t<%=gXE~)_3UZZt(-1@%y>n3Q9!^ zf5@ZuU^gpz>!^d?rDxJJY0lS0d5U5nBl-gd>};jYc~yBd zz4v8-*lCF>JuAWzhdre&=ge<$=|>X5G8RNJzT7A%h>X8E>5%}9rT0~=_16^vNmF|) z&NkCF&bhOAu8rTjcQpzSDO&N0`9<082jwC2DWi7nYJ#zx>qKnK($eM~xeZLz7onwb zTN3JdV=Nkq`_!>M#r5)Pq=%ZaBmrZu0bc!@ebrSJw2uMyv)_jE2iR$iak zP`%iCXD`VzM%Yo#jx_7heqSf~f1AxL?)T$-0>~1QK9Tiq9-)M&PM9L<@))Q-k6DKQ z|CwACHl9YK-#Z%?3Tq>G^!%t6JxK6$pCyon2jCfYD=D$JQ{Yn`fn;55fpeaAaZxi> zRaIKE)G3K7cS3gUYAfxaEYSfCuFDXinZ%WY7R(rQ+|_S!)s5B(vbT+dQ@hNtd*IRadE z7A>i1+BfD|!39!hyyc&7Z5t%T)^*9mZ;}ba;H7FA^By2iQo7LXkS%#FGt*Y`<#3MM ziSg$6@!PwVfJiIw;tE1PXHFxMb+}8~aSSp5gP9|4q#eE|kbbU^$;9-MI&viIk(R*{2}dT%7jWPpbi?@ZIp0r?>Y*b878n(ZM4iIf3+B&H0vRrDJ=GvO z*gxfw_`n2T^?!(bP+amn>G)}K{Z6BgCjUW5i{d!I#{mv%N=1C7glljG43kZgM?Gha zNAMuhT6(wHbLM0uhuH$nrA8>%TrM-~{cbs3ll&;yuln9bXC|{Eqr7Oi=+^?d_H;ik zJ`Q;;`vRCJZqTntYbQP$T0a3S*d~{rMiEiV)&6+$_9;%N$We|TKR%dHu*AE%{{H^l zSE~GtcKv*sSFUr7QDqM`4JY6$%DZ1nHk?7%z3Jk`fwHv}qFAl53VnzyiRtm_>R7eK2=+tEp}utDX~qem=VVB$Rc_GSXbY(17H4e;ere<)(M~!=Cb2T zuTNXPS!hEE@}gF43clw(We1@zuhA9dDhN!#AX}ymF2f?^5lvth9 z;b{z<0__J$Gt}^mc|k>v-ErWe5!0sa$yCWuMwwKqtE+=-RHbzg%AwPKRSg>el?%e5}_tR||a9bv@ ztBB{RV|-S!MDuEwp5-U7!4uclD^qP5wByNpt9t{!c+%s@Vt1v6C8C9?*PRn}6S>$E z?mXv8K^GpJBGB7P?&!V5zDi0AFU}qphXmM5(a=-kO7P1ouGj`gMrMPM9yob&yEv7; z=|4k)F>2&U{pVvRk@Y57a)P4Ky;#qjD|K@2J?@SnvRrt@NrsYDW4qX>=kaTzp}pD1 zG(2KV6=X8wFuIV8eg4J9CoJst6VUX3%xm zuzfDNCeryVWzfpepva%`3fJZpn=f^@)) z?ChWvlOFt}F!9Aalj3E6a6begzV>kB&oAxB%^PHIc#~_08GJJpyv^;5t(URtZjnF- z=t4YHifMhMp{9Wm@A#ufwg?_k>L*q&2KZ1o{)18osNzk==uqjoI?)AJbi}YETfA0$ z8;8usl@aA=gyy=PP=e4BU17$t3)FqCQPe$c6Z>$;M7pjaf7xqn9lUy;H2T!I6RmaPckZfeID+?S`B}A&aE}FkXSk&2EjN>gFr?A9D%eT_NzlTwjPp>Z;nf`nENBdM!Q5G9f`H3l*s#u2h#;H>iMtlSdjwGoSKR#s zuG*I{Dl#bhHBh~-@tC2{YhS{OfZAeB#P&`G!>Q~NnIlp^1QZ}na*YYZiwwh}ddL8j z8jExn@+xW2sNbk<6MXI9tK*AEKN%upIZirjqlsd#5W5q&s#fA)qZVCAabtrQm9zbzH<6@vi+=Gv0>MZmgL zc5%?40Fyu_p^bO<#n8tU7yY??HDMF7#~rb%cg2iXC=vSIaaW@19)Dq71uSfPr85*4 zUO-Kcj-V-=Am3*CNZbpjoO2*+t~ zh}WNzI^iReC;*i{1ybG(`mVvcojdRQ?a)9okPKw|V%ieG4h%)>9Y5*Z?_YiJjf#DlB4}Ex$)9qBy7}=L(*1a#|aXkk^8cMeT>K zUX(hf62)V$?CyHrGr@R8>;a;+OxuhB2dEwrHv^O30lMq7a90cjY;iB5q$<=IE!e9) ziU4boi6wjABx0CV3Aqw7vW;+%1~H4yQCyeOSIUt6l;SmirC+lm_K5R^O3s!5_1w4! zS?GBLq!U>%TxF0;UMG$cb^VZk{V&;YJucC@1)U41kvEb?MqHe{K|6Q0sVrNFSMuV+ zQxzgFmEM<&6oxc{7EVb?a9)0B0>aA8a$OaQYiqmD0GQpZXVK#r#_(c}Rq-d$VTep7 z5CznO-XXgP1@UOq&L< z5kM_6djgM1(8@}-9r-)7Wg6QY6Qe~wU#$+%O%$vz4Qc7qyxt3t;~9Ptu)za$_8j6W zoEPOp=}Tj;-R)d=zSi~w_D)9)zw3DSwi=@lcp)zj5L^@RmTZH-y?Z;x#KiRVzO4hg zS2}pL8^EJK@O zGUk=9Vjw#A&)lvR?>GQ_`LedGfdP&}rBlQZO~in8V$6I}j%1IDRKMiI(|B=2I>EOx z%H3Ui8cB*TD9Efn&3g1sAbl}}@m7)UziZu}Q~6h5Mgq^Bv#8vYAf^LE?wB}Lm5TW0 zW%|JRb$fT)y?j9x`trR5^SylH=N0&n9Zu)I{%I(y8d1TH1}T>=4+&`7zYBVD=xb0! zP_~K?Dk4rVGjjVtDHOzpr!PSkyqQd6H@HiH!E+yH#L_DYkV>7(vKmZ}9U|sKkT)V# z$38v1d;Q%hms= zF%ut+$cd!)!*wlQ9ns4r_R+*Lh)uYJL9(y8`Rj*=<516w=laaWi`&qX9G`Tur}gcg z$ixbF=<-s?s6l0&jd4RbR$^;2Yk8HEC>i++muHagff*r#R$f$Pl1oI|!qk7`!yGw~ zpk5-&jWU4G`=Fzz7fFxX_V!j0fQb@ErZti#i?Y3biFbrpQt|rnB%5Vc-GkO@c5MGR4Ed9bu77hy-~A4@cM) zBZg?!c$wt2>mf6}8!r<8!&VMr*c^F^93Og;;pjaj#F1>6-9s#r4qUi!L6&iVVab?$ z@7}#4Cwuet#DmkmvO=dRXHkkadc7KSVM+%mb+wijLUhUxCUYpfwvav`aih@@Dhb|; zR{f2~u5Lg<{BrMgKUOUt;d%ugwQ|*2I%CO1-MC-dhKz()$5&2+)4){Ff-o*?qt?V9 zKyA8S{P__4=ODr|WV>063N;rp;cAKqc@Rv3xSPY@^nFqM$wT6Ol@6G;2*C1*mEMr! zM~U(lORV_cZ_*-ZlYX3HHeDsH*sxeL7Reu?#_l^zA~7XOrKS%ig9To%h3 zo<9!oC~s54-mmh^CQqI$FBezEJ9kwt(yZyDgsTy|V4`sXkIs{_s%pK)+D!cTEGq`r zQBk5nj1QWf28ZCZ>R(BvmjD;(BS`G#=HZ*|S5kutBJbLmS>f%>Z5FIK(Ap;0iU#NF zR8Va0jBWful_ntw;BSIm)hunxjW5~nq#xxa8{W>#)4)SFf{Cy;cEb4aNTQj(Y*#qUAw+md$-1Mw6vrW; zl7uD(G#bCC;qLtA{4F{PiD?A`m4?%7$9!Tdq_QEK%Q_2JD05!#-rE~Qaq2{wPv;~b ztob`9M~xQ{hR^F`@FLmD&TN##W*jUcycK0ewLWa2z;7{|Z$jeb5{;k9+sRPdl=cMC z{azQ{P->NsyYxeC2hGB`mi1xL&DA-P0Se zSG|9|ky3aH!0!rpS%T#%br=KLKPWtCj0&LI4RB{TfK6b&r3z zE?dMe0%ALpuXxxkK&LYxmn58N8#~YTd&;OKILCj}*#U04AmE+yDsII4D6cw<>S+gR zC@YsQ%)2i??$p(%+Sr23NWd-yAh&MWn9)L|icO43KI`3`G>}|Cyb>p)yXf_#^L=zI zx~A|F5Zn2%o@OoH!-j|siw7Yqy=syY`4froa;>Xe0&pmJ&h=^EXgWI$T^%lXx(Rst z&MxG&@aUV$8H2qQ8Kjv>6!+sz3O!7V-V6bY1t{58%}@Vz)782aa&6G z1fsm7vmVg!N!qKA`OL9nx3~XY5*5mS3|R*yBf@34dwZ!fv^Id5DM2U>UmUx(Fka zO|I50l+>CxH+|G^2*oKB0A>zjdwvgBUQQW(6+e+QFe8SZJ}>$m9-VNR5a+hkv$%a@ znTc)rVU%Q@=X(nF{xt=;Taa<&WX)BEf$@=NgUUHTnwjexvXj+;+tv@3XR~h~{8DDJ z#$g}|2{=H+p+e!e?(IrR&7xCV_VvB1_2|&n0Ft%C03?kjO`Fz%iS|}z{{aJ}<&g;> zjSj!v;GsjqPScBu0UquSXapEKjQI_gVgLMXe?NUXLL_S4&gEugH2Pl}Sj~jZvWbQd zY)8Jbye$wWjFlp+;+?m?BiIntFgwUd@&$oy1pH0(S{;q$0Zgjzx>x*KuEe%*{px&E zcb31nb-Go!VAec~sSALEqFx+$wV*tY9gmRff-cf}RD4kB_usWBEB;XQZ+3CA1)Gq+ zn!z3`1OvSv{fMEBlm{&<($muXBU+7#xoJn6;>X155Hb->^4lx?DS_5)qcsgYsKAm8 z+m7~g4#PC`z#nUUwRtyVCPODmc45u5sZ-m-Vr&JNz(9Xog30XTi8_44_2E)Fkp zP^?3WzH`b%CWmcxGy8dD8qKfSsATW#JU8`X|0S~;Pa<xEGbNo=KzR;%!lpba}5Ni!ghgk$J<|cIFS>jg{KE<#* z*x^VDYvvQ~NTfrJnCIxdBo*a8yUut{svKcaP1VFGekb4oW?E=(GVjLsu}jk3#y5E5 z{(bX;Y+aEz(QGkCy>YMI1v@3JKc(!Bn{w%i;ruBrLz0*%Hjn58ZDS zug`SRj_z{(gSkXzBiN9*!Ms)#-5HI%+a8oWLja6UkgSaHuCA{iN{&p;#-#Bz&-dAr(Jb0v zjQ7e57cR8k&Q&FQoT-uNkuyI&d)%6DYDf}?3n#2Yl5^vmkw5ad<~`|^=M|<7OYF0p zZelCLD}lHL$%Y@PJ<_?dw|EO_Y&ha!`wVmR-}CWj?`$51i_|Ab3#?8`lMnmua64m!b>pB-$_ed6~@$ zzU8ls>Bq<=n_w6c6g?+HpjJK){CW-D^cKeU1y4@3Pz^lMyTgD11Im94U-PLFtWTC! zPMJP^4stuBaHUR~gckAkjOd}GqQncS{#*awT%VIe3Eb5q_1CJ#z4%&k5Ai_az~~r< z_kSw!uUNqKABXFWp)V&nbo=q+4ZdbsIEqYEF-`1a4Zi$+LwCDivZlUFnd)z8Xgf|I z5Q@2YFSBWIgld&cNbw$)P6UyW5sM``p&@JD-`l)j2OC68FQ#GJl`AjQkmsD0KX{`- zNAV0X2zWus*gH79eyCc3Q>2)tmfZp!6Ajk&M`NV;a?TOMA(vjw($r2YngK1%&$;I@ zA4Pk?eo=yQ+egR8o7}}kKZlP4wk0gdxr7b%?to4l%B&~IsAgB3GqtqbGyflH+#3!^ za}LOLN*J`$93D6adF$Gkh{HX4^%_Nt1KKFlugj`xCyFtK?ilKE1es1K%p4r)9Wj2% zYAU&d>6@r1wp5e=kn6*l1iz3l+hT>aJI~>aZ$TGEO>^MU7(J3|Nm;Vg-hgaKx}yew zs!SsEQK<$um?Sxr{RY@xAyuY5{rF9yG3Cw1p2*Fe4ZdY$d1aqM@6H}QVJnb~)-K&Y z+RmJyAk ziuQ6|?GQptLkJ{ZCFmp2hd@Ts)WZVU_FeMIN*)rh5KVfq(_u$?Sg~1(e53cY3!4aB z_AqEI&qUYe?AOfO9ueukTBlW_{DHeDGge&KKsxS`o-n_k( zs3$ihY20hU9@ba+T`lqW3)Q&e*TPP6!Z||sFR%Qd^*>y@!X$){s2hkB&dj@SU~N=| z)NmR4K8ac7a0l@)Jq*kN8%OhQo&~2s6<0pr&7SI#v*ua-O1t1r7}-=;z(9HB?->w= zm&|@7Adn|sak$`T#T_FPZnq{l2_`u7)yc)J_5l0`Jp3leNm4D-3CzoLv zw+x+!uzn97+~mVA{rJd4+_WNoY8I`;SSj+B$B(Nb!)nMbme4Wo@|HlV_H%;>ip}H> z;L=Vk>G9OVe+g7B9H$+aACFxXCu8$=eTy!IRo9e9-D8x=deWxngiSa=+`IkG4I2jD z8GIT~LknP{qubCP%|(DX5BaKcL_`EWd5gptH3SjTGE}}Rc;{|$gv(5>S>(Pov9=K9 z=_HIWGXesb1M*FV7@FCa?X-2kTF@(zpFK5iuUuiH{eW;!UK^G`u+? z*TLp$Jdk$p?H>DNq%^b1ex17dki$)e57GWZl~cxS8c3Vo(|5IMH2mLB5CwZ2nR)#)CFT>&OwG7%4DkOH$@@e^s4rs$cT{_z(iVJDAnzsoPdCfOj* z+k`N+MhpSKq>^AOY~Gdh4ucklbCU_92x|Q9p~XTFfj?2+Bn^*}fWhWntlBY}y>oB) z)SA-ErUx|BKC|Y_ELzQFi?AL^5URVKntsd$_>-@no#^$3K+gaij8X@hn~wx+ zfYS`5BwPFugYhQ<6^z>p? zblz?#2DzFtW#BE4|I&xd)pIowO&8KZiCIph1k#3GNtbnIz{rQ-icdHb$hY*4JA z?$4Ce9Ht=E*?@aF2*Z~o>%d^5NwM;jS<+7f+{oQ{7eS;K6K(3MC8`e!j1s;SVZK{NAWfKZQW=z+4*}7I_ zG7%~vR?@`VHmHdeF73&{0qV~n{}*-V?eY~ysEd(9YBl_k$nbe=sL{O$U63dUo)nna z=V#}GTG7Zvcjc-&C1OO*5^d8h<_aX1Q>RW%;<)|ELan5i5A8L0Ymr-s@0{OaG$>k) zR!9hWvphn8o93b;&s(W((4L#hs56}LWicwEy$%`jsQ})Y)HgDbhKOasKW5jiZM^5g z|E|U6iv=kRn{^R?Nu~a!x1ZOLgVUtY zCk)vUa)MysY%O6w6!3(v$7y5-yoIaAk-WT+FnkrKN?hM*VV}II#^cmZn-`5nf0KO7~gm z-5h`$D;GEkxq{<5xr`g<^U-iD!yj$KO$3xH>V`S)0n8JFkSK{twK=*46r;Wi9`&G; zh;V5WN1xcT(_o_hFX?_fJLJJB(8MW!ENIhVz~3zoSS0Q`23;gM#_|It8fbx@ySX8o zjCKN*;<@;Gac_`7`$?W#X(>ezxXwSg*oI9J$5~UbT7|`>bWc5WT>x6Vi zH&&1w+({rtDz~Wd!Q8H`uTrP$8Hu75&ViF&i-_;v?!2s+j3cnH01tIgdz((Wc377LSPx$@ZBfV!OMbhG5uJ9`AR zYSevP|IK^%`tAyHHS7&bi)e8(?`{L`;h@ZY7dwH0qcjFlK61ABxX4JCi0v(H)M|m1 zUZ>Un%7A#dht8?|=>rd1or72=drUkow{sx&_SD8of^hzM<%$i^X(w5JOqY0U9l8@E zXD)GkP9~{XLdVcre6XGfWLksUQANlW|l9&uH1qZ7M&PT%`dB$fbVuxAEr`OX3=l}*O3h4-@1Ri^(QJ@#b{QT3>FA5e= ziUY@}7Xk=oaO%Gb3fcX?H?vxogb<7BXuyR8gyXqfS$WeDqq6dD+PfCA9XE9&d1nWX ztAoR~0i7EKm;=kFj>_SekrwKx5NhsCtVIloJKx`*ZiETK!NCwmjDfX%u<2DSJaYP; zdUWZ{{WahuX$f&OVY74ODL zaX~$B13J6r!c%&7b2@AKwct6lz}fVzk_#(3*WkKlAd$dHg554#1b=p6hl8Vnp@1Lq z7XM;7m>WX@$jeBiweP=7ySouw#Nt^1QHW8d0F~J4H#&js%l0WCCz|x;0_NhMsL}cFiEU|H7V<(Qv67`>^_w^1S}>Ob^lQ?q)rFv) z%hn6pO0WZBjICy#^vC5Az*f`$5HQ!&)pKTETN@p*plg8UkToE+Zx^LIT-#ZAu5 zV98A^2{E!7UGek#P8Z!A*f?mzxV#GOO`H`iAkAZ}W zM&o_L+dtpAG6{*?ddAh&E%->P-#0XCp}OEnle(X^;fuwmptfXG?A<;ulx)t3@@ zAv1WeuU@^H$4HknR@-sx*ev=}NerWXYcPW7Uq&h5riI`rdL5OFyWu8ZY^FK(5OI%l zE`=!x?2alNC^f&l_po96{O2cyuo1B0Q~meVbQ*>}l{sg5VjMrrzki^f^N8u4G(PV4 z@~ixeziVlye_MEO^0`y`R(9@0$idyNmtTXrS+W; zT`l?`1MHc0S6M}*Zs8jY<}$=eZ=5m2l9bKug}F!2TH%aq0k}_*saRr{3#g*|(f+sx zql_f)d3iBiLHY+GG?C$t&Ls)F+B3?o?KyrMmODPcDe>YuHxyL3o~8a*bX) zk|)^jELWyLeDcn+7gf_>FF*8Irs(ojuxm0b!>yRFI=mEpg(r$lQ2;0Q)I>xr(o^wL z(rhIfFTaI<5(IDS?%leHx9^igWlm1KwW%&Rz3|sWXU_)REjG{NJrWEgB0??^NDGmi z{Ccylt)^!Bi(V3&%vG}$&P?WV!!=C)eF+wAH(fo?d2vL9_KO4V?V6u zFyL~^=T|gkcB=?qU8EhKZFW~#MovA0038dae(_Rp(r;03(1moH)wq7*;x*@WAJLUuyxy<$wD8_dwGJZkhSR3Q|~4a6*7W% zQ0P=^qlZ{|mXWL??SU}9|0WIS-~S#kszi%CpYyxu+J}EU`F19M=>JHlPQ(2=)&H#4 z^Kk1*yJN!;TTX+5{H-m~7$r^>Cp<@4-$aMC;m(uOiZSamZ>j9FR35arEdE4el@T6^ zk#AiX63p2sN89BE@Ef>(!e98vIQU9Hc&u-e#=%U#6Kb1vW4M2O@ai0Z^;%p1>-u0H zgzY?=ks~)-|Iy5394v-_S3bb?$z^Zybgd0t#lr|UA$@6La;6N(=qGIXDOU_o#&>dn zYOO?!r!(_eYC!qTYh=;eh{+;K z0Xh3Bi!eqSVFYhCP#LWFNB7Onq$GVHO9?k@(xOAz2b-!7+V?K@E-K0J4V}EQ|I%8E zzAJkyt?C)Iw^7onRhxHoubuZR<@j;dx?#ock|~0XW3Jr@dtwM}f-s8qZ#K;9h2TUD zIo_eE7`Ik2J7A;@3VDVAk1~LZ(oKPlG&4wjRe&o{gCqm*crkN5U#BZxX5(+&(M>D* zA*9(~GIcW700x1;5nVS02C63BjYjFnkD4jN^SQbqye~Q1=qxC7vbwVPDPsP(4hHMM ztR!ebYAHZlRy^ptcl)?NEUid{dr0)krI3DR-xg(I~n{ zueQoTsh9cX30y0$`W#WNFDLzN-6i7XPE7kFw3SmP`dCrfHrKOGaA^}ybnE>?5T7;9 z<@QdENQ_{q@7=_A=d%QD7&(r}rbuo=Ny<=!E(MJ#Z4HVQ{}lki)I%W) zQuwm_n%mfyJJ24~F8cQr&db`UOy=C#oY4mEQm8jd{QGyFt9S8qU@pq$n2RXM%u}=~ zTyP8s{2`?ehq$@BXHbC58~j7~2Iz;jP(TD9v;9t##;ze2x1gAF*4&Hj&l#3vCZQx~ z70W)Tq~M6+rwKsSn4X@#i6?iAZxOWqZH7OdxL$y9NjYsVhuPrSVhX?}y3L=xYvb*1 z|B~X;oJGQ-e&qHYu!QUwWey!mpa>U-OiGjJe`Vhq>s%tYu#S+@Y9yCbJ{Q~z@qsGLE+c>hY>OLgTn3#KsU^Nruwq}(X3GLV7mHTxbh zT;UszDz3!yj;z1Z6X|qdD+gN?nGyo^M$wJChOy3~phXt*n$qxFTZ}=L=Z^tjpeOCB zsg`*6xJVtiE%9`--iB+$W3}?VC}PV~RGt&p z&OdP(dfy)S{K5#j=GvugrDY`{9;99@(8=D@xQrBj`Oh%Xl|BrV2=@GpE4*eE5xiz4 z|K)?Wy?xzSNo;O189|{Y#+c&PyC@G^uM`rZIQrgspZcQ0yLKy**DSGi z8!R9_x)rglD;y7kM4EGFK0588M=xIdu#|aDYaO{*wr}b4_51dX3W0~1d2RYGO}9GQ zY4(maho6;Phg^1&>bu??u8do64#Ivh9=nsow}tjY@7JNkLuJ|F?Hl2cA^esX52FnN zToqoG0KWRfyMF)_&LO}Q&8%+rU#Dh`^~B>syxR^k&OhVG-|NDa`8+q<`f(~|bm^)y%s>b(;F3s}4}FL83C zMvaz{xk5Z#<)wN(!_O4E`~odb|9?k#%=O1FF2mBHvJ@bY1t#SmR9vAGq+8juCzQxW zU16C*Y*UUYt$Vqo_+8USCz{!pO*r1^$WcH4dm~1_`Qg8!U9d?TQ&ZD>2-fIx#XyA1 z`K^wmYsEA9Lc{;t=lt1CZj;aVV3!oEBd=N&)aeJYKq zZvk=}nTyYEk&?#=m2(GQTrr=I`|kH7vW&wJE2h(C^F`W#`*^4*iT)2t6>e}dolyA) zD_7!VxUBQSr=n63(c+AXe*JiF?W3=tH9Q}MoZJj#&0@geB4l=FIe}k4KGqO!@%m}$ zAY|htT*}RyoE`<*3j5rHCr`FO1#I1%UKI76eb#_lrRSRc0*U2iWQH#Q;xKbPfE%E`uVvoe?a!TgNmCr zP3Y}&v_Z5jyg5Wu_s32H-2`Yb@k>fd5^Dwcz2~Au`K1pYK8#KmAS6Qb(GeJd2;hE9W28kxa#KvzSZW__&YfDxN1t~YP z^gfh1ikTJ?C`7!Ti~O$0dw$Ym?e_$#lXfy9+vKesuku;E^dgXPaX9H)pwu+zrblLB z>dzlf>$dC}s(bIryF;UWnJ;B!0HAWA&CHx?uh;$yR8<~wJ4+!yB*nuCxxlc|mrI*C4#=qyqv%uMc`>W=0EeSHb7 z%rn1#IMB%WJ4$jH`ug~CXH^kZ`2Lvieu6`t;V5{5@d74-=;?UC;CG?noV&pOml2_h zV5>wN3Tjldax-v&C@@9!FAGSl$L8q4a|@j;stRem0WP=;;?d{Qqe~=g=V~RE>u%*& zNn`-wy3?Xfi}dIqfmPaiOrJW{q3YCV9_v6JYd`2L`Jp*}3P%IT!9c*@1CFzNpE+&5 zx@L29H|1u-hifRYr?Tdg8F6BDU#{#P0}U5|15Pv#)<&-K{t1RzFucAjMQc09yo((3 zX3%kE6%}50J3{H$QoGbY&uDLB|4Wc}9+Bi^!mXcADA~!Y+z`G{XHQxll!a`;+Js8jpe}j~_2K{Id|hFb3asLk|QR`9mD4K-0txw`t-l3j+Fe8kCs9j~=n7suOlXYx8Bl|J@#%qHz; z$-MsZ8`1ReW$e1@|AXOLOp&sihacAfTaWlfpjqT~B9XC-MLm222R$r*Fu83b_rRU6 z*>D3-`8wZ`eB0n-nN-&7WDRH7oYd4*5kF8sYgR_jf7yYQg2=b~cR#6))K8g{IohD; z`>NSr=M_CN={j)N>71cPMkDqt&JedgzfC$bFCYd#8s*l;P|K6)0y{!FXE`b+=H`oj zJ16jVpBopNn$SAtI%;Zh{lbg1&c-Axs}$h=H*o{$q{(MN?u`wzdI-S7X?0(AjodSB*?xOac?=dw}7+5N;XEgu5dWj2$J1gIO0c68S+nznLXTb;%% zX>Q!4BK{hP5Y$IhdKW!3pi1+9nCCM9z-=O?&194^TwP~u#vhK5O)8p@(|DOv4`(8} zi(Ul{boiCTAft1zXuv&Smt+W#RzuRjV1p4=Hgj}z6rVYnI9UT|LPcIwdF2|*r_xE0 zlzronpe>a|MQ1>ho5C(g;}tVCxgBKWq$CO7&pLP!=PKfD*%qpTV|w;cHHp392*%X3 z+9jRUIKn50y{vtm#%(EBy}Mn7F)smie2k2#?4WGuWpW20#uL$vWOs8C-mJf|Q`5nf z;>3%gtOWHd$CymhxZfQnQ(>^2HO07FhQ>wIa5hO%W_e6E(~`FLHxAHT2XT7>QqCO7 zu2>RKRK9(v>VtuT;Ugn2@ArEf>_*=yXw`0D^R-o>1*LZn*`@CvR+#;EcYh3TH=xy| zgtB@w*u|*<)k2JgsXESOXAgPT!>QyGoE#lRuopK4O_P)alu6MoIk}?ZVmjzK`BZbl zNf5}$#%|}CbPp@uPMalL3&1aeKvDr`8i6rF;|M*TKjkGaRZi(;uWNYR4sr20{{uO` zc4uK?EMu2_I2;=9S|Z89=e%>G{^i~DPxO3;2>WXYZ&7taCGqFghQL>a<3}dY z61wQ8q&6lREH6b9M#$Gty*{hC=Miu{rD<;4XGSo8Zt42Qi@0}19q5&%F0wWJ*11pm z)S=sFd>E&Ad2QVa!J|Z$9z(3z`M;s6SOyo4?i?t8N~&TAL3QEO)Jl`fjVU#Sg|Fd6A4C} zNIeZTwHyoUG|&$bfo9r0*A0S=&48K>;a!Mq|3sp(=FxZGU>T@_;HFJD3S@(ybLZTB zDA^@vThL^mIyJ|K# zmh5_>aMW1DBXV4Y{(AE|oLZ%M70$D|{ACmnbrY}NU*Zmf1gBt*DCp+TvLK`y!b zuC76N)Ae-5xxX)}9vw^8V$(?{iq6+gzHWK%jK1E^St9zAn}uPSo067Toa2~w62IJ; zP_c=tvaJy5({M-2LDGH*Q^16SXxY{hB7}*p1Uud_HbWuoS5oTGp@Yb4-S=^Q6d|T!NeJiU@+}nbg8(K$i zvJax@$zr@In3rfMMZE94cVG*|b_x@D9lLYyQDZvA(Xd6(LT2F~fvd zmDUU;+-M}xVWiqNZr~W-+FUzN^nHEiLlZh5095V<4n~GdIfe+b(PL59U%=A z&IrIkUVSiKpqwtG3yC66JabwpZpU@HhFtICeOpoJ;9u2qX}xvgonaFv&i=NjtAR?7 zoRpS(_H5eOMsH^e%$FR$=8Wi(um-*#emb}@UlIx^j!}FY(@q_=enU(_$cZFQ{!TGA za!(omh5pX;>e^=d4@RM5;3kli-(M%uI{UOwN{oxkG5zzMA-6o)Et^JkO-H~JAE}FA zir2qim3XG;`s3qHXsb0AM4!RQG{VT(_$Gsf?0%3nIXb7Hyv*<1Xp2jC;YP|SU z|5~?Ps+;KeCkuSPlm#{%IoS zhhpl@Qg(PUPGpq>qyo={)~;7p^1dA_qBZRuO^JIFU6nSKbraqjp^h`!sUAlDLl$EF;YO{3LqN4fpR_?gAW-Sn|LvQu73S1nNLD1 z+(Hpo*KQ)q*Y1dps16yB#G~_5Wg?_Bw6@Sw672{_#z_$x+rMMKCQtv+c=~7Sc9yXP zj@x!<&-Tr>b7~7JFSI8>)_IJX%{Ae)^vqr9)}z>|M` z^69&v{13AJ^R>yo#Pd$h4h|-HQ@=8C;s^BfN~>gPt=tO~P#ch@q_25NQxGxJpNUL; zu#cD57H)K>pHI)#eP0)lep;gHX;ehJY+E5Ixv1)b3pB7+ZVC#r+jV}l!#AWT5qw4| z!iwYRA|a#w66-D7LQzqQ_-XY3-e{e}-nO$IA?vRbsX zW5%HJZ9|vb)BI2=NepvULD*6ywUdi3|8WS>PiN#yL5Ma zXYo_07Y`mhh2ZptnfFweCa#v0$oTW&ebTi z|A~G2@=FDo2ASE$*3!gX?N6N=v3Stx$;ZlmCj7Xyee=O~D?hwzTG#2ps;@mXTbFON zO5LpNk$ZgR-pHIFq)bVCT6^pVoOq2@x5Wi~pLA1jC1OguX3uv$7tU#&B&W5f5HoGR zV(OJ<=kiMj(kJcdEg3-WCA;XM)u^1$j)l3GbJ-1G3+k)=Vbv3FqL6_$Naln(mAUNwlhcVa5>~mCPNwe>cO2Gio^lc+&; ztMhR9=j1lR3Mn5opH8QhfxQg>wx{9{bdLC@sS+)qQ>}Zim@rW}u<(TXhY!lvH#8bv z{kBIB)`2J{zW#Ha_WQp+|M>Cv_{RES?K-F^E93F0uOGIvKiw(-q39yHq3)Ay>T`c; z49#IVcd2-$uop=%mxsY1InXzjq)yOw`zpEVLD2jKr181sFvB9RO6#nD;?SWTZxU|D z#_AkSPVRR$QTjzl2w~yrGRE-zpYQ(`zaNZlTpUe0tY5Tua_Tj-49)d!e_Key5w%5F z0+wcEJ%OM?YX93scV9J7w+NbLde|mh6uak@*fDpDQeFguY=^V{IUQ0M6_%_{lK3?- z+k!G^r-9R5yVr351w_7)`aRH6W4L`pKPT)n-N73Vo6;Onc^!3b&$9>2%%ah*T^a)0 zTbrFSlW+8w*;T(y*QzHSI(V?}#_uZyt-~A1>X=DDIl^qpzy+aKb74mO;MP;FcNn~} z!}}Mt8%&Mg{uo!oud(c^qw@IoM$a!Qr?s^F^g#9Lg=TSszWivUmUjE-0OLzQ!OOmX zoiBn2kdSu|wV0DkocCF_5q*liVe!M|TX~`PNRQb8J#c;%`WNvvNJ})1n@jq37II`H zZ_>Luw`QLOk_U0_c@4jge;scxqC`OPfXpR@R{M0d3dFTI09oGl8Q;e#T zB&&XlC7?q#oI%1k<=R?v_fe@~k&!`Mcf4tVkkRsLD;!cMLJg9UlTK;_-OughdV3mG zLVy|)M5#!)|9GOhxZaa$P*jHd$J=rcMSPsa_eU=lNTb3b?kt_Vu)JFne70)EOV*Pj z(X#`dc9a&@GYp8c4{QGeTQsQyEyTQ#v&QJ;B})cR2@6AN^448Tlm;^O?DIe6lb3R1 z>*j8Dn|Ahsyh_U+6WPSnG}Wx=>eb5AQC7OTU3_TfpR#Dv`vWT^E)QNhXRr; zH{TVkxsE)a?GOb*kWO9wtp4!Hll!~_{K$g4IOh)hOXk=sfY?7S>GdPCfokRJCCV<6 z(zJK@^8a|td-vNX%Q?V%cf61D0^^V*uU+1QBIyBEj7=T7v`9&;bYg@>o6`BxefcTvA0##l!svdc#QDF@t)X8&BDx}~bR zu+YEo;Zfzl{tl^65plvKi$sckK%7&+wDBFd8&E+P(SQg&UAbcW;md5uL;}j|$IiKJ zGd|}egT?p+R-fJzHDemEq3qmdm|V7qhE$RW(0xRYg9Cuz86{j*Y+Ou?+pfxZxtuz5 zxSdIL6Uz^nLpus$6Rd_Dk zrs+vmJ|k(3SdSX_7oh2W^1s_T0$4J!M$^K5U` zy2WabUS1uM;x@uYMYDabuaR#?lcJ&WX?hrn!5j~CI8dI1@k=!u?s9F*f&!`tyVnKx4}uwW;(xfs&S_! zgiwW&P&I>`8SJAMAyh4b>$d;GzrtO@QjQ%<&&&)Mvez0dfCSSGzY_;2DI*gu1QaDU zR0+RYwW;1~TF&de?&`vVBUGy-D!KC_&X4Sn0Gx`)?;7=@^6S^RT?U@NaKV;t@|;!d zq?ln?>Ol!N?c2A{Htn6Hz)IJOl!<1iM|qRu2$%T}rN3F-lz9XXyv{+{TuQK%?PbH=LuMV~&CnUG2LRyBTUKZNd#^#f-7d-}qGL(ei=AcK-iQ!n5&zMPd zu;G>NoKG&$>DZsp0B0$ga#fc<`XeoQ-|F zy?4H=T>7SA>noeS`kL$N?lyIANn29-ia9*<3*5;Z+&C9Bz6J3f$~riTP1O4#)k@<} z&l(2aV*YNH(=>KIAWV$jzrRleI`6QQ=*A!%n9e3DW^(bu=cZ+jZEhew3r|+9D5m7& z(sJ5m`Z~kt0V7q`mqCl3Y66FOqg-%{*%|xlBUQ6G|95@)L(A zx;Q!0U~g-sC%Rclrmq>_&Si~GBS_}?qdc@6<|ACekY|4%lG^QfY%PEYy+p5eV3a z=C!Z3A_Bt4xwqdxS9C*cB^8^wgS>VE+B z=nen1XXlC5-8k#X2M@-aPV6W#9)P5C&=5i1V{sSWN5WnZ@F}Lfh3T~K_&vrxbSwuf zej%dK4v}`j%}KMD+%JZ?RvH>%of6ds3>GlN}?&~N+2PU%7TWjrh)=` zcD1&i)d?@%2nvK_oqY+Ip#;J?OE9N6OvR8`;ma@0WPqeD>PMiw4@)r#p$!j$v=$%W zv;8-wXi7<-2fUxUaf7g_E>4dMx^1G%|38+_JFe&bedEbWWTfm-6qRhs43TIc4J9+# zr%*UD3!#h@m1IUyJ{cv-3?&UK)RB-%A*&)q^n2cZ-#@;O^Z1^Vd_M2@>vfOozOL&Q z+0Y73@l2Pd)iNO^4>R?d^ELBU1RZ?(iY2Y|+sl$j-tBQhf@FA6t_#A({~h{jTBru? zz*Z`{I}#oCmcClTRh3Z?e_MAwy&aR=9)OHMTZb99>5m1Qrra1&@Zsn0->gBKc=oZX zZ}P*OSKHK>pRI4GuL8U+^g=Xyl8}#gdGo!xd>&4+b9gsmame^*cDI34?I+W}Oq-yh zKMq~yXxyS&lk~cXj!0VZUT|v=Lqh4)hWQy@)cQE$B&XE{=2(dFT4mF1f2hS+K-30^ z#B^*voZ-Oz`*rpVUi3(bNV>PWCNT~{VKXEwR)$Eh7>5b7WI`2z9Rs}Nlpd1~sX#sH z;gBtFj($Q=8aQBr3Z+5dZ)oXJyBn0xUbu$(pzY0b(b3|RKM>zO{q*9b%O4m*QYXEkZWWt% zN_J>j;;TaY_3(R5VXADuVnl<9dvJB2eNyDf2DKH22A;DvjPc!Gf7H>)XHV)UhG+*W zK_ZbEF8#$=J`$u9RsvYTCudrKNAq@mUFNqv>m^QjihVo=_-uF)$Q}L_e@N;qp%!Mhdq%KkYLvOuuxa(HSFeOh!k3htzQr3$i9yx(I$yD; zU!&cJlpv|TbQHqmVjvcjaNMUN_O5WLmHvO09`OBNY;#moY@78j}P)cK1MQ|=IW z9XhP^#GZ#nk74(xIFJkZAGq1Swr&{+2f0&L?kw2vN(-*?Ur5RE={adRt9u`uM=?n8E>11AuNJ5J<{D?$;u-a%2Ed1 zV+hYR7oT!Ol4%IU+fLSgNdYZ|KwLNbt45FFdv?{0J5AK#=Vjlj6uf@!+X@Az6B;JY z?+gnvPDSG2;x~vjty52mu@aH5AKT$x7%nsdKzz;b6S*DXvNWdrtU__<)0*0$o+Za% zk*^=(Ob8S+SgNhm3ushC_eRmTU`bQicL1@<E-qol3=8SIV6P z)D=sK!vBzJ$Tf+Y^h$K5tor4LMXIB7<<4m2k5o@`P{6YGpJ}Yr^bR9=Ogu%`jbzO) zpq?tKLB4r)#SEMiZ}CBG$YIi;!=QjG)4G)U=s@YOU=gcOg$ap-C?X3Nfes@6{qkzP zzWy!ps_Re1V>ROiiD+>={)E7kQfusDgF~4UMs(s9cW*4Pzh*_Bx)- z^>G{~By$*P6CBprG*2{;wO2MgOa^O42fiMmZm{9Hp%KkPZRnw@+8-1S@NxcCoT^f43XrXd$-*`LpGvCtCAwJ=C|!o|COpP&%l*>*dQ+ z&AIgg6oJ%<)CzX>Xh@Ud6AaPdhBz9d4+6v8jLZV>vCUA3VC~GIRv)si%1|-I;FcM5CMQT7?y{1_jRV zb`gTdPwB7~dmgL`1vBPIUSOxE&{t(1ffN)9OF7dD$oSnDUT)IAgZZq`>R}lpf$>c6 zG+{(T`jtYFICu9HtH%TQZrWN}-Zf)F)?Y@4f`{a0KiG(Gn6F9QWDx_<$#Ua8?N`kr zl+hR+jovp6iMEtz;+fC*t@6F{Vq6bcMY{#Kpgh_|R@UNIahlc{>2USqY9m-6xzHhc zr~L|(ZNkhl=8-kc2du#pK$}SosNJS;hisA0PVQgg; zYlyGTyw$ITzjyA{2j-mOUutp}!qzXCB>{gZwBV4z?(d9@VF+xuD z1$hgUsBW>km(#$|}}4crhJ^GdfSPU56t5TE)R4cE%u0@u0&CqoUX69m5Sx_&M^ zDqqwDB9Rp2Z1DwVk8?OD5<184YFCdn$WTJHb#%7&mC2bn$q40_dPaVN%0>HCd5AL? zkdi2cuOzz=844Wi8#qx`;zH77KVEm4fx7Soh5*?KF-kX(a4vuNNJ+PrDi$d%3JIII zb&Lg8lC_$CdtP0-crk^yFPpE${d8^Kq`Bffz&&|%eciw1J0_r_h>8xyb_x3vTr?J1=klgKr`pG2UH^DwjTs(e=DqwBy@EOG`1*Vz}DtPwmfV#HYDSmu7CC z|A5yjJe2ZP^x+tKK72~CKCyd?>-L0jS?BRrl%d{Va4cLVsR)W~$7Q&^Zr-3_`Qut? zukhEB^&JrAEj!8LanNU5=XOY3L^zEIMOjI#v2ZepcE0%Vfw=v%mx+lBraZ&Y`*Tyb zFo&e}_nU0VR;{2yQ);_MsHXKZ-McWW5@)9VraQjr6J)`D`vdR`G*0nzhuV?X+_d}! zRiFUB3dU}tXK>%;MF)0^ff7BM_ozLm`a-`FDk#<`vRg!qp6NcrX8*{&%=e$i=@6hu zeu6RJ+xJn`U|T{8p@P^B^eUcc-1)*x*AV8i2aVh^Qed8!BV>{&t7{D}4FbTO6n;VK zjLhybU;~gwMW;S$*;9%b2D013!<~=ZXxrA8m!mag$bqo4$Nqm`T=^5R+RJ7Bw1yQyVo(&WQzX{id>GPf0J;@c@s2{#g^MsZ&j7 zC*v@&jdj4D7i~yq1o+!eC&q(*3QTqcj4?njW8`qoHa>s&5PMY2AwB4pavkqvllfq!>Uv&H9E zY81ntx3Pm({21iIj4@el-(H$*aCpb{=>{#-2D^yXv#+d-u71b@R|71~8dm0gbai#z z!Dp{deJn-oSyj3;t{>mW*Hh zFbR2|$;^|t@0dkAIBeE!v`&n3=);oNk(RGV_0Ur9JkmgYV#T@s{1JRXQr6!Pq*-h+ zLM^POP7PW_TV|7D*ReM;r!3wXM;U)nU{<>|TKw zbety7<8r3CR!hmHi>gLdeI91$|7myq>d@v5o9Y@iICpx7uU4CqgztHswR&uRS?|)U zt1VN-o4x<(J}mVrN&5HIkE}lT?q&_|Ic&9S zYUfU!F!|5)x6v@OZzM%v!0VF53J5(kr?w^IcUxvsoIFC#i3f%AhcXk$eVR<(&(kdZ zyX|ncPD>Sm+Jwm{-aIoVO=^y~eE#_Jv<`n(d~!2Y*;rfc13)nk2!yJzaq-)_O^bj3 z{`D`+45jB!dha3GPCAOZiFzI;+E#i&<%i7!;ha(}d)|2~F*i}$KjO4S^oU#s0MP=( zH-Lq#QdsdMRfg)~wMRe*+IqokJ&m}E87>#ZWX@;Lo=In)TwKfcQL`}=p3HK$z1SL|`jK#zKg95Xx8xy7HJ!ypl$SNMyRl4kO_L)7;U_VSujxxoG6 zyXgtacLVC`{=B+=bK%aOCMI3j*sz)Kf2KKn&TRw@hZlwFJ5#0grw?lYEyCf{a_kPs zR~Pa^g;6ITN*1qS!LZ`VR82PAfqzKhMafVcW!X74cB-!LtK?Iz-3$$_A{^(isF5`3 zuq)zp9HP!SPkPLGV|uJpi+ufyj5GRo@1HbMzgG}FKp}@&@gKOez`y*sUQC3#s;^W; zW$};bp7^U>5_)}+u{|kj<%g$DP{W5Vd2@oZ%ifO^y5@c?Ny7iyBYgkR*EctrLvp|{ zG`&Ob7D}8X#bDRUUW1x8P!@!a?H;g!Tz8k4SKa)@=MU>xO>GfUb0yF&l`l8g{q$%w z_|oAq2y>5_@i;r%l*gVlmwTgn?plsRQBjfDjEq?G)jK>$%0ghF2`l%)YD>X9<-GgL zVIT7nn!@dq%{6DNJv`#Faz{Os+8CgvUuiJ?$SvZn3?sy6o18WVHgnQ;dyBE#lwMw4 z`1|IG?pnM5Z0BG}mk-De3g~3~h#fUg%?mJ`EFvA?iMSa>Xj%F9Z{McC3U&BZ@eelM zf=Mk{TvdE8m6^Q|=vh!u9x(7^@Sy3=krt}geI}=mlgf-3x?r}owHj0I(KL>ZpY;3< zI&PH>^T%wuGb~edN$5OW`T9CfX9ugTEwR#SBD!9dCi+nltO&Q$1DV-Q)81<}-ex$= z?9@ELY2G2DM{q3%oB2few}m}c&P9BwD%QrlqQqzyCpraLd`=P_>*N#`-Y1@_<@lL1 zP0>vH=`Xamv!iyu_mN&azG5g0pjTMv!p{dNDjv4MZTa$kW!n}*GttSLVmBAdOc^5N zFZbb1DB)#ePN8OOzW@+T_Ih=U;sdSBaCQq$D-x10%+=jiQ8yfLh3D0XSt1J9M(!{e%+Jxl8Ce{RLRg8ZS!ygaoAYp(gOs`pvRD{w-}t{Yzn*Jm1q96V_7 z%v0@x<1Rigb_#9fW5e#Q95&F%XgotKr`!&jvNJ{Mv}4DP%`iV<`Gk)v9V!zWZC%~S ztX&?b66|Ai_6ICejhRuyWd$L06sq3n$&&+k4QwL%Wwg{kW~irk!JN@r_on}wai{+2 z(VfRt1~c}9=|jDcoShxC$|rP7OXV&B+ZoP^ah|~E!0SneDimCUHJJFFF}?y3nX9Io z(^y{b1nvd7^UlZ2^z^w@lkbiUEIx6lsC-Q#&Xf##n(^M;uiPW!(=Q2IejX*blV%b*kL$*h4;V{jENh&-JV>L21XSa}`sHEiORWqV#mWF*h zMzXi?a!PzNYO1}xFU|P46&E0PmLuUCaNsu>#f1tDGn?QsUNNyzuoM}di9yVW5hG5{ z5)Gs*HkMr$d_Rpvzukro9ZIZ-*i`pNcxSCATUlkrpNP6hG(~LZ!ni4G_joX422mm5 z;Z--AHmTRBMI-grJ~#g;n`|t;w0BQlLcM|Uin<@)8eDQKx}HRm;SEd z+(f@jW=1AUB1xY+k&>}4t~K?Y)eV3|&DBv20pbKv17I6VNoBS0BBrBTh_Kj*U!ZDN z51-h5l;pdu6+dFf1be|>Q?#-sRNbXZaB}0qZg_aKexE*0PwaZnIG_pb{(zC%kPQc4 zTye?7pf>H}nZ2~1mWtgwKMsx)@KcaYzOv8~QN`~Dmzy}lF|;v5qC3!4L^;!=3P}Zq zrvogTOd&-Mf_^F7*Lc~I%>{PYF}TU74L=)DiNd$*M5iA5;avn8C@ruc@XubMC(LP+ zc%%EuzSSsAVX}9+&gc*)z+5pR?xCij<8ZuhQOMI?=l3WmUn6U4;x8>B6B*PhOzhI- zX33afY2*FZgexdivBVYg&X!(!3o_mNZ}CD9e(C_tiX*?33JUK1mhe88AU?bB87S_} z&K~YrR}A{P!_RMS6;LV#(CsDN-6*!x0A-xy;a;f9+}E`2pSrrT+=ch^^?UW4q%`!@ zf6HDkP#a(n19l*rF*ucy^c+h+V?iI3H|G$);BQlI?A{4#mk&WquJFAhX3>B|zQZ;Z z`S050dbZ3WqQ1on86?najD?Jqs2?qY2Whw~=g)aLjY#Zj9k+IjP3m%ZP<~y;gF=d+ zw%2$YyZ3AVbUL5Va6y)m#{;Kz-;@p=j(7i1I`zfbM?6^ZUzHPs;$3kh>0Xzle~a#_ zLCX`qpx9D_B5$Q}cOmv-Wj`V5;K4!W5-r!>W7%-$t|sf}r0V%c7;NTy6j4(s9L)~A z+Cy{%z!VAZ(u>;%2?dS$*&JQK4bG}Pvb*pIPq^lmh=0W*=X1|-+wCa zgUA(Nj<`D-fVs#p=FZ)_+rka@a+3rAO}Hq%&gPw-)2dr2*RL--9$o(!)m;q?v`Omh zbKSG&d5`%ybw56~X65&1xMnU!spJ8|>h~ zZ@dK?S{Mm@aeUwIyLB5ZVicHmb6LPbskq{au78e$epojRU0oubE@gZJrFe!Y`=C#F zgip2eW5=CFS%TA}PbdxYw;SXR7@+b#FPKHGD)r(nO;1qqss;y9axcp$g51(TNj6kt zf%G;iozCGNF>xYOtX8VN%vXU$?~x{&C`Cj@nhBA5q+-U`%F6BtvK6`4@#SiQ0Nf~& zIFXAXy3^5B+-9AD1NXg9$uHu&nLeN$gzx4eTVd-k>8TWd(7pvyw9gKRrWQdJ2aZOuk0-+=w_QwuK!xEzt zr@L8NS?K`7hpu^8@(<6r8?DaUst)~U+^B}Xo>?%>>BEUKnN^ zah~KBXSlAs&^P7RL5^cG&f?%z*W-~PrY zTIvb5yL->N){e5Ucw1&*wvQ#E8zr){q&)ygx@<-d5b|j28(owycqam$vS#?blMVogdgCiULA5$x#U;-q(w{ z$MkHQuq)ZU?UD)?(~nZWkjvH2$f(cd+=Be*xi4S7{NGW~d3*d)2aFNvJzc<{#0WP2 zpS^>4L1K_D23z!}!rpM-r`&yO0cck>yB5S}WV%HUyvJiKt+m(X+=X)@`}*F&XIgq? zHAOmPU*Bgp3^TJD;5y&I>*%3FgFpPq>HU1t;kv5^_THMkylX1st6pELS6G-BThW%U zMj8OG9D`qvlFpw#$eGPHcIGAE4Elz+2-fU_R8K{lJ13q_Pw*q#s93t|HuIG+G`JP{ z9?lQWC@!2oKbmF)c)StRnUZDNZV(zo28k_b0F{?cj~*W3_d3Z@F+I2Sv5FI;U6d7Ki6!F^)@HQ8Ck!&Vrv{3fYQ3$GDffSWL%+Us%st{ZPtw%R* z-(V7VDltpo`pVMDj6`k|FF};07K7d5lvdjZF+VfUtQ*_5jSpYI?3- zy^WE_QhgPF`oCJe775SjxMf+QFfYu_7k5C_EE+?c1zd6qtJj-|-!+c-E*O$4(uyi; zTJB6$RHbUS*(ngJc%X3x#{Kh;*!S*zdFw2nJ@wB93;)qdA73;!oW6fm_t*KI*8CiF zW{+c#ot<|`Z=bvbpKmLZv(@j-a=0;?!At{Fm9;-U-EFs37AFy!Dp?@eMLwE2JDpr3|4l%6v;81$rG`j{lvGv_wH;QW< zFm3IqjkVs6hTG^8FxFvbMpc^4S|wSoh{N0*lCQXDiWJ3d>RIvNhe_#DRkPkirbJxA z_&fq`a8C*=Avm3x=Rj{Oo_G#dE40wgQCo;Gn7XQ=smkSvfsi3okZp;4-Pr!~NJP*O z6WIFxHp+3(rZZNsuNd&dqi8Claw+gg>~VRXzT37HQXgggL00H=;<}#2K{3pwL9I_) z0Ce1uiNr0psh_{rtY^IBaYu@GQ>U}BH>kU0s7xb`t4rd0monN1(U}79dD@yWsND=c zD~{iI@-->zv4o*;V56F1U93DPwWQ7$#`g5^{OoLX$N;VheKQXo@=o0u|L5kkz6Bqh zM$bI_BF5FxsUH7rRhO@o^`j;=RE;~Chysk#S^(Od4j(1NU2o3Q_5ZeZ5~H!3_-RqC zXR(kXx*^UpqPbOEBHPXTG;Osw7(-eSosGLijL1`DgvOT${a~owa13ww;^U62xF%xz zcXavQE>bUMrNU|7v!zu}qZJ$0tt+TrG3WCP_sk4yA`KsT9A%?eO9;%tRIkKn9$Tqz zvE-BL_V4NtrZD|?FZQy7>4TihPgB~4?b{pwy}3tZ{7g)rubGWkaK;kb9Q@DbK&6uz z&yDppw-3&`l8B*!)GJgJrjsY1%iq=9Ko8M6pLndfdE*b8PMiEOQ9k;xR2GhlnX;HT zQ>2v)UppQl9ThZdGv>Pd#bg36QB?`3!o)CN!@h|f9{J#&+X0?g5F7rbEdClx4rR+y z{A*_PgBCsVrZNQHF*uX(j2Afv?W+*+!2#u6L-2vuBd)v{GOu`o`@T{HKl16-t3{wHWsCpd_KPEAx4NEi3T>Uxgpix()wcnJgzVuC6Tv<6_ zzJprm{0ZNcHH40(`dn35 zO$(}^@7bJ)o9uP4DML4*CEeE zgA+DU=Ziu~y7S^gL+c+nsEk%(X#8gDqeli;Y`opTeQ5?T7eaNBUXsgX$6cvYgWX_1 ze1?8l6+so!fO;nP5UU+oBIRD`aY|Hx?1SpH8Vkpq{mI;-x9L0ur(cY<#&NNoF2p^c z+hXXLO6`~w?eaJ$=Pt|yTnk@~dX?YjoB+za!i!6Do1;d~AG8zI&%paPX#1Hp!M6CN z+&e*Rq6o$PJDcTQa@&c}VtM$)XL91Pch84J6b>$SoKGUAfyP!uF74pdyd{7!q7r4O z?O~f51qkizW2Wd6!ztn=Ji@wa7^C?g9{=W!tNDdNXo#_Woa;Rs9XTku|UUoZo)bra!JOn4HS@_`Nye^wh5An!4Zr=3KFF++6AH`fdM);YYB|$ERM0L5seob!^9<65DS4n|29*5+HL8 z`&n@9P%<{Y+|Bx?eF%}fKH?T}tv}!hPz}#;2g7wuuMPb`BD4DeL1GQD<@pz=pWOB7 zea4#tV2BYW3!-4$yp7r!iKz-+W~`9uN8g=lJ+0k{E-jGX(G*n|eXF@Q>%;}j{{&|7 z63m?j`)ARhYH&xo#?3;%`SoPShQ+cPfP2DT@y71{5gEFyv3B3VCBEHjXTmdh?HD|3 z%BtU+H%A%I{D+B!FTRybZRQVn;?EF)-p&T1G-d_@fN*K&R}do1Nz7#jZbS7+gsv%? zMM9rU_i^!5IH}UHP?n^1JKTEM@Zon-QX1eO>BDYuCIrF+pknAu#ad+4H*RTe+=m^N zrS;R(0WzJ8)8~I(s6U`#!(*$KYArOXJu&X)>be%8ZDq6d<;%t_lcuOjv$h1)9e^`j z3r5$-zjh~l3^RO`XP|5CTi59L>3;}E3%)nV@HTtt{_e@TT6k z&uS_SyeI4*th^~jrQq&v#lG^_4|+wr?A^C-3z`bnfr;C#L{+wu!9Wr>Ix6wR?fZuV zn+SZvROlFz|^MM{5Ss=2#BoR19<|U85^_o2G%9HW6g+JKB1lOg%w^Tvr1inqOi_!4K@`*LjigS`|pd{8Yf|8 zi0+yz$w^QZ4_Q#df^C+m_%Vdlr1jWZKoKE|PB0-~hA%!XH-kDA z(SnX%z3>t5bSw_m>(=;yKsO~|i(#s8c6eHa{ET>lLjO#0o3-fN?1j%-HE!`Brn`SC zp0^MSM>}1cvE)UY<*OPtYo>I(W%Z{UdYSz0Rw%#;kOP)JDV6uZg^fR2IZST{9jDL* z7+w)G#DSyNmoHx)PLGQv*sxrsu4q+*hI;z?$3bZY4W+!1O2{L8f-j{S#RX#^@o|+g z){Aj5i`;^P+Azj4P)8*I?^Y}!TtT6kd(<40^-2pKG#I~I zIVdPD=hXE0Mnl#QDRaGMcx25q9Vw+)H=tC2P+z9`M*5*L&*lcMxU)RNX}t_mn$aWi zbMSxXyO7~!b@-W?PIpQxg%B#{e3UPRL<-n^0{O~CY9BCFaZYp>GgBDU5^| zh%EoBj4UG~eIAyU{yd~%KOIW0Ad<(&Zg+tXiU~@Ak-j}iS(HM5Gs^M(k$EwABvX9! z#|KWXTzDTN60%HMFme|Saa3dmIxGHEJ3KgB4;(beH9`MD!A{hgiC3?Voi(eA7}K!< zo;5T+lpg(T^QWQzLo1obPnx|&h%H+{QJ%4 zEX};Xz;DNn(ePgp11q!k#JvM@x;dZPep@9g251ZCa(IQtWURJq*|MBnhon*leo8oA zkqd88oSXm{6wjNvYC~Tll>1T_QSd&nwp5ecGJ08ot#1iqB19r@cxP4$C_NMebD|Hq zPPOw&5YS7vWyhv#)_TO(v{vz+d&fK4)@RzeIG2M5lhgNkpO}|((0>2N=$M!ROZCy_ zeh9Gr8roB=cd6bSFGx;XTQQOR93new;YqnvsWoc`2j|Ct;mX~H4sB0qWlmuHif3!i z)9}>!bLM#0tKUe#bRo0(_SPw{SufiY(7z;;FP1~-k+sFL?iT$U+;A zbg!Tv*(K0ERdv3`9n?+o2ZiOxA)zUiH8Rpa#;+pu@#O@2>uSnz|6iwJ zot`2%2!!zuyV5&9>)5&T%;E>ZGSXr(n>W?AEJo)PBP-pCBg>QVu%aOnD2gncXUuTu zyduZ2pt4lq`1_}m@#oH+>pj?2Ie%*1pX6xUIgyQ!?5Z1YR2H#9I& z;<8+*@+|uDr3GUVY5AD@1+K|w&MNMf?R_vqR0Anj9r+^65DkbBl0d7*yEC z?C)lF7Z@JW0le6M_Y^yAu!jnApR#wtcYG{g?2pLUMXzXiZ9&txp~HrGbhR+pYHC{b zsr$(#_NH+?9`_tKcFW%1zv4Y=TB)c^oZR!|v~zV`&zzocFMZ$E28}$NZR2`?<_TO! z*u4-R-<_#Sevh|#JZwL{O4)|Tm=E4A#a~&UtiOwe);qr^iED)Wz5%H@ISz%L#&vKe z2@}~TCr&mG9=qP;=(Tk}_6Vt6ie2%Z!C)fj#jc1y@0bCMgCk#9DJmgA1&{F11B`?A z!QkybYBDh>(ORJCU2#*LHC26G;q1u%RrOIj2N^L;kE0_93JkopVM!Pi1YPK+u7HE% zbkzHo)9YN=c!{&!`pr?*<(*tE99UoX=deiaI+?6L@O90I9vcC>BG847*htSV_@T+T z=r`pmi=S82ts1ARYkGEePn{tLUc}X66Q)hp=n38cDzhydytA;R zWDn4wiIXRXrvD1bafmKF*8OX=sTYPUS605i?azj_`Y>h%qtAE|>+F4fl`gq z=PZQc_j{cssHei{!w33Qr#iRX=0i4iIxt9oX>UCXBaG!*u^g;RK$?H$nh|0X1%Ts= z)CS<~Zbs<8P%NYjq-8tsAJ?5bbl*zNoJion0}_93=FC=S0gcQV&b3>)3X+j#l2{)I3u%lmRP&JATc zR{)Rw+qaeOG2?Jh+nb;fd~sA;IZ#1yQ=B*O-GK^ySwOG-{YT+`4auMk^Q1DS>359i z9=M4Hg%mrNYrQwLuFfq$&f&AOdP}F6o0+lCv=tyv3X{PD`gvyET1hnh*?cC{H{hmC z!>_EwVtUzY<<7&DAZtI1ng6WSxf%5uHB<5kQ@b&v+g2@_16+E10Lx|S>!z$E#o?#A zjW6#71H%)$xaZ6HM z`UBuK2BpKBrUQ@27nIzn*8sW3TV5sioeT6Lm?4Fg*m+Q^gyfld*of6}MRow9N3rD?Rt!>B^$7)1kR=7Wpv(>!4@o-qO&h5VTuy+J+(+jralgZ38h z!8T;?F#ucZt82d-V8rM6$>IgUR1BG=VxSGBJj?H4W<+k1V<8kj^}cpBJ^S_zp!*bW zErK^5t08*hZ0%;vy0PAmUpkM`u`Jw-YESidfOVkR9#`Ax&;9xHXMRh@Lfv89BZobn z@T^;g)0M?wc=`M7#4DQ9B|mMf>nZt(wo(=<`FlRR%mtf$y6hbVFju{ucnhIiKVu7Y zk;c@)>C@F!Wq0%Xs$IB%PS`tXsAM%QE%P+RFqfMf^K;(L#?}LJJi5TZg{8uSkFO#} zIsF=n<-VAPu(7TYW9M|w^OG=6MRW8pKRNf&BQZ#?{AaS}OVDLHel>PO1N$)CQwGUQ zOiEf|n`*lB%zR5G(b*lVbqP{$sA0t$P)t=QBgI*gSC-Xev`y|SeSKNNKrhtG2;Q+> z?DXKj{X%9)y>(T~Pt;vrI5}s+uTG^8>(k*F872Su?Q~({KJS@V<0f5;4w7~C)IbDT zb!m_A?2>kpoGBYxSzeS>bvITIPPHl|9tYU8y&vxEZ1IyJzA&p1?6=^VQ8${RUBzoq zR7MM~5B85yaBI&a9CA=74xg&1SugLL7=M=)J%BWeQS(naG{lGcMTpG#gY3uft)xhR ziF49;Nc1S;s4T4)jtt+`^GVV$_G(jt+*N~j72M?FrRgJ>s@$Pv=#Se(*o;xlVdYXQ zqyUm9Mym^54K(36e}RZ>-X{Jcu=e_TzXMbSy45$#svWPa)JLW4R6`#w9tzKwvAhR) zSmqMjY@>gaO0v>BG}}M#NtEKJi`m;xpVa7A24yXr?sLegwFh(hfP{dL4{-pWeFsM} zl7cKCUuv}dHAZf4V1;Gfpz0U)(2}teMGr34Dxx^xBkr$RC)zABSLg?|)zh7OZ+IJb zDdVv1(V!cL277?8nz1qN9_=j)W4hrh*q~vPslk*1$iO zfTD?$E$v4SEnD5k@%*uIx%(nBPJv!bT)#lW^+|4SPbPu++xLYr7u^f5rr*PJr%ssz z*{6~n>~yC+%3A`W_v6uk$cszPAbQbZTB&}tCOZ!vx24S0COby}=}th0m`?mk(hoXt zU;>}%*3U4S$;A6QKpcf{-;v|C}P(Fz?J))q?Q1g{0MKv?C zsS6FPmvy-5kfHS&I+>PMxs5jOx%A`)SDh)i^<5dS!RwBU) zG>A!F zDqoJ*q9DK&AH5%cca5%y26%-0h(X{y&@2^I)xs!O=0q2wKD{Qx<6(Pi$yln8M|mG$ zsw{TfQS%4G@@Q{IMQ-6_iey0zUQJGMSGf4@|bc!Xu`LWoLHy2*;kGFc`nG=cy5+= zkou1u{zYUsh{FJbo2Q!GJk1bViunt#bG1N&(BPUf#p4}?ei`gQIuJ8dXcYC8V4L?N z4Iuri!>c$SwYMEk+v4K4#N5X2 z^Q0pUsy;VV{h8CF!4AKAQ>Q9*?+$5A@jYhcN^gsmHxC$Wkt_@xc)>;B?DF!t91DmA zsYE6lRueGWetRXvnHhyF^OI=z>eZ|H8}lak2VD~BIYi&*=df|*J*6$N?I63CP!TmI zBo;^c-$z9#Y+9PYME#h}_@tZD_ygfpUhfZWURLxL9NqLseBv_m6Ljr8X!h@`Y5oV2 zA}i(G4}eqHF)b8R{f05IM_Bim;}HM9-5xSgR^K@LjEx0*nSJn?8f|WV>S=E6B(e-~ z_;I9VTcAY_0{8jAm4jFJ*J~S)CWI!j;o+o@VQNfgr!YcdC3ZaV%b+=fL4;JR)n2@) z(67in*Lc7{pU*FS{&P%z-d?Z!hJ*7z&`;30%O-#%{WkFaa_-xjs#G2+uB=IfbJl0p zwH>0j0_#!V^yM|&b#3tMh>wBOu`0xEX5NjoDcO;+vAaq0-BF#v@C;nsxD==qFH2ci zE`F;~O?`75EN6M0l`>&KRZ&_Ch=#{VA*9i)gtj3ZKoQpqe36uNL3M9rZzM&}hHEI1 zbhmKjFSux!z3nqV9TsZG-Upao&P!98R651qU@$u?*SK+Grc{36Q3iUZDsVM-Vt~SoM+tB{zX#)3kep3N*Ts*ZN-ragZ{+#Q_IV8`!a$&F0@QmJQ%CF-W+7 zGD7nIr=#u!U6Z;;3>VI*wbgDQc=hwP_?p0WPFZ3eEE#Uzz$cdd+PE)htKvFE^F$ghw& z>$g5}P%lPNRPNn=pi+w#V1o@dZw|;ibvh^;cR02H9?<+njT`;C-z_ll+rM{s@;@`k+X zd+MT*_6>=4X%P;d_TMKuy~ATK0B4+9!cgw4I|+`fZqDm+uN z?XnY|Q3}jMLnl$x*!~}}Sw@>E0x7>%CnL=a+uQ;9qvc>F!u+$gi%YEnYp*g<%K7t! zDgIU_N-oS9xmU$eJ|8RNDIzZnQ^p%-$iwilaVO6{EhNoNbtK`t*a76(RebS1AYVvpDJ6D|P1df8o zL0}C$cre3lssYX%PLj=JBIMZLKf=SrB0k8!<{9z3|-0jDwIdkCDw42jIBT z-(~pQq_!pw5;nz_SUt7TSzwjp)MGIA$KktRY;B{t2Vj+&z|r?PPh4C|6{~f}7`EvS zRYS0DKuSp3N!I>WNUS&@saS~!$=xn;>3cg12ESQri+Oz|Q2-<>epR^vDTu1m?+j{9 zd^6BS1lCMg67z9-oa;m%^9dY_Lg)fW1T%m12vdmJ3wB7bwPV!96`L%~i?lhN_kk+f z>B+OusGykGVbHDtYSkb1>#Z1+DBfy%aLy*K^v+rueSlai za6Pr!ZPZHlhwRL8S+5z*rFsn@MT@n5FmyN>_K85Oc674$^1s?tz%p$O@Y{rA1I0ThxGc72X=&CJYfDkmRYQRjh=XZM~x#f(ts#8y_sXh5@6 zzRJvFX``zu|NPn55m9c}Wz8&}0D=hNi}EQTJYwU%C-w9>ca%I0j|9e?r*j8b>BrJX zmQx>}(m8sOn|)QrIyd`0Ef>FZF)-mQ(y#m}H-iSUhrG4?&H%X9Tvl`%L9fpf77}YS5N0YvVyW)PuQR-p}?mLekmj|>BwR<~S3Ii&(+arq>lenVwrG*Y6pW#HJ=cIo8|c{wZka}jfenE_ z5q&PeUCoi5Y1pU1Opv+w-rt>9bDGrGO|}`mcI_~_x$O{lTo^<)oV8P;o`|eB{4!FS zld)ePm3U>>Q#lXtIP-=L`R3=crBQe)wx)|Syx7G*_!db-cB-c~XkA#!MlT`I=Z~Ea5)nvY*_xoQ?EUV;hamd7 zKnnjrz|J5(XAr#d&vRkgQ?`v&+RK!1g>6zEO8d&;Q|;!8x4G0gLJFkhap;5Tg{+?w zHhIe3yKx?oZ%CZuY;E^>#pXg?Lk{l|o}NX#od8i$$7GuSRR#fp5Oenl1ZO)ncm~HW znjZT-oMndK1yT5yQ{S{wD&~3SYhav5+uEl3>eiTQ62FR4HnLdvn3S;a@PS9SaIuS{ zdYyz97DsL7vTWI8f=%LL_0FBGX(LTpy5a}GAEo~xAY;0ly^eY-M$~?JG2kUIKGf*3 zw3+-8XH6wUwx@SN_87FL`Qm@@#nWPJ-Cg>_Q+@WyFM||o&FN3n524H&z*?b_9~3_( zHSn;tpO-o_kf9P5MyyvG_;;}1# zCcmrpw2PMx-prWc+`Hqb)MYemZz^kaw6%R?fX7JCsxY;`S4Hutjrx{j!MwwUdiE$Q zeuzP!j4iQrZrvpy^h-l~ui@z$J5!4(*vC0LhkySQB}QK z6Ix=lsHJwdRzJe@V^)^084))xt$DYeJ=50K;aYcihsFDby%-pBCqY?s@w$Pfss3X7YVv^S3T=A+Z)LdwSl{pC z09jn?(@?pdeC}wn=TIyx{4~~94y2RG`IW>Z6h?78+&P!Ib8oHPxcDDHx?+-Y{;3nR z=i1~{ZB}z|Hn*__&*RBf*S6ito}CFTRa?*GB2M!AftZtks+PDKPM{`AidJ96h(G84 zsSJ<$b@T=&5l(rnHen+|3TQP}4qI8kvf_z`z1IBLOT&njet93L-zQ>k*Gi>9%`2s2 z3D4^I>0%m2=4R%FU-Wldv!7M0K4)yG;!~(IN%LT=V6D$wOGOi3J^%cvX8Q3K;0im zaIUn2#gtBHUAnzqXTuHc7d#MvW57ATYarXN4A!|NxRw~}NgcVs z`UIe|3-R?Y2ZWP|i=b=jNo%%X(Zu}CuzwuEAXdQLB$G23S0jzrOj;Nf5uuFu+Pxar z-=`83)iNbC0C}ezRDBAjObi(h`Pj)#-`{1RabsoWM4R_lR;w*vSv;Pzh`}t)dc*(X z7q)=79+pTf#Mi+OXGw=&L0Ua~HU=CeaCM~(mJxBUqjZ;6oqP3SDHvHemG@i@c^|#S z9Vpby!o@EtCgwxeQ(+m)GH%osU+$x0wnCh@rAV8->9;S6;EC7zK!}lr*4P~v(B3gt za(Qd%&oC0DGb7;i6q;iZu{#W3jK?%)<>OJQ(ZPQnacX04Rm`qB4PV_1MAe+mnKD%- znY6I1#`PyEzfH1|of0$;J_IC0k&gB?%}-d5HKSA?~?I!n&*M7LbIGK|4- z7Rr=sk-V@$I3r82v|>?m=`$fl-(`pU>$%%#9#}b10g=+v)YkvdOTd{ zzq`yp<{%LWO-9sxV0EAGC_VqKjyu7}*Ef$Q7&^OS58Z+xwNiRfd=_o<)NQG9pzV5SACFiO>fSnxH`&2>EBY>vu^MJ8Mr>+c z`!jX7Mec$A$tix&I`f;E1*5x z2AD?Hf8KK=AkKDRyvtrkSOK|=n@?}@yS!9$XR1{=`1N+WtSis_JyL;lAD z$SSL%=7_vxvH}NFhSy^K+k;9=JM5MBTFNq3ZZyZ*fIhjde1l^<=?EZ8L#(jQ?R~PH zK+T)}jDVKm^YMG{`pU{;Q6>=kbFUe21~^A>QG@kLQ1pz3n8wDFxv9|^mOMvZK+!hK znJe7?32rN<{vIBv{O8^<8-qZeB+yzcLkX|IHoj92CW!0Nom;njG*2WvyIsjv3yi5+ zwr`(qt?A4Y7pv|CBfnOZP-9@|(f83{AK2Yzx?7TzP)08o-;1s$wE@PSo^X}k@GY}$ zVEA(6aGa~Qp+dA2`ZaL^$yD)JRLIpi5%&J!6@&t(j+8PH*}59D4@*lv~18NrfVssNX0y z_D|Q?*aiAejK9_szj)q>!cnx*>kf;<7ZF3DtgS@)*q>0>lU71r*xui158t~T44-}T zN#V75q!x{vH+oW@KbgAT=g4>yEbt z!qepJZ^iMe*CZReboRt^QGx!a*xSF2YR}Iyb`&J6dB6_^I+baJlu2dCcaqWG*@|r8DTPQuGnVM zLTIkpzkn|Zd*HxthGT8t)kMyxxe)~t%#Y*`r>ES)RVV z6uE%dz7p-kS~LHm9b3o6Y*erSbRL!%i`g0-+k$Mkx7{(4ks@s=Y%DiW#if^3B#U&j(C#P zt*bLBE4hBIud(f*oSfwQ;ZEUKhqFVi?()0IUX2jv7Zq(J_-k+2u3Nffi7BxP(%yjfD=h8%fLME+ zoax*d3LC+%&okXa9{kqEXaFIHHbnzCV(m8-Hgl-QTNa-pXDh%+!D(rV(S|qCK6Fvv$1=R30#Q8fK<UQ)Yh-B%@*rkQzFAM5@6o|&imJPaboE;wJ7yVTdSW9vv+KzbfT zz~rKGN3(scE*;NJS&D#-0&nku1J!A(nv>9(Y1aqUk|r`d z%GGe>$j$F%Cze*@ZtVyF1%Npwwp$^*u?Ot zSI?yaUonYv8dXR9n(r~@IItoOC9`_Hv`9&)O@kB;R@a6kCeZE z(o=?bBBui+Y-)GR*2cyMH*#?zCTILD)LvcR;_K_1m9r9c>um2tT0*GS%^eN+3|9%IOvv193{=IAmS0AjaB*tti z+TcK0|6ZTOYvLN=hdI75s+XB&8-Yv@Jv>sFn%5pDXFl@F^O>k@L*G z2iBi?qnVmdpP51mpMCSs%~fBTKRpwg@OI!p1GC_cpyMLXEL$)JV?Vn0!(VQv7wt3UZem?`3{!#C^!zfhzE&}QD@ z`b80>E=p!>S^skBINDFj58Wpy7qv^^(!e9E<_(#6CDd}PF&cC%A+VT&7*r`4_8oKd(=$e$+tgFt zj|qn??UDx$Fr%o&l}-K_RVuI5VNx6E9AjgDryUKC8A73tZYdDOB#tS^s3wGS@{DXP zdjLT0SglhrVqvfS+X#lze(<}*`K@Kwu9KIZxp*lo5qeFGg5_J4T`+{^=%Cm&I2+h@76 zja}*!Jk+p5^VWp_q$wmAjXuI2Q>GBYe4PV|1Q!polZu5*y@iv5CatwvmCFl9elY7 z>^E13N4Qzaw#?n&&Pt;Rk>blD=4=4tW1x@eJc!KP!Z8vT_^gejTg;|jnobT2X$wFJ z6xE48a)$?ea;=+4g6QMA!nEuA?Orc`gXW||KK(I{Ij4BM-^**q4Em7NL}x)W8=QFj z8>ZSws3IPfUHkzuRI>?7c+<%?`u{(p5L+f;?}GQS_x)~hs>_Pwo1$(DCJpA?Qd6^` z5^*|(wsh{id0Ut=u&2{;!HERDnDdMyE}gV@9*MCl*G>lA%zI!k$>c}QGRLAMDs#{U z$7UQnoMbULZ6ZXGj~_qE*4(K39Nm6yd4qrgyWj|$%>Q)^D8G8BRW3b2cu5o)u45SXgiUEG`XCt`r%aJvwI;x;^{ zG?a)*`q68vziLZxpwvgX5|-nz*iBO})A(x>ZE+MrW2r<-?AIcSYC+TM`rxxbtcOfC zbYNQ4Zt#-*<0ii&BFQ|*%wQu^vN`ENx@@)V!kpXlw=!#S?&5YNL?|+5=zqSm2vbD) zRR6)amzH!LuVH@#f_K&twc<;z{(G7ie5|dzpZ>nCLnW-G=7@|r8J!JTBA$H{3C2509AuG_+ z(;H11lwG=q4j&G46X`nXNq8k-%InWvr`2r2NEV7(K|uVN;t{97Y*2-YWD+sh&hPnX zW@($HlEI=!jXTb-oZz-{kahzA#cJG)#HgJ~o2(Xpu`8wk@Ib7=WXmL-Xzxcu8|%(w zki88$HJ@O<$<14GMD{Z0BRW2uKX2YxB4X-DMKaLKb9Nv;e)?304?Iq*Wxpfs#k6;x*Kw*Ce`fP5aVjcvQq6CcBo51yUb`tF0ea_y#$ z1Gnv6_%QC$k1tL#HDxV>7TMPI`Z)w^rm$3!tRp9BwcN{qD2QgQHDRTYssB$|ww5;X zlXQtSk$|8nIr=M^2j(!@xRCcZV>}WZ5s>o7S^u9|bk`?Al{8)TyisRBni&i>WfR=EX!u2Xa@IhiimS(bM5f zcLx*C^2D(BO7f~s#>U2A_~x<-Ii~3fQ2lHIbT%Z03S8>l4@RgepecV!IJF;zT ztOY@+!+RFYMPq7L*8gO}{R92SF4;6YW~HFfB1@ur$fn=P1_eZ`+{b-j%;u{Qx9g3@ z*LxCY&v9s%0CWB+=1%FHlyp!xCohYij7km+^EWgmA!HMY;#hDo-8nWT;n{%f-J`Ri zKWJ&F_UC!fNKN>5XxGl2^J073X`tPv4F2zuTStbCeqgV+p_dG9=u0v~Hqp2LeS8xQ z3~sY-j#DR01wt~?AxVC75H^TA7VRvQUfupbXFCjA`OcfaDb9tleD6n#di%%hGTGFq zP2WcQ_j?cj*E=Oe@u_+RTLBfZZqA<}@+P(K(1Fv?RBPM z0HRP_L*use=4o+@gjrGhJ$E*YGehvfV^H%WIO0t4*mWI-tIq?mvU@e3oo@O+)ZdwpDr;^8Jw)o)v{i3~z@Jz^S$^_+T~eak=dvG@ z8-m3%HC?e@Pw(pEb3T!L%`paBVx`4=8< z8Y5C-2FNHyEI3Nms^*p#)~s2h(yraz;Gt`O_kZcK)){xC>kwv6>svnc%Yp14r!nta z`5%qnoK~OxQ~wTY=HZ<9w?{CuTB!;C?Qj>&%RQ(sMl!N@52WcPQI^RYCwBVKwrpTc z%kJ#-W)?QPQ*zkx3IcIOTh%GrBg1hbJT7ZDX`>Ga?PDnOd$seg6wElk=Q8etd8-^rKLnd->hC>*PeH|8IOEzPIP0t{-yi5Sit0 zEM6L6t-_3$Og{2*%pJ_FBF?Br8M!qCMifYX@%kvek;o+}Lzhi+h8$teQAI|J+qG|> zOXP<>l%c!UM$?W?F+z3PimI(JV@vJ0C7`58>8WC4nf2BkaDB63E6ib0H%o)Pta z9ea6PbFin!qn>F*Rp{seHAsJc!sQoK=my65=@3=gwv8%1zs$N<4P7{vSqGx_B*ExZ zfnVHR$H@Bw7(<eDFYOSxE(; zVD6EUXqZl;RWeN~4Ye<^opL50?J%H8Pbz=^w zo$1~opP24#A2&MW-Z!IB4&&ME#>mEDLT}Jr|IwN+M1)JQcZT=XopAtCB-UU83Dc+E z@SZ)JlNZGqATOCOXRS80kq@31iQaF7&5?J&yv{*Rr1s{kFJB%oS}PlgKwcYCc0Ech zku@{2sAdw)&AQ%w`?@fsTUW*a2&FB3wrty0GOUY*gQb8E%+WZdB0iSg;hMYl(2>_~ z*iZmmF|67#^m;O#$M~qC{j(_qYuz}|TF_@I&2D)NL-q)pM@&R91G8+y=#h4sBf+^P zgF!)9e!p&wr^@G+4H$0#2$oqQsOOWOXkW#-uiKBV^y21#mt_?nCo|3EKrK=Bj&{er7TDqhcZEg#wke^29T0 z&kdhe+2EVjr26terUBs1N=-@*Ll4scp_Bq){k;?+!K`?jsTMyLwUfNY_ah=YLni=w zQNJC9fq^%^0Z+BX$W7B>0JLkLQy1yUHa}``?2zdF()>8wMt64(3`!y} zaXosJT`I}v?DfX?=uzYWL|?KWHo3h;*gOq%O6N1U@=aze*S!fz$5}AiKcKog3gsY&~ zPY1*$o9_0(KmTM>S9M8f3qE&)Qd4X+z}=@OU-d_k@#`9raqW;#z2X_Y2^VRDT)mdRS?{Il9n19hm3A1&&aE}H>RqH{(a-hJ^7{ylwxxckOr zMt(hgRv86fBUA|`{_$qWyeU$!@or{p;h@5yK|)^dWVnlsy?yb37(*(yb=Tm{sQ9sF zjM;bd&ISysW^t1&l3X=3j~<=0=w$L$&CrSZo2hV>I*q^IeD>d%w63cy_Ik37qX9LK z|Jkzx#MB2oS^H0eTl?H&c`@_vbIc3m_I9e(c2)2dU>q8d4v}RWq&l6e=9HFxw7#3B5$oamQ%#vnR;exhoO-{ zY}0u=^=kJdrc7jPA7o_qs3;oNgKVo9-!|28+MxvwJW!AC?`&u&oS`!A{`R7em5P)K zaKk49=Vly=@5{rsqT+`|MKUY1_|fy;zB;zc$x-Sp;2>x*khzhdU0cIwuXNqg53<>l z8cz*v?CC9!aT`fFIDjS3%dvxD-l&wj(fxm>b7A1d~m&bvXsVH#)4)|pD8XFVZCJE zQ)lc@km<@^(}*$2KVT-nnNfs`V$nkON=-LgC~D#zI_?KvkQ~` z+%Qs_3*EfT9~PH8>Bveo1VD_+jbOwu^V356UutN3VVk&8aYR)npGOgrn$bvs)4zLs zyd&2$&FYY0;@J3 zX-=lMW`$|QkaIv(9xV*Q8UNI+`K){jHg#OpbmddiFRcvy)7d60g8B{(QI|eziwI)D z-q*v!DTC!&kwNaBufHO)E9nBCh?m<9BM4|hbVBd@p=144$@>uKB<~oYYYEve*>q|vcq+CEN|Om6 zTn~_OQDK@YAcHyKQ%p~B2EP5hV$r;L0YG+h*CV|IH=A|l)*U|c36My%({(Tq^}8^v zQd(=7RK#-1<>+cLp39}8)?7KLiVrCos|X{vJ()Szs+JDEpeaIkCba4^3O;G{DWt9p zt)D2+8U;fx^eM*|uUFZ=mfuNsQd+bT{GpLJ486GAmWo;S3d+|4OL$G2IKMEhk4)B6 zeePZN#a46bg8WHHG`g)_j3uu)oI2v9f$}+8T}VswQDB=>%hvhZQFuBJcU z{dqY!sha=U8Cy{XUTz|R5i>H`Xdr&w(_L*!0=U=&Cl!W|_zi^PrBM^-INrN@0XeN8 z(S+2S@GV_%ws&S<=sX`yl zJ|nNFlN9^1mmZx!%7XFnBiQ3dX_-YIL3X+(#k7MmRkK*6@6R#?+!R4P;bMKe)-1L` zZ|HdHC^BMY8kc!zx-~UZVsRFw`piX7Pc{HLz6tITp_&C$>A!88Rm_%kn^lD7lvN0X z1K@pWbHuIRxJ;5zO1_glwHTkBHF2V3lU|DdX#6gX*FW|@`3K*8c6+<03zKE84_&uo zp9MB3yWj(aMni%ky}gLU&_3g(tdIuuBYBP3D_2*{mc6Ys<#7_{T3o$BV*84Cp@|@#eJHcp`F2c$^{w{& zJ)Qqc7OlItQt;=`sr9%{cuRMT6BD`SEnBv9PkXokD{CB2I)mbM7-iutiR-O;0=dBvf`<~k7urbO%E+bpMYca>({Rx z>lTe8;2u-{83hGxAi(OLT%xB{aYo-Kz`N_yK zYn=?+u1`7&Z`70;FKzYDW8+5+IgYQ1v^2aRc=@`VskZ2Il@XJ}8pt?Qp`PiF70b{c zp{vL&oR6-QKiQK~zBgxiQnO8lf7k@uhl3*5h8JOhq#@19@m;g3^4B17Uw{4-J3M1u z2ijE`1K~zaI^?w&TaS@rTC25fJ5I1}W^K$!*5?<9um|t0_{2o7sIlyr)}yD>C8p@n zTF$((IpZ%CX(%4MKX46SMxB-k{aRIrIXd-FE}*3t zW`?a?ueAb|MJMWsoMlavm34SWJD!NwM!NO+FxHVv5t(cg=bxEA-FW~ak)ZT(K84so z>Xb$H_@t$xqFuI5|1R(MTDAJ*DQGVWaYezy;A9O&!7{@i>3Lv>L1gmA%&sJ4lTH}m zZTxKw%v`M#$#^rcucztjhaaJn6dk{@744}7G7G2U=P16sqHHvyu{2>UPn#5?bL(ko zD#La6_bwcH=MtFEL*m<` zQeT9}NW=>hy3>vvLK>Lz=1?j>EMyT5laKGW0Cu^3H$OkD!e_z4g_gY0w48E`Tyj=z z<&cBj7l>^c=>pzCd$S64*;p9$>>!=B?ZnE)Ail1-2dHd`un>H;cD@Y?57 zh`>(kw}(N}p$7#?-%BQo;aD+!2BR8wMK2xNM4{t#0(lUFuNp^t-KDJUuImdr+5bL1 zO`d&GVRRx@mnMus03wqTzt|Jd<;5xcr@C5Of*|)1`06r5(`{liL}043XHKx2!|pn5 z>-&2A{TKc3TptHMH=4dTxpc8T(tU926|K0a(joe#(rk)Fnp3#%{1l;{2&61+8f|DX=ZkP$>@>^Z1{uYq$ZCT z;?ox)gf{g(zIm)Y>irqS(4pt(0et;er0KhY@-T#mbo>}1LxH=7uOB9RWhg1UqBNZD z4RWWsy@sGYw^pdkxwKqNlknu?ieB8lx}>RT7rYzuP73G#`fc|);RI;^YuEsUK_mLD z{?&^5@a^DM3WQrt&PVBsDg&0Fhr zG9gJ=N_AoSQtjo>2C{vP+S-NJA2HBF$Cxo}CCNtoV$&b}pMoc=b=__P11jV&fhYqf zVse)-Fv(W;+8hx+S{;Nt1BAoz^Wot84A_c%2G!OB7AI-1j?ASL@3+rZ%oLc^dAs`G z$dURQMI2|D^k51E8~!#51!`Q`Jj*{0Sa6YL-**oT|9dX(&J_ZROx`QCXwm58;G^UV ziF;l4 zjOI59!@rIt9zMDG(WLlZ#|svc;Kh4d>@7VX_QjeUV^jNo7i{Ww9uPyyLyW{l{f=AI z9US!pvZIZ_JMZJP@a6bSX7EnMQfpP`w5FCA95A1+iba8#dOms5O4O?K$+Dnb1PNzG zt(@^r<9Eq35h>JE`LHjDE?cEltL$c_L9{x1`g+wH&N#Rf=ybCu7{X$b&ok;3zfSBX zy8QsPt%b`?c=V|&%UlEylk&7z)7i)O4&Yr(`m&u6=z`EdBp}I)eITeYR!uxPs%z`E zZDrS9-_Q9Y!?qKH`+j^?(^FPYADjNhe~#I>aZPw?g}oIA@i|JVXl{_yn{OIG;pmy+ zS5A2qJ;Y~c+hg8z-S#OzUFZY<8~StwS~ASO_-`>)kq~!cRT&2B?kPJ#h4=KF9t^~f4yR<0;pFaGu8?IZ_dGyw=kD{i4U==a zlvP+#`9N?he5vQTLB0JhQ*#vY$VHr0I)5yQS!&SQ2FXhP2XKF~`U`rF;EESLn?VU@ z5c4CdX*k$*6`tSlY5FrNIHv=u5Bu`$&@QE4HC|pzll-Y}xQ++2ciD$69|)KN`LT0G z_FZVN_P)+y5Hl(1F|Hha)naF*jw?ka_Le z)BivgN0(OYBpwlXl!gyapSI+yU3@n>Zs0cAwy^hF589zo;=MFyj>D_HKcqtJf%7AY zNcg>fUtGRp)$)!sNxVt-ffK-W&hFmZwvvR=3gQ~Xh3J(qZFDhEsuH~PyezsU*&#it z>C>)9r=DFT3kuj09sRL?Uxmo(Y0IPXo6G^ub3E^bSg@-!Yy6029f!4J zU0IQTH_bV7N?cadol27+W_H2Y&o&l0B%@^NZgeRe!sgZQdeH7q&?@4g1t*GkAaIWt*`kOH9Y@^fiOb*<7YX z3xc|#j)Id*ooeuPb$oZRegSX^CU{~^e3l(UgY}QAj>zs%#(KC-bXTufO+>R$ z&#j=0Mj?i`Y5K$H3zw)jd$&D@#zrKi&9<4!Xh>(8Ex|n}{VqsK;V?>s_o*3d7ba^Q zMRNf=I}7R+pO@A9PxYZW)`5J#9~sW^!<7e7<$==vRrc?1IjM;$u7n(+kAYXkl;m-9 zJ0EIV(TVku)z?E;*}EiYB(1?ZO$q^_pxl$PIV(*H%XSm~v~5Sp?5aq{rQ(lrVN6C{ zk+K-|cj4U4%r|p-cF`TFFxbI*_B1P{Tkhuwf;zo=-5;|5{4N6P4&gh zbUSI0at_-fBQRqk*Xy}>{xK7^_aiGDdX}x|aZiw5hW*1o4uD2fYuPgVBdZ;6Rfp*( z+2ZUJE@j{|*o`hP-29%WeR)%!=5WN;qUhUE>JcPB*0GC01ApG%k%+5XU&N#*8H3l+ zP(Hr^^$$8Dfipsmv(QYomnH>PGM|Ykw4evHtZT68xZ&Bf2+)k&U zvzm?LLCVY52<1}-;KJ60a@X}t=#5E)uD&R`%8^Sv`o`8Ao0H2*@3psO_te{OX|?0F zemsEDVqHj9)xA=W0S86}y(3CjVawRpljn$IjRR01fT z{oYQ=1t0jVx-Z;J4DA*>OcDb&v5$PetV>JZc`O^(=sNvsK0!YY>oZ`09-z57gfK$#b;gNX@+7`hwZ6THJfnk8%u^&)H@Pp$g?avl!_1UqQC+io zPxE#Zr`+o5MoKi36X&eB3cOYxt+S2I7T-{~KAKngCHTVI`92O2%OV9S9z1xkl$*So zJ6`txkR?+QL=m_YSII2$_X&*-|F_IR9KxCHYlKduXh_{Cms)v;O zO57#PdWSupad%Fx6s{nXb6+wmD{r^|LUNdFD8meC{b0*M?@R@=!E$ul z)Ae6pZD94o^_9r&#M*(exmYP7zFi^PyOO%lQ#4etTcss}&EKErpQS)RLsN%pgGFnD zKmOT$ztr_^M4zwUzt=yReu`(h@8kR~!G=xH@UBWb#_Fc!$td@x8RRP+It!3@WLY>82L9C*bXsEtTyI~dykklpr$j;lzz$v2VZ7@jn?YCb-d5O0&2u%!A zYRvhN->=`h*Bm-b;fq|rnF?^?#E0t^qA_Gik!2{24N)>b(Ey*^?);WO_tv1gSR|Y{CUSJT%81{i~v! zrY@iJ1$syYoD3V?>EhWPeBjopJx zmXd@4lx=#}>=Tc4@hO!x31ZZsj=ihTqqWLnIC5&Db1g4E`b9SMi1j2gFY7Ppi;!LPEr|ar!(dZ?KUK?I8iOtgax&& z#3>Ih=PC}Qy=7NcB$6zV05g0W9E5U0iMmQWC*k4+ikh$`0K{Dm!|!OL%Tkl23z_j#1TBw3>dXBgHh*UVuN zFH^J=Z}07k`dAPn6e~@}-fBKchRmQ=?Bl@@?^uE4jLkj8ZNqLY6e6id2^Ue#Aj2!( zikSUi)vnQ@Lvub&Vfy+5K{*G8cVtVjl&liO4jnplV!OdHyuV*@g1iqkMyhCFLN^Ky zBMvjj`1NK)<7lx#!D0qe2%uDUcL#Z$;ef@G-tJoc6s10|A!UHcXMpBrW=b@iZKw#XQa7hCl3sjae4ZnRkQn=d9qC5URw^dkIM6fF%3taTojlWW= zHRA+HpoGIL?B5yA7Kl7@i;pSt|>6xkLUM83R+ z4>V}OoHIRorP=MQt3PqVP-W53Vy1N7S^Lix-O{3&k7ynuN(1b`Q_DYBjJKJS0~I^& z&^cEQNZy+e!zgLlPzicw_$+*Ia6{(&q$;xfRg|_eS4YRCt9&B;8?*^kpSYgV6lHT2 zn9|uM(f!4X4x&IfbEcx>>cor4PI>H1Z8TB{H^9q?Z=Ynim*eS*wZp)5RRcxUZ}o=w zoZ|AA`eGY#BK1lhYyLp^n6>UXjg7xl4f8z3&OG<>>J^VllSpo`4`E-jCOQcq7L;qj z5cU`=tFYfbdw^y5lMgQWcohVNfpSggu61X&lbV7|bZ^CtbD&0XsDcGU+P1BM0(Xc_ zH{X;@J$`Efuju#BFClb2r{>1r!m$cs${)!_9ro5l8>DXD$60~!S;}~ryk}55c0qrf zfG4ULmMabt97$t`9vAw?KR5THTy9q>rK}$+mdB45mZdJ5`i%X za_DNx5-x&}QnZNYfvn63Tg?chST0i6SEY7VI1I=wFbwOQSi52NZB>6`UUe3i4cK*~ zens0#)*yj{3(*uFKKV-C6lS+RJv$d-R8H~Of+=`k>SQ{S2efCvU;|#>tm6yPA%>gz zO)e4A)8G$dW;~fQf)0QZp9x}@x7VlPO~4?Ae_Y&~j_L2ZMLu{i5y_EP2G8>bRu5^; zrlTyxo55WvyT|aljc5<0FpviIlTT=~$<8bA^W`_>j<=XQP6~1_0$O6EL@Te%4 zXU&?0ef;v0LBD^kpi2`l?35map5cFv2G7p9BXXv>4(f zvn3}cYB;#Vn~Dv4+dYvY;^t=*EYuB#Ear2?W4^7>Yv%)!3Q^cW_ z@6I@vc(Q~YvmRH{gTWjSj*&z@+1|)?eMK?ph#?~A`R|)QXEnzpX;H!H#&i&y88<-L zs!F>Ea~}un#`3rp#JKYT4rAET9<%ZBBov=h)Vc6411vt+;bBYO(~HL%l>LC2={ z1eF*j@}sOl?AGA{opjM0%Sp8p_O1bdFQ;+9!V~@0dwd<`^>tk09nv}>@tm3g2Ld& zg~JzcBO?_9NA_kSYY?wI0H3VVr+0i9dKYma2)6I1?HkddXP?P4b@Dk$|OKWw=2u)wgvl&N7CUcH(nwWd(SCzqs@o_n!o2AS=XAu$Ora9@BdiDEo*&%Ex? z6Z9dnJt-oBUqWSH51Cr`8JAj-qwjvJ`)P$tfH5`^u@+E=+tus7%>)aa-V|^Y6q0+4 z$}J1%!To4_`u;(#11?LpF-o59;|0Mrw|%o?e2%au%{+OJk5l-x?t~adeO~z==?h$O+T6N^0o*yuM@-P1P9Bg7i^t?jDZKvD15Ks+B0KT&Jj@st zb3f?Ug#2yr`-&DQ53}b2VbXMHukKOK9T>Ct=x0bfSbv!i!1}L_u~nEV13~D_wLt@v z`4R4I6aXkKaBq}A6toXlcpCeLv?cUms=&4&-y@)dmMz+jP75qSkk0XoxbN)Wn7lVV zbm@;zPV`MI3%rH-h&WJFFA)QaIv&?$@@*|^6qvv$_Kz<@BFQb~&gf}to4)NAwA&cu zszHb6vllJeD&$axpBjQ3K8YMTHekI*FmuhlvLi{ zDjhowK2jsa0|r?6s@I-8iI6oA^{JCDkS@e7)9LNV0^Vc8u3Zz?gzFsCU%)3ar$dq0 z#z_OrK1e^le$8jH8po)|V^NS2lW3~%w~WtV3VqM?_*M00LW5B~3RA^&QO&^kx}ECd zRuTGcCluJZnKnaOH_qzZbV4>1k>NjWF0c3G+R5n>319VZBjX;LRNdk^ z;FQWEcfn0C#nGvvrh2uw>$Poo^6}PfK|!zm=hXf`GcwZiuun&rmF8^Nk+Qr;XoU}O zlBn?ABMdu>)>G%>i}xQthDRA3GI+n5X-=^gq)&B00bb~R3_;rleh+i=ePn#gne*Nt zGS&d3UqC#Tsq9$WT$UR`<9kJEJ*5#zg|Z+gx1wPaWgZQxEX85DFe6S0f6DzzT$e54g#|9tYvP8z zv4=M{A&Jusr8ysY0%uN@d9RsWUkLt5#j0Ow4M1d6urimX4@7aZHPF`-v#O}B0O&s+#VtHP7-Od1IQy1-CcsVfk5Ki%1Zs2Ss8JB}O z=j6X$Ttoq***SD(+T93?u%YCj4J?&XljSp$kG#0rqG{7iu+W2Xahs56mOlGqA}|cI zG3)z%ROOqAAvd>h_J#?8vZ9Z|F!fP?@?INcS&pBBKf(x0nxZqQ)oopPLQo^uzJBv2 zBa^9M2(_7pLoEU55MR<}h1iD#2EOtSWmhc7o_m@j|BhGtZI8%XkKUbonNO*EwR5A{ zBeYery{9~FCxf`mevo}oVS0O8suHI6WLqf#$3D`xcFKh}o)Tgbe0v+!BhW#uMeQK( z!&i;_ajj(WEaSlxp|VOv;A9SN#m!yg&6HpqM9hSg6ybtIJ$5goB`3qMH90@lw@H%Ga&!2k+VI37q^J z)X1RCfJNDhXC#0~Sm}MdCgb$nbWy>Vf37sO(R@m?;W*A~j2-e6j#DNFglo8wip(p+ zHjg8r+^1PQ`gfxHSMWu8iAJE^AQhalI0`h=A7^R+611^A0M?L+2AQ|H@>sm7d-v`= z>z?Mh#n1fdewRks*zcvv@!Q3KKWa>P+Yuis##9}@e6e{*(W;jX*Ns+EHTya%>-j## zSdRdmEaj}{TQvW~T0DDL^zX#ej$=2j{`yK~Nd0DQwB0Y3R=)}V6lKzH>;TK+nrV-x zO@3=~|E~L_dG~pyne$fBq@BP>y7=y1JNJYxnO7X@{+Se1v~_K=!87A-uL1%BB=omp zTvs;#a=mBsD6Bvpd&cwlvf&ed`gM-|vf!-~5*Sl8y4_(Tl z=NIx%aG}=89$Vnz;7gf@9)FB$ANKS9@V_!_<~eXIlW7gO_u(}1{1;Hxh~_u%P&cvj zNe0=0_mdND4q7(eg_n3ZH?A=7;YEzuL^?#jmA$uLSK9hxgSK=T#ElZ~ z583=l;q;0dV*LAV|KY=jSC!rDSo!(f%cgx8IA&&fh|{`EyW3^hC3EdG=_t*pjY{Tj zqPCZyj(Wa#=DMn~(eEl&?KX6fzAw0}dpsvq+tJhF{-ycBV=N%{@CEuy&t^eE*IU!EFo@A5m={*eA z&U(49P%PyLJsC(Q z#2m*>}Y zpv%Gx+PYZ)Ucr|tCAy!s)AOgQ1~lbph^c=;^9bTzEVe(M19N2@w_-}n?zl0bI&dxf z+gW=HHhKB-<#u|pOJw0a1+{Fq;4J!5PwQaF^$zx3c5nmTUA=Kb?}qhr;%*!%Jv+*{ z7pcpS6L#Cc5IAckFu#nKFgv7wZxw@B=A0vGB{U3d>r+;zZXXc;kJa(VuGGR(#=r{h z=r*~hNtP-94DXkuem~d!e&1CFU~^~u9A-_hjrg#|ObzP1iE}wYkkf z(+%dohK@JLiz>RbAZb3}+$)H!tP_`XH~{2yRhFHLvqsY>4?t7R208I@kG$gWxu< z@#--r@e~m=WVqYu^P%2@+KaIuAgK$-k6tF}!y-RrO~YCIK@n@5WTfHau=IE?mn(;j z5s`kGhLewNr6-l~%;3UzTuxfAQO)bA=FP%Wd{pzU7rFK3gKt+OCC;@DnDBB2Lku>l zE*2)y@0h~ygDAS=tYhhlr+ck5o9RAYJ(}No%*CY)d~he)q#s(Kjfj*xBNh@T6w*=r zlL?2!*#e+lCOCI=8W~%CuLU$73t4;vH{B(@zvfo3mg#(SFms+Uw(*wwHnH`^+328Y z9U8ULs2ThHc3P7^u!ca$;eItg-{{fD%{`}{ZAy>RFC{7}>J1-m)IJMYak;zOlI9Dk!gr6`=ti1t`$dV;*>+^kENVtLezSQy{$ZUX97d^{-GCj8mZ3fgd<5yKE+KjDaGSvL5-qGlO`E_N~rjzo$CLmjB5gc zYHi&>=h#pC!xKAE6gFZEYV(mJ2GXAJQf?hdIElyXh=S#Z24u0Ewq|ye?=WS=pH_BSwBf30}4GZfvbAOy+kbW*fy9jy%qqSXy zhi(-Xwj+U!zOv?5v7UC3Zy6RH`h2ggdH&!8Sr@%zckkheF=o*TfqCz}IVvW|>Vp|i zy#`N!US|APr$@Uh1$QJWi6K-an3?O)y!X5?P{u~mF@Pg?=fF@=f-G`~>+t6E_2<(*r_S!4Qlc<%P8edpZX42O98b^WrhUwzM=JJ&8jVvjN^7!}eG>8rU zPdNq9TC$m*&LYTjM^IqDcx&={yd4z3mJ!~066vYGSS{5Fq&S==X{B98gAuTA4Y&E)W(JJcSrprt3w}3v#DTTM5EG~vzFJ-ut)!6F|yjWJS8PXh735#4Jo}rG#bzn87(m$WYglWp9;WSP~MM|)DEw(M)Vx` z0!01Qt5@0q+kVg}dw+an)x2vY)wT zAVVq3n=o92z@Q&A-)CHcb0kA7eSMvd%mSFHH|2P~b~Kfx9GQ9dqOb8RLXF%eS*$*! z*=^D+-mr?9tjHz_KOWM}V0}$h_JQHU`Sg4oU&3Mj;b9%lU+mH6idWFXCftpoKaQ%Y z+DzHK=l3M1s}t&ypG7+>B1+wHd!%ZExZ9Ceq#NIHHn4juG%=wWL4Z@9jJ+Lbr>CQ1 zd1kYU+;d4dRM~8JzTtLZtmQP>w7~Dv4KQj(Zw??DmVup1){^vUe^B8VqOxZ{6`K?9 z5Dp;I>TaC15E?#mQ{B_-2fxPp0U@csf6oLO>CFWp$5~q&MOr70q!U@WuUz98mKXZd z(oT@Ga7P$>^8K%%K- zx3$ULUv=Gps_r1npjhp3PQMaFyB4%IfT6gC^Iq}N6rO|H$M462#PLeka`%o5#!ED| z@bu|cG~w)PjeLS8nJ0u!^*xIy3iwP%Vz1E13i6=ryErKnC2th*K9m?aMvuF~Y)?=PVbI2kdEg8Y_$4v*&4*WQW$HSl%Ts@YcVS+4{DJly2|o zv4zG*_i6n2z=x5C{+-¨G_?Spt#i{P~AtkK(5;EG!W`a=zV9byZcHhyOb}ePMWu zZ-+I(Crh5?g9NL#CVnV)#$@H^Ym!OKQK86~t%jlf80!rxb){^fml6&co)a0k3M%8q zgEmDz42Lt5#az6G&Xm;$%nc5uulc3M=_Swf`}(`W?fg^Or^SczMW}Wg$2em?NxT8q ze+0kf>zk0_E(|;oBEswf$LuUzo19)%-URX2Y{wN#mm(o-WLvTOBH#SI&6JN*xBWdb z;Lv-Tss|q{q^|+c>ug+4K_=oRG-CqI!ktGR>wOz)RDpOTga>&i$27CzPFFgmYnvL0 z?T3g_*8M7JDHVpa0C_?Er{mei=>E2(i9GzzO z7wW1uk%@WlMR3e;Bsa`p>^*Hg%Pl)EE@AnAA0c%F*oT->GAP<7cYA11V4(i5Lualy zXnj?G$_+c1_kI@Y6=;FBMH~cjwVbzF8v_huP~+Gx8Yf>`Y!6cD7XdHSksWPhR3Un! zAn+ZBcR+~BQ0s6xz@QdpG-smV0}4XYSdtT{f%lJm10je4I<6b@-7PD;$5buRh*<9F zz97(Oae;<(sub-;qle2&u>eI3U>={X3c-Ywh1M@yw`zsByM<_;lIIuH`kWSjo< zUs`LENeZ$IR-mgakM4*U;+ro>T@u!y%KUrTo7#1p;MBsQQL8jvOeRcQ`ns+ZgA~_S zpFf|T+C%=#OgOt6OzVX9nmJ4W-hcklD0kQ{8>%|4uaeP33)<6MM)o9)(_c#7mqpJ* z)>KYRZ5H|ogjXzt`p(Yw1v$vhAyWHMdN3f-!??A$1j|lS6`M;l=|0z0S4=iRMXztg zZ2NUu2QgIna^;V;`zQo{;@t~e5yvZ*2fME3*SsnWZ6HuiMO*LgxhDBaKGZGE(TL`9 zn+!v>{z&36C)`Ut6}>mki{~+O4|Wfl_KDJu`Vc zgsnN^nvJv~cnDXYSkRg3xwlbu`p7hvzZ~QWONN*AsT_oEXFKgg4JA&Z*&spGJ+lJ; zUChVNpR%sU&b6 zRLH_YG28{mQfRYYO@H#Sc8Se($piJ}cA@KI+RL9#M!UL zKjrk{*ITt?ztb!5K{YxqII|=yT}ka0U$+b^8SSF1a%2#)v6$i^)Q*=E*fiznQJX7k ze9)-Wldle)ZbMrbH`sj>Wf^}+gp@biYs86AkN)Sd{Sh_bhx$~F`K_&xQv@&Ly9QsR z;eE}e(6>uyDuWsr-%u>IE`p8X?S9j!9mdeB=4*UzbfuDm=!exw6!qDTuqJ-^rzrJO$yR&JvR#aD2{=z$(}$za>^mhY|+ zt&5q`?7I=FR3Ia$_ytXniyEi~kJJ?4c@%AmGkafoyseE&&hdD090U^TV*G!896c1d zjSLnTQSWhMMguu`zzLn-%a6*|XVy_BYiWdRQXKo7-#bR!0xCx1 zJl4~nv399hV1(xZ{#;Q{%8nN=UO*U+pnBZ;uhJ!IMhJ)Ah@HXb@8p{4B_XyUgHuc@p@g=(+)MQ)Y{KO&An&g^}I z&*f(Q@%2^6m>jOG&Sm>+e@;;R_bU!>)>)`_!KYwbo zN?j2_!f%PwFs=^u^z`(|ys{t{fK8C=C8KJ8);}PsDyX3N`B^243GqqUET`j$Y#wVR z)vA2Zcs1zZtHksTq!5`uW0F{=j7VCWcuH?zGRQUI#_|VaHQrGsA@m%9aEVXYSRtd^ zBFKU8HrXeSB~VSCd6R*hpv{t2zvgYFLhMocFKz=dtb3ic4~-tkuFMe-is!k7_IO_$0TcrfQgFEIL)EA=|q@%DXg#w(zg7SX{ z_vn03_Iy;gVg;s5pO}_xNN3Dp zROXLPd$E}x8>s*EzpwUCUF)lal>e{4Y!!AU6#4(hU$;UUtdVE@|M@Fc!}tIFN41aR z|9ukw_o?{*_a_m&hZsnBD?YIi_bW2YCbTAbc|z!Yyuf`5r!E~t1!A4g9HVLo5>;# zrqE|+?+}Y+sZ4`g_S#NG7iS)%mL1kDoZ@-D)Sd`pYyA@d-WBpU!R;Wcs9Z2(-1a+oHWfm7z(+2Cu*WHc72>WQHIJ|3M_DXH+@J7Y{6JuuO&NU7X#1; z(+P$rmUrh(Y%bGN17D3`u;PSgiDfNZ(urI4P*2`y7e28%5OXXi;rh#$GnG1J^5L>* zo-Ja`{OT)mN_dIo$J79$w*a3iD`FA-ux8lYdaNzzh$_EJg9=oILNMvC$(1ep_U%LV zkqTH520XcG%_;M;vjE%9Nadj+^w1YK^S}csw8zu|`EDL?f5D#(mJRYO4qUo)>BJ%D zz~IC4^c!OaVm|x+{^=Djg53>3GT7y?_fnMkH$)9(cY37<09Zn`BYY?7kQ3d8 z*kB22i$$t=g`+}+o43n&+_IX=H!avnwrl>(d5TQ3ZAs3%w$IW$;^<4ay)APsK8ZBI z=aj~s$B!pdzFK36y@f-5J7+9H_rbBCm)Bpsm_ZqA;SOM^^DxukJLxgoG%?Q^;761e zf^mZoU4zmL9C-1oUlrdMpEQ4v8chi0AiMd zz)Td9j3KMhkXSw1E0}pBCbFag6$ThCszgI_jM4en36v%8cO5uzfO0Bcpb;IK& zkQOWH-qkU|{l3OA4HyMX+LD@EgF4>R>m)M5N!2eE<}8vi2P=y{hV@b}2?wLLw(0~a zmr~G3Az}XY+qZg4EH%2Z0zrW43^#)dd)uS5Nm`k+?9&q)>lpi2XeeUQOC{akak$C- zs}rVx&lwMSL;bk~gsh>gve;whH;zgR6DJ7<4(}9yRaPu0349!!x?w zh~BXN=fBfK`?!wET0Xq$>!#?01c)j0+w#TzmZkP+rcM9ZmB=< zpl_$H|II3VGx0}$ zKxaEYah{bSS21j)X{P;Ok5Ch@xtJ`r0iCy7=Azt5Fh+sJ^78C*N0sG~4*)5qG*4`8 zrj#=M;-eEiTQm(ahfF)flfI=xdT!f!J+FG5OzU@(~pq-}O4J_3cEjgHi*`m+A- zri&LZwzIB~t4&~W0ojj0M#s@9*6`!K$8hyLTLA`yj|{p8Bu9D*&oDQHW!_qGrrkbt zV%Nb~DRvxTFt&z=1_r+zVfpey<)HKY)^W{k40jalHwHRnd66oHw}PjQ+TP9}vCBom zhBLoSv^q#q{1E^XSNKa&+pDseT3>EHZ%z8P9T-BH=w>-FZ%)js$63YWbA-FKZ9+oO z>dM_fhH^?!vhIjtU#El((z(5R>_Ay0D%=?g(enm5D=WXoy#BO0)77+bdJ?nuwizbC5b<5zTETNRr4L_+k2%`n7cJ$$@WzGCxQqEnAHD?3iaxubDh&d#m zdxrJcP*5B3FH_Vu#hi#c21kN9;WD@d0G@5dJmDzl4uPJ|2W=H1Kj)h2f*j6Fu}XZu z)alndpO?=9*E;TplkLt7aKYMX5_DVc!8UvQ&Jlw^i|$98xif6``_X0h5&1OIG`?+Ypa~<@1|vgbc4y+GpK05tzYd(9OET>&O_upciX!NUS!smu*t)Bu5-XP5`tFTt2_r< z$xbJ*Ih}xQwrNY9vsNvP+8#mw89x<8B-`%m|C{`A=vX@A& z5hOiktoK3=1BgI9#djV`zNV^xzfh?46r_gmPj>ISHh>`&mqiLvPjzt{BiP<@4!(vq z$%7KnBwBAM@Nsk1wf)e)T_w|(ER7VLJwtIaZRhZ5tyOqK78cgKQI3_{b=B$ z0wsMJ#JGV%Rs|9*bpLx;H~xEA-a21NKZ7nrcJL^+O3yM{8jnQl@l&OK{cAF2MQiJo2CHn_2=Kuw#%eX&x z+cY!Yjp)@m@lY%LLwQ<1Cz zM`atlFMt*5&DLI%==mHp0YV7GZjD!)35D~;fhD_5pP@6p#8 zUP^^fm%^7R^$tjZJqwJ#AwraH2{;FC!))i!=7jAn-@a)?0S-^Qv{DrYbs&xdvG<3m zgIJ3k3hQ?Hw+RP3t6BhwZzLTd?v8x-x1LT-2q5nrXT)9^i-)u0$$fh+9J2H@8LqN{ zRQkdNN34tcWT0qkcGJ6-y(-FrLEz$fwhA1$=aTpPov#Pr!=?`xdHi@Uy1vcw;yCwX z%h!$XPWgr>XyofNn$K7G_5tKQ!N<;61rw+7xlEJdj5j62D$>4C9PON+?nYFZSGgK3 z;8G6{o6|yk43e%xfBJb2wqlkeMgrXuTg8Kt1y?In=)(q_UcGW4FT-TGff?V`WKwj`b&MTIP8|GBL%4B~N-0>~4&ZwPSTGW~DOMg19<(u5C>{Y*g`Yv!jM{LI7KTLb>YruY^gj#khYAlFaG zl@A{Ev>CrMrwifmdPUD%5sI!NlOZ~D$|rMr=#se%ni`M-^@v^v(-t!i%VMo_^Z$mx z(Tk~UZQ+KH^2wuuf+-MwGni-@`=a|(il+$`X~>OdSdUZVg}R^~%e`WZU@&D>du%9e zUTjN%B9zer@v(7Uy!dE=u_BaAD!_mT__5D7jX6k3{QnF=&x9YHW_QPlWf5TpcB8C= z@+nI)nL)51YzXxD!G}H1>dQX-qYB-(_1m8(G?*w=M*)yqnGV|j6?auW(B#6o;E9jlGuuF$sv{qt;fRb5n zNn|l+GE+KNPM`hH9z0tYD#Rjwg_%;!?`R3kmoCm9y1r%_IeW55D-S{-FKO z1t@BRqnUCD2FVe!+Tj?r9K}EgxOMR2t(yE2hN|>X{^>&?IQ%(x_N*3|g9?*EJB+vO z;`m8_qQuL{Uo7B*aLSnO2GWvE&cEXRe2~wINN7-fVs~fH;_OZ$MYMQ^Orvx8+nnSl zU-;;*YYOT7iO8)wL9`yZFhOAsxFME3GQU}3-4ie370Svni1z5uGVfZPl!4&lQ;MGG9tT~o| zkW^hyX0Ttufy)&D*{HQIWM1MLn*16wd2zw-9aJvwdge+!+^OgX*i zKZ-Cq`BN#Jo~LCrMVKv`+>Ed7)hbqtz|Vz>t%!pmvEPOIsr>CI%uDRr4L4f!WTG`_ zM67r4f7yA|zfb5>1EO7azf+d^c^4ckl63Yy+DW-4cGo_SJv@nNS;H=Rzt>6ZGU(S| zQ#FmRD?S&*UudR~c02SZwT0wq5qdlHREY7o#kxa;&p;Al5NvmFw24>J*?QV=ekD1v zXUN>4NX9kV(IDq3-PfHq@HX{#*yNp58g_ljOJw32mx;&lgZ0v zW_JQRVoWvkCz_^)9Bxo0=YeC=t;YChJU;|mRC1<8keaUj`Epx?vad@^6Q2w?zxGbu znqKKuu@^o+*~5{!ebMF@BLIHzYtB*f$x(5L_fsSl!R_h(q!o42iB>N?w9D z)M^op*Y%~@N&v}Ivz5^s4Z`w(rrVS361U5h!RX^MTMRT22&qzHPyCclWeXc>`XbEC z(J_K0^e04mn{>5<)7A8)uQ$FmHC4z6etFMk$iXZy*=u?pMn(g9tU6?m3xg2Bk2Mv} z?(RM1{&CN`fL3%{_qTdQMmcTR?TeFFetWy^_24H!IQAIufU??);_g($Ozdl9`rF5N ztj>@j(};#IzWxf=9j7I_bvYhX89G#zF8XJmJ$)L4ZZPw_?_WldQ-RB<(hs$H(rJCd z!k{C*9a*x}utkTIg5!_+B6IS2oa%|(y6P_rJd6H(NpFdgOP#rzq?>hAH_fPrlHz&h zI|^56+WptU_l}_99}OfJ$nOZGTMgo+gQ!v3716IudhR~HK^1p52t}K|dp+M+-@nL` zl76&4KVNg;+BIv;DG-{O@OCsP4X)q3IeJa?Z-;MbUQGOWw23Z1s$9vF^54)DZdY}E zRapR&{~M@u)rCWpW7yOix+vsKAburYq8rLZ)|{`si-W_@JUnc5u`c4ZBFett>b9ME zRWQHTPaGisZb3|?MDdb3>snnw?y^2Z6a~sr;e2hON-`MsP0I2wFSPq8S29$fMW3M+ z*h*Xd*Og?aQweXi3kfMfBo-fInIaI`nEz)uCkymW(Q{ApQ<|8s87{4*I%S&1s>?G_ z8U}Hqf;+CO9N{s%QPWo1U#`#R+4@)0ohq>+uvT>Ruv0DL^e~jP=WsKZYg*ht&V2IK z@WExSQ~CK>_+Au0Z~K`PkW~GvvNC%?kY!EB9rYVjQ5YU^@9bIje^b-f*m{c^%O4(CW(d*yb#J7YJ!^90Y2Q z-DVXtdHoJ+1{fJ_OKtV$)2HrW@v%d_dY<%M4>%|!ejU@Pu8BSAjLSwo)n}qSLCArH0N-loaInCcPZE0~n;MRn7O+&XfsKQk--%YpD$u|YGQ}!b^cPOsneT}+*)sdIw7rbV^wlrzf7bu z+7faWK0bET=f*M0Mhx2mFa4R{W5y*%M1soXd$C!}N@-!H^!oGX9$*zmF0^mdD4=!(Oply9GkiqLT0EuV zp`)qMNxMRKE~UO#eumKP)iraFx%rhZJH@Rnb-bvs)Z;AA|4vl$NgIB9O%*0yTcS6$ z^S#tcA&l?;`>HY`*E4U5@q6jYUbZ?s0my#8X`5#VWlEy)LMCQaOq_%1Q##-3x3xXU zU={1w>UxFtYF`By-YZ^5zwSqm<}GSRG|Qf>V;lLZZ(EVJJ03M^yi#lZtb3&iAx^#1 zys;f0|gZaWESKkiQs3e?+5Zsh>5s6(>0JbF-3ByH7QCi(T)Q$)B zW89~0bc0~HaS0l30fOTb+y~EvkG8#VebB3r~g-|clocTu}gXRxW36I&m+i`DY(Eim!xe1bUBoSxtx@a4D=fVI>lg8g9 znLy-hsgSHYsmlzA&(`UlMOG)KEna6nn-$cmLA3$O!vlMpwD3|`pinI{*^ZV>Z_W(BKnwsI2dky@OXc84c7vIZk&IIM>3*vC&mMJ`8?aUVfyLb(3Mz ze4)&(+WlO^!G}eu^!#25f@&=7DZR(sGS-hqC-NPy2-3ouIZDS(b`LjgtGn0qM z7Y0+|Q&)gn`K0BSUEYjdOj&IlP3K)OVeYD7QFF|Xrnjgia@04>d!AN9_qut@ z&|>OO;|pcwKBG(S#yFRK4RbcXQEHHpxhL*oLvE!6WB^k+gTGa9$jmwVG(am>S zxM-36!%;LVp>LjSHb{2;XKIUD+dO@mG~+M#?h(yYDNAf093?&Ecez)kvA1D>1LViV zv>$IPDmKt)v9{t!>4|?zvzlj4t^ij|Oe-Mq#@^YSy3XX&^7FVq?Qor!hGVwcRG)j?A-)ICJ*wk(0ZP=Z3}X@Gh`wu!@O}avr4B8D^HKlJ~u_ zYr!b+ahVZm1b)w`DYsEuq@k3Ue0<5RocPs<2KY-M6_&?}4PSq>PZw?B5zU{5!*x6EEd4ESF&u*DUOF zYBiMw3M;312CI7KLgSn@aLV!rrx*I9UE^(==J{-X-DV=hSmpH`Jc7F4``JUEdHT(o zbyH_Yf(6)|Kwz;=M(A%c9`GrQTWws(h}C-h1Si~Ai~y$aX%%&+c%tb9=Jm1EAqpboP;cJXtHL>57SvAVs+;*$IPGjj98&2&nL&Mk~;o_F_G50Wl3>rdDSY z?SzL$6wbY=x3RdqjzYj^%ou(^XpooB2?+g z)Vwoei}}ubS(|}!Bk5}JElgj^w%7_Y6%fiya{=-k+{vbdZcb(u4ny<4feVQfX0zc9 zhJp2Ip|FKs$lF;R6U#>Flsf4)$E$RdMNJTC8z}fCZp=FJe{{1Y^~Ewj^chHDeq!rL zvGHWcEAw*QQt*(=oLO3wHIP2KgR*ZtNzm5!nU!VaJN5C$$7{hw|N84M_0-c8WB~zi zXB@I-yX0uYT?XPDPEvo~YaP7t{e*nw9Wt<5n>MjQ9>L{vr?Wjm7<`uA986_(mJmz$ z=tS$wIQA!$Aa<;?MH6VISuyv8Jkw{-;)1ekmcFAHXuYcGZ@=l@OBXLNULM{k#~#c! zsXNstblIjhfU5WYH*(QlI^Dy!ole%?RX+~ve)8a4Um`=ZoLz6gEO8RJs{7$5Hn5#x zc3Y~A+mzn5hhmiPtDYyg2%Va=VcceGJ3BaxJsH4eJpxmq6PkS*zp3kB7hCTIV3VTVPKc8*jDM3BAQ-j6gTP!Cdsqst;_2%^EeFE)U)qUR-R1;urJ%0PNRv#`6 zH+0!M7#@@XqxaROHQBb90xxhm0Ido4yzfO&8$&&!kCkg-OqLWmyMc()#E+xokd< ztyjR;iUDS=ELz3rP0L94oVcdA#@FuL%Wctk8oUX(@_CiV_dUTCs|vr|KvBB?#ihR| z!|qWpXRxqw_=tR2VGm(7HYoe^u1KwsO^W6r+3H(-xp{M0%bfWng=$N$Nx&70a{p5p z=b8QH{_VJ`mfSB`D>^9tIe1pS$%cB#E{ymH`Y4`bdwrP z+`T4zA_ZyW$SAq8Z)P@;$$7%NIHPp)nS~?b1D#%KY2SKLS4?`CS$mcnp**?MA<5ZR zTHTVb~^`k9_80abt_tx;gP~x6{7ZYu8oJLD~Ycpzmsg!&xS0MI-g}kR^)$ z5OJ8Tr_{|^*6zgA^+6$MkFIIO+Lg&{7i91HQ}z8MIYBdLohM#I%?;1VV&9U=;j4QG2fgsFzT>Vj z-|fqTAT}+Bsu%9s%-bG@)I+tZPCyW93d&%U5HH)j&(;a(pY`Y1psot?+_+{Z;l^u7 zw<|%FOI*@h>~~2I({t@~siSYd3Dhkb^NhlqdTF_y+(DYZHcKowl)FsRr_V6T*N@E^ zRi2uHLpEojXP}#yJ7lMRV>)Fzw_8xKQDt4(94Oatj5>vBaGVdDFM8M^_4|V6X6^Eq z@5S)+y4D66R_P2?{fz*{3D%*UC7B(^T-H6PnbzMro4jS-g#e3Qq=8($RY2#3? znl#D(EIAW)=LqV6wdM4!;V;=E-53?%Wy@Y*6=h$4>X%sfP+*JIu}NIPyrQ zj^X0v7E5~t7T>*+EBb3en`ZgL$VLJXY8z5~cP21S>cs^f6dy`obm#)Os~K-Bj`&X` zUZ6x}|0oaoj+$XjPLJ)h+Md1D*%?Oo2|Db4LcMs2RH>et#d-^^z|cb{=25_DYWE;# zbRj$|omWmD>QZ^0;>;_cX)g_ayhzJr@f^gEh2OvU;w93pUgXf=QbOsaQ+On|2ElrJ z??g+A)=X~Uv#C=f_S(B;SAT4(5G7`ytKn*`C|4(I%VP^(@9t5CY(;n2ELD59uPZ)QPz<=lXU8wjY&pqEVIqJP_#&O zZ_Px$olN26gM&N#OLgM-I49L;&gbw2Vm%^@Baqp(Sh}=k+0FiHkMoS(+`CN3`ee3# z_O~13f*_6vacg5W&1d4H8Tp3ck#Dwo_|Nh5&&jD-di2|#?-VY$UDkAH>b?WgH(zdB z=0fcm1!I4#6kPpNPVICV0$UY5y143(K$AfsTgQG&h~2N*Evn3&Xgk%z*NsZ3(*S}3r5F7?#( zG6tYN&1em`j!eAt8Qx>kMM71nh(9+QLQK&zGbxQ zkT+rRbrP&YUNnIgf#v?wo50-?=BQiE%NtJ10kNjNiC3}pd^-{1GPQ7AS020KoBdkq z|NU51Ma?}sx&`tK@S+fe?^nm?{wKu3T4!gYkgpY?Yuk_uGVb_r{ST|xrN5uDgD$Pj#$Usb5#={p zoQdmxhDDyaT1?oTRkE$he~xKsnf~ffT4>(n!@*-O%wXs}8lT6t?UHXDUod>geapW8 zb~b=N7G?SBs#oP9OBZ{aoSLda^APhBe=QkXlp0;!v$#BmyhhgFk*QZ&ZGT{l8e@m1 zP6d7Rk(m8T?46ov{lf}Y5j;@JDP(1`=)pX44?%16x%%pQ+pFs=)0=eAF73d~{?4&S zJhY;k$x|Z}>>u^cA{shmyCrv278ums`J0hS;!EwL*V8=;)xSnG9f*F*b9#TR6Y>x# zHf3cv@LnsCbxM_=?(kaHCn3icm6+@|MF6qg-Y%v#;KgKT=Y)Vk&u>OgO5NjJR`ZZ^ z;!qiPx-T!#;ceUeZ@0#eX)vR_jh#?>StclD#m#Xibt1mS9N6&qxHK327FMds#c&vV zBtd;|=@{1n{etWz{$mY&0-I_dG8%uAbYarc1xR0))T?RZCktG%_KCq_w zPL+qE;_G>D*ABh#;wRCyLjqn`q{jU;7;>$kv^*ZWqn(3SoYX8nw_}Nw27`MzKKs$9 zxj#B*CR7vB&=aChl)Z89NZRzoFfVH1xwj{$*@k@JYX^c5#}2l$`thSM%E_f`pRId( z<}B(xv?+aE_&m^GI!wL5Hgu+(>K12>(VuPXUd9}W94q~8u4K;$)xea`q{S*wT9 z{>V5hc=?WV-&Q!Klyt8C&K4;Pk4fLc=ExAgC_n0p(~-0uW*)oE+U&i>`D>m0bATxo z#K{+Tb=dU;Dqq?hHXRMbBEzNaNhwDHmUE-CF#t{o{t-%U8TD zI17Y-bNHm-x-a?nexCZ15pYrUVSj&rjdDF(^oK%hfGsO-QJi6|92+S5`-S`d$O)!Ym?odd*`OpTCxVShVHd z#ZzzsjF!Hes@`{M2maV-epVHKD#_(U3!xSl+Ha@RlJywy-};O52sKD1BoThHwP~Xn zVjzL)TGtgY{9oRrhS6Pet428y*(s^_p|USGySKj>eyL^#&5^99N%y{MH~&u|4o-yp z*2g7%%*RviQ*+lsR_uIU+aG1$=jQafyYRsC2g4qdy7RFQZOfr=$+DXatB9ORHHZW~GRa`7u73b%gYm z4p}07J?H<`Ni9U*Gxdm^@P4z_#tzo6`&tPMml%8fR4E+Tz|z6ZdKqrrdzLYtUUA!X z-!$Qz9NJkjdMZQknE(#D(3lw9{RW^5(l0)d!{L~heR6mX2rl=7=5_&sh*~_iOs*^`0n+}BV$_zJHjuo(w+EI3CjO~a z@b4n1bxoy7BphZ@V2SqyzsCRL^#MIMa&F^jpqRY&gT0W-W?`P`%ji7s?Wzo*Rs#r> zE`3B%{vL3|!6@5~#UhKHF)IU(?+iowqC?@Hp9C+T_nFro* zqm*P=+41YMEx+t>+Trh~MAh9>v!0pxdVR4&Wb?uH-S?*-dT?~&{&d04& zfqca+Z6{=5q?rG_e=_{j+q-R<-i}=)WP1{`mHxS9l|v8g8}9A0ZYCTu!@vT= zx-%=7u7w&KXN~q;r9x5lJH*k{jS{<(Z3B1Vj_DwV-)h+puv9-Otmj}zcYirJ3MpLwpDqDUi?aO1OL~pfpt0VHUR;#P3nCrp(MuAV)TAw zz1nkHC5P>MWj@JnolvS&E>rx2b%bX=wt$JFUQYA9hShJ{?Iux8T>GHRojTT^l|0YZ67xb@Lcx&YRQXar{pNt!98Uw z7QOpyXC{Pxi5X3@vUTw61Y#&ii>q#`fF^99RSQa)p=UbGyA}GnlH;m_9HFq0ElpbL9gm2sxNw zbOjI5W1OR++h4~H|8aA5kXKIcED|^*Lp@9DBdfbTetgD9Yj7fSpQl6`D9ynyR_|t_ zDK6hWcXS1zt-k&3S6$ci*KG)TaHfh?E7{9^&iXu8x=Qm|ualb7s_y5pw6ww)Df@i`(`4t<45+N?!UB&?#i`dpYQe-{@WOfOOmR2KsDop<*+9P! z2Q;n1`I+kgWei*oR}Aj9TWAn{7ffV6o&9(J0wta=Vy6twR_|~_X@%9uxJK^4ZII|BjZ%R)a(R zDos5KeiQb8X4UfVS1U^*Y9ED|dyQqX<$CVjms5h1%M@J=rk7n(yu*lQ;=RpGTo|AN z`DWI*5sD^)vqRe&?K^(48yn&Gi`bz9^FC$Cu6F{PahKKrj$R$V&YP}ha2!QvUv_JEXNGMb4vjrZP*2Qr!P{H* zBq(hS)b)&kP{i%RH5GKoxS&4%HPoe0oVU^j(8RZua6+cds zCScjG_&A!+8|VBxZl95nk=i?8vem^79CsWEgZu4-aP1stpZL+YQ80*H0ixeTjRFJ5 z#Px_~3|#Z`-?;l%zuB&7myh8mH&8Roi9xt6t`TOTJfSNd_r@?_heFd3EF);r=;_vF zw?=gEGrYlI-a|!aGBbBgWj;SkOY_{~K5m8TD1imTPN7%p0~>WWWV0P-9|@vee@#mzQsHQ|B;^$Jt68u zrS%lC3K)=z*B7VFr;1lRx_^I)%HfseH7mVoO^$p~`SV4Z^@SUgtYmoui0Lfo7S5;t z+5h6X`-OwlTAnJ)QSogp{m?cQq1b42=?md8BZP2R^xyH7F@`^fgtm11qqP%67i_Sd z)zZ?_9g;eaypRI^X|=WT4?#Vq{qIG?2#<^EZ~Ly_n7%AF-Td_JDuyKTqil?nHu3hY zMsVgXBU?Ifb*%M=yJMU8Tz?5;zyBbbIEEMEXvx8}U^uT)^{Omy?+lfWzVjZzPIF%} z=Sy8(u2!SuwTZY&pqlfz?Rx|wWovpTDRJr5@?*aIsg-_fPWAiuTSi9V9(Oq7ML8rr zF&(n()9XXW&E%WHKHk0B`Soh;*0OPMGEZD2l-i#u=8)-7b?1`E)a~Pbz>gY9>!)ru zwqlCL#5Sc<2ERPM{#*@0-{dc083=|5L>j3(uU4K1o0#%(i2u0G{k{ABHG>MuLMrWu z1vWpdhi6T$GvYi*5_^8kbEb?+>hr@fmf>!Al$Hi55oPA^N;o>DOsjsqnPV(Ba zYkEo!4_CdsytCTew?L7a5Y<>#y2VrJ$9(SQeT>wO=dTM-pVP(Yv)Pztb$(4((_dZH zYD|I=l8IVKMfKhX=|55kCgT31Vju%am7cGE9`YT!sR{_J^YpW0t9M0Cbh+3OUcW#{ zm<~;tZ|8@HB&TRCt;0-u$9$FA9dnJwU0v{iJb0u@fJHocTUlLuL$}x76OS45E%?)| zA))_ZpL*kogU0oJ-1RO^n$PlnS;)VLDVt(7tuiC6^$Z}ddyMk?^eQ}dpqTmIOxxRL z+~UoVMqQrSl7Ar&{KidSu!9}PnD0mQI_}5SoXUD^u=lXaDPq#I?s`6A!Te7 zfpO^ynJ;SY!R*Bkiy8cQ?b+}Xm5ONW`0$v-C}TfPPbraY(&8$H+%612YCm($g+sjZ zJAkfj9hqn|$D);a2UE|8So>lMJ4!gG7{|b%!(p5BM#+*KF7uyBP}#bQ+jLBp9JA~U zwiw4KJN>up=arhbX(ZkRT0owD+kUgwv@6?AftUCG#Q zS>tD$76!XSRR+DH;5zIaxnRnVx5NJ$x(ZY&5XE?hVxG<>O5E0*n=I<+Dp;LG&s4iH z;l`bHt7a2zr3ai|5x$Eg$?`t^&oS0AOSeE&4CFmigKkYI^aJ^HUev24dN0OgMpu6R z08{!e`R0^Jvh+w9Glo!5^w$vdIIS3Y{Sl}k_zZFR z`YhRS5>>fvjLWba~jms$J{de{5cV z{M4zEnEjqGfud@jk~KOEm>=`vQYlALzxa7c@HgkI4aHtVPCh#gJF?@23940J_OL?$ z2~{i7E?!{#jOP1KT)eaA6xG!eZe3(%?U!l;$@)|cPw6KUD>sTcflLATG9uh(*yaXc ztBgrVbV^R#d9#e?8nyX|k(dkfq|K7_-qeT(P^oEo9`{SVe5_dqQBT>a4HppP8c6MW za3n={MG!wOS8o)$pUtzngMcCZlCErjXdSy^wkA-L z$A7ulAc(9ROyIftx&>ftDJfJyhEn0fRWw?Spg)+61RKvC&Sz3}@Lq34eul4?6of~S z#nK`QV{ZfgX(DG}3Z%+R*lFH2p%Bx&2t8ZM`MN{v(M7UJ&1qhH-&`ztc?9S1aEiIQ z!!SBF8R}Lk>Hfp~w%N=-9BQ(G61?x9yt!r3y9Z_>7|zE^FZ*OTinHWG5~Z59aas*-JRRS9@#2h;5-XXeWpr!7DEY<_}3G)3I6RtrQ71ywRLH7Y~gDQlCa~~unf^j(3%JH2ZNa~irO*T zf6S|@35y|ltfzH;^FyIZeW)Q-MD2&?AzF{&VGEnK3``pL?olv86Hlh04B>H!d06o0 zGkS0#JkLr#va!E=YQbL5voiDWh?08$UVpLBj1oV&dfCc-%V}uH`v7nC7SmTG*~#wL zfzy+6JdC<@I{}4v>gj)m*ITnzJ~-1uCf?|7Ehs%5?<-V+d)xCn>zTM+7Gyw&`cU!q zZRw|uA0bc{4N-_Tr3y};l3y1>d{^@HgZN!76|rDvt}rGO=gE&`e}j%JsuxZoWoTJ+ zTl_B*D`Hp7>v@|Oo|Ivzhy|<@<*%sk#1~n}``XkyA`K8;t+J+%c9;irIYXjcj~_J` ze+KiK^ya@Lx+UKK$H&L6%pzW1+&rq+zVUhk2Ms!MGT%j*kb-s!i3gNS50#;|9BK2# zuey_}d(wyYsx)_zv|ONr2SDskniX~MR+=%B6f|pA_neAW0deuS`yj8|JzHQtc z)0gh?i4V^C+0$1ZKA8*@5Sr3bYdzTRe|@4*M^3gG?;};l!`~GGN^AG)H_>K-4?lC# z!}b;{-$~BpIw`^ZgQ+a9MR!7KsRZ0*bsKb)7yI@?LDOyG%1$ej>5sjxkc*DYS<`m4 zE|!VT$o1Zw_{y=*r&Y&PMN8ZbSo3zoeS#J7Y|*7I3Sn)VO`C-nCvjfv6igBf37n=a zgKZQT`zUC+@>L0QVroO z%J!uX@7ffR+$~^tI-crsMj{G^3qjO5A*3v5nW+9tK`o;8#w!GF%c3F@yI(FDKHRp? z8>zw}3rY=2A}T?{aJb(U}U7s2sN(7>Yt0?BYBwtLqO9XeFZ+zOzg_s-rMnL_ft(TlG` z$lG8O-8w73%i0dB^NA1l6x%U3T!>sxYkj{~ z4*$6jhSozFE?t5n^5I?W@2}oW+u=T>E9PdQRaMJybr#K}=h@SJp=!m_{*>~fKaAI< zaSQ=7NI3Zi^ERs7bumYM7?c#%WEhR(`@5cB5H6$k4*eb=P%!K1WV@<_S&cKe%>)~x zJLmk;o(@VP_KfPX^g0l2a_uSts@^Ygb@ng#hP}Rq=qX!uX?!I{>!8fE#X39D_=sA* z(PSuBV)f4PYduo!c0qw1a?n4n{JSZY*Qzmh;JiD>hTDuiCSn~>o9rWT12W(QSqs_) zW^513U}%0zZ{nc+;$~ikgyFW-wZ`6UPpn=rZ=NA`AF^h!uY7?!r*`mYv+v|~^i54m zYb)gXb0IpiTP3@E>U6GD{N$iWzvau7lq?3fvW_Fq19@#H0`e?G-x_m&(103`4Kao_ z>k5u6-(ln3KCx4TI4D9|jNA2PJ%y$1BA`%dBvP0BXovnnP_`uJ)DiS(dhf=01Ds@0 z0BKa>pkptTGb6e@`CmS5{K%Z;l%AXP=TkyYN`gizf7$es_L~Bxw1Ti%YQ3TYb7gKM zoubi&A>xD}H=R-J9NiZe*)71^v_KhXcIEy&V3b;Xkp%5=+z^r_-m9{PR5}Tfs1{X> zp2mgh!}v*`l2WJsXISg>6wj2Qs{)GrgQrq8>LbrAyXgREU?Bb}y587D4Tl@!EL&zm zy9{!wden!Pe(qvksni;YKlR>h#R%o;t5>=r+@Q74!AjH;R6UFPxoz>5$p^q&g6P1M za7>g8JQLo{xP1`Si&#L{t411(CS=4?eiIq`0uQ#s(!$Z3Ut;Fi^_RN~XX@6T!3JU# zD+t}S;0#f!2-CX{x)4X*kT7;@rqAt{uvcDa`GnmLP5<4YYdgYv&tH?VF}rtcngbs!w0hB_I|q?h zi)n!JI{>MRnDbKLwTntSZqb)(YpiMT2=x&%N)R%Q3dIz^R4yQKHe{jdmK{Qn{0!;q zAR5hZEsQ;wXKqNPTHCCunGqTJO% zDvKA0k~KM1jTPLFj&u@R>_giDWTOYX1jfj~^Iz_~ddc9MIH6H|i75%|lskiH*?D)H zA#PCYRZ%EpxXz9Oh?8aMzwH9cJ9jiYB*^P-^sZg(l4*4{La!|^TuG@VYk-iZt&7={ zKtL0%bP`itaxa|Ns3_t6i}w>9TqDB#$RCtlsW1Ss#%PJL(%R(Yc@gJ3zT^wtIlZuc zEJd%_>8M{6tp=0qHsYd2Q6RQMeuX;Epv`jfWP*$s1bwTx@QOb^<>b}ZM#~u*(8fwy z5R09S<=3O4qvK$eBuq~0g_gYuU)HbC!WaDy)@If!o&V-CBdKqokdI8au+`qxflhJR zw8+AooTecDIlRt=@XfKGfAk+anvHHJO>WBr90k#8<{Z@TPS;7a^`;$~h74k@V+N`z zp1gY(29|kU>u)qpjVDaVb55DnCz^2}ae|FfM2V&xTBbLoR`=p0SPY8^@tIH; zQ|Vc$i~fZ_1GH27I)1MhZ^!L^>quV&ybCbfj}l#qdJ4A*F~6H^~YuX{LnS!&cvk-fg3quZs7W zkMp+aDWiEx|8PMuwQo+Ho=tR7?bJy>{z@XViTZ(zlONX9Jl8eMlb;a6H$H1Z+=9lb zCNCZX3X>G$J+~n>g;5Sa4TQ!zyFJs)?MVia5C~~6K|Hx z!yk~1hgyMdrff__B&Z<1U1qZM{Du1okHRK2%1yPyCJ~={#9J7=soArGZ#fI721gWa ztacWh-gAmw6coDag&52Lt;)QwaxtWES+OE+(NjmCrwYO-EDJI@wo{W8mw@F3z7q;O z+hHu3ti`>3{ge6@nz*A%P9mce{K>*JoiJgR#iGYp4lXFJLhRN#pwb_SN5i@1*w~3l z0i{bL1^FwKzqucE*Txtk3fS)NwkMVRhKhPtv*rR?^ej5QV_YoU#V%!K{YJB8Nylk~ zy@zCt@ITgHVzMO`E@(P6sPJF0N0fGF1M=*K3V~601G*|Bd�XKG9__Ev1JkU`KL({qYtXCNp-Zq*8*cGqk@XQuu zw9Awp3tt!X6n;MRFU1xvGs(4sykbT;v_HN43Z0v4$(D#rf|TMthjc%^k&jEd;H>m; zT8tQ>e>Pw}{qLN80U7a??f2~hsc)zR0P3H81fmb~L)#GTpiexb2ve*ke`S67HEFy2 zt5iE!Qf`aMH^;Owt?7Ecf|Tv?*;5!xQk;{N)!cGCRsyafooxY#*+fB@@5HCsUZ@)z zH<%GF^>5;cadypBRK%B^d$R4s%x=4pc*wJ7yP0j13B2;!uU|)|l=Qwgq_8au4G=$E z#!(!Sm5=d3E$-U;nwr4v+Z|(9wri$^zuWJ-ZJLs9950)l!9eW^wGqWvBgRaB&bbl9 z*AWlqs113y`!KsBaIlfU^v$Z4&6=&Ao-$$LQ{$t62eST0)`8P18>?UAuM&DUFu?45 zVJ}}yjeQ+}J@oa@WV{MRMEs=a`#ZHbLsq~qMB~5|<(}y&fqVCMBS?Yu9Gd<0k?E+i zulYD^(O~X~ZlEyVeJkPR07KUES~847|BT^K&jG!aS4*ZZKDEE3ysiI#lU7<@7!AVU zecNBT@?r1ng{xeZD>u)Ee^qD&;(aot(4XyL1~{b>SmK9{BO9>>4D3WTJet z368w_>?gfYuWLp`39o)c0L3s4?-KyG|H~C=3G*Ha=?ovlCrxHv@duo#Hb#OzD->W$ zm#GE*SL|2uDa2Y;ZX3QZB4;+sb|)&2pa~M{6=bWcuhM=72W`C${DH4yTdsqGfNaTC zEmMyZ3pwu6Y33-xIO6@}>K(pCcP7hc6ql$%CUP{*o=3N6)yjfV7c|{_s?4ClIQ0*5+ecLn0=G{`T=1XPyH}U zv{oMn3|R5m``ogshSYzODMD)aAP4?8z%Gd!{X2znJC+3iT2DE5G;(LmdesgrwB}t( zYwAXN)0=NTPG)9Zi2`V4GATV3ii_VrN5{1JgS6gQyTuefktGxvz?jvL0u%~CWa6_R zn@(PB@@dyxPfsP7MI1%2c#2CwAHULApm%l^C=@b%Lk|$Ev`sH zK#8`G0GttMY@ zR^?Q4_USn#{8fov1I^8^jX&%JRK((HB^lfe9u8abw%KnLW{qr4>aL^nn;3V)s`%v% z`OA%ZL{`TZ{7_3;Us-69S>4b+ib7COdkAuUfW<=v#}fm(h%gr8IHvCD(6|$M7@N5U z{5)wm%I0XtE*SOW#-LR{&bbaA!pJR|jY)c?{j{v^x2LLUWe)+RyHT90(e^LcrB9+Qk zAer0C{uIL9^YqzFSOFa5mbU6-(hOTGh%eg;g;&}I3(_5~4{`4T&zF}X7tM0YVz^eD znFdj(o+t{a`|80NV{ud@ zs%ldt`*=pl7EkeCr;ibAD|O!e{$@RMCFPrX-o8Ys`wv~L2#dv{M%&IvP4D$>bGaf$ z2u-8_z>KdeA01avvQ?`eC{1aZRcO(+MvE(amzK?&iwpffECo1&5BRL9#18jd)`iHfF~k9W+F~5vSEoL zVgqZ*o*Mtbk_n*!b2#5)y4St*PfwCaj&KLjMfgqfuw(VCcwgdPIFmV^V2;ltES|r9 zEjagnO2(bgh0*o>x|-wbPnm5xH~~|&U{qGu#^=7^GO~4WM%3A^J?LqAhHD-VhWN;RC(TOJU>io)_SrW-Kvii*zh(ydX@4eq8Ll=2Rq*-q1#=LW!p_PS`i{wY@&adYea3ucUf2mesh->getDimension()==2 && !isGood2DMesh()) {destroyNewElements(); return false;} + return true; +} + +bool Collapse::run(Entity* edge, double qualityToBeat) +{ + PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); + if (!setEdge(edge)) return false; + if (!checkClass()) return false; + if (!checkTopo()) return false; + + computeElementSets(); + if (!adapt->input->shouldForceAdaptation) + qualityToBeat = std::min(adapt->input->goodQuality, + std::max(getOldQuality(), adapt->input->validQuality)); + + if (!isValid() || anyWorseQuality(qualityToBeat)) { + if (!getFlag(adapt, vertToKeep, COLLAPSE)) { unmark(); return false; } + std::swap(vertToKeep, vertToCollapse); + computeElementSets(); + if (!isValid() || anyWorseQuality(qualityToBeat)) { unmark(); return false; } + } + rebuildElements(); fitElements(); unmark(); @@ -71,6 +98,8 @@ bool Collapse::requestLocality(apf::CavityOp* o) bool Collapse::isValid() { + // PCU_ALWAYS_ASSERT( ! adapt->mesh->isShared(vertToCollapse)); + // if (adapt->mesh->getDimension() == 3 && !cavity.shouldFit) return true; Vector prev = getPosition(adapt->mesh, vertToCollapse); Vector target = getPosition(adapt->mesh, vertToKeep); adapt->mesh->setPoint(vertToCollapse, 0, target); @@ -609,32 +638,6 @@ bool isRequiredForMatchedEdgeCollapse(Adapt* adapt, Entity* vertex) return isRequiredForAnEdgeCollapse(adapt, vertex); } -bool collapseEdge(Collapse& collapse, Entity* edge, double qualityToBeat) -{ - Adapt* adapt = collapse.adapt; - PCU_ALWAYS_ASSERT(adapt->mesh->getType(edge) == apf::Mesh::EDGE); - if (!collapse.setEdge(edge)) return false; - if (!collapse.checkClass()) return false; - if (!collapse.checkTopo()) return false; - - collapse.computeElementSets(); - if (!adapt->input->shouldForceAdaptation) - qualityToBeat = std::min(adapt->input->goodQuality, - std::max(collapse.getOldQuality(),adapt->input->validQuality)); - - if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { - if (!getFlag(adapt,collapse.vertToKeep,COLLAPSE)) { collapse.unmark(); return false; } - std::swap(collapse.vertToKeep,collapse.vertToCollapse); - collapse.computeElementSets(); - if (!collapse.isValid() || collapse.anyWorseQuality(qualityToBeat)) { collapse.unmark(); return false; } - } - - collapse.rebuildElements(); - collapse.fitElements(); - collapse.unmark(); - return true; -} - bool setupCollapse(Collapse& collapse, Entity* edge, Entity* vert) { Adapt* adapter = collapse.adapt; diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 21e4043d9..8fd8a90f0 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -25,6 +25,7 @@ class Collapse public: void Init(Adapt* a); bool run(Entity* edge, Entity* vert, double qualityToBeat); + bool run(Entity* edge, double qualityToBeat); bool requestLocality(apf::CavityOp* o); void destroyOldElements(); void destroyNewElements(); From 01e015b5cd54905ded9e814f1d432ceb51601a63 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 9 Jan 2026 17:27:23 -0500 Subject: [PATCH 317/319] fix 2D bugs --- ma/maCollapse.cc | 14 ++++++++++++++ ma/maCollapse.h | 1 + ma/maReposition.cc | 2 +- test/testing.cmake | 2 +- 4 files changed, 17 insertions(+), 2 deletions(-) diff --git a/ma/maCollapse.cc b/ma/maCollapse.cc index 93f5af75b..4b0363018 100644 --- a/ma/maCollapse.cc +++ b/ma/maCollapse.cc @@ -496,8 +496,22 @@ Entity* Collapse::rebuildEntity(Mesh* m, Entity* original, Entity** downward) return entity; } +void Collapse::rebuildElements2D() +{ + PCU_ALWAYS_ASSERT(elementsToKeep.size()); + newElements.setSize(elementsToKeep.size()); + cavity.beforeBuilding(); + size_t ni=0; + APF_ITERATE(EntitySet,elementsToKeep,it) + newElements[ni++]= + rebuildElement(adapt->mesh, *it, vertToCollapse, vertToKeep, + adapt->buildCallback, rebuildCallback); + cavity.afterBuilding(); +} + void Collapse::rebuildElements() { + if (adapt->mesh->getDimension() < 3) return rebuildElements2D(); PCU_ALWAYS_ASSERT(elementsToKeep.size()); newElements.setSize(elementsToKeep.size()); cavity.beforeBuilding(); diff --git a/ma/maCollapse.h b/ma/maCollapse.h index 8fd8a90f0..c717e6ef6 100644 --- a/ma/maCollapse.h +++ b/ma/maCollapse.h @@ -36,6 +36,7 @@ class Collapse void setVerts(); virtual void computeElementSets(); void rebuildElements(); + void rebuildElements2D(); void fitElements(); bool isGood2DMesh(); void cancel(); diff --git a/ma/maReposition.cc b/ma/maReposition.cc index 9d6bc2d28..296bc94e1 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -77,7 +77,7 @@ bool RepositionVertex::move(Entity* vertex, Vector target) double RepositionVertex::findWorstShape(Vector position) { Model* gm = mesh->toModel(vertex); - if (mesh->getModelType(gm) < 3) { + if (mesh->getModelType(gm) < 3 && adapt->input->shouldSnap) { Vector p; mesh->getParamOn(gm,vertex,p); mesh->snapToModel(gm,p,position); diff --git a/test/testing.cmake b/test/testing.cmake index 67f75b948..8dbe931be 100644 --- a/test/testing.cmake +++ b/test/testing.cmake @@ -398,7 +398,7 @@ if(ENABLE_ZOLTAN) "${MESHES}/2dlayersNoAdapt/mesh.smb" "doNotAdapt" "8") set_tests_properties(ma_2dLayersOff PROPERTIES - PASS_REGULAR_EXPRESSION "number of triangle 18698") + PASS_REGULAR_EXPRESSION "number of triangle 18696") endif() mpi_test(tet_serial 1 ./tetrahedronize From 5f9699a6c7bbe33aa90edc46aa9b434b186bc71d Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 9 Jan 2026 21:04:22 -0500 Subject: [PATCH 318/319] delete unused --- ma/ma.cc | 5 ++-- ma/maDBG.cc | 22 +++++++++++----- ma/maDBG.h | 7 ++--- ma/maFixShape.cc | 68 ++++++++++++++++++++++++------------------------ ma/maSnapper.cc | 39 ++++++++++++++------------- 5 files changed, 76 insertions(+), 65 deletions(-) diff --git a/ma/ma.cc b/ma/ma.cc index 2753660a5..c5ce4ca00 100644 --- a/ma/ma.cc +++ b/ma/ma.cc @@ -94,8 +94,9 @@ void adapt(Input* in) print(m->getPCU(), "mesh adapted in %f seconds", t1-t0); printHistogramStats(a); m->verify(); - ma_dbg::addFieldInfo(a); - apf::writeVtkFiles("mesh_tets_end", m, 3); + ma_dbg::useFieldInfo(a, [m] { + apf::writeVtkFiles("mesh_tets_end", m, 3); + }); delete a; // cleanup input object and associated sizefield and solutiontransfer objects diff --git a/ma/maDBG.cc b/ma/maDBG.cc index 056fa5845..1196cbebc 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -58,7 +58,7 @@ apf::Field* getField(ma::Adapt* a, int dim, const char* fieldName) return field; } -void addFieldInfo(ma::Adapt* a) +void useFieldInfo(ma::Adapt* a, const std::function& funcUsingField) { ma::Mesh* m = a->mesh; apf::Field* fieldVert = getField(a, 0, "vert_classification"); @@ -92,12 +92,20 @@ void addFieldInfo(ma::Adapt* a) std::vector lq_no_metric; ma::getLinearQualitiesInMetricSpace(a->mesh, a->sizeField, lq_metric); ma::getLinearQualitiesInPhysicalSpace(a->mesh, lq_no_metric); - colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_metric, "qual_metric"); - colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_no_metric, "qual_no_metric"); - + apf::Field* metricField = colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_metric, "qual_metric"); + apf::Field* physicalField = colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_no_metric, "qual_no_metric"); + apf::Field* snapTargetField = addTargetLocation(a, "snap_target"); + + funcUsingField(); + apf::destroyField(fieldVert); + apf::destroyField(fieldEdge); + apf::destroyField(fieldFace); + apf::destroyField(metricField); + apf::destroyField(physicalField); + apf::destroyField(snapTargetField); } -void addTargetLocation(ma::Adapt* a, +apf::Field* addTargetLocation(ma::Adapt* a, const char* fieldName) { ma::Mesh* m = a->mesh; @@ -123,6 +131,7 @@ void addTargetLocation(ma::Adapt* a, apf::setVector(paramField , ent, 0, x); } m->end(it); + return paramField; } void addParamCoords(ma::Adapt* a, @@ -199,7 +208,7 @@ void flagEntity(ma::Adapt* a, int dim, const char* fieldName, ma::Entity** entit } } -void colorEntitiesOfDimWithValues(ma::Adapt* a, +apf::Field* colorEntitiesOfDimWithValues(ma::Adapt* a, int dim, const std::vector & vals, const char* fieldName) @@ -225,6 +234,7 @@ void colorEntitiesOfDimWithValues(ma::Adapt* a, index++; } m->end(it); + return colorField; } void evaluateFlags(ma::Adapt* a, diff --git a/ma/maDBG.h b/ma/maDBG.h index 7b061b30b..4e59877e0 100644 --- a/ma/maDBG.h +++ b/ma/maDBG.h @@ -18,6 +18,7 @@ #include #include +#include namespace ma_dbg { @@ -27,9 +28,9 @@ void writeMesh(ma::Mesh* m, /* Creates a field to contain the model classification for each vertex. Which can be printed to a file using writeMesh() with dim=0. */ -void addFieldInfo(ma::Adapt* a); +void useFieldInfo(ma::Adapt* a, const std::function& funcUsingField); -void addTargetLocation(ma::Adapt* a, +apf::Field* addTargetLocation(ma::Adapt* a, const char* fieldName); void addParamCoords(ma::Adapt* a, @@ -52,7 +53,7 @@ void flagEntityAllDim(ma::Adapt* a, ma::Entity** entities, int size); -void colorEntitiesOfDimWithValues(ma::Adapt* a, +apf::Field* colorEntitiesOfDimWithValues(ma::Adapt* a, int dim, const std::vector & quals, const char* fieldName); diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 616af03b5..244b75058 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -337,40 +337,40 @@ bool FixShape::isShortEdge(Entity* tet) void FixShape::printBadShape(Entity* problemTet) { - Entity* worstTri; - Entity* problemEnts[4]; - if (isShortEdge(problemTet)) print(a->mesh->getPCU(), "Worst is short\n"); - else if (isOneLargeAngle(problemTet, worstTri)) print(a->mesh->getPCU(), "Worst is one large angle\n"); - else if (isTwoLargeAngles(problemTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); - else print(a->mesh->getPCU(), "Worst is three large angles\n"); - - ma_dbg::addFieldInfo(a); - - EntitySet bad; - bad.insert(problemTet); - EntitySet adjacent1 = getNextLayer(a, bad); - EntitySet adjacent2 = getNextLayer(a, adjacent1); - - ma_dbg::flagEntityAllDim(a, 3, "worst_tet", &problemTet, 1); - ma_dbg::flagEntity(a, 3, "worst_tet", bad); - ma_dbg::flagEntity(a, 3, "worst_tet_adj", adjacent1); - ma_dbg::flagEntity(a, 3, "worst_tet_adj2", adjacent2); - - std::vector badFaces; - Iterator* it = a->mesh->begin(3); - Entity* tet; - while ((tet = a->mesh->iterate(it))) { - if (!getFlag(a, tet, BAD_QUALITY)) continue; - Entity* faces[4]; - mesh->getDownward(tet, 2, faces); - for (Entity* face : faces) - if (isOnModelFace(mesh, face)) - badFaces.push_back(face); - } - ma_dbg::flagEntity(a, 2, "bad_surface_tets", &badFaces[0], badFaces.size()); - apf::writeVtkFiles("mesh_tets", a->mesh, 3); - apf::writeVtkFiles("mesh_faces", a->mesh, 2); - apf::writeVtkFiles("mesh_edges", a->mesh, 1); + ma_dbg::useFieldInfo(a, [this, &problemTet] { + Entity* worstTri; + Entity* problemEnts[4]; + if (isShortEdge(problemTet)) print(a->mesh->getPCU(), "Worst is short\n"); + else if (isOneLargeAngle(problemTet, worstTri)) print(a->mesh->getPCU(), "Worst is one large angle\n"); + else if (isTwoLargeAngles(problemTet, problemEnts)) print(a->mesh->getPCU(), "Worst is two large angles\n"); + else print(a->mesh->getPCU(), "Worst is three large angles\n"); + + EntitySet bad; + bad.insert(problemTet); + EntitySet adjacent1 = getNextLayer(a, bad); + EntitySet adjacent2 = getNextLayer(a, adjacent1); + + ma_dbg::flagEntityAllDim(a, 3, "worst_tet", &problemTet, 1); + ma_dbg::flagEntity(a, 3, "worst_tet", bad); + ma_dbg::flagEntity(a, 3, "worst_tet_adj", adjacent1); + ma_dbg::flagEntity(a, 3, "worst_tet_adj2", adjacent2); + + std::vector badFaces; + Iterator* it = a->mesh->begin(3); + Entity* tet; + while ((tet = a->mesh->iterate(it))) { + if (!getFlag(a, tet, BAD_QUALITY)) continue; + Entity* faces[4]; + mesh->getDownward(tet, 2, faces); + for (Entity* face : faces) + if (isOnModelFace(mesh, face)) + badFaces.push_back(face); + } + ma_dbg::flagEntity(a, 2, "bad_surface_tets", &badFaces[0], badFaces.size()); + apf::writeVtkFiles("mesh_tets", a->mesh, 3); + apf::writeVtkFiles("mesh_faces", a->mesh, 2); + apf::writeVtkFiles("mesh_edges", a->mesh, 1); + }); } void FixShape::printNumTypes() diff --git a/ma/maSnapper.cc b/ma/maSnapper.cc index b11dbd7f7..5f032d4cf 100644 --- a/ma/maSnapper.cc +++ b/ma/maSnapper.cc @@ -96,26 +96,25 @@ static void flagAndPrint(Adapt* a, Entity* ent, int dim, const char* name) #if defined(DEBUG_FPP) static void printFPP(Adapt* a, FirstProblemPlane* FPP) { - ma_dbg::addTargetLocation(a, "snap_target"); - ma_dbg::addFieldInfo(a); - - apf::writeVtkFiles("FPP_Mesh", a->mesh); - EntitySet invalid; - for (auto e : FPP->problemRegions) invalid.insert(e); - ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); - - for (auto e : FPP->commEdges) setFlag(a, e, CHECKED); - ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); - for (auto e : FPP->commEdges) clearFlag(a, e, CHECKED); - - flagAndPrint(a, FPP->vert, 0, "FPP_Vertex"); - flagAndPrint(a, FPP->problemFace, 2, "FPP_Face"); - flagAndPrint(a, FPP->problemRegion, 3, "FPP_Region"); - - EntitySet adjacent1 = getNextLayer(a, invalid); - ma_dbg::createCavityMesh(a, adjacent1, "FPP_ADJACENT_1"); - EntitySet adjacent2 = getNextLayer(a, adjacent1); - ma_dbg::createCavityMesh(a, adjacent2, "FPP_ADJACENT_2"); + ma_dbg::useFieldInfo(a, [a, FPP] { + apf::writeVtkFiles("FPP_Mesh", a->mesh); + EntitySet invalid; + for (auto e : FPP->problemRegions) invalid.insert(e); + ma_dbg::createCavityMesh(a, invalid, "FPP_Invalid"); + + for (auto e : FPP->commEdges) setFlag(a, e, CHECKED); + ma_dbg::dumpMeshWithFlag(a, 0, 1, CHECKED, "FPP_CommEdges", "FPP_CommEdges"); + for (auto e : FPP->commEdges) clearFlag(a, e, CHECKED); + + flagAndPrint(a, FPP->vert, 0, "FPP_Vertex"); + flagAndPrint(a, FPP->problemFace, 2, "FPP_Face"); + flagAndPrint(a, FPP->problemRegion, 3, "FPP_Region"); + + EntitySet adjacent1 = getNextLayer(a, invalid); + ma_dbg::createCavityMesh(a, adjacent1, "FPP_ADJACENT_1"); + EntitySet adjacent2 = getNextLayer(a, adjacent1); + ma_dbg::createCavityMesh(a, adjacent2, "FPP_ADJACENT_2"); + }); } #endif From 21261589ea6ccdea36f98ddfd73e75a5b58f3ed3 Mon Sep 17 00:00:00 2001 From: Angelyr Date: Fri, 9 Jan 2026 23:14:23 -0500 Subject: [PATCH 319/319] fix bug related to non simplex meshes --- ma/maDBG.cc | 5 +++-- ma/maFixShape.cc | 11 ++++++----- ma/maReposition.cc | 11 +++++++---- ma/maReposition.h | 2 +- test/aniso_ma_test.cc | 1 - 5 files changed, 17 insertions(+), 13 deletions(-) diff --git a/ma/maDBG.cc b/ma/maDBG.cc index 1196cbebc..67b842f61 100644 --- a/ma/maDBG.cc +++ b/ma/maDBG.cc @@ -94,7 +94,8 @@ void useFieldInfo(ma::Adapt* a, const std::function& funcUsingField) ma::getLinearQualitiesInPhysicalSpace(a->mesh, lq_no_metric); apf::Field* metricField = colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_metric, "qual_metric"); apf::Field* physicalField = colorEntitiesOfDimWithValues(a, a->mesh->getDimension(), lq_no_metric, "qual_no_metric"); - apf::Field* snapTargetField = addTargetLocation(a, "snap_target"); + apf::Field* snapTargetField; + if (a->input->shouldSnap) snapTargetField = addTargetLocation(a, "snap_target"); funcUsingField(); apf::destroyField(fieldVert); @@ -102,7 +103,7 @@ void useFieldInfo(ma::Adapt* a, const std::function& funcUsingField) apf::destroyField(fieldFace); apf::destroyField(metricField); apf::destroyField(physicalField); - apf::destroyField(snapTargetField); + if (a->input->shouldSnap) apf::destroyField(snapTargetField); } apf::Field* addTargetLocation(ma::Adapt* a, diff --git a/ma/maFixShape.cc b/ma/maFixShape.cc index 244b75058..9db1ee436 100644 --- a/ma/maFixShape.cc +++ b/ma/maFixShape.cc @@ -34,11 +34,12 @@ int markBadQualityNew(Adapt* a) Entity* e; it = m->begin(m->getDimension()); int total = 0; - while ((e = m->iterate(it))) - if (getAndCacheQuality(a, e) < a->input->goodQuality){ - setFlag(a, e, ma::BAD_QUALITY); - total++; - } + while ((e = m->iterate(it))) { + if (!isSimplex(m->getType(e))) continue; + if (getAndCacheQuality(a, e) >= a->input->goodQuality) continue; + setFlag(a, e, ma::BAD_QUALITY); + total++; + } m->end(it); return total; } diff --git a/ma/maReposition.cc b/ma/maReposition.cc index 296bc94e1..db8f7120b 100644 --- a/ma/maReposition.cc +++ b/ma/maReposition.cc @@ -19,7 +19,7 @@ RepositionVertex::RepositionVertex(Adapt* a) : adapt(a), mesh(a->mesh) { } -void RepositionVertex::init(Entity* vertex) +bool RepositionVertex::init(Entity* vertex) { this->invalid.n = 0; this->adjEdges.n = 0; @@ -27,8 +27,11 @@ void RepositionVertex::init(Entity* vertex) this->vertex = vertex; this->prevPosition = getPosition(mesh, vertex); mesh->getAdjacent(vertex, mesh->getDimension(), adjacentElements); + for (size_t i = 0; i < adjacentElements.getSize(); ++i) + if (!isSimplex(mesh->getType(adjacentElements[i]))) return false; mesh->getUp(vertex, adjEdges); clearAdjCache(); + return true; } void RepositionVertex::clearAdjCache() @@ -66,7 +69,7 @@ void RepositionVertex::findInvalid() bool RepositionVertex::move(Entity* vertex, Vector target) { - init(vertex); + if (!init(vertex)) return false; mesh->setPoint(vertex, 0, target); findInvalid(); if (invalid.n == 0) return true; @@ -114,7 +117,7 @@ double goldenSearch(const std::function &f, Vector left, Vector bool RepositionVertex::moveToImproveQuality(Entity* vertex) { if (mesh->getModelType(mesh->toModel(vertex)) < 2) return false; //TODO: remove limitation - init(vertex); + if (!init(vertex)) return false; Vector center = modelCenter(); Vector target = center + (prevPosition - center)/4; @@ -162,7 +165,7 @@ void RepositionVertex::moveToImproveShortEdges(Entity* vertex) { int dim = mesh->getModelType(mesh->toModel(vertex)); if (dim == 0) return; - init(vertex); + if (!init(vertex)) return; this->startingQuality = findWorstShape(prevPosition); Vector center = modelCenter(); diff --git a/ma/maReposition.h b/ma/maReposition.h index 6a335c88b..aaf0165e1 100644 --- a/ma/maReposition.h +++ b/ma/maReposition.h @@ -31,7 +31,7 @@ class RepositionVertex void findInvalid(); void clearAdjCache(); Vector modelCenter(); - void init(Entity* vertex); + bool init(Entity* vertex); double findWorstShape(Vector position); double findShortestEdge(Vector position); }; diff --git a/test/aniso_ma_test.cc b/test/aniso_ma_test.cc index e115d1c58..dcc4723a2 100644 --- a/test/aniso_ma_test.cc +++ b/test/aniso_ma_test.cc @@ -58,7 +58,6 @@ int main(int argc, char** argv) in->shouldRunMidParma = true; in->shouldRunPostParma = true; in->shouldRefineLayer = true; - in->goodQuality = 0.2; ma::adapt(in); m->verify(); if (logInterpolation)