2 Copyright (C) 2001-2006, William Joseph.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 #if !defined( INCLUDED_UNIQUENAMES_H )
23 #define INCLUDED_UNIQUENAMES_H
25 #include "debugging/debugging.h"
27 #include "string/string.h"
28 #include "generic/static.h"
35 Postfix( const char* postfix ) : m_value( atoi( postfix ) ){
37 unsigned int number() const {
40 void write( char* buffer ) const {
41 sprintf( buffer, "%u", m_value );
43 Postfix& operator++(){
47 bool operator<( const Postfix& other ) const {
48 return m_value < other.m_value;
50 bool operator==( const Postfix& other ) const {
51 return m_value == other.m_value;
53 bool operator!=( const Postfix& other ) const {
54 return !operator==( other );
61 std::pair<unsigned int, unsigned int> m_value;
63 Postfix( unsigned int number, unsigned int leading_zeros )
64 : m_value( leading_zeros, number ){
66 Postfix( const char* postfix )
67 : m_value( number_count_leading_zeros( postfix ), atoi( postfix ) ){
69 unsigned int number() const {
70 return m_value.second;
72 unsigned int leading_zeros() const {
75 void write( char* buffer ){
76 for ( unsigned int count = 0; count < m_value.first; ++count, ++buffer )
78 sprintf( buffer, "%u", m_value.second );
80 Postfix& operator++(){
82 if ( m_value.first != 0 && m_value.second % 10 == 0 ) {
87 bool operator<( const Postfix& other ) const {
88 return m_value < other.m_value;
90 bool operator==( const Postfix& other ) const {
91 return m_value == other.m_value;
93 bool operator!=( const Postfix& other ) const {
94 return !operator==( other );
100 typedef std::pair<CopiedString, Postfix> name_t;
102 inline void name_write( char* buffer, name_t name ){
103 strcpy( buffer, name.first.c_str() );
104 name.second.write( buffer + strlen( name.first.c_str() ) );
107 inline name_t name_read( const char* name ){
108 const char* end = name + strlen( name );
109 for ( const char* p = end; end != name; --p )
111 if ( strrchr( "1234567890", *p ) == NULL ) {
117 return name_t( CopiedString( StringRange( name, end ) ), Postfix( end ) );
124 typedef std::map<Postfix, unsigned int> postfixes_t;
125 postfixes_t m_postfixes;
128 Postfix find_first_empty() const {
129 Postfix postfix( "1" );
130 for ( postfixes_t::const_iterator i = m_postfixes.find( postfix ); i != m_postfixes.end(); ++i, ++postfix )
132 if ( ( *i ).first != postfix ) {
140 Postfix make_unique( Postfix postfix ) const {
141 postfixes_t::const_iterator i = m_postfixes.find( postfix );
142 if ( i == m_postfixes.end() ) {
147 return find_first_empty();
151 void insert( Postfix postfix ){
152 postfixes_t::iterator i = m_postfixes.find( postfix );
153 if ( i == m_postfixes.end() ) {
154 m_postfixes.insert( postfixes_t::value_type( postfix, 1 ) );
162 void erase( Postfix postfix ){
163 postfixes_t::iterator i = m_postfixes.find( postfix );
164 if ( i == m_postfixes.end() ) {
169 if ( --( *i ).second == 0 ) {
170 m_postfixes.erase( i );
176 return m_postfixes.empty();
183 typedef std::map<CopiedString, PostFixes> names_t;
186 name_t make_unique( const name_t& name ) const {
189 name_write( buf, name );
190 globalErrorStream() << "find unique name for " << buf << "\n";
191 globalErrorStream() << "> currently registered names:\n";
192 for ( names_t::const_iterator i = m_names.begin(); i != m_names.end(); ++i )
194 globalErrorStream() << ">> " << i->first.c_str() << ": ";
195 for ( PostFixes::postfixes_t::const_iterator j = i->second.m_postfixes.begin(); j != i->second.m_postfixes.end(); ++j )
197 j->first.write( buf );
198 globalErrorStream() << " '" << buf << "'";
200 globalErrorStream() << "\n";
202 names_t::const_iterator i = m_names.find( name.first );
203 if ( i == m_names.end() ) {
208 r = name_t( name.first, ( *i ).second.make_unique( name.second ) );
210 name_write( buf, r );
211 globalErrorStream() << "> unique name is " << buf << "\n";
215 void insert( const name_t& name ){
216 m_names[name.first].insert( name.second );
219 void erase( const name_t& name ){
220 names_t::iterator i = m_names.find( name.first );
221 if ( i == m_names.end() ) {
222 ASSERT_MESSAGE( true, "erase: name not found" );
226 ( *i ).second.erase( name.second );
227 if ( ( *i ).second.empty() ) {
234 return m_names.empty();
243 #define ERROR_MESSAGE( message )
247 void name_check_equal( const name_t& name, const char* string, unsigned int postfix ){
248 ASSERT_MESSAGE( strcmp( name.first.c_str(), string ) == 0
249 && name.second.number() == postfix,
252 void test_refcount(){
255 names.insert( name_t( "func_bleh_", "100" ) );
256 names.insert( name_t( "func_bleh_", "100" ) );
257 names.insert( name_t( "func_bleh_", "100" ) );
260 names.erase( name_t( "func_bleh_", "100" ) );
261 names.erase( name_t( "func_bleh_", "100" ) );
262 names.erase( name_t( "func_bleh_", "100" ) );
264 ASSERT_MESSAGE( names.empty(), "test failed!" );
267 void test_make_unique(){
271 name_t name( names.make_unique( name_t( "func_bleh_", "01" ) ) );
272 name_check_equal( name, "func_bleh_", 1 );
273 names.insert( name );
276 name_t name( names.make_unique( name_t( "func_bleh_", "04" ) ) );
277 name_check_equal( name, "func_bleh_", 4 );
278 names.insert( name );
281 name_t name( names.make_unique( name_t( "func_bleh_", "04" ) ) );
282 name_check_equal( name, "func_bleh_", 2 );
283 names.insert( name );
286 name_t name( names.make_unique( name_t( "func_bleh_", "1" ) ) );
287 name_check_equal( name, "func_bleh_", 3 );
288 names.insert( name );
291 name_t name( names.make_unique( name_t( "func_bleh_", "2" ) ) );
292 name_check_equal( name, "func_bleh_", 5 );
293 names.insert( name );
296 name_t name( names.make_unique( name_t( "func_bleh_", "3" ) ) );
297 name_check_equal( name, "func_bleh_", 6 );
298 names.insert( name );
301 names.erase( name_t( "func_bleh_", "1" ) );
302 names.erase( name_t( "func_bleh_", "2" ) );
303 names.erase( name_t( "func_bleh_", "3" ) );
304 names.erase( name_t( "func_bleh_", "4" ) );
305 names.erase( name_t( "func_bleh_", "5" ) );
306 names.erase( name_t( "func_bleh_", "6" ) );
308 ASSERT_MESSAGE( names.empty(), "test failed!" );
317 const TestUniqueName g_testuniquename;