Ticket #44585: patch-bitcoin.diff

File patch-bitcoin.diff, 2.4 KB (added by anddam (Andrea D'Amore), 10 years ago)
  • Portfile

     
    55
    66name                bitcoin
    77categories          finance crypto
    8 version             0.9.1
     8version             0.9.2.1
    99platforms           darwin
    1010license             MIT
    11 maintainers         easieste openmaintainer yopmail.com:sami.laine
     11maintainers         easieste yopmail.com:sami.laine openmaintainer
    1212description         client user interface for a peer-to-peer digital currency
    1313long_description    Bitcoin is a peer-to-peer digital currency. By peer-to-peer,  \
    1414                    we mean that there is no central authority to issue \
     
    2020master_sites        https://github.com/[string repeat "$name/" 2]archive/
    2121distname            v${version}
    2222worksrcdir          ${name}-${version}
    23 checksums           rmd160  f331dd64675b989f281caf5846ad89a9b034a5b2 \
    24                     sha256  bf5021a426b5e38a741a5294a0ceb22daa74cda11c6dc0478c4aa48c55fdccb3
     23checksums           rmd160  02f75852139d1db142fc2cd07b0299769b0aac04 \
     24                    sha256  7cadbadd90485b7302b86ce041db576aad650f6c621d3a552d09e7231d3fcfd8
    2525
    2626depends_build       port:pkgconfig \
    2727                    port:autoconf \
  • files/patch_src_src_serialize_h.diff

     
    1 --- src/serialize.h.orig        2014-02-13 19:17:19.000000000 +0100
    2 +++ src/serialize.h     2014-02-13 19:19:00.000000000 +0100
    3 @@ -895,19 +895,6 @@
    4      iterator insert(iterator it, const char& x=char()) { return vch.insert(it, x); }
    5      void insert(iterator it, size_type n, const char& x) { vch.insert(it, n, x); }
    6  
    7 -    void insert(iterator it, const_iterator first, const_iterator last)
    8 -    {
    9 -        assert(last - first >= 0);
    10 -        if (it == vch.begin() + nReadPos && (unsigned int)(last - first) <= nReadPos)
    11 -        {
    12 -            // special case for inserting at the front when there's room
    13 -            nReadPos -= (last - first);
    14 -            memcpy(&vch[nReadPos], &first[0], last - first);
    15 -        }
    16 -        else
    17 -            vch.insert(it, first, last);
    18 -    }
    19 -
    20      void insert(iterator it, std::vector<char>::const_iterator first, std::vector<char>::const_iterator last)
    21      {
    22          assert(last - first >= 0);