(sccsid): Useless, as we don't use SCCS. Remove.

diff --git a/src/lib/as/as_costcomp.c b/src/lib/as/as_costcomp.c
index c0b86d95ef05c91d62524516dd3886153ed31eae..d0a43d7000b51c14818f1e09e6b609998b46d2dc 100644 (file)
--- a/src/lib/as/as_costcomp.c
+++ b/src/lib/as/as_costcomp.c
@@ -19,10 +19,6 @@
  */
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_costcomp.c      1.4     11/13/90";
-#endif /* not lint */
-
 /*
  * Compare the lower bound costs of two nodes.  If the two nodes have
  * equal lower bound costs, sort on the secondary field.

diff --git a/src/lib/as/as_delete.c b/src/lib/as/as_delete.c
index 30efb6453578947ba38c284940de6c2a40cf91ef..39292e5fec1c7c6940b81a10a6243e65a66e5b00 100644 (file)
--- a/src/lib/as/as_delete.c
+++ b/src/lib/as/as_delete.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_delete.c        1.5     11/13/90";
-#endif /* not lint */
-
 static void as_free_queue(struct as_queue *queue);
 
 /*

diff --git a/src/lib/as/as_extend.c b/src/lib/as/as_extend.c
index a51b89c251b8e8abdcaf8f37e9a888524e4e3bf8..86ed6fe4a15d4b94b8fe2b956c2bb67df7a41360 100644 (file)
--- a/src/lib/as/as_extend.c
+++ b/src/lib/as/as_extend.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_extend.c        1.2     11/13/90";
-#endif /* not lint */
-
 /*
  * Extend the queue by neighbors.  This entails getting the
  * coordinates of all the neighbors, figuring out their lower bound

diff --git a/src/lib/as/as_hash.c b/src/lib/as/as_hash.c
index 030dd9147c38746f9bcb1aca9310a1c77fe5e24f..d9a47f2efef82fa4a4721febe8ea808b44fffcf1 100644 (file)
--- a/src/lib/as/as_hash.c
+++ b/src/lib/as/as_hash.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_hash.c  1.2     11/13/90";
-#endif /* not lint */
-
 /*
  * Return a pointer to the as_queue structure associated with
  * this coordinate if the coordinate is in the queue.

diff --git a/src/lib/as/as_init.c b/src/lib/as/as_init.c
index 32ff719b694e530675f623457e7c20faa811a509..a31fc85f930dc3272ae836fffdc7c995644f1ca1 100644 (file)
--- a/src/lib/as/as_init.c
+++ b/src/lib/as/as_init.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_init.c  1.4     11/13/90";
-#endif /* not lint */
-
 /*
  * Return an as_data structure with the necessary fields filled in
  * and space malloced.  Return NULL if malloc fails.

diff --git a/src/lib/as/as_merge.c b/src/lib/as/as_merge.c
index 835495426b8ee42ec86ecb1a1579338a15652f79..1f7a361c02466a4b3b5e69f6c7c347f9f10f4f2c 100644 (file)
--- a/src/lib/as/as_merge.c
+++ b/src/lib/as/as_merge.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_merge.c 1.2     11/13/90";
-#endif /* not lint */
-
 /*
  * Merge neighbors into queue, keeping it sorted.  "neighbors" is sorted,
  * both by lower bound cost and then by secondary cost.

diff --git a/src/lib/as/as_search.c b/src/lib/as/as_search.c
index fd88559257735ab1bd5df496071b7474b7799512..ba6188810b50461822dcd68d6aaf0a0e53b03a32 100644 (file)
--- a/src/lib/as/as_search.c
+++ b/src/lib/as/as_search.c
@@ -25,10 +25,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_search.c        1.2     11/13/90";
-#endif /* not lint */
-
 /*
  * Basic A* search function.  "adp" should have been initialized by
  * as_init (any previously allocated data will be freed by as_reset here),

diff --git a/src/lib/as/as_stats.c b/src/lib/as/as_stats.c
index af47a26fa13f0e740ccf0d7a01a68e04261f53c3..970077fa3dbf74f67d5aacbadb7e16a608840134 100644 (file)
--- a/src/lib/as/as_stats.c
+++ b/src/lib/as/as_stats.c
@@ -20,10 +20,6 @@
 #include <stdio.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_stats.c 1.2     11/13/90";
-#endif /* not lint */
-
 /*
  * Print statistics on algorithm performance to the file pointer "fp".
  */

diff --git a/src/lib/as/as_winnow.c b/src/lib/as/as_winnow.c
index aa8c395a41e1b4c46f1b94dc4d1c85917ae3d5b2..2fd79122160b8884e14f355972b10278f0d587bf 100644 (file)
--- a/src/lib/as/as_winnow.c
+++ b/src/lib/as/as_winnow.c
@@ -21,10 +21,6 @@
 #include <stdlib.h>
 #include "as.h"
 
-#if !defined(lint) && !defined(SABER)
-static char sccsid[] = "@(#)as_winnow.c        1.8     11/13/90";
-#endif /* not lint */
-
 static struct as_node *as_newnode(struct as_node *backp, struct as_coord c,
                                  double inclbcost, double lbcost,
                                  double knowncost, double seccost);