the initial draft of wxLongLong class

git-svn-id: https://svn.wxwidgets.org/svn/wx/wxWidgets/trunk@2398 c3d73ce0-8a6f-49c7-b76d-6d57e0e08775

src/common/longlong.cpp

@@ -0,0 +1,469 @@
+/////////////////////////////////////////////////////////////////////////////
+// Name:        wx/longlong.cpp
+// Purpose:     implementation of wxLongLongNative
+// Author:      Jeffrey C. Ollie <jeff@ollie.clive.ia.us>, Vadim Zeitlin
+// Remarks:     this class is not public in wxWindows 2.0! It is intentionally
+//              not documented and is for private use only.
+// Modified by:
+// Created:     10.02.99
+// RCS-ID:      $Id$
+// Copyright:   (c) 1998 Vadim Zeitlin <zeitlin@dptmaths.ens-cachan.fr>
+// Licence:     wxWindows license
+/////////////////////////////////////////////////////////////////////////////
+
+// ============================================================================
+// headers
+// ============================================================================
+
+#ifdef __GNUG__
+    #pragma implementation "longlong.h"
+#endif
+
+#include "wx/wxprec.h"
+
+#ifdef __BORLANDC__
+    #pragma hdrstop
+#endif
+
+#include "wx/longlong.h"
+
+#include <memory.h>     // for memset()
+
+// ============================================================================
+// implementation
+// ============================================================================
+
+#if wxUSE_LONGLONG_NATIVE
+
+// ----------------------------------------------------------------------------
+// misc
+// ----------------------------------------------------------------------------
+
+void *wxLongLongNative::asArray(void) const
+{
+    static unsigned char temp[8];
+
+    temp[0] = (m_ll >> 56) & 0xFF;
+    temp[1] = (m_ll >> 48) & 0xFF;
+    temp[2] = (m_ll >> 40) & 0xFF;
+    temp[3] = (m_ll >> 32) & 0xFF;
+    temp[4] = (m_ll >> 24) & 0xFF;
+    temp[5] = (m_ll >> 16) & 0xFF;
+    temp[6] = (m_ll >> 8)  & 0xFF;
+    temp[7] = (m_ll >> 0)  & 0xFF;
+
+    return temp;
+}
+
+// input/output
+std::ostream& operator<< (std::ostream& o, const wxLongLongNative& ll)
+{
+    char result[65];
+
+    memset(result, 'A', 64);
+
+    result[64] = '\0';
+
+    for (int i = 0; i < 64; i++)
+    {
+        result[63 - i] = '0' + (char) ((ll.m_ll >> i) & 1);
+    }
+
+    return o << result;
+}
+
+#endif // wxUSE_LONGLONG_NATIVE
+
+#if wxUSE_LONGLONG_WX
+
+wxLongLongWx wxLongLongWx::operator<<(int shift) const
+{
+    if (shift == 0)
+        return *this;
+
+    if (shift < 32)
+        return wxLongLongWx((m_hi << shift) | (m_lo >> (32 - shift)),
+                             m_lo << shift);
+    else
+        return wxLongLongWx(m_lo << (shift - 32),
+                            0);
+}
+
+wxLongLongWx& wxLongLongWx::operator<<=(int shift)
+{
+    if (shift == 0)
+        return *this;
+
+    if (shift < 32)
+    {
+        m_hi <<= shift;
+        m_hi |= m_lo >> (32 - shift);
+        m_lo <<= shift;
+    }
+    else
+    {
+        m_hi = m_lo << (shift - 32);
+        m_lo = 0;
+    }
+
+    return *this;
+}
+
+wxLongLongWx wxLongLongWx::operator>>(int shift) const
+{
+    if (shift == 0)
+        return *this;
+
+    if (shift < 32)
+        return wxLongLongWx(m_hi >> shift,
+                          (m_lo >> shift) | (m_hi << (32 - shift)));
+    else
+        return wxLongLongWx((m_hi < 0 ? -1l : 0),
+                          m_hi >> (shift - 32));
+}
+
+wxLongLongWx& wxLongLongWx::operator>>=(int shift)
+{
+    if (shift == 0)
+        return *this;
+
+    if (shift < 32)
+    {
+        m_lo >>= shift;
+        m_lo |= m_hi << (32 - shift);
+        m_hi >>= shift;
+    }
+    else
+    {
+        m_lo = m_hi >> (shift - 32);
+        m_hi = (m_hi < 0 ? -1L : 0);
+    }
+
+    return *this;
+}
+
+wxLongLongWx wxLongLongWx::operator+(const wxLongLongWx& ll) const
+{
+    wxLongLongWx temp;
+
+    temp.m_lo = m_lo + ll.m_lo;
+    temp.m_hi = m_hi + ll.m_hi;
+    if ((temp.m_lo < m_lo) || (temp.m_lo < ll.m_lo))
+        temp.m_hi++;
+
+    return temp;
+}
+
+wxLongLongWx wxLongLongWx::operator+(long l) const
+{
+    wxLongLongWx temp;
+
+    temp.m_lo = m_lo + l;
+
+    if (l < 0)
+        temp.m_hi += -1l;
+
+    if ((temp.m_lo < m_lo) || (temp.m_lo < (unsigned long)l))
+        temp.m_hi++;
+
+    return temp;
+}
+
+wxLongLongWx& wxLongLongWx::operator+=(const wxLongLongWx& ll)
+{
+    unsigned long previous = m_lo;
+
+    m_lo += ll.m_lo;
+    m_hi += ll.m_hi;
+
+    if ((m_lo < previous) || (m_lo < ll.m_lo))
+        m_hi++;
+
+    return *this;
+}
+
+wxLongLongWx& wxLongLongWx::operator+=(long l)
+{
+    unsigned long previous = m_lo;
+
+    m_lo += l;
+    if (l < 0)
+        m_hi += -1l;
+
+    if ((m_lo < previous) || (m_lo < (unsigned long)l))
+        m_hi++;
+
+    return *this;
+}
+
+// pre increment
+wxLongLongWx& wxLongLongWx::operator++()
+{
+    m_lo++;
+    if (m_lo == 0)
+        m_hi++;
+
+    return *this;
+}
+
+// post increment
+wxLongLongWx& wxLongLongWx::operator++(int)
+{
+    m_lo++;
+    if (m_lo == 0)
+        m_hi++;
+
+    return *this;
+}
+
+// negation
+wxLongLongWx wxLongLongWx::operator-() const
+{
+    wxLongLongWx temp(~m_hi, ~m_lo);
+
+    temp.m_lo++;
+    if (temp.m_lo == 0)
+        temp.m_hi++;
+
+    return temp;
+}
+
+// subtraction
+
+wxLongLongWx wxLongLongWx::operator-(const wxLongLongWx& ll) const
+{
+    wxLongLongWx temp;
+
+    temp.m_lo = m_lo - ll.m_lo;
+    temp.m_hi = m_hi - ll.m_hi;
+
+    if (m_lo < ll.m_lo)
+        temp.m_hi--;
+
+    return temp;
+}
+
+wxLongLongWx& wxLongLongWx::operator-=(const wxLongLongWx& ll)
+{
+    unsigned long previous = m_lo;
+
+    m_lo -= ll.m_lo;
+    m_hi -= ll.m_hi;
+
+    if (previous < ll.m_lo)
+        m_hi--;
+
+    return *this;;
+}
+
+// pre decrement
+wxLongLongWx& wxLongLongWx::operator--()
+{
+    m_lo--;
+    if (m_lo == 0xFFFFFFFF)
+        m_hi--;
+
+    return *this;
+}
+
+// post decrement
+wxLongLongWx& wxLongLongWx::operator--(int)
+{
+    m_lo--;
+    if (m_lo == 0xFFFFFFFF)
+        m_hi--;
+
+    return *this;
+}
+
+// comparison operators
+
+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;
+}
+
+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;
+}
+
+// bitwise operators
+
+wxLongLongWx wxLongLongWx::operator&(const wxLongLongWx& ll) const
+{
+    return wxLongLongWx(m_hi & ll.m_hi, m_lo & ll.m_lo);
+}
+
+wxLongLongWx wxLongLongWx::operator|(const wxLongLongWx& ll) const
+{
+    return wxLongLongWx(m_hi | ll.m_hi, m_lo | ll.m_lo);
+}
+
+wxLongLongWx wxLongLongWx::operator^(const wxLongLongWx& ll) const
+{
+    return wxLongLongWx(m_hi ^ ll.m_hi, m_lo ^ ll.m_lo);
+}
+
+wxLongLongWx& wxLongLongWx::operator&=(const wxLongLongWx& ll)
+{
+    m_lo &= ll.m_lo;
+    m_hi &= ll.m_hi;
+
+    return *this;
+}
+
+wxLongLongWx& wxLongLongWx::operator|=(const wxLongLongWx& ll)
+{
+    m_lo |= ll.m_lo;
+    m_hi |= ll.m_hi;
+
+    return *this;
+}
+
+wxLongLongWx& wxLongLongWx::operator^=(const wxLongLongWx& ll)
+{
+    m_lo ^= ll.m_lo;
+    m_hi ^= ll.m_hi;
+
+    return *this;
+}
+
+wxLongLongWx wxLongLongWx::operator~() const
+{
+    return wxLongLongWx(~m_hi, ~m_lo);
+}
+
+// multiplication
+
+wxLongLongWx wxLongLongWx::operator*(const wxLongLongWx& ll) const
+{
+    wxLongLongWx t(m_hi, m_lo);
+    wxLongLongWx q(ll.m_hi, ll.m_lo);
+    wxLongLongWx p;
+    int counter = 0;
+
+    do
+    {
+        if ((q.m_lo & 1) != 0)
+              p += t;
+        q >>= 1;
+        t <<= 1;
+        counter++;
+      }
+      while ((counter < 64) && ((q.m_hi != 0) || (q.m_lo != 0)));
+    return p;
+}
+
+wxLongLongWx& wxLongLongWx::operator*=(const wxLongLongWx& ll)
+{
+    wxLongLongWx t(m_hi, m_lo);
+    wxLongLongWx q(ll.m_hi, ll.m_lo);
+    int counter = 0;
+
+    do
+    {
+        if ((q.m_lo & 1) != 0)
+              *this += t;
+        q >>= 1;
+        t <<= 1;
+        counter++;
+      }
+      while ((counter < 64) && ((q.m_hi != 0) || (q.m_lo != 0)));
+    return *this;
+}
+
+// division
+
+void wxLongLongWx::Divide(const wxLongLongWx& divisor, wxLongLongWx& quotient, wxLongLongWx& remainder) const
+{
+    if ((divisor.m_lo == 0) && (divisor.m_hi == 0))
+    {
+        // provoke division by zero error and silence the compilers warnings
+        // about an expression without effect and unused variable
+        long dummy = divisor.m_lo/divisor.m_hi;
+        dummy += 0;
+    }
+
+    wxFAIL_MSG("not implemented");
+}
+
+// temporary - just for testing
+void *wxLongLongWx::asArray(void) const
+{
+    static unsigned char temp[8];
+
+    temp[0] = (m_hi >> 24) & 0xFF;
+    temp[1] = (m_hi >> 16) & 0xFF;
+    temp[2] = (m_hi >> 8)  & 0xFF;
+    temp[3] = (m_hi >> 0)  & 0xFF;
+    temp[4] = (m_lo >> 24) & 0xFF;
+    temp[5] = (m_lo >> 16) & 0xFF;
+    temp[6] = (m_lo >> 8)  & 0xFF;
+    temp[7] = (m_lo >> 0)  & 0xFF;
+
+    return temp;
+}
+
+// input/output
+
+std::ostream& operator<< (std::ostream& o, const wxLongLongWx& ll)
+{
+    char result[65];
+
+    memset(result, 'A', 64);
+
+    result[64] = '\0';
+
+    for (int i = 0; i < 32; i++)
+    {
+        result[31 - i] = (char) ('0' + (int) ((ll.m_hi >> i) & 1));
+        result[63 - i] = (char) ('0' + (int) ((ll.m_lo >> i) & 1));
+    }
+
+    return o << result;
+}
+#endif wxUSE_LONGLONG_WX
+