DataMuseum.dk

top - metrics - download

    Length: 2304 (0x900)
    Types: TextFile
    Names: »Bag.hP«

└─⟦a05ed705a⟧ Bits:30007078 DKUUG GNU 2/12/89
    └─⟦cc8755de2⟧ »./libg++-1.36.1.tar.Z« 
        └─⟦23757c458⟧ 
            └─⟦this⟧ »libg++/g++-include/Bag.hP« 

TextFile

// This may look like C code, but it is really -*- C++ -*-
/* 
Copyright (C) 1988 Free Software Foundation
    written by Doug Lea (dl@rocky.oswego.edu)

This file is part of GNU CC.

GNU CC is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY.  No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing.  Refer to the GNU CC General Public
License for full details.

Everyone is granted permission to copy, modify and redistribute
GNU CC, but only under the conditions described in the
GNU CC General Public License.   A copy of this license is
supposed to have been given to you along with GNU CC so you
can know your rights and responsibilities.  It should be in a
file named COPYING.  Among other things, the copyright notice
and this notice must be preserved on all copies.  
*/


#ifndef _<T>Bag_h
#pragma once
#define _<T>Bag_h 1

#include <Pix.h>
#include "<T>.defs.h"

class <T>Bag
{
protected:
  int                   count;

public:
  int                   length();                // current number of items
  int                   empty();

  virtual Pix           add(<T&> item) = 0;      // add item; return Pix

  virtual void          del(<T&> item) = 0;      // delete 1 occurrence of item
  virtual void          remove(<T&> item);       // delete all occurrences
  virtual void          clear();                 // delete all items

  virtual int           contains(<T&> item);     // is item in Bag?
  virtual int           nof(<T&> item);          // how many in Bag?

  virtual Pix           first() = 0;             // Pix of first item or 0
  virtual void          next(Pix& i) = 0;        // advance to next or 0

  virtual <T>&          operator () (Pix i) = 0; // access item at i

  virtual Pix           seek(<T&> item, Pix from=0); // Pix of next occurrence
  virtual int           owns(Pix i);             // is i a valid Pix  ?

  void                  error(char* msg);
  virtual int           OK() = 0;                // rep invariant
};

inline int <T>Bag::length()
{
  return count;
}

inline int <T>Bag::empty()
{
  return count == 0;
}

inline int <T>Bag::contains(<T&> item)
{
  return seek(item) != 0;
}
 
#endif