summaryrefslogtreecommitdiff
path: root/indra/llcommon/llnametable.h
blob: 335a191be3f2a74cc97309cfae0c65956cc76c04 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
/** 
 * @file llnametable.h
 * @brief LLNameTable class is a table to associate pointers with string names
 *
 * $LicenseInfo:firstyear=2000&license=viewergpl$
 * 
 * Copyright (c) 2000-2009, Linden Research, Inc.
 * 
 * Second Life Viewer Source Code
 * The source code in this file ("Source Code") is provided by Linden Lab
 * to you under the terms of the GNU General Public License, version 2.0
 * ("GPL"), unless you have obtained a separate licensing agreement
 * ("Other License"), formally executed by you and Linden Lab.  Terms of
 * the GPL can be found in doc/GPL-license.txt in this distribution, or
 * online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
 * 
 * There are special exceptions to the terms and conditions of the GPL as
 * it is applied to this Source Code. View the full text of the exception
 * in the file doc/FLOSS-exception.txt in this software distribution, or
 * online at
 * http://secondlifegrid.net/programs/open_source/licensing/flossexception
 * 
 * By copying, modifying or distributing this software, you acknowledge
 * that you have read and understood your obligations described above,
 * and agree to abide by those obligations.
 * 
 * ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
 * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
 * COMPLETENESS OR PERFORMANCE.
 * $/LicenseInfo$
 */

#ifndef LL_LLNAMETABLE_H
#define LL_LLNAMETABLE_H

#include <map>

#include "string_table.h"

template <class DATA>
class LLNameTable
{
public:
	LLNameTable()
	:	mNameMap()
	{
	}

	~LLNameTable() 
	{ 
	}

	void addEntry(const std::string& name, DATA data)
	{
		addEntry(name.c_str(), data);
	}

	void addEntry(const char *name, DATA data)
	{
		char *tablename = gStringTable.addString(name);
		mNameMap[tablename] = data;
	}

	BOOL checkName(const std::string& name) const
	{
		return checkName(name.c_str());
	}

	// "logically const" even though it modifies the global nametable
	BOOL checkName(const char *name) const
	{
		char *tablename = gStringTable.addString(name);
		return mNameMap.count(tablename) ? TRUE : FALSE;
	}

	DATA resolveName(const std::string& name) const
	{
		return resolveName(name.c_str());
	}

	// "logically const" even though it modifies the global nametable
	DATA resolveName(const char *name) const
	{
		char *tablename = gStringTable.addString(name);
		const_iter_t iter = mNameMap.find(tablename);
		if (iter != mNameMap.end())
			return iter->second;
		else
			return 0;
	}

	// O(N)! (currently only used in one place... (newsim/llstate.cpp))
	const char *resolveData(const DATA &data) const
	{
		const_iter_t iter = mNameMap.begin();
		const_iter_t end = mNameMap.end();
		for (; iter != end; ++iter)
		{
			if (iter->second == data)
				return iter->first;
		}
   		return NULL;
	}		

	typedef std::map<const char *, DATA> name_map_t;
	typedef typename std::map<const char *,DATA>::iterator iter_t;
	typedef typename std::map<const char *,DATA>::const_iterator const_iter_t;
	name_map_t		mNameMap;
};

#endif