mirror of
https://github.com/OrcaSlicer/OrcaSlicer.git
synced 2026-10-08 00:01:09 +00:00
HanifKoh
4895bc03b4
* Remove Unused Project Includes and Forward-Declare Where a Type Is Only Referenced Generated with include-what-you-use and applied conservatively. Only OrcaSlicer's own headers, the ones under src/ and tests/, are removed or forward-declared; standard-library and third-party includes are left alone. An include is removed only when both the Release and the Debug configuration leave it unused, never from inside a conditional block, and never from a file with platform-specific blocks, which only gain includes. Files whose only use of a header sits behind a feature or debug macro (libvgcode's OpenGL ES and marker code, the ARACHNE/TESTS_EXPORT_SVGS debug output) keep their includes. clonable_ptr.hpp gains #pragma once; it had no include guard and was only safe while Config.hpp was its sole includer. * Remove Unused Project Includes From Files With Platform-Specific Code A Linux include-what-you-use run cannot see the code inside _WIN32, __APPLE__ or __linux__ blocks, so its verdict is only taken where nothing the removed header declares, directly or through what it includes, is named inside those blocks. Removals also have to hold in both the Release and Debug configuration and never touch a line inside a conditional block. * Restore the libslic3r Precompiled Header and Direct Includes Lost in the Platform Pass The platform-file pass treated pchheader.hpp as an ordinary header and emptied it, and left GUI_Preview.hpp and 14 other files relying on headers they no longer reached directly. * Restore MainFrame.hpp in ParamsDialog.cpp for the Windows-Only Reparent Call * Include Headers That Files Reached Through Ones the Cleanup Removed * Drop Includes Duplicated by the Cleanup or by Main's Own Additions * Leave PreciseSeam.cpp as Main Has It After the Precise Seam Rework
68 lines
3.5 KiB
C++
68 lines
3.5 KiB
C++
#ifndef slic3r_ShortestPath_hpp_
|
|
#define slic3r_ShortestPath_hpp_
|
|
|
|
#include "Polyline.hpp"
|
|
#include "Point.hpp"
|
|
|
|
#include <cstddef>
|
|
#include <memory>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include "ExPolygon.hpp"
|
|
|
|
namespace Slic3r { class ExtrusionEntity; }
|
|
namespace Slic3r { class ExtrusionPath; }
|
|
namespace Slic3r { class Line; }
|
|
|
|
namespace Slic3r {
|
|
|
|
std::vector<size_t> chain_points(const Points &points, const Point *start_near = nullptr);
|
|
// Variant with post-processing (crossing removal + 2-opt) for object ordering.
|
|
std::vector<size_t> chain_points_with_postprocessing(const Points &points, const Point *start_near = nullptr);
|
|
std::vector<size_t> chain_expolygons(const ExPolygons &input_exploy);
|
|
|
|
std::vector<std::pair<size_t, bool>> chain_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point *start_near = nullptr);
|
|
void reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const std::vector<std::pair<size_t, bool>> &chain);
|
|
void chain_and_reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point &start_near);
|
|
void chain_and_reorder_extrusion_entities(std::vector<ExtrusionEntity*> &entities, const Point *start_near = nullptr);
|
|
// Each entity the chain reverses is replaced by a reversed clone that reversed_clones owns, so the originals stay unchanged.
|
|
void chain_and_reorder_extrusion_entities(std::vector<const ExtrusionEntity*> &entities, const Point &start_near,
|
|
std::vector<std::unique_ptr<ExtrusionEntity>> &reversed_clones);
|
|
|
|
std::vector<std::pair<size_t, bool>> chain_extrusion_paths(std::vector<ExtrusionPath> &extrusion_paths, const Point *start_near = nullptr);
|
|
void reorder_extrusion_paths(std::vector<ExtrusionPath> &extrusion_paths, std::vector<std::pair<size_t, bool>> &chain);
|
|
void chain_and_reorder_extrusion_paths(std::vector<ExtrusionPath> &extrusion_paths, const Point *start_near = nullptr);
|
|
|
|
Polylines chain_polylines(Polylines &&src, const Point *start_near = nullptr);
|
|
inline Polylines chain_polylines(const Polylines& src, const Point* start_near = nullptr) { Polylines tmp(src); return chain_polylines(std::move(tmp), start_near); }
|
|
template<typename T> inline void reorder_by_shortest_traverse(std::vector<T> &polylines_out)
|
|
{
|
|
Points start_point;
|
|
start_point.reserve(polylines_out.size());
|
|
for (const T& contour : polylines_out) start_point.push_back(contour.points.front());
|
|
|
|
std::vector<Points::size_type> order = chain_points(start_point);
|
|
|
|
std::vector<T> Temp = polylines_out;
|
|
polylines_out.erase(polylines_out.begin(), polylines_out.end());
|
|
|
|
for (size_t i:order) polylines_out.emplace_back(std::move(Temp[i]));
|
|
}
|
|
|
|
|
|
// Chain instances of print objects by an approximate shortest path.
|
|
// Returns pairs of PrintObject idx and instance of that PrintObject.
|
|
class Print;
|
|
struct PrintInstance;
|
|
// BBS
|
|
class PrintObject;
|
|
std::vector<const PrintInstance*> chain_print_object_instances(const std::vector<const PrintObject*>& print_objects, const Point* start_near);
|
|
std::vector<const PrintInstance*> chain_print_object_instances(const Print &print);
|
|
|
|
// Chain lines into polylines.
|
|
Polylines chain_lines(const std::vector<Line> &lines, const double point_distance_epsilon);
|
|
|
|
} // namespace Slic3r
|
|
|
|
#endif /* slic3r_ShortestPath_hpp_ */
|