//C- -*- C++ -*- //C- ------------------------------------------------------------------- //C- DjVuLibre-3.5 //C- Copyright (c) 2002 Leon Bottou and Yann Le Cun. //C- Copyright (c) 2001 AT&T //C- //C- This software is subject to, and may be distributed under, the //C- GNU General Public License, either Version 2 of the license, //C- or (at your option) any later version. The license should have //C- accompanied the software or you may obtain a copy of the license //C- from the Free Software Foundation at http://www.fsf.org . //C- //C- This program is distributed in the hope that it will be useful, //C- but WITHOUT ANY WARRANTY; without even the implied warranty of //C- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //C- GNU General Public License for more details. //C- //C- DjVuLibre-3.5 is derived from the DjVu(r) Reference Library from //C- Lizardtech Software. Lizardtech Software has authorized us to //C- replace the original DjVu(r) Reference Library notice by the following //C- text (see doc/lizard2002.djvu and doc/lizardtech2007.djvu): //C- //C- ------------------------------------------------------------------ //C- | DjVu (r) Reference Library (v. 3.5) //C- | Copyright (c) 1999-2001 LizardTech, Inc. All Rights Reserved. //C- | The DjVu Reference Library is protected by U.S. Pat. No. //C- | 6,058,214 and patents pending. //C- | //C- | This software is subject to, and may be distributed under, the //C- | GNU General Public License, either Version 2 of the license, //C- | or (at your option) any later version. The license should have //C- | accompanied the software or you may obtain a copy of the license //C- | from the Free Software Foundation at http://www.fsf.org . //C- | //C- | The computer code originally released by LizardTech under this //C- | license and unmodified by other parties is deemed "the LIZARDTECH //C- | ORIGINAL CODE." Subject to any third party intellectual property //C- | claims, LizardTech grants recipient a worldwide, royalty-free, //C- | non-exclusive license to make, use, sell, or otherwise dispose of //C- | the LIZARDTECH ORIGINAL CODE or of programs derived from the //C- | LIZARDTECH ORIGINAL CODE in compliance with the terms of the GNU //C- | General Public License. This grant only confers the right to //C- | infringe patent claims underlying the LIZARDTECH ORIGINAL CODE to //C- | the extent such infringement is reasonably necessary to enable //C- | recipient to make, have made, practice, sell, or otherwise dispose //C- | of the LIZARDTECH ORIGINAL CODE (or portions thereof) and not to //C- | any greater extent that may be necessary to utilize further //C- | modifications or combinations. //C- | //C- | The LIZARDTECH ORIGINAL CODE is provided "AS IS" WITHOUT WARRANTY //C- | OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED //C- | TO ANY WARRANTY OF NON-INFRINGEMENT, OR ANY IMPLIED WARRANTY OF //C- | MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. //C- +------------------------------------------------------------------ #ifdef HAVE_CONFIG_H # include "config.h" #endif #if NEED_GNUG_PRAGMAS # pragma implementation #endif #include "DjVuNavDir.h" #include "debug.h" #include "GException.h" #include "GOS.h" #include "ByteStream.h" #include "GURL.h" #include #ifdef HAVE_NAMESPACES namespace DJVU { # ifdef NOT_DEFINED // Just to fool emacs c++ mode } #endif #endif DjVuNavDir::DjVuNavDir(const GURL &dirURL) { if (!dirURL) G_THROW( ERR_MSG("DjVuNavDir.zero_dir") ); baseURL=dirURL.base(); } DjVuNavDir::DjVuNavDir(ByteStream & str, const GURL &dirURL) { if (!dirURL) G_THROW( ERR_MSG("DjVuNavDir.zero_dir") ); baseURL=GURL(dirURL).base(); decode(str); } void DjVuNavDir::decode(ByteStream & str) { GCriticalSectionLock lk(&lock); GList tmp_page2name; int eof=0; while(!eof) { char buffer[1024]; char * ptr; for(ptr=buffer;ptr-buffer<1024;ptr++) if ((eof=!str.read(ptr, 1)) || *ptr=='\n') break; if (ptr-buffer==1024) G_THROW( ERR_MSG("DjVuNavDir.long_line") ); *ptr=0; if (!strlen(buffer)) continue; if (!tmp_page2name.contains(buffer)) tmp_page2name.append(buffer); }; // Now copying lists to arrays for faster access later int pages=tmp_page2name.size(); page2name.resize(pages-1); int cnt; GPosition pos; for(pos=tmp_page2name, cnt=0;pos;++pos, cnt++) page2name[cnt]=tmp_page2name[pos]; // Now creating reverse mapping (strings => numbers) for(cnt=0;cnt=page2name.size()) G_THROW( ERR_MSG("DjVuNavDir.large_page") ); return page2name[page]; } GURL DjVuNavDir::page_to_url(int page) const { GCriticalSectionLock lk((GCriticalSection *)&lock); return GURL::UTF8(page_to_name(page),baseURL); } void DjVuNavDir::insert_page(int where, const char * name) { GCriticalSectionLock lk((GCriticalSection *)&lock); int pages=page2name.size(); if (where<0) where=pages; page2name.resize(pages); for(int i=pages;i>where;i--) page2name[i]=page2name[i-1]; page2name[where]=name; name2page[name]=where; url2page[GURL::UTF8(name,baseURL)]=where; } #ifndef NEED_DECODER_ONLY void DjVuNavDir::delete_page(int page_num) { GCriticalSectionLock lk((GCriticalSection *)&lock); int pages=page2name.size(); if (page_num<0 || page_num>=pages) G_THROW( ERR_MSG("DjVuNavDir.bad_page") ); for(int i=page_num;i