D4EnumDefs.h

// -*- mode: c++; c-basic-offset:4 -*-
 
// This file is part of libdap, A C++ implementation of the OPeNDAP Data
// Access Protocol.
 
// Copyright (c) 2013 OPeNDAP, Inc.
// Author: James Gallagher <jgallagher@opendap.org>
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
//
// You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.
 
#ifndef D4ENUMDEF_H_
#define D4ENUMDEF_H_
 
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
 
#include "BaseType.h"
 
using namespace std;
 
namespace libdap {
 
class D4EnumDefs;
class D4Group;
 
class D4EnumDef {
    string d_name;
    Type d_type;
    D4EnumDefs *d_parent; // a weak pointer, do not delete
 
    struct tuple {
        string label;
        long long value;
 
        tuple(const string &l, long long v) : label(l), value(v) {}
    };
 
    vector<tuple> d_tuples;
 
    void m_duplicate(const D4EnumDef &rhs)
    {
        d_name = rhs.d_name;
        d_type = rhs.d_type;
        d_parent = rhs.d_parent;
        d_tuples = rhs.d_tuples;
    }
 
    void print_value(XMLWriter &xml, const D4EnumDef::tuple &tuple) const;
 
public:
    typedef vector<tuple>::iterator D4EnumValueIter;
 
    D4EnumDef() : d_name(""), d_type(dods_null_c), d_parent(0) {}
    D4EnumDef(const string &n, const Type &t, D4EnumDefs *e = 0) : d_name(n), d_type(t), d_parent(e) {}
    D4EnumDef(const D4EnumDef &rhs) {
        m_duplicate(rhs);
    }
 
    virtual ~D4EnumDef() { }
 
    D4EnumDef &operator=(const D4EnumDef &rhs) {
        if (this == &rhs) return *this;
        m_duplicate(rhs);
        return *this;
    }
 
    string name() const { return d_name; }
    void set_name(const string &n) { d_name = n; }
 
    Type type() const { return d_type; }
    void set_type(Type t) { d_type = t; }
 
    D4EnumDefs *parent() const { return d_parent; }
    void set_parent(D4EnumDefs *e) { d_parent = e; }
 
    bool empty() const { return d_tuples.empty(); }
 
    void add_value(const string &label, long long value) {
        d_tuples.push_back(tuple(label, value));
    }
 
    D4EnumValueIter value_begin() { return d_tuples.begin(); }
    D4EnumValueIter value_end() { return d_tuples.end(); }
    string &label(D4EnumValueIter i) { return (*i).label; }
    long long value(D4EnumValueIter i) { return (*i).value; }
 
    bool is_valid_enum_value(long long value);
    void print_dap4(XMLWriter &xml) const;
};
 
class D4EnumDefs {
    vector<D4EnumDef*> d_enums;
 
    D4Group *d_parent;      // the group that holds this set of D4EnumDefs; weak pointer, don't delete
 
    void m_print_enum(XMLWriter &xml, D4EnumDef *e) const;
 
    void m_duplicate(const D4EnumDefs &rhs) {
        D4EnumDefCIter i = rhs.d_enums.begin();
        while (i != rhs.d_enums.end()) {
            d_enums.push_back(new D4EnumDef(**i++));    // deep copy
        }
 
        d_parent = rhs.d_parent;
    }
 
public:
    typedef vector<D4EnumDef*>::iterator D4EnumDefIter;
    typedef vector<D4EnumDef*>::const_iterator D4EnumDefCIter;
 
    D4EnumDefs() : d_parent(0) {}
    D4EnumDefs(const D4EnumDefs &rhs) {
        m_duplicate(rhs);
    }
 
    virtual ~D4EnumDefs() {
        D4EnumDefIter i = d_enums.begin();
        while(i != d_enums.end()) {
            delete *i++;
        }
    }
 
    D4EnumDefs &operator=(const D4EnumDefs &rhs) {
        if (this == &rhs) return *this;
        m_duplicate(rhs);
        return *this;
    }
 
    bool empty() const { return d_enums.empty(); }
 
    D4Group *parent() const { return d_parent; }
    void set_parent(D4Group *p) { d_parent = p; }
 
    void add_enum(D4EnumDef *enum_def) {
        add_enum_nocopy(new D4EnumDef(*enum_def));
    }
    void add_enum_nocopy(D4EnumDef *enum_def) {
        enum_def->set_parent(this);
        d_enums.push_back(enum_def);
    }
 
    D4EnumDefIter enum_begin() { return d_enums.begin(); }
 
    D4EnumDefIter enum_end() { return d_enums.end(); }
 
    D4EnumDef *find_enum_def(const string &name);
 
    void insert_enum(D4EnumDef *enum_def, D4EnumDefIter i) {
        D4EnumDef *enum_def_copy = new D4EnumDef(*enum_def);
        enum_def_copy->set_parent(this);
        d_enums.insert(i, enum_def_copy);
    }
 
    void print_dap4(XMLWriter &xml, bool constrained = false) const;
};
 
} /* namespace libdap */
#endif /* D4ENUMDEF_H_ */