1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
|
/*
* rel_list.cc: Part of GNU CSSC.
*
* Copyright (C) 1997,1999, Free Software Foundation, Inc.
*
* This program is free software; you can redistribute it and/or modify
* it 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, USA.
*
* CSSC was originally Based on MySC, by Ross Ridge, which was
* placed in the Public Domain.
*
*/
#include "cssc.h"
#include "rel_list.h"
#include <stdlib.h>
#ifdef CONFIG_SCCS_IDS
static const char rcs_id[] = "CSSC $Id: rel_list.cc,v 1.9 2001/09/29 19:39:41 james_youngman Exp $";
#endif
// Because we use member() all the time, this
// is a quadratic algorithm...but N is usually very small.
release_list::release_list(const char *s)
{
ASSERT(NULL != s);
char *p;
while (*s)
{
long int n = strtol(s, &p, 10);
if (p == s)
break; // not numeric.
if (n < 0)
ctor_fail(-1, "ranges not allowed in release lists");
// add the entry if not already a member.
const release r(n);
if (!member(r))
l.add(r);
s = p;
if (',' == *s)
s++;
}
}
// linear search for possible member.
bool release_list::member(release r) const
{
const int len = l.length();
for(int i=0; i<len; i++)
{
if (l[i] == r)
return true;
}
return false;
}
release_list::release_list()
{
}
release_list::release_list(const release_list &r)
{
l = r.l;
}
release_list::~release_list()
{
}
bool release_list::print(FILE * out) const
{
const int len = l.length();
for(int i=0; i<len; i++)
{
if (i > 0)
{
if (putc_failed(fputc(' ', out)))
return false;
}
if (l[i].print(out))
return false;
}
return true;
}
// Explicit template instantiations...
template class mylist<release>;
/* Local variables: */
/* mode: c++ */
/* End: */
|