head	1.1;
access;
symbols
	pkgsrc-2026Q1:1.1.0.108
	pkgsrc-2026Q1-base:1.1
	pkgsrc-2025Q4:1.1.0.106
	pkgsrc-2025Q4-base:1.1
	pkgsrc-2025Q3:1.1.0.104
	pkgsrc-2025Q3-base:1.1
	pkgsrc-2025Q2:1.1.0.102
	pkgsrc-2025Q2-base:1.1
	pkgsrc-2025Q1:1.1.0.100
	pkgsrc-2025Q1-base:1.1
	pkgsrc-2024Q4:1.1.0.98
	pkgsrc-2024Q4-base:1.1
	pkgsrc-2024Q3:1.1.0.96
	pkgsrc-2024Q3-base:1.1
	pkgsrc-2024Q2:1.1.0.94
	pkgsrc-2024Q2-base:1.1
	pkgsrc-2024Q1:1.1.0.92
	pkgsrc-2024Q1-base:1.1
	pkgsrc-2023Q4:1.1.0.90
	pkgsrc-2023Q4-base:1.1
	pkgsrc-2023Q3:1.1.0.88
	pkgsrc-2023Q3-base:1.1
	pkgsrc-2023Q2:1.1.0.86
	pkgsrc-2023Q2-base:1.1
	pkgsrc-2023Q1:1.1.0.84
	pkgsrc-2023Q1-base:1.1
	pkgsrc-2022Q4:1.1.0.82
	pkgsrc-2022Q4-base:1.1
	pkgsrc-2022Q3:1.1.0.80
	pkgsrc-2022Q3-base:1.1
	pkgsrc-2022Q2:1.1.0.78
	pkgsrc-2022Q2-base:1.1
	pkgsrc-2022Q1:1.1.0.76
	pkgsrc-2022Q1-base:1.1
	pkgsrc-2021Q4:1.1.0.74
	pkgsrc-2021Q4-base:1.1
	pkgsrc-2021Q3:1.1.0.72
	pkgsrc-2021Q3-base:1.1
	pkgsrc-2021Q2:1.1.0.70
	pkgsrc-2021Q2-base:1.1
	pkgsrc-2021Q1:1.1.0.68
	pkgsrc-2021Q1-base:1.1
	pkgsrc-2020Q4:1.1.0.66
	pkgsrc-2020Q4-base:1.1
	pkgsrc-2020Q3:1.1.0.64
	pkgsrc-2020Q3-base:1.1
	pkgsrc-2020Q2:1.1.0.60
	pkgsrc-2020Q2-base:1.1
	pkgsrc-2020Q1:1.1.0.40
	pkgsrc-2020Q1-base:1.1
	pkgsrc-2019Q4:1.1.0.62
	pkgsrc-2019Q4-base:1.1
	pkgsrc-2019Q3:1.1.0.58
	pkgsrc-2019Q3-base:1.1
	pkgsrc-2019Q2:1.1.0.56
	pkgsrc-2019Q2-base:1.1
	pkgsrc-2019Q1:1.1.0.54
	pkgsrc-2019Q1-base:1.1
	pkgsrc-2018Q4:1.1.0.52
	pkgsrc-2018Q4-base:1.1
	pkgsrc-2018Q3:1.1.0.50
	pkgsrc-2018Q3-base:1.1
	pkgsrc-2018Q2:1.1.0.48
	pkgsrc-2018Q2-base:1.1
	pkgsrc-2018Q1:1.1.0.46
	pkgsrc-2018Q1-base:1.1
	pkgsrc-2017Q4:1.1.0.44
	pkgsrc-2017Q4-base:1.1
	pkgsrc-2017Q3:1.1.0.42
	pkgsrc-2017Q3-base:1.1
	pkgsrc-2017Q2:1.1.0.38
	pkgsrc-2017Q2-base:1.1
	pkgsrc-2017Q1:1.1.0.36
	pkgsrc-2017Q1-base:1.1
	pkgsrc-2016Q4:1.1.0.34
	pkgsrc-2016Q4-base:1.1
	pkgsrc-2016Q3:1.1.0.32
	pkgsrc-2016Q3-base:1.1
	pkgsrc-2016Q2:1.1.0.30
	pkgsrc-2016Q2-base:1.1
	pkgsrc-2016Q1:1.1.0.28
	pkgsrc-2016Q1-base:1.1
	pkgsrc-2015Q4:1.1.0.26
	pkgsrc-2015Q4-base:1.1
	pkgsrc-2015Q3:1.1.0.24
	pkgsrc-2015Q3-base:1.1
	pkgsrc-2015Q2:1.1.0.22
	pkgsrc-2015Q2-base:1.1
	pkgsrc-2015Q1:1.1.0.20
	pkgsrc-2015Q1-base:1.1
	pkgsrc-2014Q4:1.1.0.18
	pkgsrc-2014Q4-base:1.1
	pkgsrc-2014Q3:1.1.0.16
	pkgsrc-2014Q3-base:1.1
	pkgsrc-2014Q2:1.1.0.14
	pkgsrc-2014Q2-base:1.1
	pkgsrc-2014Q1:1.1.0.12
	pkgsrc-2014Q1-base:1.1
	pkgsrc-2013Q4:1.1.0.10
	pkgsrc-2013Q4-base:1.1
	pkgsrc-2013Q3:1.1.0.8
	pkgsrc-2013Q3-base:1.1
	pkgsrc-2013Q2:1.1.0.6
	pkgsrc-2013Q2-base:1.1
	pkgsrc-2013Q1:1.1.0.4
	pkgsrc-2013Q1-base:1.1
	pkgsrc-2012Q4:1.1.0.2
	pkgsrc-2012Q4-base:1.1;
locks; strict;
comment	@// @;


1.1
date	2012.12.21.10.29.47;	author dholland;	state Exp;
branches;
next	;


desc
@@


1.1
log
@Chase after that moving target known lightly as the C++ "standard".
Fixes build. Also clean up insecure-temporary-files. PKGREVISION -> 1.
@
text
@$NetBSD$

Chase after the C++ standard:
   - use the newfangled names for C++ headers
   - use "std" qualification
   - string constants are const char *

--- doctype/html.cxx~	2000-02-04 22:46:35.000000000 +0000
+++ doctype/html.cxx
@@@@ -115,12 +115,12 @@@@ Author:   	Edward C. Zimmermann, edz@@bsn
 Copyright:	Basis Systeme netzwerk, Munich
 @@@@@@-*/
 
-#include <iostream.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <ctype.h>
-#include <string.h>
-#include <errno.h>
+#include <iostream>
+#include <cstdio>
+#include <cstdlib>
+#include <cctype>
+#include <cstring>
+#include <cerrno>
 #include "isearch.hxx"
 //#include "common.hxx"
 #include "html.hxx"
@@@@ -183,7 +183,7 @@@@ static int IsHTMLAttributeTag (const cha
 {
   // HTML Attributes where we are also interested in values
   static struct {
-    char *tag;
+    const char *tag;
     unsigned char len;
   } Tags[] = {
 /*- UNSORTED LIST (lowercase names) -*/ 
@@@@ -357,7 +357,7 @@@@ static int IgnoreHTMLTag (const char *ta
 #endif
 
 // Search for the next occurance of an element of tags in tag_list
-static const char *find_next_tag (char *const *tag_list, char *const *tags)
+static const char *find_next_tag (char *const *tag_list, const char *const *tags)
 {
   if (*tag_list == NULL)
     return NULL;
@@@@ -393,7 +393,7 @@@@ void HTML::ParseFields (PRECORD NewRecor
   if (fp == NULL)
     {
     error:
-      cout << "Unable to parse HTML file \"" << fn << "\"\n";
+      std::cout << "Unable to parse HTML file \"" << fn << "\"\n";
       return;
     }
 
@@@@ -451,17 +451,17 @@@@ void HTML::ParseFields (PRECORD NewRecor
 	  if (StrCaseCmp (*tags_ptr, "dd") == 0)
 	    {
 	      // Look for nearest <DT> or </DL>
-	      static char *tags[] = {"dt", "/dl", NULL};
+	      static const char *tags[] = {"dt", "/dl", NULL};
 	      p = find_next_tag (tags_ptr, tags);
 	      if (p == NULL)
 		{
 		  // Some bogus uses
-		  static char *tags[] = {"dd", "/ul", "/ol", NULL};
+		  static const char *tags[] = {"dd", "/ul", "/ol", NULL};
 		  p = find_next_tag (tags_ptr, tags);
 		  if (p)
 		    {
 		      // Give some information
-		      cout << "HTML Warning: \""
+		      std::cout << "HTML Warning: \""
 			<< fn << "\" offset " << (size_t) (*tags_ptr - RecBuffer) << ": "
 			<< "Bogus use of <" << *tags_ptr << ">, using <" << p << "> as end tag.\n";
 		    }
@@@@ -470,17 +470,17 @@@@ void HTML::ParseFields (PRECORD NewRecor
 	  else if (StrCaseCmp (*tags_ptr, "dt") == 0)
 	    {
 	      // look for next <DD> or </DL>
-	      static char *tags[] = {"DD", "/DL", NULL};
+	      static const char *tags[] = {"DD", "/DL", NULL};
 	      p = find_next_tag (tags_ptr, tags);
 	      if (p == NULL)
 		{
 		  // Some bogus uses
-		  static char *tags[] = {"dt", "/ul", "/ol", NULL};
+		  static const char *tags[] = {"dt", "/ul", "/ol", NULL};
 		  p = find_next_tag (tags_ptr, tags);
 		  if (p)
 		    {
 		      // Give some information
-		      cout << "HTML Warning: \""
+		      std::cout << "HTML Warning: \""
 			<< fn << "\" offset " << (*tags_ptr - RecBuffer) << ": "
 			<< "Bogus use of <" << *tags_ptr << ">, using <" << p << "> as end tag.\n";
 		    }
@@@@ -489,13 +489,13 @@@@ void HTML::ParseFields (PRECORD NewRecor
 	  else if (StrCaseCmp (*tags_ptr, "li") == 0)
 	    {
 	      // look for next <LI>, </OL> or </UL>
-	      static char *tags[] = {"li", "/ol", "/ul", NULL};
+	      static const char *tags[] = {"li", "/ol", "/ul", NULL};
 	      p = find_next_tag (tags_ptr, tags);
 	    }
 	  else if (StrCaseCmp (*tags_ptr, "tl") == 0)
 	    {
 	      // look for nearest <TL> or </TLI>
-	      static char *tags[] = {"tl", "/tli", NULL};
+	      static const char *tags[] = {"tl", "/tli", NULL};
 	      p = find_next_tag (tags_ptr, tags);
 	    }
 	}			// end code to handle some HTML minimized tags
@