#include "spring.hh"
#include "warn.hh"
-using std::vector;
-
/*
A simple spacing constraint solver. The approach:
return;
}
- force_ = std::max (force_, block_force);
+ force_ = max (force_, block_force);
for (int i = l; i < r; i++)
- springs_[i].set_blocking_force (std::max (block_force, springs_[i].blocking_force ()));
+ springs_[i].set_blocking_force (max (block_force, springs_[i].blocking_force ()));
}
Real
if (line_len_ > (1 + 1e-6) * cur_len)
programming_error ("misuse of compress_line");
vector<Spring> sorted_springs = springs_;
- sort (sorted_springs.begin (), sorted_springs.end (), std::greater<Spring> ());
+ sort (sorted_springs.begin (), sorted_springs.end (), greater<Spring> ());
/* inv_hooke is the total flexibility of currently-active springs */
double inv_hooke = 0;
void
Simple_spacer::add_spring (Spring const &sp)
{
- force_ = std::max (force_, sp.blocking_force ());
+ force_ = max (force_, sp.blocking_force ());
springs_.push_back (sp);
}
but according to the amount of whitespace that is present after the end
of the line. */
if (ragged)
- return std::max (0.0, line_len_ - configuration_length (0.0));
+ return max (0.0, line_len_ - configuration_length (0.0));
/* Use a convex compression penalty. */
Real f = force_;
force[b * breaks.size () + c] = infinity_f;
break;
}
- if (end < cols.size () && cols[end].break_permission_ == force_break)
+ if (end < cols.size () && scm_is_eq (cols[end].break_permission_, force_break))
break;
}
}