comparison: src/stringtable.cc
src/stringtable.cc
- changeset 75
- bf8c57437231
- child 81
- 071715c17296
equal
deleted
inserted
replaced
| 74:007fbadfa7f9 | 75:bf8c57437231 |
|---|---|
| 1 /* | |
| 2 Copyright (c) 2012-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 "stringtable.h" | |
| 35 | |
| 36 static string_list g_string_table; | |
| 37 | |
| 38 // ============================================================================ | |
| 39 // | |
| 40 const string_list& get_string_table() | |
| 41 { | |
| 42 return g_string_table; | |
| 43 } | |
| 44 | |
| 45 // ============================================================================ | |
| 46 // Potentially adds a string to the table and returns the index of it. | |
| 47 // | |
| 48 int get_string_table_index (const string& a) | |
| 49 { | |
| 50 // Must not be too long. | |
| 51 if (a.length() >= g_max_string_length) | |
| 52 error ("string `%1` too long (%2 characters, max is %3)\n", | |
| 53 a, a.length(), g_max_string_length); | |
| 54 | |
| 55 // Find a free slot in the table. | |
| 56 int idx; | |
| 57 | |
| 58 for (idx = 0; idx < g_string_table.size(); idx++) | |
| 59 { | |
| 60 // String is already in the table, thus return it. | |
| 61 if (g_string_table[idx] == a) | |
| 62 return idx; | |
| 63 } | |
| 64 | |
| 65 // Check if the table is already full | |
| 66 if (g_string_table.size() == g_max_stringlist_size - 1) | |
| 67 error ("too many strings!\n"); | |
| 68 | |
| 69 // Now, dump the string into the slot | |
| 70 g_string_table[idx] = a; | |
| 71 | |
| 72 return idx; | |
| 73 } | |
| 74 | |
| 75 // ============================================================================ | |
| 76 // Counts the amount of strings in the table. | |
| 77 // | |
| 78 int num_strings_in_table() | |
| 79 { | |
| 80 return g_string_table.size(); | |
| 81 } |
