Amebis/wxWidgets
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

tried to implement division of wxLongLongs - doesn't work at all, will finish tonight

Browse Source 
git-svn-id: https://svn.wxwidgets.org/svn/wx/wxWidgets/trunk@5090 c3d73ce0-8a6f-49c7-b76d-6d57e0e08775
This commit is contained in:
Vadim Zeitlin
1999-12-23 20:15:40 +00:00
parent b49576e077
commit 2ea24d9f47
3 changed files with 119 additions and 55 deletions
Download Patch File Download Diff File Expand all files Collapse all files

124
src/common/longlong.cpp
View File

@@ -286,54 +286,22 @@ wxLongLongWx& wxLongLongWx::operator--(int)
bool wxLongLongWx::operator<(const wxLongLongWx& ll) const
{
if (m_lo < ll.m_lo)
return 1;
if (m_lo > ll.m_lo)
return 0;
if (m_hi < ll.m_hi)
return 1;
if (m_hi > ll.m_hi)
return 0;
return 0;
if ( m_hi < ll.m_hi )
return TRUE;
else if ( m_hi == ll.m_hi )
return m_lo < ll.m_lo;
else
return FALSE;
}
bool wxLongLongWx::operator>(const wxLongLongWx& ll) const
{
if (m_lo < ll.m_lo)
return 0;
if (m_lo > ll.m_lo)
return 1;
if (m_hi < ll.m_hi)
return 0;
if (m_hi > ll.m_hi)
return 1;
return 0;
}
bool wxLongLongWx::operator<=(const wxLongLongWx& ll) const
{
if (m_lo < ll.m_lo)
return 1;
if (m_lo > ll.m_lo)
return 0;
if (m_hi < ll.m_hi)
return 1;
if (m_hi > ll.m_hi)
return 0;
return 1;
}
bool wxLongLongWx::operator>=(const wxLongLongWx& ll) const
{
if (m_lo < ll.m_lo)
return 0;
if (m_lo > ll.m_lo)
return 1;
if (m_hi < ll.m_hi)
return 0;
if (m_hi > ll.m_hi)
return 1;
return 1;
if ( m_hi > ll.m_hi )
return TRUE;
else if ( m_hi == ll.m_hi )
return m_lo > ll.m_lo;
else
return FALSE;
}
// bitwise operators
@@ -435,9 +403,75 @@ void wxLongLongWx::Divide(const wxLongLongWx& divisor,
dummy += 0;
}
wxFAIL_MSG("not implemented");
// VZ: I'm writing this in a hurry and it's surely not the fastest way to
// do this - any improvements are more than welcome
// the algorithm: first find N such that 2^N * divisor is less than us,
// then substract divisor from *this - 2^N * divisor as many times as
// possible
wxLongLongWx prev = divisor;
remainder = *this;
quotient = 1l;
for ( wxLongLongWx tmp = divisor; tmp < remainder; )
{
prev = tmp;
tmp <<= 1;
if ( tmp < 0 )
{
// shifted too far
break;
}
quotient <<= 1;
}
while ( remainder >= prev )
{
remainder -= divisor;
quotient++;
}
// remainder should be in this range at the end
wxASSERT_MSG( (0l <= remainder) && (remainder < divisor.Abs()),
_T("logic error in wxLongLong division") );
}
wxLongLongWx wxLongLongWx::operator/(const wxLongLongWx& ll) const
{
wxLongLongWx quotient, remainder;
Divide(ll, quotient, remainder);
return quotient;
}
wxLongLongWx& wxLongLongWx::operator/=(const wxLongLongWx& ll)
{
wxLongLongWx quotient, remainder;
Divide(ll, quotient, remainder);
return *this = quotient;
}
wxLongLongWx wxLongLongWx::operator%(const wxLongLongWx& ll) const
{
wxLongLongWx quotient, remainder;
Divide(ll, quotient, remainder);
return remainder;
}
// ----------------------------------------------------------------------------
// misc
// ----------------------------------------------------------------------------
// temporary - just for testing
void *wxLongLongWx::asArray(void) const
{