UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-01-19 00:37:25 +01:00
Code Issues Packages Projects Releases Wiki Activity

[poincare/unit] Coding style

Browse Source
This commit is contained in:
Ruben Dashyan
2020-02-12 11:09:30 +01:00
committed by Émilie Feral
parent f01f91d000
commit 157d74c0da
1 changed files with 16 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
poincare/src/unit.cpp
View File

@@ -55,22 +55,23 @@ int UnitNode::Representative::serialize(char * buffer, int bufferSize, const Pre
}
const UnitNode::Prefix * UnitNode::Representative::bestPrefixForValue(double & value, const int exponent) const {
const Prefix * bestPre = &Unit::EmptyPrefix;
if (isPrefixable()) {
unsigned int diff = -1;
/* Find the 'Prefix' with the most adequate 'exponent' for the order of
* magnitude of 'value'.
*/
const int orderOfMagnitude = IEEE754<double>::exponentBase10(std::fabs(value));
for (const Prefix * pre = m_outputPrefixes; pre < m_outputPrefixesUpperBound; pre++) {
unsigned int newDiff = absInt(orderOfMagnitude - pre->exponent() * exponent);
if (newDiff < diff) {
diff = newDiff;
bestPre = pre;
}
}
value *= std::pow(10.0, -bestPre->exponent() * exponent);
if (!isPrefixable()) {
return &Unit::EmptyPrefix;
}
const Prefix * bestPre = nullptr;
unsigned int diff = -1;
/* Find the 'Prefix' with the most adequate 'exponent' for the order of
* magnitude of 'value'.
*/
const int orderOfMagnitude = IEEE754<double>::exponentBase10(std::fabs(value));
for (const Prefix * pre = m_outputPrefixes; pre < m_outputPrefixesUpperBound; pre++) {
unsigned int newDiff = absInt(orderOfMagnitude - pre->exponent() * exponent);
if (newDiff < diff) {
diff = newDiff;
bestPre = pre;
}
}
value *= std::pow(10.0, -bestPre->exponent() * exponent);
return bestPre;
}