1 /* |
|
2 Copyright (c) 2013-2014, Santeri Piippo |
|
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 * Redistributions of source code must retain the above copyright |
|
9 notice, this list of conditions and the following disclaimer. |
|
10 |
|
11 * Redistributions in binary form must reproduce the above copyright |
|
12 notice, this list of conditions and the following disclaimer in the |
|
13 documentation and/or other materials provided with the distribution. |
|
14 |
|
15 * Neither the name of the <organization> nor the |
|
16 names of its contributors may be used to endorse or promote products |
|
17 derived from this software without specific prior written permission. |
|
18 |
|
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND |
|
20 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
|
21 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
|
22 DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY |
|
23 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
|
24 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
|
25 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
|
26 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
27 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
|
28 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
29 */ |
|
30 |
|
31 #include <stdio.h> |
|
32 #include <stdlib.h> |
|
33 #include <string.h> |
|
34 #include "main.h" |
|
35 #include "bots.h" |
|
36 #include "stringtable.h" |
|
37 |
|
38 static string_list g_string_table; |
|
39 |
|
40 // ============================================================================ |
|
41 // |
|
42 const string_list& get_string_table() |
|
43 { |
|
44 return g_string_table; |
|
45 } |
|
46 |
|
47 // ============================================================================ |
|
48 // Potentially adds a string to the table and returns the index of it. |
|
49 // |
|
50 int get_string_table_index (const string& a) |
|
51 { |
|
52 // Must not be too long. |
|
53 if (strlen (a) >= MAX_STRING_LENGTH) |
|
54 error ("string `%s` too long (%d characters, max is %d)\n", |
|
55 a.c_str(), a.length(), MAX_STRING_LENGTH); |
|
56 |
|
57 // Find a free slot in the table. |
|
58 int idx; |
|
59 |
|
60 for (idx = 0; idx < g_string_table.size(); idx++) |
|
61 { |
|
62 // String is already in the table, thus return it. |
|
63 if (g_string_table[idx] == a) |
|
64 return idx; |
|
65 } |
|
66 |
|
67 // Check if the table is already full |
|
68 if (g_string_table.size() == MAX_LIST_STRINGS - 1) |
|
69 error ("too many strings!\n"); |
|
70 |
|
71 // Now, dump the string into the slot |
|
72 g_string_table[idx] = a; |
|
73 |
|
74 return idx; |
|
75 } |
|
76 |
|
77 // ============================================================================ |
|
78 // Counts the amount of strings in the table. |
|
79 // |
|
80 int num_strings_in_table() |
|
81 { |
|
82 return g_string_table.size(); |
|
83 } |
|