mirror of
https://github.com/OrcaSlicer/OrcaSlicer.git
synced 2026-05-17 02:22:17 +00:00
ENH: refactor filament group
1.Seperate min flush max flow solver 2.Add "best match" mode for filament map 3.Refine code strucuture jira:NONE Signed-off-by: xun.zhang <xun.zhang@bambulab.com> Change-Id: If4ba09a0320366b862cec59f8ed1f22c392c53b9 (cherry picked from commit 414a2105c9d77bbf7771bdf3fdec40d96dc949c2)
This commit is contained in:
xun.zhang
167
src/libslic3r/FilamentGroupUtils.cpp
Normal file
167
src/libslic3r/FilamentGroupUtils.cpp
Normal file
@@ -0,0 +1,167 @@
|
||||
#include "FilamentGroupUtils.hpp"
|
||||
|
||||
|
||||
namespace Slic3r
|
||||
{
|
||||
namespace FilamentGroupUtils
|
||||
{
|
||||
Color::Color(const std::string& hexstr) {
|
||||
if (hexstr.empty() || (hexstr.length() != 9 && hexstr.length() != 7) || hexstr[0] != '#')
|
||||
{
|
||||
assert(false);
|
||||
r = 0, g = 0, b = 0, a = 255;
|
||||
return;
|
||||
}
|
||||
|
||||
auto hexToByte = [](const std::string& hex)->unsigned char
|
||||
{
|
||||
unsigned int byte;
|
||||
std::istringstream(hex) >> std::hex >> byte;
|
||||
return static_cast<unsigned char>(byte);
|
||||
};
|
||||
r = hexToByte(hexstr.substr(1, 2));
|
||||
g = hexToByte(hexstr.substr(3, 2));
|
||||
b = hexToByte(hexstr.substr(5, 2));
|
||||
if (hexstr.size() == 9)
|
||||
a = hexToByte(hexstr.substr(7, 2));
|
||||
}
|
||||
|
||||
// TODO: add explanation
|
||||
std::vector<int> calc_max_group_size(const std::vector<std::map<int, int>>& ams_counts, bool ignore_ext_filament) {
|
||||
// add default value to 2
|
||||
std::vector<int>group_size(2, 0);
|
||||
for (size_t idx = 0; idx < ams_counts.size(); ++idx) {
|
||||
const auto& ams_count = ams_counts[idx];
|
||||
for (auto iter = ams_count.begin(); iter != ams_count.end(); ++iter) {
|
||||
group_size[idx] += iter->first * iter->second;
|
||||
}
|
||||
}
|
||||
|
||||
for (size_t idx = 0; idx < group_size.size(); ++idx) {
|
||||
if (!ignore_ext_filament && group_size[idx] == 0)
|
||||
group_size[idx] = 1;
|
||||
}
|
||||
return group_size;
|
||||
}
|
||||
|
||||
|
||||
std::vector<std::vector<FilamentInfo>> build_machine_filaments(const std::vector<std::vector<DynamicPrintConfig>>& filament_configs)
|
||||
{
|
||||
// defualt size set to 2
|
||||
std::vector<std::vector<FilamentInfo>> machine_filaments(2);
|
||||
for (size_t idx = 0; idx < filament_configs.size(); ++idx) {
|
||||
auto& arr = filament_configs[idx];
|
||||
for (auto& item : arr) {
|
||||
FilamentInfo temp;
|
||||
temp.color = Color(item.option<ConfigOptionStrings>("filament_colour")->get_at(0));
|
||||
temp.type = item.option<ConfigOptionStrings>("filament_type")->get_at(0);
|
||||
temp.extruder_id = idx;
|
||||
temp.is_extended = item.option<ConfigOptionStrings>("tray_name")->get_at(0) == "Ext"; // hard-coded ext flag
|
||||
machine_filaments[idx].emplace_back(std::move(temp));
|
||||
}
|
||||
}
|
||||
return machine_filaments;
|
||||
}
|
||||
|
||||
bool collect_unprintable_limits(const std::vector<std::set<int>>& physical_unprintables, const std::vector<std::set<int>>& geometric_unprintables, std::vector<std::set<int>>& unprintable_limits)
|
||||
{
|
||||
unprintable_limits.clear();
|
||||
unprintable_limits.resize(2);
|
||||
// resize unprintables to 2
|
||||
auto resized_physical_unprintables = physical_unprintables;
|
||||
resized_physical_unprintables.resize(2);
|
||||
auto resized_geometric_unprintables = geometric_unprintables;
|
||||
resized_geometric_unprintables.resize(2);
|
||||
|
||||
bool conflict = false;
|
||||
conflict |= remove_intersection(resized_physical_unprintables[0], resized_physical_unprintables[1]);
|
||||
conflict |= remove_intersection(resized_geometric_unprintables[0], resized_geometric_unprintables[1]);
|
||||
|
||||
std::map<int, int>filament_unprintable_exts;
|
||||
for (auto& ext_unprintables : { resized_physical_unprintables,resized_geometric_unprintables }) {
|
||||
for (int eid = 0; eid < ext_unprintables.size(); ++eid) {
|
||||
for (int fid : ext_unprintables[eid]) {
|
||||
if (auto iter = filament_unprintable_exts.find(fid); iter != filament_unprintable_exts.end() && iter->second != eid)
|
||||
conflict = true;
|
||||
else
|
||||
filament_unprintable_exts[fid] = eid;
|
||||
}
|
||||
}
|
||||
}
|
||||
for (auto& elem : filament_unprintable_exts)
|
||||
unprintable_limits[elem.second].insert(elem.first);
|
||||
|
||||
return !conflict;
|
||||
}
|
||||
|
||||
bool remove_intersection(std::set<int>& a, std::set<int>& b) {
|
||||
std::vector<int>intersection;
|
||||
std::set_intersection(a.begin(), a.end(), b.begin(), b.end(), std::back_inserter(intersection));
|
||||
bool have_intersection = !intersection.empty();
|
||||
for (auto& item : intersection) {
|
||||
a.erase(item);
|
||||
b.erase(item);
|
||||
}
|
||||
return have_intersection;
|
||||
}
|
||||
|
||||
void extract_indices(const std::vector<unsigned int>& used_filaments, const std::vector<std::set<int>>& unprintable_elems, std::vector<std::set<int>>& unprintable_idxs)
|
||||
{
|
||||
std::vector<std::set<int>>(unprintable_elems.size()).swap(unprintable_idxs);
|
||||
for (size_t gid = 0; gid < unprintable_elems.size(); ++gid) {
|
||||
for (auto& f : unprintable_elems[gid]) {
|
||||
auto iter = std::find(used_filaments.begin(), used_filaments.end(), (unsigned)f);
|
||||
if (iter != used_filaments.end())
|
||||
unprintable_idxs[gid].insert(iter - used_filaments.begin());
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void extract_unprintable_limit_indices(const std::vector<std::set<int>>& unprintable_elems, const std::vector<unsigned int>& used_filaments, std::map<int, int>& unplaceable_limits)
|
||||
{
|
||||
unplaceable_limits.clear();
|
||||
// map the unprintable filaments to idx of used filaments , if not used ,just ignore
|
||||
std::vector<std::set<int>> unprintable_idxs;
|
||||
extract_indices(used_filaments, unprintable_elems, unprintable_idxs);
|
||||
if (unprintable_idxs.size() > 1)
|
||||
remove_intersection(unprintable_idxs[0], unprintable_idxs[1]);
|
||||
|
||||
for (size_t idx = 0; idx < unprintable_idxs.size(); ++idx) {
|
||||
for (auto f : unprintable_idxs[idx])
|
||||
if (unplaceable_limits.count(f) == 0)
|
||||
unplaceable_limits[f] = idx;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void extract_unprintable_limit_indices(const std::vector<std::set<int>>& unprintable_elems, const std::vector<unsigned int>& used_filaments, std::unordered_map<int, std::vector<int>>& unplaceable_limits)
|
||||
{
|
||||
unplaceable_limits.clear();
|
||||
std::vector<std::set<int>>unprintable_idxs;
|
||||
// map the unprintable filaments to idx of used filaments , if not used ,just ignore
|
||||
extract_indices(used_filaments, unprintable_elems, unprintable_idxs);
|
||||
// remove elems that cannot be printed in both extruder
|
||||
if (unprintable_idxs.size() > 1)
|
||||
remove_intersection(unprintable_idxs[0], unprintable_idxs[1]);
|
||||
|
||||
for (size_t group_id = 0; group_id < unprintable_idxs.size(); ++group_id)
|
||||
for (auto f : unprintable_idxs[group_id])
|
||||
unplaceable_limits[f].emplace_back(group_id);
|
||||
|
||||
for (auto& elem : unplaceable_limits)
|
||||
sort_remove_duplicates(elem.second);
|
||||
}
|
||||
|
||||
bool check_printable(const std::vector<std::set<int>>& groups, const std::map<int,int>& unprintable)
|
||||
{
|
||||
for (size_t i = 0; i < groups.size(); ++i) {
|
||||
auto& group = groups[i];
|
||||
for (auto& filament : group) {
|
||||
if (auto iter = unprintable.find(filament); iter != unprintable.end() && i == iter->second)
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user