/*
 * Copyright (c) 1989 Stanford University
 *
 * Permission to use, copy, modify, distribute, and sell this software and its
 * documentation for any purpose is hereby granted without fee, provided
 * that the above copyright notice appear in all copies and that both that
 * copyright notice and this permission notice appear in supporting
 * documentation, and that the name of Stanford not be used in advertising or
 * publicity pertaining to distribution of the software without specific,
 * written prior permission.  Stanford makes no representations about
 * the suitability of this software for any purpose.  It is provided "as is"
 * without express or implied warranty.
 *
 * STANFORD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
 * IN NO EVENT SHALL STANFORD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
 * DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
 * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

/*
 * Object association table.
 */

#ifndef BitmapTable_h
#define BitmapTable_h

#include "table2.h"

class BitmapTableEntry;

class BitmapTable : public Table2 {
public:
    BitmapTable(int);
    void Insert(unsigned long, int, class Bitmap*);
    boolean Find(class Bitmap*&, unsigned long, int);
    void Remove(unsigned long, int);
};

inline BitmapTable::BitmapTable (int n) : (n) {}

inline void BitmapTable::Insert (unsigned long k1, int k2, class Bitmap* v) {
    Table2::Insert((void*)k1, (void*)k2, (void*)v);
}

inline boolean BitmapTable::Find (class Bitmap*& v, unsigned long k1, int k2) {
    void* vv;

    boolean b = Table2::Find(vv, (void*)k1, (void*)k2);
    if (b) {
	v = (class Bitmap*)vv;
    }
    return b;
}

inline void BitmapTable::Remove (unsigned long k1, int k2) {
    Table2::Remove((void*)k1, (void*)k2);
}

#endif