* Europagate, 1995
*
* $Log: cclqual.c,v $
- * Revision 1.1 1995/02/13 15:15:07 adam
+ * Revision 1.7 1995/04/17 09:31:46 adam
+ * Improved handling of qualifiers. Aliases or reserved words.
+ *
+ * Revision 1.6 1995/02/23 08:32:00 adam
+ * Changed header.
+ *
+ * Revision 1.4 1995/02/14 19:55:12 adam
+ * Header files ccl.h/cclp.h are gone! They have been merged an
+ * moved to ../include/ccl.h.
+ * Node kind(s) in ccl_rpn_node have changed names.
+ *
+ * Revision 1.3 1995/02/14 16:20:56 adam
+ * Qualifiers are read from a file now.
+ *
+ * Revision 1.2 1995/02/14 10:25:56 adam
+ * The constructions 'qualifier rel term ...' implemented.
+ *
+ * Revision 1.1 1995/02/13 15:15:07 adam
* Added handling of qualifiers. Not finished yet.
*
*/
#include <assert.h>
#include <string.h>
-#include "cclp.h"
+#include <ccl.h>
+/* Definition of CCL_bibset pointer */
struct ccl_qualifiers {
struct ccl_qualifier *list;
};
-void ccl_qual_add (CCL_bibset b,
- const char *name, int nuse, int *use, int relation,
- int position, int structure, int truncation,
- int completeness)
+/*
+ * ccl_qual_add: Add qualifier to Bibset. If qualifier already
+ * exists, then attributes are appendend to old
+ * definition.
+ * name: name of qualifier
+ * no: No of attribute type/value pairs.
+ * pairs: Attributes. pairs[0] first type, pair[1] first value,
+ * ... pair[2*no-2] last type, pair[2*no-1] last value.
+ */
+void ccl_qual_add (CCL_bibset b, const char *name, int no, int *pairs)
{
- struct ccl_qualifier *new_qual;
+ struct ccl_qualifier *q;
+ struct ccl_rpn_attr **attrp;
assert (b);
- new_qual = malloc (sizeof(*new_qual));
- assert (new_qual);
-
- new_qual->next = b->list;
- b->list = new_qual;
+ for (q = b->list; q; q = q->next)
+ if (!strcmp (name, q->name))
+ break;
+ if (!q)
+ {
+ struct ccl_qualifier *new_qual = malloc (sizeof(*new_qual));
+ assert (new_qual);
+
+ new_qual->next = b->list;
+ b->list = new_qual;
+
+ new_qual->name = malloc (strlen(name)+1);
+ assert (new_qual->name);
+ strcpy (new_qual->name, name);
+ attrp = &new_qual->attr_list;
+ }
+ else
+ {
+ attrp = &q->attr_list;
+ while (*attrp)
+ attrp = &(*attrp)->next;
+ }
+ while (--no >= 0)
+ {
+ struct ccl_rpn_attr *attr;
- new_qual->name = malloc (strlen(name)+1);
- assert (new_qual->name);
- strcpy (new_qual->name, name);
- new_qual->nuse = nuse;
- new_qual->use = malloc (sizeof(int)*nuse);
- assert (new_qual->use);
- memcpy (new_qual->use, use, sizeof(int)*nuse);
- new_qual->relation = relation;
- new_qual->position = position;
- new_qual->structure = structure;
- new_qual->truncation = truncation;
- new_qual->completeness = completeness;
+ attr = malloc (sizeof(*attr));
+ assert (attr);
+ attr->type = *pairs++;
+ attr->value = *pairs++;
+ *attrp = attr;
+ attrp = &attr->next;
+ }
+ *attrp = NULL;
}
+/*
+ * ccl_qual_mk: Make new (empty) bibset.
+ * return: empty bibset.
+ */
CCL_bibset ccl_qual_mk (void)
{
CCL_bibset b = malloc (sizeof(*b));
return b;
}
+/*
+ * ccl_qual_rm: Delete bibset.
+ * b: pointer to bibset
+ */
void ccl_qual_rm (CCL_bibset *b)
{
- assert (*b);
+ struct ccl_qualifier *q, *q1;
+
+ if (!*b)
+ return;
+ for (q = (*b)->list; q; q = q1)
+ {
+ struct ccl_rpn_attr *attr, *attr1;
+
+ for (attr = q->attr_list; attr; attr = attr1)
+ {
+ attr1 = attr->next;
+ free (attr);
+ }
+ q1 = q->next;
+ free (q);
+ }
+ free (*b);
*b = NULL;
}
-struct ccl_qualifier *ccl_qual_search (CCL_bibset b, const char *name)
+/*
+ * ccl_qual_search: Search for qualifier in bibset.
+ * b: Bibset
+ * name: Name of qualifier to search for (need no null-termination)
+ * len: Length of name.
+ * return: Attribute info. NULL if not found.
+ */
+struct ccl_rpn_attr *ccl_qual_search (CCL_bibset b, const char *name, int len)
{
struct ccl_qualifier *q;
assert (b);
for (q = b->list; q; q = q->next)
- if (strcmp (name, q->name))
- return q;
+ if (strlen(q->name) == len && !memcmp (name, q->name, len))
+ return q->attr_list;
return NULL;
}
+