-/* $Id: d1_map.c,v 1.16 2007-04-16 08:44:31 adam Exp $
- Copyright (C) 1995-2007
- Index Data ApS
-
-This file is part of the Zebra server.
+/* This file is part of the Zebra server.
+ Copyright (C) 1994-2009 Index Data
Zebra 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
#include <yaz/tpath.h>
#include <d1_absyn.h>
+struct data1_mapunit
+{
+ int no_data;
+ int no_chop;
+ char *source_element_name;
+ data1_maptag *target_path;
+ struct data1_mapunit *next;
+};
+
data1_maptab *data1_read_maptab (data1_handle dh, const char *file)
{
NMEM mem = data1_nmem_get (dh);
(*mapp)->no_data = 1;
else
(*mapp)->no_data = 0;
+ if (argc > 3 && !data1_matchstr(argv[3], "nochop"))
+ (*mapp)->no_chop = 1;
+ else
+ (*mapp)->no_chop = 0;
(*mapp)->source_element_name =
(char *)nmem_malloc(mem, strlen(argv[1])+1);
strcpy((*mapp)->source_element_name, argv[1]);
}
/*
- * Locate node with given elementname.
- * NOTE: This is stupid - we don't find repeats this way.
- */
-static data1_node *find_node(data1_node *p, char *elementname)
-{
- data1_node *c, *r;
-
- for (c = p->child; c; c = c->next)
- if (c->which == DATA1N_tag && c->u.tag.element &&
- !data1_matchstr(c->u.tag.element->name, elementname))
- return c;
- else if ((r = find_node(c, elementname)))
- return r;
- return 0;
-}
-
-/*
* See if the node n is equivalent to the tag t.
*/
static int tagmatch(data1_node *n, data1_maptag *t)
cur->child =
dup_child (dh, c->child,
&cur->last_child, mem, cur);
+ if (!m->no_chop)
+ {
+ data1_concat_text(dh, mem, cur->child);
+ data1_chop_text(dh, mem, cur->child);
+ }
}
}
}
/*
* Local variables:
* c-basic-offset: 4
+ * c-file-style: "Stroustrup"
* indent-tabs-mode: nil
* End:
* vim: shiftwidth=4 tabstop=8 expandtab