Subversion Repositories tendra.SVN

Rev

Rev 2 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2 Rev 7
Line -... Line 1...
- 
 
 1 
/*
- 
 
 2 
 * Copyright (c) 2002-2006 The TenDRA Project <http://www.tendra.org/>.
- 
 
 3 
 * All rights reserved.
- 
 
 4 
 *
- 
 
 5 
 * Redistribution and use in source and binary forms, with or without
- 
 
 6 
 * modification, are permitted provided that the following conditions are met:
- 
 
 7 
 *
- 
 
 8 
 * 1. Redistributions of source code must retain the above copyright notice,
- 
 
 9 
 *    this list of conditions and the following disclaimer.
- 
 
 10 
 * 2. Redistributions in binary form must reproduce the above copyright notice,
- 
 
 11 
 *    this list of conditions and the following disclaimer in the documentation
- 
 
 12 
 *    and/or other materials provided with the distribution.
- 
 
 13 
 * 3. Neither the name of The TenDRA Project nor the names of its contributors
- 
 
 14 
 *    may be used to endorse or promote products derived from this software
- 
 
 15 
 *    without specific, prior written permission.
- 
 
 16 
 *
- 
 
 17 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
- 
 
 18 
 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
- 
 
 19 
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- 
 
 20 
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
- 
 
 21 
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- 
 
 22 
 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- 
 
 23 
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
- 
 
 24 
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
- 
 
 25 
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
- 
 
 26 
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
- 
 
 27 
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- 
 
 28 
 *
- 
 
 29 
 * $Id$
- 
 
 30 
 */
1 
/*
 31 
/*
2 
    		 Crown Copyright (c) 1997
 32 
    		 Crown Copyright (c) 1997
3
33 
 
4 
    This TenDRA(r) Computer Program is subject to Copyright
 34 
    This TenDRA(r) Computer Program is subject to Copyright
5 
    owned by the United Kingdom Secretary of State for Defence
 35 
    owned by the United Kingdom Secretary of State for Defence
6 
    acting through the Defence Evaluation and Research Agency
 36 
    acting through the Defence Evaluation and Research Agency
7 
    (DERA).  It is made available to Recipients with a
 37 
    (DERA).  It is made available to Recipients with a
8 
    royalty-free licence for its use, reproduction, transfer
 38 
    royalty-free licence for its use, reproduction, transfer
9 
    to other parties and amendment for any purpose not excluding
 39 
    to other parties and amendment for any purpose not excluding
10 
    product development provided that any such use et cetera
 40 
    product development provided that any such use et cetera
11 
    shall be deemed to be acceptance of the following conditions:-
 41 
    shall be deemed to be acceptance of the following conditions:-
12
42 
 
13 
        (1) Its Recipients shall ensure that this Notice is
 43 
        (1) Its Recipients shall ensure that this Notice is
14 
        reproduced upon any copies or amended versions of it;
 44 
        reproduced upon any copies or amended versions of it;
15
45 
 
16 
        (2) Any amended version of it shall be clearly marked to
 46 
        (2) Any amended version of it shall be clearly marked to
17 
        show both the nature of and the organisation responsible
 47 
        show both the nature of and the organisation responsible
18 
        for the relevant amendment or amendments;
 48 
        for the relevant amendment or amendments;
19
49 
 
20 
        (3) Its onward transfer from a recipient to another
 50 
        (3) Its onward transfer from a recipient to another
21 
        party shall be deemed to be that party's acceptance of
 51 
        party shall be deemed to be that party's acceptance of
22 
        these conditions;
 52 
        these conditions;
23
53 
 
24 
        (4) DERA gives no warranty or assurance as to its
 54 
        (4) DERA gives no warranty or assurance as to its
25 
        quality or suitability for any purpose and DERA accepts
 55 
        quality or suitability for any purpose and DERA accepts
26 
        no liability whatsoever in relation to any use to which
 56 
        no liability whatsoever in relation to any use to which
27 
        it may be put.
 57 
        it may be put.
28 
*/
 58 
*/
Line 64... Line 94...
64 
#include "solve-cycles.h"
 94 
#include "solve-cycles.h"
65 
 
 95 
 
66 
/*--------------------------------------------------------------------------*/
 96 
/*--------------------------------------------------------------------------*/
67 
 
 97 
 
68 
MapTableP
 98 
MapTableP
69 
map_table_create PROTO_Z ()
 99 
map_table_create(void)
70 
{
 100 
{
71 
    MapTableP table = ALLOCATE (MapTableT);
 101 
    MapTableP table = ALLOCATE(MapTableT);
72 
    unsigned  i;
 102 
    unsigned  i;
73 
 
 103 
 
74 
    for (i = 0; i < MAP_TABLE_SIZE; i ++) {
 104 
    for (i = 0; i < MAP_TABLE_SIZE; i++) {
75 
	table->contents [i] = NIL (MapEntryP);
 105 
	table->contents[i] = NIL(MapEntryP);
76 
    }
 106 
    }
77 
    return (table);
 107 
    return(table);
78 
}
 108 
}
79 
 
 109 
 
80 
MapEntryP
 110 
MapEntryP
81 
map_table_add PROTO_N ((table, key, count))
 111 
map_table_add(MapTableP table,		       NStringP  key,
82 
	      PROTO_T (MapTableP table X
 - 
 
83 
		       NStringP  key X
 - 
 
84 
		       unsigned  count)
 112 
		       unsigned  count)
85 
{
 113 
{
86 
    unsigned  hash_value = (nstring_hash_value (key) % MAP_TABLE_SIZE);
 114 
    unsigned  hash_value = (nstring_hash_value(key)% MAP_TABLE_SIZE);
87 
    MapEntryP next       = (table->contents [hash_value]);
 115 
    MapEntryP next       = (table->contents[hash_value]);
88 
    MapEntryP entry      = map_entry_create (key, next, count);
 116 
    MapEntryP entry      = map_entry_create(key, next, count);
89 
 
 117 
 
90 
    table->contents [hash_value] = entry;
 118 
    table->contents[hash_value] = entry;
91 
    return (entry);
 119 
    return(entry);
92 
}
 120 
}
93 
 
 121 
 
94 
MapEntryP
 122 
MapEntryP
95 
map_table_get PROTO_N ((table, key))
 123 
map_table_get(MapTableP table,		       NStringP  key)
96 
	      PROTO_T (MapTableP table X
 - 
 
97 
		       NStringP  key)
 - 
 
98 
{
 124 
{
99 
    unsigned  hash_value = (nstring_hash_value (key) % MAP_TABLE_SIZE);
 125 
    unsigned  hash_value = (nstring_hash_value(key)% MAP_TABLE_SIZE);
100 
    MapEntryP entry      = (table->contents [hash_value]);
 126 
    MapEntryP entry      = (table->contents[hash_value]);
101 
 
 127 
 
102 
    while (entry) {
 128 
    while (entry) {
103 
	if (nstring_equal (key, map_entry_key (entry))) {
 129 
	if (nstring_equal(key, map_entry_key(entry))) {
104 
	    return (entry);
 130 
	    return(entry);
105 
	}
 131 
	}
106 
	entry = map_entry_next (entry);
 132 
	entry = map_entry_next(entry);
107 
    }
 133 
    }
108 
    return (NIL (MapEntryP));
 134 
    return(NIL(MapEntryP));
109 
}
 135 
}
110 
 
 136 
 
111 
void
 137 
void
112 
map_table_iter PROTO_N ((table, proc, closure))
 138 
map_table_iter(MapTableP table,			void   (*proc)(MapEntryP, GenericP),
113 
	       PROTO_T (MapTableP table X
 - 
 
114 
			void    (*proc) PROTO_S ((MapEntryP, GenericP)) X
 - 
 
115 
			GenericP  closure)
 139 
			GenericP  closure)
116 
{
 140 
{
117 
    unsigned i;
 141 
    unsigned i;
118 
 
 142 
 
119 
    for (i = 0; i < MAP_TABLE_SIZE; i ++) {
 143 
    for (i = 0; i < MAP_TABLE_SIZE; i++) {
120 
	MapEntryP entry = (table->contents [i]);
 144 
	MapEntryP entry = (table->contents[i]);
121 
 
 145 
 
122 
	while (entry) {
 146 
	while (entry) {
123 
	    (*proc) (entry, closure);
 147 
	   (*proc)(entry, closure);
124 
	    entry = map_entry_next (entry);
 148 
	    entry = map_entry_next(entry);
125 
	}
 149 
	}
126 
    }
 150 
    }
127 
}
 151 
}
128
152
129 
/*
 153 
/*