comparison: src/stringtable.cc
src/stringtable.cc
- changeset 88
- 5def6ff8b466
- parent 87
- 8f65914e7046
- child 89
- 029a330a9bef
equal
deleted
inserted
replaced
| 87:8f65914e7046 | 88:5def6ff8b466 |
|---|---|
| 1 /* | |
| 2 Copyright 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 | |
| 7 are met: | |
| 8 | |
| 9 1. Redistributions of source code must retain the above copyright | |
| 10 notice, this list of conditions and the following disclaimer. | |
| 11 2. 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 3. The name of the author may not be used to endorse or promote products | |
| 15 derived from this software without specific prior written permission. | |
| 16 | |
| 17 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | |
| 18 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | |
| 19 OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | |
| 20 IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | |
| 21 INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | |
| 22 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | |
| 26 THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 */ | |
| 28 | |
| 29 #include <stdio.h> | |
| 30 #include <stdlib.h> | |
| 31 #include <string.h> | |
| 32 #include "stringtable.h" | |
| 33 | |
| 34 static string_list g_string_table; | |
| 35 | |
| 36 // ============================================================================ | |
| 37 // | |
| 38 const string_list& get_string_table() | |
| 39 { | |
| 40 return g_string_table; | |
| 41 } | |
| 42 | |
| 43 // ============================================================================ | |
| 44 // Potentially adds a string to the table and returns the index of it. | |
| 45 // | |
| 46 int get_string_table_index (const string& a) | |
| 47 { | |
| 48 // Must not be too long. | |
| 49 if (a.length() >= g_max_string_length) | |
| 50 error ("string `%1` too long (%2 characters, max is %3)\n", | |
| 51 a, a.length(), g_max_string_length); | |
| 52 | |
| 53 // Find a free slot in the table. | |
| 54 int idx; | |
| 55 | |
| 56 for (idx = 0; idx < g_string_table.size(); idx++) | |
| 57 { | |
| 58 // String is already in the table, thus return it. | |
| 59 if (g_string_table[idx] == a) | |
| 60 return idx; | |
| 61 } | |
| 62 | |
| 63 // Check if the table is already full | |
| 64 if (g_string_table.size() == g_max_stringlist_size - 1) | |
| 65 error ("too many strings!\n"); | |
| 66 | |
| 67 // Now, dump the string into the slot | |
| 68 g_string_table.push_back (a); | |
| 69 return (g_string_table.size() - 1); | |
| 70 } | |
| 71 | |
| 72 // ============================================================================ | |
| 73 // Counts the amount of strings in the table. | |
| 74 // | |
| 75 int num_strings_in_table() | |
| 76 { | |
| 77 return g_string_table.size(); | |
| 78 } |
