diff options
Diffstat (limited to 'kviewshell/plugins/djvu/libdjvu')
69 files changed, 974 insertions, 971 deletions
diff --git a/kviewshell/plugins/djvu/libdjvu/Arrays.cpp b/kviewshell/plugins/djvu/libdjvu/Arrays.cpp index 5cb7b04c..30038734 100644 --- a/kviewshell/plugins/djvu/libdjvu/Arrays.cpp +++ b/kviewshell/plugins/djvu/libdjvu/Arrays.cpp @@ -190,7 +190,7 @@ ArrayRep::resize(int lo, int hi) init1(ndata, hibound+1-nminlo, hi-nminlo); destroy(data, lobound-minlo, hibound-minlo); - // free and replace + // free and tqreplace void *tmp=data; data = ndata; ndata=tmp; diff --git a/kviewshell/plugins/djvu/libdjvu/Arrays.h b/kviewshell/plugins/djvu/libdjvu/Arrays.h index b2676d5a..c0bc75a3 100644 --- a/kviewshell/plugins/djvu/libdjvu/Arrays.h +++ b/kviewshell/plugins/djvu/libdjvu/Arrays.h @@ -319,7 +319,7 @@ public: /** Erases the array contents. All elements in the array are destroyed. The valid subscript range is set to the empty range. */ void empty(); - /** Extends the subscript range so that is contains #n#. + /** Extends the subscript range so that is tqcontains #n#. This function does nothing if #n# is already int the valid subscript range. If the valid range was empty, both the lower bound and the upper bound are set to #n#. Otherwise the valid subscript range is extended diff --git a/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp b/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp index 9d5b726d..350d792d 100644 --- a/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp +++ b/kviewshell/plugins/djvu/libdjvu/BSEncodeByteStream.cpp @@ -104,7 +104,7 @@ static const int OVERFLOW=32; // Sorting tresholds static const int RANKSORT_THRESH=10; -static const int QUICKSORT_STACK=512; +static const int TQUICKSORT_STACK=512; static const int PRESORT_THRESH=10; static const int PRESORT_DEPTH=8; static const int RADIX_THRESH=32768; @@ -283,8 +283,8 @@ void _BSort::quicksort3r(int lo, int hi, int depth) { /* Initialize stack */ - int slo[QUICKSORT_STACK]; - int shi[QUICKSORT_STACK]; + int slo[TQUICKSORT_STACK]; + int shi[TQUICKSORT_STACK]; int sp = 1; slo[0] = lo; shi[0] = hi; @@ -342,7 +342,7 @@ _BSort::quicksort3r(int lo, int hi, int depth) vswap(hi-tmp+1, h+1, tmp, posn); h1 = hi - (h1-h); // -- process segments - ASSERT(sp+2<QUICKSORT_STACK); + ASSERT(sp+2<TQUICKSORT_STACK); // ----- middle segment (=?) [l1, h1] for(int i=l1;i<=h1;i++) rank[posn[i]] = h1; @@ -437,9 +437,9 @@ void _BSort::quicksort3d(int lo, int hi, int depth) { /* Initialize stack */ - int slo[QUICKSORT_STACK]; - int shi[QUICKSORT_STACK]; - int sd[QUICKSORT_STACK]; + int slo[TQUICKSORT_STACK]; + int shi[TQUICKSORT_STACK]; + int sd[TQUICKSORT_STACK]; int sp = 1; slo[0] = lo; shi[0] = hi; @@ -518,7 +518,7 @@ _BSort::quicksort3d(int lo, int hi, int depth) vswap(hi-tmp+1, h+1, tmp, posn); h1 = hi - (h1-h); // -- process segments - ASSERT(sp+3<QUICKSORT_STACK); + ASSERT(sp+3<TQUICKSORT_STACK); // ----- middle segment (=?) [l1, h1] l = l1; h = h1; if (med==0) // special case for marker [slow] diff --git a/kviewshell/plugins/djvu/libdjvu/DataPool.cpp b/kviewshell/plugins/djvu/libdjvu/DataPool.cpp index 1190292e..176d3915 100644 --- a/kviewshell/plugins/djvu/libdjvu/DataPool.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DataPool.cpp @@ -187,7 +187,7 @@ DataPool::OpenFiles_File::add_pool(GP<DataPool> &pool) DEBUG_MSG("DataPool::OpenFiles_File::add_pool: pool=" << (void *) pool << "\n"); DEBUG_MAKE_INDENT(3); GCriticalSectionLock lock(&pools_lock); - if (!pools_list.contains(pool)) + if (!pools_list.tqcontains(pool)) pools_list.append(pool); return pools_list.size(); } @@ -381,14 +381,14 @@ FCPools::add_pool(const GURL &url, GP<DataPool> pool) if (url.is_local_file_url()) { GPList<DataPool> list; - GPosition pos(map.contains(url)); + GPosition pos(map.tqcontains(url)); if (! pos) { map[url]=list; - pos=map.contains(url); + pos=map.tqcontains(url); } GPList<DataPool> &plist=map[pos]; - if (!plist.contains(pool)) + if (!plist.tqcontains(pool)) plist.append(pool); } clean(); @@ -403,7 +403,7 @@ FCPools::get_pool(const GURL &url, int start, int length) if (url.is_local_file_url()) { GCriticalSectionLock lock(&map_lock); - GPosition pos(map.contains(url)); + GPosition pos(map.tqcontains(url)); if (pos) { GPList<DataPool> &plist=map[pos]; @@ -433,7 +433,7 @@ FCPools::del_pool(const GURL &url, GP<DataPool> pool) if (url.is_local_file_url()) { GPosition pos; - if (map.contains(url, pos)) + if (map.tqcontains(url, pos)) { GPList<DataPool> &list=map[pos]; GPosition list_pos; @@ -458,7 +458,7 @@ FCPools::load_file(const GURL &url) if (url.is_local_file_url()) { GPosition pos; - if (map.contains(url, pos)) + if (map.tqcontains(url, pos)) { // We make here a copy of the list because DataPool::load_file() // will call FCPools::del_pool(), which will modify the list diff --git a/kviewshell/plugins/djvu/libdjvu/DataPool.h b/kviewshell/plugins/djvu/libdjvu/DataPool.h index fb4bea4e..4202ef7d 100644 --- a/kviewshell/plugins/djvu/libdjvu/DataPool.h +++ b/kviewshell/plugins/djvu/libdjvu/DataPool.h @@ -116,7 +116,7 @@ class ByteStream; Access to data in a #DataPool# may be direct (Using \Ref{get_data}() function) or sequential (See \Ref{get_stream}() function). - If the #DataPool# is not connected to anything, that is it contains + If the #DataPool# is not connected to anything, that is it tqcontains some real data, this data can be added to it by means of two \Ref{add_data}() functions. One of them adds data sequentially maintaining the offset of the last block of data added by it. The other can store diff --git a/kviewshell/plugins/djvu/libdjvu/DjVmDir.cpp b/kviewshell/plugins/djvu/libdjvu/DjVmDir.cpp index 83f9df78..2d8d2467 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVmDir.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVmDir.cpp @@ -363,7 +363,7 @@ DjVmDir::decode(const GP<ByteStream> &gstr) for(pos=files_list;pos;++pos) { GP<File> file=files_list[pos]; - if (name2file.contains(file->name)) + if (name2file.tqcontains(file->name)) G_THROW( ERR_MSG("DjVmDir.dupl_name") "\t" + file->name ); name2file[file->name]=file; } @@ -372,7 +372,7 @@ DjVmDir::decode(const GP<ByteStream> &gstr) for(pos=files_list;pos;++pos) { GP<File> file=files_list[pos]; - if (id2file.contains(file->id)) + if (id2file.tqcontains(file->id)) G_THROW( ERR_MSG("DjVmDir.dupl_id") "\t" + file->id); id2file[file->id]=file; } @@ -383,7 +383,7 @@ DjVmDir::decode(const GP<ByteStream> &gstr) GP<File> file=files_list[pos]; if (file->title.length()) { - if (title2file.contains(file->title)) + if (title2file.tqcontains(file->title)) G_THROW( ERR_MSG("DjVmDir.dupl_title") "\t" + file->title); title2file[file->title]=file; } @@ -542,7 +542,7 @@ DjVmDir::name_to_file(const GUTF8String & name) const GCriticalSectionLock lock((GCriticalSection *) &class_lock); GPosition pos; - return (name2file.contains(name, pos))?name2file[pos]:(GP<DjVmDir::File>(0)); + return (name2file.tqcontains(name, pos))?name2file[pos]:(GP<DjVmDir::File>(0)); } GP<DjVmDir::File> @@ -551,7 +551,7 @@ DjVmDir::id_to_file(const GUTF8String &id) const GCriticalSectionLock lock((GCriticalSection *) &class_lock); GPosition pos; - return (id2file.contains(id, pos))?id2file[pos]:(GP<DjVmDir::File>(0)); + return (id2file.tqcontains(id, pos))?id2file[pos]:(GP<DjVmDir::File>(0)); } GP<DjVmDir::File> @@ -560,7 +560,7 @@ DjVmDir::title_to_file(const GUTF8String &title) const GCriticalSectionLock lock((GCriticalSection *) &class_lock); GPosition pos; - return (title2file.contains(title, pos))?title2file[pos]:(GP<DjVmDir::File>(0)); + return (title2file.tqcontains(title, pos))?title2file[pos]:(GP<DjVmDir::File>(0)); } GPList<DjVmDir::File> @@ -636,15 +636,15 @@ DjVmDir::insert_file(const GP<File> & file, int pos_num) // Modify maps // if (! File::is_legal_id(file->id)) // G_THROW( ERR_MSG("DjVmDir.bad_file") "\t" + file->id); - if (id2file.contains(file->id)) + if (id2file.tqcontains(file->id)) G_THROW( ERR_MSG("DjVmDir.dupl_id2") "\t" + file->id); - if (name2file.contains(file->name)) + if (name2file.tqcontains(file->name)) G_THROW( ERR_MSG("DjVmDir.dupl_name2") "\t" + file->name); name2file[file->name]=file; id2file[file->id]=file; if (file->title.length()) { - if (title2file.contains(file->title)) // duplicate titles may become ok some day + if (title2file.tqcontains(file->title)) // duplicate titles may become ok some day G_THROW( ERR_MSG("DjVmDir.dupl_title2") "\t" + file->title); title2file[file->title]=file; } @@ -749,7 +749,7 @@ DjVmDir::set_file_name(const GUTF8String &id, const GUTF8String &name) } // Check if ID is valid - if (!id2file.contains(id, pos)) + if (!id2file.tqcontains(id, pos)) G_THROW( ERR_MSG("DjVmDir.no_info") "\t" + GUTF8String(id)); GP<File> file=id2file[pos]; name2file.del(file->name); @@ -776,7 +776,7 @@ DjVmDir::set_file_title(const GUTF8String &id, const GUTF8String &title) } // Check if ID is valid - if (!id2file.contains(id, pos)) + if (!id2file.tqcontains(id, pos)) G_THROW( ERR_MSG("DjVmDir.no_info") "\t" + GUTF8String(id)); GP<File> file=id2file[pos]; title2file.del(file->title); @@ -795,7 +795,7 @@ DjVmDir::resolve_duplicates(const bool save_as_bundled) for(pos=files_list;pos;++pos) { const GUTF8String save_name=files_list[pos]->check_save_name(save_as_bundled).downcase(); - if(save_map.contains(save_name)) + if(save_map.tqcontains(save_name)) { conflicts[save_name].append(files_list[pos]); }else @@ -813,7 +813,7 @@ DjVmDir::resolve_duplicates(const bool save_as_bundled) { GUTF8String new_name=cfiles[qpos]->get_load_name(); if((new_name != GUTF8String(GNativeString(new_name))) - ||conflicts.contains(new_name)) + ||conflicts.tqcontains(new_name)) { do { @@ -821,7 +821,7 @@ DjVmDir::resolve_duplicates(const bool save_as_bundled) ?(save_name+"-"+GUTF8String(count++)) :(save_name.substr(0,dot)+"-"+GUTF8String(count++)+ save_name.substr(dot,(unsigned int)(-1))); - } while(save_map.contains(new_name.downcase())); + } while(save_map.tqcontains(new_name.downcase())); } cfiles[qpos]->set_save_name(new_name); save_map[new_name]=0; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVmDir0.cpp b/kviewshell/plugins/djvu/libdjvu/DjVmDir0.cpp index 62694098..ca255ea5 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVmDir0.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVmDir0.cpp @@ -132,7 +132,7 @@ DjVmDir0::decode(ByteStream & bs) GP<DjVmDir0::FileRec> DjVmDir0::get_file(const GUTF8String &name) { - if (name2file.contains(name)) + if (name2file.tqcontains(name)) return name2file[name]; return 0; } diff --git a/kviewshell/plugins/djvu/libdjvu/DjVmDoc.cpp b/kviewshell/plugins/djvu/libdjvu/DjVmDoc.cpp index 5b851d6e..b24b43b1 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVmDoc.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVmDoc.cpp @@ -109,7 +109,7 @@ save_file( { incl_str.setat(incl_str.length()-1, 0); } - GPosition pos=incl.contains(incl_str); + GPosition pos=incl.tqcontains(incl_str); if(pos) { iff_out.get_bytestream()->writestring(incl[pos]); @@ -174,7 +174,7 @@ DjVmDoc::insert_file(const GP<DjVmDir::File> & f, if (!f) G_THROW( ERR_MSG("DjVmDoc.no_zero_file") ); - if (data.contains(f->get_load_name())) + if (data.tqcontains(f->get_load_name())) G_THROW( ERR_MSG("DjVmDoc.no_duplicate") ); char buffer[4]; @@ -224,7 +224,7 @@ DjVmDoc::delete_file(const GUTF8String &id) DEBUG_MSG("DjVmDoc::delete_file(): deleting file '" << id << "'\n"); DEBUG_MAKE_INDENT(3); - if (!data.contains(id)) + if (!data.tqcontains(id)) G_THROW(GUTF8String( ERR_MSG("DjVmDoc.cant_delete") "\t") + id); data.del(id); @@ -243,8 +243,8 @@ GP<DataPool> DjVmDoc::get_data(const GUTF8String &id) const { GPosition pos; - if (!data.contains(id, pos)) - G_THROW(GUTF8String( ERR_MSG("DjVmDoc.cant_find") "\t") + id); + if (!data.tqcontains(id, pos)) + G_THROW(GUTF8String( ERR_MSG("DjVmDoc.cant_tqfind") "\t") + id); const GP<DataPool> pool(data[pos]); // First check that the file is in IFF format G_TRY @@ -298,8 +298,8 @@ DjVmDoc::write(const GP<ByteStream> &gstr, for(pos=files_list;pos;++pos) { GP<DjVmDir::File> file=files_list[pos]; - if((do_rename=(reserved.contains(file->get_load_name())?true:false)) - ||(do_rename=(reserved.contains(file->get_save_name())?true:false))) + if((do_rename=(reserved.tqcontains(file->get_load_name())?true:false)) + ||(do_rename=(reserved.tqcontains(file->get_save_name())?true:false))) { break; } @@ -322,7 +322,7 @@ DjVmDoc::write(const GP<ByteStream> &gstr, { GP<DjVmDir::File> file=files_list[pos]; const GUTF8String name(::get_name(*file)); - if(reserved.contains(name)) + if(reserved.tqcontains(name)) { GUTF8String new_name; int series=0; @@ -337,7 +337,7 @@ DjVmDoc::write(const GP<ByteStream> &gstr, { new_name=name+"_"+GUTF8String(++series); } - } while(reserved.contains(new_name)||this_doc.contains(new_name)); + } while(reserved.tqcontains(new_name)||this_doc.tqcontains(new_name)); dir->set_file_name(file->get_load_name(),new_name); need_new_list=true; } @@ -353,7 +353,7 @@ DjVmDoc::write(const GP<ByteStream> &gstr, { GP<DjVmDir::File> file=files_list[pos]; file->offset=0xffffffff; - GPosition data_pos=data.contains(file->get_load_name()); + GPosition data_pos=data.tqcontains(file->get_load_name()); if (!data_pos) G_THROW( ERR_MSG("DjVmDoc.no_data") "\t" + file->get_load_name()); if(do_rename) @@ -541,7 +541,7 @@ DjVmDoc::write_index(const GP<ByteStream> &str) GP<DjVmDir::File> file=files_list[pos]; file->offset=0; - GPosition data_pos=data.contains(file->get_load_name()); + GPosition data_pos=data.tqcontains(file->get_load_name()); if (!data_pos) G_THROW( ERR_MSG("DjVmDoc.no_data") "\t" + file->get_load_name()); file->size=data[data_pos]->get_length(); @@ -609,7 +609,7 @@ DjVmDoc::save_file( GMap<GUTF8String,GUTF8String> *incl) const { const GUTF8String load_name=file.get_load_name(); - if(!incl || !incl->contains(load_name)) + if(!incl || !incl->tqcontains(load_name)) { GMap<GUTF8String,GUTF8String> new_incl; const GUTF8String save_name( diff --git a/kviewshell/plugins/djvu/libdjvu/DjVmNav.cpp b/kviewshell/plugins/djvu/libdjvu/DjVmNav.cpp index 9e8b5fd7..d6f5555c 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVmNav.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVmNav.cpp @@ -147,13 +147,13 @@ DjVmNav::DjVuBookMark::encode(const GP<ByteStream> &gstr) ByteStream &bs=*gstr; #ifdef DJVMNAV_WITH_256LIMIT if (count>255) - G_THROW("Excessive number of children in bookmark tree"); + G_THROW("Excessive number of tqchildren in bookmark tree"); bs.write8(count); textsize = displayname.length(); bs.write24( textsize ); #else if (count>65535) - G_THROW("Excessive number of children in bookmark tree"); + G_THROW("Excessive number of tqchildren in bookmark tree"); bs.write8( count & 0xff ); bs.write8( (count>>8) & 0xff ); textsize = displayname.length(); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVmNav.h b/kviewshell/plugins/djvu/libdjvu/DjVmNav.h index 46c5d57f..612cd100 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVmNav.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVmNav.h @@ -115,7 +115,7 @@ private: /** The DjVuBookMark. Each entry in the Navigation chunk (NAVM) is a bookmark. A bookmark - contains a count of immediate children, a display string and a url. + contains a count of immediate tqchildren, a display string and a url. **/ class DjVmNav::DjVuBookMark : public GPEnabled @@ -131,7 +131,7 @@ public: void encode(const GP<ByteStream> &stream); void dump(const GP<ByteStream> &stream); void decode(const GP<ByteStream> &stream); - int count; // count of immediate children. + int count; // count of immediate tqchildren. GUTF8String displayname; // example: "Section 3.5 - Encryption" GUTF8String url; // url, may be blank or relative. }; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuAnno.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuAnno.cpp index 7cece60b..f3a53bf7 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuAnno.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuAnno.cpp @@ -978,16 +978,16 @@ DjVuANT::get_mode(GLParser & parser) return retval; } -static inline DjVuANT::alignment +static inline DjVuANT::tqalignment legal_halign(const int i) { - DjVuANT::alignment retval; - switch((DjVuANT::alignment)i) + DjVuANT::tqalignment retval; + switch((DjVuANT::tqalignment)i) { case DjVuANT::ALIGN_LEFT: case DjVuANT::ALIGN_CENTER: case DjVuANT::ALIGN_RIGHT: - retval=(DjVuANT::alignment)i; + retval=(DjVuANT::tqalignment)i; break; default: retval=DjVuANT::ALIGN_UNSPEC; @@ -996,16 +996,16 @@ legal_halign(const int i) return retval; } -static inline DjVuANT::alignment +static inline DjVuANT::tqalignment legal_valign(const int i) { - DjVuANT::alignment retval; - switch((DjVuANT::alignment)i) + DjVuANT::tqalignment retval; + switch((DjVuANT::tqalignment)i) { case DjVuANT::ALIGN_CENTER: case DjVuANT::ALIGN_TOP: case DjVuANT::ALIGN_BOTTOM: - retval=(DjVuANT::alignment)i; + retval=(DjVuANT::tqalignment)i; break; default: retval=DjVuANT::ALIGN_UNSPEC; @@ -1014,12 +1014,12 @@ legal_valign(const int i) return retval; } -DjVuANT::alignment +DjVuANT::tqalignment DjVuANT::get_hor_align(GLParser & parser) { DEBUG_MSG("DjVuAnt::get_hor_align(): getting hor page alignemnt ...\n"); DEBUG_MAKE_INDENT(3); - alignment retval=ALIGN_UNSPEC; + tqalignment retval=ALIGN_UNSPEC; G_TRY { GP<GLObject> obj=parser.get_object(ALIGN_TAG); @@ -1030,7 +1030,7 @@ DjVuANT::get_hor_align(GLParser & parser) for(int i=(int)ALIGN_UNSPEC;(i<align_strings_size);++i) { - const alignment j=legal_halign(i); + const tqalignment j=legal_halign(i); if((i == (int)j)&&(align == align_strings[i])) { retval=j; @@ -1048,18 +1048,18 @@ DjVuANT::get_hor_align(GLParser & parser) #ifndef NDEBUG if(retval == ALIGN_UNSPEC) { - DEBUG_MSG("resetting alignment to ALIGN_UNSPEC\n"); + DEBUG_MSG("resetting tqalignment to ALIGN_UNSPEC\n"); } #endif // NDEBUG return retval; } -DjVuANT::alignment +DjVuANT::tqalignment DjVuANT::get_ver_align(GLParser & parser) { DEBUG_MSG("DjVuAnt::get_ver_align(): getting vert page alignemnt ...\n"); DEBUG_MAKE_INDENT(3); - alignment retval=ALIGN_UNSPEC; + tqalignment retval=ALIGN_UNSPEC; G_TRY { GP<GLObject> obj=parser.get_object(ALIGN_TAG); @@ -1069,7 +1069,7 @@ DjVuANT::get_ver_align(GLParser & parser) DEBUG_MSG("ver_align='" << align << "'\n"); for(int i=(int)ALIGN_UNSPEC;(i<align_strings_size);++i) { - const alignment j=legal_valign(i); + const tqalignment j=legal_valign(i); if((i == (int)j)&&(align == align_strings[i])) { retval=j; @@ -1087,7 +1087,7 @@ DjVuANT::get_ver_align(GLParser & parser) #ifndef NDEBUG if(retval == ALIGN_UNSPEC) { - DEBUG_MSG("resetting alignment to ALIGN_UNSPEC\n"); + DEBUG_MSG("resetting tqalignment to ALIGN_UNSPEC\n"); } #endif // NDEBUG return retval; @@ -1166,38 +1166,38 @@ DjVuANT::get_map_areas(GLParser & parser) DEBUG_MSG("found maparea '" << comment << "' (" << url << ":" << target << ")\n"); - GLObject * shape=obj[2]; + GLObject * tqshape=obj[2]; GP<GMapArea> map_area; - if (shape->get_type()==GLObject::LIST) + if (tqshape->get_type()==GLObject::LIST) { - if (shape->get_name()==GMapArea::RECT_TAG) + if (tqshape->get_name()==GMapArea::RECT_TAG) { DEBUG_MSG("it's a rectangle.\n"); - GRect grect((*shape)[0]->get_number(), - (*shape)[1]->get_number(), - (*shape)[2]->get_number(), - (*shape)[3]->get_number()); + GRect grect((*tqshape)[0]->get_number(), + (*tqshape)[1]->get_number(), + (*tqshape)[2]->get_number(), + (*tqshape)[3]->get_number()); GP<GMapRect> map_rect=GMapRect::create(grect); map_area=(GMapRect *)map_rect; - } else if (shape->get_name()==GMapArea::POLY_TAG) + } else if (tqshape->get_name()==GMapArea::POLY_TAG) { DEBUG_MSG("it's a polygon.\n"); - int points=shape->get_list().size()/2; + int points=tqshape->get_list().size()/2; GTArray<int> xx(points-1), yy(points-1); for(int i=0;i<points;i++) { - xx[i]=(*shape)[2*i]->get_number(); - yy[i]=(*shape)[2*i+1]->get_number(); + xx[i]=(*tqshape)[2*i]->get_number(); + yy[i]=(*tqshape)[2*i+1]->get_number(); } GP<GMapPoly> map_poly=GMapPoly::create(xx,yy,points); map_area=(GMapPoly *)map_poly; - } else if (shape->get_name()==GMapArea::OVAL_TAG) + } else if (tqshape->get_name()==GMapArea::OVAL_TAG) { DEBUG_MSG("it's an ellipse.\n"); - GRect grect((*shape)[0]->get_number(), - (*shape)[1]->get_number(), - (*shape)[2]->get_number(), - (*shape)[3]->get_number()); + GRect grect((*tqshape)[0]->get_number(), + (*tqshape)[1]->get_number(), + (*tqshape)[2]->get_number(), + (*tqshape)[3]->get_number()); GP<GMapOval> map_oval=GMapOval::create(grect); map_area=(GMapOval *)map_oval; } diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuAnno.h b/kviewshell/plugins/djvu/libdjvu/DjVuAnno.h index 964c6c44..b59fe37d 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuAnno.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuAnno.h @@ -104,7 +104,7 @@ class ByteStream; // -------- DJVUANT -------- /** This class contains some trivial annotations of the page or of the - document such as page border color, page alignment, initial zoom and + document such as page border color, page tqalignment, initial zoom and display mode, hyperlinks and highlighted areas. All this information is put inside a textual chunk #ANTa# in pseudo-lisp format. Decoding and encoding are normally done by \Ref{DjVuANT::decode}() and @@ -120,7 +120,7 @@ public: enum { MODE_UNSPEC=0, MODE_COLOR, MODE_FORE, MODE_BACK, MODE_BW }; enum { ZOOM_STRETCH=-4, ZOOM_ONE2ONE=-3, ZOOM_WIDTH=-2, ZOOM_PAGE=-1, ZOOM_UNSPEC=0 }; - enum alignment { ALIGN_UNSPEC=0, ALIGN_LEFT, ALIGN_CENTER, ALIGN_RIGHT, + enum tqalignment { ALIGN_UNSPEC=0, ALIGN_LEFT, ALIGN_CENTER, ALIGN_RIGHT, ALIGN_TOP, ALIGN_BOTTOM }; /// Creates an empty annotation object. @@ -152,12 +152,12 @@ public: special cases. \end{description} */ int mode; - /** Horizontal page alignment. Possible values are #ALIGN_LEFT#, + /**Qt::Horizontal page tqalignment. Possible values are #ALIGN_LEFT#, #ALIGN_CENTER#, #ALIGN_RIGHT# and #ALIGN_UNSPEC#. */ - alignment hor_align; - /** Vertical page alignment. Possible values are #ALIGN_TOP#, + tqalignment hor_align; + /**Qt::Vertical page tqalignment. Possible values are #ALIGN_TOP#, #ALIGN_CENTER#, #ALIGN_BOTTOM# and #ALIGN_UNSPEC#. */ - alignment ver_align; + tqalignment ver_align; /** List of defined map areas. They may be just areas of highlighting or hyperlink. Please refer to \Ref{GMapArea}, \Ref{GMapRect}, \Ref{GMapPoly} and \Ref{GMapOval} for details. */ @@ -213,8 +213,8 @@ private: static unsigned long int get_bg_color(class GLParser & parser); static int get_zoom(class GLParser & parser); static int get_mode(class GLParser & parser); - static alignment get_hor_align(class GLParser & parser); - static alignment get_ver_align(class GLParser & parser); + static tqalignment get_hor_align(class GLParser & parser); + static tqalignment get_ver_align(class GLParser & parser); static GPList<GMapArea> get_map_areas(class GLParser & parser); #ifndef NO_METADATA_IN_ANT_CHUNK static GMap<GUTF8String, GUTF8String>get_metadata(GLParser & parser); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.cpp index 542faa7a..fa6ad375 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.cpp @@ -243,7 +243,7 @@ DjVuDocEditor::request_data(const DjVuPort * source, const GURL & url) { GCriticalSectionLock lock(&files_lock); GPosition pos; - if (files_map.contains(frec->get_load_name(), pos)) + if (files_map.tqcontains(frec->get_load_name(), pos)) { const GP<File> f(files_map[pos]); if (f->file && f->file->get_init_data_pool()) @@ -315,7 +315,7 @@ DjVuDocEditor::url_to_file(const GURL & url, bool dont_create) const { GCriticalSectionLock lock(&(const_cast<DjVuDocEditor *>(this)->files_lock)); GPosition pos; - if (files_map.contains(frec->get_load_name(), pos)) + if (files_map.tqcontains(frec->get_load_name(), pos)) { const GP<File> f(files_map[pos]); if (f->file) @@ -333,7 +333,7 @@ DjVuDocEditor::url_to_file(const GURL & url, bool dont_create) const { GCriticalSectionLock lock(&(const_cast<DjVuDocEditor *>(this)->files_lock)); GPosition pos; - if (files_map.contains(frec->get_load_name(), pos)) + if (files_map.tqcontains(frec->get_load_name(), pos)) { files_map[frec->get_load_name()]->file=file; }else @@ -433,15 +433,15 @@ DjVuDocEditor::strip_incl_chunks(const GP<DataPool> & pool_in) } GUTF8String -DjVuDocEditor::insert_file(const GURL &file_url, const GUTF8String &parent_id, +DjVuDocEditor::insert_file(const GURL &file_url, const GUTF8String &tqparent_id, int chunk_num, DjVuPort *source) // Will open the 'file_name' and insert it into an existing DjVuFile - // with ID 'parent_id'. Will insert the INCL chunk at position chunk_num + // with ID 'tqparent_id'. Will insert the INCL chunk at position chunk_num // Will NOT process ANY files included into the file being inserted. // Moreover it will strip out any INCL chunks in that file... { DEBUG_MSG("DjVuDocEditor::insert_file(): fname='" << file_url << - "', parent_id='" << parent_id << "'\n"); + "', tqparent_id='" << tqparent_id << "'\n"); DEBUG_MAKE_INDENT(3); const GP<DjVmDir> dir(get_djvm_dir()); @@ -468,17 +468,17 @@ DjVuDocEditor::insert_file(const GURL &file_url, const GUTF8String &parent_id, // Strip any INCL chunks file_pool=strip_incl_chunks(file_pool); - // Check if parent ID is valid - GP<DjVmDir::File> parent_frec(dir->id_to_file(parent_id)); - if (!parent_frec) - parent_frec=dir->name_to_file(parent_id); - if (!parent_frec) - parent_frec=dir->title_to_file(parent_id); - if (!parent_frec) - G_THROW( ERR_MSG("DjVuDocEditor.no_file") "\t" +parent_id); - const GP<DjVuFile> parent_file(get_djvu_file(parent_id)); - if (!parent_file) - G_THROW( ERR_MSG("DjVuDocEditor.create_fail") "\t"+parent_id); + // Check if tqparent ID is valid + GP<DjVmDir::File> tqparent_frec(dir->id_to_file(tqparent_id)); + if (!tqparent_frec) + tqparent_frec=dir->name_to_file(tqparent_id); + if (!tqparent_frec) + tqparent_frec=dir->title_to_file(tqparent_id); + if (!tqparent_frec) + G_THROW( ERR_MSG("DjVuDocEditor.no_file") "\t" +tqparent_id); + const GP<DjVuFile> tqparent_file(get_djvu_file(tqparent_id)); + if (!tqparent_file) + G_THROW( ERR_MSG("DjVuDocEditor.create_fail") "\t"+tqparent_id); // Now obtain ID for the new file const GUTF8String id(find_unique_id(file_url.fname())); @@ -486,7 +486,7 @@ DjVuDocEditor::insert_file(const GURL &file_url, const GUTF8String &parent_id, // Add it into the directory const GP<DjVmDir::File> frec( DjVmDir::File::create(id, id, id, DjVmDir::File::INCLUDE)); - int pos=dir->get_file_pos(parent_frec); + int pos=dir->get_file_pos(tqparent_frec); if (pos>=0) ++pos; dir->insert_file(frec, pos); @@ -499,8 +499,8 @@ DjVuDocEditor::insert_file(const GURL &file_url, const GUTF8String &parent_id, files_map[id]=f; } - // And insert it into the parent DjVuFile - parent_file->insert_file(id, chunk_num); + // And insert it into the tqparent DjVuFile + tqparent_file->insert_file(id, chunk_num); return id; } @@ -538,7 +538,7 @@ DjVuDocEditor::insert_file(const GURL &file_url, bool is_page, // We do not want to insert the same file twice (important when // we insert a group of files at the same time using insert_group()) // So we check if we already did that and return if so. - if (name2id.contains(file_url.fname())) + if (name2id.tqcontains(file_url.fname())) return true; if(!source) @@ -606,7 +606,7 @@ DjVuDocEditor::insert_file(const GP<DataPool> &file_pool, // Check the name2id first... const GUTF8String name=file_url.fname(); GUTF8String id; - if (name2id.contains(name)) + if (name2id.tqcontains(name)) { id=name2id[name]; }else @@ -651,7 +651,7 @@ DjVuDocEditor::insert_file(const GP<DataPool> &file_pool, // Good. Before we continue with the included files we want to // complete insertion of this one. Notice, that insertion of - // children may fail, in which case we will have to modify + // tqchildren may fail, in which case we will have to modify // data for this file to get rid of invalid INCL // Create a file record with the chosen ID @@ -821,7 +821,7 @@ DjVuDocEditor::insert_group(const GList<GURL> & file_urls, int page_num, } GUTF8String chkid; IFFByteStream::create(xdata_pool->get_stream())->get_chunk(chkid); - if (name2id.contains(furl.fname())||(chkid=="FORM:DJVM")) + if (name2id.tqcontains(furl.fname())||(chkid=="FORM:DJVM")) { GMap<GUTF8String,void *> map; map_ids(map); @@ -930,13 +930,13 @@ DjVuDocEditor::generate_ref_map(const GP<DjVuFile> & file, GMap<GUTF8String, void *> & ref_map, GMap<GURL, void *> & visit_map) // This private function is used to generate a list (implemented as map) - // of files referencing the given file. To get list of all parents + // of files referencing the given file. To get list of all tqparents // for file with ID 'id' iterate map obtained as // *((GMap<GUTF8String, void *> *) ref_map[id]) { const GURL url=file->get_url(); const GUTF8String id(djvm_dir->name_to_file(url.fname())->get_load_name()); - if (!visit_map.contains(url)) + if (!visit_map.tqcontains(url)) { visit_map[url]=0; @@ -944,17 +944,17 @@ DjVuDocEditor::generate_ref_map(const GP<DjVuFile> & file, for(GPosition pos=files_list;pos;++pos) { GP<DjVuFile> child_file=files_list[pos]; - // First: add the current file to the list of parents for + // First: add the current file to the list of tqparents for // the child being processed GURL child_url=child_file->get_url(); const GUTF8String child_id( djvm_dir->name_to_file(child_url.fname())->get_load_name()); - GMap<GUTF8String, void *> * parents=0; - if (ref_map.contains(child_id)) - parents=(GMap<GUTF8String, void *> *) ref_map[child_id]; + GMap<GUTF8String, void *> * tqparents=0; + if (ref_map.tqcontains(child_id)) + tqparents=(GMap<GUTF8String, void *> *) ref_map[child_id]; else - ref_map[child_id]=parents=new GMap<GUTF8String, void *>(); - (*parents)[id]=0; + ref_map[child_id]=tqparents=new GMap<GUTF8String, void *>(); + (*tqparents)[id]=0; // Second: go recursively generate_ref_map(child_file, ref_map, visit_map); } @@ -966,35 +966,35 @@ DjVuDocEditor::remove_file(const GUTF8String &id, bool remove_unref, GMap<GUTF8String, void *> & ref_map) // Private function, which will remove file with ID id. // - // If will also remove all INCL chunks in parent files pointing + // If will also remove all INCL chunks in tqparent files pointing // to this one // // Finally, if remove_unref is TRUE, we will go down the files // hierarchy removing every file, which becomes unreferenced. // - // ref_map will be used to find out list of parents referencing + // ref_map will be used to find out list of tqparents referencing // this file (required when removing INCL chunks) { - // First get rid of INCL chunks in parents - GMap<GUTF8String, void *> * parents=(GMap<GUTF8String, void *> *) ref_map[id]; - if (parents) + // First get rid of INCL chunks in tqparents + GMap<GUTF8String, void *> * tqparents=(GMap<GUTF8String, void *> *) ref_map[id]; + if (tqparents) { - for(GPosition pos=*parents;pos;++pos) + for(GPosition pos=*tqparents;pos;++pos) { - const GUTF8String parent_id((*parents).key(pos)); - const GP<DjVuFile> parent(get_djvu_file(parent_id)); - if (parent) - parent->unlink_file(id); + const GUTF8String tqparent_id((*tqparents).key(pos)); + const GP<DjVuFile> tqparent(get_djvu_file(tqparent_id)); + if (tqparent) + tqparent->unlink_file(id); } - delete parents; - parents=0; + delete tqparents; + tqparents=0; ref_map.del(id); } // We will accumulate errors here. GUTF8String errors; - // Now modify the ref_map and process children if necessary + // Now modify the ref_map and process tqchildren if necessary GP<DjVuFile> file=get_djvu_file(id); if (file) { @@ -1006,10 +1006,10 @@ DjVuDocEditor::remove_file(const GUTF8String &id, bool remove_unref, GURL child_url=child_file->get_url(); const GUTF8String child_id( djvm_dir->name_to_file(child_url.fname())->get_load_name()); - GMap<GUTF8String, void *> * parents=(GMap<GUTF8String, void *> *) ref_map[child_id]; - if (parents) parents->del(id); + GMap<GUTF8String, void *> * tqparents=(GMap<GUTF8String, void *> *) ref_map[child_id]; + if (tqparents) tqparents->del(id); - if (remove_unref && (!parents || !parents->size())) + if (remove_unref && (!tqparents || !tqparents->size())) remove_file(child_id, remove_unref, ref_map); } } G_CATCH(exc) { @@ -1023,7 +1023,7 @@ DjVuDocEditor::remove_file(const GUTF8String &id, bool remove_unref, // And get rid of its thumbnail, if any GCriticalSectionLock lock(&thumb_lock); - GPosition pos(thumb_map.contains(id)); + GPosition pos(thumb_map.tqcontains(id)); if (pos) { thumb_map.del(pos); @@ -1041,7 +1041,7 @@ DjVuDocEditor::remove_file(const GUTF8String &id, bool remove_unref) if (!djvm_dir->id_to_file(id)) G_THROW( ERR_MSG("DjVuDocEditor.no_file") "\t"+id); - // First generate a map of references (containing the list of parents + // First generate a map of references (containing the list of tqparents // including this particular file. This will speed things up // significatly. GMap<GUTF8String, void *> ref_map; // GMap<GUTF8String, GMap<GUTF8String, void *> *> in fact @@ -1058,8 +1058,8 @@ DjVuDocEditor::remove_file(const GUTF8String &id, bool remove_unref) GPosition pos; while((pos=ref_map)) { - GMap<GUTF8String, void *> * parents=(GMap<GUTF8String, void *> *) ref_map[pos]; - delete parents; + GMap<GUTF8String, void *> * tqparents=(GMap<GUTF8String, void *> *) ref_map[pos]; + delete tqparents; ref_map.del(pos); } } @@ -1114,7 +1114,7 @@ DjVuDocEditor::move_file(const GUTF8String &id, int & file_pos, // NOTE! file_pos here is the desired position in DjVmDir *after* // the record with ID 'id' is removed. { - if (!map.contains(id)) + if (!map.tqcontains(id)) { map[id]=0; @@ -1291,7 +1291,7 @@ DjVuDocEditor::set_file_name(const GUTF8String &id, const GUTF8String &name) // Now find DjVuFile (if any) and rename it GPosition pos; - if (files_map.contains(id, pos)) + if (files_map.tqcontains(id, pos)) { GP<File> file=files_map[pos]; GP<DataPool> pool=file->pool; @@ -1503,7 +1503,7 @@ DjVuDocEditor::get_thumbnail(int page_num, bool dont_decode) const GUTF8String id(page_to_id(page_num)); GCriticalSectionLock lock(&thumb_lock); - const GPosition pos(thumb_map.contains(id)); + const GPosition pos(thumb_map.tqcontains(id)); if (pos) { // Get the image from the map @@ -1524,7 +1524,7 @@ DjVuDocEditor::get_thumbnails_num(void) const int pages_num=get_pages_num(); for(int page_num=0;page_num<pages_num;page_num++) { - if (thumb_map.contains(page_to_id(page_num))) + if (thumb_map.tqcontains(page_to_id(page_num))) cnt++; } return cnt; @@ -1541,7 +1541,7 @@ DjVuDocEditor::get_thumbnails_size(void) const int pages_num=get_pages_num(); for(int page_num=0;page_num<pages_num;page_num++) { - const GPosition pos(thumb_map.contains(page_to_id(page_num))); + const GPosition pos(thumb_map.tqcontains(page_to_id(page_num))); if (pos) { const GP<ByteStream> gstr(thumb_map[pos]->get_stream()); @@ -1629,7 +1629,7 @@ DjVuDocEditor::file_thumbnails(void) for(;;) { GUTF8String id(page_to_id(page_num)); - const GPosition pos(thumb_map.contains(id)); + const GPosition pos(thumb_map.tqcontains(id)); if (! pos) { G_THROW( ERR_MSG("DjVuDocEditor.no_thumb") "\t"+GUTF8String(page_num)); @@ -1695,7 +1695,7 @@ DjVuDocEditor::generate_thumbnails(int thumb_size, int page_num) if(page_num<(djvm_dir->get_pages_num())) { const GUTF8String id(page_to_id(page_num)); - if (!thumb_map.contains(id)) + if (!thumb_map.tqcontains(id)) { const GP<DjVuImage> dimg(get_page(page_num, true)); @@ -1747,7 +1747,7 @@ store_file(const GP<DjVmDir> & src_djvm_dir, const GP<DjVmDoc> & djvm_doc, GP<DjVuFile> & djvu_file, GMap<GURL, void *> & map) { GURL url=djvu_file->get_url(); - if (!map.contains(url)) + if (!map.tqcontains(url)) { map[url]=0; @@ -1821,12 +1821,12 @@ DjVuDocEditor::save_file( DEBUG_MSG("DjVuDocEditor::save_file(): ID='" << file_id << "'\n"); DEBUG_MAKE_INDENT(3); - if (!map.contains(file_id)) + if (!map.tqcontains(file_id)) { const GP<DjVmDir::File> file(djvm_dir->id_to_file(file_id)); GP<DataPool> file_pool; - const GPosition pos(files_map.contains(file_id)); + const GPosition pos(files_map.tqcontains(file_id)); if (pos) { const GP<File> file_rec(files_map[pos]); @@ -1974,7 +1974,7 @@ DjVuDocEditor::save_as(const GURL &where, bool bundled) GURL file_url=page_to_url(0); const GUTF8String file_id(djvm_dir->page_to_file(0)->get_load_name()); GP<DataPool> file_pool; - GPosition pos=files_map.contains(file_id); + GPosition pos=files_map.tqcontains(file_id); if (pos) { const GP<File> file_rec(files_map[pos]); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.h b/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.h index 7bf6124a..96b18a06 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuDocEditor.h @@ -199,7 +199,7 @@ public: an exception is thrown. */ GUTF8String page_to_id(int page_num) const; - GUTF8String insert_file(const GURL &url, const GUTF8String &parent_id, + GUTF8String insert_file(const GURL &url, const GUTF8String &tqparent_id, int chunk_num=1, DjVuPort *source=0); /** Inserts the referenced file into this DjVu document. diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuDocument.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuDocument.cpp index 3b33d943..0ba922b3 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuDocument.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuDocument.cpp @@ -1328,7 +1328,7 @@ DjVuDocument::get_thumbnail(int page_num, bool dont_decode) } } - // Apparently we're out of luck and need to decode the requested + // Aptqparently we're out of luck and need to decode the requested // page (unless it's already done and if it's allowed) and render // it into the thumbnail. If dont_decode is true, do not attempt // to create this file (because this will result in a request for data) @@ -1368,7 +1368,7 @@ add_to_cache(const GP<DjVuFile> & f, GMap<GURL, void *> & map, DEBUG_MSG("DjVuDocument::add_to_cache(): url='" << url << "'\n"); DEBUG_MAKE_INDENT(3); - if (!map.contains(url)) + if (!map.tqcontains(url)) { map[url]=0; cache->add_file(f); @@ -1391,12 +1391,12 @@ DjVuDocument::add_to_cache(const GP<DjVuFile> & f) void DjVuDocument::notify_file_flags_changed(const DjVuFile * source, - long set_mask, long clr_mask) + long set_tqmask, long clr_tqmask) { // Don't check here if the document is initialized or not. // This function may be called when it's not. // check(); - if (set_mask & DjVuFile::DECODE_OK) + if (set_tqmask & DjVuFile::DECODE_OK) { set_file_aliases(source); if (cache) add_to_cache((DjVuFile *) source); @@ -1414,7 +1414,7 @@ DjVuDocument::notify_file_flags_changed(const DjVuFile * source, process_threqs(); } - if (set_mask & DjVuFile::DATA_PRESENT) + if (set_tqmask & DjVuFile::DATA_PRESENT) process_threqs(); // May be we can extract thumbnails now } @@ -1530,7 +1530,7 @@ add_file_to_djvm(const GP<DjVuFile> & file, bool page, { GURL url=file->get_url(); - if (!map.contains(url)) + if (!map.tqcontains(url)) { map[url]=0; @@ -1586,7 +1586,7 @@ static void local_get_url_names(DjVuFile * f,const GMap<GURL, void *> & map,GMap<GURL,void *> &tmpmap) { GURL url=f->get_url(); - if (!map.contains(url) && !tmpmap.contains(url)) + if (!map.tqcontains(url) && !tmpmap.tqcontains(url)) { tmpmap[url]=0; f->process_incl_chunks(); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuDocument.h b/kviewshell/plugins/djvu/libdjvu/DjVuDocument.h index 418d0814..91ab849b 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuDocument.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuDocument.h @@ -800,7 +800,7 @@ public: virtual GP<DjVuFile> id_to_file(const DjVuPort * source, const GUTF8String &id); virtual GP<DataPool> request_data(const DjVuPort * source, const GURL & url); virtual void notify_file_flags_changed(const DjVuFile * source, - long set_mask, long clr_mask); + long set_tqmask, long clr_tqmask); virtual GList<GURL> get_url_names(void); virtual void set_recover_errors(ErrorRecoveryAction=ABORT); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuDumpHelper.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuDumpHelper.cpp index 2d977be1..87a77c79 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuDumpHelper.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuDumpHelper.cpp @@ -293,7 +293,7 @@ display_chunks(ByteStream & out_str, IFFByteStream &iff, while ((size = iff.get_chunk(id, &rawoffset))) { - if (!counters.contains(id)) counters[id]=0; + if (!counters.tqcontains(id)) counters[id]=0; else counters[id]++; GUTF8String msg; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.cpp index e7c74b84..c765fdd0 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.cpp @@ -102,7 +102,7 @@ DjVuErrorList::notify_error(const DjVuPort * source, const GUTF8String & msg) bool DjVuErrorList::notify_status(const DjVuPort * source, const GUTF8String &msg) { - Status.append(msg); + tqStatus.append(msg); return 1; } @@ -120,16 +120,16 @@ DjVuErrorList::GetError(void) } GUTF8String -DjVuErrorList::GetStatus(void) +DjVuErrorList::GettqStatus(void) { - GUTF8String PrevStatus; + GUTF8String PrevtqStatus; GPosition pos; - if((pos=Status)) + if((pos=tqStatus)) { - PrevStatus=Status[pos]; - Status.del(pos); + PrevtqStatus=tqStatus[pos]; + tqStatus.del(pos); } - return PrevStatus; + return PrevtqStatus; } GP<DataPool> diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.h b/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.h index 885e76aa..c42e96e2 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuErrorList.h @@ -126,13 +126,13 @@ public: inline GList<GUTF8String> GetStatusList(void); /// Just clear the list. - inline void ClearStatus(void); + inline void CleartqStatus(void); /// Get one status message and clear that message from the list. - GUTF8String GetStatus(void); + GUTF8String GettqStatus(void); /// Check if there are any more status messages. - inline bool HasStatus(void) const; + inline bool HastqStatus(void) const; /** This gets the data. We can't use the simple port's request data since we want to allow the user to specify the ByteStream. */ @@ -143,7 +143,7 @@ private: GURL pool_url; GP<DataPool> pool; GList<GUTF8String> Errors; - GList<GUTF8String> Status; + GList<GUTF8String> tqStatus; private: //dummy stuff static GURL set_stream(ByteStream *); }; @@ -167,22 +167,22 @@ DjVuErrorList::ClearError(void) inline GList<GUTF8String> DjVuErrorList::GetStatusList(void) { - GList<GUTF8String> retval=(const GList<GUTF8String>)Status; - Status.empty(); + GList<GUTF8String> retval=(const GList<GUTF8String>)tqStatus; + tqStatus.empty(); return retval; } inline void -DjVuErrorList::ClearStatus(void) -{ Status.empty(); } +DjVuErrorList::CleartqStatus(void) +{ tqStatus.empty(); } inline bool DjVuErrorList::HasError(void) const { return !Errors.isempty(); } inline bool -DjVuErrorList::HasStatus(void) const -{ return !Status.isempty(); } +DjVuErrorList::HastqStatus(void) const +{ return !tqStatus.isempty(); } #ifdef HAVE_NAMESPACES diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuFile.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuFile.cpp index 73e3a9c2..88dc90c0 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuFile.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuFile.cpp @@ -398,10 +398,10 @@ DjVuFile::notify_chunk_done(const DjVuPort *, const GUTF8String &) void DjVuFile::notify_file_flags_changed(const DjVuFile * src, - long set_mask, long clr_mask) + long set_tqmask, long clr_tqmask) { check(); - if (set_mask & (DECODE_OK | DECODE_FAILED | DECODE_STOPPED)) + if (set_tqmask & (DECODE_OK | DECODE_FAILED | DECODE_STOPPED)) { // Signal threads waiting for file termination finish_mon.enter(); @@ -414,12 +414,12 @@ DjVuFile::notify_file_flags_changed(const DjVuFile * src, chunk_mon.leave(); } - if ((set_mask & ALL_DATA_PRESENT) && src!=this && + if ((set_tqmask & ALL_DATA_PRESENT) && src!=this && are_incl_files_created() && is_data_present()) { if (src!=this && are_incl_files_created() && is_data_present()) { - // Check if all children have data + // Check if all tqchildren have data bool all=true; { GCriticalSectionLock lock(&inc_files_lock); @@ -488,7 +488,7 @@ DjVuFile::decode_func(void) while(wait_for_finish(0)) continue; - DEBUG_MSG("waiting for children termination\n"); + DEBUG_MSG("waiting for tqchildren termination\n"); // Check for termination status GCriticalSectionLock lock(&inc_files_lock); for(GPosition pos=inc_files_list;pos;++pos) @@ -928,10 +928,10 @@ DjVuFile::decode_chunk( const GUTF8String &id, const GP<ByteStream> &gbs, GP<JB2Dict> fgjd = JB2Dict::create(); fgjd->decode(gbs); this->fgjd = fgjd; - desc.format( ERR_MSG("DjVuFile.shape_dict") "\t%d", fgjd->get_shape_count() ); + desc.format( ERR_MSG("DjVuFile.tqshape_dict") "\t%d", fgjd->get_tqshape_count() ); } - // Sjbz (JB2 encoded mask) + // Sjbz (JB2 encoded tqmask) else if (chkid=="Sjbz" && (djvu || djvi)) { if (this->fgjb) @@ -943,19 +943,19 @@ DjVuFile::decode_chunk( const GUTF8String &id, const GP<ByteStream> &gbs, // ---- end hack fgjb->decode(gbs, static_get_fgjd, (void*)this); this->fgjb = fgjb; - desc.format( ERR_MSG("DjVuFile.fg_mask") "\t%d\t%d\t%d", + desc.format( ERR_MSG("DjVuFile.fg_tqmask") "\t%d\t%d\t%d", fgjb->get_width(), fgjb->get_height(), get_dpi(fgjb->get_width(), fgjb->get_height())); } - // Smmr (MMR-G4 encoded mask) + // Smmr (MMR-G4 encoded tqmask) else if (chkid=="Smmr" && (djvu || djvi)) { if (this->fgjb) G_THROW( ERR_MSG("DjVuFile.dupl_Sxxx") ); set_can_compress(true); this->fgjb = MMRDecoder::decode(gbs); - desc.format( ERR_MSG("DjVuFile.G4_mask") "\t%d\t%d\t%d", + desc.format( ERR_MSG("DjVuFile.G4_tqmask") "\t%d\t%d\t%d", fgjb->get_width(), fgjb->get_height(), get_dpi(fgjb->get_width(), fgjb->get_height())); } @@ -1465,7 +1465,7 @@ DjVuFile::find_ndir(GMap<GURL, void *> & map) if (dir) return dir; - if (!map.contains(url)) + if (!map.tqcontains(url)) { map[url]=0; @@ -1496,7 +1496,7 @@ DjVuFile::decode_ndir(GMap<GURL, void *> & map) if (dir) return dir; - if (!map.contains(url)) + if (!map.tqcontains(url)) { map[url]=0; @@ -1570,7 +1570,7 @@ DjVuFile::get_merged_anno(const GP<DjVuFile> & file, { DEBUG_MSG("DjVuFile::get_merged_anno()\n"); GURL url=file->get_url(); - if (!map.contains(url)) + if (!map.tqcontains(url)) { ByteStream &str_out=*gstr_out; map[url]=0; @@ -1585,7 +1585,7 @@ DjVuFile::get_merged_anno(const GP<DjVuFile> & file, get_merged_anno(list[pos], gstr_out, ignore_list, level+1, max_level, map); // Now process the DjVuFile's own annotations - if (!ignore_list.contains(file->get_url())) + if (!ignore_list.tqcontains(file->get_url())) { if (!file->is_data_present() || file->is_modified() && file->anno) @@ -1966,7 +1966,7 @@ void DjVuFile::move(GMap<GURL, void *> & map, const GURL & dir_url) // This function may block for data. { - if (!map.contains(url)) + if (!map.tqcontains(url)) { map[url]=0; @@ -2095,7 +2095,7 @@ DjVuFile::contains_chunk(const GUTF8String &chunk_name) chunk_name << "'\n"); DEBUG_MAKE_INDENT(3); - bool contains=0; + bool tqcontains=0; const GP<ByteStream> str(data_pool->get_stream()); GUTF8String chkid; const GP<IFFByteStream> giff(IFFByteStream::create(str)); @@ -2112,10 +2112,10 @@ DjVuFile::contains_chunk(const GUTF8String &chunk_name) for(;(chunks_left--)&&(chksize=iff.get_chunk(chkid));last_chunk=chunks) { chunks++; - if (chkid==chunk_name) { contains=1; break; } + if (chkid==chunk_name) { tqcontains=1; break; } iff.seek_close_chunk(); } - if (!contains &&(chunks_number < 0)) chunks_number=last_chunk; + if (!tqcontains &&(chunks_number < 0)) chunks_number=last_chunk; } G_CATCH(ex) { @@ -2125,7 +2125,7 @@ DjVuFile::contains_chunk(const GUTF8String &chunk_name) } G_ENDCATCH; data_pool->clear_stream(); - return contains; + return tqcontains; } bool @@ -2225,7 +2225,7 @@ DjVuFile::add_djvu_data(IFFByteStream & ostr, GMap<GURL, void *> & map, const bool included_too, const bool no_ndir) { check(); - if (map.contains(url)) return; + if (map.tqcontains(url)) return; bool top_level = !map.size(); map[url]=0; bool processed_annotation = false; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuFile.h b/kviewshell/plugins/djvu/libdjvu/DjVuFile.h index ea0e6db3..9d83f5ae 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuFile.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuFile.h @@ -134,7 +134,7 @@ class DjVuNavDir; {\bf Inclusion} is also a new feature specifically designed for a multipage document. Indeed, inside a given document there can be a lot of things shared between its pages. Examples can be the document - annotation (\Ref{DjVuAnno}) and other things like shared shapes and + annotation (\Ref{DjVuAnno}) and other things like shared tqshapes and dictionary (to be implemented). To avoid putting these chunks into every page, we have invented new chunk called #INCL# which purpose is to make the decoder open the specified file and decode it. @@ -215,9 +215,9 @@ public: GP<IW44Image> bg44; /// Pointer to the background component of DjVu image (Raw). GP<GPixmap> bgpm; - /// Pointer to the mask of foreground component of DjVu image (JB2 encoded). + /// Pointer to the tqmask of foreground component of DjVu image (JB2 encoded). GP<JB2Image> fgjb; - /// Pointer to the optional shape dictionary for the mask (JB2 encoded). + /// Pointer to the optional tqshape dictionary for the tqmask (JB2 encoded). GP<JB2Dict> fgjd; /// Pointer to a colors layer for the foreground component of DjVu image. GP<GPixmap> fgpm; @@ -442,7 +442,7 @@ public: {\bf Warning.} Included files are normally created during decoding. Before that they do not exist. If you call this function at that time and set #only_created# to #FALSE# then it will have to - read all the data from this file in order to find #INCL# chunks, + read all the data from this file in order to tqfind #INCL# chunks, which may block your application, if not all data is available. @param only_created If #TRUE#, the file will not try to process @@ -610,7 +610,7 @@ public: virtual bool inherits(const GUTF8String &class_name) const; virtual void notify_chunk_done(const DjVuPort * source, const GUTF8String &name); virtual void notify_file_flags_changed(const DjVuFile * source, - long set_mask, long clr_mask); + long set_tqmask, long clr_tqmask); virtual void set_recover_errors(const ErrorRecoveryAction=ABORT); virtual void set_verbose_eof(const bool verbose_eof=true); virtual void report_error(const GException &ex,const bool=true); @@ -648,7 +648,7 @@ private: const GP<ByteStream> &str, bool djvi, bool djvu, bool iw44); int get_dpi(int w, int h); - // Functions dealing with the shape directory (fgjd) + // Functions dealing with the tqshape directory (fgjd) static GP<JB2Dict> static_get_fgjd(void *); GP<JB2Dict> get_fgjd(int block=0); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.cpp index b31b04bf..85454b4c 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.cpp @@ -111,7 +111,7 @@ DjVuProgressTask::set_callback(djvu_progress_callback *_callback) { GMap<void *,GP<DjVuProgressTask::Data> > &map=get_map(); void *threadID=GThread::current(); - if(map.contains(threadID)) + if(map.tqcontains(threadID)) { DjVuProgressTask::Data &data=*(map[threadID]); retval=data.callback; @@ -127,7 +127,7 @@ DjVuProgressTask::set_callback(djvu_progress_callback *_callback) { GMap<void *,GP<DjVuProgressTask::Data> > &map=get_map(); void *threadID=GThread::current(); - if(map.contains(threadID)) + if(map.tqcontains(threadID)) { DjVuProgressTask::Data &data=*(map[threadID]); retval=data.callback; @@ -142,13 +142,13 @@ DjVuProgressTask::set_callback(djvu_progress_callback *_callback) } DjVuProgressTask::DjVuProgressTask(const char *xtask,int nsteps) - : task(xtask),parent(0), nsteps(nsteps), runtostep(0), gdata(0), data(0) + : task(xtask),tqparent(0), nsteps(nsteps), runtostep(0), gdata(0), data(0) { // gtask=task; { GMap<void *,GP<DjVuProgressTask::Data> > &map=get_map(); void *threadID=GThread::current(); - if(map.contains(threadID)) + if(map.tqcontains(threadID)) { gdata=new GP<Data>; Data &d=*(data=((*(GP<Data> *)gdata)=map[threadID])); @@ -158,7 +158,7 @@ DjVuProgressTask::DjVuProgressTask(const char *xtask,int nsteps) startdate = curdate; if (!d.head) d.lastsigdate = curdate + INITIAL; - parent = d.head; + tqparent = d.head; d.head = this; } } @@ -171,8 +171,8 @@ DjVuProgressTask::~DjVuProgressTask() { if (data->head != this) G_THROW( ERR_MSG("DjVuGlobal.not_compatible") ); - data->head = parent; - if (!parent) + data->head = tqparent; + if (!tqparent) { unsigned long curdate = GOS::ticks(); if((*(data->callback))(data->gtask?data->gtask:"",curdate-startdate, curdate-startdate)) @@ -210,9 +210,9 @@ DjVuProgressTask::signal(unsigned long curdate, unsigned long estdate) { const unsigned long enddate = startdate+ (unsigned long)(((float)(estdate-startdate) * (float)nsteps) / (float)inprogress); - if (parent) + if (tqparent) { - parent->signal(curdate, enddate); + tqparent->signal(curdate, enddate); } else if (data && data->callback && curdate<enddate) { diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.h b/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.h index 3d26c8cf..1e52d698 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuGlobal.h @@ -268,7 +268,7 @@ public: const char *task; static djvu_progress_callback *set_callback(djvu_progress_callback *ptr=0); private: - DjVuProgressTask *parent; + DjVuProgressTask *tqparent; int nsteps; int runtostep; unsigned long startdate; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuImage.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuImage.cpp index f384ce97..acba10f2 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuImage.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuImage.cpp @@ -91,7 +91,7 @@ namespace DJVU { //// DJVUIMAGE: CONSTRUCTION DjVuImage::DjVuImage(void) -: rotate_count(-1),relayout_sent(false) +: rotate_count(-1),retqlayout_sent(false) { } @@ -423,13 +423,13 @@ DjVuImage::get_long_description() const void DjVuImage::notify_chunk_done(const DjVuPort *, const GUTF8String & name) { - if (!relayout_sent && + if (!retqlayout_sent && ( !name.cmp("INFO", 4) || !name.cmp("PMxx", 2) || !name.cmp("BMxx", 2) ) ) { - DjVuPort::get_portcaster()->notify_relayout(this); - relayout_sent=true; + DjVuPort::get_portcaster()->notify_retqlayout(this); + retqlayout_sent=true; } else if (!name.cmp("Sxxx", 1) || !name.cmp("BGxx", 2) || @@ -461,7 +461,7 @@ public: GP<DataPool> request_data(const DjVuPort *src, const GURL & url); void notify_chunk_done(const DjVuPort *, const GUTF8String &name); void notify_redisplay(const class DjVuImage * source); - void notify_relayout(const class DjVuImage * source); + void notify_retqlayout(const class DjVuImage * source); }; DjVuImageNotifier::DjVuImageNotifier(DjVuInterface *notifier) @@ -485,10 +485,10 @@ DjVuImageNotifier::notify_redisplay(const class DjVuImage * source) } void -DjVuImageNotifier::notify_relayout(const class DjVuImage * source) +DjVuImageNotifier::notify_retqlayout(const class DjVuImage * source) { if (notifier) - notifier->notify_relayout(); + notifier->notify_retqlayout(); } void @@ -848,17 +848,17 @@ DjVuImage::stencil(GPixmap *pm, const GRect &rect, for (int blitno = 0; blitno < jimg->get_blit_count(); blitno++) { const JB2Blit *pblit = jimg->get_blit(blitno); - const JB2Shape &pshape = jimg->get_shape(pblit->shapeno); - if (pshape.bits && + const JB2Shape &ptqshape = jimg->get_tqshape(pblit->tqshapeno); + if (ptqshape.bits && pblit->left <= rect.xmax * subsample && pblit->bottom <= rect.ymax * subsample && - pblit->left + (int)pshape.bits->columns() >= rect.xmin * subsample && - pblit->bottom + (int)pshape.bits->rows() >= rect.ymin * subsample ) + pblit->left + (int)ptqshape.bits->columns() >= rect.xmin * subsample && + pblit->bottom + (int)ptqshape.bits->rows() >= rect.ymin * subsample ) { // Record component list if (fgbc) components.append(blitno); // Blit - bm->blit(pshape.bits, + bm->blit(ptqshape.bits, pblit->left - rxmin, pblit->bottom - rymin, subsample); } @@ -902,9 +902,9 @@ DjVuImage::stencil(GPixmap *pm, const GRect &rect, lastx = pblit->left; if (fg->colordata[blitno] == colorindex) { - const JB2Shape &pshape = jimg->get_shape(pblit->shapeno); + const JB2Shape &ptqshape = jimg->get_tqshape(pblit->tqshapeno); GRect rect(pblit->left, pblit->bottom, - pshape.bits->columns(), pshape.bits->rows()); + ptqshape.bits->columns(), ptqshape.bits->rows()); comprect.recthull(comprect, rect); compset.insert_before(nullpos, components, pos); continue; @@ -927,8 +927,8 @@ DjVuImage::stencil(GPixmap *pm, const GRect &rect, { int blitno = compset[pos]; const JB2Blit *pblit = jimg->get_blit(blitno); - const JB2Shape &pshape = jimg->get_shape(pblit->shapeno); - bm->blit(pshape.bits, + const JB2Shape &ptqshape = jimg->get_tqshape(pblit->tqshapeno); + bm->blit(ptqshape.bits, pblit->left - rxmin, pblit->bottom - rymin, subsample); } @@ -1085,8 +1085,8 @@ do_bitmap(const DjVuImage &dimg, BImager get, ///* rotate code ends // Sanity - if (! ( all.contains(rect.xmin, rect.ymin) && - all.contains(rect.xmax-1, rect.ymax-1) )) + if (! ( all.tqcontains(rect.xmin, rect.ymin) && + all.tqcontains(rect.xmax-1, rect.ymax-1) )) G_THROW( ERR_MSG("DjVuImage.bad_rect") ); // Check for integral reduction int red; @@ -1151,8 +1151,8 @@ do_pixmap(const DjVuImage &dimg, PImager get, ///* rotate code ends // Sanity - if (! ( all.contains(rect.xmin, rect.ymin) && - all.contains(rect.xmax-1, rect.ymax-1) )) + if (! ( all.tqcontains(rect.xmin, rect.ymin) && + all.tqcontains(rect.xmax-1, rect.ymax-1) )) G_THROW( ERR_MSG("DjVuImage.bad_rect2") ); // Check for integral reduction int red, w=0, h=0, rw=0, rh=0; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuImage.h b/kviewshell/plugins/djvu/libdjvu/DjVuImage.h index 57b40938..7f2e836a 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuImage.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuImage.h @@ -123,7 +123,7 @@ class DjVuInterface public: virtual ~DjVuInterface(); virtual void notify_chunk(const char *chkid, const char *msg) = 0; - virtual void notify_relayout(void) = 0; + virtual void notify_retqlayout(void) = 0; virtual void notify_redisplay(void) = 0; }; @@ -185,13 +185,13 @@ public: function returns a null pointer until the decoder actually processes an #"BGjp"# chunk. */ GP<GPixmap> get_bgpm() const; - /** Returns a pointer to the mask of the foreground component of a DjVu - image. The mask of the foreground component is always a JB2 image in + /** Returns a pointer to the tqmask of the foreground component of a DjVu + image. The tqmask of the foreground component is always a JB2 image in this implementation. This function returns a null pointer until the decoder actually processes an #"Sjbz"# chunk. */ GP<JB2Image> get_fgjb() const; /** Returns a pointer to the colors of the foreground component of a DjVu - image. The mask of the foreground component is always a small pixmap in + image. The tqmask of the foreground component is always a small pixmap in this implementation. This function returns a null pointer until the decoder actually processes an #"FG44"# chunk. */ GP<GPixmap> get_fgpm() const; @@ -284,7 +284,7 @@ public: \begin{verbatim} DJVU Image (2325x3156) version 17: 0.0 Kb 'INFO' Page information. - 17.3 Kb 'Sjbz' JB2 foreground mask (2325x3156) + 17.3 Kb 'Sjbz' JB2 foreground tqmask (2325x3156) 2.5 Kb 'BG44' IW44 background (775x1052) 1.0 Kb 'FG44' IW44 foreground colors (194x263) 3.0 Kb 'BG44' IW44 background (part 2). @@ -318,7 +318,7 @@ public: /** This function returns true if this object contains a well formed {\em Bilevel DjVu Image}. Calling function #get_bitmap# on a well formed bilevel image should always return a non zero value. Note that function - #get_bitmap# works as soon as a foreground mask component is present, + #get_bitmap# works as soon as a foreground tqmask component is present, regardless of the fact that the image follows the rules or not. */ int is_legal_bilevel() const; /** This function returns true if this object contains a well formed {\em @@ -351,9 +351,9 @@ public: This function returns a null pointer if there is not enough information in the DjVu image to properly render the desired image. */ GP<GPixmap> get_pixmap(const GRect &rect, const GRect &all, double gamma=0) const; - /** Renders the mask of the foreground layer of the DjVu image. This + /** Renders the tqmask of the foreground layer of the DjVu image. This functions is a wrapper for \Ref{JB2Image::get_bitmap}. Argument #align# - specified the alignment of the rows of the returned images. Setting + specified the tqalignment of the rows of the returned images. Setting #align# to #4#, for instance, will adjust the bitmap border in order to make sure that each row of the returned image starts on a word (four byte) boundary. This function returns a null pointer if there is not @@ -414,7 +414,7 @@ public: private: GP<DjVuFile> file; int rotate_count; - bool relayout_sent; + bool retqlayout_sent; // HELPERS int stencil(GPixmap *pm, const GRect &rect, int subs, double gcorr) const; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuMessage.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuMessage.cpp index e92b7570..f20c1106 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuMessage.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuMessage.cpp @@ -240,7 +240,7 @@ GetModulePath( void ) { retval=GURL::UTF8(xprogramname,paths[pos]); const GUTF8String path(retval.get_string()); - if(!pathMAP.contains(path)) + if(!pathMAP.tqcontains(path)) { if(retval.is_file()) break; @@ -263,7 +263,7 @@ appendPath(const GURL &url, GList<GURL> &list) { if( !url.is_empty() - && !map.contains(url.get_string()) && url.is_dir() ) + && !map.tqcontains(url.get_string()) && url.is_dir() ) { map[url.get_string()]=0; list.append(url); @@ -375,14 +375,14 @@ DjVuMessage::GetProfilePaths(void) for(pos=localemaps;pos;++pos) { const GMap<GUTF8String,GP<lt_XMLTags> > &localemap=localemaps[pos]; - GPosition pos=localemap.contains(sublocale); + GPosition pos=localemap.tqcontains(sublocale); if(!pos) - pos=localemap.contains(downcasesublocale); + pos=localemap.tqcontains(downcasesublocale); if(pos) { const GMap<GUTF8String,GUTF8String>&args = localemap[pos]->get_args(); - pos = args.contains(srcstring); + pos = args.tqcontains(srcstring); if (pos) { const GUTF8String src(args[pos]); @@ -496,7 +496,7 @@ getbodies( for(GPosition pos=includes;pos;++pos) { const GUTF8String file=includes.key(pos); - if(! map.contains(file)) + if(! map.tqcontains(file)) { GList<GURL> xpaths; xpaths.append(url.base()); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuMessageLite.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuMessageLite.cpp index 258b0649..70b2b541 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuMessageLite.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuMessageLite.cpp @@ -238,7 +238,7 @@ DjVuMessageLite::LookUpSingle( const GUTF8String &Single_Message ) const return Single_Message; #endif // Isolate the message ID and get the corresponding message text - int ending_posn = Single_Message.contains("\t\v"); + int ending_posn = Single_Message.tqcontains("\t\v"); if( ending_posn < 0 ) ending_posn = Single_Message.length(); GUTF8String msg_text; @@ -276,7 +276,7 @@ DjVuMessageLite::LookUpSingle( const GUTF8String &Single_Message ) const arg=LookUpSingle(Single_Message.substr(start_posn,ending_posn)); }else { - ending_posn = Single_Message.contains("\v\t",start_posn); + ending_posn = Single_Message.tqcontains("\v\t",start_posn); if( ending_posn < 0 ) ending_posn = Single_Message.length(); arg=Single_Message.substr(start_posn, ending_posn-start_posn); @@ -308,11 +308,11 @@ DjVuMessageLite::LookUpID( const GUTF8String &xmsgID, if (start > 0) msgID = msgID.substr(start, msgID.length() - start); #endif - GPosition pos=Map.contains(msgID); + GPosition pos=Map.tqcontains(msgID); if(pos) { const GP<lt_XMLTags> tag=Map[pos]; - GPosition valuepos=tag->get_args().contains(valuestring); + GPosition valuepos=tag->get_args().tqcontains(valuestring); if(valuepos) { message_text=tag->get_args()[valuepos]; @@ -331,7 +331,7 @@ DjVuMessageLite::LookUpID( const GUTF8String &xmsgID, message_text=raw.substr(start_line+1,end_text-start_line-1).fromEscaped(); } } - GPosition numberpos=tag->get_args().contains(numberstring); + GPosition numberpos=tag->get_args().tqcontains(numberstring); if(numberpos) { message_number=tag->get_args()[numberpos]; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuNavDir.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuNavDir.cpp index 615041b0..49a2d31e 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuNavDir.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuNavDir.cpp @@ -112,7 +112,7 @@ DjVuNavDir::decode(ByteStream & str) *ptr=0; if (!strlen(buffer)) continue; - if (!tmp_page2name.contains(buffer)) + if (!tmp_page2name.tqcontains(buffer)) tmp_page2name.append(buffer); }; @@ -161,7 +161,7 @@ DjVuNavDir::name_to_page(const char * name) const { GCriticalSectionLock lk((GCriticalSection *)&lock); - if (!name2page.contains(name)) return -1; + if (!name2page.tqcontains(name)) return -1; return name2page[name]; } @@ -170,7 +170,7 @@ DjVuNavDir::url_to_page(const GURL & url) const { GCriticalSectionLock lk((GCriticalSection *)&lock); - if (!url2page.contains(url)) return -1; + if (!url2page.tqcontains(url)) return -1; return url2page[url]; } diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuPalette.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuPalette.cpp index 4e49fe12..a3f11bd0 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuPalette.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuPalette.cpp @@ -107,7 +107,7 @@ fmin(float a, float b) DjVuPalette::DjVuPalette() - : mask(0), hist(0), pmap(0) + : tqmask(0), hist(0), pmap(0) { } @@ -124,7 +124,7 @@ DjVuPalette::operator=(const DjVuPalette &ref) { delete hist; delete pmap; - mask = 0; + tqmask = 0; palette = ref.palette; colordata = ref.colordata; } @@ -132,7 +132,7 @@ DjVuPalette::operator=(const DjVuPalette &ref) } DjVuPalette::DjVuPalette(const DjVuPalette &ref) - : mask(0), hist(0), pmap(0) + : tqmask(0), hist(0), pmap(0) { this->operator=(ref); } @@ -147,18 +147,18 @@ DjVuPalette::allocate_hist() if (! hist) { hist = new GMap<int,int>; - mask = 0; + tqmask = 0; } else { GMap<int,int> *old = hist; hist = new GMap<int,int>; - mask = (mask<<1)|(0x010101); + tqmask = (tqmask<<1)|(0x010101); for (GPosition p = *old; p; ++p) { int k = old->key(p); int w = (*old)[p]; - (*hist)[k | mask] += w; + (*hist)[k | tqmask] += w; } delete old; } @@ -540,7 +540,7 @@ DjVuPalette::decode(GP<ByteStream> gbs) delete pmap; hist = 0; pmap = 0; - mask = 0; + tqmask = 0; // Code version int version = bs.read8(); if ( (version & 0x7f) != DJVUPALETTEVERSION) diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuPalette.h b/kviewshell/plugins/djvu/libdjvu/DjVuPalette.h index 7f9884f1..e44aab6d 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuPalette.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuPalette.h @@ -104,7 +104,7 @@ namespace DJVU { \Ref{index_to_color}. There are also functions for computing a palette and quantizing a complete pixmap. - {\bf Sequences of color indices} -- The DjVuPalette object also contains + {\bf Sequences of color indices} -- The DjVuPalette object also tqcontains an array \Ref{colordata} optionally containing a sequence of color indices. This array will be encoded and decoded by functions \Ref{encode} and \Ref{decode}. This feature simplifies the implementation of the ``one @@ -210,7 +210,7 @@ public: private: // Histogram - int mask; + int tqmask; GMap<int,int> *hist; // Quantization data struct PColor { unsigned char p[4]; }; @@ -240,7 +240,7 @@ DjVuPalette::histogram_clear() { delete hist; hist = 0; - mask = 0; + tqmask = 0; } inline void @@ -250,7 +250,7 @@ DjVuPalette::histogram_add(const unsigned char *bgr, int weight) { if (!hist || hist->size()>=0x4000) allocate_hist(); - int key = (bgr[0]<<16)|(bgr[1]<<8)|(bgr[2])|(mask); + int key = (bgr[0]<<16)|(bgr[1]<<8)|(bgr[2])|(tqmask); (*hist)[key] += weight; } } @@ -271,7 +271,7 @@ DjVuPalette::histogram_norm_and_add(const int *bgr, int weight) int p2 = bgr[2]/weight; if (p2>255) p2=255; if (!hist || hist->size()>=0x4000) allocate_hist(); - int key = (p0<<16)|(p1<<8)|(p2)|(mask); + int key = (p0<<16)|(p1<<8)|(p2)|(tqmask); (*hist)[key] += weight; } } @@ -288,7 +288,7 @@ DjVuPalette::color_to_index(const unsigned char *bgr) if (! pmap) allocate_pmap(); int key = (bgr[0]<<16)|(bgr[1]<<8)|(bgr[2]); - GPosition p = pmap->contains(key); + GPosition p = pmap->tqcontains(key); if ( p) return (*pmap)[p]; return color_to_index_slow(bgr); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuPort.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuPort.cpp index 5e8a25c9..02890407 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuPort.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuPort.cpp @@ -208,7 +208,7 @@ DjVuPort::DjVuPort() { DjVuPortcaster *pcaster = get_portcaster(); GCriticalSectionLock lock(& pcaster->map_lock ); - GPosition p = pcaster->cont_map.contains(this); + GPosition p = pcaster->cont_map.tqcontains(this); if (!p) G_THROW( ERR_MSG("DjVuPort.not_alloc") ); pcaster->cont_map[p] = (void*)this; } @@ -217,7 +217,7 @@ DjVuPort::DjVuPort(const DjVuPort & port) { DjVuPortcaster *pcaster = get_portcaster(); GCriticalSectionLock lock(& pcaster->map_lock ); - GPosition p = pcaster->cont_map.contains(this); + GPosition p = pcaster->cont_map.tqcontains(this); if (!p) G_THROW( ERR_MSG("DjVuPort.not_alloc") ); pcaster->cont_map[p] = (void*)this; pcaster->copy_routes(this, &port); @@ -259,7 +259,7 @@ DjVuPortcaster::is_port_alive(DjVuPort *port) { GP<DjVuPort> gp_port; GCriticalSectionLock lock(&map_lock); - GPosition pos=cont_map.contains(port); + GPosition pos=cont_map.tqcontains(port); if (pos && cont_map[pos] && ((DjVuPort *) port)->get_count()>0) gp_port=port; return gp_port; @@ -302,7 +302,7 @@ DjVuPortcaster::alias_to_port(const GUTF8String &alias) { GCriticalSectionLock lock(&map_lock); GPosition pos; - if (a2p_map.contains(alias, pos)) + if (a2p_map.tqcontains(alias, pos)) { DjVuPort * port=(DjVuPort *) a2p_map[pos]; GP<DjVuPort> gp_port=is_port_alive(port); @@ -344,10 +344,10 @@ DjVuPortcaster::del_port(const DjVuPort * port) clear_aliases(port); // Update "contents map" - if (cont_map.contains(port, pos)) cont_map.del(pos); + if (cont_map.tqcontains(port, pos)) cont_map.del(pos); // Update "route map" - if (route_map.contains(port, pos)) + if (route_map.tqcontains(port, pos)) { delete (GList<void *> *) route_map[pos]; route_map.del(pos); @@ -372,12 +372,12 @@ DjVuPortcaster::add_route(const DjVuPort * src, DjVuPort * dst) // Adds route src->dst { GCriticalSectionLock lock(&map_lock); - if (cont_map.contains(src) && src->get_count()>0 && - cont_map.contains(dst) && dst->get_count()>0) + if (cont_map.tqcontains(src) && src->get_count()>0 && + cont_map.tqcontains(dst) && dst->get_count()>0) { - if (!route_map.contains(src)) route_map[src]=new GList<void *>(); + if (!route_map.tqcontains(src)) route_map[src]=new GList<void *>(); GList<void *> & list=*(GList<void *> *) route_map[src]; - if (!list.contains(dst)) list.append(dst); + if (!list.tqcontains(dst)) list.append(dst); } } @@ -387,7 +387,7 @@ DjVuPortcaster::del_route(const DjVuPort * src, DjVuPort * dst) { GCriticalSectionLock lock(&map_lock); - if (route_map.contains(src)) + if (route_map.tqcontains(src)) { GList<void *> & list=*(GList<void *> *) route_map[src]; GPosition pos; @@ -408,8 +408,8 @@ DjVuPortcaster::copy_routes(DjVuPort * dst, const DjVuPort * src) { GCriticalSectionLock lock(&map_lock); - if (!cont_map.contains(src) || src->get_count()<=0 || - !cont_map.contains(dst) || dst->get_count()<=0) return; + if (!cont_map.tqcontains(src) || src->get_count()<=0 || + !cont_map.tqcontains(dst) || dst->get_count()<=0) return; for(GPosition pos=route_map;pos;++pos) { @@ -430,13 +430,13 @@ DjVuPortcaster::add_to_closure(GMap<const void *, void *> & set, // Assuming that the map's already locked // GCriticalSectionLock lock(&map_lock); set[dst]= (void*) (unsigned long) distance; - if (route_map.contains(dst)) + if (route_map.tqcontains(dst)) { GList<void *> & list=*(GList<void *> *) route_map[dst]; for(GPosition pos=list;pos;++pos) { DjVuPort * new_dst=(DjVuPort *) list[pos]; - if (!set.contains(new_dst)) + if (!set.tqcontains(new_dst)) add_to_closure(set, new_dst, distance+1); } } @@ -447,7 +447,7 @@ DjVuPortcaster::compute_closure(const DjVuPort * src, GPList<DjVuPort> &list, bo { GCriticalSectionLock lock(&map_lock); GMap<const void*, void*> set; - if (route_map.contains(src)) + if (route_map.tqcontains(src)) { GList<void *> & list=*(GList<void *> *) route_map[src]; for(GPosition pos=list;pos;++pos) @@ -557,12 +557,12 @@ DjVuPortcaster::notify_redisplay(const DjVuImage * source) } void -DjVuPortcaster::notify_relayout(const DjVuImage * source) +DjVuPortcaster::notify_retqlayout(const DjVuImage * source) { GPList<DjVuPort> list; compute_closure(source, list); for(GPosition pos=list; pos; ++pos) - list[pos]->notify_relayout(source); + list[pos]->notify_retqlayout(source); } void @@ -576,22 +576,22 @@ DjVuPortcaster::notify_chunk_done(const DjVuPort * source, const GUTF8String &na void DjVuPortcaster::notify_file_flags_changed(const DjVuFile * source, - long set_mask, long clr_mask) + long set_tqmask, long clr_tqmask) { GPList<DjVuPort> list; compute_closure(source, list); for(GPosition pos=list; pos; ++pos) - list[pos]->notify_file_flags_changed(source, set_mask, clr_mask); + list[pos]->notify_file_flags_changed(source, set_tqmask, clr_tqmask); } void DjVuPortcaster::notify_doc_flags_changed(const DjVuDocument * source, - long set_mask, long clr_mask) + long set_tqmask, long clr_tqmask) { GPList<DjVuPort> list; compute_closure(source, list); for(GPosition pos=list; pos; ++pos) - list[pos]->notify_doc_flags_changed(source, set_mask, clr_mask); + list[pos]->notify_doc_flags_changed(source, set_tqmask, clr_tqmask); } void @@ -626,7 +626,7 @@ void DjVuPort::notify_redisplay(const DjVuImage *) {} void -DjVuPort::notify_relayout(const DjVuImage *) {} +DjVuPort::notify_retqlayout(const DjVuImage *) {} void DjVuPort::notify_chunk_done(const DjVuPort *, const GUTF8String &) {} @@ -688,7 +688,7 @@ DjVuMemoryPort::request_data(const DjVuPort * source, const GURL & url) GCriticalSectionLock lk(&lock); GP<DataPool> pool; GPosition pos; - if (map.contains(url, pos)) + if (map.tqcontains(url, pos)) pool=map[pos]; return pool; } diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuPort.h b/kviewshell/plugins/djvu/libdjvu/DjVuPort.h index 99c165fb..430b7842 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuPort.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuPort.h @@ -213,10 +213,10 @@ public: @param source The sender of the request */ virtual void notify_redisplay(const class DjVuImage * source); - /** This notification is sent by \ref{DjVuImage} when its geometry + /** This notification is sent by \ref{DjVuImage} when its tqgeometry has been changed as a result of decoding. It may be used to implement progressive redisplay. */ - virtual void notify_relayout(const class DjVuImage * source); + virtual void notify_retqlayout(const class DjVuImage * source); /** This notification is sent when a new chunk has been decoded. */ virtual void notify_chunk_done(const DjVuPort * source, const GUTF8String &name); @@ -230,20 +230,20 @@ public: \end{itemize} @param source \Ref{DjVuFile}, which flags have been changed - @param set_mask bits, which have been set - @param clr_mask bits, which have been cleared */ + @param set_tqmask bits, which have been set + @param clr_tqmask bits, which have been cleared */ virtual void notify_file_flags_changed(const class DjVuFile * source, - long set_mask, long clr_mask); + long set_tqmask, long clr_tqmask); /** This notification is sent after the \Ref{DjVuDocument} flags have been changed. This happens, for example, after it receives enough data and can determine its structure (#BUNDLED#, #OLD_INDEXED#, etc.). @param source \Ref{DjVuDocument}, which flags have been changed - @param set_mask bits, which have been set - @param clr_mask bits, which have been cleared */ + @param set_tqmask bits, which have been set + @param clr_tqmask bits, which have been cleared */ virtual void notify_doc_flags_changed(const class DjVuDocument * source, - long set_mask, long clr_mask); + long set_tqmask, long clr_tqmask); /** This notification is sent from time to time while decoding is in progress. The purpose is obvious: to provide a way to know how much @@ -448,7 +448,7 @@ public: /** Computes destination list for #source# and calls the corresponding function in each of the ports from the destination list starting from the closest. */ - virtual void notify_relayout(const class DjVuImage * source); + virtual void notify_retqlayout(const class DjVuImage * source); /** Computes destination list for #source# and calls the corresponding function in each of the ports from the destination list starting from @@ -459,13 +459,13 @@ public: function in each of the ports from the destination list starting from the closest. */ virtual void notify_file_flags_changed(const class DjVuFile * source, - long set_mask, long clr_mask); + long set_tqmask, long clr_tqmask); /** Computes destination list for #source# and calls the corresponding function in each of the ports from the destination list starting from the closest. */ virtual void notify_doc_flags_changed(const class DjVuDocument * source, - long set_mask, long clr_mask); + long set_tqmask, long clr_tqmask); /** Computes destination list for #source# and calls the corresponding function in each of the ports from the destination list starting from diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuText.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuText.cpp index b359df41..cac6869b 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuText.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuText.cpp @@ -88,7 +88,7 @@ static inline TYPE min(TYPE a,TYPE b) { return (a<b)?a:b; } //******************************** DjVuTXT ********************************** //*************************************************************************** -const char DjVuTXT::end_of_column = 013; // VT: Vertical Tab +const char DjVuTXT::end_of_column = 013; // VT:Qt::Vertical Tab const char DjVuTXT::end_of_region = 035; // GS: Group Separator const char DjVuTXT::end_of_paragraph = 037; // US: Unit Separator const char DjVuTXT::end_of_line = 012; // LF: Line Feed @@ -108,8 +108,8 @@ DjVuTXT::Zone::append_child() empty.text_start = 0; empty.text_length = 0; empty.zone_parent=this; - children.append(empty); - return & children[children.lastpos()]; + tqchildren.append(empty); + return & tqchildren[tqchildren.lastpos()]; } void @@ -117,8 +117,8 @@ DjVuTXT::Zone::cleartext() { text_start = 0; text_length = 0; - for (GPosition i=children; i; ++i) - children[i].cleartext(); + for (GPosition i=tqchildren; i; ++i) + tqchildren[i].cleartext(); } void @@ -128,8 +128,8 @@ DjVuTXT::Zone::normtext(const char *instr, GUTF8String &outstr) { // Descend collecting text below text_start = outstr.length(); - for (GPosition i=children; i; ++i) - children[i].normtext(instr, outstr); + for (GPosition i=tqchildren; i; ++i) + tqchildren[i].normtext(instr, outstr); text_length = outstr.length() - text_start; // Ignore empty zones if (text_length == 0) @@ -142,8 +142,8 @@ DjVuTXT::Zone::normtext(const char *instr, GUTF8String &outstr) outstr = outstr + GUTF8String(instr+text_start, text_length); text_start = new_start; // Clear textual information on lower level nodes - for (GPosition i=children; i; ++i) - children[i].cleartext(); + for (GPosition i=tqchildren; i; ++i) + tqchildren[i].cleartext(); } // Determine standard separator char sep; @@ -174,8 +174,8 @@ unsigned int DjVuTXT::Zone::memuse() const { int memuse = sizeof(*this); - for (GPosition i=children; i; ++i) - memuse += children[i].memuse(); + for (GPosition i=tqchildren; i; ++i) + memuse += tqchildren[i].memuse(); return memuse; } @@ -183,14 +183,14 @@ DjVuTXT::Zone::memuse() const #ifndef NEED_DECODER_ONLY void DjVuTXT::Zone::encode( - const GP<ByteStream> &gbs, const Zone * parent, const Zone * prev) const + const GP<ByteStream> &gbs, const Zone * tqparent, const Zone * prev) const { ByteStream &bs=*gbs; // Encode type bs.write8(ztype); // Modify text_start and bounding rectangle based on the context - // (whether there is a previous non-zero same-level-child or parent) + // (whether there is a previous non-zero same-level-child or tqparent) int start=text_start; int x=rect.xmin, y=rect.ymin; int width=rect.width(), height=rect.height(); @@ -212,13 +212,13 @@ DjVuTXT::Zone::encode( y=y-prev->rect.ymin; } start-=prev->text_start+prev->text_length; - } else if (parent) + } else if (tqparent) { - // Encode offset from the upper left corner of the parent + // Encode offset from the upper left corner of the tqparent // in the coord system in that corner with x to the right and y down - x=x-parent->rect.xmin; - y=parent->rect.ymax-(y+height); - start-=parent->text_start; + x=x-tqparent->rect.xmin; + y=tqparent->rect.ymax-(y+height); + start-=tqparent->text_start; } // Encode rectangle bs.write16(0x8000+x); @@ -228,22 +228,22 @@ DjVuTXT::Zone::encode( // Encode text info bs.write16(0x8000+start); bs.write24(text_length); - // Encode number of children - bs.write24(children.size()); + // Encode number of tqchildren + bs.write24(tqchildren.size()); const Zone * prev_child=0; - // Encode all children - for (GPosition i=children; i; ++i) + // Encode all tqchildren + for (GPosition i=tqchildren; i; ++i) { - children[i].encode(gbs, this, prev_child); - prev_child=&children[i]; + tqchildren[i].encode(gbs, this, prev_child); + prev_child=&tqchildren[i]; } } #endif void DjVuTXT::Zone::decode(const GP<ByteStream> &gbs, int maxtext, - const Zone * parent, const Zone * prev) + const Zone * tqparent, const Zone * prev) { ByteStream &bs=*gbs; // Decode type @@ -273,23 +273,23 @@ DjVuTXT::Zone::decode(const GP<ByteStream> &gbs, int maxtext, y=y+prev->rect.ymin; } text_start+=prev->text_start+prev->text_length; - } else if (parent) + } else if (tqparent) { - x=x+parent->rect.xmin; - y=parent->rect.ymax-(y+height); - text_start+=parent->text_start; + x=x+tqparent->rect.xmin; + y=tqparent->rect.ymax-(y+height); + text_start+=tqparent->text_start; } rect=GRect(x, y, width, height); - // Get children size + // Get tqchildren size int size = bs.read24(); // Checks if (rect.isempty() || text_start<0 || text_start+text_length>maxtext ) G_THROW( ERR_MSG("DjVuText.corrupt_text") ); - // Process children + // Process tqchildren const Zone * prev_child=0; - children.empty(); + tqchildren.empty(); while (size-- > 0) { Zone *z = append_child(); @@ -311,7 +311,7 @@ DjVuTXT::has_valid_zones() const { if (!textUTF8) return false; - if (page_zone.children.isempty() || page_zone.rect.isempty()) + if (page_zone.tqchildren.isempty() || page_zone.rect.isempty()) return false; return true; } @@ -382,8 +382,8 @@ void DjVuTXT::Zone::get_text_with_rect(const GRect &box, int &string_start, int &string_end) const { - GPosition pos=children; - if(pos?box.contains(rect):intersects_zone(box,rect)) + GPosition pos=tqchildren; + if(pos?box.tqcontains(rect):intersects_zone(box,rect)) { const int text_end=text_start+text_length; if(string_start == string_end) @@ -401,7 +401,7 @@ DjVuTXT::Zone::get_text_with_rect(const GRect &box, { do { - children[pos].get_text_with_rect(box,string_start,string_end); + tqchildren[pos].get_text_with_rect(box,string_start,string_end); } while(++pos); } } @@ -419,18 +419,18 @@ DjVuTXT::Zone::find_zones(GList<Zone *> &list, } else if(text_start < string_end) { - if (children.size()) - for (GPosition pos=children; pos; ++pos) - children[pos].find_zones(list,string_start,string_end); + if (tqchildren.size()) + for (GPosition pos=tqchildren; pos; ++pos) + tqchildren[pos].find_zones(list,string_start,string_end); else list.append(const_cast<Zone *>(this)); } } else if( text_end > string_start) { - if (children.size()) - for (GPosition pos=children; pos; ++pos) - children[pos].find_zones(list,string_start,string_end); + if (tqchildren.size()) + for (GPosition pos=tqchildren; pos; ++pos) + tqchildren[pos].find_zones(list,string_start,string_end); else list.append(const_cast<Zone *>(this)); } @@ -439,11 +439,11 @@ DjVuTXT::Zone::find_zones(GList<Zone *> &list, void DjVuTXT::Zone::get_smallest(GList<GRect> &list) const { - GPosition pos=children; + GPosition pos=tqchildren; if(pos) { do { - children[pos].get_smallest(list); + tqchildren[pos].get_smallest(list); } while (++pos); } else @@ -455,11 +455,11 @@ DjVuTXT::Zone::get_smallest(GList<GRect> &list) const void DjVuTXT::Zone::get_smallest(GList<GRect> &list, const int padding) const { - GPosition pos=children; + GPosition pos=tqchildren; if(pos) { do { - children[pos].get_smallest(list,padding); + tqchildren[pos].get_smallest(list,padding); } while (++pos); } else if(zone_parent && zone_parent->ztype >= PARAGRAPH) @@ -484,26 +484,26 @@ DjVuTXT::Zone::get_smallest(GList<GRect> &list, const int padding) const } void -DjVuTXT::get_zones(int zone_type, const Zone *parent, +DjVuTXT::get_zones(int zone_type, const Zone *tqparent, GList<Zone *> & zone_list) const - // get all the zones of type zone_type under zone node parent + // get all the zones of type zone_type under zone node tqparent { - // search all branches under parent - const Zone *zone=parent; + // search all branches under tqparent + const Zone *zone=tqparent; for( int cur_ztype=zone->ztype; cur_ztype<zone_type; ++cur_ztype ) { GPosition pos; - for(pos=zone->children; pos; ++pos) + for(pos=zone->tqchildren; pos; ++pos) { - Zone *zcur=(Zone *)&zone->children[pos]; + Zone *zcur=(Zone *)&zone->tqchildren[pos]; if ( zcur->ztype == zone_type ) { GPosition zpos=zone_list; if ( !zone_list.search(zcur,zpos) ) zone_list.append(zcur); } - else if ( zone->children[pos].ztype < zone_type ) - get_zones(zone_type, &zone->children[pos], zone_list); + else if ( zone->tqchildren[pos].ztype < zone_type ) + get_zones(zone_type, &zone->tqchildren[pos], zone_list); } } } @@ -617,7 +617,7 @@ DjVuTXT::find_text_in_rect(GRect target_rect, GUTF8String &text) const { GRect rect=words[p]->rect; if(rect.intersect(rect,target_rect)) - //if (target_rect.contains(words[p]->rect)) + //if (target_rect.tqcontains(words[p]->rect)) zone_list.append(words[p]); } } else @@ -631,7 +631,7 @@ DjVuTXT::find_text_in_rect(GRect target_rect, GUTF8String &text) const { GRect rect=words[p]->rect; if(rect.intersect(rect,target_rect)) - //if (target_rect.contains(words[p]->rect)) + //if (target_rect.tqcontains(words[p]->rect)) { start=false; zone_list.append(words[p]); @@ -648,7 +648,7 @@ DjVuTXT::find_text_in_rect(GRect target_rect, GUTF8String &text) const { GRect rect=words[p]->rect; if(rect.intersect(rect,target_rect)) - //if(target_rect.contains(words[p]->rect) ) + //if(target_rect.tqcontains(words[p]->rect) ) { end=false; zone_list.append(words[p]); @@ -864,7 +864,7 @@ static void writeText( ByteStream & str_out, const GUTF8String &textUTF8, const DjVuTXT::ZoneType zlayer, - const GList<DjVuTXT::Zone> &children, + const GList<DjVuTXT::Zone> &tqchildren, const int WindowHeight ) { // assert( txt->has_valid_zones() ); @@ -873,12 +873,12 @@ writeText( ByteStream & str_out, // Beginning tags for missing layers int layer=(int)zlayer; // Output the next layer - for(GPosition pos=children ; pos ; ++pos ) + for(GPosition pos=tqchildren ; pos ; ++pos ) { - str_out.writestring(tolayer(layer,children[pos].ztype)); + str_out.writestring(tolayer(layer,tqchildren[pos].ztype)); writeText( str_out, textUTF8, - children[pos], + tqchildren[pos], WindowHeight ); } str_out.writestring(tolayer(layer,zlayer)); @@ -893,7 +893,7 @@ writeText( ByteStream & str_out, // DEBUG_MSG( "--zonetype=" << zone.ztype << "\n" ); const GUTF8String xindent(indent( 2 * zone.ztype + 2 )); - GPosition pos=zone.children; + GPosition pos=zone.tqchildren; // Build attribute string if( ! pos ) { @@ -908,7 +908,7 @@ writeText( ByteStream & str_out, str_out.writestring(end_tag(zone.ztype)); } else { - writeText(str_out,textUTF8,zone.ztype,zone.children,WindowHeight); + writeText(str_out,textUTF8,zone.ztype,zone.tqchildren,WindowHeight); } } @@ -917,7 +917,7 @@ DjVuTXT::writeText(ByteStream &str_out,const int height) const { if(has_valid_zones()) { - ::writeText(str_out,textUTF8,DjVuTXT::PAGE,page_zone.children,height); + ::writeText(str_out,textUTF8,DjVuTXT::PAGE,page_zone.tqchildren,height); }else { str_out.writestring(start_tag(DjVuTXT::PAGE)); diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuText.h b/kviewshell/plugins/djvu/libdjvu/DjVuText.h index 61ee3667..1db6da10 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuText.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuText.h @@ -133,8 +133,8 @@ public: int text_start; /** Length of the zone text in string #textUTF8#. */ int text_length; - /** List of children zone. */ - GList<Zone> children; + /** List of tqchildren zone. */ + GList<Zone> tqchildren; /** Appends another subzone inside this zone. The new zone is initialized with an empty rectangle, empty text, and has the same type as this zone. */ @@ -148,10 +148,10 @@ public: /** Finds the smallest rectangles and appends them to the list. */ void get_smallest(GList<GRect> &list) const; /** Finds the smallest rectangles and appends them to the list after - padding the smallest unit to fit width or height for the parent rectangle + padding the smallest unit to fit width or height for the tqparent rectangle and adding the number of specified pixels. */ void get_smallest(GList<GRect> &list,const int padding) const; - /// Find out this Zone's parent. + /// Find out this Zone's tqparent. const Zone *get_parent(void) const; private: friend class DjVuTXT; @@ -161,9 +161,9 @@ public: unsigned int memuse() const; static const int version; void encode(const GP<ByteStream> &bs, - const Zone * parent=0, const Zone * prev=0) const; + const Zone * tqparent=0, const Zone * prev=0) const; void decode(const GP<ByteStream> &bs, int maxtext, - const Zone * parent=0, const Zone * prev=0); + const Zone * tqparent=0, const Zone * prev=0); }; /** Textual data for this page. The content of this string is encoded using the UTF8 code. @@ -172,13 +172,13 @@ public: control character: \begin{tabular}{lll} {\bf Name} & {\bf Octal} & {\bf Ascii name} \\\hline\\ - {\tt DjVuText::end_of_column} & 013 & VT, Vertical Tab \\ + {\tt DjVuText::end_of_column} & 013 & VT,Qt::Vertical Tab \\ {\tt DjVuText::end_of_region} & 035 & GS, Group Separator \\ {\tt DjVuText::end_of_paragraph} & 037 & US, Unit Separator \\ {\tt DjVuText::end_of_line} & 012 & LF: Line Feed \end{tabular} */ GUTF8String textUTF8; - static const char end_of_column ; // VT: Vertical Tab + static const char end_of_column ; // VT:Qt::Vertical Tab static const char end_of_region ; // GS: Group Separator static const char end_of_paragraph ; // US: Unit Separator static const char end_of_line ; // LF: Line Feed @@ -207,9 +207,9 @@ public: GList<Zone*> find_text_in_rect(GRect target_rect, GUTF8String &text) const; /** Find the text specified by the rectangle. */ GList<GRect> find_text_with_rect(const GRect &box, GUTF8String &text, const int padding=0) const; - /** Get all zones of zone type zone_type under node parent. + /** Get all zones of zone type zone_type under node tqparent. zone_list contains the return value. */ - void get_zones(int zone_type, const Zone *parent, GList<Zone *> & zone_list) const; + void get_zones(int zone_type, const Zone *tqparent, GList<Zone *> & zone_list) const; /** Returns the number of bytes needed by this data structure. It's used by caching routines to estimate the size of a \Ref{DjVuImage}. */ unsigned int get_memory_usage() const; diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuToPS.cpp b/kviewshell/plugins/djvu/libdjvu/DjVuToPS.cpp index d18c7801..a45a9112 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuToPS.cpp +++ b/kviewshell/plugins/djvu/libdjvu/DjVuToPS.cpp @@ -456,12 +456,12 @@ store_doc_setup(ByteStream &str) write(str, "%% -- procs for foreground layer\n" "/g {gsave 0 0 0 0 5 index 5 index setcachedevice\n" - " true [1 0 0 1 0 0] 5 4 roll imagemask grestore\n" + " true [1 0 0 1 0 0] 5 4 roll imagetqmask grestore\n" "} bind def\n" "/gn {gsave 0 0 0 0 6 index 6 index setcachedevice\n" " true [1 0 0 1 0 0] 3 2 roll 5 1 roll \n" " { 1 sub 0 index 2 add 1 index 1 add roll\n" - " } imagemask grestore pop \n" + " } imagetqmask grestore pop \n" "} bind def\n" "/c {setcolor rmoveto glyphshow} bind def\n" "/s {rmoveto glyphshow} bind def\n" @@ -953,14 +953,14 @@ print_fg_2layer(ByteStream &str, if (options.get_color()) { write(str,"/%d %d %d %f %f %f c\n", - blit->shapeno, + blit->tqshapeno, blit->left-currentx, blit->bottom-currenty, ramp[p.r]/255.0, ramp[p.g]/255.0, ramp[p.b]/255.0); } else { write(str,"/%d %d %d %f c\n", - blit->shapeno, + blit->tqshapeno, blit->left-currentx, blit->bottom-currenty, ramp[GRAY(p.r, p.g, p.b)]/255.0); } @@ -968,7 +968,7 @@ print_fg_2layer(ByteStream &str, else { write(str,"/%d %d %d s\n", - blit->shapeno, + blit->tqshapeno, blit->left-currentx, blit->bottom-currenty); } currentx = blit->left; @@ -1047,8 +1047,8 @@ print_fg_3layer(ByteStream &str, { JB2Blit *blit = jb2->get_blit(current_blit); GRect rect2(blit->left, blit->bottom, - jb2->get_shape(blit->shapeno).bits->columns(), - jb2->get_shape(blit->shapeno).bits->rows()); + jb2->get_tqshape(blit->tqshapeno).bits->columns(), + jb2->get_tqshape(blit->tqshapeno).bits->rows()); if (rect2.intersect(rect1,rect2)) break; } @@ -1087,12 +1087,12 @@ print_fg_3layer(ByteStream &str, { JB2Blit *blit = jb2->get_blit(current_blit); GRect rect2(blit->left, blit->bottom, - jb2->get_shape(blit->shapeno).bits->columns(), - jb2->get_shape(blit->shapeno).bits->rows()); + jb2->get_tqshape(blit->tqshapeno).bits->columns(), + jb2->get_tqshape(blit->tqshapeno).bits->rows()); if (rect2.intersect(rect1,rect2)) { write(str,"/%d %d %d s\n", - blit->shapeno, + blit->tqshapeno, blit->left-currentx, blit->bottom-currenty); currentx = blit->left; currenty = blit->bottom; @@ -1113,27 +1113,27 @@ print_fg(ByteStream &str, GP<JB2Image> jb2=dimg->get_fgjb(); if (! jb2) return; int num_blits = jb2->get_blit_count(); - int num_shapes = jb2->get_shape_count(); - unsigned char *dict_shapes = 0; + int num_tqshapes = jb2->get_tqshape_count(); + unsigned char *dict_tqshapes = 0; unsigned char *blit_list = 0; - GPBuffer<unsigned char> gdict_shapes(dict_shapes,num_shapes); + GPBuffer<unsigned char> gdict_tqshapes(dict_tqshapes,num_tqshapes); GPBuffer<unsigned char> gblit_list(blit_list,num_blits); - for(int i=0; i<num_shapes; i++) + for(int i=0; i<num_tqshapes; i++) { - dict_shapes[i]=0; + dict_tqshapes[i]=0; } for(int current_blit=0; current_blit<num_blits; current_blit++) { JB2Blit *blit = jb2->get_blit(current_blit); - JB2Shape *shape = & jb2->get_shape(blit->shapeno); + JB2Shape *tqshape = & jb2->get_tqshape(blit->tqshapeno); blit_list[current_blit] = 0; - if (! shape->bits) + if (! tqshape->bits) continue; GRect rect2(blit->left, blit->bottom, - shape->bits->columns(), shape->bits->rows()); + tqshape->bits->columns(), tqshape->bits->rows()); if (rect2.intersect(rect2, prn_rect)) { - dict_shapes[blit->shapeno] = 1; + dict_tqshapes[blit->tqshapeno] = 1; blit_list[current_blit] = 1; } } @@ -1152,13 +1152,13 @@ print_fg(ByteStream &str, "0 1 1 {Encoding exch /.notdef put} for \n" "CharStrings begin\n" "/.notdef {} def\n", - num_shapes+1); - for(int current_shape=0; current_shape<num_shapes; current_shape++) + num_tqshapes+1); + for(int current_tqshape=0; current_tqshape<num_tqshapes; current_tqshape++) { - if (dict_shapes[current_shape]) + if (dict_tqshapes[current_tqshape]) { - JB2Shape *shape = & jb2->get_shape(current_shape); - GP<GBitmap> bitmap = shape->bits; + JB2Shape *tqshape = & jb2->get_tqshape(current_tqshape); + GP<GBitmap> bitmap = tqshape->bits; int rows = bitmap->rows(); int columns = bitmap->columns(); int nbytes = (columns+7)/8*rows+1; @@ -1173,29 +1173,29 @@ print_fg(ByteStream &str, GPBuffer<unsigned char> gs_start(s_start,nbytes); unsigned char *s_ascii; GPBuffer<unsigned char> gs_ascii(s_ascii,nbytes*2); - write(str,"/%d {",current_shape); + write(str,"/%d {",current_tqshape); unsigned char *s = s_start; for(int current_row=0; current_row<rows; current_row++) { unsigned char * row_bits = (*bitmap)[current_row]; unsigned char acc = 0; - unsigned char mask = 0; + unsigned char tqmask = 0; for(int current_col=0; current_col<columns; current_col++) { - if (mask == 0) - mask = 0x80; + if (tqmask == 0) + tqmask = 0x80; if (row_bits[current_col]) - acc |= mask; - mask >>= 1; - if (mask == 0) + acc |= tqmask; + tqmask >>= 1; + if (tqmask == 0) { *s=acc; s++; - acc = mask = 0; + acc = tqmask = 0; } } - if (mask != 0) + if (tqmask != 0) { *s=acc; s++; @@ -1584,16 +1584,16 @@ print_image_lev1(ByteStream &str, { unsigned char *pix = (*bm)[y]; unsigned char acc = 0; - unsigned char mask = 0; + unsigned char tqmask = 0; char *data; for (int x=grectBand.width(); x>0; x--, pix++) { - if (mask == 0) - mask = 0x80; + if (tqmask == 0) + tqmask = 0x80; if (! *pix) - acc |= mask; - mask >>= 1; - if (mask == 0) + acc |= tqmask; + tqmask >>= 1; + if (tqmask == 0) { data = bin2hex[acc]; acc = 0; @@ -1607,7 +1607,7 @@ print_image_lev1(ByteStream &str, } } } - if (mask != 0) + if (tqmask != 0) { data = bin2hex[acc]; *buf_ptr++ = data[0]; @@ -1942,8 +1942,8 @@ print_txt_sub(DjVuTXT &txt, DjVuTXT::Zone &zone, default: separator = 0; break; } - // Zone children - if (zone.children.isempty()) + // Zone tqchildren + if (zone.tqchildren.isempty()) { const char *data = (const char*)txt.textUTF8 + zone.text_start; int length = zone.text_length; @@ -1968,8 +1968,8 @@ print_txt_sub(DjVuTXT &txt, DjVuTXT::Zone &zone, message.format("%d F\n",zone.rect.ymax-zone.rect.ymin); out.write((const char*)message,message.length()); } - for (GPosition pos=zone.children; pos; ++pos) - print_txt_sub(txt, zone.children[pos], out,lastx,lasty); + for (GPosition pos=zone.tqchildren; pos; ++pos) + print_txt_sub(txt, zone.tqchildren[pos], out,lastx,lasty); } } @@ -2230,10 +2230,10 @@ create(void) void DjVuToPS::DecodePort:: notify_file_flags_changed(const DjVuFile *source, - long set_mask, long clr_mask) + long set_tqmask, long clr_tqmask) { // WARNING! This function is called from another thread - if (set_mask & (DjVuFile::DECODE_OK | + if (set_tqmask & (DjVuFile::DECODE_OK | DjVuFile::DECODE_FAILED | DjVuFile::DECODE_STOPPED )) { diff --git a/kviewshell/plugins/djvu/libdjvu/DjVuToPS.h b/kviewshell/plugins/djvu/libdjvu/DjVuToPS.h index 95d547bb..6c99d133 100644 --- a/kviewshell/plugins/djvu/libdjvu/DjVuToPS.h +++ b/kviewshell/plugins/djvu/libdjvu/DjVuToPS.h @@ -121,7 +121,7 @@ public: would be your best choice. \item[Mode] ({\em COLOR}, {\em FORE}, {\em BACK}, or {\em BW}) Specifies how the \Ref{DjVuImage}s will be rendered (all layers, - foreground layer, background layer, and the mask respectively) + foreground layer, background layer, and the tqmask respectively) \item[Color] ({\em TRUE} or {\em FALSE}). Choosing {\em FALSE} converts color images to gray scale. \item[Gamma] Printer color correction. @@ -308,7 +308,7 @@ public: end of printing. If a \Ref{DjVuDocument} is being printed, this callback will be used to report printing progress of every page. To learn the number of the page being printed you can use - \Ref{set_info_cb}() function. See \Ref{set_dec_progress_cb}() to find + \Ref{set_info_cb}() function. See \Ref{set_dec_progress_cb}() to tqfind out how to learn the decoding progress. @param cb Callback function to be called diff --git a/kviewshell/plugins/djvu/libdjvu/GBitmap.cpp b/kviewshell/plugins/djvu/libdjvu/GBitmap.cpp index 696367e7..0cd4bad4 100644 --- a/kviewshell/plugins/djvu/libdjvu/GBitmap.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GBitmap.cpp @@ -348,7 +348,7 @@ GBitmap::donate_data(unsigned char *data, int w, int h) ncolumns = w; border = 0; bytes_per_row = w; - gbytes_data.replace(data,w*h); + gbytes_data.tqreplace(data,w*h); bytes = bytes_data; rlelength = 0; } @@ -363,7 +363,7 @@ GBitmap::donate_rle(unsigned char *rledata, unsigned int rledatalen, int w, int border = 0; bytes_per_row = w; // rle = rledata; - grle.replace(rledata,rledatalen); + grle.tqreplace(rledata,rledatalen); rlelength = rledatalen; } @@ -814,19 +814,19 @@ GBitmap::read_pbm_raw(ByteStream &bs) for (int n = nrows-1; n>=0; n--) { unsigned char acc = 0; - unsigned char mask = 0; + unsigned char tqmask = 0; for (int c = 0; c<ncolumns; c++) { - if (!mask) + if (!tqmask) { bs.read(&acc, 1); - mask = (unsigned char)0x80; + tqmask = (unsigned char)0x80; } - if (acc & mask) + if (acc & tqmask) row[c] = 1; else row[c] = 0; - mask >>= 1; + tqmask >>= 1; } row -= bytes_per_row; } @@ -1037,18 +1037,18 @@ GBitmap::rle_get_bitmap ( { const int obyte_def=invert?0xff:0; const int obyte_ndef=invert?0:0xff; - int mask=0x80,obyte=0; + int tqmask=0x80,obyte=0; for(int c=ncolumns;c > 0 ;) { int x=read_run(runs); c-=x; while((x--)>0) { - if(!(mask>>=1)) + if(!(tqmask>>=1)) { *(bitmap++) = obyte^obyte_def; obyte=0; - mask=0x80; + tqmask=0x80; for(;x>=8;x-=8) { *(bitmap++)=obyte_def; @@ -1061,19 +1061,19 @@ GBitmap::rle_get_bitmap ( c-=x; while((x--)>0) { - obyte|=mask; - if(!(mask>>=1)) + obyte|=tqmask; + if(!(tqmask>>=1)) { *(bitmap++)=obyte^obyte_def; obyte=0; - mask=0x80; + tqmask=0x80; for(;(x>8);x-=8) *(bitmap++)=obyte_ndef; } } } } - if(mask != 0x80) + if(tqmask != 0x80) { *(bitmap++)=obyte^obyte_def; } diff --git a/kviewshell/plugins/djvu/libdjvu/GBitmap.h b/kviewshell/plugins/djvu/libdjvu/GBitmap.h index 74669c05..8dbbbbad 100644 --- a/kviewshell/plugins/djvu/libdjvu/GBitmap.h +++ b/kviewshell/plugins/djvu/libdjvu/GBitmap.h @@ -365,7 +365,7 @@ public: discussion, the position is (#x/subsample#,#y/subsample#). In other words, you can position the blit with a sub-pixel resolution. The resulting anti-aliasing changes are paramount to the image quality. */ - void blit(const GBitmap *shape, int x, int y, int subsample); + void blit(const GBitmap *tqshape, int x, int y, int subsample); //@} /** @name Saving images. @@ -418,7 +418,7 @@ public: const unsigned char *get_rle(unsigned int &rle_length); /** Initializes this GBitmap by setting the size to #h# rows and #w# columns, and directly addressing the memory buffer #rledata# provided by - the user. This buffer contains #rledatalen# bytes representing the + the user. This buffer tqcontains #rledatalen# bytes representing the bitmap in run length encoded form. The GBitmap object then ``owns'' the buffer (unlike #borrow_data#, but like #donate_data#) and will deallocate this buffer when appropriate: you should not deallocate this diff --git a/kviewshell/plugins/djvu/libdjvu/GContainer.cpp b/kviewshell/plugins/djvu/libdjvu/GContainer.cpp index 2019439c..2e6012d3 100644 --- a/kviewshell/plugins/djvu/libdjvu/GContainer.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GContainer.cpp @@ -237,7 +237,7 @@ GArrayBase::resize(int lo, int hi) { traits.copy( traits.lea(ndata, beg-nminlo), traits.lea(data, beg-minlo), end-beg+1, 1 ); } - // free and replace + // free and tqreplace void *tmp=data; data=ndata; ndata=tmp; diff --git a/kviewshell/plugins/djvu/libdjvu/GContainer.h b/kviewshell/plugins/djvu/libdjvu/GContainer.h index d21838dc..c4e3e9a1 100644 --- a/kviewshell/plugins/djvu/libdjvu/GContainer.h +++ b/kviewshell/plugins/djvu/libdjvu/GContainer.h @@ -401,7 +401,7 @@ public: The valid subscript range is set to the empty range. */ void empty() { GArrayBase::empty(); } - /** Extends the subscript range so that it contains #n#. + /** Extends the subscript range so that it tqcontains #n#. This function does nothing if #n# is already int the valid subscript range. If the valid range was empty, both the lower bound and the upper bound are set to #n#. Otherwise the valid subscript range is extended @@ -862,11 +862,11 @@ public: /* Compatibility */ int nth(unsigned int n, GPosition &pos) const { GPosition npos=nth(n); if (npos) pos=npos; return !!pos; } - /** Tests whether the list contains a given element. If the list contains + /** Tests whether the list contains a given element. If the list tqcontains #elt#, the position of the the first list element equal to #elt# as checked by #TYPE::operator==(const TYPE&)# is returned. Otherwise an invalid position is returned. */ - GPosition contains(const TYPE &elt) const + GPosition tqcontains(const TYPE &elt) const { GPosition pos; GListImpl<TI>::search((const TI&)elt, pos); return pos; } /** Searches the list for a given element. If position #pos# is a valid position for this list, the search starts at the specified position. If @@ -1036,7 +1036,7 @@ protected: HNode *get_or_throw(const K &key) const; HNode *get_or_create(const K &key); public: - GPosition contains(const K &key) const + GPosition tqcontains(const K &key) const { return GPosition( get(key), (void*)this); } void del(const K &key) { deletenode(get(key)); } @@ -1164,11 +1164,11 @@ public: is equal to #key# according to #KTYPE::operator==(const KTYPE&)#, this function returns its position. Otherwise it returns an invalid position. */ - GPosition contains(const KTYPE &key) const - { return GMapImpl<KTYPE,TI>::contains(key); } + GPosition tqcontains(const KTYPE &key) const + { return GMapImpl<KTYPE,TI>::tqcontains(key); } /* Compatibility */ - GPosition contains(const KTYPE &key, GPosition &pos) const - { return pos = GMapImpl<KTYPE,TI>::contains(key); } + GPosition tqcontains(const KTYPE &key, GPosition &pos) const + { return pos = GMapImpl<KTYPE,TI>::tqcontains(key); } // -- ALTERATION /** Erases the associative map contents. All entries are destroyed and removed. The map is left with zero entries. */ diff --git a/kviewshell/plugins/djvu/libdjvu/GIFFManager.cpp b/kviewshell/plugins/djvu/libdjvu/GIFFManager.cpp index 973c6cec..a898d4dd 100644 --- a/kviewshell/plugins/djvu/libdjvu/GIFFManager.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GIFFManager.cpp @@ -113,7 +113,7 @@ GIFFChunk::set_name(GUTF8String name) DEBUG_MSG("auto-setting type to '" << type << "'\n"); - if (name.contains(".[]")>=0) + if (name.tqcontains(".[]")>=0) G_THROW( ERR_MSG("GIFFManager.bad_char") ); strncpy(GIFFChunk::name, (const char *)name, 4); @@ -180,13 +180,13 @@ GIFFChunk::add_chunk(const GP<GIFFChunk> & chunk, int position) if (!type.length()) { - DEBUG_MSG("Converting the parent to FORM\n"); + DEBUG_MSG("Converting the tqparent to FORM\n"); type="FORM"; } if (chunk->get_type()=="PROP") { - DEBUG_MSG("Converting the parent to LIST\n"); + DEBUG_MSG("Converting the tqparent to LIST\n"); type="LIST"; } @@ -310,7 +310,7 @@ GIFFChunk::get_chunks_number(const GUTF8String &name) "' in '" << get_name() << "'\n"); DEBUG_MAKE_INDENT(3); - if (name.contains("[]")>=0) + if (name.tqcontains("[]")>=0) G_THROW( ERR_MSG("GIFFManager.no_brackets") ); int number; @@ -325,24 +325,24 @@ GIFFChunk::get_chunks_number(const GUTF8String &name) //************************************************************************ void -GIFFManager::add_chunk(GUTF8String parent_name, const GP<GIFFChunk> & chunk, +GIFFManager::add_chunk(GUTF8String tqparent_name, const GP<GIFFChunk> & chunk, int pos) - // parent_name is the fully qualified name of the PARENT + // tqparent_name is the fully qualified name of the PARENT // IT MAY BE EMPTY // All the required chunks will be created // pos=-1 means to append the chunk { - DEBUG_MSG("GIFFManager::add_chunk(): Adding chunk to name='" << parent_name << "'\n"); + DEBUG_MSG("GIFFManager::add_chunk(): Adding chunk to name='" << tqparent_name << "'\n"); DEBUG_MAKE_INDENT(3); if (!top_level->get_name().length()) { - if ((!parent_name.length())||(parent_name[0]!='.')) + if ((!tqparent_name.length())||(tqparent_name[0]!='.')) G_THROW( ERR_MSG("GIFFManager.no_top_name") ); - if (parent_name.length() < 2) + if (tqparent_name.length() < 2) { // 'chunk' is actually the new top-level chunk - DEBUG_MSG("since parent_name=='.', making the chunk top-level\n"); + DEBUG_MSG("since tqparent_name=='.', making the chunk top-level\n"); if (!chunk->is_container()) G_THROW( ERR_MSG("GIFFManager.no_top_cont") ); top_level=chunk; @@ -350,33 +350,33 @@ GIFFManager::add_chunk(GUTF8String parent_name, const GP<GIFFChunk> & chunk, } DEBUG_MSG("Setting the name of the top-level chunk\n"); - const int next_dot=parent_name.search('.',1); + const int next_dot=tqparent_name.search('.',1); if(next_dot>=0) { - top_level->set_name(parent_name.substr(1,next_dot-1)); + top_level->set_name(tqparent_name.substr(1,next_dot-1)); }else { - top_level->set_name(parent_name.substr(1,(unsigned int)-1)); + top_level->set_name(tqparent_name.substr(1,(unsigned int)-1)); } } DEBUG_MSG("top level chunk name='" << top_level->get_name() << "'\n"); - if (parent_name.length() && parent_name[0] == '.') + if (tqparent_name.length() && tqparent_name[0] == '.') { - int next_dot=parent_name.search('.',1); + int next_dot=tqparent_name.search('.',1); if(next_dot<0) { - next_dot=parent_name.length(); + next_dot=tqparent_name.length(); } - GUTF8String top_name=parent_name.substr(1,next_dot-1); + GUTF8String top_name=tqparent_name.substr(1,next_dot-1); if (!top_level->check_name(top_name)) G_THROW( ERR_MSG("GIFFManager.wrong_name") "\t"+top_name); - parent_name=parent_name.substr(next_dot,(unsigned int)-1); + tqparent_name=tqparent_name.substr(next_dot,(unsigned int)-1); } GP<GIFFChunk> cur_sec=top_level; - const char * start, * end=(const char *)parent_name-1; + const char * start, * end=(const char *)tqparent_name-1; do { for(start=++end;*end&&(*end!='.');end++) @@ -497,7 +497,7 @@ GIFFManager::del_chunk(GUTF8String name) if (end>start && *end=='.') cur_sec=cur_sec->get_chunk(GUTF8String(start, end-start)); if (!cur_sec) - G_THROW( ERR_MSG("GIFFManager.cant_find") "\t"+GUTF8String(name)); + G_THROW( ERR_MSG("GIFFManager.cant_tqfind") "\t"+GUTF8String(name)); } while(*end); if (!start[0]) @@ -631,7 +631,7 @@ GIFFManager::load_file(GP<ByteStream> str) if (istr.get_chunk(chunk_id)) { if (chunk_id.substr(0,5) != "FORM:") - G_THROW( ERR_MSG("GIFFManager.cant_find2") ); + G_THROW( ERR_MSG("GIFFManager.cant_tqfind2") ); set_name(chunk_id); load_chunk(istr, top_level); istr.close_chunk(); diff --git a/kviewshell/plugins/djvu/libdjvu/GIFFManager.h b/kviewshell/plugins/djvu/libdjvu/GIFFManager.h index 722f592f..96f13f8f 100644 --- a/kviewshell/plugins/djvu/libdjvu/GIFFManager.h +++ b/kviewshell/plugins/djvu/libdjvu/GIFFManager.h @@ -149,7 +149,7 @@ public: /** Returns the chunk with given {\em name}. The {\em name} may not contain dots, but MAY contain colons and brackets (the latter - for specifying the chunk number). If {\em position} is not zero - then the chunk position in its parent will be put into #*position# */ + then the chunk position in its tqparent will be put into #*position# */ GP<GIFFChunk>get_chunk(const GUTF8String &name, int * position=0); /** Returns the number of chunks with given {\em name}. The {\em name} may not contain dots and brackets. If {\em name} is ZERO, the @@ -233,10 +233,10 @@ GIFFChunk::GIFFChunk(const GUTF8String &name, const TArray<char> & data_in) : \item You may use {\em brackets} in the name to specify the chunk's position. The meaning of the number inside the brackets depends on the function you call. In most of the cases this is the number - of the chunk with the given name in the parent chunk. But sometimes + of the chunk with the given name in the tqparent chunk. But sometimes (as in #addChunk(name, buffer, length)#) the brackets at the end of the #name# actually specify the {\em position} of the - chunk in the parent. For example, to insert #INCL# chunk into + chunk in the tqparent. For example, to insert #INCL# chunk into #DJVU# form at position #1# (make it the second) you may want to use #manager.addChunk(".DJVU.INCL[1]", data, size)#. At the same time, to get 2-nd chunk with name #BG44# from form #DJVU# you @@ -265,8 +265,8 @@ public: /// Sets the name of the top level chunk to {\em name} void set_name(const GUTF8String &name); - /** Adds the chunk {\em chunk} to chunk with name {\em parent_name} at - position {\em pos}. {\em parent_name} may contain dots, brackets + /** Adds the chunk {\em chunk} to chunk with name {\em tqparent_name} at + position {\em pos}. {\em tqparent_name} may contain dots, brackets and colons. All missing chunks in the chain will be created. {\bf Examples:} @@ -282,7 +282,7 @@ public: ;; Same thing regardless of the top-level chunk name m.addChunk("FORM:DJVU[1]", ch); \end{verbatim} */ - void add_chunk(GUTF8String parent_name, const GP<GIFFChunk> & chunk, int pos=-1); + void add_chunk(GUTF8String tqparent_name, const GP<GIFFChunk> & chunk, int pos=-1); /** If {\em name}={\em name1}.{\em name2} where {\em name2} doesn't contain dots, then #addChunk()# will create plain chunk with name {\em name2} with data {\em buffer} of size {\em length} and @@ -332,7 +332,7 @@ public: /** Returns the chunk with name {\em name}. The {\em name} may contain dots colons and slashes. If {\em position} is not zero, #*position# will - be assigned the position of the found chunk in the parent chunk. + be assigned the position of the found chunk in the tqparent chunk. {\bf Examples:} \begin{verbatim} diff --git a/kviewshell/plugins/djvu/libdjvu/GMapAreas.cpp b/kviewshell/plugins/djvu/libdjvu/GMapAreas.cpp index 5a85e1fc..ef364e79 100644 --- a/kviewshell/plugins/djvu/libdjvu/GMapAreas.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GMapAreas.cpp @@ -953,7 +953,7 @@ static GUTF8String GMapArea2xmltag(const GMapArea &area,const GUTF8String &coords) { GUTF8String retval("<AREA coords=\"" - +coords+"\" shape=\""+area.get_shape_name()+"\" " + +coords+"\" tqshape=\""+area.get_tqshape_name()+"\" " +"alt=\""+area.comment.toEscaped()+"\" "); if(area.url.length()) { diff --git a/kviewshell/plugins/djvu/libdjvu/GMapAreas.h b/kviewshell/plugins/djvu/libdjvu/GMapAreas.h index 251427ed..f96c0695 100644 --- a/kviewshell/plugins/djvu/libdjvu/GMapAreas.h +++ b/kviewshell/plugins/djvu/libdjvu/GMapAreas.h @@ -86,12 +86,12 @@ namespace DJVU { The currently supported areas can be rectangular (\Ref{GMapRect}), elliptical (\Ref{GMapOval}) and polygonal (\Ref{GMapPoly}). Every - map area besides the definition of its shape contains information + map area besides the definition of its tqshape contains information about display style and optional {\bf URL}, which it may refer to. If this {\bf URL} is not empty then the map area will work like a hyperlink. - The classes also implement some useful functions to ease geometry + The classes also implement some useful functions to ease tqgeometry manipulations @memo Definition of base map area classes @@ -247,10 +247,10 @@ public: virtual GUTF8String get_xmltag(const int height) const=0; - /// Virtual function returning the shape type. - virtual MapAreaType const get_shape_type( void ) const { return UNKNOWN; }; - /// Virtual function returning the shape name. - virtual char const * const get_shape_name(void) const=0; + /// Virtual function returning the tqshape type. + virtual MapAreaType const get_tqshape_type( void ) const { return UNKNOWN; }; + /// Virtual function returning the tqshape name. + virtual char const * const get_tqshape_name(void) const=0; /// Virtual function generating a copy of this object virtual GP<GMapArea> get_copy(void) const=0; /// Virtual function generating a list of defining coordinates @@ -305,7 +305,7 @@ public: /// Returns the height of the rectangle int get_height(void) const { return ymax-ymin; } - /// Changes the #GMapRect#'s geometry + /// Changes the #GMapRect#'s tqgeometry GMapRect & operator=(const GRect & rect); /// Returns \Ref{GRect} describing the map area's rectangle @@ -313,9 +313,9 @@ public: virtual GUTF8String get_xmltag(const int height) const; /// Returns MapRect - virtual MapAreaType const get_shape_type( void ) const { return RECT; }; + virtual MapAreaType const get_tqshape_type( void ) const { return RECT; }; /// Returns #"rect"# - virtual char const * const get_shape_name(void) const; + virtual char const * const get_tqshape_name(void) const; /// Returns a copy of the rectangle virtual GP<GMapArea> get_copy(void) const; /// Virtual function maps rectangle from one area to another using mapper @@ -392,9 +392,9 @@ public: virtual GUTF8String get_xmltag(const int height) const; /// Returns MapPoly - virtual MapAreaType const get_shape_type( void ) const { return POLY; }; + virtual MapAreaType const get_tqshape_type( void ) const { return POLY; }; /// Returns #"poly"# all the time - virtual char const * const get_shape_name(void) const; + virtual char const * const get_tqshape_name(void) const; /// Returns a copy of the polygon virtual GP<GMapArea> get_copy(void) const; /// Virtual function generating a list of defining coordinates @@ -458,9 +458,9 @@ public: virtual GUTF8String get_xmltag(const int height) const; /// Returns MapOval - virtual MapAreaType const get_shape_type( void ) const { return OVAL; }; + virtual MapAreaType const get_tqshape_type( void ) const { return OVAL; }; /// Returns #"oval"# - virtual char const * const get_shape_name(void) const; + virtual char const * const get_tqshape_name(void) const; /// Returns a copy of the oval virtual GP<GMapArea> get_copy(void) const; /// Virtual function maps oval from one area to another using mapper @@ -509,7 +509,7 @@ inline char const * const GMapRect::gma_check_object(void) const{ return ""; } inline char const * const -GMapRect::get_shape_name(void) const { return RECT_TAG; } +GMapRect::get_tqshape_name(void) const { return RECT_TAG; } inline int GMapPoly::get_points_num(void) const { return points; } @@ -524,7 +524,7 @@ inline int GMapPoly::get_y(int i) const { return yy[i]; } inline char const * const -GMapPoly::get_shape_name(void) const { return POLY_TAG; } +GMapPoly::get_tqshape_name(void) const { return POLY_TAG; } inline int GMapOval::get_a(void) const { return a; } @@ -551,7 +551,7 @@ inline int GMapOval::gma_get_ymax(void) const { return ymax; } inline char const * const -GMapOval::get_shape_name(void) const { return OVAL_TAG; } +GMapOval::get_tqshape_name(void) const { return OVAL_TAG; } //@} diff --git a/kviewshell/plugins/djvu/libdjvu/GOS.cpp b/kviewshell/plugins/djvu/libdjvu/GOS.cpp index 94449512..716c49c9 100644 --- a/kviewshell/plugins/djvu/libdjvu/GOS.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GOS.cpp @@ -167,9 +167,9 @@ finddirsep(const GUTF8String &fname) #if defined(UNIX) return fname.rsearch('/',0); #elif defined(WIN32) || defined(OS2) - return fname.rcontains("\\/",0); + return fname.rtqcontains("\\/",0); #elif defined(macintosh) - return fname.rcontains(":/",0); + return fname.rtqcontains(":/",0); #else #error "Define something here for your operating system" #endif @@ -272,7 +272,7 @@ GOS::ticks() return (unsigned long)clk; #elif defined(OS2) ULONG clk = 0; - DosQuerySysInfo(QSV_MS_COUNT, QSV_MS_COUNT, (PVOID)&clk, sizeof(ULONG)); + DosQuerySysInfo(TQSV_MS_COUNT, TQSV_MS_COUNT, (PVOID)&clk, sizeof(ULONG)); return clk; #elif defined(macintosh) return (unsigned long)((double)TickCount()*16.66); diff --git a/kviewshell/plugins/djvu/libdjvu/GPixmap.h b/kviewshell/plugins/djvu/libdjvu/GPixmap.h index 32d51c7e..afbd3512 100644 --- a/kviewshell/plugins/djvu/libdjvu/GPixmap.h +++ b/kviewshell/plugins/djvu/libdjvu/GPixmap.h @@ -306,13 +306,13 @@ public: #Alpha# denotes the gray value, in range #[0,1]#, represented by the corresponding pixel of bitmap #bm#. */ void attenuate(const GBitmap *bm, int x, int y); - /** Blits solid color #color# through transparency mask #bm#. + /** Blits solid color #color# through transparency tqmask #bm#. Bitmap #bm# is positionned at location #x#,#y# over this color image. The matching color image pixels are then modified by adding color #color# multiplied by #Alpha#, where #Alpha# denotes the gray value, in range #[0,1]#, represented by the corresponding pixel of bitmap #bm#. */ void blit(const GBitmap *bm, int x, int y, const GPixel *color); - /** Blits pixmap #color# through transparency mask #bm#. + /** Blits pixmap #color# through transparency tqmask #bm#. Bitmap #bm# is positionned at location #x#,#y# over this color image. The matching color image pixels are then modified by adding the corresponding pixel color in pixmap #color#, multiplied by #Alpha#, diff --git a/kviewshell/plugins/djvu/libdjvu/GRect.cpp b/kviewshell/plugins/djvu/libdjvu/GRect.cpp index 1ac0a87c..1cc49e8f 100644 --- a/kviewshell/plugins/djvu/libdjvu/GRect.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GRect.cpp @@ -184,7 +184,7 @@ GRect::recthull(const GRect &rect1, const GRect &rect2) } int -GRect::contains(const GRect & rect) const +GRect::tqcontains(const GRect & rect) const { GRect tmp_rect; tmp_rect.intersect(*this, rect); diff --git a/kviewshell/plugins/djvu/libdjvu/GRect.h b/kviewshell/plugins/djvu/libdjvu/GRect.h index 1a86f80d..f3e031e1 100644 --- a/kviewshell/plugins/djvu/libdjvu/GRect.h +++ b/kviewshell/plugins/djvu/libdjvu/GRect.h @@ -132,7 +132,7 @@ namespace DJVU { class GRect { public: - /** #OrientationBits# defines 3 mutually exclusive + /** #Qt::OrientationBits# defines 3 mutually exclusive bits to indicate the image orientation. There are four possible rotation values for an image @@ -150,7 +150,7 @@ public: }; /** #Orientations# defines all 8 possible orientations, using - the three \Ref{OrientationBits}. + the three \Ref{Qt::OrientationBits}. \begin{itemize} \item {\em TDLRNR} for Top Down, Left to Right, No Rotation. \item {\em BULRNR} for Bottom Up, Left to Right, No Rotation. @@ -209,11 +209,11 @@ public: contains all pixels with horizontal pixel coordinates in range #xmin# (inclusive) to #xmax# (exclusive) and vertical coordinates #ymin# (inclusive) to #ymax# (exclusive). */ - int contains(int x, int y) const; + int tqcontains(int x, int y) const; /** Returns true if this rectangle contains the passed rectangle #rect#. The function basically checks, that the intersection of this rectangle with #rect# is #rect#. */ - int contains(const GRect & rect) const; + int tqcontains(const GRect & rect) const; /** Returns true if rectangles #r1# and #r2# are equal. */ friend int operator==(const GRect & r1, const GRect & r2); /** Returns true if rectangles #r1# and #r2# are not equal. */ @@ -379,7 +379,7 @@ GRect::area() const } inline int -GRect::contains(int x, int y) const +GRect::tqcontains(int x, int y) const { return (x>=xmin && x<xmax && y>=ymin && y<ymax); } diff --git a/kviewshell/plugins/djvu/libdjvu/GSmartPointer.cpp b/kviewshell/plugins/djvu/libdjvu/GSmartPointer.cpp index 8c17755d..a55e8cdf 100644 --- a/kviewshell/plugins/djvu/libdjvu/GSmartPointer.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GSmartPointer.cpp @@ -187,7 +187,7 @@ GPBase::assign (const GPBase &sptr) void -GPBufferBase::replace(void *nptr,const size_t n) +GPBufferBase::tqreplace(void *nptr,const size_t n) { resize(0,0); ptr=nptr; diff --git a/kviewshell/plugins/djvu/libdjvu/GSmartPointer.h b/kviewshell/plugins/djvu/libdjvu/GSmartPointer.h index 04b79ecf..c12db5cb 100644 --- a/kviewshell/plugins/djvu/libdjvu/GSmartPointer.h +++ b/kviewshell/plugins/djvu/libdjvu/GSmartPointer.h @@ -117,7 +117,7 @@ public: GPBufferBase(void *&,const size_t n,const size_t t); void swap(GPBufferBase &p); void resize(const size_t n,const size_t t); - void replace(void *nptr,const size_t n); + void tqreplace(void *nptr,const size_t n); void set(const size_t t,const char c); ~GPBufferBase(); operator int(void) const { return ptr ? num : 0; } diff --git a/kviewshell/plugins/djvu/libdjvu/GString.cpp b/kviewshell/plugins/djvu/libdjvu/GString.cpp index a618055e..8242279a 100644 --- a/kviewshell/plugins/djvu/libdjvu/GString.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GString.cpp @@ -1538,14 +1538,14 @@ GUTF8String::fromEscaped( const GMap<GUTF8String,GUTF8String> ConvMap ) const } }else { - GPosition map_entry = ConvMap.contains( key ); + GPosition map_entry = ConvMap.tqcontains( key ); if( map_entry ) { // Found in the conversion map, substitute ret += ConvMap[map_entry]; } else { static const GMap<GUTF8String,GUTF8String> &Basic = BasicMap(); - GPosition map_entry = Basic.contains( key ); + GPosition map_entry = Basic.tqcontains( key ); if ( map_entry ) { ret += Basic[map_entry]; @@ -1799,7 +1799,7 @@ GStringRep::rsearch(char const *ptr, int from) const } int -GStringRep::contains(const char accept[],int from) const +GStringRep::tqcontains(const char accept[],int from) const { if(from<0) { @@ -1821,10 +1821,10 @@ GStringRep::contains(const char accept[],int from) const } int -GStringRep::rcontains(const char accept[],int from) const +GStringRep::rtqcontains(const char accept[],int from) const { int retval=(-1); - while((from=contains(accept,from)) >= 0) + while((from=tqcontains(accept,from)) >= 0) { retval=from++; } diff --git a/kviewshell/plugins/djvu/libdjvu/GString.h b/kviewshell/plugins/djvu/libdjvu/GString.h index 601db983..9614d328 100644 --- a/kviewshell/plugins/djvu/libdjvu/GString.h +++ b/kviewshell/plugins/djvu/libdjvu/GString.h @@ -306,9 +306,9 @@ public: int rsearch(char const *str, int from=0) const; - int contains(char const accept[], int from=0) const; + int tqcontains(char const accept[], int from=0) const; - int rcontains(char const accept[], int from=0) const; + int rtqcontains(char const accept[], int from=0) const; protected: // Return the next character and increment the source pointer. @@ -551,11 +551,11 @@ public: /** Searches for any of the specified characters in the accept string. It returns #-1# if the none of the characters and be found, otherwise the position of the first match. */ - int contains(const char accept[], const int from=0) const; + int tqcontains(const char accept[], const int from=0) const; /** Searches for any of the specified characters in the accept string. It returns #-1# if the none of the characters and be found, otherwise the position of the last match. */ - int rcontains(const char accept[], const int from=0) const; + int rtqcontains(const char accept[], const int from=0) const; /** Concatenates strings. Returns a string composed by concatenating the characters of strings #s1# and #s2#. */ @@ -1282,12 +1282,12 @@ GBaseString::rsearch(const char *str, const int from) const { return ptr?((*this)->rsearch(str,from)):(-1); } inline int -GBaseString::contains(const char accept[], const int from) const -{ return ptr?((*this)->contains(accept,from)):(-1); } +GBaseString::tqcontains(const char accept[], const int from) const +{ return ptr?((*this)->tqcontains(accept,from)):(-1); } inline int -GBaseString::rcontains(const char accept[], const int from) const -{ return ptr?((*this)->rcontains(accept,from)):(-1); } +GBaseString::rtqcontains(const char accept[], const int from) const +{ return ptr?((*this)->rtqcontains(accept,from)):(-1); } inline int GBaseString::cmp(const GBaseString &s2, const int len) const diff --git a/kviewshell/plugins/djvu/libdjvu/GThreads.cpp b/kviewshell/plugins/djvu/libdjvu/GThreads.cpp index ce88361e..3b52faca 100644 --- a/kviewshell/plugins/djvu/libdjvu/GThreads.cpp +++ b/kviewshell/plugins/djvu/libdjvu/GThreads.cpp @@ -1397,7 +1397,7 @@ cotask_select(int nfds, } // reschedule cotask_yield(); - // call select to update masks + // call select to update tqmasks if (tm) { tm->tv_sec = maxwait/1000; @@ -1837,16 +1837,16 @@ GSafeFlags::operator long(void) const } bool -GSafeFlags::test_and_modify(long set_mask, long clr_mask, - long set_mask1, long clr_mask1) +GSafeFlags::test_and_modify(long set_tqmask, long clr_tqmask, + long set_tqmask1, long clr_tqmask1) { enter(); - if ((flags & set_mask)==set_mask && - (~flags & clr_mask)==clr_mask) + if ((flags & set_tqmask)==set_tqmask && + (~flags & clr_tqmask)==clr_tqmask) { long new_flags=flags; - new_flags|=set_mask1; - new_flags&=~clr_mask1; + new_flags|=set_tqmask1; + new_flags&=~clr_tqmask1; if (new_flags!=flags) { flags=new_flags; @@ -1860,15 +1860,15 @@ GSafeFlags::test_and_modify(long set_mask, long clr_mask, } void -GSafeFlags::wait_and_modify(long set_mask, long clr_mask, - long set_mask1, long clr_mask1) +GSafeFlags::wait_and_modify(long set_tqmask, long clr_tqmask, + long set_tqmask1, long clr_tqmask1) { enter(); - while((flags & set_mask)!=set_mask || - (~flags & clr_mask)!=clr_mask) wait(); + while((flags & set_tqmask)!=set_tqmask || + (~flags & clr_tqmask)!=clr_tqmask) wait(); long new_flags=flags; - new_flags|=set_mask1; - new_flags&=~clr_mask1; + new_flags|=set_tqmask1; + new_flags&=~clr_tqmask1; if (flags!=new_flags) { flags=new_flags; diff --git a/kviewshell/plugins/djvu/libdjvu/GThreads.h b/kviewshell/plugins/djvu/libdjvu/GThreads.h index 92691db4..2235e2b6 100644 --- a/kviewshell/plugins/djvu/libdjvu/GThreads.h +++ b/kviewshell/plugins/djvu/libdjvu/GThreads.h @@ -516,36 +516,36 @@ public: /** Returns the value of the flags */ operator long(void) const; - /** Modifies the flags by ORing them with the provided mask. A broadcast + /** Modifies the flags by ORing them with the provided tqmask. A broadcast will be sent after the modification is done. */ - GSafeFlags & operator|=(long mask); - /** Modifies the flags by ANDing them with the provided mask. A broadcast + GSafeFlags & operator|=(long tqmask); + /** Modifies the flags by ANDing them with the provided tqmask. A broadcast will be sent after the modification is done. */ - GSafeFlags & operator&=(long mask); + GSafeFlags & operator&=(long tqmask); - /** If all bits mentioned in #set_mask# are set in the flags and all - bits mentioned in #clr_mask# are cleared in the flags, it sets all - bits from #set_mask1# in the flags, clears all flags from - #clr_mask1# in the flags and returns #TRUE#. Otherwise returns + /** If all bits mentioned in #set_tqmask# are set in the flags and all + bits mentioned in #clr_tqmask# are cleared in the flags, it sets all + bits from #set_tqmask1# in the flags, clears all flags from + #clr_tqmask1# in the flags and returns #TRUE#. Otherwise returns #FALSE#. */ - bool test_and_modify(long set_mask, long clr_mask, - long set_mask1, long clr_mask1); + bool test_and_modify(long set_tqmask, long clr_tqmask, + long set_tqmask1, long clr_tqmask1); - /** Waits until all bits mentioned in #set_mask# are set in the flags + /** Waits until all bits mentioned in #set_tqmask# are set in the flags and all bits mentioned in #clr_flags# are cleared in the flags. - After that it sets bits from #set_mask1# and clears bits from - #clr_mask1# in the flags. */ - void wait_and_modify(long set_mask, long clr_mask, - long set_mask1, long clr_mask1); + After that it sets bits from #set_tqmask1# and clears bits from + #clr_tqmask1# in the flags. */ + void wait_and_modify(long set_tqmask, long clr_tqmask, + long set_tqmask1, long clr_tqmask1); - /** Waits until all bits set in #set_mask# are set in the flags and - all bits mentioned in #clr_mask# are cleared in the flags. */ - void wait_for_flags(long set_mask, long clr_mask=0) const; + /** Waits until all bits set in #set_tqmask# are set in the flags and + all bits mentioned in #clr_tqmask# are cleared in the flags. */ + void wait_for_flags(long set_tqmask, long clr_tqmask=0) const; - /** Modifies the flags by setting all bits mentioned in #set_mask# - and clearing all bits mentioned in #clr_mask#. If the flags have + /** Modifies the flags by setting all bits mentioned in #set_tqmask# + and clearing all bits mentioned in #clr_tqmask#. If the flags have actually been modified, a broadcast will be sent. */ - void modify(long set_mask, long clr_mask); + void modify(long set_tqmask, long clr_tqmask); }; inline @@ -555,28 +555,28 @@ GSafeFlags::GSafeFlags(long xflags) } inline void -GSafeFlags::wait_for_flags(long set_mask, long clr_mask) const +GSafeFlags::wait_for_flags(long set_tqmask, long clr_tqmask) const { - ((GSafeFlags *) this)->wait_and_modify(set_mask, clr_mask, 0, 0); + ((GSafeFlags *) this)->wait_and_modify(set_tqmask, clr_tqmask, 0, 0); } inline void -GSafeFlags::modify(long set_mask, long clr_mask) +GSafeFlags::modify(long set_tqmask, long clr_tqmask) { - test_and_modify(0, 0, set_mask, clr_mask); + test_and_modify(0, 0, set_tqmask, clr_tqmask); } inline GSafeFlags & -GSafeFlags::operator|=(long mask) +GSafeFlags::operator|=(long tqmask) { - test_and_modify(0, 0, mask, 0); + test_and_modify(0, 0, tqmask, 0); return *this; } inline GSafeFlags & -GSafeFlags::operator&=(long mask) +GSafeFlags::operator&=(long tqmask) { - test_and_modify(0, 0, 0, ~mask); + test_and_modify(0, 0, 0, ~tqmask); return *this; } diff --git a/kviewshell/plugins/djvu/libdjvu/GURL.h b/kviewshell/plugins/djvu/libdjvu/GURL.h index eb3ed4bc..b76d000b 100644 --- a/kviewshell/plugins/djvu/libdjvu/GURL.h +++ b/kviewshell/plugins/djvu/libdjvu/GURL.h @@ -106,7 +106,7 @@ namespace DJVU { to the same file name. Compare #file:/dir/file.djvu# and #file://localhost/dir/file.djvu#. - To simplify a developer's life we have created this class, which contains + To simplify a developer's life we have created this class, which tqcontains inside a canonical representation of URLs. File URLs are converted to internal format with the help of \Ref{GOS} class. diff --git a/kviewshell/plugins/djvu/libdjvu/IFFByteStream.cpp b/kviewshell/plugins/djvu/libdjvu/IFFByteStream.cpp index c8b79809..59f729b4 100644 --- a/kviewshell/plugins/djvu/libdjvu/IFFByteStream.cpp +++ b/kviewshell/plugins/djvu/libdjvu/IFFByteStream.cpp @@ -444,7 +444,7 @@ IFFByteStream::full_id(GUTF8String &chkid) short_id(chkid); if (ctx->bComposite) return; - // Search parent FORM or PROP chunk. + // Search tqparent FORM or PROP chunk. for (IFFContext *ct = ctx->next; ct; ct=ct->next) if (memcmp(ct->idOne, "FOR", 3)==0 || memcmp(ct->idOne, "PRO", 3)==0 ) diff --git a/kviewshell/plugins/djvu/libdjvu/IW44EncodeCodec.cpp b/kviewshell/plugins/djvu/libdjvu/IW44EncodeCodec.cpp index c63eda7d..eb429563 100644 --- a/kviewshell/plugins/djvu/libdjvu/IW44EncodeCodec.cpp +++ b/kviewshell/plugins/djvu/libdjvu/IW44EncodeCodec.cpp @@ -160,9 +160,9 @@ public: Encode(void); /** Initializes an IWBitmap with image #bm#. This constructor performs the wavelet decomposition of image #bm# and records the - corresponding wavelet coefficient. Argument #mask# is an optional - bilevel image specifying the masked pixels (see \Ref{IW44Image.h}). */ - void init(const GBitmap &bm, const GP<GBitmap> mask=0); + corresponding wavelet coefficient. Argument #tqmask# is an optional + bilevel image specifying the tqmasked pixels (see \Ref{IW44Image.h}). */ + void init(const GBitmap &bm, const GP<GBitmap> tqmask=0); // CODER /** Encodes one data chunk into ByteStream #bs#. Parameter #parms# controls how much data is generated. The chunk data is written to ByteStream @@ -211,11 +211,11 @@ public: Encode(void); /** Initializes an IWPixmap with color image #bm#. This constructor performs the wavelet decomposition of image #bm# and records the - corresponding wavelet coefficient. Argument #mask# is an optional - bilevel image specifying the masked pixels (see \Ref{IW44Image.h}). + corresponding wavelet coefficient. Argument #tqmask# is an optional + bilevel image specifying the tqmasked pixels (see \Ref{IW44Image.h}). Argument #crcbmode# specifies how the chrominance information should be encoded (see \Ref{CRCBMode}). */ - void init(const GPixmap &bm, const GP<GBitmap> mask=0, CRCBMode crcbmode=CRCBnormal); + void init(const GPixmap &bm, const GP<GBitmap> tqmask=0, CRCBMode crcbmode=CRCBnormal); // CODER /** Encodes one data chunk into ByteStream #bs#. Parameter #parms# controls how much data is generated. The chunk data is written to ByteStream @@ -720,17 +720,17 @@ IW44Image::Transform::Encode::RGB_to_Cr(const GPixel *p, int w, int h, int rowsi static void -interpolate_mask(short *data16, int w, int h, int rowsize, - const signed char *mask8, int mskrowsize) +interpolate_tqmask(short *data16, int w, int h, int rowsize, + const signed char *tqmask8, int mskrowsize) { int i,j; - // count masked bits + // count tqmasked bits short *count; GPBuffer<short> gcount(count,w*h); short *cp = count; - for (i=0; i<h; i++, cp+=w, mask8+=mskrowsize) + for (i=0; i<h; i++, cp+=w, tqmask8+=mskrowsize) for (j=0; j<w; j++) - cp[j] = (mask8[j] ? 0 : 0x1000); + cp[j] = (tqmask8[j] ? 0 : 0x1000); // copy image short *sdata; GPBuffer<short> gsdata(sdata,w*h); @@ -820,8 +820,8 @@ interpolate_mask(short *data16, int w, int h, int rowsize, static void -forward_mask(short *data16, int w, int h, int rowsize, int begin, int end, - const signed char *mask8, int mskrowsize ) +forward_tqmask(short *data16, int w, int h, int rowsize, int begin, int end, + const signed char *tqmask8, int mskrowsize ) { int i,j; signed char *m; @@ -830,12 +830,12 @@ forward_mask(short *data16, int w, int h, int rowsize, int begin, int end, // Allocate buffers short *sdata; GPBuffer<short> gsdata(sdata,w*h); - signed char *smask; - GPBuffer<signed char> gsmask(smask,w*h); - // Copy mask - m = smask; - for (i=0; i<h; i+=1, m+=w, mask8+=mskrowsize) - memcpy((void*)m, (void*)mask8, w); + signed char *stqmask; + GPBuffer<signed char> gstqmask(stqmask,w*h); + // Copy tqmask + m = stqmask; + for (i=0; i<h; i+=1, m+=w, tqmask8+=mskrowsize) + memcpy((void*)m, (void*)tqmask8, w); // Loop over scale for (int scale=begin; scale<end; scale<<=1) { @@ -851,9 +851,9 @@ forward_mask(short *data16, int w, int h, int rowsize, int begin, int end, } // Decompose IW44Image::Transform::Encode::forward(sdata, w, h, w, scale, scale+scale); - // Cancel masked coefficients + // Cancel tqmasked coefficients d = sdata; - m = smask; + m = stqmask; for (i=0; i<h; i+=scale+scale) { for (j=scale; j<w; j+=scale+scale) @@ -875,7 +875,7 @@ forward_mask(short *data16, int w, int h, int rowsize, int begin, int end, // Correct visible pixels p = data16; d = sdata; - m = smask; + m = stqmask; for (i=0; i<h; i+=scale) { for (j=0; j<w; j+=scale) @@ -897,8 +897,8 @@ forward_mask(short *data16, int w, int h, int rowsize, int begin, int end, p += rowsize * scale; d += w * scale; } - // Compute new mask for next scale - m = smask; + // Compute new tqmask for next scale + m = stqmask; signed char *m0 = m; signed char *m1 = m; for (i=0; i<h; i+=scale+scale) @@ -941,15 +941,15 @@ IW44Image::Map::Encode::create(const signed char *img8, int imgrowsize, for (i=ih; i<bh; i++) for (j=0; j<bw; j++) *p++ = 0; - // Handle bitmask + // Handle bittqmask if (msk8) { - // Interpolate pixels below mask + // Interpolate pixels below tqmask DJVU_PROGRESS_RUN(transf, 1); - interpolate_mask(data16, iw, ih, bw, msk8, mskrowsize); - // Multiscale iterative masked decomposition + interpolate_tqmask(data16, iw, ih, bw, msk8, mskrowsize); + // Multiscale iterative tqmasked decomposition DJVU_PROGRESS_RUN(transf, 3); - forward_mask(data16, iw, ih, bw, 1, 32, msk8, mskrowsize); + forward_tqmask(data16, iw, ih, bw, 1, 32, msk8, mskrowsize); } else { @@ -1393,11 +1393,11 @@ IW44Image::create_encode(const ImageType itype) } GP<IW44Image> -IW44Image::create_encode(const GBitmap &bm, const GP<GBitmap> mask) +IW44Image::create_encode(const GBitmap &bm, const GP<GBitmap> tqmask) { IWBitmap::Encode *bit=new IWBitmap::Encode(); GP<IW44Image> retval=bit; - bit->init(bm, mask); + bit->init(bm, tqmask); return retval; } @@ -1412,7 +1412,7 @@ IWBitmap::Encode::~Encode() } void -IWBitmap::Encode::init(const GBitmap &bm, const GP<GBitmap> gmask) +IWBitmap::Encode::init(const GBitmap &bm, const GP<GBitmap> gtqmask) { // Free close_codec(); @@ -1430,14 +1430,14 @@ IWBitmap::Encode::init(const GBitmap &bm, const GP<GBitmap> gmask) for (i=0; i<256; i++) bconv[i] = max(0,min(255,i*255/g)) - 128; // Perform decomposition - // Prepare mask information + // Prepare tqmask information const signed char *msk8 = 0; int mskrowsize = 0; - GBitmap *mask=gmask; - if (gmask) + GBitmap *tqmask=gtqmask; + if (gtqmask) { - msk8 = (const signed char*)((*mask)[0]); - mskrowsize = mask->rowsize(); + msk8 = (const signed char*)((*tqmask)[0]); + mskrowsize = tqmask->rowsize(); } // Prepare a buffer of signed bytes for (i=0; i<h; i++) @@ -1556,11 +1556,11 @@ IWBitmap::Encode::encode_iff(IFFByteStream &iff, int nchunks, const IWEncoderPar GP<IW44Image> IW44Image::create_encode( - const GPixmap &pm, const GP<GBitmap> gmask, CRCBMode crcbmode) + const GPixmap &pm, const GP<GBitmap> gtqmask, CRCBMode crcbmode) { IWPixmap::Encode *pix=new IWPixmap::Encode(); GP<IW44Image> retval=pix; - pix->init(pm, gmask,(IWPixmap::Encode::CRCBMode)crcbmode); + pix->init(pm, gtqmask,(IWPixmap::Encode::CRCBMode)crcbmode); return retval; } @@ -1574,7 +1574,7 @@ IWPixmap::Encode::~Encode() } void -IWPixmap::Encode::init(const GPixmap &pm, const GP<GBitmap> gmask, CRCBMode crcbmode) +IWPixmap::Encode::init(const GPixmap &pm, const GP<GBitmap> gtqmask, CRCBMode crcbmode) { /* Free */ close_codec(); @@ -1598,14 +1598,14 @@ IWPixmap::Encode::init(const GPixmap &pm, const GP<GBitmap> gmask, CRCBMode crcb case CRCBnormal: crcb_half=0; crcb_delay=10; break; case CRCBfull: crcb_half=0; crcb_delay= 0; break; } - // Prepare mask information + // Prepare tqmask information const signed char *msk8 = 0; int mskrowsize = 0; - GBitmap *mask=gmask; - if (mask) + GBitmap *tqmask=gtqmask; + if (tqmask) { - msk8 = (signed char const *)((*mask)[0]); - mskrowsize = mask->rowsize(); + msk8 = (signed char const *)((*tqmask)[0]); + mskrowsize = tqmask->rowsize(); } // Fill buffer with luminance information DJVU_PROGRESS_TASK(create,"initialize pixmap",3); diff --git a/kviewshell/plugins/djvu/libdjvu/IW44Image.cpp b/kviewshell/plugins/djvu/libdjvu/IW44Image.cpp index 2cadf4f9..b4ca3405 100644 --- a/kviewshell/plugins/djvu/libdjvu/IW44Image.cpp +++ b/kviewshell/plugins/djvu/libdjvu/IW44Image.cpp @@ -638,7 +638,7 @@ IW44Image::Map::alloc(int n) short ** IW44Image::Map::allocp(int n) { - // Allocate enough room for pointers plus alignment + // Allocate enough room for pointers plus tqalignment short *p = alloc( (n+1) * sizeof(short*) / sizeof(short) ); // Align on pointer size while ( ((long)p) & (sizeof(short*)-1) ) @@ -934,7 +934,7 @@ IW44Image::Codec::Codec(IW44Image::Map &xmap) IW44Image::Codec::~Codec() {} // is_null_slice -// -- check if data can be produced for this band/mask +// -- check if data can be produced for this band/tqmask // -- also fills the sure_zero array int diff --git a/kviewshell/plugins/djvu/libdjvu/IW44Image.h b/kviewshell/plugins/djvu/libdjvu/IW44Image.h index 56cf00fa..954eee56 100644 --- a/kviewshell/plugins/djvu/libdjvu/IW44Image.h +++ b/kviewshell/plugins/djvu/libdjvu/IW44Image.h @@ -137,11 +137,11 @@ {\bf Masking} --- When we create a DjVu image, we often know that certain pixels of the background image are going to be covered by foreground objects like text or drawings. The DjVu IW44 wavelet decomposition - routine can use an optional bilevel image named the mask. Every non zero - pixel in the mask means the value of the corresponding pixel in the + routine can use an optional bilevel image named the tqmask. Every non zero + pixel in the tqmask means the value of the corresponding pixel in the background image is irrelevant. The wavelet decomposition code will - replace these masked pixels by a color value whose coding cost is minimal - (see \URL{http://www.research.att.com/~leonb/DJVU/mask}). + replace these tqmasked pixels by a color value whose coding cost is minimal + (see \URL{http://www.research.att.com/~leonb/DJVU/tqmask}). {\bf ToDo} --- There are many improvements to be made. Besides better quantization algorithms (such as trellis quantization and bitrate @@ -277,16 +277,16 @@ public: virtual ~IW44Image(); /** Initializes an IWBitmap with image #bm#. This constructor performs the wavelet decomposition of image #bm# and records the - corresponding wavelet coefficient. Argument #mask# is an optional - bilevel image specifying the masked pixels (see \Ref{IW44Image.h}). */ - static GP<IW44Image> create_encode(const GBitmap &bm, const GP<GBitmap> mask=0); + corresponding wavelet coefficient. Argument #tqmask# is an optional + bilevel image specifying the tqmasked pixels (see \Ref{IW44Image.h}). */ + static GP<IW44Image> create_encode(const GBitmap &bm, const GP<GBitmap> tqmask=0); /** Initializes an IWPixmap with color image #bm#. This constructor performs the wavelet decomposition of image #bm# and records the - corresponding wavelet coefficient. Argument #mask# is an optional - bilevel image specifying the masked pixels (see \Ref{IW44Image.h}). + corresponding wavelet coefficient. Argument #tqmask# is an optional + bilevel image specifying the tqmasked pixels (see \Ref{IW44Image.h}). Argument #crcbmode# specifies how the chrominance information should be encoded (see \Ref{CRCBMode}). */ - static GP<IW44Image> create_encode(const GPixmap &bm, const GP<GBitmap> mask=0, CRCBMode crcbmode=CRCBnormal); + static GP<IW44Image> create_encode(const GPixmap &bm, const GP<GBitmap> tqmask=0, CRCBMode crcbmode=CRCBnormal); // ACCESS /** Returns the width of the IWBitmap image. */ int get_width(void) const; @@ -618,7 +618,7 @@ public: int pixsep=1, int fast=0); // array of blocks IW44Image::Block *blocks; - // geometry + // tqgeometry int iw, ih; int bw, bh; int nb; diff --git a/kviewshell/plugins/djvu/libdjvu/JB2EncodeCodec.cpp b/kviewshell/plugins/djvu/libdjvu/JB2EncodeCodec.cpp index 5a8092a0..57dd5200 100644 --- a/kviewshell/plugins/djvu/libdjvu/JB2EncodeCodec.cpp +++ b/kviewshell/plugins/djvu/libdjvu/JB2EncodeCodec.cpp @@ -104,13 +104,13 @@ public: protected: void CodeNum(const int num, const int lo, const int hi, NumContext &ctx); - void encode_libonly_shape(const GP<JB2Image> &jim, int shapeno); + void encode_libonly_tqshape(const GP<JB2Image> &jim, int tqshapeno); // virtual bool CodeBit(const bool bit, BitContext &ctx); void code_comment(GUTF8String &comment); void code_record_type(int &rectype); int code_match_index(int &index, JB2Dict &jim); - void code_inherited_shape_count(JB2Dict &jim); + void code_inherited_tqshape_count(JB2Dict &jim); void code_image_size(JB2Dict &jim); void code_image_size(JB2Image &jim); void code_absolute_location(JB2Blit *jblt, int rows, int columns); @@ -166,7 +166,7 @@ JB2Image::encode(const GP<ByteStream> &gbs) const #define MATCHED_REFINE_IMAGE_ONLY (6) #define MATCHED_COPY (7) #define NON_MARK_DATA (8) -#define REQUIRED_DICT_OR_RESET (9) +#define RETQUIRED_DICT_OR_RESET (9) #define PRESERVED_COMMENT (10) #define END_OF_DATA (11) @@ -228,18 +228,18 @@ JB2Dict::JB2Codec::Encode::code_record_type(int &rectype) int JB2Dict::JB2Codec::Encode::code_match_index(int &index, JB2Dict &jim) { - int match=shape2lib[index]; - CodeNum(match, 0, lib2shape.hbound(), dist_match_index); + int match=tqshape2lib[index]; + CodeNum(match, 0, lib2tqshape.hbound(), dist_match_index); return match; } // CODE PAIRS void -JB2Dict::JB2Codec::Encode::code_inherited_shape_count(JB2Dict &jim) +JB2Dict::JB2Codec::Encode::code_inherited_tqshape_count(JB2Dict &jim) { - CodeNum(jim.get_inherited_shape_count(), - 0, BIGPOSITIVE, inherited_shape_count_dist); + CodeNum(jim.get_inherited_tqshape_count(), + 0, BIGPOSITIVE, inherited_tqshape_count_dist); } void @@ -360,12 +360,12 @@ JB2Dict::JB2Codec::Encode::code(const GP<JB2Dict> &gjim) // ------------------------- // THIS IS THE ENCODING PART // ------------------------- - int firstshape = jim.get_inherited_shape_count(); - int nshape = jim.get_shape_count(); + int firsttqshape = jim.get_inherited_tqshape_count(); + int ntqshape = jim.get_tqshape_count(); init_library(jim); // Code headers. - int rectype = REQUIRED_DICT_OR_RESET; - if (jim.get_inherited_shape_count() > 0) + int rectype = RETQUIRED_DICT_OR_RESET; + if (jim.get_inherited_tqshape_count() > 0) code_record(rectype, gjim, 0); rectype = START_OF_DATA; code_record(rectype, gjim, 0); @@ -373,22 +373,22 @@ JB2Dict::JB2Codec::Encode::code(const GP<JB2Dict> &gjim) rectype = PRESERVED_COMMENT; if (!! jim.comment) code_record(rectype, gjim, 0); - // Encode every shape - int shapeno; - DJVU_PROGRESS_TASK(jb2code,"jb2 encode", nshape-firstshape); - for (shapeno=firstshape; shapeno<nshape; shapeno++) + // Encode every tqshape + int tqshapeno; + DJVU_PROGRESS_TASK(jb2code,"jb2 encode", ntqshape-firsttqshape); + for (tqshapeno=firsttqshape; tqshapeno<ntqshape; tqshapeno++) { - DJVU_PROGRESS_RUN(jb2code, (shapeno-firstshape)|0xff); - // Code shape - JB2Shape &jshp = jim.get_shape(shapeno); - rectype=(jshp.parent >= 0) + DJVU_PROGRESS_RUN(jb2code, (tqshapeno-firsttqshape)|0xff); + // Code tqshape + JB2Shape &jshp = jim.get_tqshape(tqshapeno); + rectype=(jshp.tqparent >= 0) ?MATCHED_REFINE_LIBRARY_ONLY:NEW_MARK_LIBRARY_ONLY; code_record(rectype, gjim, &jshp); - add_library(shapeno, jshp); + add_library(tqshapeno, jshp); // Check numcoder status if (cur_ncell > CELLCHUNK) { - rectype = REQUIRED_DICT_OR_RESET; + rectype = RETQUIRED_DICT_OR_RESET; code_record(rectype, 0, 0); } } @@ -413,35 +413,35 @@ JB2Dict::JB2Codec::Encode::code(const GP<JB2Image> &gjim) // ------------------------- int i; init_library(jim); - int firstshape = jim.get_inherited_shape_count(); - int nshape = jim.get_shape_count(); + int firsttqshape = jim.get_inherited_tqshape_count(); + int ntqshape = jim.get_tqshape_count(); int nblit = jim.get_blit_count(); - // Initialize shape2lib - shape2lib.resize(0,nshape-1); - for (i=firstshape; i<nshape; i++) - shape2lib[i] = -1; - // Determine shapes that go into library (shapeno>=firstshape) - // shape2lib is -2 if used by one blit - // shape2lib is -3 if used by more than one blit - // shape2lib is -4 if used as a parent + // Initialize tqshape2lib + tqshape2lib.resize(0,ntqshape-1); + for (i=firsttqshape; i<ntqshape; i++) + tqshape2lib[i] = -1; + // Determine tqshapes that go into library (tqshapeno>=firsttqshape) + // tqshape2lib is -2 if used by one blit + // tqshape2lib is -3 if used by more than one blit + // tqshape2lib is -4 if used as a tqparent for (i=0; i<nblit; i++) { JB2Blit *jblt = jim.get_blit(i); - int shapeno = jblt->shapeno; - if (shapeno < firstshape) + int tqshapeno = jblt->tqshapeno; + if (tqshapeno < firsttqshape) continue; - if (shape2lib[shapeno] >= -2) - shape2lib[shapeno] -= 1; - shapeno = jim.get_shape(shapeno).parent; - while (shapeno>=firstshape && shape2lib[shapeno]>=-3) + if (tqshape2lib[tqshapeno] >= -2) + tqshape2lib[tqshapeno] -= 1; + tqshapeno = jim.get_tqshape(tqshapeno).tqparent; + while (tqshapeno>=firsttqshape && tqshape2lib[tqshapeno]>=-3) { - shape2lib[shapeno] = -4; - shapeno = jim.get_shape(shapeno).parent; + tqshape2lib[tqshapeno] = -4; + tqshapeno = jim.get_tqshape(tqshapeno).tqparent; } } // Code headers. - int rectype = REQUIRED_DICT_OR_RESET; - if (jim.get_inherited_shape_count() > 0) + int rectype = RETQUIRED_DICT_OR_RESET; + if (jim.get_inherited_tqshape_count() > 0) code_record(rectype, gjim, 0, 0); rectype = START_OF_DATA; code_record(rectype, gjim, 0, 0); @@ -456,41 +456,41 @@ JB2Dict::JB2Codec::Encode::code(const GP<JB2Image> &gjim) { DJVU_PROGRESS_RUN(jb2code, blitno|0xff); JB2Blit *jblt = jim.get_blit(blitno); - int shapeno = jblt->shapeno; - JB2Shape &jshp = jim.get_shape(shapeno); - // Tests if shape exists in library - if (shape2lib[shapeno] >= 0) + int tqshapeno = jblt->tqshapeno; + JB2Shape &jshp = jim.get_tqshape(tqshapeno); + // Tests if tqshape exists in library + if (tqshape2lib[tqshapeno] >= 0) { int rectype = MATCHED_COPY; code_record(rectype, gjim, 0, jblt); } - // Avoid coding null shapes/blits + // Avoid coding null tqshapes/blits else if (jshp.bits) { - // Make sure all parents have been coded - if (jshp.parent>=0 && shape2lib[jshp.parent]<0) - encode_libonly_shape(gjim, jshp.parent); + // Make sure all tqparents have been coded + if (jshp.tqparent>=0 && tqshape2lib[jshp.tqparent]<0) + encode_libonly_tqshape(gjim, jshp.tqparent); // Allocate library entry when needed #define LIBRARY_CONTAINS_ALL int libraryp = 0; #ifdef LIBRARY_CONTAINS_MARKS // baseline - if (jshp.parent >= -1) + if (jshp.tqparent >= -1) libraryp = 1; #endif #ifdef LIBRARY_CONTAINS_SHARED // worse - if (shape2lib[shapeno] <= -3) + if (tqshape2lib[tqshapeno] <= -3) libraryp = 1; #endif #ifdef LIBRARY_CONTAINS_ALL // better libraryp = 1; #endif // Test all blit cases - if (jshp.parent<-1 && !libraryp) + if (jshp.tqparent<-1 && !libraryp) { int rectype = NON_MARK_DATA; code_record(rectype, gjim, &jshp, jblt); } - else if (jshp.parent < 0) + else if (jshp.tqparent < 0) { int rectype = (libraryp ? NEW_MARK : NEW_MARK_IMAGE_ONLY); code_record(rectype, gjim, &jshp, jblt); @@ -500,14 +500,14 @@ JB2Dict::JB2Codec::Encode::code(const GP<JB2Image> &gjim) int rectype = (libraryp ? MATCHED_REFINE : MATCHED_REFINE_IMAGE_ONLY); code_record(rectype, gjim, &jshp, jblt); } - // Add shape to library + // Add tqshape to library if (libraryp) - add_library(shapeno, jshp); + add_library(tqshapeno, jshp); } // Check numcoder status if (cur_ncell > CELLCHUNK) { - rectype = REQUIRED_DICT_OR_RESET; + rectype = RETQUIRED_DICT_OR_RESET; code_record(rectype, 0, 0); } } @@ -522,31 +522,31 @@ JB2Dict::JB2Codec::Encode::code(const GP<JB2Image> &gjim) //////////////////////////////////////// void -JB2Dict::JB2Codec::Encode::encode_libonly_shape( - const GP<JB2Image> &gjim, int shapeno ) +JB2Dict::JB2Codec::Encode::encode_libonly_tqshape( + const GP<JB2Image> &gjim, int tqshapeno ) { if(!gjim) { G_THROW( ERR_MSG("JB2Image.bad_number") ); } JB2Image &jim=*gjim; - // Recursively encode parent shape - JB2Shape &jshp = jim.get_shape(shapeno); - if (jshp.parent>=0 && shape2lib[jshp.parent]<0) - encode_libonly_shape(gjim, jshp.parent); - // Test that library shape must be encoded - if (shape2lib[shapeno] < 0) + // Recursively encode tqparent tqshape + JB2Shape &jshp = jim.get_tqshape(tqshapeno); + if (jshp.tqparent>=0 && tqshape2lib[jshp.tqparent]<0) + encode_libonly_tqshape(gjim, jshp.tqparent); + // Test that library tqshape must be encoded + if (tqshape2lib[tqshapeno] < 0) { // Code library entry - int rectype=(jshp.parent >= 0) + int rectype=(jshp.tqparent >= 0) ?NEW_MARK_LIBRARY_ONLY:MATCHED_REFINE_LIBRARY_ONLY; code_record(rectype, gjim, &jshp, 0); - // Add shape to library - add_library(shapeno, jshp); + // Add tqshape to library + add_library(tqshapeno, jshp); // Check numcoder status if (cur_ncell > CELLCHUNK) { - rectype = REQUIRED_DICT_OR_RESET; + rectype = RETQUIRED_DICT_OR_RESET; code_record(rectype, 0, 0); } } diff --git a/kviewshell/plugins/djvu/libdjvu/JB2Image.cpp b/kviewshell/plugins/djvu/libdjvu/JB2Image.cpp index 7aad9261..d6644cbc 100644 --- a/kviewshell/plugins/djvu/libdjvu/JB2Image.cpp +++ b/kviewshell/plugins/djvu/libdjvu/JB2Image.cpp @@ -110,7 +110,7 @@ protected: void code_comment(GUTF8String &comment); void code_record_type(int &rectype); int code_match_index(int &index, JB2Dict &jim); - void code_inherited_shape_count(JB2Dict &jim); + void code_inherited_tqshape_count(JB2Dict &jim); void code_image_size(JB2Dict &jim); void code_image_size(JB2Image &jim); void code_absolute_location(JB2Blit *jblt, int rows, int columns); @@ -136,28 +136,28 @@ private: JB2Dict::JB2Dict() - : inherited_shapes(0) + : inherited_tqshapes(0) { } void JB2Dict::init() { - inherited_shapes = 0; + inherited_tqshapes = 0; inherited_dict = 0; - shapes.empty(); + tqshapes.empty(); } JB2Shape & -JB2Dict::get_shape(const int shapeno) +JB2Dict::get_tqshape(const int tqshapeno) { JB2Shape *retval; - if(shapeno >= inherited_shapes) + if(tqshapeno >= inherited_tqshapes) { - retval=&shapes[shapeno - inherited_shapes]; + retval=&tqshapes[tqshapeno - inherited_tqshapes]; }else if(inherited_dict) { - retval=&(inherited_dict->get_shape(shapeno)); + retval=&(inherited_dict->get_tqshape(tqshapeno)); }else { G_THROW( ERR_MSG("JB2Image.bad_number") ); @@ -166,15 +166,15 @@ JB2Dict::get_shape(const int shapeno) } const JB2Shape & -JB2Dict::get_shape(const int shapeno) const +JB2Dict::get_tqshape(const int tqshapeno) const { const JB2Shape *retval; - if(shapeno >= inherited_shapes) + if(tqshapeno >= inherited_tqshapes) { - retval=&shapes[shapeno - inherited_shapes]; + retval=&tqshapes[tqshapeno - inherited_tqshapes]; }else if(inherited_dict) { - retval=&(inherited_dict->get_shape(shapeno)); + retval=&(inherited_dict->get_tqshape(tqshapeno)); }else { G_THROW( ERR_MSG("JB2Image.bad_number") ); @@ -185,16 +185,16 @@ JB2Dict::get_shape(const int shapeno) const void JB2Dict::set_inherited_dict(const GP<JB2Dict> &dict) { - if (shapes.size() > 0) + if (tqshapes.size() > 0) G_THROW( ERR_MSG("JB2Image.cant_set") ); if (inherited_dict) G_THROW( ERR_MSG("JB2Image.cant_change") ); inherited_dict = dict; - inherited_shapes = dict->get_shape_count(); + inherited_tqshapes = dict->get_tqshape_count(); // Make sure that inherited bitmaps are marked as shared - for (int i=0; i<inherited_shapes; i++) + for (int i=0; i<inherited_tqshapes; i++) { - JB2Shape &jshp = dict->get_shape(i); + JB2Shape &jshp = dict->get_tqshape(i); if (jshp.bits) jshp.bits->share(); } } @@ -202,30 +202,30 @@ JB2Dict::set_inherited_dict(const GP<JB2Dict> &dict) void JB2Dict::compress() { - for (int i=shapes.lbound(); i<=shapes.hbound(); i++) - shapes[i].bits->compress(); + for (int i=tqshapes.lbound(); i<=tqshapes.hbound(); i++) + tqshapes[i].bits->compress(); } unsigned int JB2Dict::get_memory_usage() const { unsigned int usage = sizeof(JB2Dict); - usage += sizeof(JB2Shape) * shapes.size(); - for (int i=shapes.lbound(); i<=shapes.hbound(); i++) - if (shapes[i].bits) - usage += shapes[i].bits->get_memory_usage(); + usage += sizeof(JB2Shape) * tqshapes.size(); + for (int i=tqshapes.lbound(); i<=tqshapes.hbound(); i++) + if (tqshapes[i].bits) + usage += tqshapes[i].bits->get_memory_usage(); return usage; } int -JB2Dict::add_shape(const JB2Shape &shape) +JB2Dict::add_tqshape(const JB2Shape &tqshape) { - if (shape.parent >= get_shape_count()) - G_THROW( ERR_MSG("JB2Image.bad_parent_shape") ); - int index = shapes.size(); - shapes.touch(index); - shapes[index] = shape; - return index + inherited_shapes; + if (tqshape.tqparent >= get_tqshape_count()) + G_THROW( ERR_MSG("JB2Image.bad_parent_tqshape") ); + int index = tqshapes.size(); + tqshapes.touch(index); + tqshapes[index] = tqshape; + return index + inherited_tqshapes; } void @@ -277,8 +277,8 @@ JB2Image::set_dimension(int awidth, int aheight) int JB2Image::add_blit(const JB2Blit &blit) { - if (blit.shapeno >= (unsigned int)get_shape_count()) - G_THROW( ERR_MSG("JB2Image.bad_shape") ); + if (blit.tqshapeno >= (unsigned int)get_tqshape_count()) + G_THROW( ERR_MSG("JB2Image.bad_tqshape") ); int index = blits.size(); blits.touch(index); blits[index] = blit; @@ -298,9 +298,9 @@ JB2Image::get_bitmap(int subsample, int align) const for (int blitno = 0; blitno < get_blit_count(); blitno++) { const JB2Blit *pblit = get_blit(blitno); - const JB2Shape &pshape = get_shape(pblit->shapeno); - if (pshape.bits) - bm->blit(pshape.bits, pblit->left, pblit->bottom, subsample); + const JB2Shape &ptqshape = get_tqshape(pblit->tqshapeno); + if (ptqshape.bits) + bm->blit(ptqshape.bits, pblit->left, pblit->bottom, subsample); } return bm; } @@ -320,9 +320,9 @@ JB2Image::get_bitmap(const GRect &rect, int subsample, int align, int dispy) con for (int blitno = 0; blitno < get_blit_count(); blitno++) { const JB2Blit *pblit = get_blit(blitno); - const JB2Shape &pshape = get_shape(pblit->shapeno); - if (pshape.bits) - bm->blit(pshape.bits, pblit->left-rxmin, pblit->bottom-rymin+dispy, subsample); + const JB2Shape &ptqshape = get_tqshape(pblit->tqshapeno); + if (ptqshape.bits) + bm->blit(ptqshape.bits, pblit->left-rxmin, pblit->bottom-rymin+dispy, subsample); } return bm; } @@ -354,7 +354,7 @@ JB2Image::decode(const GP<ByteStream> &gbs, JB2DecoderCallback *cb, void *arg) #define MATCHED_REFINE_IMAGE_ONLY (6) #define MATCHED_COPY (7) #define NON_MARK_DATA (8) -#define REQUIRED_DICT_OR_RESET (9) +#define RETQUIRED_DICT_OR_RESET (9) #define PRESERVED_COMMENT (10) #define END_OF_DATA (11) @@ -397,7 +397,7 @@ JB2Dict::JB2Codec::JB2Codec(const bool xencoding) abs_size_x(0), abs_size_y(0), image_size_dist(0), - inherited_shape_count_dist(0), + inherited_tqshape_count_dist(0), offset_type_dist(0), rel_loc_x_current(0), rel_loc_x_last(0), @@ -428,7 +428,7 @@ JB2Dict::JB2Codec::reset_numcoder() abs_size_x = 0; abs_size_y = 0; image_size_dist = 0; - inherited_shape_count_dist = 0; + inherited_tqshape_count_dist = 0; rel_loc_x_current = 0; rel_loc_x_last = 0; rel_loc_y_current = 0; @@ -573,27 +573,27 @@ JB2Dict::JB2Codec::Decode::code_comment(GUTF8String &comment) void JB2Dict::JB2Codec::init_library(JB2Dict &jim) { - int nshape = jim.get_inherited_shape_count(); - shape2lib.resize(0,nshape-1); - lib2shape.resize(0,nshape-1); - libinfo.resize(0,nshape-1); - for (int i=0; i<nshape; i++) + int ntqshape = jim.get_inherited_tqshape_count(); + tqshape2lib.resize(0,ntqshape-1); + lib2tqshape.resize(0,ntqshape-1); + libinfo.resize(0,ntqshape-1); + for (int i=0; i<ntqshape; i++) { - shape2lib[i] = i; - lib2shape[i] = i; - JB2Shape &jshp = jim.get_shape(i); + tqshape2lib[i] = i; + lib2tqshape[i] = i; + JB2Shape &jshp = jim.get_tqshape(i); libinfo[i].compute_bounding_box(*(jshp.bits)); } } int -JB2Dict::JB2Codec::add_library(const int shapeno, JB2Shape &jshp) +JB2Dict::JB2Codec::add_library(const int tqshapeno, JB2Shape &jshp) { - const int libno = lib2shape.hbound() + 1; - lib2shape.touch(libno); - lib2shape[libno] = shapeno; - shape2lib.touch(shapeno); - shape2lib[shapeno] = libno; + const int libno = lib2tqshape.hbound() + 1; + lib2tqshape.touch(libno); + lib2tqshape[libno] = tqshapeno; + tqshape2lib.touch(tqshapeno); + tqshape2lib[tqshapeno] = libno; libinfo.touch(libno); libinfo[libno].compute_bounding_box(*(jshp.bits)); return libno; @@ -611,8 +611,8 @@ JB2Dict::JB2Codec::Decode::code_record_type(int &rectype) int JB2Dict::JB2Codec::Decode::code_match_index(int &index, JB2Dict &) { - int match=CodeNum(0, lib2shape.hbound(), dist_match_index); - index = lib2shape[match]; + int match=CodeNum(0, lib2tqshape.hbound(), dist_match_index); + index = lib2tqshape[match]; return match; } @@ -638,9 +638,9 @@ JB2Dict::JB2Codec::update_short_list(const int v) void -JB2Dict::JB2Codec::Decode::code_inherited_shape_count(JB2Dict &jim) +JB2Dict::JB2Codec::Decode::code_inherited_tqshape_count(JB2Dict &jim) { - int size=CodeNum(0, BIGPOSITIVE, inherited_shape_count_dist); + int size=CodeNum(0, BIGPOSITIVE, inherited_tqshape_count_dist); { GP<JB2Dict> dict = jim.get_inherited_dict(); if (!dict && size>0) @@ -653,7 +653,7 @@ JB2Dict::JB2Codec::Decode::code_inherited_shape_count(JB2Dict &jim) } if (!dict && size>0) G_THROW( ERR_MSG("JB2Image.need_dict") ); - if (dict && size!=dict->get_shape_count()) + if (dict && size!=dict->get_tqshape_count()) G_THROW( ERR_MSG("JB2Image.bad_dict") ); } } @@ -927,7 +927,7 @@ JB2Dict::JB2Codec::code_record( { GP<GBitmap> cbm; GP<GBitmap> bm; - int shapeno = -1; + int tqshapeno = -1; // Code record type code_record_type(rectype); @@ -946,7 +946,7 @@ JB2Dict::JB2Codec::code_record( if (!encoding) { jshp.bits = GBitmap::create(); - jshp.parent = -1; + jshp.tqparent = -1; } bm = jshp.bits; break; @@ -982,11 +982,11 @@ JB2Dict::JB2Codec::code_record( } JB2Dict &jim=*gjim; JB2Shape &jshp=*xjshp; - int match = code_match_index (jshp.parent, jim); - cbm = jim.get_shape(jshp.parent).bits; + int match = code_match_index (jshp.tqparent, jim); + cbm = jim.get_tqshape(jshp.tqparent).bits; LibRect &l = libinfo[match]; code_relative_mark_size (*bm, l.right-l.left+1, l.top-l.bottom+1, 4); - code_bitmap_by_cross_coding (*bm, cbm, jshp.parent); + code_bitmap_by_cross_coding (*bm, cbm, jshp.tqparent); break; } case PRESERVED_COMMENT: @@ -999,16 +999,16 @@ JB2Dict::JB2Codec::code_record( code_comment(jim.comment); break; } - case REQUIRED_DICT_OR_RESET: + case RETQUIRED_DICT_OR_RESET: { if (! gotstartrecordp) { - // Indicates need for a shape dictionary + // Indicates need for a tqshape dictionary if(!gjim) { G_THROW( ERR_MSG("JB2Image.bad_number") ); } - code_inherited_shape_count(*gjim); + code_inherited_tqshape_count(*gjim); }else // Reset all numerical contexts to zero reset_numcoder(); @@ -1026,7 +1026,7 @@ JB2Dict::JB2Codec::code_record( // Post-coding action if (!encoding) { - // add shape to dictionary + // add tqshape to dictionary switch(rectype) { case NEW_MARK_LIBRARY_ONLY: @@ -1037,8 +1037,8 @@ JB2Dict::JB2Codec::code_record( G_THROW( ERR_MSG("JB2Image.bad_number") ); } JB2Shape &jshp=*xjshp; - shapeno = gjim->add_shape(jshp); - add_library(shapeno, jshp); + tqshapeno = gjim->add_tqshape(jshp); + add_library(tqshapeno, jshp); break; } } @@ -1064,10 +1064,10 @@ JB2Dict::JB2Codec::Decode::code(const GP<JB2Dict> &gjim) // THIS IS THE DECODING PART // ------------------------- int rectype; - JB2Shape tmpshape; + JB2Shape tmptqshape; do { - code_record(rectype, gjim, &tmpshape); + code_record(rectype, gjim, &tmptqshape); } while(rectype != END_OF_DATA); if (!gotstartrecordp) @@ -1085,7 +1085,7 @@ JB2Dict::JB2Codec::code_record( { GP<GBitmap> bm; GP<GBitmap> cbm; - int shapeno = -1; + int tqshapeno = -1; int match; // Code record type @@ -1110,9 +1110,9 @@ JB2Dict::JB2Codec::code_record( if (!encoding) { jshp.bits = GBitmap::create(); - jshp.parent = -1; + jshp.tqparent = -1; if (rectype == NON_MARK_DATA) - jshp.parent = -2; + jshp.tqparent = -2; } bm = jshp.bits; break; @@ -1162,8 +1162,8 @@ JB2Dict::JB2Codec::code_record( } JB2Shape &jshp=*xjshp; JB2Image &jim=*gjim; - match = code_match_index (jshp.parent, jim); - cbm = jim.get_shape(jshp.parent).bits; + match = code_match_index (jshp.tqparent, jim); + cbm = jim.get_tqshape(jshp.tqparent).bits; LibRect &l = libinfo[match]; code_relative_mark_size (*bm, l.right-l.left+1, l.top-l.bottom+1, 4); code_bitmap_by_cross_coding (*bm, cbm, match); @@ -1178,8 +1178,8 @@ JB2Dict::JB2Codec::code_record( } JB2Image &jim=*gjim; JB2Shape &jshp=*xjshp; - match = code_match_index (jshp.parent, jim); - cbm = jim.get_shape(jshp.parent).bits; + match = code_match_index (jshp.tqparent, jim); + cbm = jim.get_tqshape(jshp.tqparent).bits; LibRect &l = libinfo[match]; code_relative_mark_size (*bm, l.right-l.left+1, l.top-l.bottom+1, 4); break; @@ -1192,8 +1192,8 @@ JB2Dict::JB2Codec::code_record( } JB2Image &jim=*gjim; JB2Shape &jshp=*xjshp; - match = code_match_index (jshp.parent, jim); - cbm = jim.get_shape(jshp.parent).bits; + match = code_match_index (jshp.tqparent, jim); + cbm = jim.get_tqshape(jshp.tqparent).bits; LibRect &l = libinfo[match]; code_relative_mark_size (*bm, l.right-l.left+1, l.top-l.bottom+1, 4); code_bitmap_by_cross_coding (*bm, cbm, match); @@ -1203,15 +1203,15 @@ JB2Dict::JB2Codec::code_record( case MATCHED_COPY: { int temp; - if (encoding) temp = jblt->shapeno; + if (encoding) temp = jblt->tqshapeno; if(!gjim) { G_THROW( ERR_MSG("JB2Image.bad_number") ); } JB2Image &jim=*gjim; match = code_match_index (temp, jim); - if (!encoding) jblt->shapeno = temp; - bm = jim.get_shape(jblt->shapeno).bits; + if (!encoding) jblt->tqshapeno = temp; + bm = jim.get_tqshape(jblt->tqshapeno).bits; LibRect &l = libinfo[match]; jblt->left += l.left; jblt->bottom += l.bottom; @@ -1240,7 +1240,7 @@ JB2Dict::JB2Codec::code_record( code_comment(jim.comment); break; } - case REQUIRED_DICT_OR_RESET: + case RETQUIRED_DICT_OR_RESET: { if(!gjim) { @@ -1248,8 +1248,8 @@ JB2Dict::JB2Codec::code_record( } JB2Image &jim=*gjim; if (! gotstartrecordp) - // Indicates need for a shape dictionary - code_inherited_shape_count(jim); + // Indicates need for a tqshape dictionary + code_inherited_tqshape_count(jim); else // Reset all numerical contexts to zero reset_numcoder(); @@ -1268,7 +1268,7 @@ JB2Dict::JB2Codec::code_record( // Post-coding action if (!encoding) { - // add shape to image + // add tqshape to image switch(rectype) { case NEW_MARK: @@ -1284,13 +1284,13 @@ JB2Dict::JB2Codec::code_record( G_THROW( ERR_MSG("JB2Image.bad_number") ); } JB2Shape &jshp=*xjshp; - shapeno = gjim->add_shape(jshp); - shape2lib.touch(shapeno); - shape2lib[shapeno] = -1; + tqshapeno = gjim->add_tqshape(jshp); + tqshape2lib.touch(tqshapeno); + tqshape2lib[tqshapeno] = -1; break; } } - // add shape to library + // add tqshape to library switch(rectype) { case NEW_MARK: @@ -1301,7 +1301,7 @@ JB2Dict::JB2Codec::code_record( { G_THROW( ERR_MSG("JB2Image.bad_number") ); } - add_library(shapeno, *xjshp); + add_library(tqshapeno, *xjshp); break; } // make sure everything is compacted @@ -1316,7 +1316,7 @@ JB2Dict::JB2Codec::code_record( case MATCHED_REFINE: case MATCHED_REFINE_IMAGE_ONLY: case NON_MARK_DATA: - jblt->shapeno = shapeno; + jblt->tqshapeno = tqshapeno; case MATCHED_COPY: if(!gjim) { @@ -1344,10 +1344,10 @@ JB2Dict::JB2Codec::Decode::code(const GP<JB2Image> &gjim) // ------------------------- int rectype; JB2Blit tmpblit; - JB2Shape tmpshape; + JB2Shape tmptqshape; do { - code_record(rectype, gjim, &tmpshape, &tmpblit); + code_record(rectype, gjim, &tmptqshape, &tmpblit); } while(rectype!=END_OF_DATA); if (!gotstartrecordp) diff --git a/kviewshell/plugins/djvu/libdjvu/JB2Image.h b/kviewshell/plugins/djvu/libdjvu/JB2Image.h index f55ae451..95b7bf26 100644 --- a/kviewshell/plugins/djvu/libdjvu/JB2Image.h +++ b/kviewshell/plugins/djvu/libdjvu/JB2Image.h @@ -83,47 +83,47 @@ be implemented in the future. {\bf JB2 Images} --- Class \Ref{JB2Image} is the central data structure - implemented here. A #JB2Image# is composed of an array of shapes - and an array of blits. Each shape contains a small bitmap representing an + implemented here. A #JB2Image# is composed of an array of tqshapes + and an array of blits. Each tqshape contains a small bitmap representing an elementary blob of ink, such as a character or a segment of line art. - Each blit instructs the decoder to render a particular shape at a + Each blit instructs the decoder to render a particular tqshape at a specified position in the image. Some compression is already achieved - because several blits can refer to the same shape. A shape can also - contain a pointer to a parent shape. Additional compression is achieved - when both shapes are similar because each shape is encoded using the - parent shape as a model. A #"O"# shape for instance could be a parent for - both a #"C"# shape and a #"Q"# shape. + because several blits can refer to the same tqshape. A tqshape can also + contain a pointer to a tqparent tqshape. Additional compression is achieved + when both tqshapes are similar because each tqshape is encoded using the + tqparent tqshape as a model. A #"O"# tqshape for instance could be a tqparent for + both a #"C"# tqshape and a #"Q"# tqshape. {\bf JB2 Dictionary} --- Class \Ref{JB2Dict} is a peculiar kind of - JB2Image which only contains an array of shapes. These shapes can be + JB2Image which only contains an array of tqshapes. These tqshapes can be referenced from another JB2Dict/JB2Image. This is arranged by setting the ``inherited dictionary'' of a JB2Dict/JB2Image using function - \Ref{JB2Dict::set_inherited_dict}. Several JB2Images can use shapes from a + \Ref{JB2Dict::set_inherited_dict}. Several JB2Images can use tqshapes from a same JB2Dict encoded separately. This is how several pages of a same document can share information. {\bf Decoding JB2 data} --- The first step for decoding JB2 data consists of creating an empty #JB2Image# object. Function \Ref{JB2Image::decode} then - reads the data and populates the #JB2Image# with the shapes and the blits. + reads the data and populates the #JB2Image# with the tqshapes and the blits. Function \Ref{JB2Image::get_bitmap} finally produces an anti-aliased image. {\bf Encoding JB2 data} --- The first step for decoding JB2 data also consists of creating an empty #JB2Image# object. You must then use - functions \Ref{JB2Image::add_shape} and \Ref{JB2Image::add_blit} to + functions \Ref{JB2Image::add_tqshape} and \Ref{JB2Image::add_blit} to populate the #JB2Image# object. Function \Ref{JB2Image::encode} finally produces the JB2 data. Function #encode# sequentially encodes the blits - and the necessary shapes. The compression ratio depends on several + and the necessary tqshapes. The compression ratio depends on several factors: \begin{itemize} - \item Blits should reuse shapes as often as possible. + \item Blits should reuse tqshapes as often as possible. \item Blits should be sorted in reading order because this facilitates the prediction of the blit coordinates. \item Shapes should be sorted according to the order of first appearance in the sequence of blits because this facilitates the prediction of the - shape indices. - \item Shapes should be compared to all previous shapes in the shape array. - The shape parent pointer should be set to a suitable parent shape if - such a parent shape exists. The parent shape should have almost the + tqshape indices. + \item Shapes should be compared to all previous tqshapes in the tqshape array. + The tqshape tqparent pointer should be set to a suitable tqparent tqshape if + such a tqparent tqshape exists. The tqparent tqshape should have almost the same size and the same pixels. \end{itemize} All this is quite easy to achieve in the case of an electronically @@ -131,16 +131,16 @@ characters are and where they are located. If you only have a scanned image however you must first locate the characters (connected component analysis) and cut the remaining pieces of ink into smaller blobs. - Ordering the blits and matching the shapes is then an essentially + Ordering the blits and matching the tqshapes is then an essentially heuristic process. Although the quality of the heuristics substantially - effects the file size, misordering blits or mismatching shapes never + effects the file size, misordering blits or mismatching tqshapes never effects the quality of the image. The last refinement consists in - smoothing the shapes in order to reduce the noise and maximize the - similarities between shapes. + smoothing the tqshapes in order to reduce the noise and maximize the + similarities between tqshapes. {\bf JB2 extensions} --- Two extensions of the JB2 encoding format have been introduced with DjVu files version 21. The first - extension addresses the shared shape dictionaries. The second extension + extension addresses the shared tqshape dictionaries. The second extension bounds the number of probability contexts used for coding numbers. Both extensions maintain backward compatibility with JB2 as described in the ICFDD proposal. A more complete discussion @@ -190,42 +190,42 @@ class ByteStream; /** Blit data structure. A #JB2Image# contains an array of #JB2Blit# data structures. Each array entry instructs the decoder to render a particular - shape at a particular location. Members #left# and #bottom# specify the - coordinates of the bottom left corner of the shape bitmap. All + tqshape at a particular location. Members #left# and #bottom# specify the + coordinates of the bottom left corner of the tqshape bitmap. All coordinates are relative to the bottom left corner of the image. Member - #shapeno# is the subscript of the shape to be rendered. */ + #tqshapeno# is the subscript of the tqshape to be rendered. */ class JB2Blit { public: - /** Horizontal coordinate of the blit. */ + /**Qt::Horizontal coordinate of the blit. */ unsigned short left; - /** Vertical coordinate of the blit. */ + /**Qt::Vertical coordinate of the blit. */ unsigned short bottom; - /** Index of the shape to blit. */ - unsigned int shapeno; + /** Index of the tqshape to blit. */ + unsigned int tqshapeno; }; /** Shape data structure. A #JB2Image# contains an array of #JB2Shape# data structures. Each array entry represents an elementary blob of ink such as a character or a segment of line art. Member #bits# points to a bilevel - image representing the shape pixels. Member #parent# is the subscript of - the parent shape. */ + image representing the tqshape pixels. Member #tqparent# is the subscript of + the tqparent tqshape. */ class JB2Shape { public: - /** Subscript of the parent shape. The parent shape must always be located - before the current shape in the shape array. A negative value indicates - that this shape has no parent. Any negative values smaller than #-1# - further indicates that this shape does not look like a character. This + /** Subscript of the tqparent tqshape. The tqparent tqshape must always be located + before the current tqshape in the tqshape array. A negative value indicates + that this shape.has no tqparent. Any negative values smaller than #-1# + further indicates that this tqshape does not look like a character. This is used to enable a few internal optimizations. This information is - saved into the JB2 file, but the actual value of the #parent# variable + saved into the JB2 file, but the actual value of the #tqparent# variable is not. */ - int parent; - /** Bilevel image of the shape pixels. This must be a pointer to a bilevel + int tqparent; + /** Bilevel image of the tqshape pixels. This must be a pointer to a bilevel #GBitmap# image. This pointer can also be null. The encoder will just - silently discard all blits referring to a shape containing a null + silently discard all blits referring to a tqshape containing a null bitmap. */ GP<GBitmap> bits; /** Private user data. This long word is provided as a convenience for users @@ -238,14 +238,14 @@ public: /** JB2 Dictionary callback. The decoding function call this callback function when they discover that - the current JB2Image or JB2Dict needs a pre-existing shape dictionary. + the current JB2Image or JB2Dict needs a pre-existing tqshape dictionary. The callback function must return a pointer to the dictionary or NULL if none is found. */ typedef GP<JB2Dict> JB2DecoderCallback ( void* ); -/** Dictionary of JB2 shapes. */ +/** Dictionary of JB2 tqshapes. */ class JB2Dict : public GPEnabled { @@ -257,43 +257,43 @@ public: // CONSTRUCTION /** Default creator. Constructs an empty #JB2Dict# object. You can then call the decoding function #decode#. You can also manually set the - image size using #add_shape#. */ + image size using #add_tqshape#. */ static GP<JB2Dict> create(void); // INITIALIZATION - /** Resets the #JB2Image# object. This function reinitializes both the shape + /** Resets the #JB2Image# object. This function reinitializes both the tqshape and the blit arrays. All allocated memory is freed. */ void init(void); // INHERITED /** Returns the inherited dictionary. */ GP<JB2Dict> get_inherited_dict(void) const; - /** Returns the number of inherited shapes. */ - int get_inherited_shape_count(void) const; + /** Returns the number of inherited tqshapes. */ + int get_inherited_tqshape_count(void) const; /** Sets the inherited dictionary. */ void set_inherited_dict(const GP<JB2Dict> &dict); // ACCESSING THE SHAPE LIBRARY - /** Returns the total number of shapes. - Shape indices range from #0# to #get_shape_count()-1#. */ - int get_shape_count(void) const; - /** Returns a pointer to shape #shapeno#. - The returned pointer directly points into the shape array. - This pointer can be used for reading or writing the shape data. */ - JB2Shape &get_shape(const int shapeno); - /** Returns a constant pointer to shape #shapeno#. - The returned pointer directly points into the shape array. - This pointer can only be used for reading the shape data. */ - const JB2Shape &get_shape(const int shapeno) const; - /** Appends a shape to the shape array. This function appends a copy of - shape #shape# to the shape array and returns the subscript of the new - shape. The subscript of the parent shape #shape.parent# must - actually designate an already existing shape. */ - int add_shape(const JB2Shape &shape); + /** Returns the total number of tqshapes. + Shape indices range from #0# to #get_tqshape_count()-1#. */ + int get_tqshape_count(void) const; + /** Returns a pointer to tqshape #tqshapeno#. + The returned pointer directly points into the tqshape array. + This pointer can be used for reading or writing the tqshape data. */ + JB2Shape &get_tqshape(const int tqshapeno); + /** Returns a constant pointer to tqshape #tqshapeno#. + The returned pointer directly points into the tqshape array. + This pointer can only be used for reading the tqshape data. */ + const JB2Shape &get_tqshape(const int tqshapeno) const; + /** Appends a tqshape to the tqshape array. This function appends a copy of + tqshape #tqshape# to the tqshape array and returns the subscript of the new + tqshape. The subscript of the tqparent tqshape #tqshape.tqparent# must + actually designate an already existing tqshape. */ + int add_tqshape(const JB2Shape &tqshape); // MEMORY OPTIMIZATION - /** Compresses all shape bitmaps. This function reduces the memory required - by the #JB2Image# by calling \Ref{GBitmap::compress} on all shapes + /** Compresses all tqshape bitmaps. This function reduces the memory required + by the #JB2Image# by calling \Ref{GBitmap::compress} on all tqshapes bitmaps. This function is best called after decoding a #JB2Image#, because function \Ref{get_bitmap} can directly use the compressed bitmaps. */ @@ -307,9 +307,9 @@ public: This function generates the JB2 data stream without any header. */ void encode(const GP<ByteStream> &gbs) const; /** Decodes JB2 data from ByteStream #bs#. This function decodes the image - size and populates the shape and blit arrays. The callback function + size and populates the tqshape and blit arrays. The callback function #cb# is called when the decoder determines that the ByteStream data - requires a shape dictionary which has not been set with + requires a tqshape dictionary which has not been set with \Ref{JB2Dict::set_inherited_dict}. The callback receives argument #arg# and must return a suitable dictionary which will be installed as the inherited dictionary. The callback should return null if no such @@ -322,15 +322,15 @@ public: GUTF8String comment; private: - int inherited_shapes; + int inherited_tqshapes; GP<JB2Dict> inherited_dict; - GArray<JB2Shape> shapes; + GArray<JB2Shape> tqshapes; }; -/** Main JB2 data structure. Each #JB2Image# consists of an array of shapes +/** Main JB2 data structure. Each #JB2Image# consists of an array of tqshapes and an array of blits. These arrays can be populated by hand using - functions \Ref{add_shape} and \Ref{add_blit}, or by decoding JB2 data + functions \Ref{add_tqshape} and \Ref{add_blit}, or by decoding JB2 data using function \Ref{decode}. You can then use function \Ref{get_bitmap} to render anti-aliased images, or use function \Ref{encode} to generate JB2 data. */ @@ -343,12 +343,12 @@ public: /** Creates an empty #JB2Image# object. You can then call the decoding function #decode#. You can also manually set the - image size using #set_dimension# and populate the shape and blit arrays - using #add_shape# and #add_blit#. */ + image size using #set_dimension# and populate the tqshape and blit arrays + using #add_tqshape# and #add_blit#. */ static GP<JB2Image> create(void) { return new JB2Image(); } // INITIALIZATION - /** Resets the #JB2Image# object. This function reinitializes both the shape + /** Resets the #JB2Image# object. This function reinitializes both the tqshape and the blit arrays. All allocated memory is freed. */ void init(void); @@ -370,7 +370,7 @@ public: JB2Image as a bilevel or gray level image. Argument #subsample# specifies the desired subsampling ratio in range #1# to #15#. The returned image uses #1+subsample^2# gray levels for representing - anti-aliased edges. Argument #align# specified the alignment of the + anti-aliased edges. Argument #align# specified the tqalignment of the rows of the returned images. Setting #align# to #4#, for instance, will adjust the bitmap border in order to make sure that each row of the returned image starts on a word (four byte) boundary. */ @@ -380,7 +380,7 @@ public: this function first renders the full JB2Image with subsampling ratio #subsample# and then extracts rectangle #rect# in the subsampled image. Both operations of course are efficiently performed simultaneously. - Argument #align# specified the alignment of the rows of the returned + Argument #align# specified the tqalignment of the rows of the returned images, as explained above. Argument #dispy# should remain null. */ GP<GBitmap> get_bitmap(const GRect &rect, int subsample=1, int align=1, int dispy=0) const; @@ -393,13 +393,13 @@ public: This pointer can be used for reading or writing the blit data. */ JB2Blit *get_blit(int blitno); /** Returns a constant pointer to blit #blitno#. - The returned pointer directly points into the shape array. - This pointer can only be used for reading the shape data. */ + The returned pointer directly points into the tqshape array. + This pointer can only be used for reading the tqshape data. */ const JB2Blit *get_blit(int blitno) const; /** Appends a blit to the blit array. This function appends a copy of blit #blit# to the blit array and returns the subscript of the new blit. The - shape subscript #blit.shapeno# must actually designate an already - existing shape. */ + tqshape subscript #blit.tqshapeno# must actually designate an already + existing tqshape. */ int add_blit(const JB2Blit &blit); // MEMORY OPTIMIZATION @@ -412,9 +412,9 @@ public: This function generates the JB2 data stream without any header. */ void encode(const GP<ByteStream> &gbs) const; /** Decodes JB2 data from ByteStream #bs#. This function decodes the image - size and populates the shape and blit arrays. The callback function + size and populates the tqshape and blit arrays. The callback function #cb# is called when the decoder determines that the ByteStream data - requires a shape dictionary which has not been set with + requires a tqshape dictionary which has not been set with \Ref{JB2Dict::set_inherited_dict}. The callback receives argument #arg# and must return a suitable dictionary which will be installed as the inherited dictionary. The callback should return null if no such @@ -438,15 +438,15 @@ public: // JB2DICT INLINE FUNCTIONS inline int -JB2Dict::get_shape_count(void) const +JB2Dict::get_tqshape_count(void) const { - return inherited_shapes + shapes.size(); + return inherited_tqshapes + tqshapes.size(); } inline int -JB2Dict::get_inherited_shape_count(void) const +JB2Dict::get_inherited_tqshape_count(void) const { - return inherited_shapes; + return inherited_tqshapes; } inline GP<JB2Dict> @@ -501,7 +501,7 @@ JB2Image::get_blit(int blitno) const These extensions are described below by reference to the ICFDD proposal dated August 1999. Both extension make use of the unused record type value #9# (cf. ICFDD page 24) which has been renamed - #REQUIRED_DICT_OR_RESET#. + #RETQUIRED_DICT_OR_RESET#. {\bf Shared Shape Dictionaries} --- This extension provides support for sharing symbol definitions between the pages of a @@ -515,7 +515,7 @@ JB2Image::get_blit(int blitno) const by the following records. The first record usually is a ``Start Of Image'' record describing the size of the image. - Starting with version 21, a #REQUIRED_DICT_OR_RESET# (9) record + Starting with version 21, a #RETQUIRED_DICT_OR_RESET# (9) record type can appear {\em before} the #START_OF_DATA# (0) record. The record type field is followed by a single number arithmetically encoded (cf. ICFDD page 26) using a sixteenth context (cf. ICFDD @@ -548,7 +548,7 @@ JB2Image::get_blit(int blitno) const contexts. These contexts are normally allocated when they are used for the first time (cf. ICFDD informative note, page 27). - Starting with version 21, a #REQUIRED_DICT_OR_RESET# (9) record + Starting with version 21, a #RETQUIRED_DICT_OR_RESET# (9) record type can appear {\em after} the #START_OF_DATA# (0) record. The decoder should proceed with the next record after {\em clearing all binary contexts used for coding numbers}. This operation @@ -556,7 +556,7 @@ JB2Image::get_blit(int blitno) const numbers can be deallocated. Starting with version 21, the JB2 encoder should insert a - #REQUIRED_DICT_OR_RESET# record type whenever the number of these + #RETQUIRED_DICT_OR_RESET# record type whenever the number of these allocated binary contexts exceeds #20000#. Only very large documents ever reach such a large number of allocated binary contexts (e.g large maps). Hardware implementation however can @@ -612,7 +612,7 @@ protected: void reset_numcoder(void); inline void code_eventual_lossless_refinement(void); void init_library(JB2Dict &jim); - int add_library(const int shapeno, JB2Shape &jshp); + int add_library(const int tqshapeno, JB2Shape &jshp); void code_relative_location(JB2Blit *jblt, int rows, int columns); void code_bitmap_directly (GBitmap &bm); void code_bitmap_by_cross_coding (GBitmap &bm, GP<GBitmap> &cbm, const int libno); @@ -640,7 +640,7 @@ protected: virtual void code_comment(GUTF8String &comment) = 0; virtual void code_record_type(int &rectype) = 0; virtual int code_match_index(int &index, JB2Dict &jim)=0; - virtual void code_inherited_shape_count(JB2Dict &jim)=0; + virtual void code_inherited_tqshape_count(JB2Dict &jim)=0; virtual void code_image_size(JB2Dict &jim); virtual void code_image_size(JB2Image &jim); virtual void code_absolute_location(JB2Blit *jblt, int rows, int columns)=0; @@ -678,8 +678,8 @@ protected: NumContext dist_match_index; BitContext dist_refinement_flag; // Library - GTArray<int> shape2lib; - GTArray<int> lib2shape; + GTArray<int> tqshape2lib; + GTArray<int> lib2tqshape; GTArray<LibRect> libinfo; // Code pairs NumContext abs_loc_x; @@ -687,7 +687,7 @@ protected: NumContext abs_size_x; NumContext abs_size_y; NumContext image_size_dist; - NumContext inherited_shape_count_dist; + NumContext inherited_tqshape_count_dist; BitContext offset_type_dist; NumContext rel_loc_x_current; NumContext rel_loc_x_last; diff --git a/kviewshell/plugins/djvu/libdjvu/MMRDecoder.cpp b/kviewshell/plugins/djvu/libdjvu/MMRDecoder.cpp index b14220d1..eace389e 100644 --- a/kviewshell/plugins/djvu/libdjvu/MMRDecoder.cpp +++ b/kviewshell/plugins/djvu/libdjvu/MMRDecoder.cpp @@ -603,7 +603,7 @@ MMRDecoder::scanruns(const unsigned short **endptr) b1 += *pr++; break; } - /* Horizontal Mode */ + /*Qt::Horizontal Mode */ case H: { // First run @@ -617,7 +617,7 @@ MMRDecoder::scanruns(const unsigned short **endptr) *xr = rle; xr++; rle = 0; break; } - /* Vertical Modes */ + /*Qt::Vertical Modes */ case V0: case VR3: case VR2: @@ -933,16 +933,16 @@ MMRDecoder::decode(GP<ByteStream> gbs) // Insert blocks into JB2Image for (int b=0; b<blocksperline; b++) { - JB2Shape shape; - shape.bits = blocks[b]; - if (shape.bits) + JB2Shape tqshape; + tqshape.bits = blocks[b]; + if (tqshape.bits) { - shape.parent = -1; - shape.bits->compress(); + tqshape.tqparent = -1; + tqshape.bits->compress(); JB2Blit blit; blit.left = b*blocksize; blit.bottom = line+1; - blit.shapeno = jimg->add_shape(shape); + blit.tqshapeno = jimg->add_tqshape(tqshape); jimg->add_blit(blit); } } diff --git a/kviewshell/plugins/djvu/libdjvu/MMRDecoder.h b/kviewshell/plugins/djvu/libdjvu/MMRDecoder.h index 6516b4cd..7340bfea 100644 --- a/kviewshell/plugins/djvu/libdjvu/MMRDecoder.h +++ b/kviewshell/plugins/djvu/libdjvu/MMRDecoder.h @@ -81,9 +81,9 @@ class JB2Image; CCITT-G4/MMR decoder suitable for use in DjVu. The main entry point is function \Ref{MMRDecoder::decode}. - The foreground mask layer of a DjVu file is usually encoded with a + The foreground tqmask layer of a DjVu file is usually encoded with a #"Sjbz"# chunk containing JB2 encoded data (cf. \Ref{JB2Image.h}). - Alternatively, the qmask layer may be encoded with a #"Smmr"# + Alternatively, the qtqmask layer may be encoded with a #"Smmr"# chunk containing a small header followed by MMR encoded data. This encoding scheme produces significantly larger files. On the other hand, many scanners a printers talk MMR using very efficient diff --git a/kviewshell/plugins/djvu/libdjvu/XMLParser.cpp b/kviewshell/plugins/djvu/libdjvu/XMLParser.cpp index b1d9f469..b936affb 100644 --- a/kviewshell/plugins/djvu/libdjvu/XMLParser.cpp +++ b/kviewshell/plugins/djvu/libdjvu/XMLParser.cpp @@ -301,7 +301,7 @@ lt_XMLParser::Impl::ChangeAnno( const GP<DjVuAnno> ganno(DjVuAnno::create()); DjVuAnno &anno=*ganno; GPosition map_pos; - map_pos=map.contains(areatag); + map_pos=map.tqcontains(areatag); if(dfile.contains_anno()) { GP<ByteStream> annobs=dfile.get_merged_anno(); @@ -350,7 +350,7 @@ lt_XMLParser::Impl::ChangeAnno( // with no matching y). // ****************************************************** { - GPosition coords_pos=args.contains("coords"); + GPosition coords_pos=args.tqcontains("coords"); if(coords_pos) { GList<int> raw_coords; @@ -373,20 +373,20 @@ lt_XMLParser::Impl::ChangeAnno( } } } - GUTF8String shape; + GUTF8String tqshape; { - GPosition shape_pos=args.contains("shape"); - if(shape_pos) + GPosition tqshape_pos=args.tqcontains("tqshape"); + if(tqshape_pos) { - shape=args[shape_pos]; + tqshape=args[tqshape_pos]; } } GP<GMapArea> a; - if(shape == "default") + if(tqshape == "default") { GRect rect(0,0,w,h); a=GMapRect::create(rect); - }else if(!shape.length() || shape == "rect") + }else if(!tqshape.length() || tqshape == "rect") { int xx[4]; int i=0; @@ -420,7 +420,7 @@ lt_XMLParser::Impl::ChangeAnno( } GRect rect(xmin,ymin,xmax-xmin,ymax-ymin); a=GMapRect::create(rect); - }else if(shape == "circle") + }else if(tqshape == "circle") { int xx[4]; int i=0; @@ -440,7 +440,7 @@ lt_XMLParser::Impl::ChangeAnno( int x=xx[0],y=xx[1],rx=xx[2],ry=(h-xx[3])-1; GRect rect(x-rx,y-ry,2*rx,2*ry); a=GMapOval::create(rect); - }else if(shape == "oval") + }else if(tqshape == "oval") { int xx[4]; int i=0; @@ -474,7 +474,7 @@ lt_XMLParser::Impl::ChangeAnno( } GRect rect(xmin,ymin,xmax-xmin,ymax-ymin); a=GMapOval::create(rect); - }else if(shape == "poly") + }else if(tqshape == "poly") { GP<GMapPoly> p=GMapPoly::create(); for(GPosition poly_pos=coords;poly_pos;++poly_pos) @@ -489,28 +489,28 @@ lt_XMLParser::Impl::ChangeAnno( a=p; }else { - G_THROW( ( ERR_MSG("XMLAnno.unknown_shape") "\t")+shape ); + G_THROW( ( ERR_MSG("XMLAnno.unknown_tqshape") "\t")+tqshape ); } if(a) { GPosition pos; - if((pos=args.contains("href"))) + if((pos=args.tqcontains("href"))) { a->url=args[pos]; } - if((pos=args.contains("target"))) + if((pos=args.tqcontains("target"))) { a->target=args[pos]; } - if((pos=args.contains("alt"))) + if((pos=args.tqcontains("alt"))) { a->comment=args[pos]; } - if((pos=args.contains("bordertype"))) + if((pos=args.tqcontains("bordertype"))) { GUTF8String b=args[pos]; static const GMap<GUTF8String,GMapArea::BorderType> typeMap=BorderTypeMap(); - if((pos=typeMap.contains(b))) + if((pos=typeMap.tqcontains(b))) { a->border_type=typeMap[pos]; }else @@ -518,16 +518,16 @@ lt_XMLParser::Impl::ChangeAnno( G_THROW( (ERR_MSG("XMLAnno.unknown_border") "\t")+b ); } } - a->border_always_visible=!!args.contains("visible"); - if((pos=args.contains("bordercolor"))) + a->border_always_visible=!!args.tqcontains("visible"); + if((pos=args.tqcontains("bordercolor"))) { a->border_color=convertToColor(args[pos]); } - if((pos=args.contains("highlight"))) + if((pos=args.tqcontains("highlight"))) { a->hilite_color=convertToColor(args[pos]); } - if((pos=args.contains("border"))) + if((pos=args.tqcontains("border"))) { a->border_width=args[pos].toInt(); //atoi(args[pos]); } @@ -548,7 +548,7 @@ lt_XMLParser::Impl::get_file(const GURL &url,GUTF8String id) GP<DjVuDocument> doc; GCriticalSectionLock lock(&xmlparser_lock); { - GPosition pos=m_docs.contains(url.get_string()); + GPosition pos=m_docs.tqcontains(url.get_string()); if(pos) { doc=m_docs[pos]; @@ -572,10 +572,10 @@ lt_XMLParser::Impl::get_file(const GURL &url,GUTF8String id) } } const GURL fileurl(doc->id_to_url(id)); - GPosition dpos(m_files.contains(fileurl.get_string())); + GPosition dpos(m_files.tqcontains(fileurl.get_string())); if(!dpos) { - if(!doc->get_id_list().contains(id)) + if(!doc->get_id_list().tqcontains(id)) { G_THROW( ERR_MSG("XMLAnno.bad_page") ); } @@ -622,7 +622,7 @@ lt_XMLParser::Impl::parse(const lt_XMLTags &tags) GURL codebase; { DEBUG_MSG("Setting up codebase... m_codebase = " << m_codebase << "\n"); - GPosition codebasePos=args.contains("codebase"); + GPosition codebasePos=args.tqcontains("codebase"); // If user specified a codebase attribute, assume it is correct (absolute URL): // the GURL constructor will throw an exception if it isn't if(codebasePos) @@ -642,11 +642,11 @@ lt_XMLParser::Impl::parse(const lt_XMLTags &tags) // URL (for now, just a path and file name). If it's absolute, // our GURL will adequately wrap it. If it's relative, we need // to use the codebase attribute to form an absolute URL first. - GPosition datapos=args.contains("data"); + GPosition datapos=args.tqcontains("data"); if(datapos) { bool isDjVuType=false; - GPosition typePos(args.contains("type")); + GPosition typePos(args.tqcontains("type")); if(typePos) { if(args[typePos] != mimetype) @@ -659,12 +659,12 @@ lt_XMLParser::Impl::parse(const lt_XMLTags &tags) const GURL url=GURL::UTF8(args[datapos],(args[datapos][0] == '/')?codebase.base():codebase); int width; { - GPosition widthPos=args.contains("width"); + GPosition widthPos=args.tqcontains("width"); width=(widthPos)?args[widthPos].toInt():0; } int height; { - GPosition heightPos=args.contains("height"); + GPosition heightPos=args.tqcontains("height"); height=(heightPos)?args[heightPos].toInt():0; } GUTF8String gamma; @@ -672,17 +672,17 @@ lt_XMLParser::Impl::parse(const lt_XMLTags &tags) GUTF8String page; GUTF8String do_ocr; { - GPosition paramPos(GObject.contains(paramtag)); + GPosition paramPos(GObject.tqcontains(paramtag)); if(paramPos) { const GPList<lt_XMLTags> Params(GObject[paramPos]); for(GPosition loc=Params;loc;++loc) { const GMap<GUTF8String,GUTF8String> &pargs=Params[loc]->get_args(); - GPosition namepos=pargs.contains("name"); + GPosition namepos=pargs.tqcontains("name"); if(namepos) { - GPosition valuepos=pargs.contains("value"); + GPosition valuepos=pargs.tqcontains("value"); if(valuepos) { const GUTF8String name=pargs[namepos].downcase(); @@ -691,19 +691,19 @@ lt_XMLParser::Impl::parse(const lt_XMLTags &tags) { GMap<GUTF8String,GUTF8String> args; lt_XMLTags::ParseValues(value,args,true); - if(args.contains("page")) + if(args.tqcontains("page")) { page=args["page"]; } - if(args.contains("dpi")) + if(args.tqcontains("dpi")) { dpi=args["dpi"]; } - if(args.contains("gamma")) + if(args.tqcontains("gamma")) { gamma=args["gamma"]; } - if(args.contains("ocr")) + if(args.tqcontains("ocr")) { do_ocr=args["ocr"]; } @@ -749,14 +749,14 @@ lt_XMLParser::Impl::parse_anno( { GP<lt_XMLTags> map; { - GPosition usemappos=GObject.get_args().contains("usemap"); + GPosition usemappos=GObject.get_args().tqcontains("usemap"); if(usemappos) { const GUTF8String mapname(GObject.get_args()[usemappos]); - GPosition mappos=Maps.contains(mapname); + GPosition mappos=Maps.tqcontains(mapname); if(!mappos) { - G_THROW((ERR_MSG("XMLAnno.map_find") "\t")+mapname ); + G_THROW((ERR_MSG("XMLAnno.map_tqfind") "\t")+mapname ); }else { map=Maps[mappos]; @@ -782,10 +782,10 @@ static inline TYPE min(TYPE a,TYPE b) { return (a<b)?a:b; } // used to build the zone tree // true is returned if the GRect is known for this object, -// and false, if the rectangle's size is just the parent size. +// and false, if the rectangle's size is just the tqparent size. static bool make_child_layer( - DjVuTXT::Zone &parent, + DjVuTXT::Zone &tqparent, const lt_XMLTags &tag, ByteStream &bs, const int height, const double ws, const double hs) { @@ -799,32 +799,32 @@ make_child_layer( const GUTF8String name(tag.get_name()); if(name == wordtag) { - self_ptr=parent.append_child(); + self_ptr=tqparent.append_child(); self_ptr->ztype = DjVuTXT::WORD; sepchar=' '; }else if(name == linetag) { - self_ptr=parent.append_child(); + self_ptr=tqparent.append_child(); self_ptr->ztype = DjVuTXT::LINE; sepchar=DjVuTXT::end_of_line; }else if(name == paragraphtag) { - self_ptr=parent.append_child(); + self_ptr=tqparent.append_child(); self_ptr->ztype = DjVuTXT::PARAGRAPH; sepchar=DjVuTXT::end_of_paragraph; }else if(name == regiontag) { - self_ptr=parent.append_child(); + self_ptr=tqparent.append_child(); self_ptr->ztype = DjVuTXT::REGION; sepchar=DjVuTXT::end_of_region; }else if(name == pagecolumntag) { - self_ptr=parent.append_child(); + self_ptr=tqparent.append_child(); self_ptr->ztype = DjVuTXT::COLUMN; sepchar=DjVuTXT::end_of_column; }else { - self_ptr = &parent; + self_ptr = &tqparent; self_ptr->ztype = DjVuTXT::PAGE; sepchar=0; } @@ -833,12 +833,12 @@ make_child_layer( int &xmin=self.rect.xmin, &ymin=self.rect.ymin, &xmax=self.rect.xmax, &ymax=self.rect.ymax; GRect default_rect; - default_rect.xmin=max(parent.rect.xmax,parent.rect.xmin); - default_rect.xmax=min(parent.rect.xmax,parent.rect.xmin); - default_rect.ymin=max(parent.rect.ymax,parent.rect.ymin); - default_rect.ymax=min(parent.rect.ymax,parent.rect.ymin); + default_rect.xmin=max(tqparent.rect.xmax,tqparent.rect.xmin); + default_rect.xmax=min(tqparent.rect.xmax,tqparent.rect.xmin); + default_rect.ymin=max(tqparent.rect.ymax,tqparent.rect.ymin); + default_rect.ymax=min(tqparent.rect.ymax,tqparent.rect.ymin); // Now if there are coordinates, use those. - GPosition pos(tag.get_args().contains("coords")); + GPosition pos(tag.get_args().tqcontains("coords")); if(pos) { GList<int> rectArgs; @@ -926,7 +926,7 @@ make_child_layer( }else { // If the child doesn't have coordinates, we need to use a box - // at least as big as the parent's coordinates. + // at least as big as the tqparent's coordinates. xmin=min(save_rect.xmin,default_rect.xmax); xmax=max(save_rect.xmax,default_rect.xmin); ymin=min(save_rect.ymin,default_rect.ymax); @@ -952,10 +952,10 @@ make_child_layer( self.text_length = bs.tell() - self.text_start; } } - parent.rect.xmin=min(xmin,parent.rect.xmin); - parent.rect.ymin=min(ymin,parent.rect.ymin); - parent.rect.xmax=max(xmax,parent.rect.xmax); - parent.rect.ymax=max(ymax,parent.rect.ymax); + tqparent.rect.xmin=min(xmin,tqparent.rect.xmin); + tqparent.rect.ymin=min(ymin,tqparent.rect.ymin); + tqparent.rect.xmax=max(xmax,tqparent.rect.xmax); + tqparent.rect.ymax=max(ymax,tqparent.rect.ymax); if(xmin>xmax) { const int t=xmin; @@ -1029,11 +1029,11 @@ lt_XMLParser::Impl::ChangeText( const int h=info->height; const int w=info->width; txt->page_zone.text_start = 0; - DjVuTXT::Zone &parent=txt->page_zone; - parent.rect.xmin=0; - parent.rect.ymin=0; - parent.rect.ymax=h; - parent.rect.xmax=w; + DjVuTXT::Zone &tqparent=txt->page_zone; + tqparent.rect.xmin=0; + tqparent.rect.ymin=0; + tqparent.rect.ymax=h; + tqparent.rect.xmax=w; double ws=1.0; if(width && width != w) { @@ -1044,7 +1044,7 @@ lt_XMLParser::Impl::ChangeText( { hs=((double)h)/((double)height); } - make_child_layer(parent, tags, *textbs, h, ws,hs); + make_child_layer(tqparent, tags, *textbs, h, ws,hs); textbs->write8(0); long len = textbs->tell(); txt->page_zone.text_length = len; @@ -1062,7 +1062,7 @@ lt_XMLParser::Impl::parse_text( const lt_XMLTags &GObject, DjVuFile &dfile ) { - GPosition textPos = GObject.contains(hiddentexttag); + GPosition textPos = GObject.tqcontains(hiddentexttag); if(textPos) { // loop through the hidden text - there should only be one @@ -1078,7 +1078,7 @@ lt_XMLParser::Impl::parse_meta( const lt_XMLTags &GObject, DjVuFile &dfile ) { - GPosition metaPos = GObject.contains(metadatatag); + GPosition metaPos = GObject.tqcontains(metadatatag); if(metaPos) { // loop through the hidden text - there should only be one diff --git a/kviewshell/plugins/djvu/libdjvu/XMLTags.cpp b/kviewshell/plugins/djvu/libdjvu/XMLTags.cpp index 2511a585..9c1ad58a 100644 --- a/kviewshell/plugins/djvu/libdjvu/XMLTags.cpp +++ b/kviewshell/plugins/djvu/libdjvu/XMLTags.cpp @@ -321,7 +321,7 @@ lt_XMLTags::init(XMLByteStream &xmlbs) GPList<lt_XMLTags> lt_XMLTags::get_Tags(char const tagname[]) const { - GPosition pos=allTags.contains(tagname); + GPosition pos=allTags.tqcontains(tagname); GPList<lt_XMLTags> retval; return (pos?allTags[pos]:retval); } @@ -338,7 +338,7 @@ lt_XMLTags::get_Maps(char const tagname[], if(tag) { GPosition loc; - if((loc=tag->contains(tagname))) + if((loc=tag->tqcontains(tagname))) { GPList<lt_XMLTags> maps=(GPList<lt_XMLTags> &)((*tag)[loc]); for(GPosition mloc=maps;mloc;++mloc) @@ -348,7 +348,7 @@ lt_XMLTags::get_Maps(char const tagname[], { GMap<GUTF8String,GUTF8String> &args=gtag->args; GPosition gpos; - if((gpos=args.contains(argn))) + if((gpos=args.tqcontains(argn))) { map[args[gpos]]=gtag; } diff --git a/kviewshell/plugins/djvu/libdjvu/XMLTags.h b/kviewshell/plugins/djvu/libdjvu/XMLTags.h index 027e629b..df5974d0 100644 --- a/kviewshell/plugins/djvu/libdjvu/XMLTags.h +++ b/kviewshell/plugins/djvu/libdjvu/XMLTags.h @@ -121,7 +121,7 @@ public: inline void addtag(GP<lt_XMLTags> x); inline void addraw(GUTF8String raw); - inline GPosition contains(GUTF8String name) const; + inline GPosition tqcontains(GUTF8String name) const; inline const GPList<lt_XMLTags> & operator [] (const GUTF8String name) const; inline const GPList<lt_XMLTags> & operator [] (const GPosition &pos) const; static void ParseValues(char const *t, GMap<GUTF8String,GUTF8String> &args,bool downcase=true); @@ -213,9 +213,9 @@ inline const GMap<GUTF8String,GPList<lt_XMLTags> > & lt_XMLTags::get_allTags(void) const { return allTags; } inline GPosition -lt_XMLTags::contains(GUTF8String name) const +lt_XMLTags::tqcontains(GUTF8String name) const { - return allTags.contains(name); + return allTags.tqcontains(name); } inline const GPList<lt_XMLTags> & diff --git a/kviewshell/plugins/djvu/libdjvu/ZPCodec.h b/kviewshell/plugins/djvu/libdjvu/ZPCodec.h index 4eba6901..1483b93e 100644 --- a/kviewshell/plugins/djvu/libdjvu/ZPCodec.h +++ b/kviewshell/plugins/djvu/libdjvu/ZPCodec.h @@ -615,7 +615,7 @@ ZPCodec::IWencoder(const bool bit) numbers are much more probable than large numbers. We will first group our numbers into several sets. Each number is coded by first coding which set contains the number and then coding a position within the set. Each - set contains #2^n# numbers that we consider roughly equiprobable. Since + set tqcontains #2^n# numbers that we consider roughly equiprobable. Since the most probable values occur much more often, we want to model their probability more precisely. Therefore we use small sets for the most probable values and large sets for the least probable values, as @@ -716,7 +716,7 @@ ZPCodec::IWencoder(const bool bit) Adaptation on the other hand is a great simplification. A good data compression program must (a) represent the data in order to make its - predictability apparent, and (b) perform the predictions and generate the + predictability aptqparent, and (b) perform the predictions and generate the code bits. The ZP-Coder is an efficient and effortless solution for implementing task (b). diff --git a/kviewshell/plugins/djvu/libdjvu/configure.in.in b/kviewshell/plugins/djvu/libdjvu/configure.in.in index c2a1d2b6..9af3757d 100644 --- a/kviewshell/plugins/djvu/libdjvu/configure.in.in +++ b/kviewshell/plugins/djvu/libdjvu/configure.in.in @@ -217,7 +217,7 @@ AC_REQUIRE([AC_CANONICAL_HOST]) acx_pthread_ok=no # First, check if the POSIX threads header, pthread.h, is available. # If it isn't, don't bother looking for the threads libraries. -AC_CHECK_HEADER(pthread.h, , acx_pthread_ok=noheader) +KDE_CHECK_HEADER(pthread.h, , acx_pthread_ok=noheader) # We must check for the threads library under a number of different # names; the ordering is very important because some systems # (e.g. DEC) have both -lpthread and -lpthreads, where one of the @@ -378,10 +378,13 @@ fi if test x$acx_cothread != xno ; then AC_MSG_CHECKING([whether libgcc contains the cothread patch]) AC_LANG_PUSH([C++]) + kde_save_CXXFLAGS="$CXXFLAGS" + CXXFLAGS="$CXXFLAGS $qt_includes" AC_TRY_LINK([extern "C" { void *(*__get_eh_context_ptr)(); void *__new_eh_context(void); }], [ __get_eh_context_ptr = &__new_eh_context;], [acx_cothread_patch=yes], [acx_cothread_patch=no]) + CXXFLAGS="$kde_save_CXXFLAGS" AC_LANG_POP([C++]) AC_MSG_RESULT($acx_cothread_patch) if test x$acx_cothread_patch = xno ; then @@ -560,8 +563,8 @@ AC_HEADER_STDC AC_HEADER_DIRENT AC_HEADER_TIME AC_HEADER_SYS_WAIT -AC_CHECK_HEADERS(wchar.h wctype.h sys/mman.h iconv.h) -AC_CHECK_HEADERS(stdint.h sys/ipc.h sys/shm.h) +KDE_CHECK_HEADERS(wchar.h wctype.h sys/mman.h iconv.h) +KDE_CHECK_HEADERS(stdint.h sys/ipc.h sys/shm.h) # ---------------------------------------- # Types |