X-Git-Url: http://git.indexdata.com/?a=blobdiff_plain;f=retrieval%2Fd1_if.c;h=62facc35d81cab74d667b4709d01092f2d43c648;hb=548d8ab9b0b5930db27643b47fc55afce5511219;hp=db172a42ec37b7a33e217bd30ced9651f05f09de;hpb=4ee3f2c5b2404a96041129f8bffa7d3e15a75d19;p=yaz-moved-to-github.git

diff --git a/retrieval/d1_if.c b/retrieval/d1_if.c
index db172a4..62facc3 100644
--- a/retrieval/d1_if.c
+++ b/retrieval/d1_if.c
@@ -1,12 +1,18 @@
 /*
- * Copyright (c) 1995-1999, Index Data.
+ * Copyright (c) 1995-2000, Index Data.
  * See the file LICENSE for details.
- * Sebastian Hammer, Adam Dickmeiss
  *
- * d1_if.c : A simple interface for extracting strings from data1_node tree structures
+ * d1_if.c : A simple interface for extracting strings from data1_node
+ *           tree structures
  *
  * $Log: d1_if.c,v $
- * Revision 1.3  2000-01-06 11:27:02  adam
+ * Revision 1.5  2000-02-10 13:42:43  adam
+ * Removed C++ comment.
+ *
+ * Revision 1.4  2000/01/06 14:30:56  adam
+ * Minor change - to prevent warnings.
+ *
+ * Revision 1.3  2000/01/06 11:27:02  adam
  * Minor fix so that this source compiles using Visual C++.
  *
  * Revision 1.2  2000/01/04 17:46:17  ian
@@ -17,7 +23,6 @@
  * Also added a simple interface for extracting values from data1 trees using
  * a string based tagpath.
  *
- *
  */
 
 #include <stdio.h>
@@ -57,7 +62,7 @@ char data1_ScanNextToken(char* pBuffer,
         else
         {
             if ( strchr(pWhitespaceChars, **pPosInBuffer) != NULL )
-                *pPosInBuffer++;
+                (*pPosInBuffer)++;
             else
                 *pBuff++ = *((*pPosInBuffer)++);
         }
@@ -107,7 +112,9 @@ char *data1_getNodeValue(data1_node* node, char* pTagPath)
 }
 
 
+/* Max length of a tag */
 #define MAX_TAG_SIZE 50
+
 /* 
  * data1_LookupNode : Try and find a node as specified by a tagpath
  */
@@ -119,9 +126,6 @@ data1_node *data1_LookupNode(data1_node* node, char* pTagPath)
     /* Current Child node as we search for nodes matching the pattern in the tagpath */
     data1_node* current_child = node->child;
 
-    /* Max length of a tag */
-    int iMaxTagSize=50;
-
     /* Current position in string */
     char* pCurrCharInPath = pTagPath;
 
@@ -215,12 +219,14 @@ data1_node *data1_LookupNode(data1_node* node, char* pTagPath)
                 {
                     if ( iOccurences )
                     {
-                        // Everything matched, but not yet found the right occurence of the given tag
+                        /* Everything matched, but not yet found the
+                           right occurence of the given tag */
                         iOccurences--;
                     }
                     else
                     {
-                        /* We have matched a string tag... Is there more to process? */
+                        /* We have matched a string tag... Is there more to
+                           process? */
                         matched_node = current_child;
                     }
                 }