react-native-update 10.34.1 → 10.34.3

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

@@ -0,0 +1,130 @@
+//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{
+
+inline static void packUIntWithTag(std::vector<unsigned char>& out_code,hpatch_StreamPos_t 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() hpatch_packUIntWithTag() error!");
+    out_code.insert(out_code.end(),codeBuf,codeEnd);
+}
+
+inline static void packUInt(std::vector<unsigned char>& out_code,hpatch_StreamPos_t 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());
+}
+
+static void pushBack(std::vector<unsigned char>& out_buf,const hpatch_TStreamInput* data){
+    const size_t kStepSize=hpatch_kStreamCacheSize*2;
+    unsigned char buf[kStepSize];
+    out_buf.reserve(out_buf.size()+(size_t)data->streamSize);
+    hpatch_StreamPos_t curPos=0;
+    while (curPos<data->streamSize){
+        size_t len=kStepSize;
+        if (curPos+len>data->streamSize)
+            len=(size_t)(data->streamSize-curPos);
+        if (!data->read(data,curPos,buf,buf+len))
+            throw std::runtime_error("pushBack() data->read() error!");
+        pushBack(out_buf,buf,len);
+        curPos+=len;
+    }
+}
+
+    
+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 pushByte(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; }
+    inline bool isNullPos()const{ return (pos_end==0)&&(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/pushy/src/main/cpp/HDiffPatch/libHDiffPatch/HDiff/private_diff/qsort_parallel.h

@@ -0,0 +1,125 @@
+//  qsort_parallel.h
+//  parallel sort for HDiffz
+/*
+ The MIT License (MIT)
+ Copyright (c) 2022 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 HDiff_qsort_parallel_h
+#define HDiff_qsort_parallel_h
+#include <algorithm>
+#include "../../../libParallel/parallel_import.h"
+#if (_IS_USED_MULTITHREAD)
+#include <thread>   //if used vc++, need >= vc2012
+#endif
+
+#if (_IS_USED_MULTITHREAD)
+    inline static size_t __index_by_ratio(size_t size,size_t ratio,size_t ratio_base){
+        return (size_t)(((hpatch_uint64_t)size)*ratio/ratio_base);
+    }
+
+    template<class TValue,class TCmp>
+    struct _sort_parallel_TCmpi{
+        inline _sort_parallel_TCmpi(const TValue* begin,TCmp& cmp):_begin(begin),_cmp(cmp){}
+        inline bool operator()(const size_t& x,const size_t& y) const{
+            return _cmp(_begin[x],_begin[y]);
+        }
+        const TValue* _begin;
+        TCmp& _cmp;
+    };
+
+    template<class TValue,class TCmp,size_t kSampleSize>
+    static TValue* _sort_parallel_partition(TValue* begin,TValue* end,TCmp cmp,
+                                             size_t leftWeight=1,size_t rightWeight=1){
+        const size_t size=end-begin;
+        size_t samples[kSampleSize];
+        const size_t _kIndexStep=size/kSampleSize+1;
+        size_t curIndex=0;
+        for(size_t i=0;i<kSampleSize;i++,curIndex+=_kIndexStep){
+            size_t ri=(curIndex+(size_t)rand()) % size;  //multi thread safe
+            samples[i]=ri;
+        }
+        const bool _kIsSortNotNth=false;
+        if (_kIsSortNotNth) std::sort(samples,samples+kSampleSize,_sort_parallel_TCmpi<TValue,TCmp>(begin,cmp));
+        size_t _pivot_i=__index_by_ratio(kSampleSize,leftWeight,(leftWeight+rightWeight));
+        if (!_kIsSortNotNth) std::nth_element(samples,samples+_pivot_i,samples+kSampleSize,_sort_parallel_TCmpi<TValue,TCmp>(begin,cmp));
+        size_t pivot=samples[_pivot_i];
+        std::swap(begin[0],begin[pivot]);
+        TValue x(begin[0]);
+        size_t mid=0;
+        for (size_t i=mid+1;i<size;++i){
+            if (cmp(begin[i],x))
+                std::swap(begin[++mid],begin[i]);
+        }
+        std::swap(begin[0],begin[mid]);
+        return begin+mid;
+    }
+
+    template<class TValue,class TCmp,size_t kSampleSize>
+    static void _sort_parallel_thread(TValue* begin,TValue* end,TCmp cmp,size_t threadNum){
+        if (threadNum>1){
+            const size_t rightWeight=(threadNum>>1);
+            const size_t leftWeight=threadNum-rightWeight;
+            TValue* mid;
+            const bool _kIsPartitionNotMerge=true;
+            if (_kIsPartitionNotMerge){ // partition
+                //mid=begin+__index_by_ratio(size,leftWeight,threadNum); std::nth_element(begin,mid,end,cmp); //for test 
+                //mid=std::_Partition_by_median_guess_unchecked(begin, end, cmp).first; //for test by vc
+                mid=_sort_parallel_partition<TValue,TCmp,kSampleSize>(begin,end,cmp,leftWeight,rightWeight);
+            }else{
+                mid=begin+__index_by_ratio(end-begin,leftWeight,threadNum);
+            }
+
+            std::thread threadRight(_sort_parallel_thread<TValue,TCmp,kSampleSize>,
+                                    mid,end,cmp,rightWeight);
+            _sort_parallel_thread<TValue,TCmp,kSampleSize>(begin,mid,cmp,leftWeight);
+            threadRight.join();
+            
+            if (!_kIsPartitionNotMerge){ //merge
+                std::inplace_merge(begin,mid,end,cmp);
+            }
+        }else{
+            std::sort(begin,end,cmp);
+            //printf("parallel sort size: %" PRIu64 " \n",(hpatch_StreamPos_t)(end-begin));
+        }
+    }
+#endif
+
+    template<class TValue,class TCmp,size_t kMinQSortParallelSize,size_t kSampleSize>
+    static void sort_parallel(TValue* begin,TValue* end,TCmp cmp,size_t threadNum){
+#if (_IS_USED_MULTITHREAD)
+        const size_t size=end-begin;
+        if ((threadNum>1)&&(size>=kMinQSortParallelSize)){
+            const size_t maxThreanNum=size/(kMinQSortParallelSize/2);
+            threadNum=(threadNum<=maxThreanNum)?threadNum:maxThreanNum;
+            //std::random_shuffle(begin,end); //test shuffle befor parallel sort?
+            _sort_parallel_thread<TValue,TCmp,kSampleSize>(begin,end,cmp,threadNum);
+        }else
+#endif
+        {
+            std::sort(begin,end,cmp);
+        }
+    }
+
+#endif

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

@@ -0,0 +1,428 @@
+//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
+#include "../../../libParallel/parallel_import.h"
+#if (_IS_USED_MULTITHREAD)
+#include <thread>   //if used vc++, need >= vc2012
+#endif
+// Sorting method selection.
+#ifndef _SA_SORTBY
+#define _SA_SORTBY
+//#  define _SA_SORTBY_STD_SORT
+//#  define _SA_SORTBY_SAIS
+#   define _SA_SORTBY_DIVSUFSORT
+#endif//_SA_SORTBY
+
+// Match search method selection, whether to use std::lower_bound or use custom implementation.
+//#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{
+
+template<class T>
+static void _clearVector(std::vector<T>& v){
+    std::vector<T> _tmp;
+    v.swap(_tmp);
+}
+
+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_sort=1024*4; //WARNING: This is a special handling measure to prevent _suffixString_create from degrading
+                                        //  to O(n*n) complexity in some cases when using std::sort (unacceptable runtime). Set a maximum comparison length to control the algorithm
+                                        //  Within O(kMaxCmpLength_sort*n) complexity, note that the sorted result is not a standard suffix array;
+        if (L0>kMaxCmpLength_sort) L0=kMaxCmpLength_sort;
+        if (L1>kMaxCmpLength_sort) L1=kMaxCmpLength_sort;
+    #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,size_t threadNum){
+        size_t size=(size_t)(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,(int)threadNum);
+        else if (sizeof(TSAInt)==4)
+            rt=divsufsort(src,(saidx32_t*)&out_sstring[0],(saidx32_t)size,(int)threadNum);
+    #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;
+                    const int kMaxCmpLength_forLimitRangeDiff=1024*8; 
+                    if (eq_len<kMaxCmpLength_forLimitRangeDiff) //only for optimize limitRange match speed
+                        continue;
+                    else
+                        return mid;
+                }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,
+                             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]=(T)(pos-SA_begin);
+        }
+        range[256*256]=(T)(SA_end-SA_begin);
+    }
+
+}//end namespace
+
+
+TSuffixString::TSuffixString(bool isUsedFastMatch)
+:m_src_begin(0),m_src_end(0),m_isUsedFastMatch(isUsedFastMatch),m_cached2char_range(0){
+     clear_cache();
+}
+
+TSuffixString::TSuffixString(const TChar* src_begin,const TChar* src_end,bool isUsedFastMatch,size_t threadNum)
+:m_src_begin(0),m_src_end(0),m_isUsedFastMatch(isUsedFastMatch),m_cached2char_range(0){
+    clear_cache();
+    resetSuffixString(src_begin,src_end,threadNum);
+}
+
+TSuffixString::~TSuffixString(){
+    clear();
+}
+
+void TSuffixString::clear(){
+    clear_cache();
+    m_src_begin=0;
+    m_src_end=0;
+    _clearVector(m_SA_limit);
+    _clearVector(m_SA_large);
+}
+
+
+void TSuffixString::resetSuffixString(const TChar* src_begin,const TChar* src_end,size_t threadNum){
+    assert(src_begin<=src_end);
+    m_src_begin=src_begin;
+    m_src_end=src_end;
+    if (isUseLargeSA()){
+        _clearVector(m_SA_limit);
+        _suffixString_create(m_src_begin,m_src_end,m_SA_large,threadNum);
+    }else{
+        assert(sizeof(TInt32)==4);
+        _clearVector(m_SA_large);
+        _suffixString_create(m_src_begin,m_src_end,m_SA_limit,threadNum);
+    }
+    build_cache(threadNum);
+}
+
+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);
+#if (_SSTRING_FAST_MATCH>0)
+    if (m_isUsedFastMatch&&(!m_fastMatch.isHit(TFastMatchForSString::getHash(str))))
+        return -1;
+    #define kMinStrLen _SSTRING_FAST_MATCH
+#else
+    //assert(str_end-str>=2);
+    #define kMinStrLen 2
+#endif
+    if ((kMinStrLen>=2)&(m_cached2char_range!=0)){
+        size_t cc=((size_t)str[1]) | (((size_t)str[0])<<8);
+        size_t r0,r1;
+        if (isUseLargeSA()){
+            r0=((TInt*)m_cached2char_range)[cc]*sizeof(TInt);
+            r1=((TInt*)m_cached2char_range)[cc+1]*sizeof(TInt);
+        }else{
+            r0=((TInt32*)m_cached2char_range)[cc]*sizeof(TInt32);
+            r1=((TInt32*)m_cached2char_range)[cc+1]*sizeof(TInt32);
+        }
+        return m_lower_bound((TChar*)m_cached_SA_begin+r0,(TChar*)m_cached_SA_begin+r1,
+                             str,str_end,m_src_begin,m_src_end,m_cached_SA_begin,2);
+    }else if (kMinStrLen>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 -1;
+    }
+}
+
+void TSuffixString::clear_cache(){
+#if (_SSTRING_FAST_MATCH>0)
+    if (m_isUsedFastMatch) m_fastMatch.clear();
+#endif
+    if (m_cached2char_range){
+        delete [](TChar*)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(size_t threadNum){
+    clear_cache();
+#if (_SSTRING_FAST_MATCH>0)
+    if (m_isUsedFastMatch) m_fastMatch.buildMatchCache(m_src_begin,m_src_end,threadNum);
+#endif
+    const size_t kUsedCacheMinSASize =2*(1<<20); //Enable large cache table only when string is large.
+    if (SASize()>kUsedCacheMinSASize){
+        m_cached2char_range=new TChar[(256*256+1)*(isUseLargeSA()?sizeof(size_t):sizeof(TInt32))];
+    }
+    
+    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,(TInt*)m_cached2char_range);
+        }
+    }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,(TInt32*)m_cached2char_range);
+        }
+    }
+}
+
+
+#if (_SSTRING_FAST_MATCH>0)
+
+    template<bool isMT>
+    static void _filter_insert(TBloomFilter<TFastMatchForSString::THash>* filter,
+                               const TChar* src_begin,const TChar* src_end){
+        const TChar* cur = src_begin;
+        TFastMatchForSString::THash h=TFastMatchForSString::getHash(cur);
+        cur+=TFastMatchForSString::kFMMinStrSize;
+        do {
+    #if (_IS_USED_MULTITHREAD)
+            if (isMT)
+                filter->insert_MT(h);
+            else
+    #endif
+                filter->insert(h);
+            if (cur<src_end)
+                h=TFastMatchForSString::rollHash(h,cur++);
+            else
+                break;
+        } while (true);
+    }
+
+    void TFastMatchForSString::buildMatchCache(const TChar* src_begin,const TChar* src_end,size_t threadNum){
+        #define kFMZoom 4  //ctrl memory size & match speed
+        size_t srcSize=src_end-src_begin;
+        if (srcSize>=kFMMinStrSize){
+            const size_t rollSize=srcSize-(kFMMinStrSize-1);
+            bf.init(rollSize,kFMZoom); //alloc large memory
+#if (_IS_USED_MULTITHREAD)
+            const size_t kInsertMinParallelSize=4096;
+            if ((threadNum>1)&&(rollSize>=kInsertMinParallelSize)) {
+                const size_t maxThreanNum=rollSize/(kInsertMinParallelSize/2);
+                threadNum=(threadNum<=maxThreanNum)?threadNum:maxThreanNum;
+
+                const size_t step=rollSize/threadNum;
+                const size_t threadCount=threadNum-1;
+                std::vector<std::thread> threads(threadCount);
+                for (size_t i=0;i<threadCount;i++,src_begin+=step)
+                    threads[i]=std::thread(_filter_insert<true>,&bf,src_begin,src_begin+step+(kFMMinStrSize-1));
+                _filter_insert<true>(&bf,src_begin,src_end);
+                for (size_t i=0;i<threadCount;i++)
+                    threads[i].join();
+            }else
+#endif
+            {
+                _filter_insert<false>(&bf,src_begin,src_end);
+            }
+        }else if ((srcSize>0)||(src_begin!=0))
+            bf.init(0,kFMZoom);
+        else{
+            bf.clear();
+        }
+    }
+#endif
+    
+}//namespace hdiff_private