Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
DPF - Optimal and Fair Decision Trees
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Deploy
Releases
Package Registry
Model registry
Operate
Terraform modules
Monitor
Incidents
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Koos van der Linden
DPF - Optimal and Fair Decision Trees
Commits
7ed1db98
Commit
7ed1db98
authored
1 year ago
by
Koos van der Linden
Browse files
Options
Downloads
Patches
Plain Diff
bug fix gcc build
parent
8efa9639
Branches
compathelper/new_version/2023-06-05-00-19-24-936-02320700798
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/solver/solver_result.cpp
+1
-1
1 addition, 1 deletion
src/solver/solver_result.cpp
with
1 addition
and
1 deletion
src/solver/solver_result.cpp
+
1
−
1
View file @
7ed1db98
...
...
@@ -3,7 +3,7 @@
namespace
DPF
{
const
std
::
vector
<
InternalNodeDescription
>
SolverResult
::
GetSolutionsInOrder
()
const
{
std
::
vector
<
InternalNodeDescription
>
solutions
(
solutions
->
solutions
.
begin
(),
solutions
->
solutions
.
end
());
std
::
vector
<
InternalNodeDescription
>
solutions
(
this
->
solutions
->
solutions
.
begin
(),
this
->
solutions
->
solutions
.
end
());
std
::
sort
(
solutions
.
begin
(),
solutions
.
end
(),
[](
const
InternalNodeDescription
&
n1
,
const
InternalNodeDescription
&
n2
)
{
return
n1
.
GetPartialSolution
().
GetMisclassifications
()
<
n2
.
GetPartialSolution
().
GetMisclassifications
();
});
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment