BxUnionCases.h

// ##################################################################
// BinX
// $Id: BxUnionCases_8h-source.html,v 1.1.1.1 2006/04/19 14:19:02 edikt2 Exp $
//
// Class for a collection of BxUnionCase.
// ##################################################################
/*

//  edikt::BinX
//  www.edikt.org
//  support@edikt.org

// Copyright (c) 2003 The University of Edinburgh.

*/

#ifndef __BxUnionCases__
#define __BxUnionCases__

#include "BxUnionCase.h"

class DECLSPEC BxUnionCases : public BxObject
{
private:
    BxUnionCase ** elements_;   //<array to hold the objects
    int     capacity_;      //<number of elements the current array can hold
    int     elementCount_;  //<number of elements actually in the array
    int     incrementSize_;    //<number of elements to increase every time

public:
    BxUnionCases();
    BxUnionCases(int,int);    //<capacity and incrementSize
    BxUnionCases(const BxUnionCases&);
    virtual ~BxUnionCases();

    virtual char* className() const { return "BxUnionCases"; } //<Returns the null-terminated string "BxUnionCases".

    bool add(BxUnionCase*);   //add a created data object at the end of the array
    BxUnionCase * remove(int index);     //remove an element by index
    void clear();   //remove all elements

    BxUnionCase * get(int index) const;  //get the object pointer by index
    BxUnionCase * get(const BxDataObject& discriminant) const;
    BxDataObject * getArm(int index) const;
    BxDataObject * getArm(const BxDataObject& discriminant) const;
    int count() const { return elementCount_; }    

    BxUnionCase * operator[](int index) const;

protected:
    bool expand();
    int findDiscriminantByValue(const BxDataObject& discriminant) const;
};

#endif

---