2000-12-04 18:37:03 +01:00
|
|
|
/*
|
2010-05-31 22:12:06 +02:00
|
|
|
* Copyright (c) 2000-2010 Stephen Williams (steve@icarus.com)
|
2000-12-04 18:37:03 +01:00
|
|
|
*
|
|
|
|
|
* This source code is free software; you can redistribute it
|
|
|
|
|
* and/or modify it in source code form under the terms of the GNU
|
|
|
|
|
* General Public License as published by the Free Software
|
|
|
|
|
* Foundation; either version 2 of the License, or (at your option)
|
|
|
|
|
* any later version.
|
|
|
|
|
*
|
|
|
|
|
* This program 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 General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
|
|
|
|
|
*/
|
|
|
|
|
|
2001-07-25 05:10:48 +02:00
|
|
|
# include "config.h"
|
|
|
|
|
|
2000-12-04 18:37:03 +01:00
|
|
|
# include "Attrib.h"
|
2010-05-31 22:12:06 +02:00
|
|
|
# include <cassert>
|
2000-12-04 18:37:03 +01:00
|
|
|
|
|
|
|
|
Attrib::Attrib()
|
|
|
|
|
{
|
|
|
|
|
nlist_ = 0;
|
|
|
|
|
list_ = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Attrib::~Attrib()
|
|
|
|
|
{
|
|
|
|
|
delete[] list_;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2004-02-20 19:53:33 +01:00
|
|
|
const verinum& Attrib::attribute(perm_string key) const
|
2000-12-04 18:37:03 +01:00
|
|
|
{
|
|
|
|
|
for (unsigned idx = 0 ; idx < nlist_ ; idx += 1) {
|
|
|
|
|
|
|
|
|
|
if (key == list_[idx].key)
|
|
|
|
|
return list_[idx].val;
|
|
|
|
|
}
|
|
|
|
|
|
2002-05-23 05:08:50 +02:00
|
|
|
static const verinum null;
|
|
|
|
|
return null;
|
2000-12-04 18:37:03 +01:00
|
|
|
}
|
|
|
|
|
|
2004-02-20 19:53:33 +01:00
|
|
|
void Attrib::attribute(perm_string key, const verinum&value)
|
2000-12-04 18:37:03 +01:00
|
|
|
{
|
|
|
|
|
unsigned idx;
|
|
|
|
|
|
|
|
|
|
for (idx = 0 ; idx < nlist_ ; idx += 1) {
|
|
|
|
|
if (key == list_[idx].key) {
|
|
|
|
|
list_[idx].val = value;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct cell_*tmp = new struct cell_[nlist_+1];
|
|
|
|
|
for (idx = 0 ; idx < nlist_ ; idx += 1)
|
|
|
|
|
tmp[idx] = list_[idx];
|
|
|
|
|
|
|
|
|
|
tmp[nlist_].key = key;
|
|
|
|
|
tmp[nlist_].val = value;
|
|
|
|
|
|
|
|
|
|
nlist_ += 1;
|
|
|
|
|
delete[]list_;
|
|
|
|
|
list_ = tmp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool Attrib::has_compat_attributes(const Attrib&that) const
|
|
|
|
|
{
|
|
|
|
|
unsigned idx;
|
|
|
|
|
|
|
|
|
|
for (idx = 0 ; idx < that.nlist_ ; idx += 1) {
|
|
|
|
|
|
2002-05-23 05:08:50 +02:00
|
|
|
verinum tmp = attribute(that.list_[idx].key);
|
2000-12-04 18:37:03 +01:00
|
|
|
if (tmp != that.list_[idx].val)
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
2002-05-26 03:39:02 +02:00
|
|
|
unsigned Attrib::attr_cnt() const
|
2000-12-04 18:37:03 +01:00
|
|
|
{
|
|
|
|
|
return nlist_;
|
|
|
|
|
}
|
|
|
|
|
|
2004-02-20 19:53:33 +01:00
|
|
|
perm_string Attrib::attr_key(unsigned idx) const
|
2000-12-04 18:37:03 +01:00
|
|
|
{
|
|
|
|
|
assert(idx < nlist_);
|
2004-02-20 19:53:33 +01:00
|
|
|
return list_[idx].key;
|
2000-12-04 18:37:03 +01:00
|
|
|
}
|
|
|
|
|
|
2002-05-26 03:39:02 +02:00
|
|
|
const verinum& Attrib::attr_value(unsigned idx) const
|
2000-12-04 18:37:03 +01:00
|
|
|
{
|
|
|
|
|
assert(idx < nlist_);
|
|
|
|
|
return list_[idx].val;
|
|
|
|
|
}
|