//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- +------------------------------------------------------------------
// 
// $Id: cin_data.cpp,v 1.7 2007/03/25 20:48:24 leonb Exp $
// $Name: release_3_5_23 $

#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#if NEED_GNUG_PRAGMAS
# pragma implementation
#endif

#include "cin_data.h"
#include "BSByteStream.h"

CINData::Item::Item(const char * name_, const char * data_, int length_)
{
   name=name_;
   data.resize(length_-1);
   memcpy(data, data_, length_);
}

GPList<CINData::Item>	* CINData::items;

GPList<CINData::Item> *
CINData::get_items(void)
{
   if (!items) items=new GPList<Item>();
   return items;
}

GP<ByteStream>
CINData::get(const char * name)
{
   GPList<Item> * items=get_items();

   for(GPosition pos=*items;pos;++pos)
   {
      GP<Item> item=(*items)[pos];
      if (item->name==name)
      {
	    // Decompress data and put it into a MemoryByteStream
	 GP<ByteStream> mem_str_in=ByteStream::create((const char *) item->data, item->data.size());
	 GP<ByteStream> bs_str=BSByteStream::create(mem_str_in);
	 
	 GP<ByteStream> mem_str_out=ByteStream::create();
	 mem_str_out->copy(*bs_str);
	 mem_str_out->seek(0);
	 return mem_str_out;	 
      }
   }
   return 0;
}

void
CINData::add(const char * name, const char * data, int length)
{
   GP<Item> new_item=new Item(name, data, length);
   
   GPList<Item> * items=get_items();

   for(GPosition pos=*items;pos;++pos)
   {
      GP<Item> item=(*items)[pos];
      if (item->name==name)
      {
	 *item=*new_item;
	 return;
      }
   }

   items->append(new_item);
}
