empire/empserver
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

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

Browse source
This commit is contained in:
Markus Armbruster 2004-03-01 13:33:51 +00:00
parent 98b392d72c
commit 5fa00591fe
9 changed files with 0 additions and 36 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/lib/as/as_costcomp.c
View file

@ -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.

4
src/lib/as/as_delete.c
View file

@ -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);
/*

4
src/lib/as/as_extend.c
View file

@ -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

4
src/lib/as/as_hash.c
View file

@ -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.

4
src/lib/as/as_init.c
View file

@ -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.

4
src/lib/as/as_merge.c
View file

@ -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.

4
src/lib/as/as_search.c
View file

@ -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),

4
src/lib/as/as_stats.c
View file

@ -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".
*/

4
src/lib/as/as_winnow.c
View file

@ -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);