react-native-update 10.28.10 → 10.29.0-beta.0

package/harmony/src/main/cpp/HDiffPatch/libHDiffPatch/HDiff/private_diff/pack_uint.h

@@ -1,115 +0,0 @@
-//pack_uint.h
-//
-/*
- The MIT License (MIT)
- Copyright (c) 2012-2017 HouSisong
-
- Permission is hereby granted, free of charge, to any person
- obtaining a copy of this software and associated documentation
- files (the "Software"), to deal in the Software without
- restriction, including without limitation the rights to use,
- copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the
- Software is furnished to do so, subject to the following
- conditions:
-
- The above copyright notice and this permission notice shall be
- included in all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
- OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
- HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
- OTHER DEALINGS IN THE SOFTWARE.
-*/
-
-#ifndef __PACK_UINT_H_
-#define __PACK_UINT_H_
-
-#include <vector>
-#include "../../HPatch/patch_types.h" //hpatch_packUIntWithTag
-#include <stdexcept>  //std::runtime_error
-#include <string>
-namespace hdiff_private{
-
-template<class _UInt>
-inline static void packUIntWithTag(std::vector<unsigned char>& out_code,_UInt uValue,
-                                   int highTag,const int kTagBit){
-    unsigned char  codeBuf[hpatch_kMaxPackedUIntBytes];
-    unsigned char* codeEnd=codeBuf;
-    if (!hpatch_packUIntWithTag(&codeEnd,codeBuf+hpatch_kMaxPackedUIntBytes,uValue,highTag,kTagBit))
-        throw std::runtime_error("packUIntWithTag<_UInt>() hpatch_packUIntWithTag() error!");
-    out_code.insert(out_code.end(),codeBuf,codeEnd);
-}
-
-template<class _UInt>
-inline static void packUInt(std::vector<unsigned char>& out_code,_UInt uValue){
-    packUIntWithTag(out_code,uValue,0,0);
-}
-
-inline static void pushBack(std::vector<unsigned char>& out_buf,
-                            const unsigned char* data,const unsigned char* data_end){
-    out_buf.insert(out_buf.end(),data,data_end);
-}
-inline static void pushBack(std::vector<unsigned char>& out_buf,
-                            const unsigned char* data,size_t dataSize){
-    pushBack(out_buf,data,data+dataSize);
-}
-inline static void pushBack(std::vector<unsigned char>& out_buf,const std::vector<unsigned char>& data){
-    out_buf.insert(out_buf.end(),data.begin(),data.end());
-}
-    
-    
-template <class TUInt> inline static
-void pushUInt(std::vector<unsigned char>& out_buf,TUInt v){
-    unsigned char buf[sizeof(TUInt)];
-    for (size_t i=0; i<sizeof(TUInt); ++i) {
-        buf[i]=(unsigned char)v;
-        if (sizeof(TUInt)>1) v>>=8;
-    }
-    pushBack(out_buf,buf,sizeof(TUInt));
-}
-
-inline static
-void pushUInt(std::vector<unsigned char>& out_buf,unsigned char v){
-    out_buf.insert(out_buf.end(),v);
-}
-
-    
-inline static void pushCStr(std::vector<unsigned char>& out_buf,const char* cstr){
-    const unsigned char* data=(const unsigned char*)cstr;
-    pushBack(out_buf,data,data+strlen(cstr));
-}
-inline static void pushString(std::vector<unsigned char>& out_buf,const std::string& str){
-    const unsigned char* data=(const unsigned char*)str.c_str();
-    pushBack(out_buf,data,data+str.size());
-}
-    
-struct TPlaceholder{
-    hpatch_StreamPos_t pos;
-    hpatch_StreamPos_t pos_end;
-    inline TPlaceholder(hpatch_StreamPos_t _pos,hpatch_StreamPos_t _pos_end)
-    :pos(_pos),pos_end(_pos_end){ assert(_pos<=_pos_end); }
-    inline hpatch_StreamPos_t size()const{ return pos_end-pos; }
-};
-
-hpatch_inline static
-void packUInt_fixSize(unsigned char* out_code,unsigned char* out_code_fixEnd,
-                      hpatch_StreamPos_t uValue){
-    if (out_code>=out_code_fixEnd)
-        throw std::runtime_error("packUInt_fixSize() out_code size error!");
-    --out_code_fixEnd;
-    *out_code_fixEnd=uValue&((1<<7)-1); uValue>>=7;
-    while (out_code<out_code_fixEnd) {
-        --out_code_fixEnd;
-        *out_code_fixEnd=(uValue&((1<<7)-1)) | (1<<7);  uValue>>=7;
-    }
-    if (uValue!=0)
-        throw std::runtime_error("packUInt_fixSize() out_code too small error!");
-}
-
-}//namespace hdiff_private
-#endif //__PACK_UINT_H_

package/harmony/src/main/cpp/HDiffPatch/libHDiffPatch/HDiff/private_diff/suffix_string.cpp

@@ -1,342 +0,0 @@
-//suffix_string.cpp
-//
-/*
- The MIT License (MIT)
- Copyright (c) 2012-2017 HouSisong
- 
- Permission is hereby granted, free of charge, to any person
- obtaining a copy of this software and associated documentation
- files (the "Software"), to deal in the Software without
- restriction, including without limitation the rights to use,
- copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the
- Software is furnished to do so, subject to the following
- conditions:
- 
- The above copyright notice and this permission notice shall be
- included in all copies of the Software.
- 
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
- OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
- HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
- OTHER DEALINGS IN THE SOFTWARE.
-*/
-
-#include "suffix_string.h"
-#include <assert.h>
-#include <string.h> //memset
-#include <stdexcept> //std::runtime_error
-//排序方法选择.
-#ifndef _SA_SORTBY
-#define _SA_SORTBY
-//#  define _SA_SORTBY_STD_SORT
-//#  define _SA_SORTBY_SAIS
-#   define _SA_SORTBY_DIVSUFSORT
-#endif//_SA_SORTBY
-
-//匹配查找方法选择,是否用std::lower_bound,否则用自定义的实现.
-//#define _SA_MATCHBY_STD_LOWER_BOUND
-
-#if (defined _SA_SORTBY_STD_SORT) || (defined _SA_MATCHBY_STD_LOWER_BOUND)
-    #include <algorithm> //sort,lower_bound
-#endif
-#ifdef _SA_SORTBY_SAIS
-    #include "sais.hxx"
-#endif
-#ifdef _SA_SORTBY_DIVSUFSORT
-    #include "libdivsufsort/divsufsort.h"
-    #include "libdivsufsort/divsufsort64.h"
-#endif
-
-namespace hdiff_private{
-
-namespace {
-    typedef TSuffixString::TInt   TInt;
-    typedef TSuffixString::TInt32 TInt32;
-    typedef TSuffixString::TChar  TChar;
-
-    static bool getStringIsLess(const TChar* str0,const TChar* str0End,
-                                const TChar* str1,const TChar* str1End){
-        TInt L0=(TInt)(str0End-str0);
-        TInt L1=(TInt)(str1End-str1);
-    #ifdef _SA_SORTBY_STD_SORT
-        const int kMaxCmpLength=1024*4; //警告:这是一个特殊的处理手段,用以避免_suffixString_create在使用std::sort时
-                                        //  某些情况退化到O(n*n)复杂度(运行时间无法接受),设置最大比较长度从而控制算法在
-                                        //  O(kMaxCmpLength*n)复杂度以内,这时排序的结果并不是标准的后缀数组;
-        if (L0>kMaxCmpLength) L0=kMaxCmpLength;
-        if (L1>kMaxCmpLength) L1=kMaxCmpLength;
-    #endif
-        TInt LMin;
-        if (L0<L1) LMin=L0; else LMin=L1;
-        for (int i=0; i<LMin; ++i){
-            TInt sub=str0[i]-str1[i];
-            if (!sub) continue;
-            return sub<0;
-        }
-        return (L0<L1);
-    }
-
-    struct StringToken{
-        const TChar* begin;
-        const TChar* end;
-        inline explicit StringToken(const TChar* _begin,const TChar* _end):begin(_begin),end(_end){}
-    };
-
-    class TSuffixString_compare{
-    public:
-        inline TSuffixString_compare(const TChar* begin,const TChar* end):m_begin(begin),m_end(end){}
-        inline bool operator()(const TInt s0,const StringToken& s1)const{
-            return getStringIsLess(m_begin+s0,m_end,s1.begin,s1.end);
-        }
-        inline bool operator()(const StringToken& s0,const TInt s1)const{
-            return getStringIsLess(s0.begin,s0.end,m_begin+s1,m_end);
-        }
-        inline bool operator()(const TInt s0,const TInt s1)const{
-            return getStringIsLess(m_begin+s0,m_end,m_begin+s1,m_end);
-        }
-    private:
-        const TChar* m_begin;
-        const TChar* m_end;
-    };
-
-    template<class TSAInt>
-    static void _suffixString_create(const TChar* src,const TChar* src_end,std::vector<TSAInt>& out_sstring){
-        TSAInt size=(TSAInt)(src_end-src);
-        if (size<0)
-            throw std::runtime_error("suffixString_create() error.");
-        out_sstring.resize(size);
-        if (size<=0) return;
-    #ifdef _SA_SORTBY_STD_SORT
-        for (TSAInt i=0;i<size;++i)
-            out_sstring[i]=i;
-        int rt=0;
-        try {
-            std::sort<TSAInt*,const TSuffixString_compare&>(&out_sstring[0],&out_sstring[0]+size,
-                                                            TSuffixString_compare(src,src_end));
-        } catch (...) {
-            rt=-1;
-        }
-    #endif
-    #ifdef _SA_SORTBY_SAIS
-        TSAInt rt=saisxx(src,&out_sstring[0],size);
-    #endif
-    #ifdef _SA_SORTBY_DIVSUFSORT
-        saint_t rt=-1;
-        if (sizeof(TSAInt)==8)
-            rt=divsufsort64(src,(saidx64_t*)&out_sstring[0],(saidx64_t)size);
-        else if (sizeof(TSAInt)==4)
-            rt=divsufsort(src,(saidx_t*)&out_sstring[0],(saidx_t)size);
-    #endif
-       if (rt!=0)
-            throw std::runtime_error("suffixString_create() error.");
-    }
-    
-#ifdef _SA_MATCHBY_STD_LOWER_BOUND
-#else
-    template <class T> inline static T* __select_mid(T*& p,size_t n) { return p+(n>>1); }
-            //'&' for hack cpu cache speed for xcode, somebody know way?
-#endif
-    template <class T>
-    inline static const T* _lower_bound(const T* rbegin,const T* rend,
-                                        const TChar* str,const TChar* str_end,
-                                        const TChar* src_begin,const TChar* src_end,
-                                        size_t min_eq=0){
-#ifdef _SA_MATCHBY_STD_LOWER_BOUND
-        return std::lower_bound<const T*,StringToken,const TSuffixString_compare&>
-                    (rbegin,rend,StringToken(str,str_end),TSuffixString_compare(src_begin,src_end));
-#else
-        size_t left_eq=min_eq;
-        size_t right_eq=min_eq;
-        while (size_t len=(size_t)(rend-rbegin)) {
-            const T* mid=__select_mid(rbegin,len);
-            size_t eq_len=(left_eq<=right_eq)?left_eq:right_eq;
-            const TChar* vs=str+eq_len;
-            const TChar* ss=src_begin+(*mid)+eq_len;
-            bool is_less;
-            while (true) {
-                if (vs==str_end) { is_less=false; break; };
-                if (ss==src_end) { is_less=true;  break; };
-                TInt sub=(*ss)-(*vs);
-                if (!sub) {
-                    ++vs;
-                    ++ss;
-                    ++eq_len;
-                    continue;
-                }else{
-                    is_less=(sub<0);
-                    break;
-                }
-            }
-            if (is_less){
-                left_eq=eq_len;
-                rbegin=mid+1;
-            }else{
-                right_eq=eq_len;
-                rend=mid;
-            }
-        }
-        return rbegin;
-#endif
-    }
-    
-    static TInt _lower_bound_TInt(const TInt* rbegin,const TInt* rend,
-                                  const TChar* str,const TChar* str_end,
-                                  const TChar* src_begin,const TChar* src_end,
-                                  const TInt* SA_begin,size_t min_eq){
-        return _lower_bound(rbegin,rend,str,str_end,src_begin,src_end,min_eq) - SA_begin;
-    }
-    
-    static TInt _lower_bound_TInt32(const TInt32* rbegin,const TInt32* rend,
-                                  const TChar* str,const TChar* str_end,
-                                  const TChar* src_begin,const TChar* src_end,
-                                  const TInt32* SA_begin,size_t min_eq){
-        return _lower_bound(rbegin,rend,str,str_end,src_begin,src_end,min_eq) - SA_begin;
-    }
-    
-    template<class T>
-    static void _build_range256(const T* SA_begin,const T* SA_end,
-                                const TChar* src_begin,const TChar* src_end,
-                                const T** range){
-        TChar str[1];
-        const T* pos=SA_begin;
-        for (size_t c=0;c<256;++c){
-            str[0]=(TChar)(c);
-            pos=_lower_bound(pos,SA_end,str,str+1,src_begin,src_end);
-            range[c]=pos;
-        }
-        range[256]=SA_end;
-    }
-
-    
-    template<class T>
-    static void _build_range(const T* SA_begin,const T* SA_end,
-                             const TChar* src_begin,const TChar* src_end,
-                             const T** range){
-        TChar str[2];
-        str[0]=0;
-        str[1]=0;
-        const T* pos=SA_begin;
-        for (size_t cc=0;cc<256*256;++cc){
-            //cc is [c0,c1]
-            str[0]=(TChar)(cc>>8);
-            str[1]=(TChar)(cc&255);
-            pos=_lower_bound(pos,SA_end,str,str+2,src_begin,src_end);
-            range[cc]=pos;
-        }
-        range[256*256]=SA_end;
-    }
-
-}//end namespace
-
-
-TSuffixString::TSuffixString()
-:m_src_begin(0),m_src_end(0),
- m_cached2char_range(0){
-     clear_cache();
-}
-
-TSuffixString::TSuffixString(const TChar* src_begin,const TChar* src_end)
-:m_src_begin(0),m_src_end(0),
-m_cached2char_range(0){
-    clear_cache();
-    resetSuffixString(src_begin,src_end);
-}
-
-TSuffixString::~TSuffixString(){
-    clear();
-}
-
-void TSuffixString::clear(){
-    clear_cache();
-    m_src_begin=0;
-    m_src_end=0;
-    std::vector<TInt32> _tmp_m;
-    m_SA_limit.swap(_tmp_m);
-    std::vector<TInt> _tmp_g;
-    m_SA_large.swap(_tmp_g);
-}
-
-void TSuffixString::resetSuffixString(const TChar* src_begin,const TChar* src_end){
-    assert(src_begin<=src_end);
-    m_src_begin=src_begin;
-    m_src_end=src_end;
-    if (isUseLargeSA()){
-        m_SA_limit.clear();
-        _suffixString_create(m_src_begin,m_src_end,m_SA_large);
-    }else{
-        assert(sizeof(TInt32)==4);
-        m_SA_large.clear();
-        _suffixString_create(m_src_begin,m_src_end,m_SA_limit);
-    }
-    build_cache();
-}
-
-TInt TSuffixString::lower_bound(const TChar* str,const TChar* str_end)const{
-    //not use any cached range table
-    //return m_lower_bound(m_cached_SA_begin,m_cached_SA_end,
-    //                     str,str_end,m_src_begin,m_src_end,m_cached_SA_begin,0);
-    
-    TInt str_len=str_end-str;
-    if ((str_len>=2)&(m_cached2char_range!=0)){
-        size_t cc=((size_t)str[1]) | (((size_t)str[0])<<8);
-        return m_lower_bound(m_cached2char_range[cc],m_cached2char_range[cc+1],
-                             str,str_end,m_src_begin,m_src_end,m_cached_SA_begin,2);
-    }else if (str_len>0) {
-        size_t c=str[0];
-        return m_lower_bound(m_cached1char_range[c],m_cached1char_range[c+1],
-                             str,str_end,m_src_begin,m_src_end,m_cached_SA_begin,1);
-    }else{
-        return 0;
-    }
-}
-
-void TSuffixString::clear_cache(){
-    if (m_cached2char_range){
-        delete []m_cached2char_range;
-        m_cached2char_range=0;
-    }
-    memset(&m_cached1char_range[0],0,sizeof(void*)*(256+1));
-    m_cached_SA_begin=0;
-    m_cached_SA_end=0;
-    m_lower_bound=(t_lower_bound_func)_lower_bound_TInt32;//safe
-}
-
-void TSuffixString::build_cache(){
-    clear_cache();
-    
-    const size_t kUsedCacheMinSASize =2*(1<<20); //当字符串较大时再启用大缓存表.
-    if (SASize()>kUsedCacheMinSASize){
-        m_cached2char_range=new void*[256*256+1];
-        memset(m_cached2char_range,0,sizeof(void*)*(256*256+1));
-    }
-    
-    if (isUseLargeSA()){
-        m_lower_bound=(t_lower_bound_func)_lower_bound_TInt;
-        if (m_SA_large.empty()) return;
-        m_cached_SA_begin=&m_SA_large[0];
-        m_cached_SA_end=&m_SA_large[0]+m_SA_large.size();
-        _build_range256((TInt*)m_cached_SA_begin,(TInt*)m_cached_SA_end,
-                        m_src_begin,m_src_end,(const TInt**)&m_cached1char_range[0]);
-        if (m_cached2char_range){
-            _build_range((TInt*)m_cached_SA_begin,(TInt*)m_cached_SA_end,
-                         m_src_begin,m_src_end,(const TInt**)&m_cached2char_range[0]);
-        }
-    }else{
-        m_lower_bound=(t_lower_bound_func)_lower_bound_TInt32;
-        if (m_SA_limit.empty()) return;
-        m_cached_SA_begin=&m_SA_limit[0];
-        m_cached_SA_end=&m_SA_limit[0]+m_SA_limit.size();
-        _build_range256((TInt32*)m_cached_SA_begin,(TInt32*)m_cached_SA_end,
-                        m_src_begin,m_src_end,(const TInt32**)&m_cached1char_range[0]);
-        if (m_cached2char_range){
-            _build_range((TInt32*)m_cached_SA_begin,(TInt32*)m_cached_SA_end,
-                         m_src_begin,m_src_end,(const TInt32**)&m_cached2char_range[0]);
-        }
-    }
-}
-    
-}//namespace hdiff_private

package/harmony/src/main/cpp/HDiffPatch/libHDiffPatch/HDiff/private_diff/suffix_string.h

@@ -1,94 +0,0 @@
-//suffix_string.h
-//后缀字符串的一个实现.
-//
-/*
- The MIT License (MIT)
- Copyright (c) 2012-2017 HouSisong
- 
- Permission is hereby granted, free of charge, to any person
- obtaining a copy of this software and associated documentation
- files (the "Software"), to deal in the Software without
- restriction, including without limitation the rights to use,
- copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the
- Software is furnished to do so, subject to the following
- conditions:
- 
- The above copyright notice and this permission notice shall be
- included in all copies of the Software.
- 
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
- OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
- HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
- OTHER DEALINGS IN THE SOFTWARE.
-*/
-
-#ifndef __SUFFIX_STRING_H_
-#define __SUFFIX_STRING_H_
-#include <vector>
-#include <stddef.h> //for ptrdiff_t,size_t
-#if defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
-#   include <stdint.h> //for int32_t
-namespace hdiff_private{
-#else
-namespace hdiff_private{
-#   if (_MSC_VER >= 1300)
-    typedef signed __int32 int32_t;
-#   else
-    typedef signed int     int32_t;
-#   endif
-#endif
-
-class TSuffixString{
-public:
-    typedef ptrdiff_t     TInt;
-    typedef int32_t       TInt32;
-    typedef unsigned char TChar;
-    TSuffixString();
-    ~TSuffixString();
-    
-    //throw std::runtime_error when create SA error
-    TSuffixString(const TChar* src_begin,const TChar* src_end);
-    void resetSuffixString(const TChar* src_begin,const TChar* src_end);
-
-    inline const TChar* src_begin()const{ return m_src_begin; }
-    inline const TChar* src_end()const{ return m_src_end; }
-    inline size_t SASize()const{ return (size_t)(m_src_end-m_src_begin); }
-    void clear();
-
-    inline TInt SA(TInt i)const{//return m_SA[i];//排好序的后缀字符串数组.
-        if (isUseLargeSA())
-            return m_SA_large[i];
-        else
-            return (TInt)m_SA_limit[i];
-    }
-    TInt lower_bound(const TChar* str,const TChar* str_end)const;//return index in SA
-private:
-    const TChar*        m_src_begin;//原字符串.
-    const TChar*        m_src_end;
-    std::vector<TInt32> m_SA_limit;
-    std::vector<TInt>   m_SA_large;
-    enum{ kLimitSASize= (1<<30)-1 + (1<<30) };//2G-1
-    inline bool isUseLargeSA()const{
-        return (sizeof(TInt)>sizeof(TInt32)) && (SASize()>kLimitSASize);
-    }
-private:
-    const void*         m_cached_SA_begin;
-    const void*         m_cached_SA_end;
-    const void*         m_cached1char_range[256+1];
-    void**              m_cached2char_range;//[256*256+1]
-    typedef TInt (*t_lower_bound_func)(const void* rbegin,const void* rend,
-                                       const TChar* str,const TChar* str_end,
-                                       const TChar* src_begin,const TChar* src_end,
-                                       const void* SA_begin,size_t min_eq);
-    t_lower_bound_func  m_lower_bound;
-    void                build_cache();
-    void                clear_cache();
-};
-
-}//namespace hdiff_private
-#endif //__SUFFIX_STRING_H_

package/harmony/src/main/cpp/HDiffPatch/libHDiffPatch/HPatch/checksum_plugin.h

@@ -1,52 +0,0 @@
-//checksum_plugin.h
-//  checksum plugin type
-/*
- The MIT License (MIT)
- Copyright (c) 2018-2019 HouSisong
- 
- Permission is hereby granted, free of charge, to any person
- obtaining a copy of this software and associated documentation
- files (the "Software"), to deal in the Software without
- restriction, including without limitation the rights to use,
- copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the
- Software is furnished to do so, subject to the following
- conditions:
- 
- The above copyright notice and this permission notice shall be
- included in all copies of the Software.
- 
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
- OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
- HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
- OTHER DEALINGS IN THE SOFTWARE.
- */
-#ifndef HPatch_checksum_plugin_h
-#define HPatch_checksum_plugin_h
-#include "patch_types.h"
-#ifdef __cplusplus
-extern "C" {
-#endif
-    
-    typedef void*  hpatch_checksumHandle;
-    typedef struct hpatch_TChecksum{
-        //return type tag; strlen(result)<=hpatch_kMaxPluginTypeLength; (Note:result lifetime)
-        const char*   (*checksumType)(void); //ascii cstring,cannot contain '&'
-        hpatch_size_t (*checksumByteSize)(void); //result<=hpatch_kStreamCacheSize
-        hpatch_checksumHandle (*open)(struct hpatch_TChecksum* plugin);
-        void                 (*close)(struct hpatch_TChecksum* plugin,hpatch_checksumHandle handle);
-        void                 (*begin)(hpatch_checksumHandle handle);
-        void                (*append)(hpatch_checksumHandle handle,
-                                      const unsigned char* part_data,const unsigned char* part_data_end);
-        void                   (*end)(hpatch_checksumHandle handle,
-                                      unsigned char* checksum,unsigned char* checksum_end);
-    } hpatch_TChecksum;
-    
-#ifdef __cplusplus
-}
-#endif
-#endif